@article {19706,
	title = {Surveying the Accessibility of Mobile Touchscreen Games for Persons with Motor Impairments: A Preliminary Analysis},
	journal = {terpconnect.umd.edu},
	year = {Submitted},
	abstract = {ABSTRACT Touchscreen devices have rapidly become one of the most pervasive video game platforms in the world and, in turn, an integral part of popular culture; however, little work exists on comprehensively examining their accessibility. In this poster paper, we ...},
	url = {http://terpconnect.umd.edu/~leahkf/pubs/ASSETS2013-TouchscreenGames.pdf},
	author = {Kim, Y and Sutreja, N and Jon Froehlich and Findlater, L}
}
@article {19559,
	title = {System and Method for Optimal Verification of Operations on Dynamic Sets},
	year = {Submitted},
	abstract = {A system and method for cryptographically checking the correctness of outsourced set operations performed by an untrusted server over a dynamic collection of sets that are owned (and updated) by a trusted source is disclosed. The system and method provides new authentication mechanisms that allow any entity to publicly verify a proof attesting the correctness of primitive set operations such as intersection, union, subset and set difference. Based on a novel extension of the security properties of bilinear-map accumulators as well as on a primitive called accumulation tree, the system and method achieves optimal verification and proof complexity, as well as optimal update complexity, while incurring no extra asymptotic space overhead. The method provides an efficient proof construction, adding a logarithmic overhead to the computation of the answer of a set-operation query. Applications of interest include efficient verification of keyword search and database queries.},
	url = {http://www.google.com/patents?id=mrcCAgAAEBAJ},
	author = {Charalampos Papamanthou and Tamassia, Roberto and Triandopoulos, Nikolaos}
}
@article {20296,
	title = {Satellites and Cell Phones Form a Cholera Early-Warning System},
	journal = {Eos},
	volume = {99},
	year = {2018},
	month = {Mar-03-2020},
	doi = {10.1029/2018EO094839},
	url = {https://eos.org/project-updates/satellites-and-cell-phones-form-a-cholera-early-warning-system},
	author = {Akanda, Ali and Aziz, Sonia and Jutla, Antarpreet and Huq, Anwar and Alam, Munirul and Ahsan, Gias and Rita R Colwell}
}
@article {20290,
	title = {Spores and soil from six sides: interdisciplinarity and the environmental biology of anthrax (<i>Bacillus anthracis</i>)},
	journal = {Biological Reviews},
	year = {2018},
	month = {Jan-11-2018},
	pages = {1813 - 1831},
	abstract = {Environmentally transmitted diseases are comparatively poorly understood and managed, and their ecology is particularly understudied. Here we identify challenges of studying environmental transmission and persistence with a six-sided interdisciplinary review of the biology of anthrax (Bacillus anthracis). Anthrax is a zoonotic disease capable of maintaining infectious spore banks in soil for decades (or even potentially centuries), and the mechanisms of its environmental persistence have been the topic of significant research and controversy. Where anthrax is endemic, it plays an important ecological role, shaping the dynamics of entire herbivore communities. The complex eco-epidemiology of anthrax, and the mysterious biology of Bacillus anthracis during its environmental stage, have necessitated an interdisciplinary approach to pathogen research. Here, we illustrate different disciplinary perspectives through key advances made by researchers working in Etosha National Park, a long-term ecological research site in Namibia that has exemplified the complexities of the enzootic process of anthrax over decades of surveillance. In Etosha, the role of scavengers and alternative routes (waterborne transmission and flies) has proved unimportant relative to the long-term persistence of anthrax spores in soil and their infection of herbivore hosts. Carcass deposition facilitates green-ups of vegetation to attract herbivores, potentially facilitated by the role of anthrax spores in the rhizosphere. The underlying seasonal pattern of vegetation, and herbivores{\textquoteright} immune and behavioural responses to anthrax risk, interact to produce regular {\textquoteleft}anthrax seasons{\textquoteright} that appear to be a stable feature of the Etosha ecosystem. Through the lens of microbiologists, geneticists, immunologists, ecologists, epidemiologists, and clinicians, we discuss how anthrax dynamics are shaped at the smallest scale by population genetics and interactions within the bacterial communities up to the broadest scales of ecosystem structure. We illustrate the benefits and challenges of this interdisciplinary approach to disease ecology, and suggest ways anthrax might offer insights into the biology of other important pathogens. Bacillus anthracis, and the more recently emerged Bacillus cereus biovar anthracis, share key features with other environmentally transmitted pathogens, including several zoonoses and panzootics of special interest for global health and conservation efforts. Understanding the dynamics of anthrax, and developing interdisciplinary research programs that explore environmental persistence, is a critical step forward for understanding these emerging threats. },
	doi = {10.1111/brv.12420},
	url = {https://onlinelibrary.wiley.com/doi/full/10.1111/brv.12420},
	author = {Carlson, Colin J. and Getz, Wayne M. and Kausrud, Kyrre L. and Cizauskas, Carrie A. and Blackburn, Jason K. and Bustos Carrillo, Fausto A. and Rita R Colwell and Easterday, W. Ryan and Ganz, Holly H. and Kamath, Pauline L. and {\O}kstad, Ole A. and Turner, Wendy C. and Kolsto, Anne-Brit and Stenseth, Nils C.}
}
@article {20316,
	title = {SYN-004 (ribaxamase), an oral beta-lactamase, mitigates antibiotic-mediated dysbiosis in a porcine gut microbiome model},
	journal = {Journal of Applied Microbiology},
	year = {2017},
	month = {Jan-07-2017},
	pages = {66 - 79},
	abstract = {
Aim

To evaluate an antibiotic inactivation strategy to protect the gut microbiome from antibiotic-mediated damage.
Methods and Results

SYN-004 (ribaxamase) is an orally delivered beta-lactamase intended to degrade penicillins and cephalosporins within the gastrointestinal tract to protect the microbiome. Pigs (20 kg, n = 10) were treated with ceftriaxone (CRO) (IV, 50 mg kg-1, SID) for 7 days and a cohort (n = 5) received ribaxamase (PO, 75 mg, QID) for 9 days beginning the day before antibiotic administration. Ceftriaxone serum levels were not statistically different in the antibiotic-alone and antibiotic + ribaxamase groups, indicating ribaxamase did not alter systemic antibiotic levels. Whole-genome metagenomic analyses of pig faecal DNA revealed that CRO caused significant changes to the gut microbiome and an increased frequency of antibiotic resistance genes. With ribaxamase, the gut microbiomes were not significantly different from pretreatment and antibiotic resistance gene frequency was not increased.
Conclusion

Ribaxamase mitigated CRO-mediated gut microbiome dysbiosis and attenuated propagation of the antibiotic resistance genes in pigs.
Significance and Impact of the Study

Damage of the microbiome can lead to overgrowth of pathogenic organisms and antibiotic exposure can promote selection for antibiotic-resistant micro-organisms. Ribaxamase has the potential to become the first therapy designed to protect the gut microbiome from antibiotic-mediated dysbiosis and reduce emergence of antibiotic resistance.
},
	doi = {10.1111/jam.13432},
	url = {https://onlinelibrary.wiley.com/doi/10.1111/jam.13432},
	author = {Connelly, S. and Bristol, J.A. and Hubert, S. and Subramanian, P. and Hasan, N.A. and Rita R Colwell and Kaleko, M.}
}
@article {20333,
	title = {Strategic Planning in Population Health and Public Health Practice: A Call to Action for Higher Education},
	journal = {The Milbank Quarterly},
	volume = {94906033},
	year = {2016},
	month = {Jan-03-2016},
	pages = {109 - 125},
	abstract = {POLICY POINTS:
Scarce resources, especially in population health and public health practice, underlie the importance of strategic planning. Public health agencies{\textquoteright} current planning and priority setting efforts are often narrow, at times opaque, and focused on single metrics such as cost-effectiveness. As demonstrated by SMART Vaccines, a decision support software system developed by the Institute of Medicine and the National Academy of Engineering, new approaches to strategic planning allow the formal incorporation of multiple stakeholder views and multicriteria decision making that surpass even those sophisticated cost-effectiveness analyses widely recommended and used for public health planning. Institutions of higher education can and should respond by building on modern strategic planning tools as they teach their students how to improve population health and public health practice.

CONTEXT:
Strategic planning in population health and public health practice often uses single indicators of success or, when using multiple indicators, provides no mechanism for coherently combining the assessments. Cost-effectiveness analysis, the most complex strategic planning tool commonly applied in public health, uses only a single metric to evaluate programmatic choices, even though other factors often influence actual decisions.

METHODS:
Our work employed a multicriteria systems analysis approach--specifically, multiattribute utility theory--to assist in strategic planning and priority setting in a particular area of health care (vaccines), thereby moving beyond the traditional cost-effectiveness analysis approach.

FINDINGS:
(1) Multicriteria systems analysis provides more flexibility, transparency, and clarity in decision support for public health issues compared with cost-effectiveness analysis. (2) More sophisticated systems-level analyses will become increasingly important to public health as disease burdens increase and the resources to deal with them become scarcer.

CONCLUSIONS:
The teaching of strategic planning in public health must be expanded in order to fill a void in the profession{\textquoteright}s planning capabilities. Public health training should actively incorporate model building, promote the interactive use of software tools, and explore planning approaches that transcend restrictive assumptions of cost-effectiveness analysis. The Strategic Multi-Attribute Ranking Tool for Vaccines (SMART Vaccines), which was recently developed by the Institute of Medicine and the National Academy of Engineering to help prioritize new vaccine development, is a working example of systems analysis as a basis for decision support.},
	doi = {10.1111/1468-0009.12182},
	url = {https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4941964/},
	author = {Phelps, Charles and Madhavan, Guruprasad and Rappuoli, Rino and LEVIN, SCOTT and Shortlife, Edward and Rita R Colwell}
}
@article {20342,
	title = {Satellite Based Assessment of Hydroclimatic Conditions Related to Cholera in Zimbabwe},
	journal = {PLOS ONE},
	year = {2015},
	month = {May-09-2017},
	pages = {e0137828},
	abstract = {Introduction
Cholera, an infectious diarrheal disease, has been shown to be associated with large scale hydroclimatic processes. The sudden and sporadic occurrence of epidemic cholera is linked with high mortality rates, in part, due to uncertainty in timing and location of outbreaks. Improved understanding of the relationship between pathogenic abundance and climatic processes allows prediction of disease outbreak to be an achievable goal. In this study, we show association of large scale hydroclimatic processes with the cholera epidemic in Zimbabwe reported to have begun in Chitungwiza, a city in Mashonaland East province, in August, 2008.

Principal Findings
Climatic factors in the region were found to be associated with triggering cholera outbreak and are shown to be related to anomalies of temperature and precipitation, validating the hypothesis that poor conditions of sanitation, coupled with elevated temperatures, and followed by heavy rainfall can initiate outbreaks of cholera. Spatial estimation by satellite of precipitation and global gridded air temperature captured sensitivities in hydroclimatic conditions that permitted identification of the location in the region where the disease outbreak began.

Discussion
Satellite derived hydroclimatic processes can be used to capture environmental conditions related to epidemic cholera, as occurred in Zimbabwe, thereby providing an early warning system. Since cholera cannot be eradicated because the causative agent, Vibrio cholerae, is autochthonous to the aquatic environment, prediction of conditions favorable for its growth and estimation of risks of triggering the disease in a given population can be used to alert responders, potentially decreasing infection and saving lives.
},
	doi = {10.1371/journal.pone.0137828},
	url = {https://dx.plos.org/10.1371/journal.pone.0137828},
	author = {Jutla, Antarpreet and Aldaach, Haidar and Billian, Hannah and Akanda, Ali and Huq, Anwar and Rita R Colwell},
	editor = {Schumann, Guy J-P.}
}
@conference {20067,
	title = {Segmentation and sub-cellular feature-based analysis of microscopy images},
	booktitle = {BioImage Informatics Conference },
	year = {2015},
	month = {10/2015},
	author = {Cardone, Antonio and Chalfoun, Joe and Peskin, Adele and Bajcsy, Peter and Kociolek, Marcin and Bhadriraju, Kiran and Brady, Mary}
}
@article {20062,
	title = {Survey statistics of automated segmentations applied to optical imaging of mammalian cells},
	journal = {BMC bioinformatics},
	volume = {16},
	year = {2015},
	pages = {1},
	author = {Bajcsy, Peter and Cardone, Antonio and Chalfoun, Joe and Halter, Michael and Juba, Derek and Kociolek, Marcin and Majurski, Michael and Peskin, Adele and Simon, Carl and Simon, Mylene and others}
}
@article {19669,
	title = {Stable isotope labeling of phosphoproteins for large-scale phosphorylation rate determination},
	journal = {Molecular \& Cellular Proteomics},
	year = {2014},
	month = {2014/02/16/},
	abstract = {Signals that control response to stimuli and cellular function are transmitted through dynamic phosphorylation of thousands of proteins by protein kinases. Many techniques have been developed to study phosphorylation dynamics, including several mass spectrometry (MS)-based methods. Over the last few decades, substantial developments have been made in MS techniques for the large-scale identification of proteins and their post-translational modifications. Nevertheless, all of the current MS-based techniques for quantifying protein phosphorylation dynamics rely on the measurement of changes in peptide abundance levels and many methods suffer from low confidence in phosphopeptide identification due to poor fragmentation. Here we have optimized an approach for the Stable Isotope Labeling of Amino acids by Phosphate (SILAP) using [gamma-18O4]ATP in nucleo to determine global site-specific phosphorylation rates. The advantages of this metabolic labeling technique are: increased confidence in phosphorylated peptide identification, direct labeling of phosphorylation sites, measurement phosphorylation rates, and the identification of actively phosphorylated sites in a cell-like environment. In this study we calculated approximate rate constants for over 500 phosphorylation sites based on labeling progress curves. We measured a wide range of phosphorylation rate constants from 0.34 min-1 to 0.001 min-1. Finally, we applied SILAP to determine sites that have different phosphorylation kinetics during G1/S and M phase. We found that most sites have very similar phosphorylation rates under both conditions; however a small subset of sites on proteins involved in the mitotic spindle were more actively phosphorylated during M phase, while proteins involved in DNA replication and transcription were more actively phosphorylated during G1/S phase.},
	keywords = {DYNAMICS, Phosphoproteins*, Phosphoproteome, Phosphorylation, Post-translational modifications*, Signal Transduction*, turnover},
	isbn = {1535-9476, 1535-9484},
	url = {http://www.mcponline.org/content/early/2014/02/16/mcp.O113.036145},
	author = {Molden, Rosalynn C. and Goya, Jonathan and Zia Khan and Garcia, Benjamin A.}
}
@article {19697,
	title = {Scene Text Detection via Integrated Discrimination of Component Appearance and Consensus},
	year = {2013},
	month = {0002/00/03},
	abstract = {Abstract{\textemdash}In this paper, we propose an approach to scene text detection that leverages both the appearance and consensus of connected components. Component appearance is modeled with an SVM based dictionary classifier and the component consensus is ...},
	url = {http://lampsrv02.umiacs.umd.edu/pubs/Papers/qixiangye-13/qixiangye-13.pdf},
	author = {Ye, Q and David Doermann}
}
@article {19371,
	title = {Segmenting time-lapse phase contrast images of adjacent NIH 3T3 cells.},
	journal = {Journal of microscopy},
	volume = {249},
	year = {2013},
	month = {2013 Jan},
	pages = {41-52},
	abstract = {We present a new method for segmenting phase contrast images of NIH 3T3 fibroblast cells that is accurate even when cells are physically in contact with each other. The problem of segmentation, when cells are in contact, poses a challenge to the accurate automation of cell counting, tracking and lineage modelling in cell biology. The segmentation method presented in this paper consists of (1) background reconstruction to obtain noise-free foreground pixels and (2) incorporation of biological insight about dividing and nondividing cells into the segmentation process to achieve reliable separation of foreground pixels defined as pixels associated with individual cells. The segmentation results for a time-lapse image stack were compared against 238 manually segmented images (8219 cells) provided by experts, which we consider as reference data. We chose two metrics to measure the accuracy of segmentation: the {\textquoteright}Adjusted Rand Index{\textquoteright} which compares similarities at a pixel level between masks resulting from manual and automated segmentation, and the {\textquoteright}Number of Cells per Field{\textquoteright} (NCF) which compares the number of cells identified in the field by manual versus automated analysis. Our results show that the automated segmentation compared to manual segmentation has an average adjusted rand index of 0.96 (1 being a perfect match), with a standard deviation of 0.03, and an average difference of the two numbers of cells per field equal to 5.39\% with a standard deviation of 4.6\%.},
	keywords = {Animals, Cell Adhesion, Cell Count, Cell Division, Cell Shape, Computational Biology, Fibroblasts, Image Processing, Computer-Assisted, Mice, Microscopy, Phase-Contrast, NIH 3T3 Cells, Reproducibility of results, Sensitivity and Specificity, Time-Lapse Imaging},
	issn = {1365-2818},
	doi = {10.1111/j.1365-2818.2012.03678.x},
	author = {Chalfoun, J and Kociolek, M and Dima, A and Halter, M and Cardone, Antonio and Peskin, A and Bajcsy, P and Brady, M.}
}
@inbook {19603,
	title = {Signatures of Correct Computation},
	booktitle = {Theory of Cryptography},
	series = {Lecture Notes in Computer Science},
	year = {2013},
	month = {2013/01/01/},
	pages = {222 - 242},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We introduce Signatures of Correct Computation (SCC), a new model for verifying dynamic computations in cloud settings. In the SCC model, a trusted source outsources a function f to an untrusted server, along with a public key for that function (to be used during verification). The server can then produce a succinct signature σ vouching for the correctness of the computation of f, i.e., that some result v is indeed the correct outcome of the function f evaluated on some point a. There are two crucial performance properties that we want to guarantee in an SCC construction: (1) verifying the signature should take asymptotically less time than evaluating the function f; and (2) the public key should be efficiently updated whenever the function changes. We construct SCC schemes (satisfying the above two properties) supporting expressive manipulations over multivariate polynomials, such as polynomial evaluation and differentiation. Our constructions are adaptively secure in the random oracle model and achieve optimal updates, i.e., the function{\textquoteright}s public key can be updated in time proportional to the number of updated coefficients, without performing a linear-time computation (in the size of the polynomial). We also show that signatures of correct computation imply Publicly Verifiable Computation (PVC), a model recently introduced in several concurrent and independent works. Roughly speaking, in the SCC model, any client can verify the signature σ and be convinced of some computation result, whereas in the PVC model only the client that issued a query (or anyone who trusts this client) can verify that the server returned a valid signature (proof) for the answer to the query. Our techniques can be readily adapted to construct PVC schemes with adaptive security, efficient updates and without the random oracle model.},
	keywords = {Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Data Encryption, Systems and Data Security},
	isbn = {978-3-642-36593-5, 978-3-642-36594-2},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-36594-2_13},
	author = {Charalampos Papamanthou and Shi, Elaine and Tamassia, Roberto},
	editor = {Sahai, Amit}
}
@article {20373,
	title = {Species composition of limnetic zooplankton from the southern coastal areas (Mathbaria and Bakerganj) in Bangladesh},
	journal = {Journal of the Asiatic Society of Bangladesh, Science},
	volume = {38},
	year = {2013},
	month = {Apr-06-2014},
	abstract = {We studied the coastal zooplankton community structure of six waterbodies of Mathbaria and Bakerganj from January 2008 to June 2009. In total 35 zooplankton species were identified under 26 genera under 20 families under 8 orders from Mathbaria. Among them 6 were protozoans, 24 were rotifers, 3 were copepods, 1 was cladocerans and 1 was ostracods. From Bakergonj a total of 42 zooplankton species were identified under 23 genera under 17 Families under 7 orders. Among them 3 were protozoans, 25 were rotifers, 7 were copepods, 6 were cladocerans and 1 was ostracods. Results showed that abundance of rotifera group from both area was higher in Mathbaria (64.86\%) and Bakerganj (60.98\%) than other groups while abundance of ostracoda of Bakerganj area was lowest.},
	issn = {1016-6947},
	doi = {10.3329/jasbs.v38i1.15326},
	url = {http://banglajol.info/index.php/JASBS/article/view/15326},
	author = {Mozumder, Pronob K and Nahar, Samsun and Naser, M Niamul and Alam, Munirul and Huq, Anwar and Sack, R Bradley and Rita R Colwell}
}
@article {19413,
	title = {Specific and Non-Specific Protein Association in Solution: Computation of Solvent Effects and Prediction of First-Encounter Modes for Efficient Configurational Bias Monte Carlo Simulations},
	journal = {The Journal of Physical Chemistry B},
	volume = {117},
	year = {2013},
	month = {May-10-2014},
	pages = {12360 - 12374},
	issn = {1520-6106},
	doi = {10.1021/jp4050594},
	url = {http://pubs.acs.org/doi/abs/10.1021/jp4050594},
	author = {Cardone, Antonio and Pant, Harish and Hassan, Sergio A.}
}
@article {19688,
	title = {Spoiler Alert: Machine Learning Approaches to Detect Social Media Posts with Revelatory Information},
	year = {2013},
	month = {2013/00/01},
	abstract = {ABSTRACT Spoilers{\textemdash}critical plot information about works of fiction that {\textquotedblleft}spoil{\textquotedblright} a viewer{\textquoteright}s enjoyment{\textemdash}have prompted elaborate conventions on social media to allow readers to insulate themselves from spoilers. However, these solutions depend on the ...},
	url = {http://www.umiacs.umd.edu/~jbg/docs/2013_spoiler.pdf},
	author = {Jordan Boyd-Graber and Glasgow, K and Zajac, J S}
}
@inbook {19613,
	title = {Streaming Authenticated Data Structures},
	booktitle = {Advances in Cryptology {\textendash} EUROCRYPT 2013},
	series = {Lecture Notes in Computer Science},
	year = {2013},
	month = {2013/01/01/},
	pages = {353 - 370},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We consider the problem of streaming verifiable computation, where both a verifier and a prover observe a stream of n elements x 1,x 2,{\textellipsis},x n and the verifier can later delegate some computation over the stream to the prover. The prover must return the output of the computation, along with a cryptographic proof to be used for verifying the correctness of the output. Due to the nature of the streaming setting, the verifier can only keep small local state (e.g., logarithmic) which must be updatable in a streaming manner and with no interaction with the prover. Such constraints make the problem particularly challenging and rule out applying existing verifiable computation schemes. We propose streaming authenticated data structures, a model that enables efficient verification of data structure queries on a stream. Compared to previous work, we achieve an exponential improvement in the prover{\textquoteright}s running time: While previous solutions have linear prover complexity (in the size of the stream), even for queries executing in sublinear time (e.g., set membership), we propose a scheme with O(logM logn)O(\log M\ log n) prover complexity, where n is the size of the stream and M is the size of the universe of elements. Our schemes support a series of expressive queries, such as (non-)membership, successor, range search and frequency queries, over an ordered universe and even in higher dimensions. The central idea of our construction is a new authentication tree, called generalized hash tree. We instantiate our generalized hash tree with a hash function based on lattices assumptions, showing that it enjoys suitable algebraic properties that traditional Merkle trees lack. We exploit such properties to achieve our results.},
	keywords = {Algorithm Analysis and Problem Complexity, Data Encryption, Discrete Mathematics in Computer Science, Systems and Data Security},
	isbn = {978-3-642-38347-2, 978-3-642-38348-9},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-38348-9_22},
	author = {Charalampos Papamanthou and Shi, Elaine and Tamassia, Roberto and Yi, Ke},
	editor = {Johansson, Thomas and Nguyen, Phong Q.}
}
@article {19694,
	title = {Structural similarity for document image classification and retrieval},
	journal = {Pattern Recognition Letters},
	year = {2013},
	month = {2013/00/01},
	abstract = {Abstract This paper presents a novel approach to defining document image structural similarity for the applications of classification and retrieval. We first build a codebook of SURF descriptors extracted from a set of representative training images. We then encode ...},
	doi = {10.1016/j.patrec.2013.10.030},
	url = {http://linkinghub.elsevier.com/retrieve/pii/S0167865513004224},
	author = {Kumar, Jayant and Ye, Peng and David Doermann}
}
@article {19485,
	title = {A study of unpredictability in fault-tolerant middleware},
	journal = {Computer Networks},
	volume = {57},
	year = {2013},
	month = {2013/02/26/},
	pages = {682 - 698},
	abstract = {In enterprise applications relying on fault-tolerant middleware, it is a common engineering practice to establish service-level agreements (SLAs) based on the 95th or the 99th percentiles of the latency, to allow a margin for unexpected variability. However, the extent of this unpredictability has not been studied systematically. We present an extensive empirical study of unpredictability in 16 distributed systems, ranging from simple transport protocols to fault-tolerant, middleware-based enterprise applications, and we show that the inherent unpredictability in the systems examined arises from at most 1\% of the remote invocations. In the normal, fault-free operating mode most remote invocations have a predictable end-to-end latency, but the maximum latency follows unpredictable trends and is comparable with the time needed to recover from a fault. The maximum latency is not influenced by the system{\textquoteright}s workload, cannot be regulated through configuration parameters and is not correlated with the system{\textquoteright}s resource consumption. The high-latency outliers (up to three orders of magnitude higher than the average latency) have multiple causes and may originate in any component of the system. However, after filtering out 1\% of the invocations with the highest recorded response-times, the latency becomes bounded with high statistical confidence (p \&lt; 0.01). We have verified this result on different operating systems (Linux 2.4, Linux 2.6, Linux-rt, TimeSys), middleware platforms (CORBA and EJB), programming languages (C, C++ and Java), replication styles (active and warm passive) and applications (e-commerce and online gaming). Moreover, this phenomenon occurs at all the layers of middleware-based systems, from the communication protocols to the business logic.},
	keywords = {Fault tolerance, latency, Middleware, Remote procedure call, Unpredictability},
	isbn = {1389-1286},
	url = {http://www.sciencedirect.com/science/article/pii/S1389128612003696},
	author = {Tudor Dumitras and Narasimhan, Priya}
}
@book {19356,
	title = {Scientific Freedom and Human Rights},
	year = {2012},
	month = {2012},
	pages = {564},
	publisher = {IEEE Computer Society Press},
	organization = {IEEE Computer Society Press},
	abstract = {There is a great deal of difference between feeling empathy for those whose human rights are being violated around the world and actually doing something about it. This memoir, written by the Vice-Chair Computer Science (CS) of the Committee of Concerned Scientists (CCS), 1962-present, and Vice-Chair of the Committee on Scientific Freedom and Human Rights (CSFHR) of the ACM, 1980-1989, is a first-hand account of computer scientists working with numerous other constituencies to safeguard or advance the human rights of scientists throughout the world. Drawing from the author{\textquoteright}s considerable archives from the period, "Scientific Freedom and Human Rights" is a treasure trove of historical information about a critical -- and relatively unsung -- human rights campaign, its successes and heartbreaking challenges, and possible lessons to be applied to future human rights campaigns. "The solidarity of the global scientific community was especially important in giving moral support to the intellectual leaders of the struggle for Soviet Jewry, helping them to continue their scientific activity even in a time of persecution. Their activism also helped to link scientific cooperation with the Soviet Union with freedom within the Soviet Union.... You will read these stories and see the support given many scientists throughout the world in this book." -- Natan Sharansky, Jewish Agency Chairman of the Executive "It is not very often that solidarity among scientists is brought to the public eye, and it is certainly not common for people outside science to associate scientists with heroic struggles for human rights, freedom, and dignity. Jack Minker{\textquoteright}s new book will change this perception." -- Professor Judea Pearl, University of California at Los Angeles},
	keywords = {Biography \& Autobiography / Science \& Technology},
	isbn = {9780769546605},
	author = {Minker, Jack}
}
@article {15182,
	title = {Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces},
	journal = {Topics in Cryptology{\textendash}CT-RSA 2012},
	year = {2012},
	month = {2012///},
	pages = {416 - 432},
	abstract = {Protocols for generic secure multi-party computation (MPC) generally come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit over a large field. Either type of protocol can be used for any function, but the choice of which protocol to use can have a significant impact on efficiency. The magnitude of the effect, however, has never been quantified.With this in mind, we implement the MPC protocol of Goldreich, Micali, and Wigderson [13], which uses a boolean representation and is secure against a semi-honest adversary corrupting any number of parties. We then consider applications of secure MPC in on-line marketplaces, where customers select resources advertised by providers and it is desired to ensure privacy to the extent possible. Problems here are more naturally formulated in terms of boolean circuits, and we study the performance of our MPC implementation relative to existing ones that use an arithmetic-circuit representation. Our protocol easily handles tens of customers/providers and thousands of resources, and outperforms existing implementations including FairplayMP [3], VIFF [11], and SEPIA [7].
},
	doi = {10.1007/978-3-642-27954-6_26},
	author = {Choi,S. and Hwang,K.W. and Katz, Jonathan and Malkin,T. and Rubenstein,D.}
}
@inbook {19644,
	title = {Securing Circuits against Constant-Rate Tampering},
	booktitle = {Advances in Cryptology {\textendash} CRYPTO 2012},
	series = {Lecture Notes in Computer Science},
	year = {2012},
	month = {2012/01/01/},
	pages = {533 - 551},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et. al. (Eurocrypt 2006), we consider adversaries who may choose an arbitrary set of wires to corrupt, and may set each such wire to 0 or to 1, or may toggle with the wire. We prove that such adversaries, who continuously tamper with the circuit, can learn at most logarithmically many bits of secret information (in addition to black-box access to the circuit). Our results are information theoretic.},
	keywords = {circuit compiler, Computer Communication Networks, computers and society, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, PCP of proximity, side-channel attacks, Systems and Data Security, tampering},
	isbn = {978-3-642-32008-8, 978-3-642-32009-5},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-32009-5_31},
	author = {Dana Dachman-Soled and Kalai, Yael Tauman},
	editor = {Safavi-Naini, Reihaneh and Canetti, Ran}
}
@conference {19314,
	title = {Sharpness Estimation for Document and Scene Images},
	booktitle = {International Conference on Pattern Recognition (ICPR 2012)},
	year = {2012},
	pages = {3292-3295},
	abstract = {Images of document pages have different characteristics than images of natural scenes, and so the sharpness measures developed for natural scene images do not necessarily extend to document images primarily composed of text. We present an efficient and simple method for effectively estimating the sharpness/ blurriness of document images that also performs well on natural scenes. Our method can be used to predict the sharpness in scenarios where images are blurred due to camera-motion (or hand-shake), defocus, or inherent properties of the imaging system. The proposed method outperforms the perceptually-based, no-reference sharpness work of [1] and [4], which was shown to perform better than 14 other no-reference sharpness measures on the LIVE dataset.},
	author = {Kumar,Jayant and Chen, Francine and David Doermann}
}
@article {12421,
	title = {SITS: A Hierarchical Nonparametric Model using Speaker Identity for Topic Segmentation in Multiparty Conversations},
	journal = {Association for Computational Linguistics},
	year = {2012},
	month = {2012///},
	abstract = {One of the key tasks for analyzing conversa- tional data is segmenting it into coherent topic segments. However, most models of topic segmentation ignore the social aspect of con- versations, focusing only on the words used. We introduce a hierarchical Bayesian nonpara- metric model, Speaker Identity for Topic Seg- mentation (SITS), that discovers (1) the top- ics used in a conversation, (2) how these top- ics are shared across conversations, (3) when these topics shift, and (4) a person-specific tendency to introduce new topics. We eval- uate against current unsupervised segmenta- tion models to show that including person- specific information improves segmentation performance on meeting corpora and on po- litical debates. Moreover, we provide evidence that SITS captures an individual{\textquoteright}s tendency to introduce new topics in political contexts, via analysis of the 2008 US presidential debates and the television program Crossfire.},
	author = {Nguyen,Viet-An and Jordan Boyd-Graber and Resnik, Philip}
}
@article {17929,
	title = {Speeding Up Particle Trajectory Simulations under Moving Force Fields using GPUs},
	journal = {Journal of Computing and Information Science in Engineering},
	year = {2012},
	month = {2012///},
	abstract = {In this paper, we introduce a GPU-based framework forsimulating particle trajectories under both static and dynamic
force fields. By exploiting the highly parallel nature of the
problem and making efficient use of the available hardware,
our simulator exhibits a significant speedup over its CPU-
based analog. We apply our framework to a specific experi-
mental simulation: the computation of trapping probabilities
associated with micron-sized silica beads in optical trapping
workbenches. When evaluating large numbers of trajectories
(4096), we see approximately a 356 times speedup of the
GPU-based simulator over its CPU-based counterpart.
},
	author = {Patro,R. and Dickerson,J. P. and Bista,S. and Gupta,S.K. and Varshney, Amitabh}
}
@article {18716,
	title = {Structural and biochemical studies of the open state of Lys48-linked diubiquitin},
	journal = {Biochimica et Biophysica Acta (BBA) - Molecular Cell Research},
	year = {2012},
	month = {2012///},
	abstract = {Ubiquitin (Ub) is a small protein highly conserved among eukaryotes and involved in practically all aspects of eukaryotic cell biology. Polymeric chains assembled from covalently-linked Ub monomers function as molecular signals in the regulation of a host of cellular processes. Our previous studies have shown that the predominant state of Lys48-linked di- and tetra-Ub chains at near-physiological conditions is a closed conformation, in which the Ub{\textendash}Ub interface is formed by the hydrophobic surface residues of the adjacent Ub units. Because these very residues are involved in (poly)Ub interactions with the majority of Ub-binding proteins, their sequestration at the Ub{\textendash}Ub interface renders the closed conformation of polyUb binding incompetent. Thus the existence of open conformation(s) and the interdomain motions opening and closing the Ub{\textendash}Ub interface is critical for the recognition of Lys48-linked polyUb by its receptors. Knowledge of the conformational properties of a polyUb signal is essential for our understanding of its specific recognition by various Ub-receptors. Despite their functional importance, open states of Lys48-linked chains are poorly characterized. Here we report a crystal structure of the open state of Lys48-linked di-Ub. Moreover, using NMR, we examined interactions of the open state of this chain (at pH4.5) with a Lys48-linkage-selective receptor, the UBA2 domain of a shuttle protein hHR23a. Our results show that di-Ub binds UBA2 in the same mode and with comparable affinity as the closed state. Our data suggest a mechanism for polyUb signal recognition, whereby Ub-binding proteins select specific conformations out of the available ensemble of polyUb chain conformations. This article is part of a Special Issue entitled: Ubiquitin Drug Discovery and Diagnostics.},
	keywords = {Lys48-linked diubiquitin, Lysine-48 linkage selectivity, polyubiquitin, ubiquitin, Ubiquitin-associated domain},
	isbn = {0167-4889},
	doi = {10.1016/j.bbamcr.2012.04.003},
	url = {http://www.sciencedirect.com/science/article/pii/S0167488912000948},
	author = {Lai,Ming-Yih and Zhang,Daoning and LaRonde-LeBlanc,Nicole and Fushman, David}
}
@article {19132,
	title = {Structure, function and diversity of the healthy human microbiome},
	journal = {Nature},
	volume = {486},
	year = {2012},
	month = {2012},
	pages = {207 - 214},
	abstract = {Studies of the human microbiome have revealed that even healthy individuals differ remarkably in the microbes that occupy habitats such as the gut, skin and vagina. Much of this diversity remains unexplained, although diet, environment, host genetics and early microbial exposure have all been implicated. Accordingly, to characterize the ecology of human-associated microbial communities, the Human Microbiome Project has analysed the largest cohort and set of distinct, clinically relevant body habitats so far. We found the diversity and abundance of each habitat{\textquoteright}s signature microbes to vary widely even among healthy subjects, with strong niche specialization both within and among individuals. The project encountered an estimated 81{\textendash}99\% of the genera, enzyme families and community configurations occupied by the healthy Western microbiome. Metagenomic carriage of metabolic pathways was stable among individuals despite variation in community structure, and ethnic/racial background proved to be one of the strongest associations of both pathways and microbes with clinical metadata. These results thus delineate the range of structural and functional configurations normal in the microbial communities of a healthy population, enabling future characterization of the epidemiology, ecology and translational applications of the human microbiome.},
	author = {Huttenhower, C. and Gevers, D. and Knight,R. and Abubucker, S. and Badger, J.H. and Chinwalla, A.T. and Creasy, H.H. and Earl, A.M. and Fitzgerald, M.G. and Fulton, R.S. and others}
}
@conference {19374,
	title = {Sub-cellular feature detection and automated extraction of collocalized actin and myosin regions},
	booktitle = {the 2nd ACM SIGHIT symposiumProceedings of the 2nd ACM SIGHIT symposium on International health informatics - IHI {\textquoteright}12},
	year = {2012},
	pages = {399},
	publisher = {ACM Press},
	organization = {ACM Press},
	address = {Miami, Florida, USANew York, New York, USA},
	isbn = {9781450307819},
	doi = {10.1145/211036310.1145/2110363.2110409},
	author = {Martineau, Justin and Mokashi,Ronil and Chapman, David and Grasso, Michael and Brady,Mary and Yesha,Yelena and Yesha,Yaacov and Cardone, Antonio and Dima, Alden}
}
@conference {15059,
	title = {Submodular Dictionary Learning for Sparse Coding},
	booktitle = {IEEE conference on Computer Vision and Pattern Recognition},
	year = {2012},
	month = {2012///},
	abstract = {A greedy-based approach to learn a compact and dis-criminative dictionary for sparse representation is pre-
sented. We propose an objective function consisting of two
components: entropy rate of a random walk on a graph
and a discriminative term. Dictionary learning is achieved
by finding a graph topology which maximizes the objec-
tive function. By exploiting the monotonicity and submod-
ularity properties of the objective function and the matroid
constraint, we present a highly efficient greedy-based op-
timization algorithm. It is more than an order of magni-
tude faster than several recently proposed dictionary learn-
ing approaches. Moreover, the greedy algorithm gives a
near-optimal solution with a (1/2)-approximation bound.
Our approach yields dictionaries having the property that
feature points from the same class have very similar sparse
codes. Experimental results demonstrate that our approach
outperforms several recently proposed dictionary learning
techniques for face, action and object category recognition.
},
	author = {Zhuolin Jiang and Zhang, G. and Davis, Larry S.}
}
@article {19220,
	title = {Systems and Methods for Energy Harvesting in a Contained Fluid Circuit},
	year = {2012},
	month = {2012},
	publisher = {UNIVERSITY OF WASHINGTON THROUGH ITS CENTER FOR COMMERCIALIZATION, CAMPBELL, Tim, LARSON, Eric, COHN, Gabriel, ALCAIDE, Ramses, FROEHLICH, Jon, PATEL, Shwetak},
	abstract = {Systems and methods for harvesting energy from a closed fluid circuit, such as a water pipe system in a building. An energy harvester can be installed at a point in a water circuit and can generate energy from pressure differentials caused when a valve is opened or closed at any other point in the water circuit that is in fluid communication with the energy harvester. The energy can be used to power, for example, a sensor and/or a transmitter., L{\textquoteright}invention concerne des syst{\`e}mes et des proc{\'e}d{\'e}s de collecte de l{\textquoteright}{\'e}nergie qui provient d{\textquoteright}un circuit de fluide ferm{\'e}, comme un syst{\`e}me de conduites d{\textquoteright}eau dans un immeuble. Un collecteur d{\textquoteright}{\'e}nergie peut {\^e}tre install{\'e} {\`a} un certain point au sein d{\textquoteright}un circuit d{\textquoteright}eau et peut g{\'e}n{\'e}rer de l{\textquoteright}{\'e}nergie {\`a} partir des diff{\'e}rentiels de pression provoqu{\'e}s lorsqu{\textquoteright}une soupape est ouverte ou ferm{\'e}e {\`a} n{\textquoteright}importe quel autre point au sein du circuit d{\textquoteright}eau qui est en communication fluidique avec le collecteur d{\textquoteright}{\'e}nergie. L{\textquoteright}{\'e}nergie peut {\^e}tre utilis{\'e}e pour alimenter, par exemple, un capteur et/ou un {\'e}metteur.},
	keywords = {Systems and Methods for Energy Harvesting in a Contained Fluid Circuit},
	isbn = {WO/2012/021551},
	url = {http://patentscope.wipo.int/search/en/WO2012021551},
	author = {Campbell,Tim and Larson,Eric and Cohn, Gabriel and Alcaide,Ramses and Jon Froehlich and Patel,Shwetak}
}
@article {17965,
	title = {Saliency-Assisted Navigation of Very Large Landscape Images},
	journal = {Visualization and Computer Graphics, IEEE Transactions on},
	volume = {17},
	year = {2011},
	month = {2011/12//},
	pages = {1737 - 1746},
	abstract = {The field of visualization has addressed navigation of very large datasets, usually meshes and volumes. Significantly less attention has been devoted to the issues surrounding navigation of very large images. In the last few years the explosive growth in the resolution of camera sensors and robotic image acquisition techniques has widened the gap between the display and image resolutions to three orders of magnitude or more. This paper presents the first steps towards navigation of very large images, particularly landscape images, from an interactive visualization perspective. The grand challenge in navigation of very large images is identifying regions of potential interest. In this paper we outline a three-step approach. In the first step we use multi-scale saliency to narrow down the potential areas of interest. In the second step we outline a method based on statistical signatures to further cull out regions of high conformity. In the final step we allow a user to interactively identify the exceptional regions of high interest that merit further attention. We show that our approach of progressive elicitation is fast and allows rapid identification of regions of interest. Unlike previous work in this area, our approach is scalable and computationally reasonable on very large images. We validate the results of our approach by comparing them to user-tagged regions of interest on several very large landscape images from the Internet.},
	keywords = {acquisition;data, acquisition;saliency, analysis;, assisted, image, images;robotic, Internet;camera, navigation;statistical, processing;image, resolution;image, resolution;interactive, sensors;image, sensors;statistical, signatures;data, visualisation;geophysical, visualization;landscape},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2011.231},
	author = {Ip, Cheuk Yiu and Varshney, Amitabh}
}
@conference {13940,
	title = {Scalable fast multipole methods on distributed heterogeneous architectures},
	booktitle = {High Performance Computing, Networking, Storage and Analysis (SC), 2011 International Conference for},
	year = {2011},
	month = {2011/11//},
	pages = {1 - 12},
	abstract = {We fundamentally reconsider implementation of the Fast Multipole Method (FMM) on a computing node with a heterogeneous CPU-GPU architecture with multicore CPU(s) and one or more GPU accelerators, as well as on an interconnected cluster of such nodes. The FMM is a divide- and-conquer algorithm that performs a fast N-body sum using a spatial decomposition and is often used in a time- stepping or iterative loop. Using the observation that the local summation and the analysis-based translation parts of the FMM are independent, we map these respectively to the GPUs and CPUs. Careful analysis of the FMM is performed to distribute work optimally between the multicore CPUs and the GPU accelerators. We first develop a single node version where the CPU part is parallelized using OpenMP and the GPU version via CUDA. New parallel algorithms for creating FMM data structures are presented together with load balancing strategies for the single node and distributed multiple-node versions. Our implementation can perform the N-body sum for 128M particles on 16 nodes in 4.23 seconds, a performance not achieved by others in the literature on such clusters.},
	keywords = {accelerators;OpenMP;analysis, algorithm;iterative, and, architecture;CUDA;FMM, architectures;, architectures;divide-and-conquer, based, conquer, CPU-GPU, CPU;scalable, data, fast, heterogeneous, loop;data, loop;multicore, methods;graphics, methods;multiprocessing, methods;time, multipole, parts;distributed, PROCESSING, stepping, structures;divide, structures;GPU, systems;parallel, translation, units;iterative},
	author = {Hu,Qi and Gumerov, Nail A. and Duraiswami, Ramani}
}
@conference {18273,
	title = {Seam carving estimation using forensic hash},
	booktitle = {Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security},
	series = {MM\&$\#$38;Sec {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {9 - 14},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Seam carving is an adaptive multimedia retargeting technique to resize multimedia data for different display sizes. This technique has found promising applications in media consumption on mobile devices such as tablets and smartphones. However, seam carving can also be used to maliciously alter image content and when combined with other tampering operations, makes tampering detection very difficult by traditional multimedia forensic techniques. In this paper, we study the problem of seam carving estimation and tampering localization using very compact side information called forensic hash. The forensic hash technique bridges two related areas, namely robust image hashing and blind multimedia forensics, to answer a broader scope of forensic questions in a more efficient and accurate manner. We show that our recently proposed forensic hash construction can be extended to accurately estimate seam carving and detect local tampering.},
	keywords = {forensic hash, seam carving, sift, visual words},
	isbn = {978-1-4503-0806-9},
	doi = {10.1145/2037252.2037255},
	url = {http://doi.acm.org/10.1145/2037252.2037255},
	author = {Lu,Wenjun and M. Wu}
}
@article {15190,
	title = {Secure computation with sublinear amortized work},
	year = {2011},
	month = {2011///},
	institution = {Cryptology ePrint Archive, Report 2011/482},
	abstract = {Traditional approaches to secure computation begin by representing the function f beingcomputed as a circuit. For any function f that depends on each of its inputs, this implies
a protocol with complexity at least linear in the input size. In fact, linear running time is
inherent for secure computation of non-trivial functions, since each party must {\textquotedblleft}touch{\textquotedblright} every
bit of their input lest information about other party{\textquoteright}s input be leaked. This seems to rule out
many interesting applications of secure computation in scenarios where at least one of the inputs
is huge and sublinear-time algorithms can be utilized in the insecure setting; private database
search is a prime example.
We present an approach to secure two-party computation that yields sublinear-time proto-
cols, in an amortized sense, for functions that can be computed in sublinear time on a random
access machine (RAM). Furthermore, a party whose input is {\textquotedblleft}small{\textquotedblright} is required to maintain
only small state. We provide a generic protocol that achieves the claimed complexity, based on
any oblivious RAM and any protocol for secure two-party computation. We then present an
optimized version of this protocol, where generic secure two-party computation is used only for
evaluating a small number of simple operations.
},
	author = {Gordon,D. and Katz, Jonathan and Kolesnikov,V. and Malkin,T. and Raykova,M. and Vahlis,Y.}
}
@inbook {19643,
	title = {Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications},
	booktitle = {Applied Cryptography and Network Security},
	series = {Lecture Notes in Computer Science},
	year = {2011},
	month = {2011/01/01/},
	pages = {130 - 146},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We present a robust secure methodology for computing functions that are represented as multivariate polynomials where parties hold different variables as private inputs. Our generic efficient protocols are fully black-box and employ threshold additive homomorphic encryption; they do not assume honest majority, yet are robust in detecting any misbehavior. We achieve solutions that take advantage of the algebraic structure of the polynomials, and are polynomial-time in all parameters (security parameter, polynomial size, polynomial degree, number of parties). We further exploit a {\textquotedblleft}round table{\textquotedblright} communication paradigm to reduce the complexity in the number of parties. A large collection of problems are naturally and efficiently represented as multivariate polynomials over a field or a ring: problems from linear algebra, statistics, logic, as well as operations on sets represented as polynomials. In particular, we present a new efficient solution to the multi-party set intersection problem, and a solution to a multi-party variant of the polynomial reconstruction problem.},
	keywords = {additive homomorphic encryption, Algorithm Analysis and Problem Complexity, Computer Communication Networks, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, multiparty set intersection, multivariate polynomial evaluation, secret sharing, secure multiparty computation, Systems and Data Security, threshold cryptosystems},
	isbn = {978-3-642-21553-7, 978-3-642-21554-4},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-21554-4_8},
	author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Yung, Moti},
	editor = {Lopez, Javier and Tsudik, Gene}
}
@conference {18276,
	title = {Secure video processing: Problems and challenges},
	booktitle = {Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on},
	year = {2011},
	month = {2011/05//},
	pages = {5856 - 5859},
	abstract = {Secure signal processing is an emerging technology to enable signal processing tasks in a secure and privacy-preserving fashion. It has attracted a great amount of research attention due to the increasing demand to enable rich functionalities for private data stored online. Desirable functionalities may include search, analysis, clustering, etc. In this paper, we discuss the research issues and challenges in secure video processing with focus on the application of secure online video management. Video is different from text due to its large data volume and rich content diversity. To be practical, secure video processing requires efficient solutions that may involve a trade-off between security and complexity. We look at three representative video processing tasks and review existing techniques that can be applied. Many of the tasks do not have efficient solutions yet, and we discuss the challenges and research questions that need to be addressed.},
	keywords = {data;video, fashion;secure, management;secure, of, online, privacy-preserving, processing;, processing;security, signal, video},
	doi = {10.1109/ICASSP.2011.5947693},
	author = {Lu,Wenjun and Varna,A. and M. Wu}
}
@conference {18281,
	title = {"Seeing" ENF: natural time stamp for digital video via optical sensing and signal processing},
	booktitle = {Proceedings of the 19th ACM international conference on Multimedia},
	series = {MM {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {23 - 32},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Electric Network Frequency (ENF) fluctuates slightly over time from its nominal value of 50 Hz/60 Hz. The fluctuations in the ENF remain consistent across the entire power grid even when measured at physically distant locations. The near-invisible flickering of fluorescent lights connected to the power mains reflect these fluctuations present in the ENF. In this paper, mechanisms using optical sensors and video cameras to record and validate the presence of the ENF fluctuations in fluorescent lighting are presented. Signal processing techniques are applied to demonstrate a high correlation between the fluctuations in the ENF signal captured from fluorescent lighting and the ENF signal captured directly from power mains supply. The proposed technique is then used to demonstrate the presence of the ENF signal in video recordings taken in various geographical areas. Experimental results show that the ENF signal can be used as a natural timestamp for optical sensor recordings and video surveillance recordings from indoor environments under fluorescent lighting. Application of the ENF signal analysis to tampering detection of surveillance video recordings is also demonstrated.},
	keywords = {electric network frequency, information forensics, timestamp, video authentication},
	isbn = {978-1-4503-0616-4},
	doi = {10.1145/2072298.2072303},
	url = {http://doi.acm.org/10.1145/2072298.2072303},
	author = {Garg,Ravi and Varna,Avinash L. and M. Wu}
}
@conference {13642,
	title = {Segmentation of Handwritten Textlines in Presence of Touching Components},
	booktitle = {Intl. Conf. on Document Analysis and Recognition (ICDAR 11)},
	year = {2011},
	month = {2011///},
	pages = {109 - 113},
	abstract = {This paper presents an approach to textline extraction in handwritten document images which combines local and global techniques. We propose a graph-based technique to detect touching and proximity errors that are common with handwritten text lines. In a refinement step, we use Expectation-Maximization (EM) to iteratively split the error segments to obtain correct text-lines. We show improvement in accuracies using our correction method on datasets of Arabic document images. Results on a set of artificially generated proximity images show that the method is effective for handling touching errors in handwritten document images.},
	author = {Kumar,Jayant and Kang,Le and David Doermann and Abd-Almageed, Wael}
}
@conference {13467,
	title = {Selective transfer between learning tasks using task-based boosting},
	booktitle = {Twenty-Fifth AAAI Conference on Artificial Intelligence},
	year = {2011},
	month = {2011///},
	author = {Eaton,E. and desJardins, Marie and others}
}
@article {16674,
	title = {Semantic similarity in a taxonomy: An information-based measure and its application to problems of ambiguity in natural language},
	journal = {Arxiv preprint arXiv:1105.5444},
	year = {2011},
	month = {2011///},
	author = {Resnik, Philip}
}
@article {19594,
	title = {Semantic Solutions to Program Analysis Problems},
	journal = {arXiv:1105.0106 [cs]},
	year = {2011},
	month = {2011/04/30/},
	abstract = {Problems in program analysis can be solved by developing novel program semantics and deriving abstractions conventionally. For over thirty years, higher-order program analysis has been sold as a hard problem. Its solutions have required ingenuity and complex models of approximation. We claim that this difficulty is due to premature focus on abstraction and propose a new approach that emphasizes semantics. Its simplicity enables new analyses that are beyond the current state of the art.},
	keywords = {Computer Science - Programming Languages},
	url = {http://arxiv.org/abs/1105.0106},
	author = {Tobin-Hochstadt, Sam and David Van Horn}
}
@conference {13403,
	title = {Sensitivity analysis and explanations for robust query evaluation in probabilistic databases},
	booktitle = {Proceedings of the 2011 international conference on Management of data},
	year = {2011},
	month = {2011///},
	pages = {841 - 852},
	abstract = {Probabilistic database systems have successfully established them-selves as a tool for managing uncertain data. However, much of the
research in this area has focused on efficient query evaluation and
has largely ignored two key issues that commonly arise in uncer-
tain data management: First, how to provide explanations for query
results, e.g., {\textquotedblleft}Why is this tuple in my result?{\textquotedblright} or {\textquotedblleft}Why does this
output tuple have such high probability?{\textquotedblright}. Second, the problem of
determining the sensitive input tuples for the given query, e.g., users
are interested to know the input tuples that can substantially alter
the output, when their probabilities are modified (since they may
be unsure about the input probability values). Existing systems pro-
vide the lineage/provenance of each of the output tuples in addition
to the output probabilities, which is a boolean formula indicating
the dependence of the output tuple on the input tuples. However,
lineage does not immediately provide a quantitative relationship
and it is not informative when we have multiple output tuples. In
this paper, we propose a unified framework that can handle both
the issues mentioned above to facilitate robust query processing.
We formally define the notions of influence and explanations and
provide algorithms to determine the top-l influential set of variables
and the top-l set of explanations for a variety of queries, including
conjunctive queries, probabilistic threshold queries, top-k queries
and aggregation queries. Further, our framework naturally enables
highly efficient incremental evaluation when input probabilities are modified (e.g., if uncertainty is resolved). Our preliminary exper-
imental results demonstrate the benefits of our framework for per-
forming robust query processing over probabilistic databases.
},
	author = {Kanagal,B. and Li,J. and Deshpande, Amol}
}
@article {16041,
	title = {Seven guiding scenarios for information visualization evaluation},
	volume = {2011-992-04},
	year = {2011},
	month = {2011///},
	institution = {Department of Computer Science, University of Calgary},
	abstract = {We take a new, scenario based look at evaluation in information visualization. Our seven scenarios, evaluatingvisual data analysis and reasoning, evaluating user performance, evaluating user experience, evaluating environments and work
practices, evaluating communication through visualization, automated evaluation of visualizations, and evaluating collaborative
data analysis were derived through an extensive literature review of over 800 visualization publications. These scenarios are
described through their goals, the types of questions they embody and illustrated through example studies. Through this broad
survey and the distillation of these scenarios we make two contributions. One, we encapsulate the current practices in the
information visualization research community and, two, we provide a different approach to reaching decisions about what might
be the most effective evaluation of a given information visualization. For example, if the research goals or evaluative questions
are known they can be used to map to specific scenarios, where practical existing examples can be considered for effective
evaluation approaches.
},
	author = {Lam,H. and Bertini,E. and Isenberg,P. and Plaisant, Catherine and Carpendale,S.}
}
@conference {13643,
	title = {Shape Codebook based Handwritten and Machine Printed Text Zone Extraction},
	booktitle = {Document Recognition and Retrieval},
	year = {2011},
	month = {2011/01//},
	pages = {7874:1-8 - 7874:1-8},
	address = {San Francisco},
	abstract = {We present a novel method for extracting handwritten and printed text zones from noisy document images with mixed content. We use Triple-Adjacent-Segment (TAS) based features which encode local shape characteristics of text in a consistent manner. We first construct two different codebooks of the shape features extracted from a set of handwritten and printed text documents. In the next step, we compute the normalized histogram of codewords for each segmented zone and use it to train Support Vector Machine (SVM) classifier. Due to a codebook based approach, our method is robust to the background noise present in the image. The TAS features used are invariant to translation, scale and rotation of text. In our experimental results, we show that a pixel-weighted zone classification accuracy of 98\% can be achieved for noisy Arabic documents. Further, we demonstrate the effectiveness of our method for document page classification and show that a high precision can be achieved for machine printed documents. The proposed method is robust to the size of zones, which may contain text content at word, line or paragraph level.},
	author = {Kumar,Jayant and Prasad,Rohit and Cao,Huiagu and Abd-Almageed, Wael and David Doermann and Natarajan,Prem}
}
@article {11906,
	title = {Silhouette-based gesture and action recognition via modeling trajectories on Riemannian shape manifolds},
	journal = {Computer Vision and Image Understanding},
	volume = {115},
	year = {2011},
	month = {2011/03//},
	pages = {439 - 455},
	abstract = {This paper addresses the problem of recognizing human gestures from videos using models that are built from the Riemannian geometry of shape spaces. We represent a human gesture as a temporal sequence of human poses, each characterized by a contour of the associated human silhouette. The shape of a contour is viewed as a point on the shape space of closed curves and, hence, each gesture is characterized and modeled as a trajectory on this shape space. We propose two approaches for modeling these trajectories. In the first template-based approach, we use dynamic time warping (DTW) to align the different trajectories using elastic geodesic distances on the shape space. The gesture templates are then calculated by averaging the aligned trajectories. In the second approach, we use a graphical model approach similar to an exemplar-based hidden Markov model, where we cluster the gesture shapes on the shape space, and build non-parametric statistical models to capture the variations within each cluster. We model each gesture as a Markov model of transitions between these clusters. To evaluate the proposed approaches, an extensive set of experiments was performed using two different data sets representing gesture and action recognition applications. The proposed approaches not only are successfully able to represent the shape and dynamics of the different classes for recognition, but are also robust against some errors resulting from segmentation and background subtraction.},
	keywords = {Action recognition, Gesture recognition, Riemannian manifolds, Shape space, Silhouette-based approaches},
	isbn = {1077-3142},
	doi = {16/j.cviu.2010.10.006},
	url = {http://www.sciencedirect.com/science/article/pii/S1077314210002377},
	author = {Abdelkader,Mohamed F. and Abd-Almageed, Wael and Srivastava,Anuj and Chellapa, Rama}
}
@article {18535,
	title = {SilverLine: Data and Network Isolation for Cloud Services},
	journal = {2nd USENIX Workshop on Hot Topics in Cloud Computing},
	year = {2011},
	month = {2011///},
	abstract = {Although cloud computing service providers offer op-portunities for improving the administration, reliability,
and maintenance of hosted services, they also concen-
trate network resources and data in a small number of
cloud service providers. The concentration of data and
resources also entails various associated risks, including
sharing the underlying infrastructure with unknown (and
untrusted) tenants and relying on the availability and se-
curity of the underlying infrastructure itself. These se-
curity risks represent some of the most significant bar-
riers to the adoption of cloud-based services. To begin
tackling these risks, a cloud hosting infrastructure should
provide strong guarantees for resource and data isolation.
This paper examines data and network isolation prob-
lems with today{\textquoteright}s cloud hosting infrastructures and pro-
poses SilverLine, a collection of techniques to improve
data and network isolation for a cloud tenants{\textquoteright} service.
},
	author = {Mundada,Y. and Ramachandran,A. and Feamster, Nick}
}
@article {13328,
	title = {Simplex and Diamond Hierarchies: Models and Applications},
	journal = {Computer Graphics Forum},
	volume = {30},
	year = {2011},
	month = {2011/11/24/},
	pages = {2127 - 2155},
	abstract = {Hierarchical spatial decompositions are a basic modelling tool in a variety of application domains. Several papers on this subject deal with hierarchical simplicial decompositions generated through regular simplex bisection. Such decompositions, originally developed for finite elements, are extensively used as the basis for multi-resolution models of scalar fields, such as terrains, and static or time-varying volume data. They have also been used as an alternative to quadtrees and octrees as spatial access structures. The primary distinction among all such approaches is whether they treat the simplex or clusters of simplices, called diamonds, as the modelling primitive. This leads to two classes of data structures and to different query approaches. We present the hierarchical models in a dimension-independent manner, and organize the description of the various applications, primarily interactive terrain rendering and isosurface extraction, according to the dimension of the domain.},
	keywords = {hierarchy of diamonds, hierarchy of simplices, I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling{\textemdash} Hierarchy and geometric transformations, I.3.6 [Computer Graphics]: Methodology and Techniques{\textemdash}Graphics data structures and data types, interactive terrain visualization, mesh-based multiresolution models, multiresolution isosurfaces, nested refinement schemes, Regular simplex bisection, scalar field visualization, spatial access structures},
	isbn = {1467-8659},
	doi = {10.1111/j.1467-8659.2011.01853.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2011.01853.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=},
	author = {Weiss,K. and De Floriani, Leila}
}
@conference {13329,
	title = {Simplifying morphological representations of 2D and 3D scalar fields},
	booktitle = {Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems},
	series = {GIS {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {437 - 440},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We describe a dual graph-based representation for the ascending and descending Morse complexes of a scalar field, and a compact and dimension-independent data structure based on it, which assumes a discrete representation of the field as a simplicial mesh. We present atomic dimension-independent simplification operators on the graph-based representation. Based on such operators, we have developed a simplification algorithm, which allows generalization of the ascending and descending Morse complexes at different levels of resolution. We show here the results of our implementation, discussing the computation times and the size of the resulting simplified graphs, also in comparison with the size of the original full-resolution graph.},
	keywords = {morphological representations, Morse complexes, multi-dimensional data sets, simplification},
	isbn = {978-1-4503-1031-4},
	doi = {10.1145/2093973.2094042},
	url = {http://doi.acm.org/10.1145/2093973.2094042},
	author = {{\v C}omi{\'c},Lidija and De Floriani, Leila and Iuricich,Federico}
}
@conference {12413,
	title = {Simulating Audiences: Automating Analysis of Values, Attitudes, and Sentiment},
	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 = {734 - 737},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Current events such as the Park51 Project in downtown Manhattan create "critical discourse moments," explosions of discourse around a topic that can be exploited for data gathering. Policymakers have a need to understand the dynamics of public discussion in real time. Human values, which are cognitively related to attitudes and serve as reference points in moral argument, are important indicators of what{\textquoteright}s at stake in a public controversy. This work shows that it is possible to link values data with reader behavior to infer values implicit in a topical corpus, and that it is possible to automate this process using machine learning.},
	keywords = {audience simulation, behavioural sciences computing, crowdsourcing, Educational institutions, human values, HUMANS, learning (artificial intelligence), machine learning, moral argument, natural language processing, Park51 project, Presses, public controversy, public discussion, Security, social sciences computing, support vector machines, Weaving},
	isbn = {978-1-4577-1931-8},
	doi = {10.1109/PASSAT/SocialCom.2011.238},
	author = {Templeton,T.C. and Fleischmann,K.R. and Jordan Boyd-Graber}
}
@conference {13330,
	title = {Smale-like decomposition and forman theory for discrete scalar fields},
	booktitle = {Discrete Geometry for Computer Imagery},
	year = {2011},
	month = {2011///},
	pages = {477 - 488},
	abstract = {Forman theory, which is a discrete alternative for cell complexes to the well-known Morse theory, is currently finding several applications in areas where the data to be handled are discrete, such as image processing and computer graphics. Here, we show that a discrete scalar field f, defined on the vertices of a triangulated multidimensional domain Σ, and its gradient vector field Grad f through the Smale-like decomposition of f [6], are both the restriction of a Forman function F and its gradient field Grad F that extends f over all the simplexes of Σ. We present an algorithm that gives an explicit construction of such an extension. Hence, the scalar field f inherits the properties of Forman gradient vector fields and functions from field Grad F and function F.},
	doi = {10.1007/978-3-642-19867-0_40},
	author = {{\v C}omi{\'c},L. and Mesmoudi,M. and De Floriani, Leila}
}
@article {13072,
	title = {Smart task-driven video collection},
	volume = {11/649,393},
	year = {2011},
	month = {2011/06/14/},
	abstract = {A multi-camera system that collects images and videos of moving objects in dynamic and crowded scenes, subject to task constraints is disclosed. The system constructs {\textquotedblleft}task visibility intervals{\textquotedblright} comprising information about what can be sensed in future time intervals. Methods for constructing these intervals applying prediction of future object motion and including consideration of factors such as object occlusion and camera control parameters are also disclosed. Using a plane-sweep algorithm, these atomic intervals can be combined in a method to form multi-task intervals, during which a single camera can collect videos suitable for multiple tasks simultaneously. Methods for fast camera scheduling that yield solutions within a small constant factor of an optimal solution are also disclosed.},
	url = {http://www.google.com/patents?id=pgPnAQAAEBAJ},
	author = {Lim,Ser-Nam and Mittal,Anurag and Davis, Larry S.},
	editor = {Siemens Corporation}
}
@conference {17369,
	title = {Social discovery framework: building capacity and seeking solutions},
	booktitle = {Proceedings of the 8th ACM conference on Creativity and cognition},
	series = {C\&$\#$38;C {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {307 - 308},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {While journalists often portray discovery as the thrilling insight of a brilliant individual, many discoveries require years of work by competing and collaborating teams. Often large amounts of foundational work are necessary and dialogs among participants help clarify goals. The Social Discovery Framework suggests that (1) there are important processes in building capacity and then seeking solutions and (2) those that initiate requests are often as important as those who seek solutions. The implications of the Social Discovery Framework are that improved social tools to build capacity, initiate requests, and support dialog would accelerate the discovery process as much as the more visible tools for individuals seeking solutions.},
	keywords = {Collaboration, collective intelligence, community, creativity support tools, crowdsourcing, search, social discovery, User interfaces},
	isbn = {978-1-4503-0820-5},
	doi = {10.1145/2069618.2069669},
	url = {http://doi.acm.org/10.1145/2069618.2069669},
	author = {Shneiderman, Ben}
}
@article {17370,
	title = {Social discovery in an information abundant world: Designing to create capacity and seek solutions},
	journal = {Information Services and Use},
	volume = {31},
	year = {2011},
	month = {2011/01/01/},
	pages = {3 - 13},
	abstract = {The first generation of search tools provided remarkable capabilities to many researchers for finding specific information, navigating to desired websites or tracking down needed documents. A second generation of tools is helping researchers conduct exploratory search in situations where the goals are less clear, where complete coverage is necessary, and where proof of absence is required (patents, legal precedents, etc.). However, the third generation of tools turns search into social discovery, in which colleagues, informal groups, companies, non-profit organizations, professional societies, and international federations are motivated to find, filter, organize, annotate and summarize voluminous information resources. The Reader-to-Leader framework describes the usability and sociability design features needed to motivate readers, contributors, collaborators and leaders. The Social Discovery framework, proposed in this paper, suggests that effective design enables people to engage in dialogs over weeks and months to create capacity (in the manner described by the Reader-to-Leader framework), and become more effective solution seekers. Much work remains to be done to validate these social discovery frameworks and refine them to fit diverse contexts.},
	doi = {10.3233/ISU-2011-0628},
	url = {http://dx.doi.org/10.3233/ISU-2011-0628},
	author = {Shneiderman, Ben}
}
@article {17909,
	title = {Social Snapshot: A System for Temporally Coupled Social Photography},
	journal = {Computer Graphics and Applications, IEEE},
	volume = {31},
	year = {2011},
	month = {2011/02//jan},
	pages = {74 - 84},
	abstract = {Social Snapshot actively acquires and reconstructs temporally dynamic data. The system enables spatiotemporal 3D photography using commodity devices, assisted by their auxiliary sensors and network functionality. It engages users, making them active rather than passive participants in data acquisition.},
	keywords = {3D, acquisition;data, acquisition;photography;social, computing;, coupled, data, photography;data, photography;temporally, reconstruction;social, sciences, snapshot;spatiotemporal, social},
	isbn = {0272-1716},
	doi = {10.1109/MCG.2010.107},
	author = {Patro,R. and Ip, Cheuk Yiu and Bista,S. and Varshney, Amitabh}
}
@conference {18599,
	title = {Spam or ham?: characterizing and detecting fraudulent "not spam" reports in web mail systems},
	booktitle = {Proceedings of the 8th Annual Collaboration, Electronic messaging, Anti-Abuse and Spam Conference},
	series = {CEAS {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {210 - 219},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Web mail providers rely on users to "vote" to quickly and col-laboratively identify spam messages. Unfortunately, spammers have begun to use bots to control large collections of compromised Web mail accounts not just to send spam, but also to vote "not spam" on incoming spam emails in an attempt to thwart collaborative filtering. We call this practice a vote gaming attack. This attack confuses spam filters, since it causes spam messages to be mislabeled as legitimate; thus, spammer IP addresses can continue sending spam for longer. In this paper, we introduce the vote gaming attack and study the extent of these attacks in practice, using four months of email voting data from a large Web mail provider. We develop a model for vote gaming attacks, explain why existing detection mechanisms cannot detect them, and develop a new, scalable clustering-based detection method that identifies compromised accounts that engage in vote-gaming attacks. Our method detected 1.1 million potentially compromised accounts with only a 0.17\% false positive rate, which is nearly 10 times more effective than existing clustering methods used to detect bots that send spam from compromised Web mail accounts.},
	isbn = {978-1-4503-0788-8},
	doi = {10.1145/2030376.2030401},
	url = {http://doi.acm.org/10.1145/2030376.2030401},
	author = {Ramachandran,Anirudh and Dasgupta,Anirban and Feamster, Nick and Weinberger,Kilian}
}
@conference {12436,
	title = {Sparse dictionary-based representation and recognition of action attributes},
	booktitle = {2011 IEEE International Conference on Computer Vision (ICCV)},
	year = {2011},
	month = {2011/11/06/13},
	pages = {707 - 714},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present an approach for dictionary learning of action attributes via information maximization. We unify the class distribution and appearance information into an objective function for learning a sparse dictionary of action attributes. The objective function maximizes the mutual information between what has been learned and what remains to be learned in terms of appearance information and class distribution for each dictionary item. We propose a Gaussian Process (GP) model for sparse representation to optimize the dictionary objective function. The sparse coding property allows a kernel with a compact support in GP to realize a very efficient dictionary learning process. Hence we can describe an action video by a set of compact and discriminative action attributes. More importantly, we can recognize modeled action categories in a sparse feature space, which can be generalized to unseen and unmodeled action categories. Experimental results demonstrate the effectiveness of our approach in action recognition applications.},
	keywords = {action attributes, appearance information, class distribution, Dictionaries, dictionary learning process, Encoding, Entropy, Gaussian process model, Gaussian processes, Histograms, HUMANS, Image coding, image representation, information maximization, learning (artificial intelligence), modeled action categories, Mutual information, Object recognition, probabilistic logic, sparse coding property, sparse dictionary-based recognition, sparse dictionary-based representation, sparse feature space, unmodeled action categories},
	isbn = {978-1-4577-1101-5},
	doi = {10.1109/ICCV.2011.6126307},
	author = {Qiang Qiu and Zhuolin Jiang and Chellapa, Rama}
}
@article {15907,
	title = {Sparsity-motivated automatic target recognition},
	journal = {Applied OpticsAppl. Opt.},
	volume = {50},
	year = {2011},
	month = {2011/04/01/},
	pages = {1425 - 1433},
	abstract = {We present an automatic target recognition algorithm using the recently developed theory of sparse representations and compressive sensing. We show how sparsity can be helpful for efficient utilization of data for target recognition. We verify the efficacy of the proposed algorithm in terms of the recognition rate and confusion matrices on the well known Comanche (Boeing{\textendash}Sikorsky, USA) forward-looking IR data set consisting of ten different military targets at different orientations.},
	keywords = {IMAGE PROCESSING, Image recognition, algorithms and filters, pattern recognition, Vision - patterns and recognition},
	doi = {10.1364/AO.50.001425},
	url = {http://ao.osa.org/abstract.cfm?URI=ao-50-10-1425},
	author = {Patel, Vishal M. and Nasrabadi,Nasser M. and Chellapa, Rama}
}
@article {12442,
	title = {Special Issue on Video Analysis on Resource-Limited Systems},
	journal = {IEEE Transactions on Circuits and Systems for Video Technology},
	volume = {21},
	year = {2011},
	month = {2011/10//},
	pages = {1349 - 1352},
	abstract = {The 17 papers in this special issue focus on resource-limited systems.},
	keywords = {computational complexity, Image Enhancement, Special issues and sections, Video compression},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2011.2165795},
	author = {Chellapa, Rama and Cavallaro, A. and Wu,Y. and Shan, C. and Fu, Y. and Pulli, K.}
}
@inbook {17378,
	title = {Speeding Up Network Layout and Centrality Measures for Social Computing Goals},
	booktitle = {Social Computing, Behavioral-Cultural Modeling and PredictionSocial Computing, Behavioral-Cultural Modeling and Prediction},
	series = {Lecture Notes in Computer Science},
	volume = {6589},
	year = {2011},
	month = {2011///},
	pages = {244 - 251},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This paper presents strategies for speeding up calculation of graph metrics and layout by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture ( CUDA ) by Nvidia . Graph centrality metrics like Eigenvector , Betweenness , Page Rank and layout algorithms like Fruchterman - Rheingold are essential components of Social Network Analysis ( SNA ). With the growth in adoption of SNA in different domains and increasing availability of huge networked datasets for analysis, social network analysts require faster tools that are also scalable. Our results, using NodeXL, show up to 802 times speedup for a Fruchterman-Rheingold graph layout and up to 17,972 times speedup for Eigenvector centrality metric calculations on a 240 core CUDA-capable GPU.},
	isbn = {978-3-642-19655-3},
	url = {http://dx.doi.org/10.1007/978-3-642-19656-0_35},
	author = {Sharma,Puneet and Khurana,Udayan and Shneiderman, Ben and Scharrenbroich,Max and Locke,John},
	editor = {Salerno,John and Yang,Shanchieh and Nau, Dana S. and Chai,Sun-Ki}
}
@conference {14736,
	title = {State transfer for clear and efficient runtime updates},
	booktitle = {2011 IEEE 27th International Conference on Data Engineering Workshops (ICDEW)},
	year = {2011},
	month = {2011/04/11/16},
	pages = {179 - 184},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Dynamic software updating (DSU), the practice of updating software while it executes, is a lively area of research. The DSU approach most prominent in both commercial and research systems is in-place updating, in which patches containing program modifications are loaded into a running process. However, in-place updating suffers from several problems: it requires complex tool support, it may adversely affect the performance of normal execution, it requires challenging reasoning to understand the behavior of an updated program, and it requires extra effort to modify program state to be compatible with an update. This paper presents preliminary work investigating the potential for state transfer updating to address these problems. State transfer updates work by launching a new process running the updated program version and transferring program state from the running process to the updated version. In this paper, we describe the use and implementation of Ekiden, a new state transfer updating library for C/C++ programs. Ekiden seeks to redress the difficulties of in-place updating, and we report on our experience updating VSFTPD using Ekiden. This initial experience suggests that state transfer provides the availability benefits of in-place DSU approaches while addressing many of their shortcomings.},
	keywords = {C++ language, C++ program, Cognition, complex tool support, dynamic software updating, efficient runtime update, in-place DSU approach, Libraries, Operating systems, program modification, Program processors, program transfer, program version, Runtime, servers, software libraries, Software maintenance, state transfer update, Steady-state, updating library, VSFTPD},
	isbn = {978-1-4244-9195-7},
	doi = {10.1109/ICDEW.2011.5767632},
	author = {Hayden,C.M. and Smith,E. K and Hicks, Michael W. and Foster, Jeffrey S.}
}
@article {12439,
	title = {Statistical Computations on Grassmann and Stiefel Manifolds for Image and Video-Based Recognition},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {33},
	year = {2011},
	month = {2011/11//},
	pages = {2273 - 2286},
	abstract = {In this paper, we examine image and video-based recognition applications where the underlying models have a special structure-the linear subspace structure. We discuss how commonly used parametric models for videos and image sets can be described using the unified framework of Grassmann and Stiefel manifolds. We first show that the parameters of linear dynamic models are finite-dimensional linear subspaces of appropriate dimensions. Unordered image sets as samples from a finite-dimensional linear subspace naturally fall under this framework. We show that an inference over subspaces can be naturally cast as an inference problem on the Grassmann manifold. To perform recognition using subspace-based models, we need tools from the Riemannian geometry of the Grassmann manifold. This involves a study of the geometric properties of the space, appropriate definitions of Riemannian metrics, and definition of geodesics. Further, we derive statistical modeling of inter and intraclass variations that respect the geometry of the space. We apply techniques such as intrinsic and extrinsic statistics to enable maximum-likelihood classification. We also provide algorithms for unsupervised clustering derived from the geometry of the manifold. Finally, we demonstrate the improved performance of these methods in a wide variety of vision applications such as activity recognition, video-based face recognition, object recognition from image sets, and activity-based video clustering.},
	keywords = {activity based video clustering, activity recognition, computational geometry, Computational modeling, Data models, face recognition, feature representation, finite dimensional linear subspaces, geometric properties, Geometry, Grassmann Manifolds, Grassmann., HUMANS, Image and video models, image recognition, linear dynamic models, linear subspace structure, Manifolds, maximum likelihood classification, maximum likelihood estimation, Object recognition, Riemannian geometry, Riemannian metrics, SHAPE, statistical computations, statistical models, Stiefel, Stiefel Manifolds, unsupervised clustering, video based face recognition, video based recognition, video signal processing},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2011.52},
	author = {Turaga,P. and Veeraraghavan,A. and Srivastava, A. and Chellapa, Rama}
}
@conference {13651,
	title = {Stroke-like Pattern Noise Removal in Binary Document Images},
	booktitle = {International Conference on Document Analysis and Recognition},
	year = {2011},
	month = {2011///},
	pages = {17 - 21},
	abstract = {This paper presents a two-phased stroke-like pattern noise (SPN) removal algorithm for binary document images. The proposed approach aims at understanding script-independent prominent text component features using supervised classification as a first step. It then uses their cohesiveness and stroke-width properties to filter and associate smaller text components with them using an unsupervised classification technique. In order to perform text extraction, and hence noise removal, at diacritic-level, this divide-and-conquer technique does not assume the availability of accurate and large amounts of ground-truth data at component-level for training purposes. The method was tested on a collection of degraded and noisy, machine-printed and handwritten binary Arabic text documents. Results show pixel-level precision and recall of 98\% and 97\% respectively.},
	author = {Agrawal,Mudit and David Doermann}
}
@article {18720,
	title = {Structure and recognition of polyubiquitin chains of different lengths and linkage},
	journal = {F1000 Biology ReportsF1000 Biol Rep},
	volume = {3},
	year = {2011},
	month = {2011/12/01/},
	abstract = {The polyubiquitin signal is post-translationally attached to a large number of proteins, often directing formation of macromolecular complexes resulting in the translocation, assembly or degradation of the attached protein. Recent structural and functional studies reveal general mechanisms by which different architectures and length of the signal are distinguished.},
	isbn = {1757-594X},
	doi = {10.3410/B3-26},
	url = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3229271/},
	author = {Fushman, David and Wilkinson,Keith D.}
}
@article {19118,
	title = {Suppression subtractive hybridization PCR isolation of cDNAs from a Caribbean soft coral},
	journal = {Electronic Journal of Biotechnology},
	volume = {14},
	year = {2011},
	month = {2011},
	pages = {8 - 9},
	author = {Lopez, J.V. and Ledger, A. and Santiago-V{\'a}zquez, L.Z. and Pop, Mihai and Sommer, D.D. and Ranzer, L.K. and Feldman, R.A. and Russell, G.K.}
}
@article {18543,
	title = {A survey of virtual LAN usage in campus networks},
	journal = {Communications Magazine, IEEE},
	volume = {49},
	year = {2011},
	month = {2011/07//},
	pages = {98 - 103},
	abstract = {VLANs are widely used in today{\textquoteright}s enterprise networks to improve Ethernet scalability and support network policies. However, manuals and textbooks offer very little information about how VLANs are actually used in practice. Through discussions with network administrators and analysis of configuration data, we describe how three university campuses and one academic department use VLANs to achieve a variety of goals. We argue that VLANs are ill-suited to some of these goals (e.g., VLANs are often used to realize access control policies, but constrain the types of policies that can be expressed). Furthermore, the use of VLANs leads to significant complexity in the configuration of network devices.},
	keywords = {academic department, campus network, educational computing, Educational institutions, Ethernet scalability, Local area networks, network policy support, university campus, virtual LAN usage, VLAN},
	isbn = {0163-6804},
	doi = {10.1109/MCOM.2011.5936161},
	author = {Yu,Minlan and Rexford,J. and Sun,Xin and Rao,Sanjay and Feamster, Nick}
}
@conference {12441,
	title = {Synthesis-based recognition of low resolution faces},
	booktitle = {2011 International Joint Conference on Biometrics (IJCB)},
	year = {2011},
	month = {2011/10/11/13},
	pages = {1 - 6},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Recognition of low resolution face images is a challenging problem in many practical face recognition systems. Methods have been proposed in the face recognition literature for the problem when the probe is of low resolution, and a high resolution gallery is available for recognition. These methods modify the probe image such that the resultant image provides better discrimination. We formulate the problem differently by leveraging the information available in the high resolution gallery image and propose a generative approach for classifying the probe image. An important feature of our algorithm is that it can handle resolution changes along with illumination variations. The effective- ness of the proposed method is demonstrated using standard datasets and a challenging outdoor face dataset. It is shown that our method is efficient and can perform significantly better than many competitive low resolution face recognition algorithms.},
	keywords = {Dictionaries, Face, face images, face recognition, face recognition literature, face recognition systems, illumination variations, image resolution, low resolution faces, Organizations, PROBES, support vector machines, synthesis based recognition},
	isbn = {978-1-4577-1358-3},
	doi = {10.1109/IJCB.2011.6117545},
	author = {Shekhar, S. and Patel, Vishal M. and Chellapa, Rama}
}
@article {17744,
	title = {SYSTEM AND METHOD FOR DATA MANAGEMENT IN LARGE DATA NETWORKS},
	volume = {WO/2011/032077},
	year = {2011},
	month = {2011/03//},
	abstract = {A system and method for storing an input data network, in the form of graph is provided. The system includes a master node and a plurality of slave nodes. The master node is operable to receive the data network in the form of a graph, the graph including a plurality of vertices connected by edges; calculate a probability of co-retrieval for each of the plurality of vertices; and assign each of the plurality of vertices to one of the plurality of compute nodes based on the calculated probability of co-retrieval. Another method and system are provided for converting a dataset into a graph based index and storing the index on disk. Respective systems and methods of querying such data networks are also provided.},
	author = {BROECHELER,M. and V.S. Subrahmanian and Pugliese, A.}
}
@article {19595,
	title = {Systematic Abstraction of Abstract Machines},
	journal = {arXiv:1107.3539 [cs]},
	year = {2011},
	month = {2011/07/18/},
	abstract = {We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines for higher-order and imperative programming languages. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine{\textquoteright}s machine, and the stack-inspecting CM machine of Clements and Felleisen into abstract interpretations of themselves. The resulting analyses bound temporal ordering of program events; predict return-flow and stack-inspection behavior; and approximate the flow and evaluation of by-need parameters. For all of these machines, we find that a series of well-known concrete machine refactorings, plus a technique of store-allocated continuations, leads to machines that abstract into static analyses simply by bounding their stores. We demonstrate that the technique scales up uniformly to allow static analysis of realistic language features, including tail calls, conditionals, side effects, exceptions, first-class continuations, and even garbage collection. In order to close the gap between formalism and implementation, we provide translations of the mathematics as running Haskell code for the initial development of our method.},
	keywords = {Computer Science - Programming Languages},
	url = {http://arxiv.org/abs/1107.3539},
	author = {David Van Horn and Might, Matthew}
}
@article {17950,
	title = {Saliency Guided Summarization of Molecular Dynamics Simulations},
	journal = {Scientific Visualization: Advanced Concepts},
	volume = {1},
	year = {2010},
	month = {2010///},
	pages = {321 - 335},
	abstract = {We present a novel method to measure saliency in molecular dynamics simulation data. This saliency measure is based on a multiscale center-surround mechanism, which is fast and efficient to compute. We explore the use of the saliency function to guide the selection of representative and anomalous timesteps for summarization of simulations. To this end, we also introduce a multiscale keyframe selection procedure which automatically provides keyframes representing the simulation at varying levels of coarseness. We compare our saliency guided keyframe approach against other methods, and show that it consistently selects superior keyframes as measured by their predictive power in reconstructing the simulation.},
	author = {Patro,R. and Ip,C. Y and Varshney, Amitabh and Hagen,H.}
}
@conference {19285,
	title = {Scalable representation of dataflow graph structures using topological patterns},
	booktitle = {2010 IEEE Workshop on Signal Processing Systems (SIPS)},
	year = {2010},
	month = {2010},
	pages = {13 - 18},
	abstract = {Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interface (GUI) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-scale applications, the underlying graphs often consist of smaller substructures that repeat multiple times. To enable more concise representation and direct analysis of such substructures in the context of high level DSP specification languages and design tools, we develop the modeling concept of topological patterns, and propose ways for supporting this concept in a high-level language. We augment the DIF language - a language for specifying DSP-oriented dataflow graphs - with constructs for supporting topological patterns, and we show how topological patterns can be effective in various aspects of embedded signal processing design flows using specific application examples.},
	keywords = {arrays, data flow graphs, Dataflow graphs, DIF language, Digital signal processing, directed graphs, DSP specification languages, embedded signal processing design flows, embedded systems, Field programmable gate arrays, graphical user interface, Graphical user interfaces, High-level languages, modelbased design, optimisation, optimizations, scalable dataflow graph structures representation, semantics, Signal processing, Signal processing systems, Specification languages, text based languages, Topological patterns, Topology, Transform coding},
	author = {Sane, N. and Kee, Hojin and Seetharaman, G. and Bhattacharyya, Shuvra S.}
}
@conference {15283,
	title = {Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce},
	booktitle = {Cloud Computing Technology and Science (CloudCom), 2010 IEEE Second International Conference on},
	year = {2010},
	month = {2010///},
	pages = {780 - 785},
	abstract = {Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one popular heuristic method for solving hard problems such as the Job Shop Scheduling Problem (JSSP), which is one of the hardest problems lacking efficient exact solutions today. It is intuitive that the population size of a GA may greatly affect the quality of the solution, but it is unclear what are the effects of having population sizes that are significantly greater than typical experiments. The emergence of MapReduce, a framework running on a cluster of computers that aims to provide large-scale data processing, offers great opportunities to investigate this issue. In this paper, a GA is implemented to scale the population using MapReduce. Experiments are conducted on a large cluster, and population sizes up to 10<sup>7</sup> are inspected. It is shown that larger population sizes not only tend to yield better solutions, but also require fewer generations. Therefore, it is clear that when dealing with a hard problem such as JSSP, an existing GA can be improved by massively scaling up populations with MapReduce, so that the solution can be parallelized and completed in reasonable time.},
	keywords = {algorithm;job, algorithms;job, computing;genetic, data, large-scale, MapReduce;cloud, problems;parallel, processing;, processing;cloud, scheduling, scheduling;parallel, shop},
	doi = {10.1109/CloudCom.2010.18},
	author = {Di-Wei Huang and Jimmy Lin}
}
@article {14733,
	title = {SCORE: agile research group management},
	journal = {Commun. ACM},
	volume = {53},
	year = {2010},
	month = {2010/10//},
	pages = {30 - 31},
	abstract = {Adapting agile software development methodology toward more efficient management of academic research groups.},
	isbn = {0001-0782},
	doi = {10.1145/1831407.1831421},
	url = {http://doi.acm.org/10.1145/1831407.1831421},
	author = {Hicks, Michael W. and Foster, Jeffrey S.}
}
@conference {15918,
	title = {Sectored Random Projections for Cancelable Iris Biometrics},
	booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)},
	year = {2010},
	month = {2010/03//},
	pages = {1838 - 1841},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Privacy and security are essential requirements in practical biometric systems. In order to prevent the theft of biometric patterns, it is desired to modify them through revocable and non invertible transformations called Cancelable Biometrics. In this paper, we propose an efficient algorithm for generating a Cancelable Iris Biometric based on Sectored Random Projections. Our algorithm can generate a new pattern if the existing one is stolen, retain the original recognition performance and prevent extraction of useful information from the transformed patterns. Our method also addresses some of the drawbacks of existing techniques and is robust to degradations due to eyelids and eyelashes.},
	keywords = {biometric pattern, Biometrics, Cancelable Biometrics, cancelable iris biometrics, data mining, data privacy, Degradation, Eyelashes, Eyelids, Iris, iris recognition, pattern recognition, privacy, random processes, Random Projections, Robustness, sectored random projection, Secure Biometrics, Security, security of data},
	isbn = {978-1-4244-4295-9},
	doi = {10.1109/ICASSP.2010.5495383},
	author = {Pillai,J.K. and Patel, Vishal M. and Chellapa, Rama and Ratha,N. K}
}
@article {12501,
	title = {Secure and robust iris recognition using random projections and sparse representations},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	year = {2010},
	month = {2010///},
	pages = {1 - 1},
	author = {Pillai, J. and Patel, Vishal M. and Chellapa, Rama and Ratha, N.}
}
@article {15152,
	title = {Secure network coding over the integers},
	journal = {Public Key Cryptography{\textendash}PKC 2010},
	year = {2010},
	month = {2010///},
	pages = {142 - 160},
	abstract = {Network coding offers the potential to increase throughput and improve robustness without any centralized control. Unfortunately, network coding is highly susceptible to {\textquotedblleft}pollution attacks{\textquotedblright} in which malicious nodes modify packets improperly so as to prevent message recovery at the recipient(s); such attacks cannot be prevented using standard end-to-end cryptographic authentication because network coding mandates that intermediate nodes modify data packets in transit.Specialized {\textquotedblleft}network coding signatures{\textquotedblright} addressing this problem have been developed in recent years using homomorphic hashing and homomorphic signatures. We contribute to this area in several ways:
{\textbullet}  	
We show the first homomorphic signature scheme based on the RSA assumption (in the random oracle model).
{\textbullet}  	
We give a homomorphic hashing scheme that is more efficient than existing schemes, and which leads to network coding signatures based on the hardness of factoring (in the standard model).
{\textbullet}  	
We describe variants of existing schemes that reduce the communication overhead for moderate-size networks, and improve computational efficiency (in some cases quite dramatically {\textendash} e.g., we achieve a 20-fold speedup in signature generation at intermediate nodes).
Underlying our techniques is a modified approach to random linear network coding where instead of working in a vector space over a field, we work in a module over the integers (with small coefficients).
},
	doi = {10.1007/978-3-642-13013-7_9},
	author = {Gennaro,R. and Katz, Jonathan and Krawczyk,H. and Rabin,T.}
}
@conference {15138,
	title = {Secure text processing with applications to private DNA matching},
	booktitle = {Proceedings of the 17th ACM conference on Computer and communications security},
	series = {CCS {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {485 - 492},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Motivated by the problem of private DNA matching, we consider the design of efficient protocols for secure text processing. Here, informally, a party P1 holds a text T and a party P2 holds a pattern p and some additional information y, and P2 wants to learn {f(T,j,y)} for all locations j where p is found as a substring in T. (In particular, this generalizes the basic pattern matching problem.) We aim for protocols with full security against a malicious P2 that also preserve privacy against a malicious P1 (i.e., one-sided security). We show how to modify Yao{\textquoteright}s garbled circuit approach to obtain a protocol where the size of the garbled circuit is linear in the number of occurrences of p in T (rather than linear in $|T|$). Along the way we show a new keyword search protocol that may be of independent interest.},
	keywords = {COMPUTATION, secure},
	isbn = {978-1-4503-0245-6},
	doi = {10.1145/1866307.1866361},
	url = {http://doi.acm.org/10.1145/1866307.1866361},
	author = {Katz, Jonathan and Malka,Lior}
}
@article {18277,
	title = {Security analysis for privacy preserving search of multimedia},
	journal = {Image Processing (ICIP)},
	year = {2010},
	month = {2010///},
	pages = {26 - 29},
	abstract = {With the increasing popularity of digital multimedia such asimages and videos and the advent of the cloud computing
paradigm, a fast growing amount of private and sensitive mul-
timedia data are being stored and managed over the network
cloud. To provide enhanced security and privacy protection
beyond traditional access control techniques, privacy preserv-
ing multimedia retrieval techniques have been proposed re-
cently to allow content-based multimedia retrieval directly
over encrypted databases and achieve accurate retrieval com-
parable to conventional retrieval schemes. In this paper, we
introduce a security definition for the privacy preserving re-
trieval scenario and show that the recently proposed schemes
are secure under the proposed security definition.
},
	author = {Lu,W. and Varna,A.L. and Wu,M.}
}
@article {19283,
	title = {Selective excitation of LI2 by chirped laser pulses with all possible interstate radiative couplings},
	journal = {The Journal of Chemical Physics},
	volume = {133},
	year = {2010},
	month = {2010},
	pages = {164313 - 164313-9},
	abstract = {We have numerically explored the feasibility and the mechanism of population transfer to the excited E 1Σg electronic state of Li2 from the v = 0 level of the ground electronic state X 1Σg using the A 1Σu state as an intermediate. In this system, the use of transform limited pulses with a frequency difference greater than the maximum Rabi frequency does not produce population transfer when all possible radiative couplings are taken into account. We have employed two synchronous pulses far detuned from the allowed transition frequencies, mainly with the lower frequency pulse positively chirped, and both pulses coupling the successive pair of states, X-A and A-E. The adiabaticity of the process has been investigated by a generalized Floquet calculation in the basis of 12 field dressed molecular states, and the results have been compared with those obtained from the full solution of time dependent Schr{\"o}dinger equation. The conventional representation of the process in terms of three (or four) adiabatic potentials is not valid. It has been found that for cases of almost complete population transfer in full calculations with the conservation of the vibrational quantum number, adiabatic passage is attained with the 12 state Floquet model but not with the six state model. The agreement between the full calculations and the 12 state Floquet calculations is generally good when the transfer is adiabatic. Another characteristic feature of this work is the gaining of control over the vibrational state preparation in the final electronic state by careful tuning of the laser parameters as well as the chirp rate sign. This causes time dependent changes in the adiabatic potentials and nonadiabatic transfers can be made to occur between them.},
	isbn = {00219606},
	url = {http://jcp.aip.org/resource/1/jcpsa6/v133/i16/p164313_s1},
	author = {Chatterjee, Souvik and Bhattacharyya, Shuvra S.}
}
@article {16592,
	title = {Self-assembly of neural networks viewed as swarm intelligence},
	journal = {Swarm Intelligence},
	volume = {4},
	year = {2010},
	month = {2010///},
	pages = {1 - 36},
	author = {Martin,C. E and Reggia, James A.}
}
@inbook {12507,
	title = {Semantic Video Content Analysis},
	booktitle = {Video Search and MiningVideo Search and Mining},
	series = {Studies in Computational Intelligence},
	volume = {287},
	year = {2010},
	month = {2010///},
	pages = {147 - 176},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In recent years, there has been significant interest in the area of automatically recognizing activities occurring in a camera{\textquoteright}s field of view and detecting abnormalities. The practical applications of such a system could include airport tarmac monitoring, or monitoring of activities in secure installations, to name a few. The difficulty of the problem is compounded by several factors: detection of primitive actions in spite of changes in illumination, occlusions and noise; complexmultiagent interaction;mapping of higher-level activities to lower-level primitive actions; variations in which the same semantic activity can be performed. In this chapter, we develop a theory of semantic activity analysis that addresses each of these issues in an integrated manner. Specifically, we discuss ontological representations of knowledge of a domain, integration of domain knowledge and statistical models for achieving semantic mappings, definition of logical languages to describe activities, and design of frameworks which integrate all the above aspects in a coherent way, thus laying the foundations of effective Semantic Video Content Analysis systems.},
	isbn = {978-3-642-12899-8},
	url = {http://dx.doi.org/10.1007/978-3-642-12900-1_6},
	author = {Albanese,Massimiliano and Turaga,Pavan and Chellapa, Rama and Pugliese,Andrea and Subrahmanian,V.},
	editor = {Schonfeld,Dan and Shan,Caifeng and Tao,Dacheng and Wang,Liang}
}
@conference {18282,
	title = {Semi non-intrusive training for cell-phone camera model linkage},
	booktitle = {Information Forensics and Security (WIFS), 2010 IEEE International Workshop on},
	year = {2010},
	month = {2010/12//},
	pages = {1 - 6},
	abstract = {This paper presents a study of cell-phone camera model linkage that matches digital images against potential makes / models of cell-phone camera sources using camera color interpolation features. The matching performance is examined and the dependency on the content of training image collection is evaluated via variance analysis. Training content dependency can be dealt with under the framework of component forensics, where cell-phone camera model linkage is seen as a combination of semi non-intrusive training and completely non-intrusive testing. Such a viewpoint suggests explicitly the goodness criterion of testing accuracy for training data selection. It also motivates other possible alternative training procedures based on different criteria, such as the training complexity, for which preliminary but promising experiment designs and results have been obtained.},
	keywords = {accuracy;training, analysis;cameras;cellular, analysis;image, camera, Color, colour, complexity;training, content, dependency;variance, feature;cell, forensics;digital, forensics;image, image, Interpolation, linkage;component, matching;interpolation;, matching;semi, model, nonintrusive, phone, radio;computer, training;testing},
	doi = {10.1109/WIFS.2010.5711468},
	author = {Chuang,Wei-Hong and M. Wu}
}
@article {19205,
	title = {Sensing Events Affecting Liquid Flow in a Liquid Distribution System},
	year = {2010},
	month = {2010},
	publisher = {University of Washington},
	abstract = {By monitoring pressure transients in a liquid within a liquid distribution system using only a single sensor, events such as the opening and closing of valves at specific fixtures are readily detected. The sensor, which can readily be coupled to a faucet bib, transmits an output signal to a computing device. Each such event can be identified by the device based by comparing characteristic features of the pressure transient waveform with previously observed characteristic features for events in the system. These characteristic features, which can include the varying pressure, derivative, and real Cepstrum of the pressure transient waveform, can be used to select a specific fixture where a valve open or close event has occurred. Flow to each fixture and leaks in the system can also be determined from the pressure transient signal. A second sensor disposed at a point disparate from the first sensor provides further event information.},
	url = {http://www.google.com/patents?id=2JXnAAAAEBAJ},
	author = {Patel,Shwetak N. and Fogarty,James A. and Jon Froehlich and Larson,Eric C.}
}
@inbook {16284,
	title = {Sequencing and Genome Assembly Using Next-Generation Technologies},
	booktitle = {Computational BiologyComputational Biology},
	series = {Methods in Molecular Biology},
	volume = {673},
	year = {2010},
	month = {2010///},
	pages = {1 - 17},
	publisher = {Humana Press},
	organization = {Humana Press},
	abstract = {Several sequencing technologies have been introduced in recent years that dramatically outperform the traditional Sanger technology in terms of throughput and cost. The data generated by these technologies are characterized by generally shorter read lengths (as low as 35 bp) and different error characteristics than Sanger data. Existing software tools for assembly and analysis of sequencing data are, therefore, ill-suited to handle the new types of data generated. This paper surveys the recent software packages aimed specifically at analyzing new generation sequencing data.},
	isbn = {978-1-60761-842-3},
	url = {http://dx.doi.org/10.1007/978-1-60761-842-3_1},
	author = {Nagarajan,Niranjan and Pop, Mihai},
	editor = {Feny{\"o},David}
}
@article {14734,
	title = {Serializing C intermediate representations for efficient and portable parsing},
	journal = {Software: Practice and Experience},
	volume = {40},
	year = {2010},
	month = {2010/03/01/},
	pages = {225 - 238},
	abstract = {C static analysis tools often use intermediate representations (IRs) that organize program data in a simple, well-structured manner. However, the C parsers that create IRs are slow, and because they are difficult to write, only a few implementations exist, limiting the languages in which a C static analysis can be written. To solve these problems, we investigate two language-independent, on-disk representations of C IRs: one using XML and the other using an Internet standard binary encoding called eXternal Data Representation (XDR). We benchmark the parsing speeds of both options, finding the XML to be about a factor of 2 slower than parsing C and the XDR over 6 times faster. Furthermore, we show that the XML files are far too large at 19 times the size of C source code, whereas XDR is only 2.2 times the C size. We also demonstrate the portability of our XDR system by presenting a C source code querying tool in Ruby. Our solution and the insights we gained from building it will be useful to analysis authors and other clients of C IRs. We have made our software freely available for download at http://www.cs.umd.edu/projects/PL/scil/. Copyright {\textcopyright} 2010 John Wiley\&Sons, Ltd.},
	keywords = {C, intermediate representations, parsing, static analysis, XDR, XML},
	isbn = {1097-024X},
	doi = {10.1002/spe.954},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.954/abstract},
	author = {Meister,Jeffrey A and Foster, Jeffrey S. and Hicks, Michael W.}
}
@article {12878,
	title = {Serodiversity and ecological distribution of Vibrio parahaemolyticus in the Venetian Lagoon, Northeast Italy},
	journal = {Environmental Microbiology Reports},
	volume = {2},
	year = {2010},
	month = {2010/02/01/},
	pages = {151 - 157},
	abstract = {Vibrio parahaemolyticus is a natural inhabitant of estuarine and marine environments constituting part of the autochthonous microflora. This species is associated with human gastroenteritis caused by ingestion of contaminated water and undercooked seafood. During the past several years, the number of V. parahaemolyticus gastroenteritis cases have increased worldwide, causing over half of all food-poisoning outbreaks of bacterial origin. Vibrio populations in water are known to be influenced by environmental factors. Notably, it has been shown that in different parts of the world the distribution of V. parahaemolyticus in the marine environment is related to the water temperature. In this study, we identified environmental determinants affecting distribution of V. parahaemolyticus in the Venetian Lagoon, in the Italian North Adriatic Sea. Data obtained revealed that sea surface temperature constitutes the key factor influencing occurrence of V. parahaemolyticus, but salinity and chlorophyll concentration are also important. Serotyping of a collection of V. parahaemolyticus environmental isolates revealed high serodiversity, with serotypes O3:KUT and O1:KUT, belonging to the {\textquoteleft}pandemic group{\textquoteright}, occurring with higher frequency. From our results, we conclude that there is no correlation between serotype and specific geographic site or season of the year. However, certain serotypes were isolated in the Lagoon during the entire 18 months of the study, strongly suggesting persistence in this environment.},
	isbn = {1758-2229},
	doi = {10.1111/j.1758-2229.2009.00123.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1758-2229.2009.00123.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=},
	author = {Caburlotto,Greta and Haley,Bradd J. and Lle{\`o},Maria M. and Huq,Anwar and Rita R Colwell}
}
@article {16397,
	title = {THE SHAKY LADDER HYPERPLANE-DEFINED FUNCTIONS AND CLASSIC DYNAMIC PROBLEMS},
	journal = {International Journal of Computational Intelligence and Applications},
	volume = {09},
	year = {2010},
	month = {2010///},
	pages = {33 - 33},
	abstract = {To improve the understanding of the GA in dynamic environments we explore a set of test problems, the shaky ladder hyper-defined functions (sl-hdf), and extend these functions to create versions that are equivalent to many classical dynamic problems. We do this by constraining the space of all sl-hdfs to create representations of these classical functions. We have examined three classical problems, and compared sl-hdf versions of these problems with their standard representations. These results show that the sl-hdfs are representative of a larger class of problems, and can represent a larger class of test suite. Previous results on sl-hdf showed that GA performance is best in the Defined Cliffs variant of the sl-hdf. We build upon these results to improve GA performance in several classes of real world dynamic problems by modifying the problem representation. These results lend insight into dynamic problems where the GA will perform well.},
	isbn = {1469-0268},
	doi = {10.1142/S1469026810002756},
	url = {http://www.worldscinet.com/ijcia/09/0901/S1469026810002756.html},
	author = {Alharbi,Abir and Rand, William}
}
@article {13089,
	title = {Shape analysis and its applications in image understanding},
	journal = {IEEE transactions on pattern analysis and machine intelligence},
	volume = {32},
	year = {2010},
	month = {2010///},
	pages = {604 - 618},
	abstract = {We propose a shape-based, hierarchical part-template matching approach to simultaneous human detection and segmentation combining local part-based and global shape-template-based schemes. The approach relies on the key idea of matching a part-template tree to images hierarchically to detect humans and estimate their poses. For learning a generic human detector, a pose-adaptive feature computation scheme is developed based on a tree matching approach. Instead of traditional concatenation-style image location-based feature encoding, we extract features adaptively in the context of human poses and train a kernel-SVM classifier to separate human/nonhuman patterns. Specifically, the features are collected in the local context of poses by tracing around the estimated shape boundaries. We also introduce an approach to multiple occluded human detection and segmentation based on an iterative occlusion compensation scheme. The output of our learned generic human detector can be used as an initial set of human hypotheses for the iterative optimization. We evaluate our approaches on three public pedestrian data sets (INRIA, MIT-CBCL, and USC-B) and two crowded sequences from Caviar Benchmark and Munich Airport data sets.},
	author = {Zhe Lin and Davis, Larry S.}
}
@article {13090,
	title = {Shape-based human detection and segmentation via hierarchical part-template matching},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {32},
	year = {2010},
	month = {2010///},
	pages = {604 - 618},
	abstract = {We propose a shape-based, hierarchical part-template matching approach to simultaneous human detection and segmentation combining local part-based and global shape-template-based schemes. The approach relies on the key idea of matching a part-template tree to images hierarchically to detect humans and estimate their poses. For learning a generic human detector, a pose-adaptive feature computation scheme is developed based on a tree matching approach. Instead of traditional concatenation-style image location-based feature encoding, we extract features adaptively in the context of human poses and train a kernel-SVM classifier to separate human/nonhuman patterns. Specifically, the features are collected in the local context of poses by tracing around the estimated shape boundaries. We also introduce an approach to multiple occluded human detection and segmentation based on an iterative occlusion compensation scheme. The output of our learned generic human detector can be used as an initial set of human hypotheses for the iterative optimization. We evaluate our approaches on three public pedestrian data sets (INRIA, MIT-CBCL, and USC-B) and two crowded sequences from Caviar Benchmark and Munich Airport data sets.},
	author = {Lin,Z. and Davis, Larry S.}
}
@article {13404,
	title = {Sharing-aware horizontal partitioning for exploiting correlations during query processing},
	journal = {Proc. VLDB Endow.},
	volume = {3},
	year = {2010},
	month = {2010/09//},
	pages = {542 - 553},
	abstract = {Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each partition having substantially different statistical characteristics. It is very compelling to discover such data partitions during query optimization and create multiple plans for a given query, one plan being optimal for a particular combination of data partitions. This scenario calls for the sharing of state among plans, so that common intermediate results are not recomputed. We study this problem in a setting with a routing-based query execution engine based on eddies [1]. Eddies naturally encapsulate horizontal partitioning and maximal state sharing across multiple plans. We define the notion of a conditional join plan, a novel representation of the search space that enables us to address the problem in a principled way. We present a low-overhead greedy algorithm that uses statistical summaries based on graphical models. Experimental results suggest an order of magnitude faster execution time over traditional optimization for high correlations, while maintaining the same performance for low correlations.},
	isbn = {2150-8097},
	url = {http://dl.acm.org/citation.cfm?id=1920841.1920911},
	author = {Tzoumas,Kostas and Deshpande, Amol and Jensen,Christian S.}
}
@article {13956,
	title = {Signal Processing for Audio HCI},
	journal = {Handbook of Signal Processing Systems},
	year = {2010},
	month = {2010///},
	pages = {243 - 265},
	abstract = {This chapter reviews recent advances in computer audio processing from the viewpoint of improving the human-computer interface. Microphone arrays are described as basic tools for untethered audio acquisition, and principles for the synthesis of realistic virtual audio are outlined. The influence of room acoustics on audio acquisition and production is also considered. The chapter finishes with a review of several relevant signal processing systems, including a fast head-related transfer function (HRTF) measurement system and a complete system for capture, visualization, and reproduction of auditory scenes.},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani}
}
@article {19298,
	title = {Signal Processing on Platforms with Multiple Cores: Part 2-Applications and Design [From the Guest Editors]},
	journal = {IEEE Signal Processing Magazine},
	volume = {27},
	year = {2010},
	month = {2010},
	pages = {20 - 21},
	abstract = {Platforms with multiple cores are now prevalent everywhere from desktops and graphics processors to laptops and embedded systems. By adding more parallel computational resources while managing power consumption, multicore platforms offer better programmability, performance, and power efficiency. Signal processing systems of tomorrow will be and must be implemented on platforms with multiple cores. Writing efficient parallel applications that utilize the computing capability of many processing cores require some effort. Signal processing algorithm designers must understand the nuances of a multicore computing engine; only then can the tremendous computing power that such platforms provide be harnessed efficiently. To give a thorough perspective of the area, we have organized two special issues on this topic.},
	keywords = {Concurrent computing, Embedded system, Energy management, Graphics, Multicore processing, Portable computers, Resource management, Signal design, Signal processing, Signal processing algorithms},
	isbn = {1053-5888},
	author = {Chen,Y. and Chakrabarti,C. and Bhattacharyya, Shuvra S. and Bougard, B.}
}
@inbook {19044,
	title = {Signatures of Reputation},
	booktitle = {Financial Cryptography and Data Security},
	series = {Lecture Notes in Computer Science},
	volume = {6052},
	year = {2010},
	month = {2010},
	pages = {400 - 407},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	keywords = {Computer science},
	isbn = {978-3-642-14576-6},
	url = {http://www.springerlink.com/content/8484428n77226512/abstract/},
	author = {Bethencourt, John and Elaine Shi and Song, Dawn},
	editor = {Sion, Radu}
}
@conference {19296,
	title = {Simulating dynamic communication systems using the core functional dataflow model},
	booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)},
	year = {2010},
	month = {2010},
	pages = {1538 - 1541},
	abstract = {The latest communication technologies invariably consist of modules with dynamic behavior. There exists a number of design tools for communication system design with their foundation in dataflow modeling semantics. These tools must not only support the functional specification of dynamic communication modules and subsystems but also provide accurate estimation of resource requirements for efficient simulation and implementation. We explore this trade-off - between flexible specification of dynamic behavior and accurate estimation of resource requirements - using a representative application employing an adaptive modulation scheme. We propose an approach for precise modeling of such applications based on a recently-introduced form of dynamic dataflow called core functional dataflow. From our proposed modeling approach, we show how parameterized looped schedules can be generated and analyzed to simulate applications with low run-time overhead as well as guaranteed bounded memory execution. We demonstrate our approach using the Advanced Design System from Agilent Technologies, Inc., which is a commercial tool for design and simulation of communication systems.},
	keywords = {adaptive modulation, Analytical models, Application software, Computational modeling, core functional dataflow model, Dataflow, dataflow modeling semantics, design tools, Digital signal processing, dynamic communication systems, functional specification, Hardware, modeling and simulation, Power system modeling, Predictive models, Processor scheduling, Production, Signal processing, software tools, wireless communication},
	author = {Sane, N. and Chia-Jui Hsu and Pino,J. L and Bhattacharyya, Shuvra S.}
}
@article {19725,
	title = {Sites Inferred by Metabolic Background Assertion Labeling (SIMBAL): adapting the Partial Phylogenetic Profiling algorithm to scan sequences for signatures that predict protein function.},
	journal = {BMC Bioinformatics},
	volume = {11},
	year = {2010},
	month = {2010},
	pages = {52},
	abstract = {<p><b>BACKGROUND: </b>Comparative genomics methods such as phylogenetic profiling can mine powerful inferences from inherently noisy biological data sets. We introduce Sites Inferred by Metabolic Background Assertion Labeling (SIMBAL), a method that applies the Partial Phylogenetic Profiling (PPP) approach locally within a protein sequence to discover short sequence signatures associated with functional sites. The approach is based on the basic scoring mechanism employed by PPP, namely the use of binomial distribution statistics to optimize sequence similarity cutoffs during searches of partitioned training sets.</p><p><b>RESULTS: </b>Here we illustrate and validate the ability of the SIMBAL method to find functionally relevant short sequence signatures by application to two well-characterized protein families. In the first example, we partitioned a family of ABC permeases using a metabolic background property (urea utilization). Thus, the TRUE set for this family comprised members whose genome of origin encoded a urea utilization system. By moving a sliding window across the sequence of a permease, and searching each subsequence in turn against the full set of partitioned proteins, the method found which local sequence signatures best correlated with the urea utilization trait. Mapping of SIMBAL "hot spots" onto crystal structures of homologous permeases reveals that the significant sites are gating determinants on the cytosolic face rather than, say, docking sites for the substrate-binding protein on the extracellular face. In the second example, we partitioned a protein methyltransferase family using gene proximity as a criterion. In this case, the TRUE set comprised those methyltransferases encoded near the gene for the substrate RF-1. SIMBAL identifies sequence regions that map onto the substrate-binding interface while ignoring regions involved in the methyltransferase reaction mechanism in general. Neither method for training set construction requires any prior experimental characterization.</p><p><b>CONCLUSIONS: </b>SIMBAL shows that, in functionally divergent protein families, selected short sequences often significantly outperform their full-length parent sequence for making functional predictions by sequence similarity, suggesting avenues for improved functional classifiers. When combined with structural data, SIMBAL affords the ability to localize and model functional sites.</p>},
	keywords = {algorithms, Amino Acid Sequence, Gene Expression Profiling, Molecular Sequence Data, Phylogeny, Proteins, Sequence Analysis, Protein, Structure-Activity Relationship},
	issn = {1471-2105},
	doi = {10.1186/1471-2105-11-52},
	author = {Jeremy D Selengut and Rusch, Douglas B and Haft, Daniel H}
}
@conference {16822,
	title = {Sorting in space: multidimensional, spatial, and metric data structures for computer graphics applications},
	booktitle = {ACM SIGGRAPH ASIA 2010 Courses},
	series = {SA {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {3:1{\textendash}3:52 - 3:1{\textendash}3:52},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The representation of spatial data is an important issue in game programming, computer graphics, visualization, solid modeling, and related areas including computer vision and geographic information systems (GIS). Many representations are currently used. Recently, there has been much interest in hierarchical representations such as quadtrees, octrees, and pyramids which are based on image hierarchies, as well methods that use bounding boxes which are based on object hierarchies. The key advantage of these representations is that they provide a way to index into space. In fact, they are little more than multidimensional sorts. They are compact and depending on the nature of the spatial data they save space as well as time and also facilitate operations such as search. This course provides a brief overview of hierarchical spatial data structures and related algorithms that make use of them. We describe hierarchical representations of points, lines, collections of small rectangles, regions, surfaces, and volumes. For region data, we point out the dimension-reduction property of the region quadtree and octree, as how to navigate between nodes in the same tree, thereby leading to the popularity of these representations in ray tracing applications. We also demonstrate how to use these representations for both raster and vector data. In the case of nonregion data, we show how these data structures can be used to compute nearest objects in an incremental fashion so that the number of objects need not be known in advance. We also review a number of different tessellations and show why hierarchical decomposition into squares instead of triangles or hexagons is preferred. In addition a demonstration of the SAND spatial browser based on the SAND spatial database system and of the VASCO JAVA applet illustrating these methods (found at http://www.cs.umd.edu/~hjs/quadtree/index.html) will be presented.},
	isbn = {978-1-4503-0527-3},
	doi = {10.1145/1900520.1900523},
	url = {http://doi.acm.org/10.1145/1900520.1900523},
	author = {Samet, Hanan}
}
@conference {15921,
	title = {Sparse representations and Random Projections for robust and cancelable biometrics},
	booktitle = {Control Automation Robotics Vision (ICARCV), 2010 11th International Conference on},
	year = {2010},
	month = {2010/12//},
	pages = {1 - 6},
	abstract = {In recent years, the theories of Sparse Representation (SR) and Compressed Sensing (CS) have emerged as powerful tools for efficiently processing data in non-traditional ways. An area of promise for these theories is biome $\#$x0301;trie identification. In this paper, we review the role of sparse representation and CS for efficient biome $\#$x0301;trie identification. Algorithms to perform identification from face and iris data are reviewed. By applying Random Projections it is possible to purposively hide the biome $\#$x0301;trie data within a template. This procedure can be effectively employed for securing and protecting personal biome $\#$x0301;trie data against theft. Some of the most compelling challenges and issues that confront research in biometrics using sparse representations and CS are also addressed.},
	keywords = {Biometric identification, Cancelable Biometrics, Compressed sensing, face data, face recognition, iris data, iris recognition, personal biometric data, Random Projections, robust biometrics, sparse representations},
	doi = {10.1109/ICARCV.2010.5707955},
	author = {Patel, Vishal M. and Chellapa, Rama and Tistarelli,M.}
}
@article {12487,
	title = {Sparsity inspired automatic target recognition},
	journal = {Proceedings of SPIE},
	volume = {7696},
	year = {2010},
	month = {2010/04/23/},
	pages = {76960Q-76960Q-8 - 76960Q-76960Q-8},
	abstract = {In this paper, we develop a framework for using only the needed data for automatic target recognition (ATR) algorithms using the recently developed theory of sparse representations and compressive sensing (CS). We show how sparsity can be helpful for efficient utilization of data, with the possibility of developing real-time, robust target classification. We verify the efficacy of the proposed algorithm in terms of the recognition rate on the well known Comanche forward-looking infrared (FLIR) data set consisting of ten different military targets at different orientations.},
	isbn = {0277786X},
	doi = {doi:10.1117/12.850533},
	url = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/7696/1/76960Q_1?isAuthorized=no},
	author = {Patel, Vishal M. and Nasrabadi,Nasser M. and Chellapa, Rama}
}
@article {12469,
	title = {Sparsity Motivated Automated Target Recognition},
	year = {2010},
	month = {2010/09/29/},
	abstract = {Sparsity-based methods have recently been suggested for tasks such as face and iris recognition. In this project, we evaluated the effectiveness of such methods for automatic target recognition in infrared images. We show how sparsity can be helpful for efficient utilization of data for target recognition. We evaluated the effectiveness of the proposed algorithm in terms of recognition rate and confusion matrices on the well known Comanche forward-looking infrared (FLIR) data set consisting of ten different military targets at different orientations. This work was done in collaboration with Dr. Nasser Nasrabadi, Chief Scientist, SEDD, Army research laboratory. This work will be presented at the International Conference on Image Processing being held in Hong Kong in September 2010. A journal paper reporting our work is under preparation.},
	keywords = {*ALGORITHMS, *INFRARED IMAGES, *TARGET RECOGNITION, ARMY RESEARCH, efficiency, FORWARD LOOKING INFRARED SYSTEMS, IMAGE PROCESSING, NUMERICAL MATHEMATICS, OPTICS, PE611102, TARGET DETECTION, TARGET DIRECTION, RANGE AND POSITION FINDING},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA535014},
	author = {Chellapa, Rama}
}
@article {12470,
	title = {Sparsity-Inspired Recognition of Targets in Infrared Images},
	year = {2010},
	month = {2010/09/29/},
	abstract = {Sparsity-based methods have recently been suggested for tasks such as face and iris recognition. In this project, we evaluated the effectiveness of such methods for automatic target recognition in infrared images. We show how sparsity can be helpful for efficient utilization of data for target recognition. We evaluated the effectiveness of the proposed algorithm in terms of recognition rate and confusion matrices on the well known Comanche forward-looking infrared (FLIR) data set consisting of ten different military targets at different orientations. This work was done in collaboration with Dr. Nasser Nasrabadi, Chief Scientist, SEDD, Army research laboratory. This work will be presented at the International Conference on Image Processing being held in Hong Kong in September 2010. A journal paper reporting our work is under preparation.},
	keywords = {*FORWARD LOOKING INFRARED SYSTEMS, *IMAGE PROCESSING, *TARGET RECOGNITION, algorithms, ARMY RESEARCH, ATR(AUTOMATIC TARGET RECOGNITION), AUTOMATIC, CNN(CONVENTIONAL NEURAL NETWORKS), CS(COMPRESSIVE SENSING), DISCRIMINANT ANALYSIS, FLIR(FORWARD LOOKING INFRARED), INFRARED DETECTION AND DETECTORS, INFRARED IMAGES, LDA(LINEAR DISCRIMINANT ANALYSIS), MILITARY OPERATIONS, MNN(MODULAR NEURAL NETWORKS), neural nets, PCA(PRINCIPAL COMPONENT ANALYSIS), PE611102, SPARSITY, TARGET DIRECTION, RANGE AND POSITION FINDING},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA535424},
	author = {Chellapa, Rama}
}
@conference {13332,
	title = {Spatial indexing on tetrahedral meshes},
	booktitle = {Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems},
	series = {GIS {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {506 - 509},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We address the problem of performing spatial queries on tetrahedral meshes. These latter arise in several application domains including 3D GIS, scientific visualization, finite element analysis. We have defined and implemented a family of spatial indexes, that we call tetrahedral trees. Tetrahedral trees subdivide a cubic domain containing the mesh in an octree or 3D kd-tree fashion, with three different subdivision criteria. Here, we present and compare such indexes, their memory usage, and spatial queries on them.},
	keywords = {kd-trees, octrees, spatial indexes, tetrahedral meshes},
	isbn = {978-1-4503-0428-3},
	doi = {10.1145/1869790.1869873},
	url = {http://doi.acm.org/10.1145/1869790.1869873},
	author = {De Floriani, Leila and Fellegara,Riccardo and Magillo,Paola}
}
@article {15559,
	title = {Spatio-temporal range searching over compressed kinetic sensor data},
	journal = {Algorithms{\textendash}ESA 2010},
	year = {2010},
	month = {2010///},
	pages = {386 - 397},
	abstract = {As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor objects in motion within their vicinity; the data associated with the movement of these objects are known as kinetic data. In an earlier paper we introduced an algorithm which, given a set of sensor observations, losslessly compresses this data to a size that is within a constant factor of the asymptotically optimal joint entropy bound. In this paper we present an efficient algorithm for answering spatio-temporal range queries. Our algorithm operates on a compressed representation of the data, without the need to decompress it. We analyze the efficiency of our algorithm in terms of a natural measure of information content, the joint entropy of the sensor outputs. We show that with space roughly equal to entropy, queries can be answered in time that is roughly logarithmic in entropy. In addition, we show experimentally that on real-world data our range searching structures use less space and have faster query times than the naive versions. These results represent the first solutions to range searching problems over compressed kinetic sensor data.},
	doi = {10.1007/978-3-642-15775-2_33},
	author = {Friedler,S. and Mount, Dave}
}
@article {12468,
	title = {Special Section on Distributed Camera Networks: Sensing, Processing, Communication, and Implementation},
	journal = {Image Processing, IEEE Transactions on},
	volume = {19},
	year = {2010},
	month = {2010/10//},
	pages = {2513 - 2515},
	abstract = {The eight papers in this special section span across theoretical and practical considerations of various aspects of distributed camera networks, including adaptive sensing, distributed processing, efficient communications, and versatile implementations.},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2010.2063650},
	author = {Chellapa, Rama and Heinzelman, W. and Konrad, J. and Schonfeld, D. and Wolf, M.}
}
@article {13087,
	title = {SPECIAL SECTION ON SHAPE ANALYSIS AND ITS APPLICATIONS IN IMAGE UNDERSTANDING},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {32},
	year = {2010},
	month = {2010///},
	pages = {0162 - 8828},
	author = {Srivastava, A. and Damon,J.N. and Dryden,I.L. and Jermyn,I.H. and Das,S. and Vaswani, N. and Huckemann,S. and Hotz,T. and Munk,A. and Lin,Z. and others}
}
@article {15397,
	title = {On Stability of Magnetization Dynamics in Nanoparticles},
	journal = {Magnetics, IEEE Transactions on},
	volume = {46},
	year = {2010},
	month = {2010/06//},
	pages = {1718 - 1721},
	abstract = {It is rigorously demonstrated that spatially uniform magnetization oscillations in sufficiently small ellipsoidal nanoparticles can be unconditionally stable with respect to spatially nonuniform perturbations. The proof reveals the dominant stabilizing effect of exchange field which is mathematically manifested through the Poincare inequality.},
	keywords = {(electron);magnetic, DYNAMICS, ellipsoidal, field;magnetization, inequality;exchange, INTERACTIONS, magnetization, nanoparticles;spatially, nonuniform, oscillations;spin-wave, particles;magnetisation;nanoparticles;spin, perturbations;exchange, perturbations;spatially, Poincare, stability;small, uniform, waves;},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2009.2039119},
	author = {Mayergoyz, Issak D and Serpico,C. and Bertotti,G.}
}
@conference {17423,
	title = {The state of visual analytics: Views on what visual analytics is and where it is going},
	booktitle = {2010 IEEE Symposium on Visual Analytics Science and Technology (VAST)},
	year = {2010},
	month = {2010/10/25/26},
	pages = {257 - 259},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In the 2005 publication "Illuminating the Path" visual analytics was defined as "the science of analytical reasoning facilitated by interactive visual interfaces." A lot of work has been done in visual analytics over the intervening five years. While visual analytics started in the United States with a focus on security, it is now a worldwide research agenda with a broad range of application domains. This is evidenced by efforts like the European VisMaster program and the upcoming Visual Analytics and Knowledge Discovery (VAKD) workshop, just to name two.There are still questions concerning where and how visual analytics fits in the large body of research and applications represented by the VisWeek community. This panel will present distinct viewpoints on what visual analytics is and its role in understanding complex information in a complex world. The goal of this panel is to engender discussion from the audience on the emergence and continued advancement of visual analytics and its role relative to fields of related research. Four distinguished panelists will provide their perspective on visual analytics focusing on what it is, what it should be, and thoughts about a development path between these two states. The purpose of the presentations is not to give a critical review of the literature but rather to give a review on the field and to provide a contextual perspective based on the panelists{\textquoteright} years of experience and accumulated knowledge.},
	keywords = {analytical reasoning, Data analysis, data mining, data visualisation, European VisMaster program, interactive visual interfaces, knowledge discovery, United States, visual analytics, VisWeek community},
	isbn = {978-1-4244-9488-0},
	doi = {10.1109/VAST.2010.5649078},
	author = {May,R. and Hanrahan,P. and Keim,D. A and Shneiderman, Ben and Card,S.}
}
@inbook {12497,
	title = {Statistical Analysis on Manifolds and Its Applications to Video Analysis},
	booktitle = {Video Search and MiningVideo Search and Mining},
	series = {Studies in Computational Intelligence},
	volume = {287},
	year = {2010},
	month = {2010///},
	pages = {115 - 144},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The analysis and interpretation of video data is an important component of modern vision applications such as biometrics, surveillance, motionsynthesis and web-based user interfaces. A common requirement among these very different applications is the ability to learn statistical models of appearance and motion from a collection of videos, and then use them for recognizing actions or persons in a new video. These applications in video analysis require statistical inference methods to be devised on non-Euclidean spaces or more formally on manifolds. This chapter outlines a broad survey of applications in video analysis that involve manifolds. We develop the required mathematical tools needed to perform statistical inference on manifolds and show their effectiveness in real video-understanding applications.},
	isbn = {978-3-642-12899-8},
	url = {http://dx.doi.org/10.1007/978-3-642-12900-1_5},
	author = {Turaga,Pavan and Veeraraghavan,Ashok and Srivastava,Anuj and Chellapa, Rama},
	editor = {Schonfeld,Dan and Shan,Caifeng and Tao,Dacheng and Wang,Liang}
}
@book {12505,
	title = {Statistical Methods and Models for Video-Based Tracking, Modeling, and Recognition},
	year = {2010},
	month = {2010///},
	publisher = {Now Publishers Inc},
	organization = {Now Publishers Inc},
	abstract = {Computer vision systems attempt to understand a scene and its components from mostly visual information. The geometry exhibited by the real world, the influence of material properties on scattering of incident light, and the process of imaging introduce constraints and properties that are key to solving some of these tasks. In the presence of noisy observations and other uncertainties, the algorithms make use of statistical methods for robust inference. Statistical Methods and Models for Video-based Tracking, Modeling, and Recognition highlights the role of geometric constraints in statistical estimation methods, and how the interplay of geometry and statistics leads to the choice and design of algorithms. In particular, it illustrates the role of imaging, illumination, and motion constraints in classical vision problems such as tracking, structure from motion, metrology, activity analysis and recognition, and appropriate statistical methods used in each of these problems.},
	keywords = {Computers / Computer Vision \& Pattern Recognition, Computers / Image Processing, Technology \& Engineering / Electronics / General, Technology \& Engineering / General},
	isbn = {9781601983145},
	author = {Chellapa, Rama and Sankaranarayanan,Aswin C. and Veeraraghavan,Ashok}
}
@article {18757,
	title = {Stochastic simulations with graphics hardware: Characterization of accuracy and performance},
	journal = {Journal of Computing and Information Science in Engineering},
	volume = {10},
	year = {2010},
	month = {2010///},
	pages = {011010 - 011010},
	author = {Balijepalli,A. and LeBrun,T. W. and Gupta,S.K.}
}
@conference {18864,
	title = {Strategy generation in multi-agent imperfect-information pursuit games},
	series = {AAMAS {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {947 - 954},
	publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
	organization = {International Foundation for Autonomous Agents and Multiagent Systems},
	address = {Richland, SC},
	abstract = {We describe a formalism and algorithms for game-tree search in partially-observable Euclidean space, and implementation and tests in a scenario where a multi-agent team, called tracking agents, pursues a target agent that wants to evade the tracking agents. Our contributions include--- {\textbullet} A formalism that combines geometric elements (agents{\textquoteright} locations and trajectories and observable regions, and obstacles that restrict mobility and observability) with game-theoretic elements (information sets, utility functions, and strategies). {\textbullet} A recursive formula for information-set minimax values based on our formalism, and a implementation of the formula in a game-tree search algorithm. {\textbullet} A heuristic evaluation function for use at the leaf nodes of the game-tree search. It works by doing a quick lookahead search of its own, in a relaxed version of the problem. {\textbullet} Experimental results in 500 randomly generated trials. With the strategies generated by our heuristic, the tracking agents were more than twice as likely to know the target agent{\textquoteright}s location at the end of the game than with the strategies generated by heuristics that compute estimates of the target{\textquoteright}s possible locations.},
	keywords = {game tree search, multi-agent planning, visibility-based pursuit-evasion games},
	isbn = {978-0-9826571-1-9},
	url = {http://dl.acm.org/citation.cfm?id=1838206.1838333},
	author = {Raboin,Eric and Nau, Dana S. and Kuter,Ugur and Gupta, Satyandra K. and Svec,Petr}
}
@article {19368,
	title = {Structural and dynamic determinants of ligand binding and regulation of cyclin-dependent kinase 5 by pathological activator p25 and inhibitory peptide CIP.},
	journal = {Journal of molecular biology},
	volume = {401},
	year = {2010},
	month = {2010 Aug 20},
	pages = {478-92},
	abstract = {The crystal structure of the cdk5/p25 complex has provided information on possible molecular mechanisms of the ligand binding, specificity, and regulation of the kinase. Comparative molecular dynamics simulations are reported here for physiological conditions. This study provides new insight on the mechanisms that modulate such processes, which may be exploited to control pathological activation by p25. The structural changes observed in the kinase are stabilized by a network of interactions involving highly conserved residues within the cyclin-dependent kinase (cdk) family. Collective motions of the proteins (cdk5, p25, and CIP) and their complexes are identified by principal component analysis, revealing two conformational states of the activation loop upon p25 complexation, which are absent in the uncomplexed kinase and not apparent from the crystal. Simulations of the uncomplexed inhibitor CIP show structural rearrangements and increased flexibility of the interfacial loop containing the critical residue E240, which becomes fully hydrated and available for interactions with one of several positively charged residues in the kinase. These changes provide a rationale for the observed high affinity and enhanced inhibitory action of CIP when compared to either p25 or the physiological activators of cdk5.},
	keywords = {Crystallography, X-Ray, Cyclin-Dependent Kinase 5, Cyclin-Dependent Kinase Inhibitor Proteins, HUMANS, Ligands, molecular dynamics simulation, Nerve Tissue Proteins, Principal component analysis, Protein Binding, Protein Conformation},
	issn = {1089-8638},
	doi = {10.1016/j.jmb.2010.06.040},
	author = {Cardone, Antonio and Hassan, S A and Albers,R.W. and Sriram,R.D. and Pant,H.C.}
}
@article {15811,
	title = {Structural Assembly of Molecular Complexes Based on Residual Dipolar Couplings},
	journal = {J. Am. Chem. Soc.},
	volume = {132},
	year = {2010},
	month = {2010///},
	pages = {8961 - 8972},
	abstract = {We present and evaluate a rigid-body molecular docking method, called PATIDOCK, that relies solely on the three-dimensional structure of the individual components and the experimentally derived residual dipolar couplings (RDCs) for the complex. We show that, given an accurate ab initio predictor of the alignment tensor from a protein structure, it is possible to accurately assemble a protein?protein complex by utilizing the RDCs? sensitivity to molecular shape to guide the docking. The proposed docking method is robust against experimental errors in the RDCs and computationally efficient. We analyze the accuracy and efficiency of this method using experimental or synthetic RDC data for several proteins, as well as synthetic data for a large variety of protein?protein complexes. We also test our method on two protein systems for which the structure of the complex and steric-alignment data are available (Lys48-linked diubiquitin and a complex of ubiquitin and a ubiquitin-associated domain) and analyze the effect of flexible unstructured tails on the outcome of docking. The results demonstrate that it is fundamentally possible to assemble a protein?protein complex solely on the basis of experimental RDC data and the prediction of the alignment tensor from 3D structures. Thus, despite the purely angular nature of RDCs, they can be converted into intermolecular distance/translational constraints. Additionally, we show a method for combining RDCs with other experimental data, such as ambiguous constraints from interface mapping, to further improve structure characterization of protein complexes.We present and evaluate a rigid-body molecular docking method, called PATIDOCK, that relies solely on the three-dimensional structure of the individual components and the experimentally derived residual dipolar couplings (RDCs) for the complex. We show that, given an accurate ab initio predictor of the alignment tensor from a protein structure, it is possible to accurately assemble a protein?protein complex by utilizing the RDCs? sensitivity to molecular shape to guide the docking. The proposed docking method is robust against experimental errors in the RDCs and computationally efficient. We analyze the accuracy and efficiency of this method using experimental or synthetic RDC data for several proteins, as well as synthetic data for a large variety of protein?protein complexes. We also test our method on two protein systems for which the structure of the complex and steric-alignment data are available (Lys48-linked diubiquitin and a complex of ubiquitin and a ubiquitin-associated domain) and analyze the effect of flexible unstructured tails on the outcome of docking. The results demonstrate that it is fundamentally possible to assemble a protein?protein complex solely on the basis of experimental RDC data and the prediction of the alignment tensor from 3D structures. Thus, despite the purely angular nature of RDCs, they can be converted into intermolecular distance/translational constraints. Additionally, we show a method for combining RDCs with other experimental data, such as ambiguous constraints from interface mapping, to further improve structure characterization of protein complexes.
},
	isbn = {0002-7863},
	doi = {10.1021/ja100447p},
	url = {http://dx.doi.org/10.1021/ja100447p},
	author = {Berlin,Konstantin and O{\textquoteright}Leary,Dianne P. and Fushman, David}
}
@article {14362,
	title = {Summary of the first ACM SIGKDD workshop on knowledge discovery from uncertain data (U{\textquoteright}09)},
	journal = {ACM SIGKDD Explorations Newsletter},
	volume = {11},
	year = {2010},
	month = {2010/05//},
	pages = {90 - 91},
	isbn = {1931-0145},
	doi = {10.1145/1809400.1809419},
	url = {http://doi.acm.org/10.1145/1809400.1809419},
	author = {Pei,Jian and Getoor, Lise and de Keijzer,Ander}
}
@article {14417,
	title = {A survey of link mining tasks for analyzing noisy and incomplete networks},
	journal = {Link Mining: Models, Algorithms, and Applications},
	year = {2010},
	month = {2010///},
	pages = {107 - 133},
	abstract = {Many data sets of interest today are best described as networks or graphs of interlinked entities. Examples include Web and text collections, social networks and social media sites, information, transaction and communication networks, and all manner of scientific networks, including biological networks. Unfortunately, often the data collection and extraction process for gathering these network data sets is imprecise, noisy, and/or incomplete. In this chapter, we review a collection of link mining algorithms that are well suited to analyzing and making inferences about networks, especially in the case where the data is noisy or missing.},
	doi = {10.1007/978-1-4419-6515-8_4},
	author = {Namata,G.M. and Sharara,H. and Getoor, Lise}
}
@article {18601,
	title = {SwitchBlade: a platform for rapid deployment of network protocols on programmable hardware},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {40},
	year = {2010},
	month = {2010/08//},
	pages = {183 - 194},
	abstract = {We present SwitchBlade, a platform for rapidly deploying custom protocols on programmable hardware. SwitchBlade uses a pipeline-based design that allows individual hardware modules to be enabled or disabled on the fly, integrates software exception handling, and provides support for forwarding based on custom header fields. SwitchBlade{\textquoteright}s ease of programmability and wire-speed performance enables rapid prototyping of custom data-plane functions that can be directly deployed in a production network. SwitchBlade integrates common packet-processing functions as hardware modules, enabling different protocols to use these functions without having to resynthesize hardware. SwitchBlade{\textquoteright}s customizable forwarding engine supports both longest-prefix matching in the packet header and exact matching on a hash value. SwitchBlade{\textquoteright}s software exceptions can be invoked based on either packet or flow-based rules and updated quickly at runtime, thus making it easy to integrate more flexible forwarding function into the pipeline. SwitchBlade also allows multiple custom data planes to operate in parallel on the same physical hardware, while providing complete isolation for protocols running in parallel. We implemented SwitchBlade using NetFPGA board, but SwitchBlade can be implemented with any FPGA. To demonstrate SwitchBlade{\textquoteright}s flexibility, we use SwitchBlade to implement and evaluate a variety of custom network protocols: we present instances of IPv4, IPv6, Path Splicing, and an OpenFlow switch, all running in parallel while forwarding packets at line rate.},
	keywords = {netfpga, network virtualization},
	isbn = {0146-4833},
	doi = {10.1145/1851275.1851206},
	url = {http://doi.acm.org/10.1145/1851275.1851206},
	author = {Anwer,Muhammad Bilal and Motiwala,Murtaza and Bin Tariq,Mukarram and Feamster, Nick}
}
@conference {14292,
	title = {Symbolic security analysis of ruby-on-rails web applications},
	booktitle = {Proceedings of the 17th ACM conference on Computer and communications security},
	year = {2010},
	month = {2010///},
	pages = {585 - 594},
	author = {Chaudhuri,A. and Foster, Jeffrey S.}
}
@article {12415,
	title = {Syntactic Topic Models},
	journal = {arXiv:1002.4665v1},
	year = {2010},
	month = {2010/02/24/},
	abstract = {The syntactic topic model (STM) is a Bayesian nonparametric model of language that discovers latent distributions of words (topics) that are both semantically and syntactically coherent. The STM models dependency parsed corpora where sentences are grouped into documents. It assumes that each word is drawn from a latent topic chosen by combining document-level features and the local syntactic context. Each document has a distribution over latent topics, as in topic models, which provides the semantic consistency. Each element in the dependency parse tree also has a distribution over the topics of its children, as in latent-state syntax models, which provides the syntactic consistency. These distributions are convolved so that the topic of each word is likely under both its document and syntactic context. We derive a fast posterior inference algorithm based on variational methods. We report qualitative and quantitative studies on both synthetic data and hand-parsed documents. We show that the STM is a more predictive model of language than current models based only on syntax or only on topics.},
	keywords = {Computer Science - Artificial Intelligence, Computer Science - Computation and Language, Mathematics - Statistics Theory},
	url = {http://arxiv.org/abs/1002.4665},
	author = {Jordan Boyd-Graber and Blei,David M.}
}
@article {13869,
	title = {System and method for analysis of an opinion expressed in documents with regard to a particular topic},
	volume = {11/808,278},
	year = {2010},
	month = {2010//01/28},
	abstract = {System and method for analysis of an opinion expressed in documents on a particular topic computes opinion strength on a continuous numeric scale, or qualitatively. A variety of opinion scoring techniques are plugged in to score opinion expressing words and sentences in documents. These scores are aggregated to measure the opinion intensity of documents. Multilingual opinion analysis is supported by capability to concurrently identify and visualize the opinion intensity expressed in documents in multiple languages. A multi-dimensional representation of the measured opinion intensity is generated which is agreeable with multi-lingual domain.},
	url = {http://www.google.com/patents?id=j9fLAAAAEBAJ},
	author = {V.S. Subrahmanian and Picariello,Antonio and Dorr, Bonnie J and Reforgiato,Diego Recupero and Cesarano,Carmine and Sagoff,Amelia}
}
@article {18284,
	title = {System and Method for Confidentiality-Preserving Rank-Ordered Search},
	volume = {12/608,724},
	year = {2010},
	month = {2010/06/10/},
	abstract = {A confidentiality preserving system and method for performing a rank-ordered search and retrieval of contents of a data collection. The system includes at least one computer system including a search and retrieval algorithm using term frequency and/or similar features for rank-ordering selective contents of the data collection, and enabling secure retrieval of the selective contents based on the rank-order. The search and retrieval algorithm includes a baseline algorithm, a partially server oriented algorithm, and/or a fully server oriented algorithm. The partially and/or fully server oriented algorithms use homomorphic and/or order preserving encryption for enabling search capability from a user other than an owner of the contents of the data collection. The confidentiality preserving method includes using term frequency for rank-ordering selective contents of the data collection, and retrieving the selective contents based on the rank-order.},
	url = {http://www.google.com/patents?id=kInVAAAAEBAJ},
	author = {Swaminathan,Ashwin and Mao,Yinian and Su,Guan-Ming and Gou,Hongmei and Varna,Avinash L. and He,Shan and M. Wu and Oard, Douglas}
}
@conference {18785,
	title = {A Systematic Methodology for Accurate Design-Stage Estimation of Energy Consumption for Injection Molded Parts},
	year = {2010},
	month = {2010///},
	abstract = {Today{\textquoteright}s ubiquitous use of plastics in product designand manufacturing presents significant environmental and
human health challenges. Injection molding, one of the most
commonly used processes for making plastic products,
consumes a significant amount of energy. A methodology for
accurately estimating the energy consumed to injection-mold a
part would enable environmentally conscious decision making
during the product design. Unfortunately, only limited
information is available at the design stage. Therefore,
accurately estimating energy consumption before the part has
gone into production can be challenging. In this paper, we
describe a methodology for energy estimation that works with
the limited amount of data available during the design stage,
namely the CAD model of the part, the material name, and the
production requirements. This methodology uses this data to
estimate the parameters of the runner system and an
appropriately sized molding machine. It then uses these
estimates to compute the machine setup time and the cycle time
required for the injection molding operation. This is done by
appropriately abstracting information available from the mold
flow simulation tools and analytical models that are
traditionally used during the manufacturing stage. These times
are then multiplied by the power consumed by the
appropriately sized machine during each stage of the molding
cycle to compute the estimated energy consumption per part.
},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.165.4139\&rep=rep1\&type=pdf},
	author = {Weissman,A. and Ananthanarayanan,A. and Gupta,S.K. and Sriram,R.D.}
}
@article {14730,
	title = {Safe and timely updates to multi-threaded programs},
	journal = {SIGPLAN Not.},
	volume = {44},
	year = {2009},
	month = {2009/06//},
	pages = {13 - 24},
	abstract = {Many dynamic updating systems have been developed that enable a program to be patched while it runs, to fix bugs or add new features. This paper explores techniques for supporting dynamic updates to multi-threaded programs, focusing on the problem of applying an update in a timely fashion while still producing correct behavior. Past work has shown that this tension of safety versus timeliness can be balanced for single-threaded programs. For multi-threaded programs, the task is more difficult because myriad thread interactions complicate understanding the possible program states to which a patch could be applied. Our approach allows the programmer to specify a few program points (e.g., one per thread) at which a patch may be applied, which simplifies reasoning about safety. To improve timeliness, a combination of static analysis and run-time support automatically expands these few points to many more that produce behavior equivalent to the originals. Experiments with thirteen realistic updates to three multi-threaded servers show that we can safely perform a dynamic update within milliseconds when more straightforward alternatives would delay some updates indefinitely.},
	keywords = {dynamic software updating, multi-threading, update safety, update timeliness},
	isbn = {0362-1340},
	doi = {10.1145/1543135.1542479},
	url = {http://doi.acm.org/10.1145/1543135.1542479},
	author = {Neamtiu,Iulian and Hicks, Michael W.}
}
@article {17926,
	title = {Saliency-guided lighting},
	journal = {IEICE TRANSACTIONS on Information and Systems},
	volume = {2},
	year = {2009},
	month = {2009///},
	pages = {369 - 73},
	author = {Lee,C. H and Kim,Y. and Varshney, Amitabh}
}
@conference {17911,
	title = {Salient Clustering for View-dependent Multiresolution Rendering},
	booktitle = {Computer Graphics and Image Processing (SIBGRAPI), 2009 XXII Brazilian Symposium on},
	year = {2009},
	month = {2009/10//},
	pages = {56 - 63},
	abstract = {Perceptual information is quickly gaining importance in mesh representation, analysis and rendering. User studies, eye tracking and other techniques are able to provide ever more useful insights for many user-centric systems, which form the bulk of computer graphics applications. In this work we build upon the concept of Mesh Saliency - an automatic measure of visual importance for triangle meshes based on models of low-level human visual attention - applying it to the problem of mesh segmentation and view-dependent rendering. We introduce a technique for segmentation that partitions an object into a set of face clusters, each encompassing a group of locally interesting features; Mesh Saliency is incorporated in a propagative mesh clustering framework, guiding cluster seed selection and triangle propagation costs and leading to a convergence of face clusters around perceptually important features. We compare our technique with different fully automatic segmentation algorithms, showing that it provides similar or better segmentation without the need for user input. We illustrate application of our clustering results through a saliency-guided view-dependent rendering system, achieving significant frame rate increases with little loss of visual detail.},
	keywords = {(computer, algorithms;cluster, analysis;mesh, attention;mesh, AUTOMATIC, centred, clustering, clustering;rendering, clustering;user-centric, clusters;low-level, dependent, design;, framework;salient, graphics);user, graphics;face, human, information;propagative, mesh, multiresolution, rendering;image, representation;mesh, resolution;image, saliency;mesh, seed, segmentation, segmentation;pattern, segmentation;perceptual, selection;computer, system;view, visual},
	doi = {10.1109/SIBGRAPI.2009.34},
	author = {Barni,R. and Comba,J. and Varshney, Amitabh}
}
@article {13971,
	title = {Scaling kernel machine learning algorithm via the use of GPUs},
	journal = {GPU Technology Conference},
	year = {2009},
	month = {2009///},
	author = {Srinivasan,B.V. and Duraiswami, Ramani}
}
@article {13114,
	title = {Scene it or not? incremental multiple kernel learning for object detection},
	journal = {Proceedings of the International Conference on Computer Vision},
	year = {2009},
	month = {2009///},
	author = {Kembhavi,A. and Siddiquie,B. and Miezianko,R. and McCloskey,S. and Davis, Larry S. and Schwartz, W.R. and Harwood,D. and Gupta,A. and Farrell,R. and Luo,Y. and others}
}
@article {17655,
	title = {Scheduling on Unrelated Machines under Tree-Like Precedence Constraints},
	journal = {Algorithmica},
	volume = {55},
	year = {2009},
	month = {2009///},
	pages = {205 - 226},
	abstract = {We present polylogarithmic approximations for the R | prec | C max and R | prec |∑ j w j C j problems, when the precedence constraints are {\textquotedblleft}treelike{\textquotedblright}{\textemdash}i.e., when the undirected graph underlying the precedences is a forest. These are the first non-trivial generalizations of the job shop scheduling problem to scheduling with precedence constraints that are not just chains. These are also the first non-trivial results for the weighted completion time objective on unrelated machines with precedence constraints of any kind . We obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment{\textemdash}this generalizes the job shop problem to these objective functions. We use the same lower bound of {\textquotedblleft}congestion + dilation{\textquotedblright}, as in other job shop scheduling approaches (e.g. Shmoys, Stein and Wein, SIAM J. Comput. 23, 617{\textendash}632, 1994 ). The first step in our algorithm for the R | prec | C max problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random-delays technique of Leighton, Maggs and Rao to the case of trees. For the special case of chains, we show a dependent rounding technique which leads to a bicriteria approximation algorithm for minimizing the flow time, a notoriously hard objective function.},
	isbn = {0178-4617},
	url = {http://dx.doi.org/10.1007/s00453-007-9004-y},
	author = {Anil Kumar,V. and Marathe,Madhav and Parthasarathy,Srinivasan and Srinivasan, Aravind}
}
@conference {14562,
	title = {Scheduling to minimize staleness and stretch in real-time data warehouses},
	booktitle = {Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures},
	year = {2009},
	month = {2009///},
	pages = {29 - 38},
	author = {Bateni,M. H and Golab,L. and Hajiaghayi, Mohammad T. and Karloff,H.}
}
@book {19349,
	title = {Scientific Computing with Case Studies},
	year = {2009},
	month = {2009},
	publisher = {SIAM},
	organization = {SIAM},
	abstract = {This book is a practical guide to the numerical solution of linear and nonlinear equations, differential equations, optimization problems, and eigenvalue problems. It treats standard problems and introduces important variants such as sparse systems, differential-algebraic equations, constrained optimization, Monte Carlo simulations, and parametric studies. Stability and error analysis are emphasized, and the Matlab algorithms are grounded in sound principles of software design and understanding of machine arithmetic and memory management. Nineteen case studies provide experience in mathematical modeling and algorithm design, motivated by problems in physics, engineering, epidemiology, chemistry, and biology. The topics included go well beyond the standard first-course syllabus, introducing important problems such as differential-algebraic equations and conic optimization problems, and important solution techniques such as continuation methods. The case studies cover a wide variety of fascinating applications, from modeling the spread of an epidemic to determining truss configurations.},
	isbn = {9780898717723},
	author = {O{\textquoteright}Leary, Dianne P.}
}
@conference {12154,
	title = {Scope error detection and handling concerning software estimation models},
	booktitle = {Proceedings of the 2009 3rd International Symposium on Empirical Software Engineering and Measurement},
	series = {ESEM {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {123 - 132},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Washington, DC, USA},
	abstract = {Over the last 25+ years, the software community has been searching for the best models for estimating variables of interest (e.g., cost, defects, and fault proneness). However, little research has been done to improve the reliability of the estimates. Over the last decades, scope error and error analysis have been substantially ignored by the community. This work attempts to fill this gap in the research and enhance a common understanding within the community. Results provided in this study can eventually be used to support human judgment-based techniques and be an addition to the portfolio. The novelty of this work is that, we provide a way of detecting and handling the scope error arising from estimation models. The answer whether or not scope error will occur is a pre-condition to safe use of an estimation model. We also provide a handy procedure for dealing with outliers as to whether or not to include them in the training set for building a new version of the estimation model. The majority of the work is empirically based, applying computational intelligence techniques to some COCOMO model variations with respect to a publicly available cost estimation data set in the PROMISE repository.},
	isbn = {978-1-4244-4842-5},
	doi = {10.1109/ESEM.2009.5316020},
	url = {http://dx.doi.org/10.1109/ESEM.2009.5316020},
	author = {Sarcia,Salvatore Alessandro and Basili, Victor R. and Cantone,Giovanni}
}
@conference {15023,
	title = {Search and Access Strategies for Web Archives},
	booktitle = {Proceedings of IS\&T Archiving 2009},
	year = {2009},
	month = {2009///},
	author = {Song,Sangchul and JaJa, Joseph F.}
}
@conference {18352,
	title = {Searching documentation using text, OCR, and image},
	booktitle = {Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {776 - 777},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We describe a mixed-modality method to index and search software documentation in three ways: plain text, OCR text of embedded figures, and visual features of these figures. Using a corpus of 102 computer books with a total of 62,943 pages and 75,800 figures, we empirically demonstrate that our method achieves better precision/recall than do alternatives based on single modalities.},
	keywords = {Computer vision, content-based image retrieval, multimodal search},
	isbn = {978-1-60558-483-6},
	doi = {10.1145/1571941.1572123},
	url = {http://doi.acm.org/10.1145/1571941.1572123},
	author = {Tom Yeh and Katz,Boris}
}
@article {16283,
	title = {Searching for SNPs with cloud computing},
	journal = {Genome Biology},
	volume = {10},
	year = {2009},
	month = {2009/11/20/},
	pages = {R134 - R134},
	abstract = {As DNA sequencing outpaces improvements in computer speed, there is a critical need to accelerate tasks like alignment and SNP calling. Crossbow is a cloud-computing software tool that combines the aligner Bowtie and the SNP caller SOAPsnp. Executing in parallel using Hadoop, Crossbow analyzes data comprising 38-fold coverage of the human genome in three hours using a 320-CPU cluster rented from a cloud computing service for about $85. Crossbow is available from http://bowtie-bio.sourceforge.net/crossbow/.},
	isbn = {1465-6906},
	doi = {10.1186/gb-2009-10-11-r134},
	url = {http://genomebiology.com/2009/10/11/R134},
	author = {Langmead,Ben and Schatz,Michael C and Jimmy Lin and Pop, Mihai and Salzberg,Steven L.}
}
@conference {19502,
	title = {Second ACM Workshop on Hot Topics in Software Upgrades (HotSWUp 2009)},
	series = {OOPSLA {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {705 - 706},
	publisher = {ACM},
	organization = {ACM},
	abstract = {The goal of HotSWUp is to identify cutting-edge research ideas for implementing software upgrades. In the presence of modified user requirements, deployment environments, and bug fixes, actively-used software must be upgraded continuously to ensure its utility and safety. The upgrades incorporate changes to the structure, behavior, configuration, data, or topology of a computer system. Whether applied offline or directly to a live system, such upgrades may have a significant impact on the performance and reliability of the software. Indeed, recent studies and a large body of anecdotal evidence suggest that, in practice, upgrades are failure-prone and can lead to outages, data corruption or latent errors. These problems not only inconvenience end users - they create a significant burden for organizations due to the associated downtime and high administrative costs.},
	keywords = {software, upgrades},
	isbn = {978-1-60558-768-4},
	url = {http://doi.acm.org/10.1145/1639950.1639974},
	author = {Tudor Dumitras and Neamtiu, Iulian and Tilevich, Eli}
}
@conference {18275,
	title = {Secure image retrieval through feature protection},
	booktitle = {Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on},
	year = {2009},
	month = {2009/04//},
	pages = {1533 - 1536},
	abstract = {This paper addresses the problem of image retrieval from an encrypted database, where data confidentiality is preserved both in the storage and retrieval process. The paper focuses on image feature protection techniques which enable similarity comparison among protected features. By utilizing both signal processing and cryptographic techniques, three schemes are investigated and compared, including bit-plane randomization, random projection, and randomized unary encoding. Experimental results show that secure image retrieval can achieve comparable retrieval performance to conventional image retrieval techniques without revealing information about image content. This work enriches the area of secure information retrieval and can find applications in secure online services for images and videos.},
	keywords = {bit-plane, confidentiality;data, database;image, databases;, encoding;signal, extraction;image, feature, processes;visual, processing;content-based, projection;randomized, protection;image, randomization;cryptographic, retrieval;cryptography;feature, retrieval;random, storage;encrypted, technique;data, unary},
	doi = {10.1109/ICASSP.2009.4959888},
	author = {Lu,Wenjun and Varna,A.L. and Swaminathan,A. and M. Wu}
}
@article {13111,
	title = {Segmentation using appearance of mesostructure roughness},
	journal = {International journal of computer vision},
	volume = {83},
	year = {2009},
	month = {2009///},
	pages = {248 - 273},
	abstract = {This paper introduces mesostructure roughness as an effective cue in image segmentation. Mesostructure roughness corresponds to small-scale bumps on the macrostructure (i.e., geometry) of objects. Specifically, the focus is on the texture that is created by the projection of the mesostructure roughness on the camera plane. Three intrinsic images are derived: reflectance, smooth-surface shading and mesostructure roughness shading (meta-texture images). A constructive approach is proposed for computing a meta-texture image by preserving, equalizing and enhancing the underlying surface-roughness across color, brightness and illumination variations. We evaluate the performance on sample images and illustrate quantitatively that different patches of the same material, in an image, are normalized in their statistics despite variations in color, brightness and illumination. We develop an algorithm for segmentation of an image into patches that share salient mesostructure roughness. Finally, segmentation by line-based boundary-detection is proposed and results are provided and compared to known algorithms.},
	author = {Yacoob,Yaser and Davis, Larry S.}
}
@conference {15895,
	title = {Selecting hierarchical clustering cut points for web person-name disambiguation},
	booktitle = {Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {778 - 779},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Hierarchical clustering is often used to cluster person-names referring to the same entities. Since the correct number of clusters for a given person-name is not known a priori, some way of deciding where to cut the resulting dendrogram to balance risks of over- or under-clustering is needed. This paper reports on experiments in which outcome-specific and result-set measures are used to learn a global similarity threshold. Results on the Web People Search (WePS)-2 task indicate that approximately 85\% of the optimal F1 measure can be achieved on held-out data.},
	keywords = {clustering, person-name disambiguation},
	isbn = {978-1-60558-483-6},
	doi = {10.1145/1571941.1572124},
	url = {http://doi.acm.org/10.1145/1571941.1572124},
	author = {Gong,Jun and Oard, Douglas}
}
@article {13856,
	title = {Semantically informed machine translation (SIMT)},
	journal = {SCALE summer workshop final report, Human Language Technology Center Of Excellence},
	year = {2009},
	month = {2009///},
	author = {Baker,K. and Bethard,S. and Bloodgood,M. and Brown,R. and Callison-Burch,C. and Coppersmith,G. and Dorr, Bonnie J and Filardo,W. and Giles,K. and Irvine,A. and others}
}
@article {13326,
	title = {Semantic-based segmentation and annotation of 3d models},
	journal = {Image Analysis and Processing{\textendash}ICIAP 2009},
	year = {2009},
	month = {2009///},
	pages = {103 - 112},
	abstract = {3D objects have become widely available and used in different application domains. Thus, it is becoming fundamental to use, integrate and develop techniques for extracting and maintaining their embedded knowledge. These techniques should be encapsulated in portable and intelligent systems able to semantically annotate the 3D object models in order to improve their usability and indexing, especially in innovative web cooperative environments. Lately, we are moving in this direction, with the definition and development of data structures, methods and interfaces for structuring and semantically annotating 3D complex models (and scenes) - even changing in time - according to ontology-driven metadata and following ontology-driven processes. Here, we concentrate on the tools for segmenting manifold 3D models and on the underline structural representation that we build and manipulate. We also describe the first prototype of an annotation tool which allows a hierarchical semantic-driven tagging of the segmented model and provides an interface from which the user can inspect and browse the entire segmentation graph.},
	doi = {10.1007/978-3-642-04146-4_13},
	author = {Papaleo,L. and De Floriani, Leila}
}
@article {17725,
	title = {On the Semidefinite B-Arnoldi Method},
	journal = {SIAM Journal on Matrix Analysis and Applications},
	volume = {31},
	year = {2009},
	month = {2009///},
	pages = {1458 - 1468},
	abstract = {The B-Arnoldi method is a variant of the ordinary Arnoldi method in which orthogonalization is done with respect to the inner product generated by a positive definite matrix $B$. It arises in connection with the generalized eigenvalue problem $Ax = \lambda Bx$. When $B$ is semidefinite, the algorithm can proceed formally, with {\textquotedblleft}orthogonalization{\textquotedblright} taking place in the semi-inner product generated by $B$. However, it has been observed that components of the Arnoldi vectors lying in the null space of $B$ can grow rapidly. In this paper we examine the source and consequences of this growth.},
	keywords = {Arnoldi{\textquoteright}s method, B-inner product, null-space component, semidefinite B},
	doi = {10.1137/090759252},
	url = {http://link.aip.org/link/?SML/31/1458/1},
	author = {Stewart, G.W.}
}
@conference {13059,
	title = {Semi-supervised or semi-unsupervised?},
	booktitle = {Proceedings of the NAACL HLT Workshop on Semisupervised Learning for Natural Language Processing},
	year = {2009},
	month = {2009///},
	pages = {84 - 85},
	author = {Daum{\'e}, Hal}
}
@conference {14322,
	title = {Sensing and predicting the pulse of the city through shared bicycling},
	booktitle = {International Joint Conference on Artificial Intelligence},
	year = {2009},
	month = {2009///},
	pages = {1420 - 1426},
	author = {Jon Froehlich and Neumann, J. and Oliver,N.}
}
@proceedings {19206,
	title = {Sensing opportunities for personalized feedback technology to reduce consumption},
	year = {2009},
	month = {2009},
	author = {Jon Froehlich and Everitt,K. and Fogarty,J. and Patel,S. and Landay,J.}
}
@article {11958,
	title = {Sensory grammars for sensor networks},
	journal = {Journal of Ambient Intelligence and Smart Environments},
	volume = {1},
	year = {2009},
	month = {2009///},
	pages = {15 - 21},
	author = {Aloimonos, J.}
}
@article {12882,
	title = {Serogroup, Virulence, and Genetic Traits of Vibrio Parahaemolyticus in the Estuarine Ecosystem of Bangladesh},
	journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.},
	volume = {75},
	year = {2009},
	month = {2009/10/01/},
	pages = {6268 - 6274},
	abstract = {Forty-two strains of Vibrio parahaemolyticus were isolated from Bay of Bengal estuaries and, with two clinical strains, analyzed for virulence, phenotypic, and molecular traits. Serological analysis indicated O8, O3, O1, and K21 to be the major O and K serogroups, respectively, and O8:K21, O1:KUT, and O3:KUT to be predominant. The K antigen(s) was untypeable, and pandemic serogroup O3:K6 was not detected. The presence of genes toxR and tlh were confirmed by PCR in all but two strains, which also lacked toxR. A total of 18 (41\%) strains possessed the virulence gene encoding thermostable direct hemolysin (TDH), and one had the TDH-related hemolysin (trh) gene, but not tdh. Ten (23\%) strains exhibited Kanagawa phenomenon that surrogates virulence, of which six, including the two clinical strains, possessed tdh. Of the 18 tdh-positive strains, 17 (94\%), including the two clinical strains, had the seromarker O8:K21, one was O9:KUT, and the single trh-positive strain was O1:KUT. None had the group-specific or ORF8 pandemic marker gene. DNA fingerprinting employing pulsed-field gel electrophoresis (PFGE) of SfiI-digested DNA and cluster analysis showed divergence among the strains. Dendrograms constructed using PFGE (SfiI) images from a soft database, including those of pandemic and nonpandemic strains of diverse geographic origin, however, showed that local strains formed a cluster, i.e., {\textquotedblleft}clonal cluster,{\textquotedblright} as did pandemic strains of diverse origin. The demonstrated prevalence of tdh-positive and diarrheagenic serogroup O8:K21 strains in coastal villages of Bangladesh indicates a significant human health risk for inhabitants.},
	isbn = {0099-2240, 1098-5336},
	doi = {10.1128/AEM.00266-09},
	url = {http://aem.asm.org/content/75/19/6268},
	author = {Alam,Munirul and Chowdhury,Wasimul B. and Bhuiyan,N. A. and Islam,Atiqul and Hasan,Nur A. and Nair,G. Balakrish and Watanabe,H. and Siddique,A. K. and Huq,Anwar and Sack,R. Bradley and Akhter,M. Z. and Grim,Christopher J. and Kam,K.-M. and Luey,C. K. Y. and Endtz,Hubert P. and Cravioto,Alejandro and Rita R Colwell}
}
@article {13271,
	title = {A set of tools for Representing, Decomposing and Visualizing non manifold Cellular Complexes},
	volume = {DISI-TR-09-06},
	year = {2009},
	month = {2009///},
	institution = {Department of Computer Science and Information Science, University of Genoa},
	abstract = {Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its decomposition into a collection of components with a simpler topology. Here, we consider a decomposition of a non-manifold shape into components which are almost manifolds, and we present a novel graph representation which highlights the non-manifold singularities shared by the components as well as their connectivity relations. We describe an algorithm for computing the decomposition and its associated graph representation. We present a new tool for visualizing the shape decomposition and its graph as an effective support to modeling, analyzing and understanding non-manifold shapes. We describe a new data structure for non-manifold simplicial complex that we used in our decomposition software and we provide a complete description of all functionalities of the library we developed.},
	author = {De Floriani, Leila and Panozzo,D. and Hui,A.}
}
@conference {13468,
	title = {Set-Based Boosting for Instance-Level Transfer},
	booktitle = {Data Mining Workshops, 2009. ICDMW {\textquoteright}09. IEEE International Conference on},
	year = {2009},
	month = {2009/12//},
	pages = {422 - 428},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The success of transfer to improve learning on a target task is highly dependent on the selected source data. Instance-based transfer methods reuse data from the source tasks to augment the training data for the target task. If poorly chosen, this source data may inhibit learning, resulting in negative transfer. The current best performing algorithm for instance-based transfer, TrAdaBoost, performs poorly when given irrelevant source data. We present a novel set-based boosting technique for instance-based transfer. The proposed algorithm, TransferBoost, boosts both individual instances and collective sets of instances from each source task. In effect, TransferBoost boosts each source task, assigning higher weight to those source tasks which show positive transferability to the target task, and then adjusts the weights of the instances within each source task via AdaBoost. The results demonstrate that TransferBoost significantly improves transfer performance over existing instance-based algorithms when given a mix of relevant and irrelevant source data.},
	isbn = {978-1-4244-5384-9},
	doi = {10.1109/ICDMW.2009.97},
	url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5360442\&tag=1},
	author = {Eaton,Eric and desJardins, Marie}
}
@mastersthesis {17358,
	title = {Shape Identification in Temporal Data Sets},
	year = {2009},
	month = {2009///},
	school = {Master{\textquoteright}s thesis, University of Maryland},
	abstract = {Shapes are a concise way to describe temporal variable behaviors.Some commonly used shapes are spikes, sinks, rises, and drops. A
spike describes a set of variable values that rapidly increase, then
immediately rapidly decrease. The variable may be the value of a
stock or a person{\textquoteright}s blood sugar levels. Shapes are abstract. Details
such as the height of spike or its rate increase, are lost in the ab-
straction. These hidden details make it difficult to define shapes
and compare one to another. For example, what attributes of a
spike determine its {\textquotedblleft}spikiness{\textquotedblright}? The ability to define and com-
pare shapes is important because it allows shapes to be identified
and ranked, according to an attribute of interest. Work has been
done in the area of shape identification through pattern matching
and other data mining techniques, but ideas combining the identifi-
cation and comparison of shapes have received less attention. This
paper fills the gap by presenting a set of shapes and the attributes
by which they can identified, compared, and ranked. Neither the set
of shapes, nor their attributes presented in this paper are exhaustive,
but it provides an example of how a shape{\textquoteright}s attributes can be used
for identification and comparison. The intention of this paper is not
to replace any particular mathematical method of identifying a par-
ticular behavior, but to provide a toolset for knowledge discovery
and an intuitive method of data mining for novices. Spikes, sinks,
rises, drops, lines, plateaus, valleys, and gaps are the shapes pre-
sented in this paper. Several attributes for each shape are defined.
These attributes will be the basis for constructing definitions that
allow the shapes to be identified and ranked. The second contri-
bution is an information visualization tool, TimeSearcher: Shape
Search Edition (SSE), which allows users to explore data sets using
the identification and ranking ideas in this paper.
},
	author = {Gregory,M.B. and Shneiderman, Ben}
}
@inbook {14908,
	title = {Shape Matching for Foliage Database Retrieval},
	booktitle = {Semantic Mining Technologies for Multimedia DatabasesSemantic Mining Technologies for Multimedia Databases},
	year = {2009},
	month = {2009///},
	pages = {100 - 100},
	author = {Ling,H. and Jacobs, David W.}
}
@article {15909,
	title = {Shearlet-Based Deconvolution},
	journal = {IEEE Transactions on Image Processing},
	volume = {18},
	year = {2009},
	month = {2009/12//},
	pages = {2673 - 2685},
	abstract = {In this paper, a new type of deconvolution algorithm is proposed that is based on estimating the image from a shearlet decomposition. Shearlets provide a multidirectional and multiscale decomposition that has been mathematically shown to represent distributed discontinuities such as edges better than traditional wavelets. Constructions such as curvelets and contourlets share similar properties, yet their implementations are significantly different from that of shearlets. Taking advantage of unique properties of a new M-channel implementation of the shearlet transform, we develop an algorithm that allows for the approximation inversion operator to be controlled on a multiscale and multidirectional basis. A key improvement over closely related approaches such as ForWaRD is the automatic determination of the threshold values for the noise shrinkage for each scale and direction without explicit knowledge of the noise variance using a generalized cross validation (GCV). Various tests show that this method can perform significantly better than many competitive deconvolution algorithms.},
	keywords = {approximation inversion operator, contourlets, curvelets, Deconvolution, distributed discontinuities, generalized cross validation, image restoration, M-channel implementation, shearlet-based deconvolution, shearlets, Wavelet transforms, wavelets},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2009.2029594},
	author = {Patel, Vishal M. and Easley,G. R and Healy,D. M}
}
@article {13645,
	title = {Signature Detection and Matching for Document Image Retrieval},
	journal = {IEEETransactions on Pattern Analysis and Machine Intelligence},
	volume = {31},
	year = {2009},
	month = {2009/11//},
	pages = {2015 - 2031},
	abstract = {As one of the most pervasive methods of individual identification and document authentication, signatures present convincing evidence and provide an important form of indexing for effective document image processing and retrieval in a broad range of applications. However, detection and segmentation of free-form objects such as signatures from clustered background is currently an open document analysis problem. In this paper, we focus on two fundamental problems in signature-based document image retrieval. First, we propose a novel multi-scale approach to jointly detecting and segmenting signatures from document images. Rather than focusing on local features that typically have large variations, our approach captures the structural saliency using a signature production model and computes the dynamic curvature of 2-D contour fragments over multiple scales. This detection framework is general and computationally tractable. Second, we treat the problem of signature retrieval in the unconstrained setting of translation, scale, and rotation invariant non-rigid shape matching. We propose two novel measures of shape dissimilarity based on anisotropic scaling and registration residual error, and present a supervised learning framework for combining complementary shape information from different dissimilarity metrics using LDA. We quantitatively study state-of-the-art shape representations, shape matching algorithms, measures of dissimilarity, and the use of multiple instances as query in document image retrieval. We further demonstrate our matching techniques in off-line signature verification. Extensive experiments using large real world collections of English and Arabic machine printed and handwritten documents demonstrate the excellent performance of our approaches.},
	author = {Zhu,Guangyu and Yefeng Zheng and David Doermann and Jaeger,Stefan}
}
@article {15082,
	title = {Signature schemes with bounded leakage resilience},
	journal = {Advances in Cryptology{\textendash}ASIACRYPT 2009},
	year = {2009},
	month = {2009///},
	pages = {703 - 720},
	abstract = {A leakage-resilient cryptosystem remains secure even if arbitrary, but bounded, information about the secret key (and possibly other internal state information) is leaked to an adversary. Denote the length of the secret key by n. We show:{\textbullet}  	A full-fledged signature scheme tolerating leakage of n - n ε bits of information about the secret key (for any constant ε> 0), based on general assumptions.
{\textbullet}  	A one-time signature scheme, based on the minimal assumption of one-way functions, tolerating leakage of (41-)n bits of information about the signer{\textquoteright}s entire state.
{\textbullet}  	A more efficient one-time signature scheme, that can be based on several specific assumptions, tolerating leakage of (21-)n bits of information about the signer{\textquoteright}s entire state.
The latter two constructions extend to give leakage-resilient t-time signature schemes. All the above constructions are in the standard model.
},
	doi = {10.1007/978-3-642-10366-7_41},
	author = {Katz, Jonathan and Vaikuntanathan,V.}
}
@article {15151,
	title = {Signing a linear subspace: Signature schemes for network coding},
	journal = {Public Key Cryptography{\textendash}PKC 2009},
	year = {2009},
	month = {2009///},
	pages = {68 - 87},
	abstract = {Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, network coding requires intermediate nodes to modify data packets en route; for this reason, standard signature schemes are inapplicable and it is a challenge to provide resilience to tampering by malicious nodes.We propose two signature schemes that can be used in conjunction with network coding to prevent malicious modification of data. Our schemes can be viewed as signing linear subspaces in the sense that a signature σ on a subspace V authenticates exactly those vectors in V. Our first scheme is (suitably) homomorphic and has constant public-key size and per-packet overhead. Our second scheme does not rely on random oracles and is based on weaker assumptions.
We also prove a lower bound on the length of signatures for linear subspaces showing that our schemes are essentially optimal in this regard.
},
	doi = {10.1007/978-3-642-00468-1_5},
	author = {Boneh,D. and Freeman,D. and Katz, Jonathan and Waters,B.}
}
@conference {18354,
	title = {Sikuli: using GUI screenshots for search and automation},
	booktitle = {Proceedings of the 22nd annual ACM symposium on User interface software and technology},
	series = {UIST {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {183 - 192},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We present Sikuli, a visual approach to search and automation of graphical user interfaces using screenshots. Sikuli allows users to take a screenshot of a GUI element (such as a toolbar button, icon, or dialog box) and query a help system using the screenshot instead of the element{\textquoteright}s name. Sikuli also provides a visual scripting API for automating GUI interactions, using screenshot patterns to direct mouse and keyboard events. We report a web-based user study showing that searching by screenshot is easy to learn and faster to specify than keywords. We also demonstrate several automation tasks suitable for visual scripting, such as map navigation and bus tracking, and show how visual scripting can improve interactive help systems previously proposed in the literature.},
	keywords = {Automation, image search, online help},
	isbn = {978-1-60558-745-5},
	doi = {10.1145/1622176.1622213},
	url = {http://doi.acm.org/10.1145/1622176.1622213},
	author = {Tom Yeh and Chang,Tsung-Hsiang and Miller,Robert C.}
}
@inbook {19645,
	title = {Simple, Black-Box Constructions of Adaptively Secure Protocols},
	booktitle = {Theory of Cryptography},
	series = {Lecture Notes in Computer Science},
	year = {2009},
	month = {2009/01/01/},
	pages = {387 - 402},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious adversary. Our compiler achieves security in the universal composability framework, assuming access to an ideal commitment functionality, and improves over previous work achieving the same security guarantee in two ways: it uses black-box access to the underlying protocol and achieves a constant multiplicative overhead in the round complexity. As a corollary, we obtain the first constructions of adaptively secure protocols in the stand-alone model using black-box access to a low-level primitive.},
	keywords = {Algorithm Analysis and Problem Complexity, computers and society, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, Systems and Data Security},
	isbn = {978-3-642-00456-8, 978-3-642-00457-5},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-00457-5_23},
	author = {Choi, Seung Geol and Dana Dachman-Soled and Malkin, Tal and Wee, Hoeteck},
	editor = {Reingold, Omer}
}
@article {15083,
	title = {Smooth projective hashing and password-based authenticated key exchange from lattices},
	journal = {Advances in Cryptology{\textendash}ASIACRYPT 2009},
	year = {2009},
	month = {2009///},
	pages = {636 - 652},
	abstract = {We describe a public-key encryption scheme based on lattices {\textemdash} specifically, based on the hardness of the learning with error (LWE) problem {\textemdash} that is secure against chosen-ciphertext attacks while admitting (a variant of) smooth projective hashing. This encryption scheme suffices to construct a protocol for password-based authenticated key exchange (PAKE) that can be proven secure based on the LWE assumption in the standard model. We thus obtain the first PAKE protocol whose security relies on a lattice-based assumption.},
	doi = {10.1007/978-3-642-10366-7_37},
	author = {Katz, Jonathan and Vaikuntanathan,V.}
}
@article {16831,
	title = {Sorting Spatial Data by Spatial Occupancy},
	journal = {GeoSpatial Visual Analytics},
	year = {2009},
	month = {2009///},
	pages = {31 - 43},
	abstract = {The increasing popularity of web-based mapping services such as Microsoft Virtual Earth and Google Maps/Earth has led to a dramatic increase in awareness of the importance of location as a component of data for the purposes of further processing as a means of enhancing the value of the nonspatial data and of visualization. Both of these purposes inevitably involve searching. The efficiency of searching is dependent on the extent to which the underlying data is sorted. The sorting is encapsulated by the data structure known as an index that is used to represent the spatial data thereby making it more accessible. The traditional role of the indexes is to sort the data, which means that they order the data. However, since generally no ordering exists in dimensions greater than 1 without a transformation of the data to one dimension, the role of the sort process is one of differentiating between the data and what is usually done is to sort the spatial objects with respect to the space that they occupy. The resulting ordering should be implicit rather than explicit so that the data need not be resorted (i.e., the index need not be rebuilt) when the queries change. The indexes are said to order the space and the characteristics of such indexes are explored further.},
	doi = {10.1007/978-90-481-2899-0_3},
	author = {Samet, Hanan}
}
@article {15610,
	title = {Space-time tradeoffs for approximate nearest neighbor searching},
	journal = {Journal of the ACM (JACM)},
	volume = {57},
	year = {2009},
	month = {2009/11//},
	pages = {1:1{\textendash}1:54 - 1:1{\textendash}1:54},
	abstract = {Nearest neighbor searching is the problem of preprocessing a set of n point points in d-dimensional space so that, given any query point q, it is possible to report the closest point to q rapidly. In approximate nearest neighbor searching, a parameter ϵ > 0 is given, and a multiplicative error of (1 + ϵ) is allowed. We assume that the dimension d is a constant and treat n and ϵ as asymptotic quantities. Numerous solutions have been proposed, ranging from low-space solutions having space O(n) and query time O(log n + 1/ϵd-1) to high-space solutions having space roughly O((n log n)/ϵd) and query time O(log (n/ϵ)). We show that there is a single approach to this fundamental problem, which both improves upon existing results and spans the spectrum of space-time tradeoffs. Given a tradeoff parameter γ, where 2 <= γ <= 1/ϵ, we show that there exists a data structure of space O(nγd-1 log(1/ϵ)) that can answer queries in time O(log(nγ) + 1/(ϵγ)(d-1)/2. When γ = 2, this yields a data structure of space O(n log (1/ϵ)) that can answer queries in time O(log n + 1/ϵ(d-1)/2). When γ = 1/ϵ, it provides a data structure of space O((n/ϵd-1)log(1/ϵ)) that can answer queries in time O(log(n/ϵ)). Our results are based on a data structure called a (t,ϵ)-AVD, which is a hierarchical quadtree-based subdivision of space into cells. Each cell stores up to t representative points of the set, such that for any query point q in the cell at least one of these points is an approximate nearest neighbor of q. We provide new algorithms for constructing AVDs and tools for analyzing their total space requirements. We also establish lower bounds on the space complexity of AVDs, and show that, up to a factor of O(log (1/ϵ)), our space bounds are asymptotically tight in the two extremes, γ = 2 and γ = 1/ϵ.},
	keywords = {nearest neighbor searching, space-time tradeoffs},
	isbn = {0004-5411},
	doi = {10.1145/1613676.1613677},
	url = {http://doi.acm.org/10.1145/1613676.1613677},
	author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave}
}
@conference {14863,
	title = {Sparse representation of cast shadows via l1-regularized least squares},
	booktitle = {Computer Vision, 2009 IEEE 12th International Conference on},
	year = {2009},
	month = {2009///},
	pages = {583 - 590},
	abstract = {Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by low-dimensional linear subspaces. However, in this paper we show that the set of images produced by a Lambertian scene with cast shadows can be efficiently represented by a sparse set of images generated by directional light sources. We first model an image with cast shadows as composed of a diffusive part (without cast shadows) and a residual part that captures cast shadows. Then, we express the problem in an $\#$x2113;<sub>1</sub>-regularized least squares formulation, with nonnegativity constraints. This sparse representation enjoys an effective and fast solution, thanks to recent advances in compressive sensing. In experiments on both synthetic and real data, our approach performs favorably in comparison to several previously proposed methods.},
	keywords = {$\#$x2113;<sub>1</sub>-regularized, approximations;lighting;, formulation;Lambertian, least, representation;image, representation;least, scene;cast, sensing;sparse, shadows;compressive, squares},
	doi = {10.1109/ICCV.2009.5459185},
	author = {Mei,Xue and Ling,Haibin and Jacobs, David W.}
}
@conference {15922,
	title = {Sparsity inspired selection and recognition of iris images},
	booktitle = {Biometrics: Theory, Applications, and Systems, 2009. BTAS {\textquoteright}09. IEEE 3rd International Conference on},
	year = {2009},
	month = {2009/09//},
	pages = {1 - 6},
	abstract = {Iris images acquired from a partially cooperating subject often suffer from blur, occlusion due to eyelids, and specular reflections. The performance of existing iris recognition systems degrade significantly on these images. Hence it is essential to select good images from the incoming iris video stream, before they are input to the recognition algorithm. In this paper, we propose a sparsity based algorithm for selection of good iris images and their subsequent recognition. Unlike most existing algorithms for iris image selection, our method can handle segmentation errors and a wider range of acquisition artifacts common in iris image capture. We perform selection and recognition in a single step which is more efficient than devising separate specialized algorithms for the two. Recognition from partially cooperating users is a significant step towards deploying iris systems in a wide variety of applications.},
	keywords = {biometrics (access control), image recognition, Image segmentation, iris image recognition, iris image selection, iris video stream, sparsity inspired selection, video signal processing, video streaming},
	doi = {10.1109/BTAS.2009.5339067},
	author = {Pillai,J.K. and Patel, Vishal M. and Chellapa, Rama}
}
@conference {16833,
	title = {Spatio-textual spreadsheets: geotagging via spatial coherence},
	booktitle = {Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems},
	series = {GIS {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {524 - 527},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The spatio-textual spreadsheet is a conventional spreadsheet where spatial attribute values are specified textually. Techniques are presented to automatically find the textually-specified spatial attributes that are present in spreadsheets. Once the spatial attributes have been identified, an accurate translation of the values of the spatial attributes to their actual geographic locations is needed (known as geotagging). The key observation is that spreadsheets with spatial data exhibit spatial coherence --- that is, cells with spatial data that are nearby in the spreadsheet contain data that share spatial characteristics in the real world. These techniques also allow richer search engine results by returning actual tuples from spreadsheets instead of simply links to the spreadsheets. Moreover, when the search key is a particular location, results in proximity to the query can be provided rather than just exact matches.},
	keywords = {geotagging, spatial coherence, spatio-textual, spreadsheets},
	isbn = {978-1-60558-649-6},
	doi = {10.1145/1653771.1653860},
	url = {http://doi.acm.org/10.1145/1653771.1653860},
	author = {Lieberman,Michael D. and Samet, Hanan and Sankaranarayanan,Jagan and Sperling,Jon}
}
@article {17992,
	title = {Spawn-join instruction set architecture for providing explicit multithreading},
	volume = {10/236,934},
	year = {2009},
	month = {2009/04/21/},
	abstract = {The invention presents a unique computational paradigm that provides the tools to take advantage of the parallelism inherent in parallel algorithms to the full spectrum from algorithms through architecture to implementation. The invention provides a new processing architecture that extends the standard instruction set of the conventional uniprocessor architecture. The architecture used to implement this new computational paradigm includes a thread control unit (34), a spawn control unit (38), and an enabled instruction memory (50). The architecture initiates multiple threads and executes them in parallel. Control of the threads is provided such that the threads may be suspended or allowed to execute each at its own pace.},
	url = {http://www.google.com/patents?id=YQTDAAAAEBAJ},
	author = {Vishkin, Uzi}
}
@conference {12414,
	title = {Speaking through pictures: images vs. icons},
	booktitle = {Proceedings of the 11th international ACM SIGACCESS conference on Computers and accessibility},
	series = {Assets {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {163 - 170},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {People with aphasia, a condition that impairs the ability to understand or generate written or spoken language, are aided by assistive technology that helps them communicate through a vocabulary of icons. These systems are akin to language translation systems, translating icon arrangements into spoken or written language and vice versa. However, these icon-based systems have little vocabulary breadth or depth, making it difficult for people with aphasia to apply their usage to multiple real world situations. Pictures from the web are numerous, varied, and easily accessible and thus, could potentially address the small size issues of icon-based systems. We present results from two studies that investigate this potential and demonstrate that images can be as effective as icons when used as a replacement for English language communication. The first study uses elderly subjects to investigate the efficacy of images vs. icons in conveying word meaning; the second study examines the retention of word-level meaning by both images and icons with a population of aphasics. We conclude that images collected from the web are as functional as icons in conveying information and thus, are feasible to use in assistive technology that supports people with aphasia.},
	keywords = {aphasia, computerized visual communication (C-VIC), visual communication (VIC)},
	isbn = {978-1-60558-558-1},
	doi = {10.1145/1639642.1639672},
	url = {http://doi.acm.org/10.1145/1639642.1639672},
	author = {Ma,Xiaojuan and Jordan Boyd-Graber and Nikolova,Sonya and Cook,Perry R.}
}
@article {17754,
	title = {SPOT Databases: Efficient Consistency Checking and Optimistic Selection in Probabilistic Spatial Databases},
	journal = {Knowledge and Data Engineering, IEEE Transactions on},
	volume = {21},
	year = {2009},
	month = {2009/01//},
	pages = {92 - 107},
	abstract = {Spatial probabilistic temporal (SPOT) databases are a paradigm for reasoning with probabilistic statements about where a vehicle may be now or in the future. They express statements of the form "Object O is in spatial region R at some time t with some probability in the interval [L,U]." Past work on SPOT databases has developed selection operators based on selecting SPOT atoms that are entailed by the SPOT database-we call this "cautious" selection. In this paper, we study several problems. First, we note that the runtime of consistency checking and cautious selection algorithms in past work is influenced greatly by the granularity of the underlying Cartesian space. In this paper, we first introduce the notion of "optimistic" selection, where we are interested in returning all SPOT atoms in a database that are consistent with respect to a query, rather than having an entailment relationship. We then develop an approach to scaling SPOT databases that has three main contributions: 1) We develop methods to eliminate variables from the linear programs used in past work, thus greatly reducing the size of the linear programs used-the resulting advances apply to consistency checking, optimistic selection, and cautious selection. 2) We develop a host of theorems to show how we can prune the search space when we are interested in optimistic selection. 3) We use the above contributions to build an efficient index to execute optimistic selection queries over SPOT databases. Our approach is superior to past work in two major respects: First, it makes fewer assumptions than all past works on this topic except that in. Second, our experiments, which are based on real-world data about ship movements, show that our algorithms are much more efficient than those in.},
	keywords = {Cartesian, checking;database, database;data, databases;, databases;visual, indexing;inference, indexing;linear, integrity;database, mechanisms;linear, probabilistic, problem;spatial, problems;temporal, processing;search, program;optimistic, programming;probability;query, query;probabilistic, reasoning;search, selection, selection;consistency, space;cautious, temporal},
	isbn = {1041-4347},
	doi = {10.1109/TKDE.2008.93},
	author = {Parker,A. and Infantes,G. and Grant,J. and V.S. Subrahmanian}
}
@conference {14738,
	title = {Static type inference for Ruby},
	booktitle = {Proceedings of the 2009 ACM symposium on Applied Computing},
	series = {SAC {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {1859 - 1866},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Many general-purpose, object-oriented scripting languages are dynamically typed, which provides flexibility but leaves the programmer without the benefits of static typing, including early error detection and the documentation provided by type annotations. This paper describes Diamondback Ruby (DRuby), a tool that blends Ruby{\textquoteright}s dynamic type system with a static typing discipline. DRuby provides a type language that is rich enough to precisely type Ruby code we have encountered, without unneeded complexity. When possible, DRuby infers static types to discover type errors in Ruby programs. When necessary, the programmer can provide DRuby with annotations that assign static types to dynamic code. These annotations are checked at run time, isolating type errors to unverified code. We applied DRuby to a suite of benchmarks and found several bugs that would cause run-time type errors. DRuby also reported a number of warnings that reveal questionable programming practices in the benchmarks. We believe that DRuby takes a major step toward bringing the benefits of combined static and dynamic typing to Ruby and other object-oriented languages.},
	keywords = {Contracts, dynamic typing, ruby, Type inference},
	isbn = {978-1-60558-166-8},
	doi = {10.1145/1529282.1529700},
	url = {http://doi.acm.org/10.1145/1529282.1529700},
	author = {Furr,Michael and An,Jong-hoon (David) and Foster, Jeffrey S. and Hicks, Michael W.}
}
@article {16287,
	title = {Statistical Methods for Detecting Differentially Abundant Features in Clinical Metagenomic Samples},
	journal = {PLoS Comput Biology},
	volume = {5},
	year = {2009},
	month = {2009/04/10/},
	pages = {e1000352 - e1000352},
	abstract = {The emerging field of metagenomics aims to understand the structure and function of microbial communities solely through DNA analysis. Current metagenomics studies comparing communities resemble large-scale clinical trials with multiple subjects from two general populations (e.g. sick and healthy). To improve analyses of this type of experimental data, we developed a statistical methodology for detecting differentially abundant features between microbial communities, that is, features that are enriched or depleted in one population versus another. We show our methods are applicable to various metagenomic data ranging from taxonomic information to functional annotations. We also provide an assessment of taxonomic differences in gut microbiota between lean and obese humans, as well as differences between the functional capacities of mature and infant gut microbiomes, and those of microbial and viral metagenomes. Our methods are the first to statistically address differential abundance in comparative metagenomics studies with multiple subjects, and we hope will give researchers a more complete picture of how exactly two environments differ.},
	doi = {10.1371/journal.pcbi.1000352},
	url = {UR  - http://dx.doi.org/10.1371/journal.pcbi.1000352,http://dx.doi.org/10.1371/journal.pcbi.1000352},
	author = {White,James Robert and Nagarajan,Niranjan and Pop, Mihai}
}
@article {16062,
	title = {The Story of One: Humanity scholarship with visualization and text analysis},
	journal = {Relation},
	volume = {10},
	year = {2009},
	month = {2009///},
	pages = {8485 - 8485},
	author = {Clement,T. and Plaisant, Catherine and Vuillemot,R.}
}
@conference {13048,
	title = {Streamed learning: one-pass SVMs},
	booktitle = {Proceedings of the 21st international jont conference on Artifical intelligence},
	year = {2009},
	month = {2009///},
	pages = {1211 - 1216},
	author = {Rai,P. and Daum{\'e}, Hal and Venkatasubramanian,S.}
}
@conference {13038,
	title = {Streaming for large scale NLP: Language modeling},
	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 = {512 - 520},
	author = {Goyal,A. and Daum{\'e}, Hal and Venkatasubramanian,S.}
}
@article {15030,
	title = {Streaming model based volume ray casting implementation for Cell Broadband Engine},
	journal = {Scientific Programming},
	volume = {17},
	year = {2009},
	month = {2009/01/01/},
	pages = {173 - 184},
	abstract = {Interactive high quality volume rendering is becoming increasingly more important as the amount of more complex volumetric data steadily grows. While a number of volumetric rendering techniques have been widely used, ray casting has been recognized as an effective approach for generating high quality visualization. However, for most users, the use of ray casting has been limited to datasets that are very small because of its high demands on computational power and memory bandwidth. However the recent introduction of the Cell Broadband Engine (Cell B.E.) processor, which consists of 9 heterogeneous cores designed to handle extremely demanding computations with large streams of data, provides an opportunity to put the ray casting into practical use. In this paper, we introduce an efficient parallel implementation of volume ray casting on the Cell B.E. The implementation is designed to take full advantage of the computational power and memory bandwidth of the Cell B.E. using an intricate orchestration of the ray casting computation on the available heterogeneous resources. Specifically, we introduce streaming model based schemes and techniques to efficiently implement acceleration techniques for ray casting on Cell B.E. In addition to ensuring effective SIMD utilization, our method provides two key benefits: there is no cost for empty space skipping and there is no memory bottleneck on moving volumetric data for processing. Our experimental results show that we can interactively render practical datasets on a single Cell B.E. processor.},
	doi = {10.3233/SPR-2009-0267},
	url = {http://dx.doi.org/10.3233/SPR-2009-0267},
	author = {Kim,Jusub and JaJa, Joseph F.}
}
@article {18721,
	title = {Structure of the S5a:K48-Linked Diubiquitin Complex and Its Interactions with Rpn13},
	journal = {Molecular Cell},
	volume = {35},
	year = {2009},
	month = {2009/08/14/},
	pages = {280 - 290},
	abstract = {SummaryDegradation by the proteasome typically requires substrate ubiquitination. Two ubiquitin receptors exist in the proteasome, S5a/Rpn10 and Rpn13. Whereas Rpn13 has only one ubiquitin-binding surface, S5a binds ubiquitin with two independent ubiquitin-interacting motifs (UIMs). Here, we use nuclear magnetic resonance (NMR) and analytical ultracentrifugation to define at atomic level resolution how S5a binds K48-linked diubiquitin, in which K48 of~one ubiquitin subunit (the {\textquotedblleft}proximal{\textquotedblright} one) is covalently bonded to G76 of the other (the {\textquotedblleft}distal{\textquotedblright} subunit). We demonstrate that S5a{\textquoteright}s UIMs bind the two subunits simultaneously with a preference for UIM2 binding to the proximal subunit while UIM1 binds to the distal one. In addition, NMR experiments reveal that Rpn13 and S5a bind K48-linked diubiquitin simultaneously with subunit specificity, and a model structure of S5a and Rpn13 bound to K48-linked polyubiquitin is provided. Altogether, our data demonstrate that S5a is highly adaptive and cooperative toward binding ubiquitin chains.
},
	keywords = {Proteins},
	isbn = {1097-2765},
	doi = {10.1016/j.molcel.2009.06.010},
	url = {http://www.sciencedirect.com/science/article/pii/S1097276509004018},
	author = {Zhang,Naixia and Wang,Qinghua and Ehlinger,Aaron and Randles,Leah and Lary,Jeffrey W. and Kang,Yang and Haririnia,Aydin and Storaska,Andrew J. and Cole,James L. and Fushman, David and Walters,Kylie J.}
}
@article {13333,
	title = {Supercubes: A High-Level Primitive for Diamond Hierarchies},
	journal = {Visualization and Computer Graphics, IEEE Transactions on},
	volume = {15},
	year = {2009},
	month = {2009///},
	pages = {1603 - 1610},
	abstract = {Volumetric datasets are often modeled using a multiresolution approach based on a nested decomposition of the domain into a polyhedral mesh. Nested tetrahedral meshes generated through the longest edge bisection rule are commonly used to decompose regular volumetric datasets since they produce highly adaptive crack-free representations. Efficient representations for such models have been achieved by clustering the set of tetrahedra sharing a common longest edge into a structure called a diamond. The alignment and orientation of the longest edge can be used to implicitly determine the geometry of a diamond and its relations to the other diamonds within the hierarchy. We introduce the supercube as a high-level primitive within such meshes that encompasses all unique types of diamonds. A supercube is a coherent set of edges corresponding to three consecutive levels of subdivision. Diamonds are uniquely characterized by the longest edge of the tetrahedra forming them and are clustered in supercubes through the association of the longest edge of a diamond with a unique edge in a supercube. Supercubes are thus a compact and highly efficient means of associating information with a subset of the vertices, edges and tetrahedra of the meshes generated through longest edge bisection. We demonstrate the effectiveness of the supercube representation when encoding multiresolution diamond hierarchies built on a subset of the points of a regular grid. We also show how supercubes can be used to efficiently extract meshes from diamond hierarchies and to reduce the storage requirements of such variable-resolution meshes.},
	keywords = {(computer, adaptive, approach;nested, bisection, crack-free, datasets;computational, decomposition;nested, diamond, generation;rendering, geometry;mesh, graphics);, hierarchies;edge, mesh;supercubes;tetrahedra, meshes;polyhedral, representations;multiresolution, rule;highly, sharing;volumetric, tetrahedral},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2009.186},
	author = {Weiss,K. and De Floriani, Leila}
}
@conference {14455,
	title = {Supervised and unsupervised methods in employing discourse relations for improving opinion polarity classification},
	booktitle = {Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1},
	series = {EMNLP {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {170 - 179},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {This work investigates design choices in modeling a discourse scheme for improving opinion polarity classification. For this, two diverse global inference paradigms are used: a supervised collective classification framework and an unsupervised optimization framework. Both approaches perform substantially better than baseline approaches, establishing the efficacy of the methods and the underlying discourse scheme. We also present quantitative and qualitative analyses showing how the improvements are achieved.},
	isbn = {978-1-932432-59-6},
	url = {http://dl.acm.org/citation.cfm?id=1699510.1699533},
	author = {Somasundaran,Swapna and Namata,Galileo and Wiebe,Janyce and Getoor, Lise}
}
@article {12539,
	title = {Surface reconstruction from gradient fields via gradient transformations},
	journal = {International Journal of Computer Vision},
	year = {2009},
	month = {2009///},
	author = {Agrawal,A. and Raskar, R. and Chellapa, Rama}
}
@article {18807,
	title = {A survey of CAD model simplification techniques for physics-based simulation applications},
	journal = {Computer-Aided Design},
	volume = {41},
	year = {2009},
	month = {2009/02//},
	pages = {65 - 80},
	abstract = {Automated CAD model simplification plays an important role in effectively utilizing physics-based simulation during the product realization process. Currently a rich body of literature exists that describe many successful techniques for fully-automatic or semi-automatic simplification of CAD models for a wide variety of applications. The purpose of this paper is to compile a list of the techniques that are relevant for physics-based simulations problems and to characterize them based on their attributes. We have classified them into the following four categories: techniques based on surface entity based operators, volume entity based operators, explicit feature based operators, and dimension reduction operators. This paper also presents the necessary background information in the CAD model representation to assist the new readers. We conclude the paper by outlining open research directions in this field.},
	keywords = {CAD model simplification, Physics-based simulation},
	isbn = {0010-4485},
	doi = {10.1016/j.cad.2008.11.009},
	url = {http://www.sciencedirect.com/science/article/pii/S0010448508002285},
	author = {Thakur,Atul and Banerjee,Ashis Gopal and Gupta, Satyandra K.}
}
@article {18808,
	title = {A survey of snake-inspired robot designs},
	journal = {Bioinspiration \& Biomimetics},
	volume = {4},
	year = {2009},
	month = {2009/06/01/},
	pages = {021001 - 021001},
	abstract = {Body undulation used by snakes and the physical architecture of a snake body may offer significant benefits over typical legged or wheeled locomotion designs in certain types of scenarios. A large number of research groups have developed snake-inspired robots to exploit these benefits. The purpose of this review is to report different types of snake-inspired robot designs and categorize them based on their main characteristics. For each category, we discuss their relative advantages and disadvantages. This review will assist in familiarizing a newcomer to the field with the existing designs and their distinguishing features. We hope that by studying existing robots, future designers will be able to create new designs by adopting features from successful robots. The review also summarizes the design challenges associated with the further advancement of the field and deploying snake-inspired robots in practice.},
	isbn = {1748-3182, 1748-3190},
	doi = {10.1088/1748-3182/4/2/021001},
	url = {http://iopscience.iop.org/1748-3182/4/2/021001},
	author = {Hopkins,James K. and Spranklin,Brent W. and Gupta, Satyandra K.}
}
@conference {12236,
	title = {Symbiotic relationships in internet routing overlays},
	booktitle = {Proceedings of the 6th USENIX symposium on Networked systems design and implementation},
	series = {NSDI{\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {467 - 480},
	publisher = {USENIX Association},
	organization = {USENIX Association},
	address = {Berkeley, CA, USA},
	abstract = {We propose to construct routing overlay networks using the following principle: that overlay edges should be based on mutual advantage between pairs of hosts. Upon this principle, we design, implement, and evaluate Peer-Wise, a latency-reducing overlay network. To show the feasibility of PeerWise, we must show first that mutual advantage exists in the Internet: perhaps contrary to expectation, that there are not only "haves" and "have nots" of low-latency connectivity. Second, we must provide a scalable means of finding promising edges and overlay routes; we seek embedding error in network coordinates to expose both shorter-than-default "detour" routes and longer-than-expected default routes. We evaluate the cost of limiting PeerWise to mutually advantageous links, then build the intelligent components that put PeerWise into practice. We design and evaluate "virtual" network coordinates for destinations not participating in the overlay, neighbor selection algorithms to find promising relays, and relay selection algorithms to choose the neighbor to traverse for a good detour. Finally, we show that PeerWise is practical through a wide-area deployment and evaluation.},
	url = {http://dl.acm.org/citation.cfm?id=1558977.1559009},
	author = {Lumezanu,Cristian and Baden,Randy and Levin,Dave and Spring, Neil and Bhattacharjee, Bobby}
}
@article {13868,
	title = {Symbolic-to-statistical hybridization: extending generation-heavy machine translation},
	journal = {Machine Translation},
	volume = {23},
	year = {2009},
	month = {2009///},
	pages = {23 - 63},
	abstract = {The last few years have witnessed an increasing interest in hybridizing surface-based statistical approaches and rule-based symbolic approaches to machine translation (MT). Much of that work is focused on extending statistical MT systems with symbolic knowledge and components. In the brand of hybridization discussed here, we go in the opposite direction: adding statistical bilingual components to a symbolic system. Our base system is Generation-heavy machine translation (GHMT), a primarily symbolic asymmetrical approach that addresses the issue of Interlingual MT resource poverty in source-poor/target-rich language pairs by exploiting symbolic and statistical target-language resources. GHMT{\textquoteright}s statistical components are limited to target-language models, which arguably makes it a simple form of a hybrid system . We extend the hybrid nature of GHMT by adding statistical bilingual components. We also describe the details of retargeting it to Arabic{\textendash}English MT. The morphological richness of Arabic brings several challenges to the hybridization task. We conduct an extensive evaluation of multiple system variants. Our evaluation shows that this new variant of GHMT{\textemdash}a primarily symbolic system extended with monolingual and bilingual statistical components{\textemdash}has a higher degree of grammaticality than a phrase-based statistical MT system, where grammaticality is measured in terms of correct verb-argument realization and long-distance dependency translation.},
	isbn = {0922-6567},
	url = {http://dx.doi.org/10.1007/s10590-009-9056-7},
	author = {Habash,Nizar and Dorr, Bonnie J and Monz,Christof}
}
@article {15275,
	title = {A synthesis for exactly 3-edge-connected graphs},
	journal = {Arxiv preprint arXiv:0905.1053},
	year = {2009},
	month = {2009///},
	author = {Kingsford, Carl and Mar{\c c}ais,G.}
}
@article {13110,
	title = {System and method for fast illumination-invariant background subtraction ...},
	volume = {11/282,513},
	year = {2009},
	month = {2009/03/31/},
	abstract = {A method for eliminating errors in foreground object detection in digitized images comprises providing a reference camera and a secondary camera, vertically aligning each said camera with a baseline that is approximately perpendicular to a ground plane, wherein said reference camera is placed lower than said secondary camera, selecting a foreground pixel in a reference view of a first point in a foreground object, finding a conjugate pixel of the foreground pixel in a secondary view, using the foreground and conjugate pixels to determine an image base pixel of a base point in the reference view, wherein said base point is a point on the ground plane below the first point, and using the foreground and image base pixels to find a location where the ground plane is first visible.},
	url = {http://www.google.com/patents?id=8yK_AAAAEBAJ},
	author = {Lim,Ser-Nam and Mittal,Anurag and Davis, Larry S.},
	editor = {Siemens Corporate Research, Inc.}
}
@article {11909,
	title = {System and Method for Spatio-Temporal-Context Aware Interaction of Users ...},
	volume = {12/267,921},
	year = {2009},
	month = {2009/05/14/},
	abstract = {A multifunctional interaction system which is capable of spatio-temporal context localization of users and of communication of audio/video streams to an entity of interest defined by the user, includes a communication domain supporting a predefined localization service, a server associated with the communication domain, client devices, and a dynamically changing context database which is customized in accord with the dynamics of interaction sessions of client devices with the server. The client communicates with the system to either request services therefrom or to send a message to the entity of interest. The system is provided with a panic alert mechanism which, upon actuation, transmits an audio/video data stream along with the client location tag, time stamp, and client ID, to a police precinct for prompt action.},
	url = {http://www.google.com/patents?id=nZbGAAAAEBAJ},
	author = {Agrawala, Ashok K. and Varshney, Amitabh and Almazan,Christian B.},
	editor = {University of Maryland}
}
@article {17991,
	title = {SYSTEM AND METHOD FOR THREAD HANDLING IN MULTITHREADED PARALLEL COMPUTING OF NESTED THREADS},
	volume = {12/158,004},
	year = {2009},
	month = {2009/05/14/},
	abstract = {An Explicit Multi-Threading (XMT) system and method is provided for processing multiple spawned threads associated with SPAWN-type commands of an XMT program. The method includes executing a plurality of child threads by a plurality of TCUs including a first TCU executing a child thread which is allocated to it; completing execution of the child thread by the first TCU; announcing that the first TCU is available to execute another child thread; executing by a second TCU a parent child thread that includes a nested spawn-type command for spawning additional child threads of the plurality of child threads, wherein the parent child thread is related in a parent-child relationship to the child threads that are spawned in conjunction with the nested spawn-type command; assigning a thread ID (TID) to each child thread, wherein the TID is unique with respect to the other TIDs; and allocating a new child thread to the first TCU.},
	url = {http://www.google.com/patents?id=qJjGAAAAEBAJ},
	author = {Wen,Xingzhi and Vishkin, Uzi}
}
@article {18771,
	title = {A systematic approach for designing multifunctional thermally conducting polymer structures with embedded actuators},
	journal = {Journal of Mechanical Design},
	volume = {131},
	year = {2009},
	month = {2009///},
	pages = {111009 - 111009},
	author = {Bejgerowski,W. and Gupta,S.K. and Bruck,H. A.}
}
@conference {12318,
	title = {System-level Clustering and Timing Analysis for GALS-based Dataflow Architectures},
	booktitle = {In Proceedings of the ACM International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, Austin, Texas, February 2009.},
	year = {2009},
	month = {2009///},
	abstract = {In this paper, we propose an approach based ondataflow techniques for modeling application-specific, globally
asynchronous, locally synchronous (GALS) architectures for
digital signal processing (DSP) applications, and analyzing the
performance of such architectures. Dataflow-based techniques
are attractive for DSP applications because they allow applica-
tion behavior to be represented formally, analyzed at a high
level of abstraction, and synthesized to software/hardware
implementations through an optimized, automated process. In
our proposed methodology, we employ dataflow-based compu-
tational models to expose relevant structure in the targeted
applications, and facilitate the manual or automatic derivation
of efficient implementations. We demonstrate the utility of our
modeling and analysis techniques by applying them as core
parts of a novel clustering algorithm that is geared towards
optimizing the throughput of GALS-based DSP architectures.
},
	author = {Shen,C. and Bhattacharyya, Shuvra S.}
}
@conference {12228,
	title = {Systems-compatible incentives},
	booktitle = {Game Theory for Networks, 2009. GameNets {\textquoteright}09. International Conference on},
	year = {2009},
	month = {2009/05//},
	pages = {100 - 106},
	abstract = {Selfish participants in a distributed system attempt to gain from the system without regard to how their actions may affect others. To maintain desirable system-wide properties in the presence of selfish users, designers are increasingly turning to the powerful mechanisms offered by economics and game theory. Combining the two fields of economics and systems design introduces new challenges of achieving incentive-compatibility in systems we can deploy in today{\textquoteright}s Internet. In this paper, we explore the interactions between systems and the mechanisms that give users incentives to cooperate. Using findings from recent work on incentive-compatible systems, we discuss several economic mechanisms and assumptions: money, punishment, and altruism. We seek to understand when these mechanisms violate system properties. Among the potential pitfalls we present is a phenomenon we call the price of altruism: altruistic peers can impose a loss of social good in some systems. We also discuss systems-compatible mechanisms that have been used in real, distributed systems, and attempt to extract the underlying design principles that have led to their success.},
	keywords = {computing;, incentives;game, Internet;distributed, system;distributed, systems;game, systems;systems-compatible, theory;incentive-compatible, theory;peer-to-peer},
	doi = {10.1109/GAMENETS.2009.5137390},
	author = {Levin,D. and Spring, Neil and Bhattacharjee, Bobby}
}
@conference {16458,
	title = {Satisfying Complex Data Needs using Pull-Based Online Monitoring of Volatile Data Sources},
	booktitle = {Data Engineering, International Conference on},
	year = {2008},
	month = {2008///},
	pages = {1465 - 1467},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {Emerging applications on the Web require better management of volatile data in pull-based environments. In a pull based setting, data may be periodically removed from the server. Data may also become obsolete, no longer serving client needs. In both cases, we consider such data to be volatile. To model such constraints on data usability, and support complex user needs we define profiles to specify which data sources are to be monitored and when. Using a novel abstraction of execution intervals we model complex profiles that access simultaneously several servers to gain from the used data. Given some budgetary constraints (e.g., bandwidth), the paper formalizes the problem of maximizing completeness.},
	isbn = {978-1-4244-1836-7},
	doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2008.4497591},
	author = {Roitman,Haggai and Gal,Avigdor and Raschid, Louiqa}
}
@article {16282,
	title = {Scaffolding and Validation of Bacterial Genome Assemblies Using Optical Restriction Maps},
	journal = {Bioinformatics},
	volume = {24},
	year = {2008},
	month = {2008/05/15/},
	pages = {1229 - 1235},
	abstract = {Motivation: New, high-throughput sequencing technologies have made it feasible to cheaply generate vast amounts of sequence information from a genome of interest. The computational reconstruction of the complete sequence of a genome is complicated by specific features of these new sequencing technologies, such as the short length of the sequencing reads and absence of mate-pair information. In this article we propose methods to overcome such limitations by incorporating information from optical restriction maps.Results: We demonstrate the robustness of our methods to sequencing and assembly errors using extensive experiments on simulated datasets. We then present the results obtained by applying our algorithms to data generated from two bacterial genomes Yersinia aldovae and Yersinia kristensenii. The resulting assemblies contain a single scaffold covering a large fraction of the respective genomes, suggesting that the careful use of optical maps can provide a cost-effective framework for the assembly of genomes.
Availability: The tools described here are available as an open-source package at ftp://ftp.cbcb.umd.edu/pub/software/soma
Contact: mpop@umiacs.umd.edu
},
	isbn = {1367-4803, 1460-2059},
	doi = {10.1093/bioinformatics/btn102},
	url = {http://bioinformatics.oxfordjournals.org/content/24/10/1229},
	author = {Nagarajan,Niranjan and Read,Timothy D. and Pop, Mihai}
}
@article {16443,
	title = {SCALABLE CATALOG INFRASTRUCTURE FOR MANAGING ACCESS COSTS AND SOURCE SELECTION IN WIDE AREA NETWORKS},
	journal = {International Journal of Cooperative Information Systems},
	volume = {17},
	year = {2008},
	month = {2008///},
	pages = {77 - 109},
	author = {Zadorozhny,V. and Raschid, Louiqa and Gal,A.}
}
@conference {18351,
	title = {Scalable classifiers for Internet vision tasks},
	booktitle = {Computer Vision and Pattern Recognition Workshops, 2008. CVPRW{\textquoteright}08. IEEE Computer Society Conference on},
	year = {2008},
	month = {2008/06//},
	pages = {1 - 8},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Object recognition systems designed for Internet applications typically need to adapt to userspsila needs in a flexible fashion and scale up to very large data sets. In this paper, we analyze the complexity of several multiclass SVM-based algorithms and highlight the computational bottleneck they suffer at test time: comparing the input image to every training image. We propose an algorithm that overcomes this bottleneck; it offers not only the efficiency of a simple nearest-neighbor classifier, by voting on class labels based on the k nearest neighbors quickly determined by a vocabulary tree, but also the recognition accuracy comparable to that of a complex SVM classifier, by incorporating SVM parameters into the voting scores incrementally accumulated from individual image features. Empirical results demonstrate that adjusting votes by relevant support vector weights can improve the recognition accuracy of a nearest-neighbor classifier without sacrificing speed. Compared to existing methods, our algorithm achieves a ten-fold speed increase while incurring an acceptable accuracy loss that can be easily offset by showing about two more labels in the result. The speed, scalability, and adaptability of our algorithm makes it suitable for Internet vision applications.},
	isbn = {978-1-4244-2339-2},
	doi = {10.1109/CVPRW.2008.4562958},
	url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4562958},
	author = {Tom Yeh and Lee,John J and Darrell,Trevor}
}
@article {12241,
	title = {A scalable key management and clustering scheme for wireless ad hoc and sensor networks},
	journal = {Future Generation Computer Systems},
	volume = {24},
	year = {2008},
	month = {2008/10//},
	pages = {860 - 869},
	abstract = {This paper describes a scalable key management and clustering scheme for secure group communications in ad hoc and sensor networks. The scalability problem is solved by partitioning the communicating devices into subgroups, with a leader in each subgroup, and further organizing the subgroups into hierarchies. Each level of the hierarchy is called a tier or layer. Key generation, distribution, and actual data transmissions follow the hierarchy. The distributed, efficient clustering approach (DECA) provides robust clustering to form subgroups, and analytical and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. Comparing with most other schemes, our approach is extremely scalable and efficient, provides more security guarantees, and is selective, adaptive and robust.},
	keywords = {ad hoc networks, clustering, Group communications, Key management, sensor networks},
	isbn = {0167-739X},
	doi = {10.1016/j.future.2008.03.007},
	url = {http://www.sciencedirect.com/science/article/pii/S0167739X08000782},
	author = {Li,Jason H. and Bhattacharjee, Bobby and Yu,Miao and Levy,Renato}
}
@conference {15312,
	title = {Scalable language processing algorithms for the masses: a case study in computing word co-occurrence matrices with MapReduce},
	booktitle = {Proceedings of the Conference on Empirical Methods in Natural Language Processing},
	series = {EMNLP {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {419 - 428},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {This paper explores the challenge of scaling up language processing algorithms to increasingly large datasets. While cluster computing has been available in commercial environments for several years, academic researchers have fallen behind in their ability to work on large datasets. I discuss two barriers contributing to this problem: lack of a suitable programming model for managing concurrency and difficulty in obtaining access to hardware. Hadoop, an open-source implementation of Google{\textquoteright}s MapReduce framework, provides a compelling solution to both issues. Its simple programming model hides system-level details from the developer, and its ability to run on commodity hardware puts cluster computing within the reach of many academic research groups. This paper illustrates these points with a case study in building word cooccurrence matrices from large corpora. I conclude with an analysis of an alternative computing model based on renting instead of buying computer clusters.},
	url = {http://dl.acm.org/citation.cfm?id=1613715.1613769},
	author = {Jimmy Lin}
}
@conference {16840,
	title = {Scalable network distance browsing in spatial databases},
	booktitle = {Proceedings of the 2008 ACM SIGMOD international conference on Management of data},
	series = {SIGMOD {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {43 - 54},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shortest paths between all possible vertices in the network and then making use of an encoding that takes advantage of the fact that the shortest paths from vertex u to all of the remaining vertices can be decomposed into subsets based on the first edges on the shortest paths to them from u. Thus, in the worst case, the amount of work depends on the number of objects that are examined and the number of links on the shortest paths to them from q, rather than depending on the number of vertices in the network. The amount of storage required to keep track of the subsets is reduced by taking advantage of their spatial coherence which is captured by the aid of a shortest path quadtree. In particular, experiments on a number of large road networks as well as a theoretical analysis have shown that the storage has been reduced from O(N3) to O(N1.5) (i.e., by an order of magnitude equal to the square root). The precomputation of the shortest paths along the network essentially decouples the process of computing shortest paths along the network from that of finding the neighbors, and thereby also decouples the domain S of the query objects and that of the objects from which the neighbors are drawn from the domain V of the vertices of the spatial network. This means that as long as the spatial network is unchanged, the algorithm and underlying representation of the shortest paths in the spatial network can be used with different sets of objects.},
	keywords = {decoupling, nearest neighbor, scalability, shortest path quadtree, spatial networks},
	isbn = {978-1-60558-102-6},
	doi = {10.1145/1376616.1376623},
	url = {http://doi.acm.org/10.1145/1376616.1376623},
	author = {Samet, Hanan and Sankaranarayanan,Jagan and Alborzi,Houman}
}
@conference {12541,
	title = {A Scalable Projective Bundle Adjustment Algorithm using the L infinity Norm},
	booktitle = {Computer Vision, Graphics Image Processing, 2008. ICVGIP {\textquoteright}08. Sixth Indian Conference on},
	year = {2008},
	month = {2008/12//},
	pages = {79 - 86},
	abstract = {The traditional bundle adjustment algorithm for structure from motion problem has a computational complexity of O((m+n)<sup>3</sup>) per iteration and memory requirement of O(mn(m+n)), where m is the number of cameras and n is the number of structure points. The sparse version of bundle adjustment has a computational complexity of O(m<sup>3</sup>+mn) per iteration and memory requirement of O(mn). Here we propose an algorithm that has a computational complexity of O(mn(radicm+radicn)) per iteration and memory requirement of O(max(m,n)). The proposed algorithm is based on minimizing the L<sub>infin</sub> norm of reprojection error. It alternately estimates the camera and structure parameters, thus reducing the potentially large scale optimization problem to many small scale subproblems each of which is a quasi-convex optimization problem and hence can be solved globally. Experiments using synthetic and real data show that the proposed algorithm gives good performance in terms of minimizing the reprojection error and also has a good convergence rate.},
	keywords = {adjustment, algorithm;structure, bundle, complexity;convex, complexity;iteration, error;scalable, estimation;, estimation;cameras;computational, L<sub>infin</sub>, method;large, methods;parameter, norm;camera;computational, OPTIMIZATION, parameter, problem;memory, problem;projection, problem;reprojection, programming;image, projective, reconstruction;iterative, reconstruction;quasiconvex, requirement;motion, scale},
	doi = {10.1109/ICVGIP.2008.51},
	author = {Mitra, K. and Chellapa, Rama}
}
@conference {17761,
	title = {Scaling RDF with Time},
	booktitle = {Proceedings of the 17th international conference on World Wide Web},
	series = {WWW {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {605 - 614},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The World Wide Web Consortium{\textquoteright}s RDF standard primarily consists of (subject, property, object) triples that specify the value that a given subject has for a given property. However, it is frequently the case that even for a fixed subject and property, the value varies with time. As a consequence, efforts have been made to annotate RDF triples with "valid time" intervals. However, to date, no proposals exist for efficient indexing of such temporal RDF databases. It is clearly beneficial to store RDF data in a relational DB - however, standard relational indexes are inadequately equipped to handle RDF{\textquoteright}s graph structure. In this paper, we propose the tGRIN index structure that builds a specialized index for temporal RDF that is physically stored in an RDBMS. Past efforts to store RDF in relational stores include Jena2 from HP, Sesame from OpenRDF.org, and 3store from the University of Southampton. We show that even when these efforts are augmented with well known temporal indexes like R+ trees, SR-trees, ST-index, and MAP21, the tGRIN index exhibits superior performance. In terms of index build time, tGRIN takes two thirds or less of the time used by any other system, and it uses a comparable amount of memory and less disk space than Jena, Sesame and 3store. More importantly, tGRIN can answer queries three to six times faster for average query graph patterns and five to ten times faster for complex queries than these systems.},
	keywords = {RDF indexing, resource description framework, temporal RDF},
	isbn = {978-1-60558-085-2},
	doi = {10.1145/1367497.1367579},
	url = {http://doi.acm.org/10.1145/1367497.1367579},
	author = {Pugliese,Andrea and Udrea,Octavian and V.S. Subrahmanian}
}
@article {13640,
	title = {Script-Independent Text Line Segmentation in Freestyle Handwritten Documents},
	journal = {IEEETransactions on Pattern Analysis and Machine Intelligence},
	year = {2008},
	month = {2008/08//},
	pages = {1313 - 1329},
	abstract = {Text line segmentation in freestyle handwritten documents remains an open document analysis problem. Curvilinear text lines and small gaps between neighboring text lines present a challenge to algorithms developed for machine printed or hand-printed documents. In this paper, we propose a novel approach based on density estimation and a state-of-the-art image segmentation technique, the level set method. From an input document image, we estimate a probability map, where each element represents the probability of the underlying pixel belonging to a text line. The level set method is then exploited to determine the boundary of neighboring text lines by evolving an initial estimate. Unlike connected component based methods ( [1] and [2] for example), the proposed algorithm does not use any script-specific knowledge. Extensive quantitative experiments on freestyle handwritten documents with diverse scripts, such as Arabic, Chinese, Korean, and Hindi in the University of Maryland Multilingual database, demonstrate that our algorithm consistently outperforms previous methods [1]{\textendash}[3]. Further experiments show the proposed algorithm is robust to scale change, rotation, and noise.},
	author = {Yi,L. and Zheng,Y. and David Doermann and Jaeger,S.}
}
@article {16070,
	title = {Searching Electronic Health Records for Temporal Patterns in Patient Histories: A Case Study with Microsoft Amalga},
	journal = {AMIA Annual Symposium ProceedingsAMIA Annu Symp Proc},
	volume = {2008},
	year = {2008},
	month = {2008///},
	pages = {601 - 605},
	abstract = {As electronic health records (EHR) become more widespread, they enable clinicians and researchers to pose complex queries that can benefit immediate patient care and deepen understanding of medical treatment and outcomes. However, current query tools make complex temporal queries difficult to pose, and physicians have to rely on computer professionals to specify the queries for them. This paper describes our efforts to develop a novel query tool implemented in a large operational system at the Washington Hospital Center (Microsoft Amalga, formerly known as Azyxxi). We describe our design of the interface to specify temporal patterns and the visual presentation of results, and report on a pilot user study looking for adverse reactions following radiology studies using contrast.},
	isbn = {1942-597X},
	author = {Plaisant, Catherine and Lam,Stanley and Shneiderman, Ben and Smith,Mark S. and Roseman,David and Marchand,Greg and Gillam,Michael and Feied,Craig and Handler,Jonathan and Rappaport,Hank}
}
@article {14853,
	title = {Searching the world{\textquoteright}s herbaria: A system for visual identification of plant species},
	journal = {Computer Vision{\textendash}ECCV 2008},
	year = {2008},
	month = {2008///},
	pages = {116 - 129},
	abstract = {We describe a working computer vision system that aids in the identification of plant species. A user photographs an isolated leaf on a blank background, and the system extracts the leaf shape and matches it to the shape of leaves of known species. In a few seconds, the system displays the top matching species, along with textual descriptions and additional images. This system is currently in use by botanists at the Smithsonian Institution National Museum of Natural History. The primary contributions of this paper are: a description of a working computer vision system and its user interface for an important new application area; the introduction of three new datasets containing thousands of single leaf images, each labeled by species and verified by botanists at the US National Herbarium; recognition results for two of the three leaf datasets; and descriptions throughout of practical lessons learned in constructing this system.},
	doi = {10.1007/978-3-540-88693-8_9},
	author = {Belhumeur,P. and Chen,D. and Feiner,S. and Jacobs, David W. and Kress,W. and Ling,H. and Lopez,I. and Ramamoorthi,R. and Sheorey,S. and White,S.}
}
@article {12907,
	title = {Seasonal Cholera from Multiple Small Outbreaks, Rural Bangladesh},
	journal = {Emerging Infectious DiseasesEmerg Infect Dis},
	volume = {14},
	year = {2008},
	month = {2008/05//},
	pages = {831 - 833},
	abstract = {Clinical and environmental Vibrio cholerae organisms collected from February 2004 through April 2005 were systematically isolated from 2 rural Bangladeshi locales. Their genetic relatedness was evaluated at 5 loci that contained a variable number of tandem repeats (VNTR). The observed minimal overlap in VNTR patterns between the 2 communities was consistent with sequential, small outbreaks from local sources.},
	isbn = {1080-6040},
	doi = {10.3201/eid1405.071116},
	author = {Stine,O. Colin and Alam,Munirul and Tang,Li and Nair,G. Balakrish and Siddique,A. Kasem and Faruque,Shah M. and Huq,Anwar and Rita R Colwell and Sack,R. Bradley and Morris,J. Glenn}
}
@article {18509,
	title = {Securing enterprise networks using traffic tainting},
	journal = {Special Interest Group on Data Communication},
	year = {2008},
	month = {2008///},
	abstract = {Enterprise networks are vulnerable to attacks ranging from dataleaks to the spread of malware to insider threats. Previous defenses
have largely focused on securing hosts; unfortunately, when hosts
are compromised, these defenses become ineffective. Rather than
attempting to harden the host against every possible attack (which
is impractical) or constraining the software that can run on a host
(which is inconvenient), we place a small amount of trusted code
on the host to assist with tracking the provenance of network traf-
fic, moving the rest of the trust and function to the network. We
present Pedigree, a system that tracks information flow across pro-
cesses and hosts within a network by annotating traffic with taints
that reflect the process that generated the traffic and the inputs that
process has taken (we call this function traffic tainting). A tagger
on the host annotates network traffic with information about the
{\textquotedblleft}taints{\textquotedblright} that the sending process has acquired. Network devices act
as arbiters to take appropriate actions (e.g., blocking) based on the
taints associated with the traffic and the enterprise network{\textquoteright}s secu-
rity policy. We have implemented Pedigree{\textquoteright}s host-based tagger as a
Linux kernel module and the arbiter using the OpenFlow platform.
This demonstration presents a prototype deployment of Pedigree
that identifies and prevents both sensitive data leaks and the spread
of malware in a typical enterprise network setting. The demon-
stration will show that Pedigree can defend against these attacks
without significant overhead at the host or the filtering device.
},
	author = {Ramachandran,A. and Mundada,Y. and Tariq,M.B. and Feamster, Nick}
}
@article {15965,
	title = {A self-help guide for autonomous systems},
	journal = {AI Magazine},
	volume = {29},
	year = {2008},
	month = {2008///},
	pages = {67 - 67},
	author = {Anderson,M. L and Fults,S. and Josyula,D. P and Oates,T. and Perlis, Don and Wilson,S. and Wright,D.}
}
@article {14098,
	title = {Sequence diversity and evolution of multigene families in Trypanosoma cruzi},
	journal = {Molecular and Biochemical Parasitology},
	volume = {157},
	year = {2008},
	month = {2008/01//},
	pages = {65 - 72},
	abstract = {Several copies of genes belonging to three multigene families present in the genome of Trypanosoma cruzi were sequenced and comparatively analyzed across six different strains of the parasite belonging to the T. cruzi I lineage (Colombiana, Silvio X10 and Dm28c), the T. cruzi II lineage (Esmeraldo and JG) and a hybrid strain (CL Brener). For all three gene families analyzed, our results support the division in T. cruzi I and II lineages. Furthermore, in agreement with its hybrid nature, sequences derived from the CL Brener clone clustered together with T. cruzi II sequences as well as with a third group of sequences. Paralogous sequences encoding Amastin, an amastigote surface glycoprotein and TcAG48, an antigenic RNA binding protein, which are clustered in the parasite genome, present higher intragenomic variability in T. cruzi II and CL Brener strains, when compared to T. cruzi I strains. Paralogous sequences derived from the TcADC gene family, which encode various isoforms of adenylyl cyclases and are dispersed throughout the T. cruzi genome, exhibit similar degree of variability in all strains, except in the CL Brener strain, in which the sequences were more divergent. Several factors including mutation rates and gene conversion mechanisms, acting differently within the T. cruzi population, may contribute to create such distinct levels of sequence diversity in multigene families that are clustered in the T. cruzi genome.},
	keywords = {Amastin, Gene conversion, Genetic diversity, Multigene families, Trypanosoma cruzi},
	isbn = {0166-6851},
	doi = {16/j.molbiopara.2007.10.002},
	url = {http://www.sciencedirect.com/science/article/pii/S0166685107002769},
	author = {Cerqueira,Gustavo C. and Bartholomeu,Daniella C. and DaRocha,Wanderson D. and Hou,Lihua and Freitas-Silva,Danielle M. and Machado,Carlos Renato and El-Sayed, Najib M. and Teixeira,Santuza M.R.}
}
@article {13120,
	title = {Sequential Kernel Density Approximation and Its Application to Real-Time Visual Tracking},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {30},
	year = {2008},
	month = {2008/07//},
	pages = {1186 - 1197},
	abstract = {Visual features are commonly modeled with probability density functions in computer vision problems, but current methods such as a mixture of Gaussians and kernel density estimation suffer from either the lack of flexibility by fixing or limiting the number of Gaussian components in the mixture or large memory requirement by maintaining a nonparametric representation of the density. These problems are aggravated in real-time computer vision applications since density functions are required to be updated as new data becomes available. We present a novel kernel density approximation technique based on the mean-shift mode finding algorithm and describe an efficient method to sequentially propagate the density modes over time. Although the proposed density representation is memory efficient, which is typical for mixture densities, it inherits the flexibility of nonparametric methods by allowing the number of components to be variable. The accuracy and compactness of the sequential kernel density approximation technique is illustrated by both simulations and experiments. Sequential kernel density approximation is applied to online target appearance modeling for visual tracking, and its performance is demonstrated on a variety of videos.},
	keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Statistical Distributions;Subtraction Technique;, Computer-Assisted;Models, Gaussian estimation;kernel density estimation;mean-shift mode finding algorithm;online target appearance modeling;probability density function;real-time computer vision application;real-time visual tracking;sequential kernel density approximation;visual f, Statistical;Motion;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2007.70771},
	author = {Han,Bohyung and Comaniciu, D. and Zhu,Ying and Davis, Larry S.}
}
@article {14574,
	title = {Sex and Age Dimorphism of Myocardial Gene Expression in Nonischemic Human Heart Failure},
	journal = {Circulation: Cardiovascular Genetics},
	volume = {1},
	year = {2008},
	month = {2008/12/01/},
	pages = {117 - 125},
	abstract = {Background{\textemdash} We report the first comprehensive analysis of gene expression differences by sex and age in left ventricular samples from 102 patients with dilated cardiomyopathy.Methods and Results{\textemdash} Gene expression data (HG-U133A gene chip, Affymetrix) were analyzed from 30 females and 72 males from 3 separate centers. More than 1800 genes displayed sexual dimorphism in the heart (adjusted P value <0.05). A significant number of these genes were highly represented in gene ontology pathways involved in ion transport and G-protein-coupled receptor signaling. Localization of these genes revealed enrichment on both the sex chromosomes as well as chromosomes 3, 4, and 14. The second goal of this study was to determine the effect of age on gene expression. Within the female cohort, >140 genes were differentially expressed in the <55 years age group compared with the >55 years age group. These genes were highly represented in gene ontology pathways involved in DNA damage. In contrast, zero genes in the male cohort <55 years met statistical significance when compared with the >55 years age group.Conclusions{\textemdash} Gene expression in dilated cardiomyopathy displayed evidence of sexual dimorphism similar to other somatic tissues and age dimorphism within the female cohort.},
	doi = {10.1161/CIRCGENETICS.108.802652},
	url = {http://circgenetics.ahajournals.org/content/1/2/117.abstract},
	author = {Fermin,David R. and Barac,Ana and Lee,Sangjin and Polster,Sean P. and Hannenhalli, Sridhar and Bergemann,Tracy L. and Grindle,Suzanne and Dyke,David B. and Pagani,Francis and Miller,Leslie W. and Tan,Sarah and dos Remedios,Cris and Cappola,Thomas P. and Margulies,Kenneth B. and Hall,Jennifer L.}
}
@book {13327,
	title = {Shape Analysis and Structuring},
	year = {2008},
	month = {2008///},
	publisher = {Springer},
	organization = {Springer},
	abstract = {With a lot of recent developments in the field, this much-needed book has come at just the right time. It covers a variety of topics related to preserving and enhancing shape information at a geometric level. The contributors also cover subjects that are relevant to effectively capturing the structure of a shape by identifying relevant shape components and their mutual relationships.},
	keywords = {Computer Graphics, Computer vision, Computers / Computer Graphics, Computers / Image Processing, Geometrical models, Geometry, Geometry, Analytic, Image analysis, IMAGE PROCESSING, Mathematics / Functional Analysis, Mathematics / Geometry / General, Mathematics / Graphic Methods, Mathematics / Mathematical Analysis, shapes, Technology \& Engineering / Engineering (General), Visualization},
	isbn = {9783540332640},
	author = {De Floriani, Leila and Spagnuolo,Michela}
}
@article {13134,
	title = {A {\textquotedblleft}Shape Aware{\textquotedblright} Model for semi-supervised Learning of Objects and its Context},
	journal = {Proc. of NIPS},
	year = {2008},
	month = {2008///},
	abstract = {We present an approach that combines bag-of-words and spatial models to performsemantic and syntactic analysis for recognition of an object based on its internal
appearance and its context. We argue that while object recognition requires mod-
eling relative spatial locations of image features within the object, a bag-of-word
is sufficient for representing context. Learning such a model from weakly labeled
data involves labeling of features into two classes: foreground(object) or {\textquotedblleft}infor-
mative{\textquotedblright} background(context). We present a {\textquotedblleft}shape-aware{\textquotedblright} model which utilizes
contour information for efficient and accurate labeling of features in the image.
Our approach iterates between an MCMC-based labeling and contour based la-
beling of features to integrate co-occurrence of features and shape similarity.
},
	author = {Gupta,A. and Shi,J. and Davis, Larry S.}
}
@article {12559,
	title = {Shape-and-Behavior Encoded Tracking of Bee Dances},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {30},
	year = {2008},
	month = {2008/03//},
	pages = {463 - 476},
	abstract = {Behavior analysis of social insects has garnered impetus in recent years and has led to some advances in fields like control systems and flight navigation. Manual labeling of insect motions required for analyzing the behaviors of insects requires significant investment of time and effort. In this paper, we propose certain general principles that help in simultaneous automatic tracking and behavior analysis, with applications in tracking bees and recognizing specific behaviors that they exhibit. The state space for tracking is defined using the position, orientation, and current behavior of the insect being tracked. The position and the orientation are parameterized using a shape model, whereas the behavior is explicitly modeled using a three-tier hierarchical motion model. The first tier (dynamics) models the local motions exhibited, and the models built in this tier act as a vocabulary for behavior modeling. The second tier is a Markov motion model built on top of the local motion vocabulary, which serves as the behavior model. The third tier of the hierarchy models the switching between behaviors, and this is also modeled as a Markov model. We address issues in learning the three-tier behavioral model, in discriminating between models, and in detecting and modeling abnormal behaviors. Another important aspect of this work is that it leads to joint tracking and behavior analysis instead of the traditional "track-and-then-recognize" approach. We apply these principles for tracking bees in a hive while they are executing the waggle dance and the round dance.},
	keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Social Behavior;, Computer-Assisted;Imaging, Markov model;bee dance;behavior analysis;shape model;social insect;three-tier hierarchical motion model;tracking;video sequence;waggle dance;Markov processes;image sequences;optical tracking;video signal processing;zoology;Algorithms;Animal Communication;, Three-Dimensional;Information Storage and Retrieval;Male;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2007.70707},
	author = {Veeraraghavan,A. and Chellapa, Rama and Srinivasan, M.}
}
@conference {13646,
	title = {Signature-based Document Image Retrieval},
	booktitle = {The 10th European Conference on Computer Vision (ECCV 2008)},
	year = {2008},
	month = {2008///},
	pages = {752 - 765},
	address = {Marseille, France},
	abstract = {As the most pervasive method of individual identification and document authentication, signatures present convincing evidence and provide an important form of indexing for effective document image processing and retrieval in a broad range of applications. In this work, we developed a fully automatic signature-based document image retrieval system that handles: 1) Automatic detection and segmentation of signatures from document images and 2) Translation, scale, and rotation invariant signature matching for document image retrieval. We treat signature retrieval in the unconstrained setting of non-rigid shape matching and retrieval, and quantitatively study shape representations, shape matching algorithms, measures of dissimilarity, and the use of multiple query instances in document image retrieval. Extensive experiments using large real world collections of English and Arabic machine printed and handwritten documents demonstrate the excellent performance of our system. To the best of our knowledge, this is the first automatic retrieval system for general document images by using signatures as queries, without manual annotation of the image collection.},
	author = {Zhu,Guangyu and Yefeng Zheng and David Doermann}
}
@article {12914,
	title = {Silent Sputnik},
	journal = {BioScience},
	volume = {58},
	year = {2008},
	month = {2008///},
	pages = {3 - 3},
	isbn = {0006-3568},
	doi = {10.1641/B580101},
	url = {http://www.bioone.org/doi/abs/10.1641/B580101},
	author = {Rita R Colwell}
}
@article {12911,
	title = {A simple binomial test for estimating sequencing errors in public repository 16S rRNA sequences},
	journal = {Journal of Microbiological Methods},
	volume = {72},
	year = {2008},
	month = {2008/02//},
	pages = {166 - 179},
	abstract = {Sequences in public databases may contain a number of sequencing errors. A double binomial model describing the distribution of indel-excluded similarity coefficients (S) among repeatedly sequenced 16S rRNA was previously developed and it produced a confidence interval of S useful for testing sequence identity among sequences of 400-bp length. We characterized patterns in sequencing errors found in nearly complete 16S rRNA sequences of Vibrionaceae as highly variable in reported sequence length and containing a small number of indels. To accommodate these characteristics, a simple binomial model for distribution of the similarity coefficient (H) that included indels was derived from the double binomial model for S. The model showed good fit to empirical data. By using either a pre-determined or bootstrapping estimated standard probability of base matching, we were able to use the exact binomial test to determine the relative level of sequencing error for a given pair of duplicated sequences. A limitation of the method is the requirement that duplicated sequences for the same template sequence be paired, but this can be overcome by using only conserved regions of 16S rRNA sequences and pairing a given sequence with its highest scoring BLAST search hit from the nr database of GenBank.},
	keywords = {16S rRNA, Binomial model, Sequence similarity coefficient, Sequencing error, SSU rRNA},
	isbn = {0167-7012},
	doi = {10.1016/j.mimet.2007.11.013},
	url = {http://www.sciencedirect.com/science/article/pii/S0167701207003910},
	author = {Zo,Young-Gun and Rita R Colwell}
}
@article {15292,
	title = {Single-document and multi-document summarization techniques for email threads using sentence compression},
	journal = {Information Processing \& Management},
	volume = {44},
	year = {2008},
	month = {2008/07//},
	pages = {1600 - 1610},
	abstract = {We present two approaches to email thread summarization: collective message summarization (CMS) applies a multi-document summarization approach, while individual message summarization (IMS) treats the problem as a sequence of single-document summarization tasks. Both approaches are implemented in our general framework driven by sentence compression. Instead of a purely extractive approach, we employ linguistic and statistical methods to generate multiple compressions, and then select from those candidates to produce a final summary. We demonstrate these ideas on the Enron email collection {\^a}{\texteuro}{\textquotedblleft} a very challenging corpus because of the highly technical language. Experimental results point to two findings: that CMS represents a better approach to email thread summarization, and that current sentence compression techniques do not improve summarization performance in this genre.},
	keywords = {Email summarization, Enron, Informal media, Sentence compression, Trimming},
	isbn = {0306-4573},
	doi = {10.1016/j.ipm.2007.09.007},
	url = {http://www.sciencedirect.com/science/article/pii/S0306457307001768},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin}
}
@article {18533,
	title = {SNARE: Spatio-temporal Network-level Automatic Reputation Engine},
	volume = {GT-CSE-08-02},
	year = {2008},
	month = {2008///},
	institution = {Georgia Institute of Technology},
	abstract = {Current spam filtering techniques classify email based oncontent and IP reputation blacklists or whitelists. Unfortu-
nately, spammers can alter spam content to evade content-
based filters, and spammers continually change the IP ad-
dresses from which they send spam. Previous work has sug-
gested that filters based on network-level behavior might be
more efficient and robust, by making decisions based on how
messages are sent, as opposed to what is being sent or who
is sending them.
This paper presents a technique to identify spammers
based on features that exploit the network-level spatio-
temporal behavior of email senders to differentiate the spam-
ming IPs from legitimate senders. Our behavioral classifier
has two benefits: (1) it is early (i.e., it can automatically
detect spam without seeing a large amount of email from
a sending IP address{\textemdash}sometimes even upon seeing only a
single packet); (2) it is evasion-resistant (i.e., it is based on
spatial and temporal features that are difficult for a sender
to change). We build classifiers based on these features us-
ing two different machine learning methods, support vec-
tor machine and decision trees, and we study the efficacy
of these classifiers using labeled data from a deployed com-
mercial spam-filtering system. Surprisingly, using only fea-
tures from a single IP packet header (i.e., without looking at
packet contents), our classifier can identify spammers with
about 93\% accuracy and a reasonably low false-positive rate
(about 7\%). After looking at a single message spammer
identification accuracy improves to more than 94\% with a
false rate of just over 5\%. These suggest an effective sender
reputation mechanism.
},
	url = {http://hdl.handle.net/1853/25135},
	author = {Feamster, Nick and Gray,A.G. and Krasser,S. and Syed,N.A.}
}
@article {16673,
	title = {Soft syntactic constraints for hierarchical phrased-based translation},
	journal = {Proceedings of ACL-08: HLT},
	year = {2008},
	month = {2008///},
	pages = {1003 - 1011},
	author = {Marton,Y. and Resnik, Philip}
}
@article {17760,
	title = {The SOMA Terror Organization Portal (STOP): social network and analytic tools for the real-time analysis of terror groups},
	journal = {Social Computing, Behavioral Modeling, and Prediction},
	year = {2008},
	month = {2008///},
	pages = {9 - 18},
	abstract = {Stochastic Opponent Modeling Agents (SOMA) have been proposed as a paradigm for reasoning about cultural groups, terror groups, and other socioeconomic-political-military organizations worldwide. In this paper, we describe the SOMA Terror Organization Portal (STOP). STOP provides a single point of contact through which analysts may access data about terror groups world wide. In order to analyze this data, SOMA provides three major components: the SOMA Extraction Engine (SEE), the SOMA Adversarial Forecast Engine (SAFE), and the SOMA Analyst NEtwork (SANE) that allows analysts to find other analysts doing similar work, share findings with them, and let consensus findings emerge. This paper describes the STOP framework.},
	doi = {10.1007/978-0-387-77672-9_2},
	author = {Sliva,A. and V.S. Subrahmanian and Martinez,V. and Simari,G. I}
}
@conference {17765,
	title = {The soma terror organization portal (stop): Social network and analytic tools for the real-time analysis of terror groups},
	booktitle = {First Intl. Workshop on Social Computing, Behavioral Modeling and Prediction},
	year = {2008},
	month = {2008///},
	abstract = {Stochastic Opponent Modeling Agents (SOMA) have been proposed as a paradigm for reasoning about cultural groups, terror groups, and other socioeconomic-political-military organizations worldwide. In this paper, we describe the SOMA Terror Organization Portal (STOP). STOP provides a single point of contact through which analysts may access data about terror groups world wide. In order to analyze this data, SOMA provides three major components: the SOMA Extraction Engine (SEE), the SOMA Adversarial Forecast Engine (SAFE), and the SOMA Analyst NEtwork (SANE) that allows analysts to find other analysts doing similar work, share findings with them, and let consensus findings emerge. This paper describes the STOP framework.},
	doi = {10.1007/978-0-387-77672-9_2},
	author = {Martinez,V. and Simari,G. and Sliva,A. and V.S. Subrahmanian}
}
@conference {16841,
	title = {A sorting approach to indexing spatial data},
	booktitle = {ACM SIGGRAPH 2008 classes},
	series = {SIGGRAPH {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {91:1{\textendash}91:15 - 91:1{\textendash}91:15},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Spatial data is distinguished from conventional data by having extent. Therefore, spatial queries involve both the objects and the space that they occupy. The handling of queries that involve spatial data is facilitated by building an index on the data. The traditional role of the index is to sort the data, which means that it orders the data. However, since generally no ordering exists in dimensions greater than 1 without a transformation of the data to one dimension, the role of the sort process is one of differentiating between the data and what is usually done is to sort the spatial objects with respect to the space that they occupy. The resulting ordering is usually implicit rather than explicit so that the data need not be resorted (i.e., the index need not be rebuilt) when the queries change (e.g., the query reference objects). The index is said to order the space and the characteristics of such indexes are explored further.},
	doi = {10.1145/1401132.1401250},
	url = {http://doi.acm.org/10.1145/1401132.1401250},
	author = {Samet, Hanan}
}
@conference {18483,
	title = {Sound field decomposition using spherical microphone arrays},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008},
	year = {2008},
	month = {2008///},
	pages = {277 - 280},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Spherical microphone arrays offer a number of attractive properties such as direction-independent acoustic behavior and ability to reconstruct the sound field in the vicinity of the array. Such ability is necessary in applications such as ambisonics and recreating auditory environment over headphones. We compare the performance of two scene reconstruction algorithms - one based on least-squares fitting the observed potentials and another based on computing the far-field signature function directly from the microphone measurements. A number of features important for the design and operation of spherical microphone arrays in real applications are revealed. Results indicate that it is possible to reconstruct the sound scene up to order p with p2 microphones.},
	keywords = {Acoustic applications, Acoustic arrays, Acoustic fields, acoustic position measurement, Acoustic propagation, acoustic signal processing, acoustic waves, array signal processing, Equations, far-field signature function, Layout, least-squares fitting, microphone arrays, scene reconstruction algorithms, Signal processing algorithms, sound field decomposition, spherical microphone arrays, Surface acoustic waves},
	isbn = {978-1-4244-1483-3},
	doi = {10.1109/ICASSP.2008.4517600},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Gumerov, Nail A.}
}
@article {15557,
	title = {Space-time tradeoffs for proximity searching in doubling spaces},
	journal = {Algorithms-ESA 2008},
	year = {2008},
	month = {2008///},
	pages = {112 - 123},
	abstract = {We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound ε> 0. The objective is to build a data structure so that given any query point q in the space, it is possible to efficiently determine a point of S whose distance from q is within a factor of (1 + ε) of the distance between q and its nearest neighbor in S. In this paper we obtain the following space-time tradeoffs. Given a parameter γ ∈ [2,1/ε], we show how to construct a data structure of space nO(dim)log(1)  space that can answer queries in time O(log(n))+(1())O(dim)  . This is the first result that offers space-time tradeoffs for approximate nearest neighbor queries in doubling spaces. At one extreme it nearly matches the best result currently known for doubling spaces, and at the other extreme it results in a data structure that can answer queries in time O(log(n/ε)), which matches the best query times in Euclidean space. Our approach involves a novel generalization of the AVD data structure from Euclidean space to doubling space.},
	doi = {10.1007/978-3-540-87744-8_10},
	author = {Arya,S. and Mount, Dave and Vigneron,A. and Xia,J.}
}
@conference {13331,
	title = {Sparse terrain pyramids},
	booktitle = {Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems},
	series = {GIS {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {15:1{\textendash}15:10 - 15:1{\textendash}15:10},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Bintrees based on longest edge bisection and hierarchies of diamonds are popular multiresolution techniques on regularly sampled terrain datasets. In this work, we consider Sparse Terrain Pyramids as a compact multiresolution representation for terrain datasets whose samples are a subset of those lying on a regular grid. While previous diamond-based approaches can efficiently represent meshes built on a complete grid of resolution (2k +1)2, this is not suitable when the field values are uniform in large areas or simply non-existent. We explore properties of diamonds to simplify an encoding of the implicit dependency relationship between diamonds. Additionally, we introduce a diamond clustering technique to further reduce the geometric and topological overhead of such representations. We demonstrate the coherence of our clustering technique as well as the compactness of our representation.},
	keywords = {diamond hierarchies, longest edge bisection, multiresolution terrain models, nested triangle meshes},
	isbn = {978-1-60558-323-5},
	doi = {10.1145/1463434.1463454},
	url = {http://doi.acm.org/10.1145/1463434.1463454},
	author = {Weiss,Kenneth and De Floriani, Leila}
}
@conference {13980,
	title = {Spherical Arrays Near Boundaries},
	booktitle = {Hands-Free Speech Communication and Microphone Arrays, 2008. HSCMA 2008},
	year = {2008},
	month = {2008/05//},
	pages = {1 - 1},
	abstract = {Summary form only given. Solid spherical microphone arrays are beginning to be used for purposes such as beamforming, sound field capture and as audio cameras. They rely on the scattering of sound off their surface to achieve their purpose. This behavior is significantly affected in the presence of boundaries (floors, walls, ceilings), and the edges and corners they form. Algorithms designed for array analysis in a free field will work erroneously in this situation. We describe adaptation of the spherical microphone analysis algorithms to constructively use the scattering off the boundaries to significantly improve array performance. We also assess the influence of walls on beamforming algorithms for regular spherical arrays. Both synthetic and experimental results are presented.},
	keywords = {analysis;audio, analysis;microphone, array, arrays;, arrays;sound, arrays;spherical, cameras;beamforming;solid, capture;spherical, field, microphone, spherical},
	doi = {10.1109/HSCMA.2008.4538675},
	author = {Duraiswami, Ramani and Gumerov, Nail A. and O{\textquoteright}Donovan,A.}
}
@article {13986,
	title = {Spherical microphone array based immersive audio scene rendering},
	journal = {Proc. ICAD},
	year = {2008},
	month = {2008///},
	abstract = {In many applications such as entertainment, education, mil-itary training, remote telepresence, surveillance, etc. it is
necessary to capture an acoustic field and present it to listen-
ers with a goal of creating the same acoustic perception for
them as if they were actually present at the scene. Currently,
there is much interest in the use of spherical microphone ar-
rays for acoustic scene capture and reproduction. We de-
scribe a 32-microphone spherical array based system im-
plemented for spatial audio capture and reproduction. Our
array embeds hardware that is traditionally external, such as
preamplifiers, filters, digital-to-analog converters, and USB
adaptor, resulting in a portable lightweight solution and re-
quiring no hardware on the PC side whatsoever other than a
high-speed USB port. We provide capability analysis of the
array and describe software suite developed for the applica-
tion.
},
	author = {O{\textquoteright}donovan,A.M. and Zotkin,Dmitry N and Duraiswami, Ramani}
}
@article {18484,
	title = {A spherical microphone array based system for immersive audio scene rendering},
	volume = {UMIACS-TR-2008-09},
	year = {2008},
	month = {2008/03/25/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {For many applications it is necessary to capture an acoustic field and present it for human listeners, creating the same acoustic perception for them as if they were actually present in the scene. Possible applications of this technique include entertainment, education, military training, remote telepresence, surveillance, and others. Recently, there is much interest on the use of spherical microphone arrays in acoustic scene capture and reproduction application. We describe a 32-microphone spherical array based system implemented for spatial audio capture and reproduction. The array embeds hardware that is traditionally external, such as preamplifiers, filters, digital-to-analog converters, and USB interface adapter, resulting in a portable lightweight solution and requiring no hardware on PC side whatsoever other than a high-speed USB port. We provide capability analysis of the array and describe software suite developed for the application.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/7556},
	author = {O{\textquoteright}donovan,Adam and Zotkin,Dmitry N and Duraiswami, Ramani}
}
@conference {12551,
	title = {Statistical analysis on Stiefel and Grassmann manifolds with applications in computer vision},
	booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on},
	year = {2008},
	month = {2008/06//},
	pages = {1 - 8},
	abstract = {Many applications in computer vision and pattern recognition involve drawing inferences on certain manifold-valued parameters. In order to develop accurate inference algorithms on these manifolds we need to a) understand the geometric structure of these manifolds b) derive appropriate distance measures and c) develop probability distribution functions (pdf) and estimation techniques that are consistent with the geometric structure of these manifolds. In this paper, we consider two related manifolds - the Stiefel manifold and the Grassmann manifold, which arise naturally in several vision applications such as spatio-temporal modeling, affine invariant shape analysis, image matching and learning theory. We show how accurate statistical characterization that reflects the geometry of these manifolds allows us to design efficient algorithms that compare favorably to the state of the art in these very different applications. In particular, we describe appropriate distance measures and parametric and non-parametric density estimators on these manifolds. These methods are then used to learn class conditional densities for applications such as activity recognition, video based face recognition and shape classification.},
	keywords = {algorithm;learning, analysis;computer, analysis;statistical, analysis;video, based, classification;image, classification;spatio-temporal, distribution, distributions;, Face, functions;shape, Grassmann, invariant, manifold;activity, manifold;Stiefel, matching;inference, matching;spatiotemporal, measures;estimation, modeling;statistical, parameters;pattern, phenomena;statistical, recognition;affine, recognition;computer, recognition;probability, SHAPE, structure;image, technique;geometric, theory;manifold-valued, vision;distance, vision;image},
	doi = {10.1109/CVPR.2008.4587733},
	author = {Turaga,P. and Veeraraghavan,A. and Chellapa, Rama}
}
@article {14506,
	title = {Statistical Relational Learning as an Enabling Technology for Data Acquisition and Data Fusion in Heterogeneous Sensor Networks},
	year = {2008},
	month = {2008/06/29/},
	institution = {OFFICE OF RESEARCH ADMINISTRATION AND ADVANCEMENT, UNIVERSITY OF MARYLAND COLLEGE PARK},
	abstract = {Our work has focused on developing new cost sensitive feature acquisition and classification algorithms, mapping these algorithms onto camera networks, and creating a test bed of video data and implemented vision algorithms that we can use to implement these. First, we will describe a new algorithm that we have developed for feature acquisition in Hidden Markov Models (HMMs). This is particularly useful for inference tasks involving video from a single camera, in which the relationship between frames of video can be modeled as a Markov chain. We describe this algorithm in the context of using background subtraction results to identify portions of video that contain a moving object. Next, we will describe new algorithms that apply to general graphical models. These can be tested using existing test sets that are drawn from a range of domains in addition to sensor networks.},
	keywords = {*ALGORITHMS, *CLASSIFICATION, data acquisition, DATA FUSION, Detectors, Feature extraction, HMM(HIDDEN MARKOV MODELS), NETWORKS, NUMERICAL MATHEMATICS, PE611102, RANDOM FIELDS, STATISTICS AND PROBABILITY, TEST SETS, VIDEO SIGNALS},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA500520},
	author = {Jacobs, David W. and Getoor, Lise}
}
@conference {12546,
	title = {Stochastic fusion of multi-view gradient fields},
	booktitle = {Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on},
	year = {2008},
	month = {2008/10//},
	pages = {1324 - 1327},
	abstract = {Image gradients form powerful cues in a host of vision and graphics applications. In this paper, we consider multiple views of a textured planar scene and consider the problem of estimating the scene texture map using these multi-view inputs. Modeling each camera view as a projective transformation of the scene, we show that the problem is equivalent to that of studying the effect of noise (and the projective imaging) on the gradient fields induced by this texture map. We show that these noisy gradient fields can be modeled as complete observers of the scene radiance. Further, the corrupting noise can be shown to be additive and linear, although spatially varying. However, the specific form of the noise term can be exploited to design linear estimators that fuse the gradient fields obtained from each of the individual views. The fused gradient field forms a robust estimate of the scene gradients and can be used for scene reconstruction.},
	keywords = {application;brightness;cameras;gradient, application;image, camera, estimators;multiview, fields;projective, fusion;image, fusion;textured, gradient, gradients;linear, gradients;scene, imaging;scene, map;stochastic, methods;image, noise;graphics, planar, radiance;scene, reconstruction;image, reconstruction;scene, scene;vision, TEXTURE, texture;, view;corrupting},
	doi = {10.1109/ICIP.2008.4712007},
	author = {Sankaranarayanan,A. C and Chellapa, Rama}
}
@article {17767,
	title = {Stochastic opponent modeling agents: A case study with Hamas},
	journal = {Proceedings of ICCCD},
	year = {2008},
	month = {2008///},
	abstract = {Stochastic Opponent Modeling Agents (SOMA) have beenproposed as a paradigm for reasoning about cultural groups,
terror groups, and other socio-economic-political-military
organizations worldwide. In this paper, we describe a case
study that shows how SOMA was used to model the
behavior of the terrorist organization, Hamas. Our team,
consisting of a mix of computer scientists, policy experts,
and political scientists, were able to understand new facts
about Hamas of which even seasoned Hamas experts may
not have been aware. This paper briefly overviews SOMA
rules, explains how several thousand SOMA rules for
Hamas were automatically derived, and then describes a few
key findings about Hamas, enabled by this framework.
},
	author = {Mannes,A. and Sliva,A. and V.S. Subrahmanian and Wilkenfeld,J.}
}
@article {15257,
	title = {Streaming algorithms for k-center clustering with outliers and with anonymity},
	journal = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques},
	year = {2008},
	month = {2008///},
	pages = {165 - 178},
	abstract = {Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a clustering comparable in cost to the optimal offline solution, are especially useful. We develop the first streaming algorithms achieving a constant-factor approximation to the cluster radius for two variations of the k-center clustering problem. We give a streaming (4 + ε)-approximation algorithm using O(ε - 1 kz) memory for the problem with outliers, in which the clustering is allowed to drop up to z of the input points; previous work used a random sampling approach which yields only a bicriteria approximation. We also give a streaming (6 + ε)-approximation algorithm using O(ε - 1 ln (ε - 1) k + k 2) memory for a variation motivated by anonymity considerations in which each cluster must contain at least a certain number of input points.},
	doi = {10.1007/978-3-540-85363-3_14},
	author = {Matthew McCutchen,R. and Khuller, Samir}
}
@article {14433,
	title = {Structural Sampling for Statistical Software Testing},
	journal = {Probabilistic, Logical and Relational Learning-A Further Synthesis},
	year = {2008},
	month = {2008///},
	abstract = {Structural Statistical Software Testing exploits the control flow graph of the program being tested to construct test cases. While test cases can easily be extracted from {em feasible paths} in the control flow graph, that is, paths which are actually exerted for some values of the program input, the feasible path region is a tiny fraction of the graph paths (less than $10^{-5}]$ for medium size programs). The S4T algorithm presented in this paper aims to address this limitation; as an Active Relational Learning Algorithm, it uses the few feasible paths initially available to sample new feasible paths. The difficulty comes from the non-Markovian nature of the feasible path concept, due to the long-range dependencies between the nodes in the control flow graph. Experimental validation on real-world and artificial problems demonstrates significant improvements compared to the state of the art.},
	author = {Baskiotis,N. and Sebag,M. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H}
}
@article {14419,
	title = {Structured machine learning: the next ten years},
	journal = {Machine Learning},
	volume = {73},
	year = {2008},
	month = {2008///},
	pages = {3 - 23},
	abstract = {The field of inductive logic programming (ILP) has made steady progress, since the first ILP workshop in 1991, based on a balance of developments in theory, implementations and applications. More recently there has been an increased emphasis on Probabilistic ILP and the related fields of Statistical Relational Learning (SRL) and Structured Prediction. The goal of the current paper is to consider these emerging trends and chart out the strategic directions and open problems for the broader area of structured machine learning for the next 10 years.},
	doi = {10.1007/s10994-008-5079-1},
	author = {Dietterich,T. G and Domingos,P. and Getoor, Lise and Muggleton,S. and Tadepalli,P.}
}
@conference {18777,
	title = {A Survey of the Virtual Environments-based Assembly Training Applications},
	year = {2008},
	month = {2008///},
	abstract = {The advent of virtual environments is presenting new ways of trainingtomorrow{\textquoteright}s workforce. Virtual environments offer numerous benefits in
training applications. First, virtual environments allow extensive user
interactions in a very convenient and natural manner. This interaction is
greatly beneficial for increasing the user{\textquoteright}s retention of spatial information
compared to text-based or video-based instructions that are non-interactive in
nature. Second, virtual environments provide users with a 3D immersive
experience. This feature helps users gain a better understanding of spatial
relationships compared to 2D displays. Third, virtual environments support
multi-media instructions. One can watch standard videos, view 3D animations,
view text instructions, listen to audio instructions, and interact with 3D objects
in the scene. This paper describes representative research and associated
systems that use of virtual environments in assembly training applications.
},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.151.2892\&rep=rep1\&type=pdf},
	author = {Gupta,S.K. and Anand,D. K. and Brough,J. E. and Kavetsky,R. A. and Schwartz,M. and Thakur,A.}
}
@conference {13473,
	title = {The swarm application framework},
	booktitle = {In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (Student Abstract},
	year = {2008},
	month = {2008///},
	abstract = {The Swarm Application Framework (SAF) is a tool that makes the development of swarm applications more intuitive. Traditionally, swarm applications are created by programming several low-level rules. This approach leads to several problems in designing and testing swarms, which serve as inspiration for the features of SAF. SAF encourages a new paradigm for designing swarm applications: engineers can interact with a swarm at the abstract (swarm) level instead of the individual (agent) level. In this paper, we discuss the design of the framework, how agents and rules in SAF operate, and a planned rule abstraction feature.},
	author = {Miner,D. and desJardins, Marie}
}
@article {12540,
	title = {Synthesis of Silhouettes and Visual Hull Reconstruction for Articulated Humans},
	journal = {Multimedia, IEEE Transactions on},
	volume = {10},
	year = {2008},
	month = {2008/12//},
	pages = {1565 - 1577},
	abstract = {In this paper, we propose a complete framework for improved synthesis and understanding of the human pose from a limited number of silhouette images. It combines the active image-based visual hull (IBVH) algorithm and a contour-based body part segmentation technique. We derive a simple, approximate algorithm to decide the extrinsic parameters of a virtual camera, and synthesize the turntable image collection of the person using the IBVH algorithm by actively moving the virtual camera on a properly computed circular trajectory around the person. Using the turning function distance as the silhouette similarity measurement, this approach can be used to generate the desired pose-normalized images for recognition applications. In order to overcome the inability of the visual hull (VH) method to reconstruct concave regions, we propose a contour-based human body part localization algorithm to segment the silhouette images into convex body parts. The body parts observed from the virtual view are generated separately from the corresponding body parts observed from the input views and then assembled together for a more accurate VH reconstruction. Furthermore, the obtained turntable image collection helps to improve the body part segmentation and identification process. By using the inner distance shape context (IDSC) measurement, we are able to estimate the body part locations more accurately from a synthesized view where we can localize the body part more precisely. Experiments show that the proposed algorithm can greatly improve body part segmentation and hence shape reconstruction results.},
	keywords = {active, algorithm;articulated, algorithm;inner, body, camera;visual, collection;virtual, computation;contour-based, Context, detection;image, distance, distance;turntable, estimation;shape, function, hull, human, image, image;approximate, localization, measurement;silhouette, measurement;turning, part, pose;circular, reality;, recognition;virtual, reconstruction;approximation, reconstruction;image, segmentation, segmentation;pose, SHAPE, similarity, synthesis;silhouette, technique;human, theory;cameras;edge, Trajectory},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2008.2007321},
	author = {Yue,Zhanfeng and Chellapa, Rama}
}
@conference {18920,
	title = {Synthesis of strategies from interaction traces},
	series = {AAMAS {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {855 - 862},
	publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
	organization = {International Foundation for Autonomous Agents and Multiagent Systems},
	address = {Richland, SC},
	abstract = {We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an algorithm that, in polynomial time, can generate the best such composite strategy. We describe how to incorporate the composite strategy into an existing agent, as an enhancement of the agent{\textquoteright}s original strategy. We provide experimental results using interaction traces from 126 agents (most of them written by students as class projects) for the Iterated Prisoner{\textquoteright}s Dilemma, Iterated Chicken Game, and Iterated Battle of the Sexes. We compared each agent with the enhanced version of that agent produced by our algorithm. The enhancements improved the agents{\textquoteright} scores by about 5\% in the IPD, 11\% in the ICG, and 26\% in the IBS, and improved their rank by about 12\% in the IPD, 38\% in the ICG, and 33\% in the IBS.},
	keywords = {agents, interaction, learning, multi-agent systems, prisoner{\textquoteright}s dilemma, repeated games},
	isbn = {978-0-9817381-1-6},
	url = {http://dl.acm.org/citation.cfm?id=1402298.1402343},
	author = {Au,Tsz-Chiu and Kraus,Sarit and Nau, Dana S.}
}
@conference {17392,
	title = {Systematic yet flexible discovery: guiding domain experts through exploratory data analysis},
	booktitle = {Proceedings of the 13th international conference on Intelligent user interfaces},
	series = {IUI {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {109 - 118},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {During exploratory data analysis, visualizations are often useful for making sense of complex data sets. However, as data sets increase in size and complexity, static information visualizations decrease in comprehensibility. Interactive techniques can yield valuable discoveries, but current data analysis tools typically support only opportunistic exploration that may be inefficient and incomplete. We present a refined architecture that uses systematic yet flexible (SYF) design goals to guide domain expert users through complex exploration of data over days, weeks and months. The SYF system aims to support exploratory data analysis with some of the simplicity of an e-commerce check-out while providing added flexibility to pursue insights. The SYF system provides an overview of the analysis process, suggests unexplored states, allows users to annotate useful states, supports collaboration, and enables reuse of successful strategies. The affordances of the SYF system are demonstrated by integrating it into a social network analysis tool employed by social scientists and intelligence analysts. The SYF system is a tool-independent component and can be incorporated into other data analysis tools.},
	keywords = {exploratory data analysis, guides, Information Visualization, social networks, systematic yet flexible, wizards},
	isbn = {978-1-59593-987-6},
	doi = {10.1145/1378773.1378788},
	url = {http://doi.acm.org/10.1145/1378773.1378788},
	author = {Perer,Adam and Shneiderman, Ben}
}
@conference {18865,
	title = {System-Level Optimization Model for a Snake-Inspired Robot Based on a Rectilinear Gait},
	year = {2008},
	month = {2008///},
	pages = {913 - 924},
	publisher = {ASME},
	organization = {ASME},
	abstract = {Physical parameters of modules and gait parameters affect the overall snake-inspired robot performance. Hence the system-level optimization model has to concurrently optimize the module parameters and the gait. The equations of motion associated with the rectilinear gait are quite complex due to the changing topology of the rectilinear gait. Embedding these equations in the system-level optimization model leads to a computationally challenging formulation. This paper presents a system-level optimization model that utilizes a hierarchical optimization approach and meta-models of the pre-computed optimal gaits to reduce the complexity of the optimization model. This approach enabled us to use an experimentally validated physics-based model of the rectilinear gait and yet at the same time enabled us to create a system-level optimization model with a manageable complexity. A detailed case study is presented to show the importance of concurrently optimizing the module parameters and the gait using our model to obtain the optimal performance for a given mission.},
	isbn = {978-0-7918-4326-0},
	doi = {10.1115/DETC2008-49972},
	url = {http://link.aip.org/link/ASMECP/v2008/i43260/p913/s1\&Agg=doi},
	author = {Hopkins,James K. and Spranklin,Brent W. and Gupta, Satyandra K.}
}
@article {12255,
	title = {SAAR: A shared control plane for overlay multicast},
	journal = {Proceedings of 4th USENIX Symposium on Networked Systems Design \& Implementation},
	year = {2007},
	month = {2007///},
	pages = {57 - 72},
	abstract = {Many cooperative overlay multicast systems of diverse designs have been implemented and deployed. In this paper, we explore a new architecture for overlay multicast: we factor out the control plane into a separate overlay that provides a single primitive: a configurable anycast for peer selection. This separation of control and data overlays has several advantages. Data overlays can be optimized for efficient content delivery, while the control overlay can be optimized for flexible and efficient peer selection. Several data channels can share a control plane for fast switching among content channels, which is particularly important for IPTV. And, the control overlay can be reused in multicast systems with different data plane organizations.We designed and evaluated a decentralized control overlay for endsystem multicast. The overlay proactively aggregates system state and implements a powerful anycast primitive for peer selection. We demonstrate that SAAR{\textquoteright}s efficiency in locating peers reduces channel switching time, improves the quality of content delivery, and reduces overhead, even under dynamic conditions and at scale. An experimental evaluation demonstrates that the system can efficiently support single-tree, multi-tree and block-based multicast systems.
},
	author = {Nandi,A. and Ganjam,A. and Druschel,P. and Ng,T. S.E and Stoica,I. and Zhang,H. and Bhattacharjee, Bobby}
}
@article {15125,
	title = {Scalable protocols for authenticated group key exchange},
	journal = {Journal of Cryptology},
	volume = {20},
	year = {2007},
	month = {2007///},
	pages = {85 - 113},
	abstract = {We consider the problem of authenticated group key exchange among n parties communicating over an insecure public network. A number of solutions to this problem have been proposed; however, all prior provably secure solutions do not scale well and, in particular, require O(n) rounds. Our main contribution is the first scalable protocol for this problem along with a rigorous proof of security in the standard model under the DDH assumption; our protocol uses a constant number of rounds and requires only O(1) "full" modular exponentiations per user. Toward this goal (and adapting work of Bellare, Canetti, and Krawczyk), we first present an efficient compiler that transforms any group key-exchange protocol secure against a passive eavesdropper to an authenticated protocol which is secure against an active adversary who controls all communication in the network. This compiler adds only one round and O(1) communication (per user) to the original scheme. We then prove secure{\textemdash}against a passive adversary{\textemdash}a variant of the two-round group key-exchange protocol of Burmester and Desmedt. Applying our compiler to this protocol results in a provably secure three-round protocol for authenticated group key exchange which also achieves forward secrecy.},
	doi = {10.1007/s00145-006-0361-5},
	author = {Katz, Jonathan and Yung,M.}
}
@book {17768,
	title = {Scalable Uncertainty Management: First International Conference, SUM 2007, Washington, DC, USA, October 10-12, 2007 : Proceedings},
	year = {2007},
	month = {2007/11/14/},
	publisher = {Springer},
	organization = {Springer},
	abstract = {This book constitutes the refereed proceedings of the First International Conference on Scalable Uncertainty Management, SUM 2007, held in Washington, DC, USA, in Oktober 2007.The 20 revised full papers presented were carefully reviewed and selected from numerous submissions for inclusion in the book. The papers address artificial intelligence researchers, database researchers, and practitioners to demonstrate theoretical techniques required to manage the uncertainty that arises in large scale real world applications. The papers deal with the following topics: uncertainty models, probabilistic logics, fuzzy logics, and annotated logics, inconsistency logics, database algebras and calculi, scalable database systems, spatial, temporal, mobile and multimedia databases, as well as implementations, and applications.},
	keywords = {Artificial intelligence, Computers / Information Theory, Computers / Intelligence (AI) \& Semantics, Electronic books, Mathematics / Logic, Uncertainty (Information theory)},
	isbn = {9783540754077},
	author = {Prade,Henri and V.S. Subrahmanian}
}
@article {13990,
	title = {A scalar potential formulation and translation theory for the time-harmonic Maxwell equations},
	journal = {Journal of Computational Physics},
	volume = {225},
	year = {2007},
	month = {2007/07/01/},
	pages = {206 - 236},
	abstract = {We develop a computational method based on the Debye scalar potential representation, which efficiently reduces the solution of Maxwell{\textquoteright}s equations to the solution of two scalar Helmholtz equations. One of the key contributions of this paper is a theory for the translation of Maxwell solutions using such a representation, since the scalar potential form is not invariant with respect to translations. The translation theory is developed by introducing {\textquotedblleft}conversion{\textquotedblright} operators, which enable the representation of the electric and magnetic vector fields via scalar potentials in an arbitrary reference frame. Advantages of this representation include the fact that only two Helmholtz equations need be solved, and moreover, the divergence free constraints are satisfied automatically by construction. Truncation error bounds are also presented. The availability of a translation theory and error bounds for this representation can find application in methods such as the Fast Multipole Method.For illustration of the use of the representation and translation theory we implemented an algorithm for the simulation of Mie scattering off a system of spherical objects of different sizes and dielectric properties using a variant of the T-matrix method. The resulting system was solved using an iterative method based on GMRES. The results of the computations agree well with previous computational and experimental results.
},
	keywords = {Debye potentials, Electromagnetic scattering, Fast Multipole Method, Helmholtz equation, Maxwell equations, Mie scattering, T-matrix method, Translation operators},
	isbn = {0021-9991},
	doi = {10.1016/j.jcp.2006.11.025},
	url = {http://www.sciencedirect.com/science/article/pii/S0021999106005845},
	author = {Gumerov, Nail A. and Duraiswami, Ramani}
}
@conference {14544,
	title = {Scheduling to minimize gaps and power consumption},
	booktitle = {Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures},
	year = {2007},
	month = {2007///},
	pages = {46 - 54},
	author = {Demaine,E. D and Ghodsi,M. and Hajiaghayi, Mohammad T. and Sayedi-Roshkhar,A. S and Zadimoghaddam,M.}
}
@article {14099,
	title = {Schistosoma mansoni genome: Closing in on a final gene set},
	journal = {Experimental Parasitology},
	volume = {117},
	year = {2007},
	month = {2007/11//},
	pages = {225 - 228},
	abstract = {The Schistosoma mansoni genome sequencing consortium has recently released the latest versions of the genome assembly as well as an automated preliminary gene structure annotation. The combined datasets constitute a vast resource for researchers to exploit in a variety of post-genomic studies with an emphasis of transcriptomic and proteomic tools. Here we present an innovative method used for combining diverse sources of evidence including ab initio gene predictions, protein and transcript sequence homologies, and cross-genome sequence homologies between S. mansoni and Schistosoma japonicum to define a comprehensive list of protein-coding genes.},
	keywords = {Annotation, Gene finding, Genome, Schistosoma mansoni},
	isbn = {0014-4894},
	doi = {16/j.exppara.2007.06.005},
	url = {http://www.sciencedirect.com/science/article/pii/S0014489407001683},
	author = {Haas,Brian J. and Berriman,Matthew and Hirai,Hirohisa and Cerqueira,Gustavo G. and LoVerde,Philip T. and El-Sayed, Najib M.}
}
@article {15841,
	title = {Searching spontaneous conversational speech},
	journal = {ACM SIGIR Forum},
	volume = {41},
	year = {2007},
	month = {2007/12/01/},
	pages = {104 - 104},
	isbn = {01635840},
	doi = {10.1145/1328964.1328982},
	url = {http://dl.acm.org/citation.cfm?id=1328982},
	author = {Jong,Franciska De and Oard, Douglas and Ordelman,Roeland and Raaijmakers,Stephan}
}
@article {12248,
	title = {A Secure DHT via the Pigeonhole Principle},
	journal = {Technical Reports of the Computer Science Department, CS-TR-4884},
	year = {2007},
	month = {2007/09/24/},
	abstract = {The standard Byzantine attack model assumes no more than some fixedfraction of the participants are faulty. This assumption does not
accurately apply to peer-to-peer settings, where Sybil attacks and botnets
are realistic threats. We propose an attack model that permits an
arbitrary number of malicious nodes under the assumption that each node
can be classified based on some of its attributes, such as autonomous
system number or operating system, and that the number of classes with
malicious nodes is bounded (e.g., an attacker may exploit at most a few
operating systems at a time). In this model, we present a secure DHT,
evilTwin, which replaces a single, large DHT with sufficiently many
smaller instances such that it is impossible for an adversary to corrupt
every instance. Our system ensures high availability and low-latency
lookups, is easy to implement, does not require a complex Byzantine
agreement protocol, and its proof of security is a straightforward
application of the pigeonhole principle. The cost of security comes in the
form of increased storage and bandwidth overhead; we show how to reduce
these costs by replicating data and adaptively querying participants who
historically perform well. We use implementation and simulation to show
that evilTwin imposes a relatively small additional cost compared to
conventional DHTs.
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/7136},
	author = {Baden,Randy and Bender,Adam and Levin,Dave and Sherwood,Rob and Spring, Neil and Bhattacharjee, Bobby}
}
@article {12262,
	title = {Secure lookup without (constrained) flooding},
	journal = {WRAITS 2007},
	year = {2007},
	month = {2007///},
	author = {Bhattacharjee, Bobby and Rodrigues,R. and Kouznetsov,P.}
}
@conference {13136,
	title = {Segmentation using Meta-texture Saliency},
	booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on},
	year = {2007},
	month = {2007/10//},
	pages = {1 - 8},
	abstract = {We address segmentation of an image into patches that have an underlying salient surface-roughness. Three intrinsic images are derived: reflectance, shading and meta- texture images. A constructive approach is proposed for computing a meta-texture image by preserving, equalizing and enhancing the underlying surface-roughness across color, brightness and illumination variations. We evaluate the performance on sample images and illustrate quantitatively that different patches of the same material, in an image, are normalized in their statistics despite variations in color, brightness and illumination. Finally, segmentation by line-based boundary-detection is proposed and results are provided and compared to known algorithms.},
	keywords = {analysis;image, colour, enhancement;image, image, image;salient, patches;image, segmentation;image, segmentation;meta-texture, surface-roughness;image, texture;},
	doi = {10.1109/ICCV.2007.4408930},
	author = {Yacoob,Yaser and Davis, Larry S.}
}
@conference {13270,
	title = {A semantic web environment for digital shapes understanding},
	booktitle = {Proceedings of the semantic and digital media technologies 2nd international conference on Semantic Multimedia},
	series = {SAMT{\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {226 - 239},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	abstract = {In the last few years, the volume of multimedia content available on the Web significantly increased. This led to the need for techniques to handle such data. In this context, we see a growing interest in considering the Semantic Web in action and in the definition of tools capable of analyzing and organizing digital shape models. In this paper, we present a Semantic Web environment, be-SMART, for inspecting 3D shapes and for structuring and annotating such shapes according to ontology-driven metadata. Specifically, we describe in details the first module of be-SMART, the Geometry and Topology Analyzer, and the algorithms we have developed for extracting geometrical and topological information from 3D shapes. We also describe the second module, the Topological Decomposer, which produces a graph-based representation of the decomposition of the shape into manifold components. This is successively modified by the third and the fourth modules, which perform the automatic and manual segmentation of the manifold parts.},
	keywords = {digital shapes, semantic annotation, semantic web, shape analysis, shape understanding},
	isbn = {3-540-77033-X, 978-3-540-77033-6},
	url = {http://dl.acm.org/citation.cfm?id=1780533.1780565},
	author = {De Floriani, Leila and Hui,Annie and Papaleo,Laura and Huang,May and Hendler,James}
}
@article {15471,
	title = {Semantics-Preserving Design of Embedded Control Software from Synchronous Models},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {33},
	year = {2007},
	month = {2007/08//},
	pages = {497 - 509},
	abstract = {The design of embedded controllers is experiencing a growth in complexity as embedded systems increase their functionality while they become ubiquitous in electronic appliances, cars, airplanes, etc. As requirements become more challenging, mathematical models gain importance for mastering complexity. Among the different computational models proposed, synchronous models have proved to be the most widely used for control dominated applications. While synchronous models simplify the way of dealing with concurrency by decoupling functional and timing aspects, their software implementation on multitasking and multiprocessor platforms is far from straightforward, because of the asynchronous nature of most industrial software platforms. Known solutions in the literature either restrict the solution space or focus on special cases. We present a method for preserving the synchronous semantics through buffer-based intertask communication mechanisms, grounded on an abstraction of the target platform. This allows us to deal with any task set and, most importantly, being independent of the implementation, to explore the design space effectively.},
	keywords = {embedded control software, embedded systems, multiprocessing programs, multiprocessor, multitasking, semantics-preserving design, software engineering, software implementation, systems analysis},
	isbn = {0098-5589},
	doi = {10.1109/TSE.2007.70718},
	author = {Mangeruca,L. and Baleani,M. and Ferrari,A. and Sangiovanni-Vincentelli,A.}
}
@article {12196,
	title = {Semi-automatic photo annotation strategies using event based clustering and clothing based person recognition},
	journal = {Interacting with Computers},
	volume = {19},
	year = {2007},
	month = {2007///},
	pages = {524 - 544},
	author = {Suh,B. and Bederson, Benjamin B.}
}
@article {15777,
	title = {On Sensitivity of Gauss-Christoffel Quadrature},
	journal = {Numerische Mathematik},
	volume = {107},
	year = {2007},
	month = {2007///},
	pages = {147 - 174},
	abstract = {In numerical computations the question how much does a function change under perturbations of its arguments is of central importance. In this work, we investigate sensitivity of Gauss{\textendash}Christoffel quadrature with respect to small perturbations of the distribution function. In numerical quadrature, a definite integral is approximated by a finite sum of functional values evaluated at given quadrature nodes and multiplied by given weights. Consider a sufficiently smooth integrated function uncorrelated with the perturbation of the distribution function. Then it seems natural that given the same number of function evaluations, the difference between the quadrature approximations is of the same order as the difference between the (original and perturbed) approximated integrals. That is perhaps one of the reasons why, to our knowledge, the sensitivity question has not been formulated and addressed in the literature, though several other sensitivity problems, motivated, in particular, by computation of the quadrature nodes and weights from moments, have been thoroughly studied by many authors. We survey existing particular results and show that even a small perturbation of a distribution function can cause large differences in Gauss{\textendash}Christoffel quadrature estimates. We then discuss conditions under which the Gauss{\textendash}Christoffel quadrature is insensitive under perturbation of the distribution function, present illustrative examples, and relate our observations to known conjectures on some sensitivity problems.},
	url = {doi:10.1007/s00211-007-0078-xdoi:10.1007/s00211-007-0078-x},
	author = {O{\textquoteright}Leary, Dianne P. and Strako{\v s},Zden{\v e}k and Tich{\'y},Petr}
}
@conference {17780,
	title = {Sentiment analysis: Adjectives and adverbs are better than adjectives alone},
	booktitle = {Proceedings of the International Conference on Weblogs and Social Media (ICWSM)},
	year = {2007},
	month = {2007///},
	abstract = {Most past work on determining the strength of subjective expres-sions within a sentence or a document use specific parts of speech
such as adjectives, verbs and nouns. To date, there is almost no
work on the use of adverbs in sentiment analysis, nor has there been
any work on the use of adverb-adjective combinations (AACs). We
propose an AAC-based sentiment analysis technique that uses a lin-
guistic analysis of adverbs of degree. We define a set of general
axioms (based on a classification of adverbs of degree into five cat-
egories) that all adverb scoring techniques must satisfy. Instead of
aggregating scores of both adverbs and adjectives using simple scor-
ing functions, we propose an axiomatic treatment of AACs based
on the linguistic classification of adverbs. Three specific AAC scor-
ing methods that satisfy the axioms are presented. We describe the
results of experiments on an annotated set of 200 news articles (an-
notated by 10 students) and compare our algorithms with some exist-
ing sentiment analysis algorithms. We show that our results lead to
higher accuracy based on Pearson correlation with human subjects.
},
	author = {Benamara,F. and Cesarano,C. and Picariello, A. and Reforgiato,D. and V.S. Subrahmanian}
}
@article {14892,
	title = {Shape Classification Using the Inner-Distance},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {29},
	year = {2007},
	month = {2007/02//},
	pages = {286 - 299},
	abstract = {Part structure and articulation are of fundamental importance in computer and human vision. We propose using the inner-distance to build shape descriptors that are robust to articulation and capture part structure. The inner-distance is defined as the length of the shortest path between landmark points within the shape silhouette. We show that it is articulation insensitive and more effective at capturing part structures than the Euclidean distance. This suggests that the inner-distance can be used as a replacement for the Euclidean distance to build more accurate descriptors for complex shapes, especially for those with articulated parts. In addition, texture information along the shortest path can be used to further improve shape classification. With this idea, we propose three approaches to using the inner-distance. The first method combines the inner-distance and multidimensional scaling (MDS) to build articulation invariant signatures for articulated shapes. The second method uses the inner-distance to build a new shape descriptor based on shape contexts. The third one extends the second one by considering the texture information along shortest paths. The proposed approaches have been tested on a variety of shape databases, including an articulated shape data set, MPEG7 CE-Shape-1, Kimia silhouettes, the ETH-80 data set, two leaf data sets, and a human motion silhouette data set. In all the experiments, our methods demonstrate effective performance compared with other algorithms},
	keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;, Computer-Assisted;Imaging, Euclidean distance;articulation invariant signatures;computer vision;inner distance;multidimensional scaling;part structure;shape classification;shape descriptors;shape silhouette;shortest path;computational geometry;computer vision;graph theory;image cla, Three-Dimensional;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2007.41},
	author = {Ling,Haibin and Jacobs, David W.}
}
@conference {18160,
	title = {A Signal Processing and Randomization Perspective of Robust and Secure Image Hashing},
	booktitle = {Statistical Signal Processing, 2007. SSP {\textquoteright}07. IEEE/SP 14th Workshop on},
	year = {2007},
	month = {2007/08//},
	pages = {166 - 170},
	abstract = {An image hash is a content-based compact representation of an image and finds applications in image authentication, watermarking, and image similarity comparison. This paper reviews representative approaches developed by the research community in constructing robust and secure image hash. A unified framework and case studies on representative image hash schemes are presented to demonstrate important roles of signal processing and controlled randomization in constructing and evaluating robust and secure hashing for visual data.},
	doi = {10.1109/SSP.2007.4301240},
	author = {M. Wu and Mao,Yinian and Swaminathan,Ashwin}
}
@article {12572,
	title = {Signal Processing for Biometric Systems [DSP Forum]},
	journal = {Signal Processing Magazine, IEEE},
	volume = {24},
	year = {2007},
	month = {2007/11//},
	pages = {146 - 152},
	abstract = {This IEEE signal processing magazine (SPM) forum discuses signal processing applications, technologies, requirements, and standardization of biometric systems. The forum members bring their expert insights into issues such as biometric security, privacy, and multibiometric and fusion techniques. The invited forum members are Prof. Anil K. Jain of Michigan State University, Prof. Rama Chellappa of the University of Maryland, Dr. Stark C. Draper of theUniversity of Wisconsin in Madison, Prof. Nasir Memon of Polytechnic University, and Dr. P. Jonathon Phillips of the National Institute of Standards and Technology. The moderator of the forum is Dr. Anthony Vetro of Mitsubishi Electric Research Labs, and associate editor of SPM.},
	keywords = {(access, biometric, control);security;signal, forum;signal, magazine, PROCESSING, processing;, security;biometric, standardization;fusion, systems, technique;multibiometric, technique;signal, technology;biometrics},
	isbn = {1053-5888},
	doi = {10.1109/MSP.2007.905886},
	author = {Jain, A.K. and Chellapa, Rama and Draper, S.C. and Memon, N. and Phillips,P.J. and Vetro, A.}
}
@article {18283,
	title = {Signal Processing Magazine E-Newsletter: Inside Out [From the Editor]},
	journal = {Signal Processing Magazine, IEEE},
	volume = {24},
	year = {2007},
	month = {2007/11//},
	pages = {2 - 8},
	isbn = {1053-5888},
	doi = {10.1109/MSP.2007.905887},
	author = {Wu,M.}
}
@conference {17360,
	title = {Similarity-Based Forecasting with Simultaneous Previews: A River Plot Interface for Time Series Forecasting},
	booktitle = {Information Visualization, 2007. IV {\textquoteright}07. 11th International Conference},
	year = {2007},
	month = {2007/07/04/6},
	pages = {191 - 196},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Time-series forecasting has a large number of applications. Users with a partial time series for auctions, new stock offerings, or industrial processes desire estimates of the future behavior. We present a data driven forecasting method and interface called similarity-based forecasting (SBF). A pattern matching search in an historical time series dataset produces a subset of curves similar to the partial time series. The forecast is displayed graphically as a river plot showing statistical information about the SBF subset. A forecasting preview interface allows users to interactively explore alternative pattern matching parameters and see multiple forecasts simultaneously. User testing with 8 users demonstrated advantages and led to improvements.},
	keywords = {data driven forecasting method, data visualisation, Data visualization, Economic forecasting, forecasting preview interface, Graphical user interfaces, historical time series dataset, Laboratories, new stock offerings, partial time series, pattern matching, pattern matching search, Predictive models, river plot interface, Rivers, similarity-based forecasting, Smoothing methods, Technological innovation, Testing, time series, time series forecasting, Weather forecasting},
	isbn = {0-7695-2900-3},
	doi = {10.1109/IV.2007.101},
	author = {Buono,P. and Plaisant, Catherine and Simeone,A. and Aris,A. and Shneiderman, Ben and Shmueli,G. and Jank,W.}
}
@article {15542,
	title = {A simple entropy-based algorithm for planar point location},
	journal = {ACM Transactions on Algorithms (TALG)},
	volume = {3},
	year = {2007},
	month = {2007/05//},
	abstract = {Given a planar polygonal subdivision S, point location involves preprocessing this subdivision into a data structure so that given any query point q, the cell of the subdivision containing q can be determined efficiently. Suppose that for each cell z in the subdivision, the probability pz that a query point lies within this cell is also given. The goal is to design the data structure to minimize the average search time. This problem has been considered before, but existing data structures are all quite complicated. It has long been known that the entropy H of the probability distribution is the dominant term in the lower bound on the average-case search time. In this article, we show that a very simple modification of a well-known randomized incremental algorithm can be applied to produce a data structure of expected linear size that can answer point-location queries in O(H) average time. We also present empirical evidence for the practical efficiency of this approach.},
	keywords = {Entropy, expected-case complexity, Point location, polygonal subdivision, randomized algorithms, trapezoidal maps},
	isbn = {1549-6325},
	doi = {10.1145/1240233.1240240},
	url = {http://doi.acm.org/10.1145/1240233.1240240},
	author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave}
}
@conference {12591,
	title = {Simulation and Analysis of Human Walking Motion},
	booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on},
	volume = {1},
	year = {2007},
	month = {2007/04//},
	pages = {I-797 -I-800 - I-797 -I-800},
	abstract = {Simulation and analysis of human walking motion has applications in surveillance and healthcare. In this paper we discuss an approach for modeling human walking motion using a mechanical model in the form of a kinematic chain consisting of rigid links and revolute joints. Our goal is to discriminate different types of walking motions using information such as joint torque and angle sequences extracted from the model. The angle sequences are initially extracted using 3D geometry. From these angle sequences we extract the torque sequences using a recursive Newton Euler inverse dynamics algorithm. Time series models and dynamic time warping of the torque and angle sequences are used to characterize and discriminate different walking patterns. A forward dynamics algorithm is also presented for synthesizing different walking sequences like limping from a normal walking torque sequence},
	keywords = {3D, algorithm;revolute, analysis;image, chain;mechanical, DYNAMICS, Euler, extraction;image, geometry;angle, inverse, joints;rigid, links;surveillance;time, method;feature, model;recursive, models;torque, MOTION, motion;kinematic, Newton, patterns;Newton, problems;time, sequences;dynamic, sequences;inverse, sequences;walking, series, series;time, simulation;torque;, TIME, walking, warp, warping;healthcare;human},
	doi = {10.1109/ICASSP.2007.366028},
	author = {Nandy, K. and Chellapa, Rama}
}
@conference {13152,
	title = {Simultaneous appearance modeling and segmentation for matching people under occlusion},
	booktitle = {Proceedings of the 8th Asian conference on Computer vision - Volume Part II},
	series = {ACCV{\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {404 - 413},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	abstract = {We describe an approach to segmenting foreground regions corresponding to a group of people into individual humans. Given background subtraction and ground plane homography, hierarchical parttemplate matching is employed to determine a reliable set of human detection hypotheses, and progressive greedy optimization is performed to estimate the best configuration of humans under a Bayesian MAP framework. Then, appearance models and segmentations are simultaneously estimated in an iterative sampling-expectation paradigm. Each human appearance is represented by a nonparametric kernel density estimator in a joint spatial-color space and a recursive probability update scheme is employed for soft segmentation at each iteration. Additionally, an automatic occlusion reasoning method is used to determine the layered occlusion status between humans. The approach is evaluated on a number of images and videos, and also applied to human appearance matching using a symmetric distance measure derived from the Kullback-Leiber divergence.},
	isbn = {3-540-76389-9, 978-3-540-76389-5},
	url = {http://dl.acm.org/citation.cfm?id=1775728.1775777},
	author = {Zhe Lin and Davis, Larry S. and David Doermann and DeMenthon,Daniel}
}
@article {15475,
	title = {Skoll: A Process and Infrastructure for Distributed Continuous Quality Assurance},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {33},
	year = {2007},
	month = {2007/08//},
	pages = {510 - 525},
	abstract = {Software engineers increasingly emphasize agility and flexibility in their designs and development approaches. They increasingly use distributed development teams, rely on component assembly and deployment rather than green field code writing, rapidly evolve the system through incremental development and frequent updating, and use flexible product designs supporting extensive end-user customization. While agility and flexibility have many benefits, they also create an enormous number of potential system configurations built from rapidly changing component implementations. Since today{\textquoteright}s quality assurance (QA) techniques do not scale to handle highly configurable systems, we are developing and validating novel software QA processes and tools that leverage the extensive computing resources of user and developer communities in a distributed, continuous manner to improve software quality significantly. This paper provides several contributions to the study of distributed, continuous QA (DCQA). First, it shows the structure and functionality of Skoll, which is an environment that defines a generic around-the-world, around-the-clock QA process and several sophisticated tools that support this process. Second, it describes several novel QA processes built using the Skoll environment. Third, it presents two studies using Skoll: one involving user testing of the Mozilla browser and another involving continuous build, integration, and testing of the ACE+TAO communication software package. The results of our studies suggest that the Skoll environment can manage and control distributed continuous QA processes more effectively than conventional QA processes. For example, our DCQA processes rapidly identified problems that had taken the ACE+TAO developers much longer to find and several of which they had not found. Moreover, the automatic analysis of QA results provided developers information that enabled them to quickly find the root causes of problems},
	keywords = {ACE+TAO communication software package, component assembly, component deployment, distributed continuous quality assurance, distributed development teams, distributed processing, end-user customization, flexible product design, incremental development, object-oriented programming, Skoll, software engineering, Software quality, systems analysis},
	isbn = {0098-5589},
	doi = {10.1109/TSE.2007.70719},
	author = {Porter, Adam and Yilmaz,C. and Memon, Atif M. and Schmidt,D. C and Natarajan,B.}
}
@conference {16299,
	title = {Software configuration management using ontologies},
	booktitle = {3rd International Workshop on Semantic Web Enabled Software Engineering (SWESE 2007), Innsubruk, Austria},
	year = {2007},
	month = {2007///},
	author = {Shahri,H. H and Hendler,J. A and Porter, Adam}
}
@article {14151,
	title = {Solving the stochastic steady-state diffusion problem using multigrid},
	journal = {IMA journal of numerical analysis},
	volume = {27},
	year = {2007},
	month = {2007///},
	pages = {675 - 675},
	author = {Elman, Howard and Furnival, D.}
}
@conference {17775,
	title = {Soma models of the behaviors of stakeholders in the afghan drug economy: A preliminary report},
	booktitle = {Proc. 2007 Intl. Conf. on Computational Cultural Dynamics},
	year = {2007},
	month = {2007///},
	pages = {78 - 86},
	abstract = {Most cultural reasoning today is done by anthropologists andsociologists who use their detailed knowledge of culture to
make predictions about how a given group will respond to a
given situation. The main problem with this is that experts
in a particular culture or subculture are few and not readily
accessible to the many who might suddenly need to tap their
expertise (e.g. in cases of war or conflict). In this paper, we
briefly describe how the SOMA (Stochastic Opponent Mod-
eling Agents) paradigm proposed by the authors can and has
been used to model the behaviors of various stake-holders in
the drug trade in Afghanistan.
},
	author = {Sliva,A. and Martinez,V. and Simari,G. I and V.S. Subrahmanian}
}
@article {14143,
	title = {Some observations on multigrid convergence for convection{\textendash}diffusion equations},
	journal = {Computing and Visualization in Science},
	volume = {10},
	year = {2007},
	month = {2007///},
	pages = {43 - 56},
	author = {Ramage, A. and Elman, Howard}
}
@article {16080,
	title = {Something that is interesting is interesting then: Using text minig and visualizations to aid interpreting repetition in Gertrude Stein{\textquoteright}s The Making of Americans},
	journal = {Proceedings of the Digital Humanities Conference},
	year = {2007},
	month = {2007///},
	pages = {40 - 44},
	author = {Clement,T. and Don,A. and Plaisant, Catherine and Auvil,L. and Pape,G. and Goren,V.}
}
@conference {16856,
	title = {Sorting in space: multidimensional, spatial, and metric data structures for computer graphics applications},
	booktitle = {International Conference on Computer Graphics and Interactive Techniques},
	year = {2007},
	month = {2007///},
	author = {Samet, Hanan}
}
@article {16849,
	title = {Spatial join techniques},
	journal = {ACM Trans. Database Syst.},
	volume = {32},
	year = {2007},
	month = {2007/03//},
	abstract = {A variety of techniques for performing a spatial join are reviewed. Instead of just summarizing the literature and presenting each technique in its entirety, distinct components of the different techniques are described and each is decomposed into an overall framework for performing a spatial join. A typical spatial join technique consists of the following components: partitioning the data, performing internal-memory spatial joins on subsets of the data, and checking if the full polygons intersect. Each technique is decomposed into these components and each component addressed in a separate section so as to compare and contrast similar aspects of each technique. The goal of this survey is to describe the algorithms within each component in detail, comparing and contrasting competing methods, thereby enabling further analysis and experimentation with each component and allowing the best algorithms for a particular situation to be built piecemeal, or, even better, enabling an optimizer to choose which algorithms to use.},
	keywords = {external memory algorithms, plane-sweep, Spatial join},
	isbn = {0362-5915},
	doi = {10.1145/1206049.1206056},
	url = {http://doi.acm.org/10.1145/1206049.1206056},
	author = {Jacox,Edwin H. and Samet, Hanan}
}
@conference {16426,
	title = {A spatial model of the red queen effect},
	booktitle = {Proceedings of the 9th annual conference on Genetic and evolutionary computation},
	series = {GECCO {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {490 - 491},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Van Valen first discovered the "Red Queen Effect" (RQE), where two species can dramatically co-evolve their phenotypes over time but never gain a relative advantage [2]. In the ideal version of the RQE, regardless of the actual values that the species evolve to obtain, they have not moved in relation to each other. Though previous models of the RQE exist, we developed an agent-based model (ABM) which has a base ontology more similar to real world coevolutionary systems than equation-based models (EBMs). For instance, this model contains spatial information and an individuallevel reproduction mechanism. Yet this model recreates traditional EBM results. For instance Dieckmann et al show that there are three possible outcomes of competitive coevolution: predator dominance, prey dominance and evolutionary cycling (RQE) [1]. By reconceptualizing this EBM using an ABM, we make it easier for students and researchers to understand, manipulate, and modify this model [4]. The model is written in the NetLogo agent-based modeling environment [3]. The model is initialized with 150 predator and 150 prey agents. Predator agents have a resistance level r and prey agents have a poison p. The agents are initially randomly distributed on a toroidal real-valued 35 by 35 grid. The initial resistance and poison values for the predators and prey are drawn from normal distributions with means {\textmu}r and {\textmu}p and a standard deviation of 1. During a model timestep, each agent moves one unit at a random heading. If at the end of its move a predator is within 1 unit of a prey, then it will challenge the prey. The predator will compare its resistance value to the prey{\textquoteright}s poison value and which ever agent has the larger value will win the challenge and the other agent will be killed. At the end of an agent{\textquoteright}s turn if the total number of agents is less than the maximum carrying capacity the agent will reproduce with a 50\% probability. The new agent{\textquoteright}s initial poison / resistance will be drawn from a normal distribution with the parent{\textquoteright}s poison / resistance as the mean value and a standard deviation of 1. Our goal was to investigate whether this ABMwould replicate the results of the EBM of [1]. Our parameter of interest was {\textmu}p; we held {\textmu}r constant at 25 and varied {\textmu}p from 0 to 50 at increments of 5. For each value we ran the model 10 times for 5000 timesteps. Figure 1 illustrates the final average values of both the resistance and the poison for the various initial values. If there are no predators or prey then a value of 0 is plotted for the respective final trait. In most cases, one species drives the other to extinction, and there is little change in the initial trait values. However when the value of {\textmu}p is similar to {\textmu}r then neither species is completely destroyed, but if there is any significant difference between {\textmu}r and {\textmu}p then one species will die off. The highest final trait values are found when {\textmu}p = {\textmu}r, in this case we see the results of the RQE since the final trait values are much higher than the initial values. These final values are more than 1.5 orders of magnitude larger than the initial values. This model reproduces classical models of the RQE, but has two different mobile species interacting on a spatial grid over time which is a closer representation of reality than traditional models. This closer representation makes ABMs excellent teaching and experimental tools because their basic assumptions can easily be manipulated and explored. Acknowledgments: We thank the National Science Foundation and NICO for supporting this research.},
	keywords = {Agent-based modeling, coevolution, red queen effect, spatial modeling},
	isbn = {978-1-59593-697-4},
	doi = {10.1145/1276958.1277064},
	url = {http://doi.acm.org/10.1145/1276958.1277064},
	author = {Ottino-Loffler,Jules and Rand, William and Wilensky,Uri}
}
@article {16078,
	title = {Special Issue in Honor of Ben Shneiderman{\textquoteright}s 60th Birthday: Reflections on Human-Computer Interaction},
	journal = {International Journal of Human-Computer Interaction},
	volume = {23},
	year = {2007},
	month = {2007///},
	pages = {195 - 204},
	isbn = {1044-7318},
	doi = {10.1080/10447310701702766},
	url = {http://www.tandfonline.com/doi/abs/10.1080/10447310701702766},
	author = {Plaisant, Catherine and North,Chris}
}
@article {18998,
	title = {Spliceosomal small nuclear RNA genes in 11 insect genomes},
	journal = {RNARNA},
	volume = {13},
	year = {2007},
	month = {2007/01/01/},
	pages = {5 - 14},
	abstract = {A monthly journal publishing high-quality, peer-reviewed research on all topics related to RNA and its metabolism in all organisms},
	keywords = {honeybee, Insecta, secondary structure, snRNA, spliceosomal snRNA, U12 introns},
	isbn = {1355-8382, 1469-9001},
	doi = {10.1261/rna.259207},
	url = {http://rnajournal.cshlp.org/content/13/1/5},
	author = {Mount, Stephen M. and Gotea,Valer and Lin,Chiao-Feng and Hernandez,Kristina and Maka{\l}owski,Wojciech}
}
@article {14428,
	title = {SplicePort--An interactive splice-site analysis tool},
	journal = {Nucleic Acids Research},
	volume = {35},
	year = {2007},
	month = {2007/05/08/},
	pages = {W285-W291 - W285-W291},
	abstract = {SplicePort is a web-based tool for splice-site analysis that allows the user to make splice-site predictions for submitted sequences. In addition, the user can also browse the rich catalog of features that underlies these predictions, and which we have found capable of providing high classification accuracy on human splice sites. Feature selection is optimized for human splice sites, but the selected features are likely to be predictive for other mammals as well. With our interactive feature browsing and visualization tool, the user can view and explore subsets of features used in splice-site prediction (either the features that account for the classification of a specific input sequence or the complete collection of features). Selected feature sets can be searched, ranked or displayed easily. The user can group features into clusters and frequency plot WebLogos can be generated for each cluster. The user can browse the identified clusters and their contributing elements, looking for new interesting signals, or can validate previously observed signals. The SplicePort web server can be accessed at http://www.cs.umd.edu/projects/SplicePort and http://www.spliceport.org.},
	isbn = {0305-1048, 1362-4962},
	doi = {10.1093/nar/gkm407},
	url = {http://nar.oxfordjournals.org/content/35/suppl_2/W285.short},
	author = {Dogan,R. I and Getoor, Lise and Wilbur,W. J and Mount, Stephen M.}
}
@article {15325,
	title = {Stencil adaptation properties of a WENO scheme in direct numerical simulations of compressible turbulence},
	journal = {Journal of Scientific Computing},
	volume = {30},
	year = {2007},
	month = {2007///},
	pages = {533 - 554},
	author = {Taylor,E. M and Martin, M.P}
}
@conference {16859,
	title = {STEWARD: architecture of a spatio-textual search engine},
	booktitle = {Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems},
	series = {GIS {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {25:1{\textendash}25:8 - 25:1{\textendash}25:8},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {STEWARD ("Spatio-Textual Extraction on the Web Aiding Retrieval of Documents"), a system for extracting, querying, and visualizing textual references to geographic locations in unstructured text documents, is presented. Methods for retrieving and processing web documents, extracting and disambiguating georeferences, and identifying geographic focus are described. A brief overview of STEWARD{\textquoteright}s querying capabilities, as well as the design of an intuitive user interface, are provided. Finally, several application scenarios and future extensions to STEWARD are discussed.},
	keywords = {geocoding, spatio-textual search engine, STEWARD},
	isbn = {978-1-59593-914-2},
	doi = {10.1145/1341012.1341045},
	url = {http://doi.acm.org/10.1145/1341012.1341045},
	author = {Lieberman,Michael D. and Samet, Hanan and Sankaranarayanan,Jagan and Sperling,Jon}
}
@conference {16855,
	title = {STEWARD: demo of spatio-textual extraction on the web aiding the retrieval of documents},
	booktitle = {Proceedings of the 8th annual international conference on Digital government research: bridging disciplines \& domains},
	series = {dg.o {\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {300 - 301},
	publisher = {Digital Government Society of North America},
	organization = {Digital Government Society of North America},
	abstract = {A spatio-textual search engine, termed "STEWARD" is demonstrated where document similarity is based on both the textual similarity as well as the spatial proximity of the locations in the document to the spatial search input. STEWARD{\textquoteright}s performance is enhanced by the presence of a document tagger that is able to identify textual references to geographical entities. The user-interface of STEWARD provides the ability to browse results, thereby making it a valuable "knowledge discovery" tool.},
	keywords = {geocoding, spatio-textual search engine, STEWARD},
	isbn = {1-59593-599-1},
	url = {http://dl.acm.org/citation.cfm?id=1248460.1248529},
	author = {Samet, Hanan and Lieberman,Michael D. and Sankaranarayanan,Jagan and Sperling,Jon}
}
@article {19503,
	title = {Stochastic Communication: A New Paradigm for Fault-Tolerant Networks-on-Chip},
	journal = {VLSI Design},
	volume = {2007},
	year = {2007},
	month = {2007/04/22/},
	abstract = {As CMOS technology scales down into the deep-submicron (DSM) domain, the costs of design and verification for Systems-on-Chip (SoCs) are rapidly increasing. Relaxing the requirement of 100\&$\#$x0025; correctness for devices and interconnects drastically reduces the costs of design but, at the same time, requires SoCs to be designed with some degree of system-level fault-tolerance. Towards this end, this paper introduces a novel communication paradigm for SoCs, called stochastic communication. This scheme separates communication from computation by allowing the on-chip interconnect to be designed as a reusable IP and also provides a built-in tolerance to DSM failures, without a significant performance penalty. By using this communication scheme, a large percentage of data upsets, packet losses due to buffers overflow, and severe levels of synchronization failures can be tolerated, while providing high levels of performance.},
	isbn = {1065-514X},
	url = {http://www.hindawi.com/journals/vlsi/2007/095348/abs/},
	author = {Bogdan, Paul and Dumitra\&$\#$351 and Tudor and Marculescu, Radu}
}
@article {15688,
	title = {Storage routing for dtn congestion control},
	journal = {Wireless communications and mobile computing},
	volume = {7},
	year = {2007},
	month = {2007///},
	pages = {1183 - 1196},
	author = {Seligman,M. and Fall,K. and Mundur, Padma}
}
@article {17779,
	title = {Story creation from heterogeneous data sources},
	journal = {Multimedia Tools and Applications},
	volume = {33},
	year = {2007},
	month = {2007///},
	pages = {351 - 377},
	abstract = {There are numerous applications where there is a need to rapidly infer a story about a given subject from a given set of potentially heterogeneous data sources. In this paper, we formally define a story to be a set of facts about a given subject that satisfies a {\textquotedblleft}story length{\textquotedblright} constraint. An optimal story is a story that maximizes the value of an objective function measuring the goodness of a story. We present algorithms to extract stories from text and other data sources. We also develop an algorithm to compute an optimal story, as well as three heuristic algorithms to rapidly compute a suboptimal story. We run experiments to show that constructing stories can be efficiently performed and that the stories constructed by these heuristic algorithms are high quality stories. We have built a prototype STORY system based on our model{\textemdash}we briefly describe the prototype as well as one application in this paper.},
	doi = {10.1007/s11042-007-0100-4},
	author = {Fayzullin,M. and V.S. Subrahmanian and Albanese, M. and Cesarano,C. and Picariello, A.}
}
@article {18717,
	title = {Structural Biology: Analysis of {\textquoteright}downhill{\textquoteright} protein folding; Analysis of protein-folding cooperativity (Reply)},
	journal = {Nature},
	volume = {445},
	year = {2007},
	month = {2007/02/15/},
	pages = {E17-E18 - E17-E18},
	abstract = {Ferguson et al. and Zhou and Bai criticize the quality of our nuclear magnetic resonance (NMR) data and atom-by-atom analysis of global {\textquoteright}downhill{\textquoteright} folding, also claiming that the data are compatible with two-state folding.},
	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/nature05645},
	url = {http://www.nature.com/nature/journal/v445/n7129/full/nature05645.html?lang=en},
	author = {Sadqi,Mourad and Fushman, David and Mu{\~n}oz,Victor}
}
@article {15812,
	title = {Structural Footprinting in Protein Structure Comparison: The Impact of Structural Fragments},
	journal = {BMC Structural Biology},
	volume = {7},
	year = {2007},
	month = {2007///},
	abstract = {Abstract Background One approach for speeding-up protein structure comparison is the projection approach, where a protein structure is mapped to a high-dimensional vector and structural similarity is approximated by distance between the corresponding vectors. Structural footprinting methods are projection methods that employ the same general technique to produce the mapping: first select a representative set of structural fragments as models and then map a protein structure to a vector in which each dimension corresponds to a particular model and "counts" the number of times the model appears in the structure. The main difference between any two structural footprinting methods is in the set of models they use; in fact a large number of methods can be generated by varying the type of structural fragments used and the amount of detail in their representation. How do these choices affect the ability of the method to detect various types of structural similarity? Results To answer this question we benchmarked three structural footprinting methods that vary significantly in their selection of models against the CATH database. In the first set of experiments we compared the methods{\textquoteright} ability to detect structural similarity characteristic of evolutionarily related structures, i.e., structures within the same CATH superfamily. In the second set of experiments we tested the methods{\textquoteright} agreement with the boundaries imposed by classification groups at the Class, Architecture, and Fold levels of the CATH hierarchy. Conclusion In both experiments we found that the method which uses secondary structure information has the best performance on average, but no one method performs consistently the best across all groups at a given classification level. We also found that combining the methods{\textquoteright} outputs significantly improves the performance. Moreover, our new techniques to measure and visualize the methods{\textquoteright} agreement with the CATH hierarchy, including the threshholded affinity graph, are useful beyond this work. In particular, they can be used to expose a similar composition of different classification groups in terms of structural fragments used by the method and thus provide an alternative demonstration of the continuous nature of the protein structure universe.},
	url = {DOI:10.1186/1472-6807-7-53DOI:10.1186/1472-6807-7-53},
	author = {Zotenko,Elena and Dogan,Rezarta Islamaj and Wilbur,W. John and O{\textquoteright}Leary, Dianne P. and Przytycka,Teresa M.}
}
@conference {14862,
	title = {A Study of Face Recognition as People Age},
	booktitle = {Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on},
	year = {2007},
	month = {2007/10//},
	pages = {1 - 8},
	abstract = {In this paper we study face recognition across ages within a real passport photo verification task. First, we propose using the gradient orientation pyramid for this task. Discarding the gradient magnitude and utilizing hierarchical techniques, we found that the new descriptor yields a robust and discriminative representation. With the proposed descriptor, we model face verification as a two-class problem and use a support vector machine as a classifier. The approach is applied to two passport data sets containing more than 1,800 image pairs from each person with large age differences. Although simple, our approach outperforms previously tested Bayesian technique and other descriptors, including the intensity difference and gradient with magnitude. In addition, it works as well as two commercial systems. Second, for the first time, we empirically study how age differences affect recognition performance. Our experiments show that, although the aging process adds difficulty to the recognition task, it does not surpass illumination or expression as a confounding factor.},
	keywords = {Bayesian, difference;passport, machine;face, machines;, magnitude;gradient, orientation, photo, pyramid;hierarchical, recognition;face, recognition;support, representation;face, task;support, technique;discriminative, techniques;intensity, vector, verification, verification;gradient},
	doi = {10.1109/ICCV.2007.4409069},
	author = {Ling,Haibin and Soatto,S. and Ramanathan,N. and Jacobs, David W.}
}
@article {12586,
	title = {Super-Resolution of Face Images Using Kernel PCA-Based Prior},
	journal = {Multimedia, IEEE Transactions on},
	volume = {9},
	year = {2007},
	month = {2007/06//},
	pages = {888 - 892},
	abstract = {We present a learning-based method to super-resolve face images using a kernel principal component analysis-based prior model. A prior probability is formulated based on the energy lying outside the span of principal components identified in a higher-dimensional feature space. This is used to regularize the reconstruction of the high-resolution image. We demonstrate with experiments that including higher-order correlations results in significant improvements},
	keywords = {analysis;learning-based, analysis;probability;, component, Face, image, method;prior, model;face, principal, probability, recognition;image, reconstruction;image, reconstruction;kernel, resolution;principal, super-resolution;high-resolution},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2007.893346},
	author = {Chakrabarti,Ayan and Rajagopalan, AN and Chellapa, Rama}
}
@article {13922,
	title = {Supporting elementary-age children{\textquoteright}s searching and browsing: Design and evaluation using the international children{\textquoteright}s digital library},
	journal = {Journal of the American Society for Information Science and Technology},
	volume = {58},
	year = {2007},
	month = {2007///},
	pages = {1618 - 1630},
	author = {Hutchinson,H.B. and Druin, Allison and Bederson, Benjamin B.}
}
@article {14893,
	title = {Surface Dependent Representations for Illumination Insensitive Image Comparison},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {29},
	year = {2007},
	month = {2007/01//},
	pages = {98 - 111},
	abstract = {We consider the problem of matching images to tell whether they come from the same scene viewed under different lighting conditions. We show that the surface characteristics determine the type of image comparison method that should be used. Previous work has shown the effectiveness of comparing the image gradient direction for surfaces with material properties that change rapidly in one direction. We show analytically that two other widely used methods, normalized correlation of small windows and comparison of multiscale oriented filters, essentially compute the same thing. Then, we show that for surfaces whose properties change more slowly, comparison of the output of whitening filters is most effective. This suggests that a combination of these strategies should be employed to compare general objects. We discuss indications that Gabor jets use such a mixed strategy effectively, and we propose a new mixed strategy. We validate our results on synthetic and real images},
	keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Subtraction Technique;, Computer-Assisted;Imaging, Gabor jets;Gaussian random surface;filter whitening;illumination;image comparison;image matching;lighting condition;multiscale oriented filter;surface dependent representation;image matching;image representation;Algorithms;Artificial Intelligence;Image En, Three-Dimensional;Information Storage and Retrieval;Lighting;Pattern Recognition},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2007.250602},
	author = {Osadchy,M. and Jacobs, David W. and Lindenbaum,M.}
}
@conference {13334,
	title = {Surface Segmentation through Concentrated Curvature},
	booktitle = {Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on},
	year = {2007},
	month = {2007/09//},
	pages = {671 - 676},
	abstract = {Curvature is one of the most relevant notions that links the metric properties of a surface to its geometry and to its topology (Gauss-Bonnet theorem). In the literature, a variety of approaches exist to compute curvatures in the discrete case. Several techniques are computationally intensive or suffer from convergence problems. In this paper, we discuss the notion of concentrated curvature, introduced by Troyanov [24]. We discuss properties of this curvature and compare with a widely-used technique that estimates the Gaussian curvatures on a triangulated surface. We apply our STD method [13] for terrain segmentation to segment a surface by using different curvature approaches and we illustrate our comparisons through examples.},
	keywords = {curvature;convergence, curvatures;concentrated, Gauss-Bonnet, problems;surface, processes;image, segmentation;, segmentation;terrain, segmentation;triangulated, surface;Gaussian, theorem;Gaussian},
	doi = {10.1109/ICIAP.2007.4362854},
	author = {Mesmoudi,M. M. and Danovaro,E. and De Floriani, Leila and Port,U.}
}
@article {16523,
	title = {Swarm Intelligence Systems Using Guided Self-Organization for Collective Problem Solving},
	journal = {Advances in Complex Systems},
	volume = {10},
	year = {2007},
	month = {2007///},
	pages = {5 - 34},
	author = {RodrIGuez,A. and Grushin,A. and Reggia, James A. and HAUPTMAN,AMI and SIPPER,M. and PAN,Z. and Reggia, James A. and GAO,D. and DARABOS,C. and GIACOBINI,M. and others}
}
@conference {12589,
	title = {Symmetric Objects are Hardly Ambiguous},
	booktitle = {Computer Vision and Pattern Recognition, 2007. CVPR {\textquoteright}07. IEEE Conference on},
	year = {2007},
	month = {2007/06//},
	pages = {1 - 7},
	abstract = {Given any two images taken under different illumination conditions, there always exist a physically realizable object which is consistent with both the images even if the lighting in each scene is constrained to be a known point light source at infinity. In this paper, we show that images are much less ambiguous for the class of bilaterally symmetric Lambertian objects. In fact, the set of such objects can be partitioned into equivalence classes such that it is always possible to distinguish between two objects belonging to different equivalence classes using just one image per object. The conditions required for two objects to belong to the same equivalence class are very restrictive, thereby leading to the conclusion that images of symmetric objects are hardly ambiguous. The observation leads to an illumination-invariant matching algorithm to compare images of bilaterally symmetric Lambertian objects. Experiments on real data are performed to show the implications of the theoretical result even when the symmetry and Lambertian assumptions are not strictly satisfied.},
	keywords = {algorithm;symmetric, bilaterally, images;image, Lambertian, MATCHING, matching;, objects, objects;illumination-invariant, objects;symmetric, symmetric},
	doi = {10.1109/CVPR.2007.383289},
	author = {Aggarwal,G. and Biswas,S. and Chellapa, Rama}
}
@article {15295,
	title = {Syntactic sentence compression in the biomedical domain: facilitating access to related articles},
	journal = {Information Retrieval},
	volume = {10},
	year = {2007},
	month = {2007///},
	pages = {393 - 414},
	abstract = {We explore a syntactic approach to sentence compression in the biomedical domain, grounded in the context of result presentation for related article search in the PubMed search engine. By automatically trimming inessential fragments of article titles, a system can effectively display more results in the same amount of space. Our implemented prototype operates by applying a sequence of syntactic trimming rules over the parse trees of article titles. Two separate studies were conducted using a corpus of manually compressed examples from MEDLINE: an automatic evaluation using Bleu and a summative evaluation involving human assessors. Experiments show that a syntactic approach to sentence compression is effective in the biomedical domain and that the presentation of compressed article titles supports accurate {\textquotedblleft}interest judgments{\textquotedblright}, decisions by users as to whether an article is worth examining in more detail.},
	doi = {10.1007/s10791-007-9029-5},
	author = {Jimmy Lin and Wilbur,W. J}
}
@article {16807,
	title = {System for 802.11 connectivity at high speed},
	volume = {UMIACS-TR-2007-27},
	year = {2007},
	month = {2007/05/13/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {Measurements and ongoing research have shown that WLANconnection for moving vehicles is feasible. However none of the previous
work suggests a solution addressing a complete array of the challenges
in vehicular WLAN communications. To amend this we designed a system
that provides wireless connection roaming at high
velocities transparent to user level applications, and does not impose
additional requirements to existing infrastructures. It offers simple
deployment, security, and scalability. It remains efficient under -
intermittent connectivity conditions and supports heterogeneous network
mediums for increased robustness.
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/4374},
	author = {Frangiadakis,Nikolaos and Kuklov,Danila and Roussopoulos, Nick}
}
@article {14731,
	title = {Safe manual memory management in Cyclone},
	journal = {Science of Computer Programming},
	volume = {62},
	year = {2006},
	month = {2006/10/01/},
	pages = {122 - 144},
	abstract = {The goal of the Cyclone project is to investigate how to make a low-level C-like language safe. Our most difficult challenge has been providing programmers with control over memory management while retaining safety. This paper describes our experience trying to integrate and use effectively two previously-proposed, safe memory-management mechanisms: statically-scoped regions and tracked pointers. We found that these typing mechanisms can be combined to build alternative memory-management abstractions, such as reference counted objects and arenas with dynamic lifetimes, and thus provide a flexible basis. Our experience {\textemdash} porting C programs and device drivers, and building new applications for resource-constrained systems {\textemdash} confirms that experts can use these features to improve memory footprint and sometimes to improve throughput when used instead of, or in combination with, conservative garbage collection.},
	keywords = {cyclone, Memory management, memory safety, Reaps, Reference counting, regions, unique pointers},
	isbn = {0167-6423},
	doi = {10.1016/j.scico.2006.02.003},
	url = {http://www.sciencedirect.com/science/article/pii/S0167642306000785},
	author = {Swamy,Nikhil and Hicks, Michael W. and Morrisett,Greg and Grossman,Dan and Jim,Trevor}
}
@article {17966,
	title = {Saliency-guided Enhancement for Volume Visualization},
	journal = {Visualization and Computer Graphics, IEEE Transactions on},
	volume = {12},
	year = {2006},
	month = {2006/10//sept},
	pages = {925 - 932},
	abstract = {Recent research in visual saliency has established a computational measure of perceptual importance. In this paper we present a visual-saliency-based operator to enhance selected regions of a volume. We show how we use such an operator on a user-specified saliency field to compute an emphasis field. We further discuss how the emphasis field can be integrated into the visualization pipeline through its modifications of regional luminance and chrominance. Finally, we validate our work using an eye-tracking-based user study and show that our new saliency enhancement operator is more effective at eliciting viewer attention than the traditional Gaussian enhancement operator},
	keywords = {Computer-Assisted;Imaging, Ocular;Humans;Image Enhancement;Image Interpretation, saliency-guided enhancement;visual-saliency-based operator;volume rendering;volume visualization;data visualisation;rendering (computer graphics);Algorithms;Attention;Computer Graphics;Eye Movements;Fixation, Three-Dimensional;User-Computer Interface;},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2006.174},
	author = {Kim,Y. and Varshney, Amitabh}
}
@conference {16873,
	title = {Scalable data collection and retrieval infrastructure for digital government applications},
	booktitle = {Proceedings of the 2006 international conference on Digital government research},
	series = {dg.o {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {301 - 302},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In this paper we describe highlights of the project titled "Scalable data collection infrastructure for digital government applications" under the auspices of the Digital Government Research Program of the National Science Foundation. Our research is focused on taking advantage of the distributed nature of data and the interaction with it. Our efforts have been directed at both the systems/theoretical and applications levels. On the systems and theoretical levels, we have continued our development of the BISTRO system (Section 2). On the applications level, work has commenced on the development of a mechanism for spatially tagging text documents for retrieval by search engines based on both content and spatial proximity (Section 3).},
	doi = {10.1145/1146598.1146679},
	url = {http://doi.acm.org/10.1145/1146598.1146679},
	author = {Samet, Hanan and Golubchik,Leana}
}
@conference {12272,
	title = {A scalable key management and clustering scheme for ad hoc networks},
	booktitle = {Proceedings of the 1st international conference on Scalable information systems},
	series = {InfoScale {\textquoteright}06},
	year = {2006},
	month = {2006///},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper describes a scalable key management and clustering scheme for secure group communications in ad hoc and sensor networks. The scalability problem is solved by partitioning the communicating devices into subgroups, with a leader in each subgroup, and further organizing the subgroups into hierarchies. Each level of the hierarchy is called a tier or layer. Key generation, distribution, and actual data transmissions follow the hierarchy. The Distributed, Efficient Clustering Approach (DECA) provides robust clustering to form subgroups, and analytical and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. Comparing with most other schemes, our approach is extremely scalable and efficient, provides more security guarantees, and is selective, adaptive and robust.},
	isbn = {1-59593-428-6},
	doi = {10.1145/1146847.1146875},
	url = {http://doi.acm.org/10.1145/1146847.1146875},
	author = {Li,Jason H. and Levy,Renato and Yu,Miao and Bhattacharjee, Bobby}
}
@article {18159,
	title = {A Scalable Multiuser Framework for Video Over OFDM Networks: Fairness and Efficiency},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {16},
	year = {2006},
	month = {2006/10//},
	pages = {1217 - 1231},
	abstract = {In this paper, we propose a framework to transmit multiple scalable video programs over downlink multiuser orthogonal frequency division multiplex (OFDM) networks in real time. The framework explores the scalability of the video codec and multidimensional diversity of multiuser OFDM systems to achieve the optimal service objectives subject to constraints on delay and limited system resources. We consider two essential service objectives, namely, the fairness and efficiency. Fairness concerns the video quality deviation among users who subscribe the same quality of service, and efficiency relates to how to attain the highest overall video quality using the available system resources. We formulate the fairness problem as minimizing the maximal end-to-end distortion received among all users and the efficiency problem as minimizing total end-to-end distortion of all users. Fast suboptimal algorithms are proposed to solve the above two optimization problems. The simulation results demonstrated that the proposed fairness algorithm outperforms a time division multiple (TDM) algorithm by 0.5 3 dB in terms of the worst received video quality among all users. In addition, the proposed framework can achieve a desired tradeoff between fairness and efficiency. For achieving the same average video quality among all users, the proposed framework can provide fairer video quality with 1 1.8 dB lower PSNR deviation than a TDM algorithm},
	keywords = {algorithm;video, codec;video, coding;video, communication;, deviation;downlink, deviation;OFDM, distortion;multidimensional, diversity;multiple, division, end-to-end, framework;time, Frequency, modulation;diversity, multiple, multiplex, multiuser, network;efficiency, networks;video, objectives;optimization, of, OFDM, orthogonal, over, problem;fairness, problem;maximal, problems;quality, programs;multiuser, PSNR, QUALITY, reception;image, resolution;optimisation;quality, scalable, service, service;scalable, service;video, systems;optimal, video},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2006.883513},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@article {15361,
	title = {Scalar Preisach Models of Hysteresis},
	journal = {The Science of Hysteresis: Mathematical modeling and applications},
	volume = {1},
	year = {2006},
	month = {2006///},
	pages = {293 - 293},
	author = {Mayergoyz, Issak D}
}
@article {14069,
	title = {Schistosoma mansoni (Platyhelminthes, Trematoda) nuclear receptors: Sixteen new members and a novel subfamily},
	journal = {Gene},
	volume = {366},
	year = {2006},
	month = {2006/02/01/},
	pages = {303 - 315},
	abstract = {Nuclear receptors (NRs) are important transcriptional modulators in metazoans. Sixteen new NRs were identified in the Platyhelminth trematode, Schistosoma mansoni. Three were found to possess novel tandem DNA-binding domains that identify a new subfamily of NR. Two NRs are homologues of the thyroid hormone receptor that previously were thought to be restricted to chordates. This study brings the total number of identified NR in S. mansoni to 21. Phylogenetic and comparative genomic analyses demonstrate that S. mansoni NRs share an evolutionary lineage with that of arthropods and vertebrates. Phylogenic analysis shows that more than half of the S. mansoni nuclear receptors evolved from a second gene duplication. As the second gene duplication of NRs was thought to be specific to vertebrates, our data challenge the current theory of NR evolution.},
	keywords = {Nuclear receptors, Schistosoma mansoni},
	isbn = {0378-1119},
	doi = {16/j.gene.2005.09.013},
	url = {http://www.sciencedirect.com/science/article/pii/S0378111905005871},
	author = {Wu,Wenjie and Niles,Edward G. and El-Sayed, Najib M. and Berriman,Matthew and LoVerde,Philip T.}
}
@book {15403,
	title = {The Science of Hysteresis: Mathematical modeling and applications},
	year = {2006},
	month = {2006///},
	publisher = {Academic Press},
	organization = {Academic Press},
	keywords = {Business \& Economics / Economics / Microeconomics, Hysteresis, Magnetism, Science / Physics / Magnetism},
	isbn = {9780123694317},
	author = {Bertotti,Giorgio and Mayergoyz, Issak D}
}
@article {13639,
	title = {Script-Independent Text Line Segmentation in Freestyle Handwritten Documents},
	volume = {LAMP-TR-136, CS-TR-4836, UMIACS-TR-2006-51, CFAR-TR-1017},
	year = {2006},
	month = {2006/11//},
	institution = {University of Maryland, College Park},
	abstract = {Text line segmentation in freestyle handwritten documents remains an open document analysis problem. Curvilinear text lines and small gaps between neighboring text lines present a challenge to algorithms developed for machine printed or hand-printed documents. In this paper, we propose a novel approach based on density estimation and a state-of-the-art image segmentation technique, the level set method. From an input document image, we estimate a probability map, where each element represents the probability that the underlying pixel belongs to a text line. The level set method is then exploited to determine the boundary of neighboring text lines by evolving an initial estimate. Unlike most connected component based methods [1, 2], the proposed algorithm does not use any script-specific knowledge. Extensive quantitative experiments on freestyle handwritten documents with diverse scripts, such as Arabic, Chinese, Korean, and Hindi, demonstrate that our algorithm consistently outperforms previous methods [3, 1, 2]. Further experiments show the proposed algorithm is robust to scale change, rotation, and noise.},
	author = {Li,Yi and Yefeng Zheng and David Doermann and Jaeger,Stefan}
}
@article {12926,
	title = {Seasonal Cholera Caused by Vibrio Cholerae Serogroups O1 and O139 in the Coastal Aquatic Environment of Bangladesh},
	journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.},
	volume = {72},
	year = {2006},
	month = {2006/06/01/},
	pages = {4096 - 4104},
	abstract = {Since Vibrio cholerae O139 first appeared in 1992, both O1 El Tor and O139 have been recognized as the epidemic serogroups, although their geographic distribution, endemicity, and reservoir are not fully understood. To address this lack of information, a study of the epidemiology and ecology of V. cholerae O1 and O139 was carried out in two coastal areas, Bakerganj and Mathbaria, Bangladesh, where cholera occurs seasonally. The results of a biweekly clinical study (January 2004 to May 2005), employing culture methods, and of an ecological study (monthly in Bakerganj and biweekly in Mathbaria from March 2004 to May 2005), employing direct and enrichment culture, colony blot hybridization, and direct fluorescent-antibody methods, showed that cholera is endemic in both Bakerganj and Mathbaria and that V. cholerae O1, O139, and non-O1/non-O139 are autochthonous to the aquatic environment. Although V. cholerae O1 and O139 were isolated from both areas, most noteworthy was the isolation of V. cholerae O139 in March, July, and September 2004 in Mathbaria, where seasonal cholera was clinically linked only to V. cholerae O1. In Mathbaria, V. cholerae O139 emerged as the sole cause of a significant outbreak of cholera in March 2005. V. cholerae O1 reemerged clinically in April 2005 and established dominance over V. cholerae O139, continuing to cause cholera in Mathbaria. In conclusion, the epidemic potential and coastal aquatic reservoir for V. cholerae O139 have been demonstrated. Based on the results of this study, the coastal ecosystem of the Bay of Bengal is concluded to be a significant reservoir for the epidemic serogroups of V. cholerae.},
	isbn = {0099-2240, 1098-5336},
	doi = {10.1128/AEM.00066-06},
	url = {http://aem.asm.org/content/72/6/4096},
	author = {Alam,Munirul and Hasan,Nur A. and Sadique,Abdus and Bhuiyan,N. A. and Ahmed,Kabir U. and Nusrin,Suraia and Nair,G. Balakrish and Siddique,A. K. and Sack,R. Bradley and Sack,David A. and Huq,Anwar and Rita R Colwell}
}
@article {15805,
	title = {Secondary Structure Spatial Conformation Footprint: A Novel Method for Fast Protein Structure Comparison and Classification},
	journal = {BMC Structural Biology},
	volume = {6},
	year = {2006},
	month = {2006///},
	abstract = {Recently a new class of methods for fast protein structure comparison has emerged. We call the methods in this class projection methods as they rely on a mapping of protein structure into a high-dimensional vector space. Once the mapping is done, the structure comparison is reduced to distance computation between corresponding vectors. As structural similarity is approximated by distance between projections, the success of any projection method depends on how well its mapping function is able to capture the salient features of protein structure. There is no agreement on what constitutes a good projection technique and the three currently known projection methods utilize very different approaches to the mapping construction, both in terms of what structural elements are included and how this information is integrated to produce a vector representation. Results In this paper we propose a novel projection method that uses secondary structure information to produce the mapping. First, a diverse set of spatial arrangements of triplets of secondary structure elements, a set of structural models, is automatically selected. Then, each protein structure is mapped into a high-dimensional vector of "counts" or footprint, where each count corresponds to the number of times a given structural model is observed in the structure, weighted by the precision with which the model is reproduced. We perform the first comprehensive evaluation of our method together with all other currently known projection methods. Conclusion The results of our evaluation suggest that the type of structural information used by a projection method affects the ability of the method to detect structural similarity. In particular, our method that uses the spatial conformations of triplets of secondary structure elements outperforms other methods in most of the tests.},
	url = {DOI:10.1186/1472-6807-6-12DOI:10.1186/1472-6807-6-12},
	author = {Zotenko,Elena and O{\textquoteright}Leary, Dianne P. and Przytycka,Teresa M.}
}
@conference {18279,
	title = {Security Issues in Cooperative Communications: Tracing Adversarial Relays},
	booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on},
	volume = {4},
	year = {2006},
	month = {2006/05//},
	pages = {IV - IV},
	abstract = {Cooperative communication system explores a new dimension of diversity in wireless communications to combat unfriendly wireless environment through strategic relays. While this emerging technology is promising in improving communication quality, some security problems inherent to cooperative relay also arise. In this paper we investigate the security issues in cooperative communications that consist of multiple relay nodes using decode-and-forward strategy. In particular, we consider the situation where one of the relay nodes is adversarial and tries to corrupt the communications by sending garbled signals. We show that the conventional physical-layer signal detection will not be effective in such a scenario, and the application-layer cryptography alone is not sufficient to identify the adversarial relay. To combat adversarial relay, we propose a cross-layer scheme that uses pseudo-random tracing symbols, with an adaptive signal detection rule at the physical layer, and direct sequence spread spectrum symbol construction at the application layer for tracing and identifying adversarial relay. Our experimental simulations show that the proposed tracing scheme is effective and efficient},
	keywords = {adaptive, Communication, communications;adaptive, construction;multiple, detection;adversarial, detection;decoding;radiocommunication;telecommunication, issues;strategic, nodes;pseudo-random, relay, relay;decode-and-forward, relays;cooperative, relays;wireless, security;, sequence, signal, spectrum, spread, strategy;direct, symbol, symbols;security, system;cooperative, tracing},
	doi = {10.1109/ICASSP.2006.1660907},
	author = {Mao,Yinian and M. Wu}
}
@conference {12625,
	title = {Segmentation and Probabilistic Registration of Articulated Body Models},
	booktitle = {Pattern Recognition, 2006. ICPR 2006. 18th International Conference on},
	volume = {2},
	year = {2006},
	month = {2006///},
	pages = {92 - 96},
	abstract = {There are different approaches to pose estimation and registration of different body parts using voxel data. We propose a general bottom-up approach in order to segment the voxels into different body parts. The voxels are first transformed into a high dimensional space which is the eigenspace of the Laplacian of the neighbourhood graph. We exploit the properties of this transformation and fit splines to the voxels belonging to different body segments in eigenspace. The boundary of the splines is determined by examination of the error in spline fitting. We then use a probabilistic approach to register the segmented body segments by utilizing their connectivity and prior knowledge of the general structure of the subjects. We present results on real data, containing both simple and complex poses. While we use human subjects in our experiment, the method is fairly general and can be applied to voxel-based registration of any articulated or non-rigid object composed of primarily 1-D parts},
	keywords = {(mathematics);, and, approach;eigenspace;image, articulated, body, data;voxel-based, eigenfunctions;graph, estimation;probabilistic, fitting;voxel, graph;pose, models;bottom-up, registration;eigenvalues, registration;image, registration;spline, segmentation;neighbourhood, segmentation;probability;splines, theory;image},
	doi = {10.1109/ICPR.2006.1034},
	author = {Sundaresan, A. and Chellapa, Rama}
}
@article {13171,
	title = {Segmentation of planar objects and their shadows in motion sequences},
	journal = {International journal of computer vision},
	volume = {67},
	year = {2006},
	month = {2006///},
	pages = {53 - 69},
	abstract = {We investigate segmentation of planar objects and their cast shadows in image sequences. Given two moving image regions in an image sequence we present an algorithm for determining if the two moving regions can be interpreted as a planar object and its cast shadow. Projective geometry and motion properties are employed to directly recover a homology that constrains point correspondences of the outlines of the image regions and determine if they obey an object/shadow relationship. This homology is derived directly from the motions of the regions and therefore is easier to accomplish than determining point-to-point correspondences between candidate object-shadow pairs. Several experiments under approximate point light source illumination are presented.},
	author = {Yacoob,Yaser and Davis, Larry S.}
}
@conference {13181,
	title = {Segmenting people in small groups},
	booktitle = {Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks},
	series = {VSSN {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {1 - 2},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In this paper we review prior work on the problem of segmenting small groups of people into individuals in surveillance video.},
	keywords = {segmentation, Surveillance, video analysis},
	isbn = {1-59593-496-0},
	doi = {10.1145/1178782.1178783},
	url = {http://doi.acm.org/10.1145/1178782.1178783},
	author = {Davis, Larry S.}
}
@article {14642,
	title = {Selection of Target Sites for Mobile DNA Integration in the Human Genome},
	journal = {PLoS Comput BiolPLoS Comput Biol},
	volume = {2},
	year = {2006},
	month = {2006/11/24/},
	pages = {e157 - e157},
	abstract = {DNA sequences from retroviruses, retrotransposons, DNA transposons, and parvoviruses can all become integrated into the human genome. Accumulation of such sequences accounts for at least 40\% of our genome today. These integrating elements are also of interest as gene-delivery vectors for human gene therapy. Here we present a comprehensive bioinformatic analysis of integration targeting by HIV, MLV, ASLV, SFV, L1, SB, and AAV. We used a mathematical method which allowed annotation of each base pair in the human genome for its likelihood of hosting an integration event by each type of element, taking advantage of more than 200 types of genomic annotation. This bioinformatic resource documents a wealth of new associations between genomic features and integration targeting. The study also revealed that the length of genomic intervals analyzed strongly affected the conclusions drawn{\textemdash}thus, answering the question {\textquotedblleft}What genomic features affect integration?{\textquotedblright} requires carefully specifying the length scale of interest.},
	doi = {10.1371/journal.pcbi.0020157},
	url = {UR  - http://dx.plos.org/10.1371/journal.pcbi.0020157,http://dx.plos.org/10.1371/journal.pcbi.0020157},
	author = {Berry,Charles and Hannenhalli, Sridhar and Leipzig,Jeremy and Bushman,Frederic D.}
}
@conference {13179,
	title = {Semi-Parametric Model-Based Clustering for DNA Microarray Data},
	booktitle = {Pattern Recognition, 2006. ICPR 2006. 18th International Conference on},
	volume = {3},
	year = {2006},
	month = {2006//00/0},
	pages = {324 - 327},
	abstract = {Various clustering methods have been proposed for the analysis of gene expression data, but conventional clustering algorithms have several critical limitations; how to set parameters such as number of clusters, initial cluster centers, and so on. In this paper, we propose a semi-parametric model-based clustering algorithm in which the underlying model is a mixture of Gaussian. Each gene expression data builds a Gaussian kernel, and the uncertainty of microarray data is naturally integrated in the data representation. Our algorithm provides a principled method to automatically determine parameters - number of components in the mixture, mean, covariance, and weight of each Gaussian - by mean-shift procedure (Comaniciu and Meer, 1999) and curvature fitting. After the initialization, expectation maximization (EM) algorithm is employed for clustering to achieve maximum likelihood (ML). The performance of our algorithm is compared with standard EM algorithm using real data as well as synthetic data},
	keywords = {clustering;, clustering;DNA;Gaussian, computing;genetics;pattern, data;Gaussian, data;maximum, DNA, Expression, fitting;data, kernel;Gaussian, likelihood;mean-shift, maximization;gene, Microarray, mixtures;curvature, model-based, procedure;semiparametric, processes;biology, representation;expectation},
	doi = {10.1109/ICPR.2006.1044},
	author = {Han,Bohyung and Davis, Larry S.}
}
@conference {11979,
	title = {A sensory grammar for inferring behaviors in sensor networks},
	booktitle = {Proceedings of the 5th international conference on Information processing in sensor networks},
	series = {IPSN {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {251 - 259},
	publisher = {ACM},
	organization = {ACM},
	address = {Nashville, Tennessee, USA},
	abstract = {The ability of a sensor network to parse out observable activities into a set of distinguishable actions is a powerful feature that can potentially enable many applications of sensor networks to everyday life situations. In this paper we introduce a framework that uses a hierarchy of Probabilistic Context Free Grammars (PCFGs) to perform such parsing. The power of the framework comes from the hierarchical organization of grammars that allows the use of simple local sensor measurements for reasoning about more macroscopic behaviors. Our presentation describes how to use a set of phonemes to construct grammars and how to achieve distributed operation using a messaging model. The proposed framework is flexible. It can be mapped to a network hierarchy or can be applied sequentially and across the network to infer behaviors as they unfold in space and time. We demonstrate this functionality by inferring simple motion patterns using a sequence of simple direction vectors obtained from our camera sensor network testbed.},
	keywords = {algorithms, behavior identification, human activity, human factors, pcfg, real-time and embedded systems, sensor grammars, sensor networks},
	isbn = {1-59593-334-4},
	doi = {10.1145/1127777.1127817},
	author = {Lymberopoulos, Dimitrios and Ogale, Abhijit S. and Savvides, Andreas and Aloimonos, J.}
}
@conference {12026,
	title = {A Sensory-Motor Language for Human Activity Understanding},
	booktitle = {2006 6th IEEE-RAS International Conference on Humanoid Robots},
	year = {2006},
	month = {2006/12/04/6},
	pages = {69 - 75},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We have empirically discovered that the space of human actions has a linguistic framework. This is a sensory-motor space consisting of the evolution of the joint angles of the human body in movement. The space of human activity has its own phonemes, morphemes, and sentences. We present a human activity language (HAL) for symbolic non-arbitrary representation of visual and motor information. In phonology, we define atomic segments (kinetemes) that are used to compose human activity. We introduce the concept of a kinetological system and propose five basic properties for such a system: compactness, view-invariance, reproducibility, selectivity, and reconstructivity. In morphology, we extend sequential language learning to incorporate associative learning with our parallel learning approach. Parallel learning is effective in identifying the kinetemes and active joints in a particular action. In syntax, we suggest four lexical categories for our human activity language (noun, verb, adjective, and adverb). These categories are combined into sentences through syntax for human movement},
	keywords = {Actuators, associative learning, atomic segments, computational linguistics, Computer science, Computer vision, Educational institutions, grammars, human activity language, human activity understanding, human movement syntax, Humanoid robots, HUMANS, joint angles, kinetemes, kinetological system, Laboratories, learning (artificial intelligence), List key index terms here, Morphology, motor information, No mare than 5, parallel learning, Reproducibility of results, Robot kinematics, Robot programming, robot vision, sensory-motor language, sequential language learning, symbolic nonarbitrary representation, visual information},
	isbn = {1-4244-0200-X},
	doi = {10.1109/ICHR.2006.321365},
	author = {Guerra-Filho,G. and Aloimonos, J.}
}
@article {13857,
	title = {Sentence compression as a component of a multi-document summarization system},
	journal = {Proceedings of the 2006 Document Understanding Workshop, New York},
	year = {2006},
	month = {2006///},
	abstract = {We applied a single-document sentence-trimming approach (Trimmer) to the
problem of multi-document summariza-
tion. Trimmer was designed with the in-
tention of compressing a lead sentence
into a space consisting of tens of char-
acters. In our Multi-Document Trimmer
(MDT), we use Trimmer to generate
multiple trimmed candidates for each
sentence. Sentence selection is used
to determine which trimmed candidates
provide the best combination of topic
coverage and brevity. We demonstrate
that we were able to port Trimmer easily
to this new problem. We also show that
MDT generally ranked higher for recall
than for precision, suggesting that MDT
is currently more successful at finding
relevant content than it is at weeding out
irrelevant content. Finally, we present
an error analysis that shows that, while
sentence compressions is making space
for additional sentences, more work is
needed in the area of generating and se-
lecting the right candidates.
},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Schwartz,R.}
}
@inbook {15806,
	title = {Sentence Trimming and Selection: Mixing and Matching},
	booktitle = {DUC 06 Conference Proceedings},
	year = {2006},
	month = {2006///},
	publisher = {U.S. National Inst. of Standards and Technology},
	organization = {U.S. National Inst. of Standards and Technology},
	abstract = {We describe how components from two distinct multi-document summarization systems were combined. Twenty four possible combinations of components were considered. We observed some contrasts between conservative and aggressive sentence compression (i.e., trimming) in the context of multi-document summarization.
},
	url = {http://duc.nist.gov/},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and O{\textquoteright}Leary, Dianne P. and Conroy,John M. and Schlesinger,Judith D.}
}
@article {12924,
	title = {Septaplex PCR assay for rapid identification of Vibrio cholerae including detection of virulence and int SXT genes},
	journal = {FEMS Microbiology Letters},
	volume = {265},
	year = {2006},
	month = {2006/12/01/},
	pages = {208 - 214},
	abstract = {In this study, we describe a septaplex PCR assay for rapid identification of Vibrio cholerae including detection of the virulence and intsxt genes. Conditions were optimized to amplify fragments of ISRrRNA (encoding for 16S{\textendash}23S rRNA gene, Intergenic spacer regions), O1rfb (O1 serogroup specific rfb), O139rfb (O139 serogroup specific rfb), ctxA (cholera toxin subunit A), tcpA (toxin coregulated pilus), and intsxt (sxt integron) simultaneously in a single PCR. The septaplex PCR was evaluated using 211 strains of V. cholerae and six water samples for in situ testing. PCR results were correlated with genotype data obtained by individual PCR and slot-blot assays. The one-step PCR described here can be used to identify V. cholerae accurately and rapidly. Also, the virulence and intsxt genes can be simultaneously detected, providing a useful method for monitoring pathogenic, intsxt-positive and nonpathogenic, intsxt-negative V. cholerae serogroups both in the environment and clinical settings.},
	keywords = {DETECTION, intsxt, septaplex PCR, Vibrio cholerae, virulence},
	isbn = {1574-6968},
	doi = {10.1111/j.1574-6968.2006.00491.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1574-6968.2006.00491.x/full},
	author = {Mantri,Chinmay K. and Mohapatra,Saswat S. and Ramamurthy,Thandavarayan and Ghosh,Raikamal and Rita R Colwell and Singh,Durg V.}
}
@article {17658,
	title = {Session 8A-Combinatorial Optimization and Quantum Computing-Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems},
	journal = {Lecture Notes in Computer Science},
	volume = {4288},
	year = {2006},
	month = {2006///},
	pages = {628 - 637},
	author = {Ambainis,A. and Gasarch,W. and Srinivasan, Aravind and Utis,A.}
}
@article {17356,
	title = {Severity and impact of computer user frustration: A comparison of student and workplace users},
	journal = {Interacting with Computers},
	volume = {18},
	year = {2006},
	month = {2006/03//},
	pages = {187 - 207},
	abstract = {User frustration with information and computing technology is a pervasive and persistent problem. When computers crash, network congestion causes delays, and poor user interfaces trigger confusion there are dramatic consequences for individuals, organizations, and society. These frustrations, not only cause personal dissatisfaction and loss of self-efficacy, but may disrupt workplaces, slow learning, and reduce participation in local and national communities. Our exploratory study of 107 student computer users and 50 workplace computer users shows high levels of frustration and loss of 1/3{\textendash}1/2 of time spent. This paper reports on the incident and individual factors that cause of frustration, and how they raise frustration severity. It examines the frustration impacts on the daily interactions of the users. The time lost and time to fix problem, and importance of task, strongly correlate with frustration levels for both student and workplace users. Differences between students and workplace users are discussed in the paper, as are implications for researchers.},
	keywords = {Computer anxiety, Computer experience, Helpdesk, Training, User frustration, user interface design},
	isbn = {0953-5438},
	doi = {10.1016/j.intcom.2005.06.001},
	url = {http://www.sciencedirect.com/science/article/pii/S0953543805000561},
	author = {Lazar,Jonathan and Jones,Adam and Hackley,Mary and Shneiderman, Ben}
}
@conference {19367,
	title = {Shape Similarity Assessment Based On Face Alignment Using Attributed Applied Vectors.},
	booktitle = {CAD Conference},
	year = {2006},
	author = {Cardone, Antonio and Gupta, Satyandra K.}
}
@conference {12608,
	title = {Shape-Regulated Particle Filtering for Tracking Non-Rigid Objects},
	booktitle = {Image Processing, 2006 IEEE International Conference on},
	year = {2006},
	month = {2006/10//},
	pages = {2813 - 2816},
	abstract = {This paper presents an active contour based algorithm for tracking non-rigid objects in heavily cluttered scenes. We decompose the non-rigid contour tracking problem into three subproblems: 2D motion estimation, deformation detection, and shape regulation. First, we employ a particle filter to estimate the affine transform parameters between successive frames. Second, by using a dynamic object model, we generate a probabilistic map of deformation to reshape its contour. Finally, we project the updated model onto a trained shape subspace to constrain deformations to be within possible object appearances. Our experiments show that the proposed algorithm significantly improves the performance of the tracker},
	keywords = {(numerical, 2D, algorithm;affine, based, contour, detection;dynamic, detection;motion, detection;parameter, estimation;active, estimation;object, estimation;particle, Filtering, filtering;probabilistic, filters;, map;shape-regulation;affine, methods);tracking, model;nonrigid, MOTION, object, scenes;deformation, tracking;parameter, transform;cluttered, transforms;clutter;edge},
	doi = {10.1109/ICIP.2006.312993},
	author = {Jie Shao and Chellapa, Rama and Porikli, F.}
}
@article {16084,
	title = {Shared family calendars: Promoting symmetry and accessibility},
	journal = {ACM Trans. Comput.-Hum. Interact.},
	volume = {13},
	year = {2006},
	month = {2006/09//},
	pages = {313 - 346},
	abstract = {We describe the design and use of a system facilitating the sharing of calendar information between remotely located, multi-generational family members. Most previous work in this area involves software enabling younger family members to monitor their parents. We have found, however, that older adults are equally if not more interested in the activities of younger family members. The major obstacle preventing them from participating in information sharing is the technology itself. Therefore, we developed a multi-layered interface approach that offers simple interaction to older users. In our system, users can choose to enter information into a computerized calendar or write it by hand on digital paper calendars. All of the information is automatically shared among everyone in the distributed family. By making the interface more accessible to older users, we promote symmetrical sharing of information among both older and younger family members. We present our participatory design process, describe the user interface, and report on an exploratory field study in three households of an extended family.},
	keywords = {calendar, digital paper, elderly, family technology, Home, layered interface, privacy, universal usability},
	isbn = {1073-0516},
	doi = {10.1145/1183456.1183458},
	url = {http://doi.acm.org/10.1145/1183456.1183458},
	author = {Plaisant, Catherine and Clamage,Aaron and Hutchinson,Hilary Browne and Bederson, Benjamin B. and Druin, Allison}
}
@inbook {12629,
	title = {Silhouette-Based Approaches},
	booktitle = {Human Identification Based on GaitHuman Identification Based on Gait},
	year = {2006},
	month = {2006///},
	pages = {45 - 105},
	abstract = {Of the current approaches, most are based on analysis of silhouettes. This is like the earlier analysis which concerned abstracting a walking subject from the background and then deriving set of measurements that describe the shape and motion of that silhouette in a sequence of images. This is similar in approach the classic computer vision approach to recognize objects by using shape descriptions of objects derived, say, by optimal thresholding.},
	author = {Nixon, M.S. and Tan, T. and Chellapa, Rama}
}
@conference {14391,
	title = {Social Capital in Friendship-Event Networks},
	booktitle = {Data Mining, 2006. ICDM {\textquoteright}06. Sixth International Conference on},
	year = {2006},
	month = {2006///},
	pages = {959 - 964},
	abstract = {In this paper, we examine a particular form of social network which we call a friendship-event network. A friendship-event network captures both the friendship relationship among a set of actors, and also the organizer and participation relationships of actors in a series of events. Within these networks, we formulate the notion of social capital based on the actor-organizer friendship relationship and the notion of benefit, based on event participation. We investigate appropriate definitions for the social capital of both a single actor and a collection of actors. We ground these definitions in a real-world example of academic collaboration networks, where the actors are researchers, the friendships are collaborations, the events are conferences, the organizers are program committee members and the participants are conference authors. We show that our definitions of capital and benefit capture interesting qualitative properties of event series. In addition, we show that social capital is a better publication predictor than publication history.},
	keywords = {academic, based, capital;Internet;groupware;knowledge, Collaboration, friendship;friendship-event, network;actor-organizer, network;social, systems;},
	doi = {10.1109/ICDM.2006.149},
	author = {Licamele,L. and Getoor, Lise}
}
@article {13648,
	title = {SOFTCBIR: Object Searching in Videos Combining Keypoint Matching and Graduated Assignment},
	volume = {LAMP-TR-132,CAR-TR-1013,CS-TR-4804,UMIACS-TR-2006-25},
	year = {2006},
	month = {2006/05//},
	institution = {University of Maryland, College Park},
	abstract = {This paper proposes a new approach to object searching in video databases, SoftCBIR, which combines a keypoint matching algorithm and a graduated assignment algorithm based on softassign. Compared with previous approaches, SoftCBIR is an innovative combination of two powerful techniques: 1) An energy minimization algorithm is applied to match two groups of keypoints while accounting for both their similarity in descriptor space and the consistency of their geometric configuration. The algorithm computes correspondence and pose transformation between two groups of keypoints iteratively and alternately toward an optimal result. The objective energy function combines normalized distance errors in descriptor space and in the spatial domain. 2) Initial individual keypoint matching relies on Approximate K-Nearest Neighbor (ANN) search. ANN achieves much more accurate initial keypoint matching results in the descriptor space than K-means labeling. Experiments prove the effectiveness of our approach, and demonstrate the performance improvements rising from the combination of the two proposed techniques in the SoftCBIR algorithm. The support of this research by the Department of Defense under contract MDA-9040-2C-0406 is gratefully acknowledged.},
	author = {Luo,Ming and DeMenthon,Daniel and Yu,Xiaodong and David Doermann}
}
@conference {12830,
	title = {A Software Architectural Approach to Security by Design},
	booktitle = {Computer Software and Applications Conference, 2006. COMPSAC {\textquoteright}06. 30th Annual International},
	volume = {2},
	year = {2006},
	month = {2006/09/17/21},
	pages = {83 - 86},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper shows how an architecture description notation that has support for timed events can be used to provide a meta-language for specifying exact communication semantics. The advantages of such an approach is that a designer is made fully aware of the ramifications of her design choices so that an attacker can no longer take advantage of hidden assumptions},
	keywords = {architecture description notation, Clocks, communication semantics, Computer architecture, computer crime, computer security, Connectors, Costs, Degradation, Delay, Educational institutions, security design, security of data, Software architecture, software engineering},
	isbn = {0-7695-2655-1},
	doi = {10.1109/COMPSAC.2006.102},
	author = {Ray,A. and Cleaveland, Rance}
}
@article {13864,
	title = {SParseval: Evaluation metrics for parsing speech},
	journal = {Proc. LREC},
	year = {2006},
	month = {2006///},
	abstract = {While both spoken and written language processing stand to benefit from parsing, the standard Parseval metrics (Black et al., 1991) andtheir canonical implementation (Sekine and Collins, 1997) are only useful for text. The Parseval metrics are undefined when the words
input to the parser do not match the words in the gold standard parse tree exactly, and word errors are unavoidable with automatic speech
recognition (ASR) systems. To fill this gap, we have developed a publicly available tool for scoring parses that implements a variety
of metrics which can handle mismatches in words and segmentations, including: alignment-based bracket evaluation, alignment-based
dependency evaluation, and a dependency evaluation that does not require alignment. We describe the different metrics, how to use the
tool, and the outcome of an extensive set of experiments on the sensitivity of the metrics.
},
	author = {Roark,B. and Harper,M. and Charniak,E. and Dorr, Bonnie J and Johnson,M. and Kahn,J. and Liu,Y. and Ostendorf,M. and Hale,J. and Krasnyanskaya,A. and others}
}
@article {12605,
	title = {Special Issue on Biometrics: Algorithms and Applications},
	journal = {Proceedings of the IEEE},
	volume = {94},
	year = {2006},
	month = {2006/11//},
	pages = {1912 - 1914},
	isbn = {0018-9219},
	doi = {10.1109/JPROC.2006.886016},
	author = {Chellapa, Rama and Phillips, J. and Reynolds, D.}
}
@article {14016,
	title = {Spherical and hemispherical microphone arrays for capture and analysis of sound fields},
	journal = {The Journal of the Acoustical Society of America},
	volume = {120},
	year = {2006},
	month = {2006///},
	pages = {3225 - 3225},
	abstract = {The capture of the spatial structure of a sound field and analysis is important in many fields including creating virtual environments, source localization and detection, noise suppression, and beamforming. Spherical microphone arrays are a promising development to help achieve such capture and analysis, and have been studied by several groups. We develop a practical spherical microphone array and demonstrate its utility in applications for sound capture, room measurement and for beamforming and tracking. To accommodate equipment failure and manufacturing imprecision we extend their theory to handle arbitrary microphone placement. To handle speech capture and surveillance we describe the development of a new sensor, the hemispherical microphone array. For each array the practical performance follows that predicted by theory. Future applications and improvements are also discussed. [Work supported by NSF.]},
	url = {http://link.aip.org/link/?JAS/120/3225/3},
	author = {Duraiswami, Ramani and Zhiyun Li and Zotkin,Dmitry N and Grassi,Elena}
}
@conference {12609,
	title = {Stabilization and Mosaicing of Airborne Videos},
	booktitle = {Image Processing, 2006 IEEE International Conference on},
	year = {2006},
	month = {2006/10//},
	pages = {345 - 348},
	abstract = {We present an algorithm for stabilizing low-quality and low-resolution video sequences obtained from UAVs and MAVs flying over a predominantly planar terrain. The problem is important for the processing of videos captured from airborne platforms where most of the image region gives little information about the image-motion. The algorithm consists of approximately aligning the images using phase correlation, then refining the transformation parameters using available optical flow measurements and finally performing a minimization of the image difference by carefully selecting the image regions to make the iterations converge. In the second part of the paper, we describe an algorithm for camera ego-motion estimation by incorporating available metadata along with the video sequence. The availability of metadata such as IMU measurements provides a good initial solution for the camera orientation and helps the iterations converge faster by reducing the search space},
	keywords = {airborne, analysis;image, cameras;, convergence;low-resolution, ego-motion, estimation;iterations, flow, measurement;video, mosaicing;camera, MOTION, resolution;image, segmentation;image, sequence;optical, sequences;video, stabilization;image, video, Videos},
	doi = {10.1109/ICIP.2006.313164},
	author = {Ramachandran, M. and Chellapa, Rama}
}
@article {15810,
	title = {Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices},
	journal = {SIAM J. on Matrix Analysis and Applications},
	volume = {28},
	year = {2006},
	month = {2006///},
	pages = {576 - 595},
	abstract = {We call a matrix triadic if it has no more than two nonzero off-diagonal elements in any column. A symmetric tridiagonal matrix is a special case. In this paper we consider $LXL^T$ factorizations of symmetric triadic matrices, where $L$ is unit lower triangular and $X$ is diagonal, block diagonal with $1\!\times\!1$ and $2\!\times\!2$ blocks, or the identity with $L$ lower triangular. We prove that with diagonal pivoting, the $LXL^T$ factorization of a symmetric triadic matrix is sparse, study some pivoting algorithms, discuss their growth factor and performance, analyze their stability, and develop perturbation bounds. These factorizations are useful in computing inertia, in solving linear systems of equations, and in determining modified Newton search directions.},
	author = {Fang,Haw-ren and O{\textquoteright}Leary, Dianne P.}
}
@conference {18649,
	title = {A Statistical Analysis of Attack Data to Separate Attacks},
	year = {2006},
	month = {2006/06//},
	pages = {383 - 392},
	abstract = {This paper analyzes malicious activity collected from a test-bed, consisting of two target computers dedicated solely to the purpose of being attacked, over a 109 day time period. We separated port scans, ICMP scans, and vulnerability scans from the malicious activity. In the remaining attack data, over 78\% (i.e., 3,677 attacks) targeted port 445, which was then statistically analyzed. The goal was to find the characteristics that most efficiently separate the attacks. First, we separated the attacks by analyzing their messages. Then we separated the attacks by clustering characteristics using the K-Means algorithm. The comparison between the analysis of the messages and the outcome of the K-Means algorithm showed that 1) the mean of the distributions of packets, bytes and message lengths over time are poor characteristics to separate attacks and 2) the number of bytes, the mean of the distribution of bytes and message lengths as a function of the number packets are the best characteristics for separating attacks},
	keywords = {attack data statistical analysis, attack separation, computer crime, Data analysis, data mining, ICMP scans, K-Means algorithm, pattern clustering, port scans, statistical analysis, vulnerability scans},
	doi = {10.1109/DSN.2006.9},
	author = {Michel Cukier and Berthier,R. and Panjwani,S. and Tan,S.}
}
@inbook {18806,
	title = {A Step Towards Automated Design of Side Actions in Injection Molding of Complex Parts},
	booktitle = {Geometric Modeling and Processing - GMP 2006},
	series = {Lecture Notes in Computer Science},
	volume = {4077},
	year = {2006},
	month = {2006///},
	pages = {500 - 513},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Side actions contribute to mold cost by resulting in an additional manufacturing and assembly cost as well as by increasing the molding cycle time. Therefore, generating shapes of side actions requires solving a complex geometric optimization problem. Different objective functions may be needed depending upon different molding scenarios (e.g., prototyping versus large production runs). Manually designing side actions is a challenging task and requires considerable expertise. Automated design of side actions will significantly reduce mold design lead times. This paper describes algorithms for generating shapes of side actions to minimize a customizable molding cost function.},
	keywords = {Computer science},
	isbn = {978-3-540-36711-6},
	url = {http://www.springerlink.com/content/w7q3212607500635/abstract/},
	author = {Banerjee,Ashis and Gupta, Satyandra K.},
	editor = {Kim,Myung-Soo and Shimada,Kenji}
}
@article {16522,
	title = {Stigmergic self-assembly of prespecified artificial structures in a constrained and continuous environment},
	journal = {Integrated Computer-Aided Engineering},
	volume = {13},
	year = {2006},
	month = {2006///},
	pages = {289 - 312},
	author = {Grushin,A. and Reggia, James A.}
}
@conference {17785,
	title = {A stochastic language for modelling opponent agents},
	booktitle = {Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems},
	year = {2006},
	month = {2006///},
	pages = {244 - 246},
	abstract = {There are numerous cases where a reasoning agent needs toreason about the behavior of an opponent agent. In this pa-
per, we propose a hybrid probabilistic logic language within
which we can express what actions an opponent may take
in a given situation. We present the syntaxis and semantics
of the language, and the concept of a Maximally Probable
Course of Action.
},
	author = {Simari,G. and Sliva,A. and Nau, Dana S. and V.S. Subrahmanian}
}
@conference {16086,
	title = {Strategies for evaluating information visualization tools: multi-dimensional in-depth long-term case studies},
	booktitle = {Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization},
	series = {BELIV {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {1 - 7},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {After an historical review of evaluation methods, we describe an emerging research method called Multi-dimensional In-depth Long-term Case studies (MILCs) which seems well adapted to study the creative activities that users of information visualization systems engage in. We propose that the efficacy of tools can be assessed by documenting 1) usage (observations, interviews, surveys, logging etc.) and 2) expert users{\textquoteright} success in achieving their professional goals. We summarize lessons from related ethnography methods used in HCI and provide guidelines for conducting MILCs for information visualization. We suggest ways to refine the methods for MILCs in modest sized projects and then envision ambitious projects with 3-10 researchers working over 1-3 years to understand individual and organizational use of information visualization by domain experts working at the frontiers of knowledge in their fields.},
	isbn = {1-59593-562-2},
	doi = {10.1145/1168149.1168158},
	url = {http://doi.acm.org/10.1145/1168149.1168158},
	author = {Shneiderman, Ben and Plaisant, Catherine}
}
@conference {17538,
	title = {A structural approach to latency prediction},
	booktitle = {Proceedings of the 6th ACM SIGCOMM conference on Internet measurement},
	series = {IMC {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {99 - 104},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models are simple, they can often fail systematically; for example, the most widely used models use metric embeddings that predict no benefit to detour routes even though half of all Internet routes can benefit from detours.In this paper, we adopt a structural approach that predicts path latency based on measurements of the Internet{\textquoteright}s routing topology, PoP connectivity, and routing policy. We find that our approach outperforms Vivaldi, the most widely used black-box model. Furthermore, unlike metric embeddings, our approach successfully predicts 65\% of detour routes in the Internet. The number of measurements used in our approach is comparable with that required by black box techniques, but using traceroutes instead of pings.},
	keywords = {internet topology, latency prediction, route measurements},
	isbn = {1-59593-561-4},
	doi = {10.1145/1177080.1177092},
	url = {http://doi.acm.org/10.1145/1177080.1177092},
	author = {Madhyastha,Harsha V. and Anderson,Thomas and Krishnamurthy,Arvind and Spring, Neil and Venkataramani,Arun}
}
@article {12604,
	title = {Structure From Planar Motion},
	journal = {Image Processing, IEEE Transactions on},
	volume = {15},
	year = {2006},
	month = {2006/11//},
	pages = {3466 - 3477},
	abstract = {Planar motion is arguably the most dominant type of motion in surveillance videos. The constraints on motion lead to a simplified factorization method for structure from planar motion when using a stationary perspective camera. Compared with methods for general motion , our approach has two major advantages: a measurement matrix that fully exploits the motion constraints is formed such that the new measurement matrix has a rank of at most 3, instead of 4; the measurement matrix needs similar scalings, but the estimation of fundamental matrices or epipoles is not needed. Experimental results show that the algorithm is accurate and fairly robust to noise and inaccurate calibration. As the new measurement matrix is a nonlinear function of the observed variables, a different method is introduced to deal with the directional uncertainty in the observed variables. Differences and the dual relationship between planar motion and planar object are also clarified. Based on our method, a fully automated vehicle reconstruction system has been designed},
	keywords = {algebra;road, analysis;matrix, camera;surveillance, directional, matrix;planar, MOTION, motion;stationary, perspective, processing;, reconstruction, signal, system;image, uncertainty;measurement, vehicles;surveillance;video, videos;vehicle},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2006.881943},
	author = {Li,Jian and Chellapa, Rama}
}
@article {17662,
	title = {Structure of social contact networks and their impact on epidemics},
	journal = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
	volume = {70},
	year = {2006},
	month = {2006///},
	pages = {181 - 181},
	abstract = {Traditional epidemiological research has focused on rate-based differential-equation models on completely mixing populations.
In this paper, we outline an approach based on a combination of net-
work theory and discrete-event simulations to study epidemics in large
urban areas. We survey some of our results published in Nature (2004)
and the Proc. ACM-SIAM Symposium on Discrete Algorithms (2004),
and present some new results on: (i) mathematical properties of large
social contact networks, as well as (ii) simulation-based dynamic anal-
ysis of disease-spread in such networks. We identify a number of new
measures that are significant for understanding epidemics and for devel-
oping new strategies in policy planning. We also perform a very detailed
structural analysis of the social contact networks produced by TRAN-
SIMS, a simulator for detailed transportation/traffic studies, and study
two random graph models to generate realistic social networks: Chung-
Lu{\textquoteright}s model and the configuration model. We also develop combinatorial
formulations and approximation algorithms for quarantining, vaccina-
tion and sensor placement, as aids to decision-making.
},
	author = {Eubank,S. and Kumar,V. S.A and Marathe,M. V and Srinivasan, Aravind and Wang,N.}
}
@article {13714,
	title = {A study of translation edit rate with targeted human annotation},
	journal = {Proceedings of Association for Machine Translation in the Americas},
	year = {2006},
	month = {2006///},
	pages = {223 - 231},
	abstract = {We examine a new, intuitive measurefor evaluating machine-translation output
that avoids the knowledge intensiveness
of more meaning-based approaches, and
the labor-intensiveness of human judg-
ments. Translation Edit Rate (TER) mea-
sures the amount of editing that a hu-
man would have to perform to change
a system output so it exactly matches a
reference translation. We show that the
single-reference variant of TER correlates
as well with human judgments of MT
quality as the four-reference variant of
BLEU. We also define a human-targeted
TER (or HTER) and show that it yields
higher correlations with human judgments
than BLEU{\textemdash}even when BLEU is given
human-targeted references. Our results in-
dicate that HTER correlates with human
judgments better than HMETEOR and
that the four-reference variants of TER
and HTER correlate with human judg-
ments as well as{\textemdash}or better than{\textemdash}a sec-
ond human judgment does.
},
	author = {Snover,M. and Dorr, Bonnie J and Schwartz,R. and Micciulla,L. and Makhoul,J.}
}
@conference {15489,
	title = {Studying the Characteristics of a "Good" GUI Test Suite},
	booktitle = {Software Reliability Engineering, 2006. ISSRE {\textquoteright}06. 17th International Symposium on},
	year = {2006},
	month = {2006/11//},
	pages = {159 - 168},
	abstract = {The widespread deployment of graphical-user interfaces (GUIs) has increased the overall complexity of testing. A GUI test designer needs to perform the daunting task of adequately testing the GUI, which typically has very large input interaction spaces, while considering tradeoffs between GUI test suite characteristics such as the number of test cases (each modeled as a sequence of events), their lengths, and the event composition of each test case. There are no published empirical studies on GUI testing that a GUI test designer may reference to make decisions about these characteristics. Consequently, in practice, very few GUI testers know how to design their test suites. This paper takes the first step towards assisting in GUI test design by presenting an empirical study that evaluates the effect of these characteristics on testing cost and fault detection effectiveness. The results show that two factors significantly effect the fault-detection effectiveness of a test suite: (1) the diversity of states in which an event executes and (2) the event coverage of the suite. Test designers need to improve the diversity of states in which each event executes by developing a large number of short test cases to detect the majority of "shallow" faults, which are artifacts of modern GUI design. Additional resources should be used to develop a small number of long test cases to detect a small number of "deep" faults},
	keywords = {Fault detection, Fault diagnosis, graphical user interface testing, Graphical user interfaces, program debugging, program testing},
	doi = {10.1109/ISSRE.2006.45},
	author = {Xie,Qing and Memon, Atif M.}
}
@inbook {12630,
	title = {Subjects Allied to Gait},
	booktitle = {Human Identification Based on GaitHuman Identification Based on Gait},
	year = {2006},
	month = {2006///},
	pages = {5 - 15},
	abstract = {There is considerable support for the notion that each person{\textquoteright}s gait is unique. As we shall see, it has been observed in literature that people can be recognized by the way they walk. The same notion has been observed in medicine and biomechanics, though not in the context of biometrics but more as an assertion of individuality. Perhaps driven by these notions, though without reference to them, there has been work in psychology on the human ability to recognize each other by using gait. Those suffering myopia often state that they can use gait as a way of recognizing people. There is other evidence too, which suggests that each person{\textquoteright}s gait is unique. People have also studied walking from medical and biomechanical perspectives, and this gives insight into how its properties can change which is of general interest in any biometrie deployment. We shall start with literature, with definitions of meaning.},
	author = {Nixon, M.S. and Tan, T. and Chellapa, Rama}
}
@article {13866,
	title = {Summarization-Inspired Temporal-Relation Extraction: Tense-Pair Templates and Treebank-3 Analysis},
	year = {2006},
	month = {2006/12//},
	institution = {Department of Computer Science, University of Maryland, College Park},
	abstract = {This document describes the information used for summarization-inspired temporal-relation extraction [Dorr and Gaasterland, 2007]. We present a set of tense/aspect extraction templates that are applied to a Penn Treebank-style analysis of the input sentence. We also present an analysis of tense-pair combinations for different temporal connectives based on a corpus analysis of complex tense structures in Treebank-3. Finally, we include analysis charts and temporal relation tables for all combinations of intervals/points for each legal BTS combinations.},
	keywords = {*COMPUTATIONAL LINGUISTICS, CYBERNETICS, linguistics, operations research, TEMPORALRELATION EXTRACTION, TENSE-PAIR COMBINATIONS, TEXT PROCESSING},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA460392},
	author = {Dorr, Bonnie J and Gaasterland,Terry}
}
@conference {15352,
	title = {On Synchronization of Weighted Essentially Non-Oscillatory Methods},
	booktitle = {36th AIAA Fluid Dynamics Conference and Exhibit},
	year = {2006},
	month = {2006///},
	address = {San Francisco, CA},
	abstract = {Weighted essentially non-oscillatory (WENO) methods have been developed to simul-taneously provide robust shock-capturing in compressible fluid flow and avoid excessive
damping of fine-scale flow features such as turbulence. Under certain conditions in com-
pressible turbulence, however, numerical dissipation remains unacceptably high even after
optimization of the linear component that dominates in smooth regions. We demonstrate
that a significant nonlinear source of dissipation error is due to a WENO implementa-
tion defect that we call the {\textquotedblleft}synchronization deficiency,{\textquotedblright} and we develop and evaluate a
preliminary technique to mitigate its effects. Direct numerical simulations (DNS) include
one-dimensional test cases and three-dimensional compressible isotropic turbulence. Al-
though we find the current formulation of our mitigation technique to be quite successful
for the one-dimensional problems, its efficacy is more modest in the turbulence simulations,
and its cost-to-benefit ratio is uncomfortably high. We believe, however, that with further
work it will be possible to alleviate these drawbacks.
},
	author = {Taylor,E. M and Martin, M.P}
}
@article {15031,
	title = {Synthetic-perturbation techniques for screening shared memory programs},
	journal = {Software: Practice and Experience},
	volume = {24},
	year = {2006},
	month = {2006/10/30/},
	pages = {679 - 701},
	abstract = {The synthetic-perturbation screening (SPS) methodology is based on an empirical approach; SPS introduces artificial perturbations into the MIMD program and captures the effects of such perturbations by using the modern branch of statistics called design of experiments. SPS can provide the basis of a powerful tool for screening MIMD programs for performance bottlenecks. This technique is portable across machines and architectures, and scales extremely well on massively parallel processors. The purpose of this paper is to explain the general approach and to extend it to address specific features that are the main source of poor performance on the shared memory programming model. These include performance degradation due to load imbalance and insufficient parallelism, and overhead introduced by synchronizations and by accessing shared data structures. We illustrate the practicality of SPS by demonstrating its use on two very different case studies: a large image understanding benchmark and a parallel quicksort.},
	keywords = {Design of experiments, parallel programs, performance, Shared memory programming model, Synthetic perturbation},
	isbn = {1097-024X},
	doi = {10.1002/spe.4380240802},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.4380240802/abstract},
	author = {Snelick,Robert and JaJa, Joseph F. and Kacker,Raghu and Lyon,Gordon}
}
@article {13164,
	title = {SYSTEM AND METHOD FOR FAST ILLUMINATION-INVARIANT BACKGROUND SUBTRACTION USING TWO VIEWS},
	volume = {PCT/EP2005/056207},
	year = {2006},
	month = {2006/06//},
	abstract = {A method for eliminating errors in foreground object detection in digitized images comprises providing (1101) a reference camera and a secondary camera, vertically aligning each said camera with a baseline that is approximately perpendicular to a ground plane, wherein said reference camera is placed lower than said secondary camera, selecting (1104) a foreground pixel in a reference view of a first point in a foreground object, finding (1105) a conjugate pixel of the foreground pixel in a secondary view, using (1106) the foreground and conjugate pixels to determine an image base pixel of a base point in the reference view, wherein said base point is a point on the ground plane below the first point, and using (1107) the foreground and image base pixels to find a location where the ground plane is first visible.},
	author = {Davis, Larry S. and Lim,S.N. and Mittal,A.}
}
@article {17663,
	title = {System and method for locating a closest server in response to a client ...},
	volume = {09/726,192},
	year = {2006},
	month = {2006/03/28/},
	abstract = {A scalable system and method for locating a closest server in response to a client request via an interactive distribution network, such as the Internet, are provided. A closest content server is defined as having the least round trip time for responding to a client request. The system including a plurality of content servers; and a local server in communication with a plurality of clients, the local server acting as a proxy for communicating client requests from clients to a redirection server. Client network distance and load information is periodically collected at each content server in the network from clients communicating with each of the respective content servers. The redirection server periodically aggregates the network distance and load information from each content server to create client clusters from both current and previously aggregated network distance and load information. Each client cluster represents a division or partition of the total IP address space. Each...},
	url = {http://www.google.com/patents?id=cE54AAAAEBAJ},
	author = {Andrews,Matthew and Hofmann,Markus and Shepherd,Bruce and Srinivasan, Aravind and Winkler,Peter and Zane,Francis},
	editor = {Lucent Technologies Inc.}
}
@book {12328,
	title = {System synthesis for optically-connected, multiprocessors on-chip},
	year = {2006},
	month = {2006///},
	publisher = {Citeseer},
	organization = {Citeseer},
	author = {Bambha,N. K and Bhattacharyya, Shuvra S. and STUDIES,MARYLAND UNIV COLLEGE PARK INST FOR ADVANCED COMPUTER}
}
@conference {16880,
	title = {Scalable data collection infrastructure for digital government applications},
	booktitle = {Proceedings of the 2005 national conference on Digital government research},
	series = {dg.o {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {305 - 306},
	publisher = {Digital Government Society of North America},
	organization = {Digital Government Society of North America},
	abstract = {Highlights are presented of a project on the development of a scalable data collection infrastructure of digital government applications. The approach takes advantage of both the distributed nature of the data and the distributed ways of interacting with it. The approach is three-parted having theoretical, systems, and application components. On the theoretical and systems levels, work has continued on the development of the BISTRO system. On the applications level, work has continued on the investigation of the use of peer-to-peer networks in a number of domains in which the proper handling of spatial data is important.},
	url = {http://dl.acm.org/citation.cfm?id=1065226.1065333},
	author = {Samet, Hanan and Tanin,Egemen and Golubchik,Leana}
}
@inbook {17656,
	title = {Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints},
	booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques},
	series = {Lecture Notes in Computer Science},
	volume = {3624},
	year = {2005},
	month = {2005///},
	pages = {609 - 609},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We present polylogarithmic approximations for the R | prec | C max and R | prec |∑ j w j C j problems, when the precedence constraints are {\textquotedblleft}treelike{\textquotedblright} {\textendash} i.e., when the undirected graph underlying the precedences is a forest. We also obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment {\textendash} this generalizes the job shop problem to these objective functions. We use the same lower bound of {\textquotedblleft}congestion+dilation{\textquotedblright}, as in other job shop scheduling approaches. The first step in our algorithm for the R | prec | C max problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random delays technique of Leighton, Maggs and Rao to the case of trees. For the weighted completion time, we show a certain type of reduction to the makespan problem, which dovetails well with the lower bound we employ for the makespan problem. For the special case of chains, we show a dependent rounding technique which leads to improved bounds on the weighted completion time and new bicriteria bounds for the flow time.},
	isbn = {978-3-540-28239-6},
	url = {http://dx.doi.org/10.1007/11538462_13},
	author = {Kumar, V. and Marathe,Madhav and Parthasarathy,Srinivasan and Srinivasan, Aravind},
	editor = {Chekuri,Chandra and Jansen,Klaus and Rolim,Jos{\'e} and Trevisan,Luca}
}
@conference {13036,
	title = {Search-based structured prediction as classification},
	booktitle = {NIPS Workshop on Advances in Structured Learning for Text and Speech Processing, Whistler, Canada},
	year = {2005},
	month = {2005///},
	author = {Daum{\'e}, Hal and Langford,J. and Marcu,D.}
}
@article {15088,
	title = {Secure remote authentication using biometric data},
	journal = {Advances in Cryptology{\textendash}EUROCRYPT 2005},
	year = {2005},
	month = {2005///},
	pages = {147 - 163},
	abstract = {Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly distributed; and (2) they are not exactly reproducible. Recent work, most notably that of Dodis, Reyzin, and Smith, has shown how these obstacles may be overcome by allowing some auxiliary public information to be reliably sent from a server to the human user. Subsequent work of Boyen has shown how to extend these techniques, in the random oracle model, to enable unidirectional authentication from the user to the server without the assumption of a reliable communication channel.We show two efficient techniques enabling the use of biometric data to achieve mutual authentication or authenticated key exchange over a completely insecure (i.e., adversarially controlled) channel. In addition to achieving stronger security guarantees than the work of Boyen, we improve upon his solution in a number of other respects: we tolerate a broader class of errors and, in one case, improve upon the parameters of his solution and give a proof of security in the standard model.
},
	doi = {10.1007/11426639_9},
	author = {Boyen,X. and Dodis,Y. and Katz, Jonathan and Ostrovsky,R. and Smith,A.}
}
@article {12775,
	title = {Secure requirements elicitation through triggered message sequence charts},
	journal = {Distributed Computing and Internet Technology},
	year = {2005},
	month = {2005///},
	pages = {273 - 282},
	author = {Ray,A. and Sengupta,B. and Cleaveland, Rance}
}
@conference {18280,
	title = {Security of feature extraction in image hashing},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/1041 - ii/1044 Vol. 2 - ii/1041 - ii/1044 Vol. 2},
	abstract = {Security and robustness are two important requirements for image hash functions. We introduce "differential entropy" as a metric to quantify the amount of randomness in image hash functions and to study their security. We present a mathematical framework and derive expressions for the proposed security metric for various common image hashing schemes. Using the proposed security metric, we discuss the trade-offs between security and robustness in image hashing.},
	keywords = {cryptography;, differential, digital, entropy;, extraction;, feature, functions;, hash, hashing;, image, metric;, processing;, randomness;, robustness;, Security, signature;, signatures;},
	doi = {10.1109/ICASSP.2005.1415586},
	author = {Swaminathan,A. and Mao,Yinian and M. Wu}
}
@conference {14341,
	title = {Seeking the source: software source code as a social and technical artifact},
	booktitle = {Proceedings of the 2005 international ACM SIGGROUP conference on Supporting group work},
	series = {GROUP {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {197 - 206},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {data mining, social networks, socio-technical systems, software repositories},
	isbn = {1-59593-223-2},
	doi = {10.1145/1099203.1099239},
	url = {http://doi.acm.org/10.1145/1099203.1099239},
	author = {de Souza,Cleidson and Jon Froehlich and Dourish,Paul}
}
@conference {13190,
	title = {Segmentation and appearance model building from an image sequence},
	booktitle = {Image Processing, 2005. ICIP 2005. IEEE International Conference on},
	volume = {1},
	year = {2005},
	month = {2005/09//},
	pages = {I - 321-4 - I - 321-4},
	abstract = {In this paper we explore the problem of accurately segmenting a person from a video given only approximate location of that person. Unlike previous work which assumes that the appearance model is known in advance, we developed an iterative expectation-sampling (ES) algorithm for solving segmentation and appearance modeling simultaneously The appearance model is encoded with a kernel-based PDF defined in a joint color/path-length space. This appearance model remains unchanged during a short time period, although the object can articulate. Thus, we can perform the ES iteration not only for a single frame but also for an image sequence. The algorithm is iterative, but simple, efficient and gives visually good results.},
	keywords = {algorithm;, color-path-length, expectation-sampling, image, iterative, joint, kernel-based, methods;, PDF;, person, segmentation;, sequence;, sequences;, space;},
	doi = {10.1109/ICIP.2005.1529752},
	author = {Liang Zhao and Davis, Larry S.}
}
@article {13713,
	title = {A sentence-trimming approach to multi-document summarization},
	journal = {Proceedings of DUC2005},
	year = {2005},
	month = {2005///},
	abstract = {We implemented an initial applicationof a sentence-trimming approach (Trim-
mer) to the problem of multi-document
summarization in the MSE2005 and
DUC2005 tasks. Sentence trimming
was incorporated into a feature-based
summarization system, called Multi-
Document Trimmer (MDT), by us-
ing sentence trimming as both a pre-
processing stage and a feature for sen-
tence ranking. We demonstrate that we
were able to port Trimmer easily to this
new problem. Although the direct im-
pact of sentence trimming was minimal
compared to other features used in the
system, the interaction of the other fea-
tures resulted in trimmed sentences ac-
counting for nearly half of the selected
summary sentences.
},
	author = {Zajic, David and Dorr, Bonnie J and Jimmy Lin and Monz,C. and Schwartz,R.}
}
@article {16285,
	title = {Serendipitous discovery of Wolbachia genomes in multiple Drosophila species},
	journal = {Genome Biology},
	volume = {6},
	year = {2005},
	month = {2005/02/22/},
	pages = {R23 - R23},
	abstract = {The Trace Archive is a repository for the raw, unanalyzed data generated by large-scale genome sequencing projects. The existence of this data offers scientists the possibility of discovering additional genomic sequences beyond those originally sequenced. In particular, if the source DNA for a sequencing project came from a species that was colonized by another organism, then the project may yield substantial amounts of genomic DNA, including near-complete genomes, from the symbiotic or parasitic organism.},
	isbn = {1465-6906},
	doi = {10.1186/gb-2005-6-3-r23},
	url = {http://genomebiology.com/2005/6/3/R23},
	author = {Salzberg,Steven L. and Hotopp,Julie CD and Delcher,Arthur L. and Pop, Mihai and Smith,Douglas R. and Eisen,Michael B. and Nelson,William C.}
}
@article {17357,
	title = {Severity and Impact of Computer User Frustration: A Comparison of Student and Workplace Users (2002)},
	year = {2005},
	month = {2005///},
	abstract = {User frustration with information and computing technology is a pervasive and persistent problem. When computers crash, network congestion causes delays, and poor user interfaces trigger confusion there are dramatic consequences for individuals, organizations, and society. These frustrations not only cause personal dissatisfaction and loss of self-efficacy, but may disrupt workplaces, slow learning, and reduce participation in local and national communities. Our study of 107 student computer users and 50 workplace computer users shows high levels of frustration and loss of 1/3 to 1/2 of time spent. This paper reports on the incident-specific and user-specific causes of frustration, and they raise frustration severity. It examines the frustration impacts on the daily interactions of the users. The time lost and time to fix problem, and importance of task, strongly correlate with frustration levels for both student and workplace users. Differences between students and workplace users are discussed in the paper.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6496},
	author = {Lazar,Jonathan and Jones,Adam and Hackley,Mary and Shneiderman, Ben}
}
@article {16387,
	title = {Shaky ladders, hyperplane-defined functions and genetic algorithms: Systematic controlled observation in dynamic environments},
	journal = {Applications of Evolutionary Computing},
	year = {2005},
	month = {2005///},
	pages = {600 - 609},
	abstract = {Though recently there has been interest in examining genetic algorithms (GAs) in dynamic environments, work still needs to be done in investigating the fundamental behavior of these algorithms in changing environments. When researching the GA in static environments, it has been useful to use test suites of functions that are designed for the GA so that the performance can be observed under systematic controlled conditions. One example of these suites is the hyperplane-defined functions (hdfs) designed by Holland [1]. We have created an extension of these functions, specifically designed for dynamic environments, which we call the shaky ladder functions. In this paper, we examine the qualities of this suite that facilitate its use in examining the GA in dynamic environments, describe the construction of these functions and present some preliminary results of a GA operating on these functions.},
	doi = {10.1007/978-3-540-32003-6_63},
	author = {Rand, William and Riolo,R}
}
@article {12647,
	title = {"Shape Activity": a continuous-state HMM for moving/deforming shapes with application to abnormal activity detection},
	journal = {Image Processing, IEEE Transactions on},
	volume = {14},
	year = {2005},
	month = {2005/10//},
	pages = {1603 - 1616},
	abstract = {The aim is to model "activity" performed by a group of moving and interacting objects (which can be people, cars, or different rigid components of the human body) and use the models for abnormal activity detection. Previous approaches to modeling group activity include co-occurrence statistics (individual and joint histograms) and dynamic Bayesian networks, neither of which is applicable when the number of interacting objects is large. We treat the objects as point objects (referred to as "landmarks") and propose to model their changing configuration as a moving and deforming "shape" (using Kendall{\textquoteright}s shape theory for discrete landmarks). A continuous-state hidden Markov model is defined for landmark shape dynamics in an activity. The configuration of landmarks at a given time forms the observation vector, and the corresponding shape and the scaled Euclidean motion parameters form the hidden-state vector. An abnormal activity is then defined as a change in the shape activity model, which could be slow or drastic and whose parameters are unknown. Results are shown on a real abnormal activity-detection problem involving multiple moving objects.},
	keywords = {abnormal activity detection;activity recognition;co-occurrence statistics;continuous-state hidden Markov model;dynamic Bayesian networks;hidden-state vector;particle filtering;scaled Euclidean motion parameter;shape deforming;belief networks;filtering the, Automated;Subtraction Technique;Video Recording;, Biological;Models, Computer-Assisted;Information Storage and Retrieval;Markov Chains;Models, Statistical;Movement;Pattern Recognition},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2005.852197},
	author = {Vaswani, N. and Roy-Chowdhury, A.K. and Chellapa, Rama}
}
@article {12057,
	title = {Shape and the stereo correspondence problem},
	journal = {International Journal of Computer Vision},
	volume = {65},
	year = {2005},
	month = {2005///},
	pages = {147 - 162},
	author = {Ogale, A. S and Aloimonos, J.}
}
@conference {17359,
	title = {Show Me! Guidelines for producing recorded demonstrations},
	booktitle = {2005 IEEE Symposium on Visual Languages and Human-Centric Computing},
	year = {2005},
	month = {2005/09/20/24},
	pages = {171 - 178},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Although recorded demonstrations (screen capture animations with narration) have become a popular form of instruction for user interfaces, little work has been done to describe guidelines for their design. Based on our experience in several projects, we offer a starting set of guidelines for the design of visually appealing and cognitively effective recorded demonstrations. Technical guidelines encourage users to keep file sizes small, strive for universal usability, and ensure user control etc. and provide tips to achieve those goals. Content guidelines include: create short demonstrations that focus on tasks, highlight each step with auditory and visual cues, synchronize narration and animation carefully, and create demonstrations with a clear beginning, middle, and end.},
	keywords = {animation, auditory cues, Computer aided instruction, Computer animation, Computer Graphics, Computer interfaces, computer literacy, content guidelines, documentation, Government, Graphical user interfaces, Guidelines, Laboratories, narration, recorded demonstrations, screen capture animation, technical guidelines, usability, User interfaces, visual appeal, visual cues},
	isbn = {0-7695-2443-5},
	doi = {10.1109/VLHCC.2005.57},
	author = {Plaisant, Catherine and Shneiderman, Ben}
}
@article {16102,
	title = {Show Me! Guidelines for Producing Recorded Demonstrations (2005)},
	year = {2005},
	month = {2005///},
	abstract = {Although recorded demonstrations (screen capture animations with narration) have become a popular form of instruction for user interfaces, little work has been done to describe guidelines for their design. Based on our experience in several projects, we offer a starting set of guidelines for the design of recorded demonstrations. Technical guidelines encourage users to keep file sizes small, strive for universal usability, and ensure user control etc. and provide tips to achieve those goals. Content guidelines include: create short demonstrations that focus on tasks, highlight each step with auditory and visual cues, synchronize narration and animation carefully, and create demonstrations with a clear beginning, middle, and end.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6533},
	author = {Plaisant, Catherine and Shneiderman, Ben}
}
@article {17841,
	title = {A simulation and data analysis system for large-scale, data-driven oil reservoir simulation studies},
	journal = {Concurrency and Computation: Practice and Experience},
	volume = {17},
	year = {2005},
	month = {2005///},
	pages = {1441 - 1467},
	author = {Kurc, T. and Catalyurek,U. and Zhang,X. and Saltz, J. and Martino,R. and Wheeler,M. and Peszy{\'n}ska,M. and Sussman, Alan and Hansen,C. and Sen,M. and others}
}
@article {15128,
	title = {Simulation and Secure Computation-Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs},
	journal = {Lecture Notes in Computer Science},
	volume = {3378},
	year = {2005},
	month = {2005///},
	pages = {128 - 149},
	author = {Katz, Jonathan and Lindell,Y.}
}
@article {17362,
	title = {Snap-Together Visualization: A User Interface for Coordinating Visualizations via Relational Schemata (2000)},
	year = {2005},
	month = {2005///},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6470},
	author = {North,Chris and Shneiderman, Ben}
}
@article {17368,
	title = {Social and Psychological Influences on Computer User Frustration (Newhagen book chapter, 2002)},
	journal = {Institute for Systems Research Technical Reports},
	year = {2005},
	month = {2005///},
	abstract = {As computer usage has proliferated, so has user frustration. Even devoted and knowledgeable users encounter annoying delays, incomprehensible messages, incompatible files, and indecipherable menus. The frustration generated by these problems can be personally disturbing and socially disruptive. Psychological and social perspectives on frustration may clarify the relationships among variables such as personality types, cultural factors, goal attainment, workplace anger, and computer anxiety. These perspectives may also help designers, managers, and users understand the range of responses to frustration, which could lead to effective interventions such as redesign of software, improved training, better online help, user discipline, and even resetting of national research priorities.},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/6497},
	author = {Bessiere,Katie and Ceaparu,Irina and Lazar,Jonathan and Robinson,John and Shneiderman, Ben}
}
@inbook {12155,
	title = {Software defect reduction top 10 list},
	booktitle = {Foundations of empirical software engineering: the legacy of Victor R. Basili},
	year = {2005},
	month = {2005///},
	pages = {426 - 426},
	isbn = {9783540245476},
	author = {Boehm,B. and Basili, Victor R.}
}
@article {18431,
	title = {Software process improvement in small organizations: a case study},
	journal = {Software, IEEE},
	volume = {22},
	year = {2005},
	month = {2005/12//nov},
	pages = {68 - 75},
	abstract = {The Capability Maturity Model for software has become a major force in software development process improvement. We looked at the role of process improvement in the context of a small organization. Although the Capability Maturity Model integration is replacing the CMM, we focused on the older CMM. We had to look at more than which CMM key process areas apply to small businesses. Our overall goal was to institute good software development practices, we used the language of the CMM to gain the management{\textquoteright}s cooperation. Applying these practices is essential to managing growth, yet undertaking this effort without prior experience could impede a small company{\textquoteright}s innovative nature. This case study{\textquoteright}s purpose was to investigate the success factors of a software process improvement effort for a small software development organization.},
	keywords = {area;, aspects;, capability, CMM, development, improvement;, key, management;, Maturity, model;, organisational, organization;, process, small, software},
	isbn = {0740-7459},
	doi = {10.1109/MS.2005.162},
	author = {Dangle,K.C. and Larsen,P. and Shaw,M. and Zelkowitz, Marvin V}
}
@article {16357,
	title = {Software repository mining with Marmoset: an automated programming project snapshot and testing system},
	journal = {ACM SIGSOFT Software Engineering Notes},
	volume = {30},
	year = {2005},
	month = {2005///},
	pages = {1 - 5},
	author = {Spacco,J. and Strecker,J. and Hovemeyer,D. and Pugh, William}
}
@conference {12375,
	title = {Software synthesis from the dataflow interchange format},
	booktitle = {Proceedings of the 2005 workshop on Software and compilers for embedded systems},
	year = {2005},
	month = {2005///},
	pages = {37 - 49},
	author = {Hsu,C. J and Ko,M. Y and Bhattacharyya, Shuvra S.}
}
@article {15026,
	title = {Space-efficient and fast algorithms for multidimensional dominance reporting and counting},
	journal = {Algorithms and Computation},
	year = {2005},
	month = {2005///},
	pages = {1755 - 1756},
	abstract = {We present linear-space sub-logarithmic algorithms for handling the 3-dimensional dominance reporting and the 2-dimensional dominance counting problems. Under the RAM model as described in [M. L. Fredman and D. E. Willard. ldquoSurpassing the information theoretic bound with fusion treesrdquo, Journal of Computer and System Sciences, 47:424{\textendash}436, 1993], our algorithms achieve O(log n/loglog n+f) query time for the 3-dimensional dominance reporting problem, where f is the output size, and O(log n/loglog n) query time for the 2-dimensional dominance counting problem. We extend these results to any constant dimension d ge 3, achieving O(n(log n/loglog n)d {\textendash} 3) space and O((log n/loglog n)d {\textendash} 2+ f) query time for the reporting case and O(n(log n/loglog n)d {\textendash} 2) space and O((log n/loglog n)d {\textendash} 1) query time for the counting case.},
	doi = {10.1007/978-3-540-30551-4_49},
	author = {JaJa, Joseph F. and Mortensen,C. and Shi,Q.}
}
@conference {15638,
	title = {Space-time tradeoffs for approximate spherical range counting},
	booktitle = {Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms},
	series = {SODA {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {535 - 544},
	publisher = {Society for Industrial and Applied Mathematics},
	organization = {Society for Industrial and Applied Mathematics},
	address = {Philadelphia, PA, USA},
	abstract = {We present space-time tradeoffs for approximate spherical range counting queries. Given a set S of n data points in Rd along with a positive approximation factor ε, the goal is to preprocess the points so that, given any Euclidean ball B, we can return the number of points of any subset of S that contains all the points within a (1 - ε)-factor contraction of B, but contains no points that lie outside a (1 + ε)-factor expansion of B.In many applications of range searching it is desirable to offer a tradeoff between space and query time. We present here the first such tradeoffs for approximate range counting queries. Given 0 < ε <= 1/2 and a parameter γ, where 2 <= γ <= 1/ε, we show how to construct a data structure of space O(nγd log (1/ε)) that allows us to answer ε-approximate spherical range counting queries in time O(log(nγ) + 1/(εγd-1). The data structure can be built in time O(nγd log (n/ε)) log (1/ε)). Here n, ε, and γ are asymptotic quantities, and the dimension d is assumed to be a fixed constant.At one extreme (low space), this yields a data structure of space O(n log (1/e)) that can answer approximate range queries in time O(logn + 1/(ed-1) which, up to a factor of O(n log (1/e) in space, matches the best known result for approximate spherical range counting queries. At the other extreme (high space), it yields a data structure of space O((n/ed) log(1/ε)) that can answer queries in time O(logn + 1/ε). This is the fastest known query time for this problem.We also show how to adapt these data structures to the problem of computing an ε-approximation to the kth nearest neighbor, where k is any integer from 1 to n given at query time. The space bounds are identical to the range searching results, and the query time is larger only by a factor of O(1/(εγ)).Our approach is broadly based on methods developed for approximate Voronoi diagrams (AVDs), but it involves a number of significant extensions from the context of nearest neighbor searching to range searching. These include generalizing AVD node-separation properties from leaves to internal nodes of the tree and constructing efficient generator sets through a radial decomposition of space. We have also developed new arguments to analyze the time and space requirements in this more general setting.},
	isbn = {0-89871-585-7},
	url = {http://dl.acm.org/citation.cfm?id=1070432.1070505},
	author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave}
}
@conference {17888,
	title = {Spatial indexing of distributed multidimensional datasets},
	booktitle = {IEEE International Symposium on Cluster Computing and the Grid, 2005. CCGrid 2005},
	volume = {2},
	year = {2005},
	month = {2005/05/09/12},
	pages = {743- 750 Vol. 2 - 743- 750 Vol. 2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {While declustering methods for distributed multidimensional indexing of large datasets have been researched widely in the past, replication techniques for multidimensional indexes have not been investigated deeply. In general, a centralized index server may become the performance bottleneck in a wide area network rather than the data servers, since the index is likely to be accessed more often than any of the datasets in the servers. In this paper, we present two different multidimensional indexing algorithms for a distributed environment - a centralized global index and a two-level hierarchical index. Our experimental results show that the centralized scheme does not scale well for either insertion or searching the index. In order to improve the scalability of the index server, we have employed a replication protocol for both the centralized and two-level index schemes that allows some inconsistency between replicas without affecting correctness. Our experiments show that the two-level hierarchical index scheme shows better scalability for both building and searching the index than the non-replicated centralized index, but replication can make the centralized index faster than the two-level hierarchical index for searching in some cases.},
	keywords = {centralized global index algorithm, centralized index server, Computer science, database indexing, distributed databases, distributed multidimensional dataset, Educational institutions, File servers, Indexing, Large-scale systems, Multidimensional systems, Network servers, replication protocol, replication techniques, scalability, Sensor systems, spatial data structures, spatial indexing, two-level hierarchical index algorithm, wide area networks},
	isbn = {0-7803-9074-1},
	doi = {10.1109/CCGRID.2005.1558637},
	author = {Nam,B. and Sussman, Alan}
}
@article {16403,
	title = {Spatial process and data models: Toward integration of agent-based models and GIS},
	journal = {Journal of Geographical Systems},
	volume = {7},
	year = {2005},
	month = {2005///},
	pages = {25 - 47},
	abstract = {The use of object-orientation for both spatial data and spatial process models facilitates their integration, which can allow exploration and explanation of spatial-temporal phenomena. In order to better understand how tight coupling might proceed and to evaluate the possible functional and efficiency gains from such a tight coupling, we identify four key relationships affecting how geographic data (fields and objects) and agent-based process models can interact: identity, causal, temporal and topological. We discuss approaches to implementing tight integration, focusing on a middleware approach that links existing GIS and ABM development platforms, and illustrate the need and approaches with example agent-based models.},
	doi = {10.1007/s10109-005-0148-5},
	author = {Brown,D.G. and Riolo,R and Robinson,D.T. and North,M. and Rand, William}
}
@article {14023,
	title = {Speaker Localization Using Excitation Source Information in Speech},
	journal = {Speech and Audio Processing, IEEE Transactions on},
	volume = {13},
	year = {2005},
	month = {2005/09//},
	pages = {751 - 761},
	abstract = {This paper presents the results of simulation and real room studies for localization of a moving speaker using information about the excitation source of speech production. The first step in localization is the estimation of time-delay from speech collected by a pair of microphones. Methods for time-delay estimation generally use spectral features that correspond mostly to the shape of vocal tract during speech production. Spectral features are affected by degradations due to noise and reverberation. This paper proposes a method for localizing a speaker using features that arise from the excitation source during speech production. Experiments were conducted by simulating different noise and reverberation conditions to compare the performance of the time-delay estimation and source localization using the proposed method with the results obtained using the spectrum-based generalized cross correlation (GCC) methods. The results show that the proposed method shows lower number of discrepancies in the estimated time-delays. The bias, variance and the root mean square error (RMSE) of the proposed method is consistently equal or less than the GCC methods. The location of a moving speaker estimated using the time-delays obtained by the proposed method are closer to the actual values, than those obtained by the GCC method.},
	keywords = {correlation, correlation;, cross, Delay, error, error;, estimation;, excitation, generalized, information;, localization;, mean, methods;, processing;, production;, root, source, speaker, speech, square, TIME},
	isbn = {1063-6676},
	doi = {10.1109/TSA.2005.851907},
	author = {Raykar,V.C. and Yegnanarayana,B. and Prasanna,S. R.M and Duraiswami, Ramani}
}
@article {18600,
	title = {Stable Policy Routing with Provider Independence},
	volume = {MIT-CSAIL-TR-2005-009},
	year = {2005},
	month = {2005/02/08/},
	institution = {Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory},
	abstract = {Thousands of competing autonomous systems (ASes) mustcooperate with each other to provide global Internet connectivity.These ASes encode various economic, business,and performance decisions in their routing policies. The currentinterdomain routing system enables ASes to express policyusing rankings that determine how each router in an ASorders the different routes to a destination, and filters thatdetermine which routes are hidden from each neighboringAS. Since the Internet is composed of many independent,competing networks, the interdomain routing system shouldallow providers to set their rankings independently, and tohave no constraints on allowed filters. This paper studiesrouting protocol stability under these constraints. We firstdemonstrate that certain rankings that are commonly usedin practice may not ensure routing stability. We then provethat, with ranking independence and unrestricted filtering,guaranteeing that the routing system will converge to a stablepath assignment essentially requires ASes to rank routesbased on AS-path lengths. Finally, we discuss the implicationsof these results for the future of interdomain routing.},
	url = {http://dspace.mit.edu/handle/1721.1/30522},
	author = {Feamster, Nick and Johari,Ramesh and Balakrishnan,Hari}
}
@article {12654,
	title = {Statistical bias in 3-D reconstruction from a monocular video},
	journal = {Image Processing, IEEE Transactions on},
	volume = {14},
	year = {2005},
	month = {2005/08//},
	pages = {1057 - 1062},
	abstract = {The present state-of-the-art in computing the error statistics in three-dimensional (3-D) reconstruction from video concentrates on estimating the error covariance. A different source of error which has not received much attention is the fact that the reconstruction estimates are often significantly statistically biased. In this paper, we derive a precise expression for the bias in the depth estimate, based on the continuous (differentiable) version of structure from motion (SfM). Many SfM algorithms, or certain portions of them, can be posed in a linear least-squares (LS) framework Ax=b. Examples include initialization procedures for bundle adjustment or algorithms that alternately estimate depth and camera motion. It is a well-known fact that the LS estimate is biased if the system matrix A is noisy. In SfM, the matrix A contains point correspondences, which are always difficult to obtain precisely; thus, it is expected that the structure and motion estimates in such a formulation of the problem would be biased. Existing results on the minimum achievable variance of the SfM estimator are extended by deriving a generalized Cramer-Rao lower bound. A detailed analysis of the effect of various camera motion parameters on the bias is presented. We conclude by presenting the effect of bias compensation on reconstructing 3-D face models from rendered images.},
	keywords = {3D face models, 3D video reconstruction, algorithms, artifacts, Artificial intelligence, Automated;Signal Processing, bias compensation, bundle adjustment, camera motion estimation, Computer simulation, Computer-Assisted;Imaging, Computer-Assisted;Subtraction Technique;Video Recording;, depth estimate, error covariance estimation, error statistics, generalized Cramer-Rao lower bound, Image Enhancement, Image Interpretation, Image reconstruction, initialization procedures, least squares approximations, linear least-squares framework, monocular video, motion compensation, Motion estimation, statistical bias, Statistical;Pattern Recognition, structure from motion algorithms, Three-Dimensional;Information Storage and Retrieval;Models, video signal processing},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2005.849775},
	author = {Roy-Chowdhury, A.K. and Chellapa, Rama}
}
@article {17902,
	title = {Statistical geometry representation for efficient transmission and rendering},
	journal = {ACM Transactions on Graphics},
	volume = {24},
	year = {2005},
	month = {2005/04//},
	pages = {348 - 373},
	abstract = {Traditional geometry representations have focused on representing the details of the geometry in a deterministic fashion. In this article we propose a statistical representation of the geometry that leverages local coherence for very large datasets. We show how the statistical analysis of a densely sampled point model can be used to improve the geometry bandwidth bottleneck, both on the system bus and over the network as well as for randomized rendering, without sacrificing visual realism. Our statistical representation is built using a clustering-based hierarchical principal component analysis (PCA) of the point geometry. It gives us a hierarchical partitioning of the geometry into compact local nodes representing attributes such as spatial coordinates, normal, and color. We pack this information into a few bytes using classification and quantization. This allows our representation to directly render from compressed format for efficient remote as well as local rendering. Our representation supports both view-dependent and on-demand rendering. Our approach renders each node using quasi-random sampling utilizing the probability distribution derived from the PCA analysis. We show many benefits of our approach: (1) several-fold improvement in the storage and transmission complexity of point geometry; (2) direct rendering from compressed data; and (3) support for local and remote rendering on a variety of rendering platforms such as CPUs, GPUs, and PDAs.},
	keywords = {network graphics, Point-based rendering, Principal component analysis, programmable GPU, progressive transmission, quasi-random numbers, view-dependent rendering},
	isbn = {0730-0301},
	doi = {10.1145/1061347.1061356},
	url = {http://doi.acm.org/10.1145/1061347.1061356},
	author = {Kalaiah,Aravind and Varshney, Amitabh}
}
@article {18718,
	title = {Structural Determinants for Selective Recognition of a Lys48-Linked Polyubiquitin Chain by a UBA Domain},
	journal = {Molecular Cell},
	volume = {18},
	year = {2005},
	month = {2005/06/10/},
	pages = {687 - 698},
	abstract = {SummaryAlthough functional diversity in polyubiquitin chain signaling has been ascribed to the ability of differently linked chains to bind in a distinctive manner to effector proteins, structural models of such interactions have been lacking. Here, we use NMR to unveil the structural basis of selective recognition of Lys48-linked di- and tetraubiquitin chains by the UBA2 domain of hHR23A. Although the interaction of UBA2 with Lys48-linked diubiquitin involves the same hydrophobic surface on each ubiquitin unit as that utilized in monoubiquitin:UBA complexes, our results show how the {\textquotedblleft}closed{\textquotedblright} conformation of Lys48-linked diubiquitin is crucial for high-affinity binding. Moreover, recognition of Lys48-linked diubiquitin involves a unique epitope on UBA, which allows the formation of a sandwich-like diubiqutin:UBA complex. Studies of the UBA-tetraubiquitin interaction suggest that this mode of UBA binding to diubiquitin is relevant for longer chains.
},
	isbn = {1097-2765},
	doi = {10.1016/j.molcel.2005.05.013},
	url = {http://www.sciencedirect.com/science/article/pii/S1097276505013195},
	author = {Varadan,Ranjani and Assfalg,Michael and Raasi,Shahri and Pickart,Cecile and Fushman, David}
}
@article {13865,
	title = {Structural metadata and parsing speech},
	year = {2005},
	month = {2005///},
	institution = {JHU Language Engineering Workshop},
	author = {Harper,M. and Dorr, Bonnie J and Hale,J. and Roark,B. and Shafran,I. and Lease,M. and Liu,Y. and Snover,M. and Yung,L. and Krasnyanskaya,A. and others}
}
@article {12284,
	title = {Stub Domain DDoS Detection},
	year = {2005},
	month = {2005///},
	institution = {Technical Report of the Department of Computer Science, University of Maryland, College Park},
	author = {Kommareddy,C. and Levin,D. and Bhattacharjee, Bobby and La,R.J. and Shayman,M.}
}
@article {15474,
	title = {Studying the fault-detection effectiveness of GUI test cases for rapidly evolving software},
	journal = {Software Engineering, IEEE Transactions on},
	volume = {31},
	year = {2005},
	month = {2005/10//},
	pages = {884 - 896},
	abstract = {Software is increasingly being developed/maintained by multiple, often geographically distributed developers working concurrently. Consequently, rapid-feedback-based quality assurance mechanisms such as daily builds and smoke regression tests, which help to detect and eliminate defects early during software development and maintenance, have become important. This paper addresses a major weakness of current smoke regression testing techniques, i.e., their inability to automatically (re)test graphical user interfaces (GUIs). Several contributions are made to the area of GUI smoke testing. First, the requirements for GUI smoke testing are identified and a GUI smoke test is formally defined as a specialized sequence of events. Second, a GUI smoke regression testing process called daily automated regression tester (DART) that automates GUI smoke testing is presented. Third, the interplay between several characteristics of GUI smoke test suites including their size, fault detection ability, and test oracles is empirically studied. The results show that: 1) the entire smoke testing process is feasible in terms of execution time, storage space, and manual effort, 2) smoke tests cannot cover certain parts of the application code, 3) having comprehensive test oracles may make up for not having long smoke test cases, and 4) using certain oracles can make up for not having large smoke test suites.},
	keywords = {daily automated regression tester, Fault diagnosis, fault-detection, formal specification, formal verification, Graphical user interfaces, GUI test cases, program testing, quality assurance mechanism, rapidly evolving software, smoke regression testing technique, software development, software fault tolerance, Software maintenance, software prototyping, Software quality, test oracles},
	isbn = {0098-5589},
	doi = {10.1109/TSE.2005.117},
	author = {Memon, Atif M. and Xie,Q.}
}
@article {12668,
	title = {Synthesis of novel views of moving objects in airborne video},
	journal = {Proc. British Machine Vision Conference},
	year = {2005},
	month = {2005///},
	pages = {290 - 299},
	abstract = {This paper presents a method for synthesizing novel views of movingobjects in airborne video. The object of interest is tracked using an appear-
ance based visual tracking method. The on-object point correspondence is
then built and used to estimate the homography induced by the ground plane.
With known camera focal length, the surface normal to the ground plane and
the camera motion between two views are factored out from the homography.
In order to assure robustness of surface normal estimation, a rank one con-
straint is applied to decompose a matrix which contains the homographies
from multiple frame pairs. Given a desired viewing direction, the novel im-
age of the object is generated by warping the reference frame using the new
homography between the desired viewpoint and the reference frame. Exper-
imental results show that the method is robust and errors due to small depth
variations of the object is negligible.
},
	author = {Yue, Z. and Chellapa, Rama}
}
@conference {14531,
	title = {System for capturing of highorder spatial audio using spherical microphone array and binaural head-tracked playback over headphones with head related transfer function cues},
	booktitle = {Proc. 119th convention AES},
	year = {2005},
	month = {2005///},
	author = {Duraiswami, Ramani and Zotkin,Dmitry N and Li,Z. and Grassi,E. and Gumerov, Nail A. and Davis, Larry S.}
}
@conference {18781,
	title = {A system for performing content-based searches on a database of mechanical assemblies},
	year = {2005},
	month = {2005///},
	address = {Orlando, Florida USA},
	abstract = {The increased use of 3D CAD systems by productdevelopment organizations has resulted in large databases of
assemblies; this explosion of assembly data will continue in the
future. Currently, there are no effective content-based
techniques to search these databases. Ability to perform
content-based searches on these databases is expected to help
the designers in the following two ways. First, it can facilitate
reuse of existing assembly designs, and thereby reducing the
design time. Second, a lot of useful Design for Manufacturing
and Assembly (DFMA) knowledge is embedded in existing
assemblies. Therefore a capability to locate existing assemblies
and examine them can be used as a learning tool by the
designers to learn from the existing assembly designs and
hence transfer the best DFMA practices to new designers. This
paper describes a system for performing content-based searches
on assembly databases. We identify templates for
comprehensive search definitions and describe algorithms to
perform content-based searches for mechanical assemblies. We
also illustrate capabilities of our system through several
examples.
},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.160.8372\&rep=rep1\&type=pdf},
	author = {Deshmukh,A. S. and Gupta,S.K. and Karnik,M. V. and Sriram,R.D.}
}
@conference {12298,
	title = {Scalable resilient media streaming},
	booktitle = {Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video},
	series = {NOSSDAV {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {4 - 9},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We present a low-overhead media streaming system, called SRMS (Scalable Resilient Media Streaming) that can be used to scalably deliver streaming data to a large group of receivers. SRMS uses overlay multicast for data distribution. to a large group of users. SRMS leverages a probabilistic loss recovery technique to provide high data delivery guarantees even under large network losses and overlay node failures. The clients in the SRMS system are able to interoperate with existing media streaming servers that use RTP for data transport. One of the interesting features of SRMS is that it can simultaneously support clients with disparate access bandwidths. It enables the necessary bandwidth adaptations using standard Real-time Transport Protocol (RTP) mechanisms, e.g. RTP translators. We have implemented and evaluated the SRMS system in detail on an emulated network as well as on a wide-area testbed with up to 128 clients. Our results show that clients using SRMS achieve high (97\%) data delivery ratios with low overheads (<5\%) even for a very dynamic network (up to five membership changes per minute).},
	keywords = {media streaming, Multicast, overlay network, Resilience},
	isbn = {1-58113-801-6},
	doi = {10.1145/1005847.1005851},
	url = {http://doi.acm.org/10.1145/1005847.1005851},
	author = {Banerjee,Suman and Lee,Seungjoon and Braud,Ryan and Bhattacharjee, Bobby and Srinivasan, Aravind}
}
@article {14070,
	title = {Schistosoma mansoni genome project: an update},
	journal = {Parasitology International},
	volume = {53},
	year = {2004},
	month = {2004/06//},
	pages = {183 - 192},
	abstract = {A schistosome genome project was initiated by the World Health Organization in 1994 with the notion that the best prospects for identifying new targets for drugs, vaccines, and diagnostic development lie in schistosome gene discovery, development of chromosome maps, whole genome sequencing and genome analysis. Schistosoma mansoni has a haploid genome of 270 Mb contained on 8 pairs of chromosomes. It is estimated that the S. mansoni genome contains between 15~000 and 25~000 genes. There are approximately 16~689 ESTs obtained from diverse libraries representing different developmental stages of S. mansoni, deposited in the NCBI EST database. More than half of the deposited sequences correspond to genes of unknown function. Approximately 40-50\% of the sequences form unique clusters, suggesting that approximately 20-25\% of the total schistosome genes have been discovered. Efforts to develop low resolution chromosome maps are in progress. There is a genome sequencing program underway that will provide 3X sequence coverage of the S. mansoni genome that will result in approximately 95\% gene discovery. The genomics era has provided the resources to usher in the era of functional genomics that will involve microarrays to focus on specific metabolic pathways, proteomics to identify relevant proteins and protein-protein interactions to understand critical parasite pathways. Functional genomics is expected to accelerate the development of control and treatment strategies for schistosomiasis.},
	keywords = {Chromosome mapping, Gene discovery, Genomics, Schistosoma mansoni},
	isbn = {1383-5769},
	doi = {16/j.parint.2004.01.009},
	url = {http://www.sciencedirect.com/science/article/pii/S1383576904000108},
	author = {LoVerde,Philip T. and Hirai,Hirohisa and Merrick,Joseph M and Lee,Norman H and El-Sayed, Najib M.}
}
@conference {18353,
	title = {Searching the web with mobile images for location recognition},
	booktitle = {Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on},
	volume = {2},
	year = {2004},
	month = {2004///},
	pages = {76 - 81},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We describe an approach to recognizing location from mobile devices using image-based Web search. We demonstrate the usefulness of common image search metrics applied on images captured with a camera-equipped mobile device to find matching images on the World Wide Web or other general-purpose databases. Searching the entire Web can be computationally overwhelming, so we devise a hybrid image-and-keyword searching technique. First, image-search is performed over images and links to their source Web pages in a database that indexes only a small fraction of the Web. Then, relevant keywords on these Web pages are automatically identified and submitted to an existing text-based search engine (e.g. Google) that indexes a much larger portion of the Web. Finally, the resulting image set is filtered to retain images close to the original query. It is thus possible to efficiently search hundreds of millions of images that are not only textually related but also visually relevant. We demonstrate our approach on an application allowing users to browse Web pages matching the image of a nearby location.},
	isbn = {0-7695-2158-4},
	doi = {10.1109/CVPR.2004.1315147},
	url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1315147},
	author = {Tom Yeh and Tollmar,K. and Darrell,T.}
}
@article {13020,
	title = {Section-level relationships of North American {\i}t Agalinis (Orobanchaceae) based on DNA sequence analysis of three chloroplast gene regions},
	journal = {BMC Evol Biol},
	volume = {4},
	year = {2004},
	month = {2004/06//},
	pages = {15 - 15},
	abstract = {BACKGROUND: The North American Agalinis are representatives of a taxonomically difficult group that has been subject to extensive taxonomic revision from species level through higher sub-generic designations (e.g., subsections and sections). Previous presentations of relationships have been ambiguous and have not conformed to modern phylogenetic standards (e.g., were not presented as phylogenetic trees). Agalinis contains a large number of putatively rare taxa that have some degree of taxonomic uncertainty. We used DNA sequence data from three chloroplast genes to examine phylogenetic relationships among sections within the genus Agalinis Raf. (=Gerardia), and between Agalinis and closely related genera within Orobanchaceae. RESULTS: Maximum likelihood analysis of sequences data from rbcL, ndhF, and matK gene regions (total aligned length 7323 bp) yielded a phylogenetic tree with high bootstrap values for most branches. Likelihood ratio tests showed that all but a few branch lengths were significantly greater than zero, and an additional likelihood ratio test rejected the molecular clock hypothesis. Comparisons of substitution rates between gene regions based on linear models of pairwise distance estimates between taxa show both ndhF and matK evolve more rapidly than rbcL, although the there is substantial rate heterogeneity within gene regions due in part to rate differences among codon positions. CONCLUSIONS: Phylogenetic analysis supports the monophyly of Agalinis, including species formerly in Tomanthera, and this group is sister to a group formed by the genera Aureolaria, Brachystigma, Dasistoma, and Seymeria. Many of the previously described sections within Agalinis are polyphyletic, although many of the subsections appear to form natural groups. The analysis reveals a single evolutionary event leading to a reduction in chromosome number from n = 14 to n = 13 based on the sister group relationship of section Erectae and section Purpureae subsection Pedunculares. Our results establish the evolutionary distinctiveness of A. tenella from the more widespread and common A. obtusifolia. However, further data are required to clearly resolve the relationship between A. acuta and A. tenella.},
	doi = {10.1186/1471-2148-4-15},
	author = {Neel,M. C and Cummings, Michael P.}
}
@article {15186,
	title = {Secure routing in ad hoc networks},
	journal = {Workshop on Security of ad hoc and Sensor Networks: Proceedings of the 2 nd ACM workshop on Security of ad hoc and sensor networks},
	year = {2004},
	month = {2004///},
	author = {Katz, Jonathan}
}
@conference {18278,
	title = {Security evaluation for communication-friendly encryption of multimedia},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {1},
	year = {2004},
	month = {2004/10//},
	pages = {569 - 572 Vol. 1 - 569 - 572 Vol. 1},
	abstract = {This paper addresses the access control issues unique to multimedia, by using a joint signal processing and cryptographic approach to multimedia encryption. Based on three atomic encryption primitives, we present a systematic study on how to strategically integrate different atomic operations to build a video encryption system. We also propose a set of multimedia-specific security metrics to quantify the security against approximation attacks and to complement the existing notion of generic data security. The resulting system can provide superior performance to both generic encryption and its simple adaptation to video in terms of a joint consideration of security, bitrate overhead, and communication friendliness.},
	keywords = {access, approximation, atomic, attacks;, bitrate, coding;, communication-friendly, communication;, control;, cryptography;, data, encryption, encryption;, generic, joint, method;, metrics;, multimedia, multimedia-specific, overhead;, primitives;, processing/cryptographic, Security, security;, signal, system;, Telecommunication, video},
	doi = {10.1109/ICIP.2004.1418818},
	author = {Mao,Yinian and M. Wu}
}
@article {12075,
	title = {Security issues in IEEE 802.11 wireless local area networks: a survey},
	journal = {Wireless Communications and Mobile Computing},
	volume = {4},
	year = {2004},
	month = {2004///},
	pages = {821 - 833},
	author = {Mishra,A. and Petroni Jr,N. L and Arbaugh, William A. and Fraser,T.}
}
@inbook {13324,
	title = {Selective refinement on nested tetrahedral meshes},
	booktitle = {Geometric Modeling for Scientific VisualizationGeometric Modeling for Scientific Visualization},
	year = {2004},
	month = {2004///},
	pages = {329 - 344},
	publisher = {Birkh{\"a}user},
	organization = {Birkh{\"a}user},
	isbn = {9783540401162},
	author = {De Floriani, Leila and Lee,M.}
}
@article {13325,
	title = {Selective refinement queries for volume visualization of unstructured tetrahedral meshes},
	journal = {Visualization and Computer Graphics, IEEE Transactions on},
	volume = {10},
	year = {2004},
	month = {2004///},
	pages = {29 - 45},
	abstract = {We address the problem of the efficient visualization of large irregular volume data sets by exploiting a multiresolution model based on tetrahedral meshes. Multiresolution models, also called Level-Of-Detail (LOD) models, allow encoding the whole data set at a virtually continuous range of different resolutions. We have identified a set of queries for extracting meshes at variable resolution from a multiresolution model, based on field values, domain location, or opacity of the transfer function. Such queries allow trading off between resolution and speed in visualization. We define a new compact data structure for encoding a multiresolution tetrahedral mesh built through edge collapses to support selective refinement efficiently and show that such a structure has a storage cost from 3 to 5.5 times lower than standard data structures used for tetrahedral meshes. The data structures and variable resolution queries have been implemented together with state-of-the art visualization techniques in a system for the interactive visualization of three-dimensional scalar fields defined on tetrahedral meshes. Experimental results show that selective refinement queries can support interactive visualization of large data sets.},
	keywords = {Automated;Signal Processing, Computer-Assisted;Imaging, Computer-Assisted;User-Computer Interface;, data structure;geometric modeling;interactive visualization;large data sets;multiresolution model;selective refinement queries;unstructured tetrahedral meshes;variable resolution queries;volume data visualization;data visualisation;mesh generation;query p, Three-Dimensional;Online Systems;Pattern Recognition},
	isbn = {1077-2626},
	doi = {10.1109/TVCG.2004.1260756},
	author = {Cignoni,P. and De Floriani, Leila and Magillo,P. and Puppo,E. and Scopigno,R.}
}
@article {14256,
	title = {Self-Calibration from Image Derivatives},
	journal = {International Journal of Computer Vision},
	volume = {48},
	year = {2004},
	month = {2004///},
	pages = {91 - 114},
	author = {Brodsky, T. and Ferm{\"u}ller, Cornelia}
}
@article {13854,
	title = {Semantic annotation and lexico-syntactic paraphrase},
	journal = {Proceedings of the 4th International Conference on Language Resources and Evaluation (LREC) Workshop on Building Lexical Resources from Semantically Annotated Corpora},
	year = {2004},
	month = {2004///},
	pages = {47 - 52},
	abstract = {The IAMTC project (Interlingual Annotation of Multilingual Translation Corpora) is developing an interlingual representation frameworkfor annotation of parallel corpora (English paired with Arabic, French, Hindi, Japanese, Korean, and Spanish) with deep-semantic
representations. In particular, we are investigating meaning equivalent paraphrases involving conversives and non-literal language use,
as well as extended paraphrases involving syntax, lexicon, and grammatical features. The interlingua representation has three levels of
depth. Each level is characterized by the types of meaning equivalent paraphrases that receive identical representations at that level.
},
	author = {Dorr, Bonnie J and Green,R. and Levin,L. and Rambow,O. and Farwell,D. and Habash,N. and Helmreich,S. and Hovy,E. and Miller,K.J. and Mitamura,T. and others}
}
@article {13855,
	title = {Semantic Annotation for Interlingual Representation of Multilingual Texts},
	journal = {Workshop Programme},
	year = {2004},
	month = {2004///},
	pages = {19 - 19},
	abstract = {This paper describes the annotation process being used in a multi-site project to create six sizable bilingual parallel corpora annotated with a consistent interlingua representation. After presenting the background and objectives of the effort, we describe the multilingual corpora and the three stages of interlingual representation being developed. We then focus on the annotation process itself, including an interface environment that supports the annotation task, and the methodology for evaluating the interlingua representation. Finally, we discuss some issues encountered during the annotation tasks. The resulting annotated multilingual corpora will be useful for a wide range of natural language processing research tasks, including machine translation, question answering, text summarization, and information extraction.},
	author = {Mitamura,T. and Miller,K. and Dorr, Bonnie J and Farwell,D. and Habash,N. and Helmreich,S. and Hovy,E. and Levin,L. and Rambow,O. and Reeder,F. and others}
}
@article {15273,
	title = {A semidefinite programming approach to side chain positioning with new rounding strategies},
	journal = {INFORMS Journal on Computing},
	volume = {16},
	year = {2004},
	month = {2004///},
	pages = {380 - 392},
	author = {Chazelle,B. and Kingsford, Carl and Singh,M.}
}
@article {14080,
	title = {Sequencing Strategies for Parasite Genomes},
	journal = {METHODS IN MOLECULAR BIOLOGY-CLIFTON THEN TOTOWA-},
	volume = {270},
	year = {2004},
	month = {2004///},
	pages = {1 - 16},
	author = {Bartholomeu,D. and El-Sayed, Najib M. and Melville,S. E.}
}
@article {13230,
	title = {Sequential kernel density approximation through mode propagation: applications to background modeling},
	journal = {Proc. ACCV},
	volume = {2004},
	year = {2004},
	month = {2004///},
	abstract = {Density-based modeling of visual features is very commonin computer vision, either by using non-parametric techniques
or through representing the underlying density function as
a weighted sum of Gaussians. A number of real-time tasks
such as background modeling or modeling the appearance of
a moving target require sequential density estimation, where
new data is incorporated in the model as it becomes avail-
able. Nevertheless, current methods for updating the den-
sity function either lack flexibility, by fixing the number of
Gaussians in the mixture, or require large memory amounts,
by maintaining a non-parametric representation of the den-
sity. This paper presents an efficient method for recursive
density approximation that relies on the propagation of the
density modes. At each time step, the modes of the density
are re-estimated and a Gaussian component is assigned to
each mode. The covariance of each component is derived
from the Hessian matrix estimated at the mode location. To
detect the modes we employ the variable-bandwidth mean
shift. While the proposed density representation is mem-
ory efficient (which is typical for mixture densities), it in-
herits the flexibility of non-parametric methods, by allow-
ing the number of modes to adapt in time. We show that
the same mode propagation principle applies for subspaces
derived from eigen analysis. Extensive experimental back-
ground modeling results demonstrate the performance of the
method.
},
	author = {Han,B. and Comaniciu, D. and Davis, Larry S.}
}
@conference {16885,
	title = {A serverless 3D world},
	booktitle = {Proceedings of the 12th annual ACM international workshop on Geographic information systems},
	series = {GIS {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {157 - 165},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interactivity for a large number of participants. Current solutions divide a large virtual-world into a few mutually exclusive zones, with each zone controlled by a different server, and/or limit the number of participants per server or per virtual-world. Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment (one peer is introduced to the system by each participant), however current P2P applications can only provide file sharing and other forms of relatively simple data communications. In this paper, we present a generic 3D virtual-world application that runs on a P2P network with no central administration or server. Two issues are addressed by this paper to enable such a spatial application on a P2P network. First, we demonstrate how to index and query a 3D space on a dynamic distributed network. Second, we show how to build such a complex application from the ground level of a P2P routing algorithm. Our work leads to new directions for the development of online virtual-worlds that we believe can be used for many government, industry, and public domain applications.},
	keywords = {distributed hash tables, peer-to-peer systems, spatial data, virtual-worlds},
	isbn = {1-58113-979-9},
	doi = {10.1145/1032222.1032246},
	url = {http://doi.acm.org/10.1145/1032222.1032246},
	author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan and Nutanong,Sarana and Truong,Minh Tri}
}
@article {17657,
	title = {SESSION 2: STREAMING},
	journal = {Proceedings of the 14th International Workshop on Network and Operating Systems Support for Digital Audio and Video: NOSSDAV 2003: June 16-18, 2004, Cork, Ireland},
	year = {2004},
	month = {2004///},
	pages = {3 - 3},
	author = {Banerjee,S. and Lee,S. and Braud,R. and Bhattacharjee, Bobby and Srinivasan, Aravind and Chu,Y. and Zhang,H. and Sinha,R. and Papadopoulos,C. and Boustead,P. and others}
}
@conference {13644,
	title = {Shot boundary detection based on Image correlation features in video},
	booktitle = {TREC-VID: Text Retrieval and Evaluation Conference},
	year = {2004},
	month = {2004///},
	abstract = {This paper introduced a framework of shot boundary detection used by the LAMPLAB, University of Maryland, College Park. It deals with cuts and dissolves detection. Generally, it is based on image correlation features in the videos. The cut detection is based on the so-called 2max ratio criterion in a sequential image buffer. The dissolve detection is based on the skipping image difference and linearity error in a sequential image buffer. We also eliminated the effect of flashlights in our algorithms. We submitted 5 runs to TRECVID 2004. Their run-ids are {\textquotedblleft}D0, D1, {\textellipsis} , D4{\textquotedblright}. They use the same algorithms with different parameter settings. These runs show a tradeoff curve between precision and recall on the testing data of TRECVID 2004.},
	author = {Luo,Ming and DeMenthon,D. and David Doermann}
}
@inbook {16286,
	title = {Shotgun Sequence Assembly},
	booktitle = {Advances in ComputersAdvances in Computers},
	volume = {Volume 60},
	year = {2004},
	month = {2004///},
	pages = {193 - 248},
	publisher = {Elsevier},
	organization = {Elsevier},
	abstract = {Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by automated sequencing machines, then piecing together the original genome using specialized software programs called assemblers. Due to the large amounts of data being generated and to the complex structure of most organisms{\textquoteright} genomes, successful assembly programs rely on sophisticated algorithms based on knowledge from such diverse fields as statistics, graph theory, computer science, and computer engineering. Throughout this chapter we will describe the main computational challenges imposed by the shotgun sequencing method, and survey the most widely used assembly algorithms.},
	isbn = {0065-2458},
	url = {http://www.sciencedirect.com/science/article/pii/S0065245803600069},
	author = {Pop, Mihai}
}
@article {13225,
	title = {Similarity measure for nonparametric kernel density based object tracking},
	journal = {Eighteenth Annual Conference on Neural Information Processing Systems, Vancouver},
	year = {2004},
	month = {2004///},
	abstract = {An object tracking algorithm using a novel simple symmetric similar-ity function between spatially-smoothed kernel-density estimates of the
model and target distributions is proposed and tested. The similarity
measure is based on the expectation of the density estimates over the
model or target images. The density is estimated using radial-basis ker-
nel functions that measure the affinity between points and provide a bet-
ter outlier rejection property. The mean-shift algorithm is used to track
objects by iteratively maximizing this similarity function. To alleviate
the quadratic complexity of the density estimation, we employ Gaussian
kernels and the fast Gauss transform to reduce the computations to linear
order. This leads to a very efficient and robust nonparametric tracking al-
gorithm. The proposed algorithm is tested with several image sequences
and shown to achieve robust and reliable real-time tracking. Several se-
quences are placed at http://www.cs.umd.edu/users/yangcj/node3.html.
},
	author = {Yang,C. and Duraiswami, Ramani and Davis, Larry S.}
}
@article {13021,
	title = {Simple statistical models predict C-to-U edited sites in plant mitochondrial RNA},
	journal = {BMC Bioinformatics},
	volume = {5},
	year = {2004},
	month = {2004/09//},
	pages = {132 - 132},
	abstract = {BACKGROUND: RNA editing is the process whereby an RNA sequence is modified from the sequence of the corresponding DNA template. In the mitochondria of land plants, some cytidines are converted to uridines before translation. Despite substantial study, the molecular biological mechanism by which C-to-U RNA editing proceeds remains relatively obscure, although several experimental studies have implicated a role for cis-recognition. A highly non-random distribution of nucleotides is observed in the immediate vicinity of edited sites (within 20 nucleotides 5{\textquoteright} and 3{\textquoteright}), but no precise consensus motif has been identified. RESULTS: Data for analysis were derived from the the complete mitochondrial genomes of Arabidopsis thaliana, Brassica napus, and Oryza sativa; additionally, a combined data set of observations across all three genomes was generated. We selected datasets based on the 20 nucleotides 5{\textquoteright} and the 20 nucleotides 3{\textquoteright} of edited sites and an equivalently sized and appropriately constructed null-set of non-edited sites. We used tree-based statistical methods and random forests to generate models of C-to-U RNA editing based on the nucleotides surrounding the edited/non-edited sites and on the estimated folding energies of those regions. Tree-based statistical methods based on primary sequence data surrounding edited/non-edited sites and estimates of free energy of folding yield models with optimistic re-substitution-based estimates of approximately 0.71 accuracy, approximately 0.64 sensitivity, and approximately 0.88 specificity. Random forest analysis yielded better models and more exact performance estimates with approximately 0.74 accuracy, approximately 0.72 sensitivity, and approximately 0.81 specificity for the combined observations. CONCLUSIONS: Simple models do moderately well in predicting which cytidines will be edited to uridines, and provide the first quantitative predictive models for RNA edited sites in plant mitochondria. Our analysis shows that the identity of the nucleotide -1 to the edited C and the estimated free energy of folding for a 41 nt region surrounding the edited C are the most important variables that distinguish most edited from non-edited sites. However, the results suggest that primary sequence data and simple free energy of folding calculations alone are insufficient to make highly accurate predictions.},
	doi = {10.1186/1471-2105-5-132},
	author = {Cummings, Michael P. and Myers,D. S}
}
@conference {12684,
	title = {Simultaneous background and foreground modeling for tracking in surveillance video},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {2},
	year = {2004},
	month = {2004/10//},
	pages = {1053 - 1056 Vol.2 - 1053 - 1056 Vol.2},
	abstract = {We present a stochastic tracking algorithm for surveillance video where targets are dim and at low resolution. The algorithm builds motion models for both background and foreground by integrating motion and intensity information. Some other merits of the algorithm include adaptive selection of feature points for scene description and defining proper cost functions for displacement estimation. The experimental results show tracking robustness and precision in a challenging video sequences.},
	keywords = {algorithm;, analysis;, background-foreground, displacement, estimation;, image, information;, INTENSITY, modeling;, MOTION, processes;, processing;, resolution;, sequences;, signal, Stochastic, Surveillance, surveillance;, tracking, tracking;, video},
	doi = {10.1109/ICIP.2004.1419483},
	author = {Shao, J. and Zhou,S. K and Chellapa, Rama}
}
@conference {15468,
	title = {Skoll: distributed continuous quality assurance},
	booktitle = {Software Engineering, 2004. ICSE 2004. Proceedings. 26th International Conference on},
	year = {2004},
	month = {2004/05//},
	pages = {459 - 468},
	abstract = {Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. Since this approach is inadequate for many systems, tools and processes are being developed to improve software quality by increasing user participation in the QA process. A limitation of these approaches is that they focus on isolated mechanisms, not on the coordination and control policies and tools needed to make the global QA process efficient, effective, and scalable. To address these issues, we have initiated the Skoll project, 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 manner to significantly and rapidly improve software quality. This paper provides several contributions to the study of distributed continuous QA. First, it illustrates the structure and functionality of a generic around-the-world, around-the-clock QA process and describes several sophisticated tools that support this process. Second, it describes several QA scenarios built using these tools and process. Finally, it presents a feasibility study applying these scenarios to a 1MLOC+ software package called ACE+TAO. While much work remains to be done, the study suggests that the Skoll process and tools effectively manage and control distributed, continuous QA processes. Using Skoll we rapidly identified problems that had taken the ACE+TAO developers substantially longer to find and several of which had previously not been found. Moreover, automatic analysis of QA task results often provided developers information that quickly led them to the root cause of the problems.},
	keywords = {1MLOC+ software package, ACE+TAO, around-the-clock QA process, around-the-world QA process, distributed continuous QA, distributed continuous quality assurance, distributed programming, program verification, Quality assurance, Skoll, software performance evaluation, software profiling, Software quality, Software testing},
	doi = {10.1109/ICSE.2004.1317468},
	author = {Memon, Atif M. and Porter, Adam and Yilmaz,C. and Nagarajan,A. and Schmidt,D. and Natarajan,B.}
}
@article {12171,
	title = {SlideBar: Analysis of a linear input device},
	journal = {Behaviour \& Information Technology},
	volume = {23},
	year = {2004},
	month = {2004///},
	pages = {1 - 9},
	author = {Chipman,L.E. and Bederson, Benjamin B. and Golbeck,J.}
}
@conference {12288,
	title = {Slurpie: a cooperative bulk data transfer protocol},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {2},
	year = {2004},
	month = {2004/03//},
	pages = {941 - 951 vol.2 - 941 - 951 vol.2},
	abstract = {We present Slurpie: a peer-to-peer protocol for bulk data transfer. Slurpie is specifically designed to reduce client download times for large, popular files, and to reduce load on servers that serve these files. Slurpie employs a novel adaptive downloading strategy to increase client performance, and employs a randomized backoff strategy to precisely control load on the server. We describe a full implementation of the Slurpie protocol, and present results from both controlled local-area and wide-area testbeds. Our results show that Slurpie clients improve performance as the size of the network increases, and the server is completely insulated from large flash crowds entering the Slurpie network.},
	keywords = {adaptive, bulk, client-server, clients;, computing;, cooperative, data, data;, downloading, network;, peer-to-peer, protocol;, protocols;, Slurpie, strategy;, systems;, transfer, transport},
	doi = {10.1109/INFCOM.2004.1356981},
	author = {Sherwood,R. and Braud,R. and Bhattacharjee, Bobby}
}
@inbook {17367,
	title = {Social and psychological influences on computer user frustration},
	booktitle = {Media access: Social and psychological dimensions of new technology useMedia access: Social and psychological dimensions of new technology use},
	year = {2004},
	month = {2004///},
	pages = {91 - 103},
	author = {Bessiere,K. and Ceaparu,I. and Lazar,J. and Robinson,J. and Shneiderman, Ben}
}
@article {16890,
	title = {SoftPOSIT: Simultaneous pose and correspondence determination},
	journal = {International Journal of Computer Vision},
	volume = {59},
	year = {2004},
	month = {2004///},
	pages = {259 - 284},
	abstract = {The problem of pose estimation arises in many areas of computer vision, including object recognition, object tracking, site inspection and updating, and autonomous navigation when scene models are available. We present a new algorithm, called SoftPOSIT, for determining the pose of a 3D object from a single 2D image when correspondences between object points and image points are not known. The algorithm combines the iterative softassign algorithm (Gold and Rangarajan, 1996; Gold et al., 1998) for computing correspondences and the iterative POSIT algorithm (DeMenthon and Davis, 1995) for computing object pose under a full-perspective camera model. Our algorithm, unlike most previous algorithms for pose determination, does not have to hypothesize small sets of matches and then verify the remaining image points. Instead, all possible matches are treated identically throughout the search for an optimal pose. The performance of the algorithm is extensively evaluated in Monte Carlo simulations on synthetic data under a variety of levels of clutter, occlusion, and image noise. These tests show that the algorithm performs well in a variety of difficult scenarios, and empirical evidence suggests that the algorithm has an asymptotic run-time complexity that is better than previous methods by a factor of the number of image points. The algorithm is being applied to a number of practical autonomous vehicle navigation problems including the registration of 3D architectural models of a city to images, and the docking of small robots onto larger robots.},
	doi = {10.1023/B:VISI.0000025800.10423.1f},
	author = {David,P. and DeMenthon,D. and Duraiswami, Ramani and Samet, Hanan}
}
@article {18713,
	title = {Solution Conformation of Lys63-linked Di-ubiquitin Chain Provides Clues to Functional Diversity of Polyubiquitin Signaling},
	journal = {Journal of Biological ChemistryJ. Biol. Chem.},
	volume = {279},
	year = {2004},
	month = {2004/02/20/},
	pages = {7055 - 7063},
	abstract = {Diverse cellular events are regulated by post-translational modification of substrate proteins via covalent attachment of one or a chain of ubiquitin molecules. The outcome of (poly)ubiquitination depends upon the specific lysine residues involved in the formation of polyubiquitin chains. Lys48-linked chains act as a universal signal for proteasomal degradation, whereas Lys63-linked chains act as a specific signal in several non-degradative processes. Although it has been anticipated that functional diversity between alternatively linked polyubiquitin chains relies on linkage-dependent differences in chain conformation/topology, direct structural evidence in support of this model has been lacking. Here we use NMR methods to determine the structure of a Lys63-linked di-ubiquitin chain. The structure is characterized by an extended conformation, with no direct contact between the hydrophobic residues Leu8, Ile44, and Val70 on the ubiquitin units. This structure contrasts with the closed conformation observed for Lys48-linked di-ubiquitin wherein these residues form the interdomain interface (Cook, W. J., Jeffrey, L. C., Carson, M., Zhijian, C., and Pickart, C. M. (1992) J. Biol. Chem. 267, 16467-16471; Varadan, R., Walker, O., Pickart, C., and Fushman, D. (2002) J. Mol. Biol. 324, 637-647). Consistent with the open conformation of the Lys63-linked di-ubiquitin, our binding studies show that both ubiquitin domains in this chain can bind a ubiquitin-associated domain from HHR23A independently and in a mode similar to that for mono-ubiquitin. In contrast, Lys48-linked di-ubiquitin binds in a different, higher affinity mode that has yet to be determined. This is the first experimental evidence that alternatively linked polyubiquitin chains adopt distinct conformations.},
	isbn = {0021-9258, 1083-351X},
	doi = {10.1074/jbc.M309184200},
	url = {http://www.jbc.org/content/279/8/7055},
	author = {Varadan,Ranjani and Assfalg,Michael and Haririnia,Aydin and Raasi,Shahri and Pickart,Cecile and Fushman, David}
}
@article {18490,
	title = {Some foundational problems in interdomain routing},
	journal = {Proceedings of Third Workshop on Hot Topics in Networks (HotNets-III)},
	year = {2004},
	month = {2004///},
	abstract = {The substantial complexity of interdomain routing in theInternet comes from the need to support flexible poli-
cies while scaling to a large number of Autonomous
Systems. Despite impressive progress in characterizing
the various ills of the Border Gateway Protocol (BGP),
many problems remain unsolved, and the behavior of
the routing system is still poorly understood. This paper
argues that we must understand interdomain routing in
terms of: (1) intrinsic properties and design tradeoffs of
policy-based routing, independent of the specific routing
protocol and (2) properties that relate to artifacts in to-
day{\textquoteright}s protocol. We pose open questions for the research
community that, if answered, should help us understand
why BGP{\textquoteright}s many problems are so difficult to fix. Un-
derstanding the fundamental properties of interdomain
routing will help us decide how to make progress, be it
making backward-compatible modifications to BGP or
designing a radically different protocol.
},
	author = {Feamster, Nick and Balakrishnan,H. and Rexford,J.}
}
@article {16117,
	title = {Sonification of geo-referenced data for auditory information seeking: Design principle and pilot study},
	journal = {Proceedings of ICAD},
	year = {2004},
	month = {2004///},
	abstract = {We present an Auditory Information Seeking Principle (AISP)(gist, navigate, filter, and details-on-demand) modeled after the
visual information seeking mantra [1]. We propose that data
sonification designs should conform to this principle. We also
present some design challenges imposed by human auditory
perception characteristics. To improve blind access to geo-
referenced statistical data, we developed two preliminary
sonifications adhering to the above AISP, an enhanced table and
a spatial choropleth map. Our pilot study shows people can
recognize geographic data distribution patterns on a real map
with 51 geographic regions, in both designs. The study also
shows evidence that AISP conforms to people{\textquoteright}s information
seeking strategies. Future work is discussed, including the
improvement of the choropleth map design.
},
	author = {Zhao,H. and Plaisant, Catherine and Shneiderman, Ben and Duraiswami, Ramani}
}
@article {17659,
	title = {Special issue: 35th Annual ACM Symposium on Theory of Computing},
	journal = {Journal of Computer and System Sciences},
	volume = {69},
	year = {2004},
	month = {2004/11//},
	pages = {305 - 305},
	isbn = {0022-0000},
	doi = {10.1016/j.jcss.2004.06.004},
	url = {http://www.sciencedirect.com/science/article/pii/S0022000004000881},
	author = {Khanna,Sanjeev and Srinivasan, Aravind}
}
@conference {13211,
	title = {A spherical microphone array system for traffic scene analysis},
	booktitle = {Intelligent Transportation Systems, 2004. Proceedings. The 7th International IEEE Conference on},
	year = {2004},
	month = {2004/10//},
	pages = {338 - 342},
	abstract = {This paper describes a practical spherical microphone array system for traffic auditory scene capture and analysis. Our system uses 60 microphones positioned on the rigid surface of a sphere. We then propose an optimal design of a robust spherical beamformer with minimum white noise gain (WNG) of -6 dB. We test this system in a real-world traffic environment. Some preliminary simulation and experimental results are presented to demonstrate its performance. This system may also find applications in broader areas such as 3D audio, virtual environment, etc.},
	keywords = {-6, 3D, analysis;, array, arrays;, audio;, auditory, beamformer;, capture;, dB;, environment;, gain;, microphone, NOISE, noise;, processing;, real, robust, scene, signal, spherical, system;, traffic, traffic;, virtual, white, World},
	doi = {10.1109/ITSC.2004.1398921},
	author = {Zhiyun Li and Duraiswami, Ramani and Grassi,E. and Davis, Larry S.}
}
@article {12157,
	title = {Spiral acquisition of software-intensive systems of systems},
	journal = {CrossTalk},
	year = {2004},
	month = {2004///},
	pages = {4 - 9},
	author = {Boehm,B. and Brown,A. W and Basili, Victor R. and Turner,R.}
}
@conference {18787,
	title = {A STEP TOWARDS AUTOMATED DESIGN OF INDEX-PLATE MULTI-SHOT MOLDS},
	year = {2004},
	month = {2004/04//},
	address = {Lausanne, Switzerland},
	abstract = {This paper describes an algorithm for automateddesign of index-plate type of multi-shot molds for
manufacturing multi-material objects. This new
algorithm is a significant improvement over
previous mold design algorithms and it accounts
for constraints associated with the index-plate
molding process. Our algorithm works in the
following manner. First, based on the index-plate
process constraints, we determine whether the
given multi-material object is moldable by index-
plate process by analyzing the geometry of the
object. If the object can be molded, then the
molding sequence is determined. Finally, the mold
pieces. We expect that the algorithm described in
this paper will provide the necessary foundations
for automating the design of index-plate molds and
therefore will help in significantly reducing the
mold manufacturing lead-time associated with this
type of molds.
},
	url = {http://www.glue.umd.edu/~skgupta/Publication/TMCE04_Li.pdf},
	author = {Li,X. and Gupta,S.K.}
}
@article {18763,
	title = {A STEP TOWARDS INTEGRATED PRODUCT/PROCESS DEVELOPMENT OF MOLDED MULTI-MATERIAL STRUCTURES},
	journal = {Tools And Methods Of Competitive Engineering},
	year = {2004},
	month = {2004///},
	abstract = {Multi-material molding is emerging as a popularmethod for making multi-material structures. In
multi-material molding processes, fabrication and
assembly steps are performed concurrently inside the
mold. Therefore using existing knowledge on how to
design molded products often results in the selection
of wrong design alternatives and correcting these
mistakes unnecessarily delays the product
development process. To overcome this difficulty we
need to develop an integrated product/process
development methodology for designing molded
multi-material structures. This paper presents an
overview of different multi-material molding
technologies and the role of manufacturing
considerations in shape synthesis of molded multi-
material structures.
},
	url = {http://terpconnect.umd.edu/~skgupta/Publication/TMCE04_Gupta.pdf},
	author = {Gupta,S.K. and Fowler,G.}
}
@conference {11951,
	title = {Stereo Correspondence with Slanted Surfaces: Critical Implications of Horizontal Slant},
	booktitle = {Computer Vision and Pattern Recognition, IEEE Computer Society Conference on},
	volume = {1},
	year = {2004},
	month = {2004///},
	pages = {568 - 573},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {We examine the stereo correspondence problem in the presence of slanted scene surfaces. In particular, we highlight a previously overlooked geometric fact: a horizontally slanted surface (i.e. having depth variation in the direction of the separation of the two cameras) will appear horizontally stretched in one image as compared to the other image. Thus, while corresponding two images, N pixels on a scanline in one image may correspond to a different number of pixels M in the other image. This leads to three important modifications to existing stereo algorithms: (a) due to unequal sampling, intensity matching metrics such as the popular Birchfield-Tomasi procedure must be modified, (b) unequal numbers of pixels in the two images must be allowed to correspond to each other, and (c) the uniqueness constraint, which is often used for detecting occlusions, must be changed to a 3D uniqueness constraint. This paper discusses these new constraints and provides a simple scanline based matching algorithm for illustration. We experimentally demonstrate test cases where existing algorithms fail, and how the incorporation of these new constraints provides correct results. Experimental comparisons of the scanline based algorithm with standard data sets are also provided.},
	doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.241},
	author = {Ogale, Abhijit S. and Aloimonos, J.}
}
@conference {15029,
	title = {Strategies for exploring large scale data},
	booktitle = {Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on},
	year = {2004},
	month = {2004/05//},
	pages = {2 - 2},
	abstract = {We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.},
	keywords = {algorithms;, association;, asymptotic, bounds;, business, data, data;, database, databases;, demographic, discovery;, Indexing, indexing;, information, knowledge, large, linear, mining;, multidimensional, objects;, optimal, Parallel, pattern, processing;, query, querying;, range, scale, scientific, search, serial, series, series;, simulation, space, structure;, structures;, techniques;, temporal, TIME, value, very, window;},
	doi = {10.1109/ISPAN.2004.1300447},
	author = {JaJa, Joseph F.}
}
@conference {17661,
	title = {Structural and algorithmic aspects of massive social networks},
	booktitle = {Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms},
	series = {SODA {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {718 - 727},
	publisher = {Society for Industrial and Applied Mathematics},
	organization = {Society for Industrial and Applied Mathematics},
	address = {Philadelphia, PA, USA},
	abstract = {We study the algorithmic and structural properties of very large, realistic social contact networks. We consider the social network for the city of Portland, Oregon, USA, developed as a part of the TRANSIMS/EpiSims project at the Los Alamos National Laboratory. The most expressive social contact network is a bipartite graph, with two types of nodes: people and locations; edges represent people visiting locations on a typical day. Three types of results are presented. (i) Our empirical results show that many basic characteristics of the dataset are well-modeled by a random graph approach suggested by Fan Chung Graham and Lincoln Lu (the CL-model), with a power-law degree distribution. (ii) We obtain fast approximation algorithms for computing basic structural properties such as clustering coefficients and shortest paths distribution. We also study the dominating set problem for such networks; this problem arose in connection with optimal sensor-placement for disease-detection. We present a fast approximation algorithm for computing near-optimal dominating sets. (iii) Given the close approximations provided by the CL-model to our original dataset and the large data-volume, we investigate fast methods for generating such random graphs. We present methods that can generate such a random network in near-linear time, and show that these variants asymptotically share many key features of the CL-model, and also match the Portland social network.The structural results have been used to study the impact of policy decisions for controlling large-scale epidemics in urban environments.},
	isbn = {0-89871-558-X},
	url = {http://dl.acm.org/citation.cfm?id=982792.982902},
	author = {Eubank,Stephen and Kumar,V. S. Anil and Marathe,Madhav V. and Srinivasan, Aravind and Wang,Nan}
}
@article {12068,
	title = {Structure from motion of parallel lines},
	journal = {Computer Vision-ECCV 2004},
	year = {2004},
	month = {2004///},
	pages = {229 - 240},
	author = {Baker, P. and Aloimonos, J.}
}
@article {12714,
	title = {Structure from Motion Using Sequential Monte Carlo Methods},
	journal = {International Journal of Computer Vision},
	volume = {59},
	year = {2004},
	month = {2004///},
	pages = {5 - 31},
	abstract = {In this paper, the structure from motion (SfM) problem is addressed using sequential Monte Carlo methods. A new SfM algorithm based on random sampling is derived to estimate the posterior distributions of camera motion and scene structure for the perspective projection camera model. Experimental results show that challenging issues in solving the SfM problem, due to erroneous feature tracking, feature occlusion, motion/structure ambiguity, mixed-domain sequences, mismatched features, and independently moving objects, can be well modeled and effectively addressed using the proposed method.},
	isbn = {0920-5691},
	url = {http://dx.doi.org/10.1023/B:VISI.0000020669.68126.4b},
	author = {Qian,Gang and Chellapa, Rama}
}
@article {13231,
	title = {Structure of applicable surfaces from single views},
	journal = {Computer Vision-ECCV 2004},
	year = {2004},
	month = {2004///},
	pages = {482 - 496},
	abstract = {The deformation of applicable surfaces such as sheets of paper satisfies the differential geometric constraints of isometry (lengths and areas are conserved) and vanishing Gaussian curvature. We show that these constraints lead to a closed set of equations that allow recovery of the full geometric structure from a single image of the surface and knowledge of its undeformed shape. We show that these partial differential equations can be reduced to the Hopf equation that arises in non-linear wave propagation, and deformations of the paper can be interpreted in terms of the characteristics of this equation. A new exact integration of these equations is developed that relates the 3-D structure of the applicable surface to an image. The solution is tested by comparison with particular exact solutions. We present results for both the forward and the inverse 3D structure recovery problem.},
	author = {Gumerov, Nail A. and Zandifar,A. and Duraiswami, Ramani and Davis, Larry S.}
}
@article {14042,
	title = {A study of the pinna anthropometry and the spectral notch frequencies},
	journal = {The Journal of the Acoustical Society of America},
	volume = {116},
	year = {2004},
	month = {2004///},
	pages = {2625 - 2625},
	abstract = {The head-related transfer function (HRTF) varies significantly between individuals due to the different sizes and shapes of different anatomical parts like the pinnae, head, and torso. Applications in the creation of virtual auditory displays require individual HRTFs for perceptual fidelity. A generic HRTF would not work satisfactorily, since it has been shown that nonindividual HRTFs result in poor elevation perception. While good geometrical models exist for the effects of head, torso, and shoulders, a simple model for the pinna that connects the anthropometry to the features in the HRTF does not exist. One of the prominent cues contributed by the pinna are the sharp spectral notches, which encode the elevation of the sound source. Recently, we proposed a method to extract the frequencies of the pinna spectral notches from the HRTF. In this paper we study the relationship between the extracted notch frequency and pinna anthropometry. Based on these observations new approaches for HRTF customization can be developed. [The support of NSF Award ITR-0086075 is gratefully acknowledged.]},
	url = {http://link.aip.org/link/?JAS/116/2625/3},
	author = {Raykar,Vikas C. and Duraiswami, Ramani and Yegnanarayana,B.}
}
@conference {14761,
	title = {Studying code development for high performance computing: the HPCS program},
	booktitle = {First International Workshop On Software Engineering for High Performance Computing System Applications},
	year = {2004},
	month = {2004///},
	pages = {32 - 32},
	author = {Carver, J. and Asgari, S. and Basili, Victor R. and Hochstein, L. and Hollingsworth, Jeffrey K and Shull, F. and Zelkowitz, Marvin V}
}
@conference {13057,
	title = {Supervised clustering with the dirichlet process},
	booktitle = {NIPS{\textquoteright}04 Learning With Structured Outputs Workshop},
	year = {2004},
	month = {2004///},
	author = {Daum{\'e}, Hal and Marcu,D.}
}
@article {18437,
	title = {Susceptibility matrix: a new aid to software auditing},
	journal = {Security Privacy, IEEE},
	volume = {2},
	year = {2004},
	month = {2004/04//mar},
	pages = {16 - 21},
	abstract = {Testing for security is lengthy, complex, and costly, so focusing test efforts in areas that have the greatest number of security vulnerabilities is essential. This article describes a taxonomy-based approach that gives an insight into the distribution of vulnerabilities in a system.},
	keywords = {approach;, auditing;, data;, matrix;, of, program, Security, software, susceptibility, taxonomy-based, testing;, vulnerabilities;},
	isbn = {1540-7993},
	doi = {10.1109/MSECP.2004.1281240},
	author = {Jiwnani,K. and Zelkowitz, Marvin V}
}
@conference {19046,
	title = {The sybil attack in sensor networks: analysis \& defenses},
	series = {IPSN {\textquoteright}04},
	year = {2004},
	month = {2004},
	pages = {259 - 268},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack [6], where a node illegitimately claims multiple identities. This paper systematically analyzes the threat posed by the Sybil attack to wireless sensor networks. We demonstrate that the attack can be exceedingly detrimental to many important functions of the sensor network such as routing, resource allocation, misbehavior detection, etc. We establish a classification of different types of the Sybil attack, which enables us to better understand the threats posed by each type, and better design countermeasures against each type. We then propose several novel techniques to defend against the Sybil attack, and analyze their effectiveness quantitatively.},
	keywords = {Security, sensor networks, sybil attack},
	isbn = {1-58113-846-6},
	url = {http://doi.acm.org/10.1145/984622.984660},
	author = {Newsome, James and Elaine Shi and Song, Dawn and Perrig, Adrian}
}
@article {13867,
	title = {Symbolic MT With Statistical NLP Components},
	year = {2004},
	month = {2004/06//},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This reports provides an overview of the findings and software that have evolved from the "Symbolic MT with Statistical NLP Components" project over the last year. We present the major goals that have been achieved and discuss some of the open issues that we intend to address in the near future. This report also contains some details on the usage of some software that has been implemented during the project.},
	keywords = {*MACHINE TRANSLATION, computational linguistics, COMPUTER PROGRAMS, CYBERNETICS, DIVERGENCE UNRAVELING, GHMT(GENERATION-HEAVY MACHINE TRANSLATION), INFORMATION SCIENCE, linguistics, natural language, RESOURCE PROJECTION},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458796},
	author = {Dorr, Bonnie J and Habash,Nizar Y and Monz,Christof}
}
@conference {12694,
	title = {A system identification approach for video-based face recognition},
	booktitle = {Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on},
	volume = {4},
	year = {2004},
	month = {2004/08//},
	pages = {175 - 178 Vol.4 - 175 - 178 Vol.4},
	abstract = {The paper poses video-to-video face recognition as a dynamical system identification and classification problem. We model a moving face as a linear dynamical system whose appearance changes with pose. An autoregressive and moving average (ARMA) model is used to represent such a system. The choice of ARMA model is based on its ability to take care of the change in appearance while modeling the dynamics of pose, expression etc. Recognition is performed using the concept of sub space angles to compute distances between probe and gallery video sequences. The results obtained are very promising given the extent of pose, expression and illumination variation in the video data used for experiments.},
	keywords = {and, autoregressive, average, dynamical, Face, gallery, identification;, image, linear, model;, moving, processes;, processing;, recognition;, sequences;, signal, system, system;, video, video-based},
	doi = {10.1109/ICPR.2004.1333732},
	author = {Aggarwal,G. and Chowdhury, A.K.R. and Chellapa, Rama}
}
@conference {12393,
	title = {Systematic exploitation of data parallelism in hardware synthesis of DSP applications},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/05//},
	pages = {V - 229-32 vol.5 - V - 229-32 vol.5},
	abstract = {We describe an approach that we have explored for low-power synthesis and optimization of image, video, and digital signal processing (DSP) applications. In particular, we consider the systematic exploitation of data parallelism across the operations of an application dataflow graph when synthesizing a dedicated hardware implementation. Data parallelism occurs commonly in DSP applications, and provides flexible opportunities to increase throughput or lower power consumption. Exploiting this parallelism in a dedicated hardware implementation comes at the expense of increased resource requirements, which must be balanced carefully when applying the technique in a design tool. We propose a high level synthesis algorithm to determine the data parallelism factor for each computation, and, based on the area and performance trade-off curve, design an efficient hardware representation of the dataflow graph. For performance estimation, our approach uses a cyclostatic dataflow intermediate representation of the hardware structure under synthesis. We then apply an automatic hardware generation framework to build the actual circuit.},
	keywords = {area-performance trade-off curve, automatic Verilog code generation, circuit optimisation, data flow graphs, data parallelism, dedicated hardware implementation synthesis, design tool, Digital signal processing, DSP applications, embedded systems, hardware description languages, hardware synthesis, high level synthesis, high level synthesis algorithm, IMAGE PROCESSING, PARALLEL PROCESSING, power consumption, Signal processing, synchronous dataflow graph, video processing},
	doi = {10.1109/ICASSP.2004.1327089},
	author = {Sen,M. and Bhattacharyya, Shuvra S.}
}
@conference {12354,
	title = {Systematic Integration of Parameterized Local Search Techniques in Evolutionary Algorithms},
	booktitle = {Genetic and Evolutionary Computation{\textendash}GECCO 2004},
	year = {2004},
	month = {2004///},
	pages = {383 - 384},
	author = {Bambha,N. K and Bhattacharyya, Shuvra S. and Teich,J. and Zitzler,E.}
}
@article {14729,
	title = {Safe and flexible memory management in Cyclone},
	journal = {Technical Reports from UMIACS},
	year = {2003},
	month = {2003/08/01/undef},
	abstract = {Cyclone is a type-safe programming language intended for applications requiring control over memory management. Our previous work on Cyclone included support for stack allocation, lexical region allocation, and a garbage-collected heap. We achieved safety (i.e., prevented dangling pointers) through a region-based type-and-effects system. This paper describes some new memory-management mechanisms that we have integrated into Cyclone: dynamic regions, unique pointers, and reference-counted objects. Our experience shows that these new mechanisms are well suited for the timely recovery of objects in situations where it is awkward to use lexical regions. Crucially, programmers can write reusable functions without unnecessarily restricting callers{\textquoteright} choices among the variety of memory-management options. To achieve this goal, Cyclone employs a combination of polymorphism and scoped constructs that temporarily let us treat objects as if they were allocated in a lexical region.},
	author = {Hicks, Michael W. and Morrisett,G. and Grossman,D. and Jim,T.}
}
@conference {13269,
	title = {A scalable data structure for three-dimensional non-manifold objects},
	booktitle = {Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing},
	series = {SGP {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {72 - 82},
	publisher = {Eurographics Association},
	organization = {Eurographics Association},
	address = {Aire-la-Ville, Switzerland, Switzerland},
	abstract = {In this paper, we address the problem of representing and manipulating non-manifold, mixed-dimensional objects described by three-dimensional simplicial complexes embedded in the 3D Euclidean space. We describe the design and the implementation of a new data structure, that we call the non-manifold indexed data structure with adjacencies (NMIA), which can represent any three-dimensional Euclidean simplicial complex compactly, since it encodes only the vertices and the top simplexes of the complex plus a restricted subset of topological relations among simplexes. The NMIA structure supports efficient traversal algorithms which retrieve topological relations in optimal time, and it scales very well to the manifold case. Here, we sketch traversal algorithms, and we compare the NMIA structure with data structures for manifold and regular 3D simplicial complexes.},
	isbn = {1-58113-687-0},
	url = {http://dl.acm.org/citation.cfm?id=882370.882380},
	author = {De Floriani, Leila and Hui,Annie}
}
@conference {13245,
	title = {Scalable image-based multi-camera visual surveillance system},
	booktitle = {Proceedings. IEEE Conference on Advanced Video and Signal Based Surveillance, 2003.},
	year = {2003},
	month = {2003/07//},
	pages = {205 - 212},
	abstract = {We describe the design of a scalable and wide coverage visual surveillance system. Scalability (the ability to add and remove cameras easily during system operation with minimal overhead and system degradation) is achieved by utilizing only image-based information for camera control. We show that when a pan-tilt-zoom camera pans and tilts, a given image point moves in a circular and a linear trajectory, respectively. We create a scene model using a plan view of the scene. The scene model makes it easy for us to handle occlusion prediction and schedule video acquisition tasks subject to visibility constraints. We describe a maximum weight matching algorithm to assign cameras to tasks that meet the visibility constraints. The system is illustrated both through simulations and real video from a 6-camera configuration.},
	keywords = {ACQUISITION, algorithm;, camera;, constraints;, feature, hidden, image-based, MATCHING, maximum, multi-camera, occlusion, pan-tilt-zoom, PLAN, prediction;, processing;, removal;, scalable, scheduling;, signal, Surveillance, surveillance;, system;, task, video, view;, visibility, visual, weight},
	doi = {10.1109/AVSS.2003.1217923},
	author = {Lim,Ser-Nam and Davis, Larry S. and Elgammal,A.}
}
@article {15074,
	title = {Scalable protocols for authenticated group key exchange},
	journal = {Advances in Cryptology-CRYPTO 2003},
	year = {2003},
	month = {2003///},
	pages = {110 - 125},
	abstract = {We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have been proposed; however, all provably-secure solutions thus far are not scalable and, in particular, require n rounds. Our main contribution is the first scalable protocol for this problem along with a rigorous proof of security in the standard model under the DDH assumption; our protocol uses a constant number of rounds and requires only O(1) modular exponentiations per user (for key derivation). Toward this goal and of independent interest, we first present a scalable compiler that transforms any group key-exchange protocol secure against a passive eavesdropper to an authenticated protocol which is secure against an active adversary who controls all communication in the network. This compiler adds only one round and O(1) communication (per user) to the original scheme. We then prove secure {\textemdash} against a passive adversary {\textemdash} a variant of the two-round group key-exchange protocol of Burmester and Desmedt. Applying our compiler to this protocol results in a provably-secure three-round protocol for authenticated group key exchange which also achieves forward secrecy.},
	doi = {10.1007/978-3-540-45146-4_7},
	author = {Katz, Jonathan and Yung,M.}
}
@article {15803,
	title = {Scaling symmetric positive definite matrices to prescribed row sums},
	journal = {Linear Algebra and its Applications},
	volume = {370},
	year = {2003},
	month = {2003/09/01/},
	pages = {185 - 191},
	abstract = {We give a constructive proof of a theorem of Marshall and Olkin that any real symmetric positive definite matrix can be symmetrically scaled by a positive diagonal matrix to have arbitrary positive row sums. We give a slight extension of the result, showing that given a sign pattern, there is a unique diagonal scaling with that sign pattern, and we give upper and lower bounds on the entries of the scaling matrix.},
	keywords = {Diagonal preconditioning, Homotopy, Matrix scaling, Positive definite matrices},
	isbn = {0024-3795},
	doi = {10.1016/S0024-3795(03)00387-2},
	url = {http://www.sciencedirect.com/science/article/pii/S0024379503003872},
	author = {O{\textquoteright}Leary,Dianne P.}
}
@conference {17530,
	title = {Scriptroute: A public Internet measurement facility},
	booktitle = {Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems-Volume 4},
	year = {2003},
	month = {2003///},
	pages = {17 - 17},
	author = {Spring, Neil and Wetherall,D. and Anderson,T.}
}
@article {14819,
	title = {A search engine for 3D models},
	journal = {ACM Trans. Graph.},
	volume = {22},
	year = {2003},
	month = {2003/01//},
	pages = {83 - 105},
	abstract = {As the number of 3D models available on the Web grows, there is an increasing need for a search engine to help people find them. Unfortunately, traditional text-based search techniques are not always effective for 3D data. In this article, we investigate new shape-based search methods. The key challenges are to develop query methods simple enough for novice users and matching algorithms robust enough to work for arbitrary polygonal models. We present a Web-based search engine system that supports queries based on 3D sketches, 2D sketches, 3D models, and/or text keywords. For the shape-based queries, we have developed a new matching algorithm that uses spherical harmonics to compute discriminating similarity measures without requiring repair of model degeneracies or alignment of orientations. It provides 46 to 245\% better performance than related shape-matching methods during precision--recall experiments, and it is fast enough to return query results from a repository of 20,000 models in under a second. The net result is a growing interactive index of 3D models available on the Web (i.e., a Google for 3D models).},
	keywords = {Search engine, shape matching, shape representation, shape retrieval},
	isbn = {0730-0301},
	doi = {10.1145/588272.588279},
	url = {http://doi.acm.org/10.1145/588272.588279},
	author = {Funkhouser,Thomas and Min,Patrick and Kazhdan,Michael and Chen,Joyce and Halderman,Alex and Dobkin,David and Jacobs, David W.}
}
@article {15839,
	title = {Searching large collections of recorded speech: A preliminary study},
	journal = {Proceedings of the American Society for Information Science and Technology},
	volume = {40},
	year = {2003},
	month = {2003///},
	pages = {330 - 339},
	author = {Kim,J. and Oard, Douglas and Soergel,D.}
}
@conference {15846,
	title = {Searching recorded speech based on the temporal extent of topic labels},
	booktitle = {AAAI Spring Symposium on Intelligent Multimedia Knowledge Management},
	year = {2003},
	month = {2003///},
	abstract = {Recorded speech poses unusual challenges for the de- sign of interactive end-user search systems. Automatic speech recognition is sufficiently accurate to support the automated components of interactive search sys- tems in some applications, but finding useful recordings among those nominated by the system can be difficult because listening to audio is time consuming and be- cause recognition errors and speech disfluencies make it difficult to mitigate that effect by skimming automatic transcripts. Support for rapid browsing based on su- pervised learning for automatic classification has shown promise, however, and a segment-then-label framework has emerged as the dominant paradigm for applying that technique to news broadcasts. This paper argues for a more general framework, which we call an activation matrix, that provides a flexible representation for the mapping between labels and time. Three approaches to the generation of activation matrices are briefly de- scribed, with the main focus of the paper then being the use of activation matrices to support search and selec- tion in interactive systems.},
	author = {Oard, Douglas and Leuski,A.}
}
@conference {16780,
	title = {SEB-tree: An approach to index continuously moving objects},
	booktitle = {Mobile Data Management},
	year = {2003},
	month = {2003///},
	pages = {340 - 344},
	author = {Song,Z. and Roussopoulos, Nick}
}
@article {17814,
	title = {Secure agents},
	journal = {Annals of Mathematics and Artificial Intelligence},
	volume = {37},
	year = {2003},
	month = {2003///},
	pages = {169 - 235},
	abstract = {With the rapid proliferation of software agents, there comes an increased need for agents to ensure that they do not provide data and/or services to unauthorized users. We first develop an abstract definition of what it means for an agent to preserve data/action security. Most often, this requires an agent to have knowledge that is impossible to acquire {\textendash} hence, we then develop approximate security checks that take into account, the fact that an agent usually has incomplete/approximate beliefs about other agents. We develop two types of security checks {\textendash} static ones that can be checked prior to deploying the agent, and dynamic ones that are executed at run time. We prove that a number of these problems are undecidable, but under certain conditions, they are decidable and (our definition of) security can be guaranteed. Finally, we propose a language within which the developer of an agent can specify her security needs, and present provably correct algorithms for static/dynamic security verification.},
	doi = {10.1023/A:1020233522878},
	author = {Bonatti,P. A and Kraus,S. and V.S. Subrahmanian}
}
@article {14653,
	title = {A secure PLAN},
	journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews},
	volume = {33},
	year = {2003},
	month = {2003/08//},
	pages = {413 - 426},
	abstract = {Active networks, being programmable, promise greater flexibility than current networks. Programmability, however, may introduce safety and security risks. This correspondence describes the design and implementation of a security architecture for the active network PLANet. Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN, with an environment of general-purpose service routines governed by trust management. In particular, a technique is used which expands or contracts a packet{\textquoteright}s service environment based on its level of privilege, termed namespace-based security. The design and implementation of an active-network firewall and virtual private network is used as an application of the security architecture. Measurements of the system show that the addition of the firewall imposes an approximately 34\% latency overhead and as little as a 6.7\% space overhead to incoming packets.},
	keywords = {active networks, active-network firewall, Authentication, Authorization, Contracts, cryptography, Environmental management, Extraterrestrial measurements, functionally restricted packet language, general-purpose service routines, Internet, latency overhead, namespace-based security, packet switching, PLANet, Planets, privilege level, programmable networks, Safety, safety risks, secure PLAN, security of data, security risks, trust management, two-level architecture, virtual private network, Virtual private networks, Web and internet services},
	isbn = {1094-6977},
	doi = {10.1109/TSMCC.2003.817347},
	author = {Hicks, Michael W. and Keromytis,A. D and Smith,J. M}
}
@conference {12078,
	title = {A secure service discovery protocol for MANET},
	booktitle = {14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003},
	volume = {1},
	year = {2003},
	month = {2003/09/07/10},
	pages = {502- 506 Vol.1 - 502- 506 Vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Service discovery technologies are exploited to enable services to advertise their existence in a dynamic way, and can be discovered, configured and used by other devices with minimum manual efforts. It plays an essential role in future network scenarios especially with development of mobile ad hoc network (MANET) and emergence of pervasive computing. Because MANET allows these devices to communicate dynamically without fixed infrastructure and centralized administration, it gives rise to the challenges of the service discovery techniques. In this paper, we present a dynamic service discovery infrastructure that uses XML to describe services and match using the semantic content of service descriptions for MANET. We believe that the architecture we have designed is a necessary component of service discovery in non-infrastructure network by further exploring the secure and performance issues of this infrastructure.},
	keywords = {ad hoc networks, centralized administration, Computer architecture, Computer science, dynamic service discovery infrastructure, Educational institutions, MANET, Manuals, mobile ad hoc network, Mobile ad hoc networks, Mobile computing, mobile radio, noninfrastructure network, Pervasive computing, Protocols, routing protocols, secure service discovery protocol, Security, service discovery techniques, service discovery technologies, telecommunication computing, telecommunication services, XML},
	isbn = {0-7803-7822-9},
	doi = {10.1109/PIMRC.2003.1264322},
	author = {Yuan Yuan and Arbaugh, William A.}
}
@inbook {16132,
	title = {Seeing the World Through Image Libraries},
	booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections},
	year = {2003},
	month = {2003///},
	pages = {47 - 47},
	publisher = {Morgan Kaufmann Publishers Inc.},
	organization = {Morgan Kaufmann Publishers Inc.},
	isbn = {978-1-55860-915-0},
	author = {North,C. and Shneiderman, Ben and Plaisant, Catherine and Kang,H. and Bederson, Benjamin B.}
}
@article {14104,
	title = {The sequence and analysis of Trypanosoma brucei chromosome II},
	journal = {Nucleic acids research},
	volume = {31},
	year = {2003},
	month = {2003///},
	pages = {4856 - 4856},
	author = {El-Sayed, Najib M. and Ghedin,E. and Song,J. and MacLeod,A. and Bringaud,F. and Larkin,C. and Wanless,D. and Peterson,J. and Hou,L. and Taylor,S. and others}
}
@article {15953,
	title = {Seven days in the life of a robotic agent},
	journal = {Innovative Concepts for Agent-Based Systems},
	year = {2003},
	month = {2003///},
	pages = {243 - 256},
	author = {Chong,W. and O{\textquoteright}Donovan-Anderson,M. and Okamoto,Y. and Perlis, Don}
}
@article {18995,
	title = {Sex-lethal splicing autoregulation in vivo: interactions between SEX-LETHAL, the U1 snRNP and U2AF underlie male exon skipping},
	journal = {DevelopmentDevelopment},
	volume = {130},
	year = {2003},
	month = {2003/02/01/},
	pages = {463 - 471},
	abstract = {Alternative splicing of the Sex-lethal pre-mRNA has long served as a model example of a regulated splicing event, yet the mechanism by which the female-specific SEX-LETHAL RNA-binding protein prevents inclusion of the translation-terminating male exon is not understood. Thus far, the only general splicing factor for which there is in vivo evidence for a regulatory role in the pathway leading to male-exon skipping is sans-fille (snf), a protein component of the spliceosomal U1 and U2 snRNPs. Its role, however, has remained enigmatic because of questions about whether SNF acts as part of an intact snRNP or a free protein. We provide evidence that SEX-LETHAL interacts with SANS-FILLE in the context of the U1 snRNP, through the characterization of a point mutation that interferes with both assembly into the U1 snRNP and complex formation with SEX-LETHAL. Moreover, we find that SEX-LETHAL associates with other integral U1 snRNP components, and we provide genetic evidence to support the biological relevance of these physical interactions. Similar genetic and biochemical approaches also link SEX-LETHAL with the heterodimeric splicing factor, U2AF. These studies point specifically to a mechanism by which SEX-LETHAL represses splicing by interacting with these key splicing factors at both ends of the regulated male exon. Moreover, because U2AF and the U1 snRNP are only associated transiently with the pre-mRNA during the course of spliceosome assembly, our studies are difficult to reconcile with the current model that proposes that the SEX-LETHAL blocks splicing at the second catalytic step, and instead argue that the SEX-LETHAL protein acts after splice site recognition, but before catalysis begins.},
	keywords = {Drosophila, SNF, Splicing regulation, SXL, U1 snRNP, U2AF},
	isbn = {0950-1991, 1477-9129},
	doi = {10.1242/dev.00274},
	url = {http://dev.biologists.org/content/130/3/463},
	author = {Nagengast,Alexis A. and Stitzinger,Shane M. and Tseng,Chin-Hsiu and Mount, Stephen M. and Salz,Helen K.}
}
@conference {12725,
	title = {Shape and motion driven particle filtering for human body tracking},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {3},
	year = {2003},
	month = {2003/07//},
	pages = {III - 61-4 vol.3 - III - 61-4 vol.3},
	abstract = {In this paper, we propose a method to recover 3D human body motion from a video acquired by a single static camera. In order to estimate the complex state distribution of a human body, we adopt the particle filtering framework. We present the human body using several layers of representation and compose the whole body step by step. In this way, more effective particles are generated and ineffective particles are removed as we process each layer. In order to deal with the rotational motion, the frequency of rotation is obtained using a preprocessing operation. In the preprocessing step, the variance of the motion field at each image is computed, and the frequency of rotation is estimated. The estimated frequency is used for the state update in the algorithm. We successfully track the movement of figure skaters in TV broadcast image sequence, and recover the 3D shape and motion of the skater.},
	keywords = {3D, body, broadcast, camera;, cameras;, estimation;, Filtering, framework;, human, image, MOTION, motion;, particle, processing;, rotational, sequence;, sequences;, signal, single, static, theory;, tracking;, TV, video},
	doi = {10.1109/ICME.2003.1221248},
	author = {Yamamoto, T. and Chellapa, Rama}
}
@article {18870,
	title = {SHOP2: An HTN planning system},
	journal = {J. Artif. Intell. Res. (JAIR)},
	volume = {20},
	year = {2003},
	month = {2003///},
	pages = {379 - 404},
	abstract = {The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.},
	url = {https://www.aaai.org/Papers/JAIR/Vol20/JAIR-2013.pdf},
	author = {Nau, Dana S. and Au,T. C and Ilghami,O. and Kuter,U. and Murdock,J. W. and Wu,D. and Yaman,F.}
}
@article {13249,
	title = {A Simple and Optimal Energy Surface Reconstruction Algorithm from Volumetric Data},
	journal = {Technical Reports from UMIACS},
	year = {2003},
	month = {2003/02/05/},
	abstract = {We describe a new method for building 3D surface meshes from volumetricimages, as are created in Magnetic Resonance Imaging (MRI). The method works
by first extracting the contours from the MRI data, and then using modified
polygon boolean operations to find difference polygons. The last step is
performed by applying a Constrained Delauny Triangulation (CDT) algorithm to
build a surface mesh. Since it is based on CDT, the mesh quality is usually
 very good. Moreover, the resulting triangular surface mesh is the optimal
one for surface interpolation. In case of undersampled images, the mesh
quality can be improved dramatically by inserting new Steiner points in to
the mesh. Thus the mesh can be made suitable for use in scientific
computation. Our method has the advantages of combining the generation and
optimization of the mesh in one step compared with other methods. These advantages are illustrated.
Also UMIACS-TR-2003-11
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1256},
	author = {Liu,Kexue and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {14050,
	title = {A simplified Newton method for the inverse orthotropic problem},
	booktitle = {Antennas and Propagation Society International Symposium, 2003. IEEE},
	volume = {1},
	year = {2003},
	month = {2003/06//},
	pages = {535 - 538 vol.1 - 535 - 538 vol.1},
	abstract = {We consider one of the most challenging inverse problems in electromagnetic scattering for inhomogeneous medium. We try to reconstruct the elements of a matrix from scattering data in an orthotropic medium. To solve the inverse problem, we implement a simplified Newton method and present some numerical results.},
	keywords = {algebra;, electromagnetic, inhomogeneous, inverse, matrix, matrix;, media;, medium;, method;, Newton, orthotropic, problem;, problems;, scattering;, wave},
	doi = {10.1109/APS.2003.1217514},
	author = {Seydou,F. and Seppanen,T. and Duraiswami, Ramani}
}
@conference {16896,
	title = {Simultaneous pose and correspondence determination using line features},
	booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on},
	volume = {2},
	year = {2003},
	month = {2003/06//},
	pages = {II-424 - II-431 vol.2 - II-424 - II-431 vol.2},
	abstract = {We present a new robust line matching algorithm for solving the model-to-image registration problem. Given a model consisting of 3D lines and a cluttered perspective image of this model, the algorithm simultaneously estimates the pose of the model and the correspondences of model lines to image lines. The algorithm combines softassign for determining correspondences and POSIT for determining pose. Integrating these algorithms into a deterministic annealing procedure allows the correspondence and pose to evolve from initially uncertain values to a joint local optimum. This research extends to line features the SoftPOSIT algorithm proposed recently for point features. Lines detected in images are typically more stable than points and are less likely to be produced by clutter and noise, especially in man-made environments. Experiments on synthetic and real imagery with high levels of clutter, occlusion, and noise demonstrate the robustness of the algorithm.},
	keywords = {algorithm;, algorithms;, annealing;, clutter;, cluttered, Computer, correspondence, detection;, determination;, deterministic, environment;, extraction;, feature, feature;, image, image;, imagery;, images;, joint, line, local, man-made, MATCHING, matching;, measurement;, model-to-image, noise;, occlusion;, optimum;, perspective, point, pose, position, problem;, processing;, real, realistic, registration, simulated, softassign;, SoftPOSIT, stereo, synthetic, vision;},
	doi = {10.1109/CVPR.2003.1211499},
	author = {David,P. and DeMenthon,D. and Duraiswami, Ramani and Samet, Hanan}
}
@conference {12732,
	title = {Simultaneous tracking and recognition of human faces from video},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003/04//},
	pages = {III - 225-8 vol.3 - III - 225-8 vol.3},
	abstract = {The paper investigates the interaction between tracking and recognition of human faces from video under a framework proposed earlier (Shaohua Zhou et al., Proc. 5th Int. Conf. on Face and Gesture Recog., 2002; Shaohua Zhou and Chellappa, R., Proc. European Conf. on Computer Vision, 2002), where a time series model is used to resolve the uncertainties in both tracking and recognition. However, our earlier efforts employed only a simple likelihood measurement in the form of a Laplacian density to deal with appearance changes between frames and between the observation and gallery images, yielding poor accuracies in both tracking and recognition when confronted by pose and illumination variations. The interaction between tracking and recognition was not well understood. We address the interdependence between tracking and recognition using a series of experiments and quantify the interacting nature of tracking and recognition.},
	keywords = {appearance, changes;, density;, Face, human, illumination, Laplacian, model;, optical, pose, processing;, recognition;, series, series;, signal, TIME, tracking;, variations;, video, video;},
	doi = {10.1109/ICASSP.2003.1199148},
	author = {Zhou,Shaohua and Chellapa, Rama}
}
@article {15027,
	title = {Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Range Counting},
	volume = {UMIACS-TR-2003-101},
	year = {2003},
	month = {2003/11/25/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {We present linear-space sublogarithmic algorithms for handling the {\emthree-dimensional dominance reporting problem} and the {\em
two-dimensional range counting problem}. Under the RAM model as described
in~[M.~L. Fredman and D.~E. Willard. {\textquoteleft}{\textquoteleft}Surpassing the information
theoretic bound with fusion trees{\textquoteright}{\textquoteright}, {\em Journal of Computer and System
Sciences}, 47:424--436, 1993], our algorithms achieve $O(\log n/\log\log
n+f)$ query time for 3-D dominance reporting, where $f$ is the number of
points reported, and $O(\log n/\log\log n)$ query time for 2-D range
counting case. We extend these results to any constant dimension $d$
achieving $O(n(\log n/\log\log n)^{d-3})$-space and $O((\log n/\log\log
)^{d-2}+f)$-query time for the reporting case and $O(n(\log n/\log\log 
n)^{d-2})$-space and $O((\log n/\log\log n)^{d-1})$ query time for the
counting case.
(UMIACS-TR-2003-101)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1318},
	author = {Shi,Qingmin and JaJa, Joseph F. and Mortensen,Christian}
}
@article {13253,
	title = {Special Issue on Visual Analysis of Human Movement},
	journal = {The International Journal of Robotics Research},
	volume = {22},
	year = {2003},
	month = {2003///},
	pages = {357 - 357},
	author = {Davis, Larry S. and Horaud,R.}
}
@book {14916,
	title = {Special section on perceptual organization in computer vision},
	year = {2003},
	month = {2003///},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	author = {Jacobs, David W. and Lindenbaum,M. and August,J. and Zucker,SW and Ben-Shahar,O. and Zucker,SW and Tuytelaars,T. and Turina,A. and Van Gool,L. and Mahamud,S.}
}
@conference {13650,
	title = {Sports Video Classification Using HMM},
	booktitle = {ICME},
	volume = {2},
	year = {2003},
	month = {2003///},
	pages = {345 - 348},
	author = {Gilbert,X. and Li,H. and David Doermann}
}
@conference {12208,
	title = {Starting an intergenerational technology design team: a case study},
	booktitle = {Proceedings of the 2003 conference on Interaction design and children},
	series = {IDC {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {51 - 58},
	publisher = {ACM},
	organization = {ACM},
	address = {Preston, England},
	abstract = {This paper presents a case study of the first three months of a new intergenerational design team with children ages 10--13. It discusses the research and design methods used for working with children of this age group, the challenges and opportunities of starting a new team, and the lessons learned.},
	keywords = {children, cooperative inquiry, design methods, educational applications, intergenerational design teams, participatory design},
	isbn = {1-58113-732-X},
	doi = {10.1145/953536.953545},
	author = {Knudtzon,Kendra and Druin, Allison and Kaplan,Nancy and Summers,Kathryn and Chisik,Yoram and Kulkarni,Rahul and Moulthrop,Stuart and Weeks,Holly and Bederson, Benjamin B.}
}
@conference {12744,
	title = {Statistical bias and the accuracy of 3d reconstruction from video},
	booktitle = {in International Journal of Computer Vision},
	year = {2003},
	month = {2003///},
	abstract = {The present state of the art in determining the error statistics in3D reconstruction from video concentrates on estimating the error covariance. A
different source of error which has not received much attention in the computer
vision community, but has been noted by psychophysicists, is the fact "that it
is hard to explain ... the existence of systematic biases in observers{\textquoteright} magnitude
estimation of perceived depth" (Todd, 1998). In this paper, we prove that the depth
estimate is statistically biased, derive a precise expression for it, and hypothesize
that our analysis can be a possible explanation for the experimental observations.
Many structure from motion (SfM) algorithms that reconstruct a scene from a video
sequence pose the problem in a linear least squares framework Ax = b. It is a well-
known fact that the least squares estimate is biased if the system matrix A is noisy.
In SfM, the matrix A contains the image coordinates, which are always difficult
to obtain precisely; thus it is expected that the structure and motion estimates in
such a formulation of the problem would be biased. Though previous authors have
analyzed the bias in 3D motion estimation from stereo, to the best of our knowledge,
the statistical bias in 3D reconstruction from video has not been studied in the vision
community. We show that even with a perfect motion estimate, the depth estimate
is statistically biased. Existing results on the minimum achievable variance of the
estimator are extended by deriving a generalized Cramer-Rao lower bound. Through
simulations, we demonstrate the effects of camera motion parameters on the bias
and give numerical examples to highlight the importance of compensating for it.
},
	author = {Chowdhury, A.R. and Chellapa, Rama}
}
@article {14260,
	title = {Statistical Bias Predicts Many Illusions},
	journal = {Journal of VisionJ Vis},
	volume = {3},
	year = {2003},
	month = {2003/10/22/},
	pages = {636 - 636},
	abstract = {There is a principle underlying visual computations that previously has not been recognized. This principle is about the effects of uncertainty. Many visual computations are estimation processes. Because of noise, and there are many sources of noise in the formation and processing of images, systematic errors occur in the estimation. In statistical terms we say the estimation is biased. To avoid the bias would require accurate estimation of the noise parameters, but this because of the large number of unknown parameters (the geometry and photometry of the changing scene) in general is not possible. Visual computations, which are estimation processes include the low level processes of feature extraction and the middle level processes of visual recovery. We hypothesize that the bias in the estimation of image features, that is points, lines, and image movement, is the main cause for most geometrical illusions as well as illusory motion patterns. Because of bias the location of image features is estimated erroneously and the appearance of patterns is altered. It is shown that many geometrical optical illusion patterns are such that the bias is highly pronounced. We analyzed the bias in visual shape recovery processes and found that it is consistent with what is empirically known about the estimation of shape. It has been observed from computational as well as psychophysical experiments, that for many configurations there is a tendency to underestimate the slant. The bias predicts this underestimation of slant. To demonstrate the power of the model we created illusory displays giving rise to erroneous shape estimation.},
	isbn = {, 1534-7362},
	doi = {10.1167/3.9.636},
	url = {http://www.journalofvision.org/content/3/9/636},
	author = {Ferm{\"u}ller, Cornelia}
}
@conference {12730,
	title = {Statistical Error Propagation in 3D Modeling From Monocular Video},
	booktitle = {Computer Vision and Pattern Recognition Workshop, 2003. CVPRW {\textquoteright}03. Conference on},
	volume = {8},
	year = {2003},
	month = {2003/06//},
	pages = {89 - 89},
	abstract = {A significant portion of recent research in computer vision has focused on issues related to sensitivity and robustness of existing techniques. In this paper, we study the classical structure from motion problem and analyze how the statistics representing the quality of the input video propagates through the reconstruction algorithm and affects the quality of the output reconstruction. Specifically, we show that it is possible to derive analytical expressions of the first and second order statistics (bias and error covariance) of the solution as a function of the statistics of the input. We concentrate on the case of reconstruction from a monocular video, where the small baseline makes any algorithm very susceptible to noise in the motion estimates from the video sequence. We derive an expression relating the error covariance of the reconstruction to the error covariance of the feature tracks in the input video. This is done using the implicit function theorem of real analysis and does not require strong statistical assumptions. Next, we prove that the 3D reconstruction is statistically biased, derive an expression for it and show that it is numerically significant. Combining these two results, we also establish a new bound on the minimum error in the depth reconstruction. We present the numerical significance of these analytical results on real video data.},
	doi = {10.1109/CVPRW.2003.10092},
	author = {RoyChowdhury,Amit and Chellapa, Rama}
}
@article {12736,
	title = {Statistical physical model for foliage clutter in ultra-wideband synthetic aperture radar images},
	journal = {Journal of the Optical Society of America AThe Journal of the Optical Society of America A},
	volume = {20},
	year = {2003},
	month = {2003/01/01/},
	pages = {32 - 39},
	abstract = {Analyzing foliage-penetrating (FOPEN) ultra-wideband synthetic aperture radar (SAR) images is a challenging problem owing to the noisy and impulsive nature of foliage clutter. Indeed, many target-detection algorithms for FOPEN SAR data are characterized by high false-alarm rates. In this work, a statistical{\textendash}physical model for foliage clutter is proposed that explains the presence of outliers in the data and suggests the use of symmetric alpha-stable (SαS) distributions for accurate clutter modeling. Furthermore, with the use of general assumptions of the noise sources and propagation conditions, the proposed model relates the parameters of the SαS model to physical parameters such as the attenuation coefficient and foliage density.},
	keywords = {IMAGE PROCESSING, Remote sensing and sensors},
	doi = {10.1364/JOSAA.20.000032},
	url = {http://josaa.osa.org/abstract.cfm?URI=josaa-20-1-32},
	author = {Banerjee,Amit and Chellapa, Rama}
}
@conference {17938,
	title = {Statistical point geometry},
	booktitle = {Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing},
	series = {SGP {\textquoteright}03},
	year = {2003},
	month = {2003///},
	pages = {107 - 115},
	publisher = {Eurographics Association},
	organization = {Eurographics Association},
	address = {Aire-la-Ville, Switzerland, Switzerland},
	abstract = {We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes of each point sample. We show how the statistical analysis of a densely sampled point model can be used to improve the geometry bandwidth bottleneck and to do randomized rendering without sacrificing visual realism. We first carry out a hierarchical principal component analysis (PCA) of the model. This stage partitions the model into compact local geometries by exploiting local coherence. Our scheme handles vertex coordinates, normals, and color. The input model is reconstructed and rendered using a probability distribution derived from the PCA analysis. We demonstrate the benefits of this approach in all stages of the graphics pipeline: (1) orders of magnitude improvement in the storage and transmission complexity of point geometry, (2) direct rendering from compressed data, and (3) view-dependent randomized rendering.},
	isbn = {1-58113-687-0},
	url = {http://dl.acm.org/citation.cfm?id=882370.882385},
	author = {Kalaiah,Aravind and Varshney, Amitabh}
}
@conference {12733,
	title = {Statistical shape theory for activity modeling},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003/04//},
	pages = {III - 493-6 vol.3 - III - 493-6 vol.3},
	abstract = {Monitoring activities in a certain region from video data is an important surveillance problem. The goal is to learn the pattern of normal activities and detect unusual ones by identifying activities that deviate appreciably from the typical ones. We propose an approach using statistical shape theory based on the shape model of D.G. Kendall et al. (see "Shape and Shape Theory", John Wiley and Sons, 1999). In a low resolution video, each moving object is best represented as a moving point mass or particle. In this case, an activity can be defined by the interactions of all or some of these moving particles over time. We model this configuration of the particles by a polygonal shape formed from the locations of the points in a frame and the activity by the deformation of the polygons in time. These parameters are learned for each typical activity. Given a test video sequence, an activity is classified as abnormal if the probability for the sequence (represented by the mean shape and the dynamics of the deviations), given the model, is below a certain threshold The approach gives very encouraging results in surveillance applications using a single camera and is able to identify various kinds of abnormal behavior.},
	keywords = {abnormal, activities, activity, analysis;, behavior;, classification;, data;, image, mass;, matching;, modeling;, monitoring;, moving, normal, particle;, pattern, pattern;, point, polygonal, probability;, problem;, processing;, sequence;, sequences;, SHAPE, shape;, signal, statistical, Surveillance, surveillance;, theory;, video},
	doi = {10.1109/ICASSP.2003.1199519},
	author = {Vaswani, N. and Chowdhury, A.R. and Chellapa, Rama}
}
@article {16410,
	title = {Statistical validation of spatial patterns in agent-based models},
	journal = {Proceedings of Agent Based Simulation},
	volume = {4},
	year = {2003},
	month = {2003///},
	abstract = {We present and evaluate an agent-based model(ABM) of land use change at the rural-urban fringe.
This paper is part of a project that links the ABM
to surveys of residential preferences and historical
patterns of development. Validation is an important
issue for such models and we discuss the use of
distributional phenomena as a method of validation.
We then highlight the ability of our ABM to gen-
erate two phenomena evident in empirical analysis
of urban development patterns: a power law rela-
tionship between frequency and cluster size and a
negative exponential relationship between density
and distance from city center. We discuss these
results in the light of validation of ABMs.
},
	author = {Rand, William and Brown,D.G. and Page,S.E. and Riolo,R and Fernandez,L.E. and Zellner,M}
}
@conference {18805,
	title = {A Step Towards Automated Design of Rotary-Platen Multi-Shot Molds},
	volume = {2003},
	year = {2003},
	month = {2003///},
	pages = {343 - 354},
	publisher = {ASME},
	organization = {ASME},
	address = {Chicago, Illinois, USA},
	abstract = {This paper describes an improved algorithm for automated design of rotary-platen type of multi-shot molds for manufacturing multi-material objects. The algorithm described in this paper accounts for geometric constraints resulting from the rotary-platen process and it can handle significantly more complex interfaces. Our algorithm works in the following manner. First, we classify the multi-material object into several basic types based on the relationships among different single material components in the object. For every basic type, we find a manufacturing sequence based on the precedence constraints resulting due to accessibility and disassembly requirements. Then, starting from the last mold stage, we generate the mold pieces for every mold stage based on the manufacturing sequence. We expect that the algorithm described in this paper will provide the necessary foundations for automating the design of rotary-platen molds and therefore will help in significantly reducing the mold manufacturing lead-time associated with these types of molds.},
	isbn = {0-7918-3701-7},
	doi = {10.1115/DETC2003/DFM-48168},
	url = {http://link.aip.org/link/ASMECP/v2003/i37017a/p343/s1\&Agg=doi},
	author = {Li,Xuejun and Gupta, Satyandra K.}
}
@article {12743,
	title = {Stochastic Approximation and Rate-Distortion Analysis for Robust Structure and Motion Estimation},
	journal = {International Journal of Computer Vision},
	volume = {55},
	year = {2003},
	month = {2003///},
	pages = {27 - 53},
	abstract = {Recent research on structure and motion recovery has focused on issues related to sensitivity and robustness of existing techniques. One possible reason is that in practical applications, the underlying assumptions made by existing algorithms are often violated. In this paper, we propose a framework for 3D reconstruction from short monocular video sequences taking into account the statistical errors in reconstruction algorithms. Detailed error analysis is especially important for this problem because the motion between pairs of frames is small and slight perturbations in its estimates can lead to large errors in 3D reconstruction. We focus on the following issues: physical sources of errors, their experimental and theoretical analysis, robust estimation techniques and measures for characterizing the quality of the final reconstruction. We derive a precise relationship between the error in the reconstruction and the error in the image correspondences. The error analysis is used to design a robust, recursive multi-frame fusion algorithm using {\textquotedblleft}stochastic approximation{\textquotedblright} as the framework since it is capable of dealing with incomplete information about errors in observations. Rate-distortion analysis is proposed for evaluating the quality of the final reconstruction as a function of the number of frames and the error in the image correspondences. Finally, to demonstrate the effectiveness of the algorithm, examples of depth reconstruction are shown for different video sequences.},
	isbn = {0920-5691},
	url = {http://dx.doi.org/10.1023/A:1024488407740},
	author = {Chowdhury,Amit K. Roy and Chellapa, Rama}
}
@article {14384,
	title = {Structure discovery using statistical relational learning},
	journal = {Data Engineering},
	volume = {51},
	year = {2003},
	month = {2003///},
	pages = {10 - 10},
	abstract = {Statistical relational learning is a newly emerging area of machine learning that combines statisticalmodeling with relational representations. Here we argue that it provides a unified framework for the
discovery of structural information that can be exploited by a data management system. The categories
of structure that can be discovered include: instance-level dependencies and correlations, for example
intra-table column dependencies and inter-table join dependencies; record linkages and duplicates; and
schema matching and schema discovery from unstructured and semi-structured data.
},
	author = {Getoor, Lise}
}
@article {17387,
	title = {Supporting statistical electronic table usage by citizens},
	journal = {Commun. ACM},
	volume = {46},
	year = {2003},
	month = {2003/01//},
	pages = {52 - 54},
	abstract = {Over 70 agencies at the federal level are charged with collecting data and producing and disseminating statistics. These statistics are used to inform government policy, shape health care initiatives, provide information on the state of the economy, and others. They also have significant impact on the lives of citizens who use the statistics, for example, to determine job opportunities, changes in social security benefits, and quality of life in particular areas. Our digital government project developed several specific technologies to support the location, manipulation, and understanding of a quintessential format for statistical information---the table.},
	isbn = {0001-0782},
	doi = {10.1145/602421.602449},
	url = {http://doi.acm.org/10.1145/602421.602449},
	author = {Hert,Carol A. and Liddy,Elizabeth D. and Shneiderman, Ben and Marchionini,Gary}
}
@article {15844,
	title = {The surprise language exercises},
	journal = {ACM Transactions on Asian Language Information Processing},
	volume = {2},
	year = {2003},
	month = {2003/06/01/},
	pages = {79 - 84},
	isbn = {15300226},
	doi = {10.1145/974740.974741},
	url = {http://dl.acm.org/citation.cfm?id=974741},
	author = {Oard, Douglas}
}
@article {12430,
	title = {A Survey of Shape Similarity Assessment Algorithms for Product Design and Manufacturing Applications},
	journal = {Journal of Computing and Information Science in EngineeringJ. Comput. Inf. Sci. Eng.},
	volume = {3},
	year = {2003},
	month = {2003/06/00/},
	pages = {109 - 118},
	keywords = {CAD, computational geometry, production engineering computing, spatial reasoning},
	doi = {10.1115/1.1577356},
	url = {http://link.aip.org/link/?CIS/3/109/1},
	author = {Cardone, Antonio and Gupta, Satyandra K. and Karnik,Mukul}
}
@article {18749,
	title = {A system for generating process and material selection advice during embodiment design of mechanical components},
	journal = {Journal of manufacturing systems},
	volume = {22},
	year = {2003},
	month = {2003///},
	pages = {28 - 45},
	abstract = {This paper describes a systematic approach to material and process selection during theembodiment design of mechanical components and a system for generating process and material
selection advice. Quite often during the embodiment design stage, design requirements are not
precisely defined. Therefore, the system described in this paper accounts for imprecision in
design requirements during generation and evaluation of alternative process sequences and
material options. To reduce the computational effort, the system uses a depth-first branch-and-
bound search algorithm. This aids in exploring promising process sequences and material options
that can be used to meet the given set of design requirements. Various process sequences and
material options are evaluated by using a commercial cost estimation tool.
},
	url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/backup/pub/Publication/JMS03_Gupta.pdf},
	author = {Gupta,S.K. and Chen,Y. and Feng,S. and Sriram,R.}
}
@article {12309,
	title = {Scalable application layer multicast},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {32},
	year = {2002},
	month = {2002/08//},
	pages = {205 - 217},
	abstract = {We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data delivery trees with desirable properties.We present extensive simulations of both our protocol and the Narada application-layer multicast protocol over Internet-like topologies. Our results show that for groups of size 32 or more, our protocol has lower link stress (by about 25\%), improved or similar end-to-end latencies and similar failure recovery properties. More importantly, it is able to achieve these results by using orders of magnitude lower control traffic.Finally, we present results from our wide-area testbed in which we experimented with 32-100 member groups distributed over 8 different sites. In our experiments, average group members established and maintained low-latency paths and incurred a maximum packet loss rate of less than 1\% as members randomly joined and left the multicast group. The average control overhead during our experiments was less than 1 Kbps for groups of size 100.},
	keywords = {application layer multicast, hierarchy, overlay networks, peer-to-peer systems, scalability},
	isbn = {0146-4833},
	doi = {10.1145/964725.633045},
	url = {http://doi.acm.org/10.1145/964725.633045},
	author = {Banerjee,Suman and Bhattacharjee, Bobby and Kommareddy,Christopher}
}
@conference {12306,
	title = {Scalable peer finding on the Internet},
	booktitle = {Global Telecommunications Conference, 2002. GLOBECOM {\textquoteright}02. IEEE},
	volume = {3},
	year = {2002},
	month = {2002/11//},
	pages = {2205 - 2209 vol.3 - 2205 - 2209 vol.3},
	abstract = {We consider the problem of finding nearby application peers over the Internet. We define a new peer-finding scheme (called Tiers) that scales to large application peer groups. Tiers creates a hierarchy of the peers, which allows an efficient and scalable solution to this problem. The scheme can be implemented entirely in the application-layer and does not require the deployment of either any additional measurement services, or well-known reference landmarks in the network. We present detailed evaluation of Tiers and compare it to one previously proposed scheme called Beaconing. Through analysis and detailed simulations on 10,000 node Internet-like topologies we show that Tiers achieves comparable or better performance with a significant reduction in control overheads for groups of size 32 or more.},
	keywords = {application, application-layer;, Beaconing;, CONTROL, finding;, Internet-like, Internet;, measurement, network, overhead, peer, peer-finding, peers;, protocol;, protocols;, reduction;, scalable, scheme;, services;, simulations;, solution;, Tiers;, topologies;, topology;},
	doi = {10.1109/GLOCOM.2002.1189023},
	author = {Banerjee,S. and Kommareddy,C. and Bhattacharjee, Bobby}
}
@article {12307,
	title = {Scalable secure group communication over IP multicast},
	journal = {Selected Areas in Communications, IEEE Journal on},
	volume = {20},
	year = {2002},
	month = {2002/10//},
	pages = {1511 - 1527},
	abstract = {We introduce and analyze a scalable rekeying scheme for implementing secure group communications Internet protocol multicast. We show that our scheme incurs constant processing, message, and storage overhead for a rekey operation when a single member joins or leaves the group, and logarithmic overhead for bulk simultaneous changes to the group membership. These bounds hold even when group dynamics are not known a priori. Our rekeying algorithm requires a particular clustering of the members of the secure multicast group. We describe a protocol to achieve such clustering and show that it is feasible to efficiently cluster members over realistic Internet-like topologies. We evaluate the overhead of our own rekeying scheme and also of previously published schemes via simulation over an Internet topology map containing over 280 000 routers. Through analysis and detailed simulations, we show that this rekeying scheme performs better than previous schemes for a single change to group membership. Further, for bulk group changes, our algorithm outperforms all previously known schemes by several orders of magnitude in terms of actual bandwidth usage, processing costs, and storage requirements.},
	keywords = {access, algorithm;, authentication;, Bandwidth, communication;, CONTROL, costs;, cryptography;, dynamics;, group, group;, Internet, Internet-like, Internet;, IP, logarithmic, map;, membership;, message, Multicast, multicast;, network, overhead;, PROCESSING, protocol, protocols;, rekeying, requirements;, routers;, routing;, scalable, secure, security;, server;, simulation;, storage, Telecommunication, topologies;, Topology, topology;, transport, usage;},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2002.803986},
	author = {Banerjee,S. and Bhattacharjee, Bobby}
}
@conference {17859,
	title = {Scheduling multiple data visualization query workloads on a shared memory machine},
	booktitle = {Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM},
	year = {2002},
	month = {2002///},
	pages = {11 - 18},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimization techniques to batches of queries, in which portions of datasets as well as intermediate results are maintained in memory to speed up query evaluation. We present a dynamic query scheduling model based on a priority queue implementation using a directed graph and a strategy for ranking queries. We examine the relative performance of several ranking strategies on a shared-memory machine using two different versions of an application, called the Virtual Microscope, for browsing digitized microscopy images},
	keywords = {Atomic force microscopy, Biomedical informatics, Computer science, Data analysis, data visualisation, Data visualization, datasets, deductive databases, digitized microscopy image browsing, directed graph, directed graphs, dynamic query scheduling model, Educational institutions, high workloads, image database, limited resources, multiple data visualization query workloads, multiple query optimization, performance, priority queue, Processor scheduling, Query processing, query ranking, Relational databases, scheduling, shared memory machine, shared memory systems, Virtual Microscope, visual databases},
	isbn = {0-7695-1573-8},
	doi = {10.1109/IPDPS.2002.1015482},
	author = {Andrade,H. and Kurc, T. and Sussman, Alan and Saltz, J.}
}
@conference {14654,
	title = {A secure PLAN (extended version)},
	booktitle = {DARPA Active NEtworks Conference and Exposition, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {224 - 237},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Active networks promise greater flexibility than current networks, but threaten safety and security by virtue of their programmability. We describe the design and implementation of a security architecture for the active network PLANet (Hicks et al., 1999). Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN (Hicks et al., 1998), with an environment of general-purpose service routines governed by trust management (Blaze et al., 1996). In particular, we employ a technique which expands or contracts a packet{\textquoteright}s service environment based on its level of privilege, termed namespace-based security. As an application of our security architecture, we present the design and implementation of an active-network firewall. We find that the addition of the firewall imposes an approximately 34\% latency overhead and as little as a 6.7\% space overhead to incoming packets},
	keywords = {active internetwork, active networks, active-network firewall, Authentication, authorisation, Authorization, Cities and towns, Computer networks, Computer science, cryptography, functionally restricted packet language, general-purpose service routines, Information security, internetworking, IP networks, latency overhead, namespace-based security, PLAN, PLANet, Planets, programmability, Safety, security architecture, telecommunication security, trust management, two-level architecture, Web and internet services},
	isbn = {0-7695-1564-9},
	doi = {10.1109/DANCE.2002.1003496},
	author = {Hicks, Michael W. and Keromytis,A. D and Smith,J. M}
}
@article {18425,
	title = {Security Testing using a Susceptibility Matrix},
	journal = {International Symposioum on Software Reliability Engineering},
	volume = {13},
	year = {2002},
	month = {2002///},
	abstract = {Software testing is a cost effective method to detect faults insoftware. Similarly, Security testing is intended to assess
the trustworthiness of the security mechanisms and is often
regarded as a special case of system testing. The emphasis
of Security testing is not to establish the functional correctness
of the software but to establish some degree of confidence in
the security mechanisms. It is the single most common
technique for gaining assurance that a system operates within
the constraints of a given set of policies and mechanisms.
Presently, there is no systematic approach to security testing.
Our goal has been to devise a classification scheme to increase
testing effort in high-risk areas and help the software
community to get feedback to improve continuously.
},
	author = {Jiwnani,K. and Zelkowitz, Marvin V}
}
@conference {13641,
	title = {Segmentation and Identification of Handwriting in Noisy Documents},
	booktitle = {IAPRConference on Document Analysis System},
	year = {2002},
	month = {2002///},
	pages = {95 - 105},
	abstract = {In this paper we present an approach to the problem of segmenting and identifying handwritten annotations in noisy document images. In many types of documents such as correspondence, it is not uncommon for handwritten annotations to be added as part of a note, correction, clarification, or instruction, or a signature to appear as an authentication mark. It is important to be able to segment and identify such handwriting so we can 1) locate, interpret and re-trieve them efficiently in large document databases, and 2) use different algo-rithms for printed/handwritten text recognition and signature verification. Our approach consists of two processes: 1) a segmentation process, which divides the text into regions at an appropriate level (character, word, or zone), and 2) a classification process which identifies the segmented regions as handwritten. To determine the approximate region size where classification can be reliably per-formed, we conducted experiments at the character, word and zone level. We found that the reliable results can be achieved at the word level with a classifi-cation accuracy of 97.3\%. The identified handwritten text is further grouped into zones and verified to reduce false alarms. Experiments show our approach is promising and robust.},
	author = {Zheng,Y. and Li,H. and David Doermann}
}
@article {18934,
	title = {Semantics in the spin cycle Competence and performance criteria for the creation of lexical entries},
	journal = {The lexical basis of sentence processing: formal, computational, and experimental issues},
	volume = {4},
	year = {2002},
	month = {2002///},
	pages = {85 - 85},
	url = {http://books.google.com/books?hl=en\&lr=\&id=RChlfDBsiXcC\&oi=fnd\&pg=PA85\&dq=Amy+Weinberg\&ots=w6TBBAc0kg\&sig=gwoLdr3jhCMywPoYLey2JSg3Pa8},
	author = {Weinberg, Amy}
}
@article {18760,
	title = {Sheet metal bending: forming part families for generating shared press-brake setups},
	journal = {Journal of manufacturing systems},
	volume = {21},
	year = {2002},
	month = {2002///},
	pages = {329 - 349},
	abstract = {Sheet metal bending press-brakes can be setup to produce more than one type of part withoutrequiring a setup change. To exploit this flexibility, we need setup planning techniques so that
press-brake setups can be shared among many different parts. In this paper, we describe
algorithms for partitioning a given set of parts into setup compatible part families that can be
produced on the same setup. First, we present a greedy algorithm to form part family using a
bottom-up approach that makes use of the mixed integer linear programming formulation for
generating shared setups for each part family. Second, we present a mixed integer linear
programming formulation to generate a shared setup for a given set of parts if such a setup exists.
We expect that by producing many different types of parts on the same setup, we can significantly
reduce the number of setup operations, improve machine tool utilization and enable cost-effective
small-batch manufacturing.
},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.138.8249\&rep=rep1\&type=pdf},
	author = {Gupta,S.K. and Rajagopal,D.}
}
@conference {14779,
	title = {SIGMA: A Simulator Infrastructure to Guide Memory Analysis},
	booktitle = {SC Conference},
	year = {2002},
	month = {2002///},
	pages = {1 - 1},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {In this paper we present SIGMA (Simulation Infrastructure to Guide Memory Analysis), a new data collection framework and family of cache analysis tools. The SIGMA environment provides detailed cache information by gathering memory reference data using software-based instrumentation. This infrastructure can facilitate quick probing into the factors that influence the performance of an application by highlighting bottleneck scenarios including: excessive cache/TLB misses and inefficient data layouts. The tool can also assist in perturbation analysis to determine performance variations caused by changes to architecture or program. Our validation tests using the SPEC Swim benchmark show that most of the performance metrics obtained with SIGMA are within 1\% of the metrics obtained with hardware performance counters, with the advantage that SIGMA provides performance data on a data structure level, as specified by the programmer.},
	doi = {http://doi.ieeecomputersociety.org/10.1109/SC.2002.10055},
	author = {DeRose,Luiz and Ekanadham, K. and Hollingsworth, Jeffrey K and Sbaraglia, Simone}
}
@article {12961,
	title = {Simple Procedure for Rapid Identification of Vibrio Cholerae from the Aquatic Environment},
	journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.},
	volume = {68},
	year = {2002},
	month = {2002/02/01/},
	pages = {995 - 998},
	abstract = {Biochemical tests commonly used to screen for Vibrio cholerae in environmental samples were evaluated, and we found that a combination of alkaline peptone enrichment followed by streaking on thiosulfate citrate bile salts sucrose agar and testing for arginine dihydrolase activity and esculin hydrolysis was an effective rapid technique to screen for aquatic environmental V. cholerae. This technique provided 100\% sensitivity and >=70\% specificity.},
	isbn = {0099-2240, 1098-5336},
	doi = {10.1128/AEM.68.2.995-998.2002},
	url = {http://aem.asm.org/content/68/2/995},
	author = {Choopun,Nipa and Louis,Val{\'e}rie and Huq,Anwar and Rita R Colwell}
}
@conference {13272,
	title = {A Smale-like decomposition for discrete scalar fields},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {1},
	year = {2002},
	month = {2002///},
	pages = {184 - 187 vol.1 - 184 - 187 vol.1},
	abstract = {In this paper we address the problem of representing the structure of the topology of a d-dimensional scalar field as a basis for constructing a multiresolution representation of the structure of such afield. To this aim, we define a discrete decomposition of a triangulated d-dimensional domain, on whose vertices the values of the field are given. We extend a Smale decomposition, defined by Thom (1949) and Smale (1960) for differentiable functions, to the discrete case, to what we call a Smale-like decomposition. We introduce the notion of discrete gradient vector field, which indicates the growth of the scalar field and matches with our decomposition. We sketch an algorithm for building a Smale-like decomposition and a graph-based representation of this decomposition. We present results for the case of two-dimensional fields.},
	keywords = {data, decomposition;, differentiable, discrete, domain;, field;, fields;, functions;, gradient, graph-based, methods;, multidimensional, multiresolution, representation;, scalar, Smale-like, structure, Topology, triangulated, vector, visualisation;},
	doi = {10.1109/ICPR.2002.1044644},
	author = {De Floriani, Leila and Mesmoudi,M. M. and Danovaro,E.}
}
@conference {18302,
	title = {Smiling faces are better for face recognition},
	booktitle = {Fifth IEEE International Conference on Automatic Face and Gesture Recognition, 2002. Proceedings},
	year = {2002},
	month = {2002/05//},
	pages = {52 - 57},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper investigates face recognition during facial expressions. While face expressions have been treated as an adverse factor in standard face recognition approaches, our research suggests that, if a system has a choice in the selection of faces to use in training and recognition, its best performance would be obtained on faces displaying expressions. Naturally, smiling faces are the most prevalent (among expressive faces) for both training and recognition in dynamic scenarios. We employ a measure of discrimination power that is computed from between-class and within-class scatter matrices. Two databases are used to show the performance differences on different sets of faces},
	keywords = {between-class scatter matrices, Databases, discrimination power measure, dynamic scenarios, expressive faces, face recognition, facial expressions, performance, performance differences, smiling faces, software performance evaluation, Training, visual databases, within-class scatter matrices},
	isbn = {0-7695-1602-5},
	doi = {10.1109/AFGR.2002.1004132},
	author = {Yacoob,Yaser and Davis, Larry S.}
}
@conference {15643,
	title = {Space-efficient approximate Voronoi diagrams},
	booktitle = {Proceedings of the thiry-fourth annual ACM symposium on Theory of computing},
	series = {STOC {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {721 - 730},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {(MATH) Given a set $S$ of $n$ points in $\IR^d$, a {\em $(t,\epsilon)$-approximate Voronoi diagram (AVD)} is a partition of space into constant complexity cells, where each cell $c$ is associated with $t$ representative points of $S$, such that for any point in $c$, one of the associated representatives approximates the nearest neighbor to within a factor of $(1+\epsilon)$. Like the Voronoi diagram, this structure defines a spatial subdivision. It also has the desirable properties of being easy to construct and providing a simple and practical data structure for answering approximate nearest neighbor queries. The goal is to minimize the number and complexity of the cells in the AVD.(MATH) We assume that the dimension $d$ is fixed. Given a real parameter $\gamma$, where $2 \le \gamma \le 1/\epsilon$, we show that it is possible to construct a $(t,\epsilon)$-AVD consisting of \[O(n \epsilon^{\frac{d-1}{2}} \gamma^{\frac{3(d-1)}{2}} \log \gamma) \] cells for $t = O(1/(\epsilon \gamma)^{(d-1)/2})$. This yields a data structure of $O(n \gamma^{d-1} \log \gamma)$ space (including the space for representatives) that can answer $\epsilon$-NN queries in time $O(\log(n \gamma) + 1/(\epsilon \gamma)^{(d-1)/2})$. (Hidden constants may depend exponentially on $d$, but do not depend on $\epsilon$ or $\gamma$).(MATH) In the case $\gamma = 1/\epsilon$, we show that the additional $\log \gamma$ factor in space can be avoided, and so we have a data structure that answers $\epsilon$-approximate nearest neighbor queries in time $O(\log (n/\epsilon))$ with space $O(n/\epsilon^{d-1})$, improving upon the best known space bounds for this query time. In the case $\gamma = 2$, we have a data structure that can answer approximate nearest neighbor queries in $O(\log n + 1/\epsilon^{(d-1)/2})$ time using optimal $O(n)$ space. This dramatically improves the previous best space bound for this query time by a factor of $O(1/\epsilon^{(d-1)/2})$.(MATH) We also provide lower bounds on the worst-case number of cells assuming that cells are axis-aligned rectangles of bounded aspect ratio. In the important extreme cases $\gamma \in \{2, 1/\epsilon\}$, our lower bounds match our upper bounds asymptotically. For intermediate values of $\gamma$ we show that our upper bounds are within a factor of $O((1/\epsilon)^{(d-1)/2}\log \gamma)$ of the lower bound.},
	isbn = {1-58113-495-9},
	doi = {10.1145/509907.510011},
	url = {http://doi.acm.org/10.1145/509907.510011},
	author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave}
}
@conference {12209,
	title = {SpaceTree: Design evolution of a node link tree browser},
	booktitle = {Proc. InfoVis},
	year = {2002},
	month = {2002///},
	pages = {57 - 64},
	author = {Plaisant, Catherine and Grosjean,J. and Bederson, Benjamin B.}
}
@conference {16150,
	title = {SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation},
	booktitle = {Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {57 - 64},
	abstract = {We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.},
	keywords = {browser;, camera, data, design, diagrams;, dynamic, evolution;, experiment;, exploration;, filter, functions;, graphical, icons;, integrated, interfaces;, large, link, movement;, node, novel, optimized, rescaling;, search;, SpaceTree;, structures;, topology;, tree, user, visualisation;, visualization;},
	doi = {10.1109/INFVIS.2002.1173148},
	author = {Plaisant, Catherine and Grosjean,J. and Bederson, Benjamin B.}
}
@article {12032,
	title = {Spatio-temporal stereo using multi-resolution subdivision surfaces},
	journal = {International Journal of Computer Vision},
	volume = {47},
	year = {2002},
	month = {2002///},
	pages = {181 - 193},
	author = {Neumann, J. and Aloimonos, J.}
}
@article {16908,
	title = {Speeding up construction of PMR quadtree-based spatial indexes},
	journal = {The VLDB Journal},
	volume = {11},
	year = {2002},
	month = {2002/10//},
	pages = {109 - 137},
	abstract = {Spatial indexes, such as those based on the quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve spatial joins. In this paper we present a number of techniques for speeding up the construction of quadtree-based spatial indexes, specifically the PMR quadtree, which can index arbitrary spatial data. We assume a quadtree implementation using the {\textquotedblleft}linear quadtree{\textquotedblright}, a disk-resident representation that stores objects contained in the leaf nodes of the quadtree in a linear index (e.g., a B-tree) ordered based on a space-filling curve. We present two complementary techniques: an improved insertion algorithm and a bulk-loading method. The bulk-loading method can be extended to handle bulk-insertions into an existing PMR quadtree. We make some analytical observations about the I/O cost and CPU cost of our PMR quadtree bulk-loading algorithm, and conduct an extensive empirical study of the techniques presented in the paper. Our techniques are found to yield significant speedup compared to traditional quadtree building methods, even when the size of a main memory buffer is very small compared to the size of the resulting quadtrees.},
	keywords = {Bulk-loading, I/O, spatial indexing},
	isbn = {1066-8888},
	doi = {10.1007/s00778-002-0067-8},
	url = {http://dx.doi.org/10.1007/s00778-002-0067-8},
	author = {Hjaltason,Gisli R. and Samet, Hanan}
}
@conference {15288,
	title = {The START multimedia information system: Current technology and future directions},
	booktitle = {In Proceedings of the International Workshop on Multimedia Information Systems (MIS 2002)},
	year = {2002},
	month = {2002///},
	abstract = {To address the problem of information overload intoday{\textquoteright}s world, we have developed Start, a natural
language question answering system that provides
users with high-precision multimedia information ac-
cess through the use of natural language annota-
tions. To address the difficulty of accessing large
amounts of heterogeneous data, we have developed
Omnibase, which assists Start by integrating struc-
tured and semistructured Web databases into a sin-
gle, uniformly structured {\textquotedblleft}virtual database.{\textquotedblright} Our
ultimate goal is to develop a computer system that
acts like a {\textquotedblleft}smart reference librarian,{\textquotedblright} and we be-
lieve we have laid a firm foundation for achieving our
goal. This paper describes our current implemented
system and discusses future research directions.
},
	author = {Katz,B. and Jimmy Lin and Felshin,S.}
}
@article {17925,
	title = {State of the art in data representation for visualization},
	journal = {IEEE Visualization Tutorial},
	year = {2002},
	month = {2002///},
	author = {Chen,B. and Kaufman,A. and Mueller,K. and Varshney, Amitabh}
}
@conference {18804,
	title = {A Step Towards Automated Design of Multi-Piece Sacrificial Molds},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {337 - 347},
	publisher = {ASME},
	organization = {ASME},
	address = {Montreal, Quebec, Canada},
	abstract = {This paper describes a feature-based approach for design of multi-piece sacrificial molds. Our mold design algorithm consists of the following three steps. First, the desired gross mold shape is formed based on the feature-based description of the part geometry. Second, if the desired gross mold shape is not machinable as a single piece, the gross mold shape is decomposed into simpler geometric components to make sure that each component is manufacturable using 3-axis CNC machining. The decomposition is performed to ensure that each component is accessible to end-milling tools, and decomposed components can be assembled together to form the gross mold shape. Finally, assembly features are added to mold components to facilitate assembly of mold components and eliminate unnecessary degree of freedoms from the final mold assembly. We expect that our decomposition algorithm will provide a step towards the necessary foundations for automating the design of multi-piece mold and therefore will help in significantly reducing the mold design and manufacturing lead-time.},
	isbn = {0-7918-3623-1},
	doi = {10.1115/DETC2002/DFM-34188},
	url = {http://link.aip.org/link/ASMECP/v2002/i36231/p337/s1\&Agg=doi},
	author = {Dhaliwal,Savinder and Gupta, Satyandra K. and Huang,Jun and Kumar,Malay}
}
@article {15153,
	title = {Strong key-insulated signature schemes},
	journal = {Public Key Cryptography{\textemdash}PKC 2003},
	year = {2002},
	month = {2002///},
	pages = {130 - 144},
	abstract = {Signature computation is frequently performed on insecure devices{\textemdash}e.g., mobile phones {\textemdash} operating in an environment where the private (signing)k ey is likely to be exposed. Strong key-insulated signature schemes are one way to mitigate the damage done when this occurs. In the key-insulated model [6], the secret key stored on an insecure device is refreshed at discrete time periods via interaction with a physically-secure device which stores a {\textquotedblleft}master key{\textquotedblright}. All signing is still done by the insecure device, and the public key remains fixed throughout the lifetime of the protocol. In a strong (t,N)-key-insulated scheme, an adversary who compromises the insecure device and obtains secret keys for up to t periods is unable to forge signatures for any of the remaining N-t periods. Furthermore, the physically-secure device (or an adversary who compromises only this device)is unable to forge signatures for any time period.We present here constructions of strong key-insulated signature schemes based on a variety of assumptions. First, we demonstrate a generic construction of a strong (N{\textemdash} 1,N)-key-insulated signature scheme using any standard signature scheme. We then give a construction of a strong (t,N)-signature scheme whose security may be based on the discrete logarithm assumption in the random oracle model. This construction offers faster signing and verification than the generic construction, at the expense of O(t)k ey update time and key length. Finally, we construct strong (N {\textemdash}1,N)-key-insulated schemes based on any {\textquotedblleft}trapdoor signature scheme{\textquotedblright} (a notion we introduce here); our resulting construction in fact serves as an identity-based signature scheme as well. This leads to very efficient solutions based on, e.g., the RSA assumption in the random oracle model.
Work done in part while at DIMACS.
},
	doi = {10.1007/3-540-36288-6_10},
	author = {Dodis,Y. and Katz, Jonathan and Xu,S. and Yung,M.}
}
@article {18719,
	title = {Structural Properties of Polyubiquitin Chains in Solution},
	journal = {Journal of Molecular Biology},
	volume = {324},
	year = {2002},
	month = {2002/12/06/},
	pages = {637 - 647},
	abstract = {Because polyubiquitin chain structure modulates Ub-mediated signaling, knowledge of the physiological conformations of chain signals should provide insights into specific recognition. Here, we characterized the solution conformations of K48-linked Ub2 and Ub4 using a combination of NMR techniques, including chemical shift mapping of the interdomain interface, domain orientation measurements on the basis of 15N relaxation and residual dipolar couplings, and the solvent accessibility studies. Our data indicate a switch in the conformation of Ub2, from open to closed, with increasing pH. The closed conformation features a well-defined interface that is related to, but distinguishable from, that observed in the Ub2 crystal structure. This interface is dynamic in solution, such that important hydrophobic residues (L8, I44, V70) that are sequestered at the interface in the closed conformation may be accessible for direct interactions with recognition factors. Our results suggest that the distal two units of Ub4, which is the minimum signal for efficient proteasomal degradation, may adopt the closed Ub2 conformation.},
	keywords = {chemical shift mapping, domain orientation measurements, polyubiquitin chains, spin relaxation, ubiquitin},
	isbn = {0022-2836},
	doi = {10.1016/S0022-2836(02)01198-1},
	url = {http://www.sciencedirect.com/science/article/pii/S0022283602011981},
	author = {Varadan,Ranjani and Walker,Olivier and Pickart,Cecile and Fushman, David}
}
@article {12760,
	title = {Structure from Motion/Stereoscopic Vision/Surface Geometry/Shape-Bayesian Self-Calibration of a Moving Camera},
	journal = {Lecture Notes in Computer Science},
	volume = {2351},
	year = {2002},
	month = {2002///},
	pages = {277 - 293},
	author = {Qian, G. and Chellapa, Rama}
}
@conference {15897,
	title = {Supporting access to large digital oral history archives},
	booktitle = {Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries},
	series = {JCDL {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {18 - 27},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper describes our experience with the creation, indexing, and provision of access to a very large archive of videotaped oral histories - 116,000 hours of digitized interviews in 32 languages from 52,000 survivors, liberators, rescuers, and witnesses of the Nazi Holocaust. It goes on to identify a set of critical research issues that must be addressed if we are to provide full and detailed access to collections of this size: issues in user requirement studies, automatic speech recognition, automatic classification, segmentation, summarization, retrieval, and user interfaces. The paper ends by inviting others to discuss use of these materials in their own research.},
	keywords = {cataloging, oral history, research agenda},
	isbn = {1-58113-513-0},
	doi = {10.1145/544220.544224},
	url = {http://doi.acm.org/10.1145/544220.544224},
	author = {Gustman,Samuel and Soergel,Dagobert and Oard, Douglas and Byrne,William and Picheny,Michael and Ramabhadran,Bhuvana and Greenberg,Douglas}
}
@article {15935,
	title = {Symbol systems},
	journal = {Encyclopedia of Cognitive Science},
	year = {2002},
	month = {2002///},
	author = {Anderson,M. L and Perlis, Don}
}
@article {17973,
	title = {System and method for entering text in a virtual environment},
	volume = {:~09/364,433},
	year = {2002},
	month = {2002/06/18/},
	abstract = {A system and method for entering text in a virtual environment by sensory gloves. The user enters a key that represents one or more letters by simulating a press of a keyboard in the gloves. The user calibrates the gloves by entering text, during which time the system establishes threshold values that represent simulated presses for each finger. After the initial calibration of the sensory gloves, the user enters text with simulated finger presses. The system distinguishes which movements are intended as simulated finger presses by examining the relative motions of fingers and maintaining dynamic thresholds. Errors are alleviated by providing feedback to the user, such as beeps and a visual display of the fingers and the current text. Because keys may represent more than one character, the system determines the intended text by probabilistic analysis and the Viterbi algorithm.},
	url = {http://www.google.com/patents?id=w0QJAAAAEBAJ},
	author = {Evans,Francine and Skiena,Steven and Varshney, Amitabh},
	editor = {The Research Foundation of the State University of New York}
}
@inbook {14728,
	title = {Safe and Flexible Dynamic Linking of Native Code},
	booktitle = {Types in Compilation},
	series = {Lecture Notes in Computer Science},
	volume = {2071},
	year = {2001},
	month = {2001///},
	pages = {147 - 176},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We present the design and implementation of the first complete framework for flexible and safe dynamic linking of native code. Our approach extends Typed Assembly Language with a primitive for loading and typechecking code, which is flexible enough to support a variety of linking strategies, but simple enough that it does not significantly expand the trusted computing base. Using this primitive, along with the ability to compute with types, we show that we can program many existing dynamic linking approaches. As a concrete demonstration, we have used our framework to implement dynamic linking for a type-safe dialect of C, closely modeled after the standard linking facility for Unix C programs. Aside from the unavoidable cost of verification, our implementation performs comparably with the standard, untyped approach.},
	isbn = {978-3-540-42196-2},
	url = {http://dx.doi.org/10.1007/3-540-45332-6_6},
	author = {Hicks, Michael W. and Weirich,Stephanie and Crary,Karl},
	editor = {Harper,Robert}
}
@article {18274,
	title = {Secure Health Information Sharing System: SHARE},
	journal = {Proceedings of the AMIA SymposiumProc AMIA Symp},
	year = {2001},
	month = {2001///},
	pages = {1060 - 1060},
	isbn = {1531-605X},
	author = {M. Wu and Mui,Lik and Mohtashemi,Mojdeh and Szolovits,Peter}
}
@article {14364,
	title = {Selectivity estimation using probabilistic models},
	journal = {ACM SIGMOD Record},
	volume = {30},
	year = {2001},
	month = {2001/05//},
	pages = {461 - 472},
	abstract = {Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query processing. It arises in cost-based query optimization, query profiling, and approximate query answering. In this paper, we show how probabilistic graphical models can be effectively used for this task as an accurate and compact approximation of the joint frequency distribution of multiple attributes across multiple relations. Probabilistic Relational Models (PRMs) are a recent development that extends graphical statistical models such as Bayesian Networks to relational domains. They represent the statistical dependencies between attributes within a table, and between attributes across foreign-key joins. We provide an efficient algorithm for constructing a PRM front a database, and show how a PRM can be used to compute selectivity estimates for a broad class of queries. One of the major contributions of this work is a unified framework for the estimation of queries involving both select and foreign-key join operations. Furthermore, our approach is not limited to answering a small set of predetermined queries; a single model can be used to effectively estimate the sizes of a wide collection of potential queries across multiple tables. We present results for our approach on several real-world databases. For both single-table multi-attribute queries and a general class of select-join queries, our approach produces more accurate estimates than standard approaches to selectivity estimation, using comparable space and time.},
	isbn = {0163-5808},
	doi = {10.1145/376284.375727},
	url = {http://doi.acm.org/10.1145/376284.375727},
	author = {Getoor, Lise and Taskar,Benjamin and Koller,Daphne}
}
@article {16799,
	title = {Shared index scans for data warehouses},
	journal = {Data Warehousing and Knowledge Discovery},
	year = {2001},
	month = {2001///},
	pages = {307 - 316},
	author = {Kotidis1*,Y. and Sismanis,Y. and Roussopoulos, Nick}
}
@conference {15644,
	title = {A simple entropy-based algorithm for planar point location},
	booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms},
	series = {SODA {\textquoteright}01},
	year = {2001},
	month = {2001///},
	pages = {262 - 268},
	publisher = {Society for Industrial and Applied Mathematics},
	organization = {Society for Industrial and Applied Mathematics},
	address = {Philadelphia, PA, USA},
	abstract = {Given a planar polygonal subdivision S, point location involves preprocessing this subdivision into a data structure so that given any query point q, the cell of the subdivision containing q can be determined efficiently. Suppose that for each cell z in the subdivision, the probability pz that a query point lies within this cell is also given. The goal is to design the data structure to minimize the average search time. It has long been known that the entropy H of the probability distribution is the dominant term in the lower bound on the average-case search time. This problem has been considered before, but existing data structures are all quite complicated. In this paper, we show that a very simple modification of a well-known randomized incremental algorithm can be applied to produce a data structure of expected linear size that can answer point location queries in \&Ogr;(H) average time. We also present empirical evidence for the practical efficiency of this approach.},
	isbn = {0-89871-490-7},
	url = {http://dl.acm.org/citation.cfm?id=365411.365457},
	author = {Arya,Sunil and Malamatos,Theocharis and Mount, Dave}
}
@article {12800,
	title = {Simulation revisited},
	journal = {Tools and Algorithms for the Construction and Analysis of Systems},
	year = {2001},
	month = {2001///},
	pages = {480 - 495},
	author = {Tan,L. and Cleaveland, Rance}
}
@article {12156,
	title = {Software Defect Reduction Top 10 List},
	journal = {Computer},
	volume = {34},
	year = {2001},
	month = {2001/01//},
	pages = {135 - 137},
	abstract = {Software{\textquoteright}s complexity and accelerated development schedules make avoiding defects difficult. These 10 techniques can help reduce the flaws in your code.},
	isbn = {0018-9162},
	doi = {10.1109/2.962984},
	url = {http://dx.doi.org/10.1109/2.962984},
	author = {Boehm,Barry and Basili, Victor R.}
}
@article {16463,
	title = {Source Selection and Ranking in the WebSemantics Architecture Using Quality of Data Metadata-1 Introduction},
	journal = {Advances in Computers},
	volume = {55},
	year = {2001},
	month = {2001///},
	pages = {89 - 90},
	author = {Mihaila,G. A and Raschid, Louiqa and Vidal,M. E}
}
@article {13863,
	title = {Spanish Language Processing at University of Maryland: Building Infrastructure for Multilingual Applications},
	year = {2001},
	month = {2001///},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {We describe here our construction of lexical resources, tool creation, building of an alignedparallel corpus, and an approach to automatic treebank creation that we have been de-
veloping using Spanish data, based on projection of English syntactic dependency infor-
mation across a parallel corpus.
},
	author = {Cabezas,C. and Dorr, Bonnie J and Resnik, Philip}
}
@conference {14188,
	title = {A spherical eye from multiple cameras (makes better models of the world)},
	booktitle = {Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2001. CVPR 2001},
	volume = {1},
	year = {2001},
	month = {2001///},
	pages = {I-576- I-583 vol.1 - I-576- I-583 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The paper describes an imaging system that has been designed specifically for the purpose of recovering egomotion and structure from video. The system consists of six cameras in a network arranged so that they sample different parts of the visual sphere. This geometric configuration has provable advantages compared to small field of view cameras for the estimation of the system{\textquoteright}s own motion and consequently the estimation of shape models from the individual cameras. The reason is that inherent ambiguities of confusion between translation and rotation disappear. We provide algorithms for the calibration of the system and 3D motion estimation. The calibration is based on a new geometric constraint that relates the images of lines parallel in space to the rotation between the cameras. The 3D motion estimation uses a constraint relating structure directly to image gradients.},
	keywords = {3D motion estimation, Calibration, camera network, CAMERAS, Computer vision, egomotion recovery, geometric configuration, geometric constraint, image gradients, image sampling, imaging system, Laboratories, Layout, Motion estimation, multiple cameras, Pixel, Robot vision systems, SHAPE, shape models, Space technology, spherical eye, system calibration, video, video cameras, video signal processing, visual sphere sampling},
	isbn = {0-7695-1272-0},
	doi = {10.1109/CVPR.2001.990525},
	author = {Baker, P. and Ferm{\"u}ller, Cornelia and Aloimonos, J. and Pless, R.}
}
@conference {16434,
	title = {Statistical Analysis in Music Information Retrieval},
	booktitle = {Proceedings of the Second Annual International Symposium on Music Information Retrieval ISMIR 2001},
	volume = {25--26},
	year = {2001},
	month = {2001///},
	pages = {25 - 26},
	abstract = {We introduce a statistical model of music that allows for the retrieval of music based upon an audio input. This model uses frequency counts of state transitions to index pieces of music. Several methods of comparing these index values to choose an appropriate match are examined. We describe how this model can serve as the basis for a query-by-humming system. The model is also shown to be robust to several kinds of errors.},
	author = {Rand, William and Birmingham,William P.}
}
@inbook {14261,
	title = {Statistics Explains Geometrical Optical Illusions},
	booktitle = {Foundations of Image UnderstandingFoundations of Image Understanding},
	series = {The Kluwer International Series in Engineering and Computer Science},
	volume = {628},
	year = {2001},
	month = {2001///},
	pages = {409 - 445},
	publisher = {Springer US},
	organization = {Springer US},
	abstract = {Azriel Rosenfeld has been our mentor for the last decade. In everyday conversation he stressed the importance of intuition, the unreasonable effectiveness of mathematics in understanding the world, and the power of simplicity inherent in deep ideas. Because we mostly worked on 3D vision, he often argued that 2D vision has been, is, and will continue to be a large source of problems. Strangely enough, we arrived at this study, which is our first on 2D vision, through problems we encountered in our work in 3D motion and shape. Azriel Rosenfeld was also one of the first to apply statistics [ 27 , 28 ] to image analysis and understanding, and he always reminded us of the uncertainties involved in visual computations. This paper shows that statistics cannot be ignored, not even in the interpretation of two simple straight intersecting lines. It demonstrates that uncertainty in the visual data causes problems for the early visual processes. Because of noise, the estimation of features, such as lines, intersections of lines, and local image motion, is biased. The inevitability of this bias provides an explanation for many well-known geometrical optical illusions.},
	isbn = {978-1-4615-1529-6},
	url = {http://dx.doi.org/10.1007/978-1-4615-1529-6_14},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.},
	editor = {Davis, Larry S.}
}
@article {14170,
	title = {The Statistics of Optical Flow},
	journal = {Computer Vision and Image Understanding},
	volume = {82},
	year = {2001},
	month = {2001/04//},
	pages = {1 - 32},
	abstract = {When processing image sequences some representation of image motion must be derived as a first stage. The most often used representation is the optical flow field, which is a set of velocity measurements of image patterns. It is well known that it is very difficult to estimate accurate optical flow at locations in an image which correspond to scene discontinuities. What is less well known, however, is that even at the locations corresponding to smooth scene surfaces, the optical flow field often cannot be estimated accurately.Noise in the data causes many optical flow estimation techniques to give biased flow estimates. Very often there is consistent bias: the estimate tends to be an underestimate in length and to be in a direction closer to the majority of the gradients in the patch. This paper studies all three major categories of flow estimation methods{\textemdash}gradient-based, energy-based, and correlation methods, and it analyzes different ways of compounding one-dimensional motion estimates (image gradients, spatiotemporal frequency triplets, local correlation estimates) into two-dimensional velocity estimates, including linear and nonlinear methods.
Correcting for the bias would require knowledge of the noise parameters. In many situations, however, these are difficult to estimate accurately, as they change with the dynamic imagery in unpredictable and complex ways. Thus, the bias really is a problem inherent to optical flow estimation. We argue that the bias is also integral to the human visual system. It is the cause of the illusory perception of motion in the Ouchi pattern and also explains various psychophysical studies of the perception of moving plaids.
},
	isbn = {1077-3142},
	doi = {10.1006/cviu.2000.0900},
	url = {http://www.sciencedirect.com/science/article/pii/S1077314200909007},
	author = {Ferm{\"u}ller, Cornelia and Shulman,David and Aloimonos, J.}
}
@conference {16708,
	title = {Supervised sense tagging using support vector machines},
	booktitle = {Proceedings of the Second International Workshop on Evaluating Word Sense Disambiguation Systems (SENSEVAL-2)},
	year = {2001},
	month = {2001///},
	pages = {59 - 62},
	author = {Cabezas,C. and Resnik, Philip and Stevens,J.}
}
@article {17385,
	title = {Supporting creativity with advanced information-abundant user interfaces},
	journal = {Human-Centered Computing, Online Communities, and Virtual Environments},
	year = {2001},
	month = {2001///},
	pages = {469 - 480},
	author = {Shneiderman, Ben}
}
@article {14727,
	title = {Safe and Flexible Dynamic Linking of Native Code},
	year = {2000},
	month = {2000/01/01/},
	abstract = {We present the design and implementation of a framework for flexible and safe dynamic linking of native code. Our approach extends Typed Assembly Language with a primitive for loading and typechecking code, which is flexible enough to support a variety of linking strategies, but simple enough that it does not significantly expand the trusted computing base. Using this primitive, along with the ability to compute with types, we show that we can program many existing dynamic linking approaches. As a concrete demonstration, we have used our framework to implement dynamic linking for a type-safe dialect of C, closely modeled after the standard linking facility for Unix C programs. Aside from the unavoidable cost of verification, our implementation performs comparably with the standard, untyped approach.},
	url = {http://repository.upenn.edu/cis_reports/137},
	author = {Crary,Karl and Hicks, Michael W. and Weirich,Stephanie}
}
@inbook {14732,
	title = {Scalable Resource Control in Active Networks},
	booktitle = {Active NetworksActive Networks},
	series = {Lecture Notes in Computer Science},
	volume = {1942},
	year = {2000},
	month = {2000///},
	pages = {343 - 357},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The increased complexity of the service model relative to store-and-forward routers has made resource management one of the paramount concerns in active networking research and engineering. In this paper,we address two major challenges in scaling resource management-to-many-node active networks. The first is the use of market mechanisms and trading amongst nodes and programs with varying degrees of competition and cooperation to provide a scalable approach to managing active network resources. The second is the use of a trust-management architecture to ensure that the participants in the resource management marketplace have a policy-driven {\textquotedblleft}rule of law{\textquotedblright} in which marketplace decisions can be made and relied upon. We have used lottery scheduling and the Keynote trust-management system for our implementation, for which we provide some initial performance indications.},
	isbn = {978-3-540-41179-6},
	url = {http://dx.doi.org/10.1007/3-540-40057-5_25},
	author = {Anagnostakis,Kostas and Hicks, Michael W. and Ioannidis,Sotiris and Keromytis,Angelos and Smith,Jonathan},
	editor = {Yasuda,Hiroshi}
}
@article {12089,
	title = {Secure quality of service handling: SQoSH},
	journal = {IEEE Communications Magazine},
	volume = {38},
	year = {2000},
	month = {2000/04//},
	pages = {106 - 112},
	abstract = {Proposals for programmable network infrastructures, such as active networks and open signaling, provide programmers with access to network resources and data structures. The motivation for providing these interfaces is accelerated introduction of new services, but exposure of the interfaces introduces many new security risks. We describe some of the security issues raised by active networks. We then describe our secure active network environment (SANE) architecture. SANE was designed as a security infrastructure for active networks, and was implemented in the SwitchWare architecture. SANE restricts the actions that loaded modules can perform by restricting the resources that can be named; this is further extended to remote invocation by means of cryptographic credentials. SANE can be extended to support restricted control of quality of service in a programmable network element. The Piglet lightweight device kernel provides a {\textquotedblleft}virtual clock{\textquotedblright} type of scheduling discipline for network traffic, and exports several tuning knobs with which the clock can be adjusted. The ALIEN active loader provides safe access to these knobs to modules that operate on the network element. Thus, the proposed SQoSH architecture is able to provide safe, secure access to network resources, while allowing these resources to be managed by end users needing customized networking services. A desirable consequence of SQoSH{\textquoteright}s integration of access control and resource control is that a large class of denial-of-service attacks, unaddressed solely with access control and cryptographic protocols, can now be prevented},
	keywords = {Acceleration, Access control, active networks, ALIEN active loader, Clocks, Computer network management, cryptographic credentials, cryptography, customized networking services, Data security, Data structures, denial-of-service attacks, interfaces, Kernel, loaded modules, network resources, network traffic, open signaling, packet switching, Piglet lightweight device kernel, programmable network element, programmable network infrastructures, Programming profession, Proposals, quality of service, remote invocation, resource control, restricted control of quality of service, SANE, scheduling, scheduling discipline, secure active network environment architecture, secure quality of service handling, security infrastructure, security risks, SQoSH, SwitchWare architecture, telecommunication security, tuning knobs, virtual clock},
	isbn = {0163-6804},
	doi = {10.1109/35.833566},
	author = {Alexander,D. S and Arbaugh, William A. and Keromytis,A. D and Muir,S. and Smith,J. M}
}
@article {18863,
	title = {Selecting Flat End Mills for 2-1/2D Milling Operations},
	volume = {ISR; TR 2000-41},
	year = {2000},
	month = {2000///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {The size of milling cutter significantly affects the machining time. Therefore, in order to perform milling operations efficiently, we need to select a set of milling cutters with optimal sizes. It is difficult for human process planners to select the optimal or near optimal set of milling cutters due to complex geometric interactions among tools size, part shapes, and tool trajectories. <p>In this paper, we give a geometric algorithm to find the optimal cutters for 2-1/2D milling operations. We define the 2-1/2D milling operations as covering the target region without intersecting with the obstruction region. This definition allows us to handle the open edge problem. Based on this definition, we introduced the offsetting and inverse-offsetting algorithm to find the coverable area for a given cutter. Following that, we represent the cutter selection problem as shortest path problem and discuss the lower and upper bond of cutter sizes that are feasible for given parts. The Dijkstra{\textquoteright}s algorithm is used to solve the problem and thus a set of cutters is selected in order to achieve the optimum machining cost. <p>We believe the selection of optimum cutter combination can not only save manufacturing time but also help automatic process planning.},
	keywords = {algorithms, computer aided manufacturing CAM, cutter selection, Manufacturing, Next-Generation Product Realization Systems},
	url = {http://drum.lib.umd.edu//handle/1903/6138},
	author = {Yao,Zhiyang and Gupta, Satyandra K. and Nau, Dana S.}
}
@article {12808,
	title = {A semantic theory for heterogeneous system design},
	journal = {FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science},
	year = {2000},
	month = {2000///},
	pages = {312 - 324},
	author = {Cleaveland, Rance and L\{\"u}ttgen,G.}
}
@conference {16162,
	title = {Simulation based learning environments and the use of learning histories},
	booktitle = {CHI {\textquoteright}00 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}00},
	year = {2000},
	month = {2000///},
	pages = {2 - 3},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We have developed an application framework for constructing simulation-based learning environments using dynamic simulations and visualizations to represent realistic time-dependent behavior. The development environment is described and many examples are given. In particular we will focus on the learning historian which provides users and learners with a manipulatable recording of their actions which facilitates the exchange of annotated history records among peers and mentors.},
	keywords = {education, engineering, History, learning, simulation},
	isbn = {1-58113-248-4},
	doi = {10.1145/633292.633294},
	url = {http://doi.acm.org/10.1145/633292.633294},
	author = {Rose,A. and Salter,R. and Keswani,S. and Kositsyna,N. and Plaisant, Catherine and Rubloff,G. and Shneiderman, Ben}
}
@article {16651,
	title = {A SIMULATION ENVIRONMENT FOR EVOLVING MULTIAGENT COMMUNICATION},
	volume = {UMIACS-TR-2000-64},
	year = {2000},
	month = {2000/09/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {A simulation environment has been created to support study of emergentcommunication.  Multiple agents exist in a two-dimensional world where they 
must find food and avoid predators.  While non-communicating agents may 
survive, the world is configured so that survival and fitness can be enhanced 
through the use of inter-agent communication.  The goal with this version of 
the simulator is to determine conditions under which simple communication 
(signaling) emerges and persists during an evolutionary process.
(Also cross-referenced as UMIACS-TR-2000-64)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/1101},
	author = {Reggia, James A. and Schultz,Reiner and Uriagereka,Juan and Wilkinson,Jerry}
}
@conference {18464,
	title = {Smart videoconferencing},
	booktitle = {2000 IEEE International Conference on Multimedia and Expo, 2000. ICME 2000},
	volume = {3},
	year = {2000},
	month = {2000///},
	pages = {1597-1600 vol.3 - 1597-1600 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The combination of acoustical and video processing to achieve a smart audio and video feed from a set of N microphones and M cameras is a task that might conventionally be accomplished by camera persons and control room staff. However, in the context of videoconferencing, this process needs to be performed by control software. We discuss the use of a multi-camera multi-microphone set-up for unattended videoconferencing, and present details of a prototype implementation being developed},
	keywords = {acoustical processing, Automatic control, CAMERAS, computerised control, control software, Control systems, Intelligent sensors, Layout, Microphones, multi-camera multi-microphone set-up, multimedia systems, Protocols, prototype implementation, Prototypes, sensor fusion, smart videoconferencing, Switches, Teleconferencing, unattended videoconferencing, video processing},
	isbn = {0-7803-6536-4},
	doi = {10.1109/ICME.2000.871075},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Philomin,V. and Davis, Larry S.}
}
@conference {17361,
	title = {Snap-together visualization: a user interface for coordinating visualizations via relational schemata},
	booktitle = {Proceedings of the working conference on Advanced visual interfaces},
	series = {AVI {\textquoteright}00},
	year = {2000},
	month = {2000///},
	pages = {128 - 135},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Multiple coordinated visualizations enable users to rapidly explore complex information. However, users often need unforeseen combinations of coordinated visualizations that are appropriate for their data. Snap-Together Visualization enables data users to rapidly and dynamically mix and match visualizations and coordinations to construct custom exploration interfaces without programming. Snap{\textquoteright}s conceptual model is based on the relational database model. Users load relations into visualizations then coordinate them based on the relational joins between them. Users can create different types of coordinations such as: brushing, drill down, overview and detail view, and synchronized scrolling. Visualization developers can make their independent visualizations snap-able with a simple API.Evaluation of Snap revealed benefits, cognitive issues, and usability concerns. Data savvy users were very capable and thrilled to rapidly construct powerful coordinated visualizations. A snapped overview and detail-view coordination improved user performance by 30-80\%, depending on task.
},
	keywords = {Coordination, Information Visualization, multiple views, relational database, tight coupling, user interface, user study},
	isbn = {1-58113-252-2},
	doi = {10.1145/345513.345282},
	url = {http://doi.acm.org/10.1145/345513.345282},
	author = {North,Chris and Shneiderman, Ben}
}
@article {17363,
	title = {Snap-together visualization: can users construct and operate coordinated visualizations?},
	journal = {International Journal of Human-Computer Studies},
	volume = {53},
	year = {2000},
	month = {2000/11//},
	pages = {715 - 739},
	abstract = {Multiple coordinated visualizations enable users to rapidly explore complex information. However, users often need unforeseen combinations of coordinated visualizations. Snap-together visualization (Snap) enables users to rapidly and dynamically construct coordinated{\textendash}visualization interfaces, customized for their data, without programming. Users U001load data into desired visualizations, then construct coordinations between them for brushing and linking, overview and detail view, drill down, etc. Snap formalizes a conceptual model of visualization coordination based on the relational data model. Visualization developers can easily Snap-enable their independent visualizations using a simple API.Empirical evaluation reveals benefits, cognitive issues and usability concerns with coordination concepts and Snap. Two user studies explore coordination construction and operation. Data-savvy users successfully, enthusiastically and rapidly constructed powerful coordinated{\textendash}visualization interfaces of their own. Operating an overview-and-detail coordination reliably improved user performance by 30{\textendash}80\% over detail-only and uncoordinated interfaces for most tasks.
},
	isbn = {1071-5819},
	doi = {10.1006/ijhc.2000.0418},
	url = {http://www.sciencedirect.com/science/article/pii/S107158190090418X},
	author = {North,Chris and Shneiderman, Ben}
}
@article {17365,
	title = {Snap-together visualization: Evaluating coordination usage and construction},
	journal = {Int{\textquoteright}l Journal of Human-Computer Studies special issue on Empirical Studies of Information Visualization},
	volume = {53},
	year = {2000},
	month = {2000///},
	pages = {715 - 739},
	abstract = {Multiple coordinated visualizations enable users to rapidly explore complex information. However, users often need unforeseen combinations of coordinated visualizations. Snap-Together Visualization is a conceptual model, based on the relational model, and system to enable users to quickly coordinate otherwise-independent visualization tools. Users construct customized browsing environments with coordinations for selecting, navigating, and loading data, without programming.Evaluation revealed benefits, cognitive issues, and usability concerns with coordination concepts and the Snap system. Two user studies explore the value of coordination usage and the learnability of coordination construction. The overview and detail-view coordination improved user performance by 30-80\%, depending on task. Data savvy users were very capable and thrilled to rapidly construct powerful coordinated visualizations.
},
	author = {North,C. and Shneiderman, Ben}
}
@conference {14818,
	title = {Speed vs. Accuracy in Simulation for I/O-Intensive Applications},
	booktitle = {Parallel and Distributed Processing Symposium, International},
	year = {2000},
	month = {2000///},
	pages = {315 - 315},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {This paper presents a family of simulators that have been developed for data-intensive applications, and a methodology to select the most efficient one based on a user-supplied requirement for accuracy. The methodology consists of a series of tests that select an appropriate simulation based on the attributes of the application. In addition, each simulator provides two estimates of application execution time: one for the minimum expected time and the other for the maximum. We present the results of applying the strategy to existing applications and show that we can accurately simulate applications tens to hundreds of times faster than application execution time.},
	keywords = {discrete-event simulation, i/o-intensive applications, parallel or distributed applications, performance prediction, simulation},
	doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2000.846001},
	author = {Eom, Hyeonsang and Hollingsworth, Jeffrey K}
}
@conference {14267,
	title = {The statistics of optical flow: implications for the process of correspondence in vision},
	booktitle = {15th International Conference on Pattern Recognition, 2000. Proceedings},
	volume = {1},
	year = {2000},
	month = {2000///},
	pages = {119-126 vol.1 - 119-126 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper studies the three major categories of flow estimation methods: gradient-based, energy-based, and correlation methods; it analyzes different ways of compounding 1D motion estimates (image gradients, spatio-temporal frequency triplets, local correlation estimates) into 2D velocity estimates, including linear and nonlinear methods. Correcting for the bias would require knowledge of the noise parameters. In many situations, however, these are difficult to estimate accurately, as they change with the dynamic imagery in unpredictable and complex ways. Thus, the bias really is a problem inherent to optical flow estimation. We argue that the bias is also integral to the human visual system. It is the cause of the illusory perception of motion in the Ouchi pattern and also explains various psychophysical studies of the perception of moving plaids. Finally, the implication of the analysis is that flow or correspondence can be estimated very accurately only when feedback is utilized},
	keywords = {Bias, Computer vision, correlation, correlation methods, energy-based method, flow estimation, Frequency estimation, gradient method, gradient methods, Image analysis, Image motion analysis, Image sequences, least squares, least squares approximations, Motion estimation, Nonlinear optics, Optical feedback, optical flow, Optical harmonic generation, Optical noise, Statistics, Visual perception},
	isbn = {0-7695-0750-6},
	doi = {10.1109/ICPR.2000.905288},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {16163,
	title = {A storytelling robot for pediatric rehabilitation},
	booktitle = {Proceedings of the fourth international ACM conference on Assistive technologies},
	series = {Assets {\textquoteright}00},
	year = {2000},
	month = {2000///},
	pages = {50 - 55},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {children, design process, rehabilitation, robot, therapeutic play, user interface},
	isbn = {1-58113-313-8},
	doi = {10.1145/354324.354338},
	url = {http://doi.acm.org/10.1145/354324.354338},
	author = {Plaisant, Catherine and Druin, Allison and Lathan,Corinna and Dakhane,Kapil and Edwards,Kris and Vice,Jack Maxwell and Montemayor,Jaime}
}
@article {11968,
	title = {Structure from motion: Beyond the epipolar constraint},
	journal = {International Journal of Computer Vision},
	volume = {37},
	year = {2000},
	month = {2000///},
	pages = {231 - 258},
	author = {Brodsky, T. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {15903,
	title = {Structured translation for cross-language information retrieval},
	booktitle = {Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}00},
	year = {2000},
	month = {2000///},
	pages = {120 - 127},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The paper introduces a query translation model that reflects the structure of the cross-language information retrieval task. The model is based on a structured bilingual dictionary in which the translations of each term are clustered into groups with distinct meanings. Query translation is modeled as a two-stage process, with the system first determining the intended meaning of a query term and then selecting translations appropriate to that meaning that might appear in the document collection. An implementation of structured translation based on automatic dictionary clustering is described and evaluated by using Chinese queries to retrieve English documents. Structured translation achieved an average precision that was statistically indistinguishable from Pirkola{\textquoteright}s technique for very short queries, but Pirkola{\textquoteright}s technique outperformed structured translation on long queries. The paper concludes with some observations on future work to improve retrieval effectiveness and on other potential uses of structured translation in interactive cross-language retrieval applications.},
	isbn = {1-58113-226-3},
	doi = {10.1145/345508.345562},
	url = {http://doi.acm.org/10.1145/345508.345562},
	author = {Sperer,Ruth and Oard, Douglas}
}
@article {15337,
	title = {Subgrid-scale models for compressible large-eddy simulations},
	journal = {Theoretical and Computational Fluid Dynamics},
	volume = {13},
	year = {2000},
	month = {2000///},
	pages = {361 - 376},
	author = {Martin, M.P and Piomelli,U. and Candler,G. V}
}
@conference {13654,
	title = {Superresolution-based enhancement of text in digital video},
	booktitle = {Pattern Recognition, 2000. Proceedings. 15th International Conference on},
	volume = {1},
	year = {2000},
	month = {2000///},
	pages = {847 -850 vol.1 - 847 -850 vol.1},
	abstract = {We present a superresolution-based text enhancement scheme to improve optical character recognition (OCR) and readability of text in digital video. The quality of video text is degraded by factors such as low resolution, antialiasing, clutter and blurring. We use the fact that the same text string often exists in consecutive frames to explore the temporal information and enhance the text image. For graphic text, we register text blocks to subpixel accuracy and fuse them to a new block with high resolution and a cleaner background. We use a projection onto convex sets based method to deblur scene text to improve readability. Experimental results show our scheme can improve OCR for graphic text and readability for scene text significantly},
	keywords = {accuracy;superresolution-based, antialiasing;blurring;clutter;digital, based, character, convex, Enhancement, enhancement;image, information;text, method;readability;subpixel, onto, recognition;, resolution;image, resolution;projection, scheme;temporal, sequences;optical, sets, string;video, text, text;geometry;image, text;low, video;graphic},
	doi = {10.1109/ICPR.2000.905546},
	author = {Huiping Li and David Doermann}
}
@conference {17386,
	title = {Supporting creativity with powerful composition tools for artifacts and performances},
	booktitle = {Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, 2000},
	year = {2000},
	month = {2000/01/04/7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Modern software such as word processors, slide preparation/presentation tools, or music composition packages are designed to produce artifacts or performances. Now, some designers are expanding their goals to include creativity support into their software. This essay builds on the genex framework for creativity, which has four phases and eight activities. It focuses on the composition activity by considering tools to support initiation, revision, and evaluation. Some existing tools provide partial support that suggests ways in which to develop more ambitious low, middle, and high level tools. The goal is to enable more people to be more creative more of the time.},
	keywords = {artifacts, Artificial intelligence, composition tools, Computer science, Context modeling, creativity, creativity support, Educational institutions, Information retrieval, Laboratories, Manufacturing, music composition, performances, Software design, software libraries, software tools, US Department of Transportation},
	isbn = {0-7695-0493-0},
	doi = {10.1109/HICSS.2000.926896},
	author = {Shneiderman, Ben}
}
@article {15813,
	title = {Symbiosis between Linear Algebra and Optimization},
	journal = {Journal of Computational and Applied Mathematics},
	volume = {123},
	year = {2000},
	month = {2000///},
	pages = {447 - 465},
	abstract = {The efficiency and effectiveness of most optimization algorithms hinges on the numerical linearalgebra algorithms that they utilize. Effective linearalgebra is crucial to their success, and because of this, optimization applications have motivated fundamental advances in numerical linearalgebra. This essay will highlight contributions of numerical linearalgebra to optimization, as well as some optimization problems encountered within linearalgebra that contribute to a symbiotic relationship.},
	author = {O{\textquoteright}Leary, Dianne P.}
}
@conference {12323,
	title = {Systematic consolidation of input and output buffers in synchronous dataflow specifications},
	booktitle = {Signal Processing Systems, 2000. SiPS 2000. 2000 IEEE Workshop on},
	year = {2000},
	month = {2000///},
	pages = {673 - 682},
	author = {Murthy,P. K and Bhattacharyya, Shuvra S.}
}
@conference {12054,
	title = {Shape from Video},
	booktitle = {Computer Vision and Pattern Recognition, IEEE Computer Society Conference on},
	volume = {2},
	year = {1999},
	month = {1999///},
	pages = {2146 - 2146},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {This paper presents a novel technique for recovering the shape of a static scene from a video sequence due to a rigidly moving camera. The solution procedure consists of two stages. In the first stage, the rigid motion of the camera at each instant in time is recovered. This provides the transformation between successive viewing positions. The solution is achieved through new constraints which relate 3D motion and shape directly to the image derivatives. These constraints allow the combination of the processes of 3D motion estimation and segmentation by exploiting the geometry and statistics inherent in the data. In the second stage the scene surfaces are reconstructed through an optimization procedure which utilizes data from all the frames of a short video sequence. A number of experimental results demonstrate the potential of the approach.},
	keywords = {epipolar minimization, model extraction, Motion analysis, vision and graphics},
	doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.1999.784622},
	author = {Brodsky, Tomas and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@article {18738,
	title = {Sheet metal bending: generating shared setups},
	journal = {TRANSACTIONS-AMERICAN SOCIETY OF MECHANICAL ENGINEERS JOURNAL OF MANUFACTURING SCIENCE AND ENGINEERING},
	volume = {121},
	year = {1999},
	month = {1999///},
	pages = {689 - 694},
	abstract = {Contemporary process planners for sheet metal bending solve the process planning problemfor individual parts. Quite often, many different parts can be produced on shared setups.
However, plans generated by current process planning systems fail to exploit this commonality
between setups and try to generate optimal setups for individual parts. In this paper, we present
an algorithm for multi-part setup planning for sheet metal bending. This algorithm takes a set
of parts and operation sequences for these parts, and tries to find a shared setup plan that can
work for every part in the set. Setup changes constitute a major portion of the production time
in batch production environments. Therefore, multi-part setup planning techniques can be used
to significantly cut down the total number of setups and increase the overall through-put.
},
	url = {http://terpconnect.umd.edu/~skgupta/Publication/JMSE99_Gupta_draft.pdf},
	author = {Gupta,S.K. and Bourne,D. A.}
}
@article {18741,
	title = {Sheet metal bending operation planning: using virtual node generation to improve search efficiency},
	journal = {Journal of manufacturing systems},
	volume = {18},
	year = {1999},
	month = {1999///},
	pages = {127 - 139},
	abstract = {A large number of manufacturing operation planning problems can be formulatedas state-space search problems. In case of sheet-metal bending operation planning,
processing a search node involves extensive geometric reasoning. Such computation-
intensive node-processing limits the number of search nodes that can be expanded in
a reasonable amount of time, making it difficult to solve real-life operation planning
problems.
In this paper, we describe a scheme to speed up operation planning by virtual gen-
eration of state-space nodes. In this scheme, we eliminate unnecessary computation
at the time of node generation by extracting the required information from already
generated nodes. Although generation of two different search nodes rarely involves
identical computation steps, there is considerable overlap in node generation steps.
We have divided the node generation step into a number of computation subproblems.
When we need to generate a new node, we first try to see if any of the node gener-
ation subproblems have been solved for any of the already generated nodes. If any
subproblem has already been solved for some other node, then we use the solution of
that subproblem to save computation time. In such cases, we do not perform node
generation computation steps, and therefore we call such node generation virtual.
The scheme presented in this paper increases the node generation capability and
allows us to consider many more search nodes. The ability to consider more search
nodes helps us in solving more complex problems and finding better operation plans.
},
	url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/JMS99_Gupta_draft.pdf},
	author = {Gupta,S.K.}
}
@article {15024,
	title = {Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs)},
	journal = {Journal of Parallel and Distributed Computing},
	volume = {58},
	year = {1999},
	month = {1999/07//},
	pages = {92 - 108},
	abstract = {We describe a methodology for developing high performance programs running on clusters of SMP nodes. The SMP cluster programming methodology is based on a small prototype kernel (Simple) of collective communication primitives that make efficient use of the hybrid shared and message-passing environment. We illustrate the power of our methodology by presenting experimental results for sorting integers, two-dimensional fast Fourier transforms (FFT), and constraint-satisfied searching. Our testbed is a cluster of DEC AlphaServer 2100 4/275 nodes interconnected by an ATM switch.},
	keywords = {cluster computing, communication primitives, experimental parallel algorithms, message passing (MPI), Parallel algorithms, parallel performance, shared memory, symmetric multiprocessors (SMP)},
	isbn = {0743-7315},
	doi = {10.1006/jpdc.1999.1541},
	url = {http://www.sciencedirect.com/science/article/pii/S0743731599915411},
	author = {Bader,David A. and JaJa, Joseph F.}
}
@conference {13930,
	title = {Single display groupware: a model for co-present collaboration},
	booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit},
	year = {1999},
	month = {1999///},
	pages = {286 - 293},
	author = {Stewart,J. and Bederson, Benjamin B. and Druin, Allison}
}
@article {16368,
	title = {SIPR: A new framework for generating efficient code for sparse matrix computations},
	journal = {Languages and Compilers for Parallel Computing},
	year = {1999},
	month = {1999///},
	pages = {213 - 229},
	author = {Pugh, William and Shpeisman,T.}
}
@conference {17962,
	title = {Skip Strips: maintaining triangle strips for view-dependent rendering},
	booktitle = {Visualization {\textquoteright}99. Proceedings},
	year = {1999},
	month = {1999/10//},
	pages = {131 - 518},
	abstract = {View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, view-dependent simplification techniques have not been able to take full advantage of the underlying graphics hardware. Specifically, triangle strips are a widely used hardware-supported mechanism to compactly represent and efficiently render static triangle meshes. However, in a view-dependent framework, the triangle mesh connectivity changes at every frame, making it difficult to use triangle strips. We present a novel data structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications.},
	keywords = {(computer, Acceleration, acceleration;graphics, applications;path, applications;skip-list-like, changes;view-dependent, compression;rendering, connectivity;triangle, data, datasets;graphics, datasets;static, environments;data, equipment;data, graphic, Graphics, graphics);spatial, hardware;hardware-supported, hierarchy, manner;static, mechanism;immediate-mode, mesh, meshes;triangle, nodes;view-dependent, rendering;view-dependent, simplification;visualization;computer, Skip, Strips;complex, strips;vertex, structure;dynamic, structures;, techniques;retained-mode, triangle, visualisation;rendering},
	doi = {10.1109/VISUAL.1999.809877},
	author = {El-Sana,J. and Azanli,E. and Varshney, Amitabh}
}
@article {17364,
	title = {Snap-Together Visualization: Coordinating Multiple Views to Explore Information},
	journal = {Technical Reports from UMIACS},
	year = {1999},
	month = {1999/06/08/},
	abstract = {Information visualizations with multiple coordinated views enable users torapidly explore complex data and discover relationships.  However, it is 
usually difficult for users to find or create the coordinated visualizations 
they need.  Snap-Together Visualization allows users to coordinate multiple 
views that are customized to their needs. Users query their relational 
database and load results into desired visualizations. Then they specify 
coordinations between visualizations for selecting, navigating, or re-querying.
Developers can make independent visualization tools {\textquoteright}snap-able{\textquoteright} by including a 
few hooks.
Also cross-referenced as UMIACS-TR-99-28
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/1010},
	author = {North,Chris and Shneiderman, Ben}
}
@article {18715,
	title = {Solution Structure of the Proapoptotic Molecule BID: A Structural Basis for Apoptotic Agonists and Antagonists},
	journal = {Cell},
	volume = {96},
	year = {1999},
	month = {1999/03/05/},
	pages = {625 - 634},
	abstract = {Members of the BCL2 family of proteins are key regulators of programmed cell death, acting either as apoptotic agonists or antagonists. Here we describe the solution structure of BID, presenting the structure of a proapoptotic BCL2 family member. An analysis of sequence/structure of BCL2 family members allows us to define a structural superfamily, which has implications for general mechanisms for regulating proapoptotic activity. It appears two criteria must be met for proapoptotic function within the BCL2 family: targeting of molecules to intracellular membranes, and exposure of the BH3 death domain. BID{\textquoteright}s activity is regulated by a Caspase 8{\textendash}mediated cleavage event, exposing the BH3 domain and significantly changing the surface charge and hydrophobicity, resulting in a change of cellular localization.},
	isbn = {0092-8674},
	doi = {10.1016/S0092-8674(00)80573-5},
	url = {http://www.sciencedirect.com/science/article/pii/S0092867400805735},
	author = {McDonnell,James M and Fushman, David and Milliman,Curt L. and Korsmeyer,Stanley J. and Cowburn,David}
}
@conference {13649,
	title = {Special effect edit detection using VideoTrails: a comparison with existing techniques},
	booktitle = {Proceedings of SPIE - Conference on Storage and Retrieval for Image and Video Databases VII},
	year = {1999},
	month = {1999///},
	pages = {302 - 313},
	abstract = {Video Segmentation plays an integral role in many multimedia applications such as digital libraries, content management systems, and various other video browsing, indexing, and retrieval systems. Many algorithms for segmentation of video have appeared in the past few years, Most of these algorithms perform well on cuts, but yield poor performance on gradual transitions or special effect edits. A complete video segmentation system must achieve good performance on special effect edit detection also. In this paper, we discuss the performance of our VideoTrails based algorithms with other existing special effect edit detection algorithms in literature. Results from experiments testing for the ability to detect edits from TV programs ranging from commercials to news magazine programs, and also diverse special effect edits introduced by us have been shown.},
	author = {Kobla,V. and DeMenthon,D. and David Doermann}
}
@article {14735,
	title = {Specifying the PLAN Network Programming Langauge},
	journal = {Electronic Notes in Theoretical Computer Science},
	volume = {26},
	year = {1999},
	month = {1999///},
	pages = {87 - 104},
	abstract = {We discuss how the specification of the PLAN programming language supports the design objectives of the language. The specification aims to provide a mathematically precise operational semantics that can serve as a standard for implementing interpreters and portable programs. The semantics should also support proofs of key properties of PLAN that would hold of all conformant implementations. This paper discusses two such properties. (1) Type checking is required, but interpreters are given significant flexibility about when types are checked; the specification must support a clear description of the possible behaviors of a network of conformant implementations. (2) It is essential to have guarantees about how PLAN programs use global resources, but the specification must be flexible about extensions in the network service layer. We illustrate on of kind of issue that will arise in using to specification to prove properties of the network based on the choice of services.},
	isbn = {1571-0661},
	doi = {10.1016/S1571-0661(05)80285-3},
	url = {http://www.sciencedirect.com/science/article/pii/S1571066105802853},
	author = {Kakkar,Pankaj and Hicks, Michael W. and Moore,Jon and Gunter,Carl A.}
}
@conference {12774,
	title = {Statecharts via process algebra},
	booktitle = {CONCUR{\textquoteright}99: concurrency theory: 10th International Conference, Eindhoven, the Netherlands, August 24-27, 1999: proceedings},
	year = {1999},
	month = {1999///},
	pages = {399 - 399},
	author = {Liittgen,G. and Cleaveland, Rance}
}
@conference {11965,
	title = {Statistical biases in optic flow},
	booktitle = {Computer Vision and Pattern Recognition, 1999. IEEE Computer Society Conference on.},
	volume = {1},
	year = {1999},
	month = {1999///},
	pages = {566 Vol. 1 - 566 Vol. 1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The computation of optical flow from image derivatives is biased in regions of non uniform gradient distributions. A least-squares or total least squares approach to computing optic flow from image derivatives even in regions of consistent flow can lead to a systematic bias dependent upon the direction of the optic flow, the distribution of the gradient directions, and the distribution of the image noise. The bias a consistent underestimation of length and a directional error. Similar results hold for various methods of computing optical flow in the spatiotemporal frequency domain. The predicted bias in the optical flow is consistent with psychophysical evidence of human judgment of the velocity of moving plaids, and provides an explanation of the Ouchi illusion. Correction of the bias requires accurate estimates of the noise distribution; the failure of the human visual system to make these corrections illustrates both the difficulty of the task and the feasibility of using this distorted optic flow or undistorted normal flow in tasks requiring higher lever processing},
	keywords = {Distributed computing, Frequency domain analysis, HUMANS, image derivatives, Image motion analysis, Image sequences, Least squares methods, Motion estimation, Optical computing, Optical distortion, optical flow, Optical noise, Ouchi illusion, perception of motion, Psychology, Spatiotemporal phenomena, statistical analysis, systematic bias, total least squares},
	isbn = {0-7695-0149-4},
	doi = {10.1109/CVPR.1999.786994},
	author = {Ferm{\"u}ller, Cornelia and Pless, R. and Aloimonos, J.}
}
@article {13349,
	title = {A Study of the Structure of the Web},
	journal = {University of California, Berkeley},
	year = {1999},
	month = {1999///},
	abstract = {The World Wide Web is a huge, growing repository of information on a wide range of topics. It is alsobecoming important, commercially and sociologically, as a place of human interaction within different
communities.
In this paper we present an experimental study of the structure of the Web. We analyze link topologies
of various communities, and patterns of mirroring of content, on 1997 and 1999 snapshots of the Web.
Our results give insight into patterns of interaction within communities and how they evolve, as well as
patterns of data replication.
We also describe the techniques we have developed for performing complex processing on this large
data set, and our experiences in doing so. We present new algorithms for finding partial and complete
mirrors in URL hierarchies; these are also of independent interest for search and redirection. In order to
study and visualize link topologies of different communities, we have developed techniques to compact
these large link graphs without much information loss.
},
	author = {Deshpande, Amol and Huang,R. and Raman,V. and Riggs,T. and Song,D. and Subramanian,L.}
}
@article {15354,
	title = {Subgrid-scale model for the temperature fluctuations in reacting hypersonic turbulent flows},
	journal = {Physics of Fluids},
	volume = {11},
	year = {1999},
	month = {1999///},
	pages = {2765 - 2765},
	author = {Martin, M.P and Candler,G. V}
}
@article {16711,
	title = {Support for interactive document selection in cross-language information retrieval},
	journal = {Information Processing \& Management},
	volume = {35},
	year = {1999},
	month = {1999/05//},
	pages = {363 - 379},
	abstract = {As digital libraries grow to global scale, the provision of interactive access to content in many languages will become increasingly important. In systems that support query-based searching, the presence of multilingual content will affect both the search technology itself and the user interface components that support query formulation, document selection and query refinement. This article describes the interactions among these components and presents a practical way of evaluating the adequacy of the selection interface. A categorization-based model for the user{\textquoteright}s selection process is presented and an experimental methodology suitable for obtaining process centered results in this context is developed. The methodology is applied to assess the adequacy of a selection interface in which multiple candidate translations for a term can be simultaneously presented. The results indicate that the modeled selection process is somewhat less effective when users are presented with multi-translation glosses from Japanese to English rather than materials generated originally in English, but that users with access to the gloss translations substantially outperform a Naive Bayes classification algorithm.},
	isbn = {0306-4573},
	doi = {10.1016/S0306-4573(98)00066-1},
	url = {http://www.sciencedirect.com/science/article/pii/S0306457398000661},
	author = {Oard, Douglas and Resnik, Philip}
}
@inbook {13716,
	title = {A Survey of Current Paradigms in Machine Translation},
	booktitle = {Advances in Computers},
	volume = {Volume 49},
	year = {1999},
	month = {1999///},
	pages = {1 - 68},
	publisher = {Elsevier},
	organization = {Elsevier},
	abstract = {This paper is a survey of the current machine translation research in the US, Europe and Japan. A short history of machine translation is presented first, followed by an overview of the current research work. Representative examples of a wide range of different approaches adopted by machine translation researchers are presented. These are described in detail along with a discussion of the practicalities of scaling up these approaches for operational environments. In support of this discussion, issues in, and techniques for, evaluating machine translation systems are addressed.},
	isbn = {0065-2458},
	url = {http://www.sciencedirect.com/science/article/pii/S006524580860282X},
	author = {Dorr, Bonnie J and Jordan,Pamela W. and Benoit,John W.},
	editor = {Zelkowitz, Marvin V}
}
@article {13411,
	title = {A Survey of Research in Distributed, Continual Planning},
	journal = {AI Magazine},
	volume = {20},
	year = {1999},
	month = {1999/12/15/},
	pages = {13 - 13},
	isbn = {0738-4602},
	doi = {10.1609/aimag.v20i4.1475},
	url = {https://www.aaai.org/ojs/index.php/aimagazine/article/viewArticle/1475},
	author = {desJardins, Marie and Durfee,Edmund H and Ortiz,Jr. and Wolverton,Michael J}
}
@article {17548,
	title = {A survey of the role of multicommodity flow and randomization in network design and routing},
	journal = {American Mathematical Society, Series in Discrete Mathematics and Theoretical Computer Science},
	volume = {43},
	year = {1999},
	month = {1999///},
	pages = {271 - 302},
	author = {Srinivasan, Aravind}
}
@article {12321,
	title = {Synthesis of embedded software from synchronous dataflow specifications},
	journal = {The Journal of VLSI Signal Processing},
	volume = {21},
	year = {1999},
	month = {1999///},
	pages = {151 - 166},
	author = {Bhattacharyya, Shuvra S. and Murthy,P. K and Lee,E. A}
}
@article {12072,
	title = {Safety and security of programmable network infrastructures},
	journal = {IEEE Communications Magazine},
	volume = {36},
	year = {1998},
	month = {1998/10//},
	pages = {84 - 92},
	abstract = {Safety and security are two reliability properties of a system. A {\textquotedblleft}safe{\textquotedblright} system provides protection against errors of trusted users, while a {\textquotedblleft}secure{\textquotedblright} system protects against errors introduced by untrusted users. There is considerable overlap between mechanisms to support each property. Requirements for rapid service creation have stimulated the development of programmable network infrastructures, where end users or service providers can customize the properties of a network infrastructure while it continues to operate. A central concern of potential users of such systems is their reliability and, most specifically, their safety and security. In this article we explain the impact the network service model and architecture have on safety and security, and provide a model with which policies can be translated into restrictions of a general system. We illustrate these ideas with the Secure Active Network Environment (SANE) architecture, which provides a means of controlling access to the functions provided by any programmable infrastructure},
	keywords = {Access control, error protection, IP networks, Multicast protocols, network architecture, network operating systems, network service model, operating system, Power system dynamics, Power system modeling, Power system reliability, programmable languages, programmable network infrastructures, programming languages, Proposals, Protection, reliability properties, Safety, Secure Active Network Environment, Security, security of data, service creation, service providers, Switches, telecommunication computing, telecommunication network reliability, Web and internet services},
	isbn = {0163-6804},
	doi = {10.1109/35.722141},
	author = {Alexander,S. and Arbaugh, William A. and Keromytis,A. D and Smith,J. M}
}
@article {17951,
	title = {Salient Frame Detection for Molecular Dynamics Simulations},
	journal = {Scientific Visualization: Interactions, Features, Metaphors},
	volume = {2},
	year = {1998},
	month = {1998///},
	pages = {160 - 175},
	abstract = {Saliency-based analysis can be applied to time-varying 3D datasetsfor the purpose of summarization, abstraction, and motion analysis. As the sizes
of time-varying datasets continue to grow, it becomes more and more difficult to
comprehend vast amounts of data and information in a short period of time. Au-
tomatically generated thumbnail images and previewing of time-varying datasets
can help viewers explore and understand the datasets significantly faster as well
as provide new insights. In this paper, we introduce a novel method for detect-
ing salient frames for molecular dynamics simulations. Our method effectively
detects crucial transitions in simulated mechanosensitive ion channel (MscS), in
agreement with experimental data.
},
	author = {Kim,Y. and Patro,R. and Ip,C. Y and O{\textquoteright}Leary,D. P and Anishkin,A. and Sukharev,S. and Varshney, Amitabh}
}
@article {15021,
	title = {Scalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields},
	volume = {UMIACS-TR-93-80},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This paper introduces scalable data parallel algorithms for image    processing.  Focusing on Gibbs and Markov Random Field model
    representation for textures, we present parallel algorithms for
    texture synthesis, compression, and maximum likelihood parameter
    estimation, currently implemented on Thinking Machines CM-2 and CM-5.
    Use of fine-grained, data parallel processing techniques yields
    real-time algorithms for texture synthesis and compression that are
    substantially faster than the previously known sequential
    implementations.  Although current implementations are on Connection
    Machines, the methodology presented here enables machine independent
    scalable algorithms for a number of problems in image processing and
    analysis.
(Also cross-referenced as UMIACS-TR-93-80.)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/596},
	author = {Bader,David A. and JaJa, Joseph F. and Chellapa, Rama}
}
@article {11919,
	title = {Scheduling Aperiodic and Sporadic Tasks in Hard Real-Time Systems},
	journal = {Technical Reports from UMIACS, UMIACS-TR-97-44},
	year = {1998},
	month = {1998/10/15/},
	abstract = {The stringent timing constraints as well as the functional correctnessare essential requirements of hard real-time systems. In such systems,
scheduling plays a very important role in satisfying these constraints.
The priority based scheduling schemes have been used commonly  
due to the simplicity of the scheduling algorithm. However, in the presence
of task interdependencies and complex timing constraints, such
scheduling schemes may not be appropriate due to the lack
of an efficient mechanism to schedule them and to
carry out the schedulability analysis. In contrast, 
the time based scheduling scheme may be used to schedule a set of tasks
with greater degree of schedulability
achieved at a cost of higher complexity of off-line scheduling.
One of the drawbacks of currently available scheduling schemes, 
however, is known to be their
inflexibility in dynamic environments where dynamic processes
exist, such as aperiodic and sporadic processes.
We develop and analyze scheduling schemes which efficiently provide
the flexibility required in real-time systems
for scheduling processes arriving dynamically. 
This enables static hard periodic processes and dynamic processes(aperiodic
or sporadic) to be jointly scheduled.
(Also cross-referenced as UMIACS-TR-97-44)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/900},
	author = {Choi,Seonho and Agrawala, Ashok K.}
}
@article {12101,
	title = {A secure active network environment architecture: realization in SwitchWare},
	journal = {IEEE Network},
	volume = {12},
	year = {1998},
	month = {1998/06//May},
	pages = {37 - 45},
	abstract = {An active network is a network infrastructure which is programmable on a per-user or even per-packet basis. Increasing the flexibility of such network infrastructures invites new security risks. Coping with these security risks represents the most fundamental contribution of active network research. The security concerns can be divided into those which affect the network as a whole and those which affect individual elements. It is clear that the element problems must be solved first, since the integrity of network-level solutions will be based on trust in the network elements. In this article we describe the architecture and implementation of a secure active network environment (SANE), which we believe provides a basis for implementing secure network-level solutions. We guarantee that a node begins operation in a trusted state with the AEGIS secure bootstrap architecture. We guarantee that the system remains in a trusted state by applying dynamic integrity checks in the network element{\textquoteright}s runtime system, using a novel naming system, and applying node-to-node authentication when needed. The construction of an extended LAN is discussed},
	keywords = {access protocols, AEGIS secure bootstrap architecture, architecture, Authentication, Collaboration, Communication switching, dynamic integrity checks, extended LAN, Functional programming, implementation, integrity, Intelligent networks, IP networks, Local area networks, network infrastructure, network infrastructures, network operating systems, network-level solutions, node, node-to-node authentication, packet switching, Proposals, ramming system, SANE, secure active network environment architecture, security of data, Switches, SwitchWare, trusted state, Web and internet services},
	isbn = {0890-8044},
	doi = {10.1109/65.690960},
	author = {Alexander,D. S and Arbaugh, William A. and Keromytis,A. D and Smith,J. M}
}
@article {12103,
	title = {Security for virtual private intranets},
	journal = {Computer},
	volume = {31},
	year = {1998},
	month = {1998/09//},
	pages = {48 - 55},
	abstract = {As telecommuting grows, businesses must consider security when extending their network environment to employees{\textquoteright} homes. Researchers at the University of Pennsylvania have addressed the problem with smart cards, operating system modifications, and network authentication. We note the distinction between trust and integrity: trust is determined through the verification of components and the dependencies among them, while integrity demonstrates that components haven{\textquoteright}t been modified. Thus integrity checking in a trustworthy system is about preserving an established trust or trust relationship. Our solution to the challenge of isolating functional roles that may share a single hardware platform is called secure identity based lending (SIBL). SIBL provides multiple personalities by partitioning the hard drive into n+1 partitions, where n is the number of supported personalities. All personalities use the system partition for core operating system components and shared applications. Each of the personalities is also associated with one of the remaining partitions, which are encrypted using a symmetric algorithm},
	keywords = {businesses, Clouds, Companies, core operating system components, cryptography, Data security, employee homes, encryption, functional roles, hard drive, Home computing, home working, integrity checking, Internet, Local area networks, multiple personalities, network authentication, network environment, operating system modifications, Operating systems, Roads, secure identity based lending, security management, security of data, shared applications, SIBL, single hardware platform, smart cards, symmetric algorithm, system partition, telecommuting, Teleworking, trust relationship, trustworthy system, virtual private intranets},
	isbn = {0018-9162},
	doi = {10.1109/2.708450},
	author = {Arbaugh, William A. and Davin,J. R and Farber,D. J and Smith,J. M}
}
@conference {11993,
	title = {Self-calibration from image derivatives},
	booktitle = {Sixth International Conference on Computer Vision, 1998},
	year = {1998},
	month = {1998/01/04/7},
	pages = {83 - 89},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This study investigates the problem of estimating the calibration parameters from image motion fields induced by a rigidly moving camera with unknown calibration parameters, where the image formation is modeled with a linear pinhole-camera model. The equations obtained show the flow to be clearly separated into a component due to the translation and the calibration parameters and a component due to the rotation and the calibration parameters. A set of parameters encoding the latter component are linearly related to the flow, and from these parameters the calibration can be determined. However, as for discrete motion, in the general case it is not possible, to decouple image measurements from two frames only into their translational and rotational component. Geometrically, the ambiguity takes the form of a part of the rotational component being parallel to the translational component, and thus the scene can be reconstructed only up to a projective transformation. In general, for a full calibration at least four successive image frames are necessary with the 3D-rotation changing between the measurements. The geometric analysis gives rise to a direct self-calibration method that avoids computation of optical flow or point correspondences and uses only normal flow measurements. In this technique the direction of translation is estimated employing in a novel way smoothness constraints. Then the calibration parameters are estimated from the rotational components of several flow fields using Levenberg-Marquardt parameter estimation, iterative in the calibration parameters only. The technique proposed does not require calibration objects in the scene or special camera motions and it also avoids the computation of exact correspondence. This makes it suitable for the calibration of active vision systems which have to acquire knowledge about their intrinsic parameters while they perform other tasks, or as a tool for analyzing image sequences in large video databases},
	keywords = {3D-rotation, active vision, Calibration, CAMERAS, discrete motion, Encoding, Equations, image derivatives, image formation, image measurements, Image motion analysis, image motion fields, Image reconstruction, Image sequences, large video databases, Layout, Levenberg-Marquardt parameter estimation, linear pinhole-camera model, Motion estimation, Motion measurement, Optical computing, parameter estimation, projective transformation, rigidly moving camera, self-calibration, smoothness constraints, unknown calibration parameters},
	isbn = {81-7319-221-9},
	doi = {10.1109/ICCV.1998.710704},
	author = {Brodsky, T. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@article {16627,
	title = {Self-replicating structures: evolution, emergence, and computation},
	journal = {Artificial Life},
	volume = {4},
	year = {1998},
	month = {1998///},
	pages = {283 - 302},
	author = {Reggia, James A. and Lohn,J. D and Chou,H. H.}
}
@article {15521,
	title = {Semantics for Disjunctive and Normal Disjunctive Logic Programs},
	journal = {Handbook of logic in artificial intelligence and logic programming},
	volume = {5},
	year = {1998},
	month = {1998///},
	pages = {325 - 325},
	author = {Lobo,J. and Minker, Jack and Rajasekar,A.}
}
@article {15705,
	title = {A semidiscrete matrix decomposition for latent semantic indexing information retrieval},
	journal = {ACM Trans. Inf. Syst.},
	volume = {16},
	year = {1998},
	month = {1998/10//},
	pages = {322 - 346},
	abstract = {The vast amount of textual information available today is useless unless it can be effectively and efficiently searched. The goal in information retrieval is to find documents that are relevant to a given user query. We can represent and document collection by a matrix whose (i, j) entry is nonzero only if the ith term appears in the jth document; thus each document corresponds to a columm vector. The query is also represented as a column vector whose ith term is nonzero only if the ith term appears in the query. We score each document for relevancy by taking its inner product with the query. The highest-scoring documents are considered the most relevant. Unfortunately, this method does not necessarily retrieve all relevant documents because it is based on literal term matching.  Latent semantic indexing (LSI) replaces the document matrix with an approximation generated by the truncated singular-value decomposition (SVD). This method has been shown to overcome many difficulties associated with literal term matching. In this article we propose replacing the SVD with the semidiscrete decomposition (SDD). We will describe the SDD approximation, show how to compute it, and compare the SDD-based LSI method to the SVD-based LSI methods. We will show that SDD-based LSI does as well as SVD-based LSI in terms of document retrieval while requiring only one-twentieth the storage and one-half the time to compute each query. We will also show how to update the SDD approximation when documents are added or deleted from the document collection.},
	keywords = {data mining, latent semantic indexing, semidiscrete decomposition, singular-value decomposition, text retrieval},
	isbn = {1046-8188},
	doi = {10.1145/291128.291131},
	url = {http://doi.acm.org/10.1145/291128.291131},
	author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P.}
}
@article {14257,
	title = {Shape from video: Beyond the epipolar constraint},
	journal = {Proceedings of the DARPA Image Understanding Workshop},
	year = {1998},
	month = {1998///},
	author = {Brodsky, T. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@inbook {14258,
	title = {Simultaneous estimation of viewing geometry and structure},
	booktitle = {Computer Vision {\textemdash} ECCV{\textquoteright}98Computer Vision {\textemdash} ECCV{\textquoteright}98},
	series = {Lecture Notes in Computer Science},
	volume = {1406},
	year = {1998},
	month = {1998///},
	pages = {342 - 358},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Up to now, structure from motion algorithms proceeded in two well defined steps, where the first and most important step is recovering the rigid transformation between two views, and the subsequent step is using this transformation to compute the structure of the scene in view. This paper introduces a novel approach to structure from motion in which both aforementioned steps are accomplished in a synergistic manner. Existing approaches to 3D motion estimation are mostly based on the use of optic flow which however poses a problem at the locations of depth discontinuities. If we knew where depth discontinuities were, we could (using a multitude of approaches based on smoothness constraints) estimate accurately flow values for image patches corresponding to smooth scene patches; but to know the discontinuities requires solving the structure from motion problem first. In the past this dilemma has been addressed by improving the estimation of flow through sophisticated optimization techniques, whose performance often depends on the scene in view. In this paper we follow a different approach. The main idea is based on the interaction between 3D motion and shape which allows us to estimate the 3D motion while at the same time segmenting the scene. If we use a wrong 3D motion estimate to compute depth, then we obtain a distorted version of the depth function. The distortion, however, is such that the worse the motion estimate, the more likely we are to obtain depth estimates that are locally unsmooth, i.e., they vary more than the correct ones. Since local variability of depth is due either to the existence of a discontinuity or to a wrong 3D motion estimate, being able to differentiate between these two cases provides the correct motion, which yields the {\textquotedblleft}smoothest{\textquotedblright} estimated depth as well as the image location of scene discontinuities. Although no optic flow values are computed, we show that our algorithm is very much related to minimizing the epipolar constraint and we present a number of experimental results with real image sequences indicating the robustness of the method.},
	isbn = {978-3-540-64569-6},
	url = {http://dx.doi.org/10.1007/BFb0055677},
	author = {Brodsk{\'y},Tom{\'a}{\v s} and Ferm{\"u}ller, Cornelia and Aloimonos, J.},
	editor = {Burkhardt,Hans and Neumann,Bernd}
}
@article {18714,
	title = {Solution structure and dynamics of the bioactive retroviral M domain from rous sarcoma virus},
	journal = {Journal of Molecular Biology},
	volume = {279},
	year = {1998},
	month = {1998/06/19/},
	pages = {921 - 928},
	abstract = {A biologically active construct of the retroviral M domain from the avian Rous sarcoma virus is defined and its solution structure described. This M domain is fully active in budding and infectivity without myristylation. In spite of a sequence homology level that suggests no relationship among M domains and the family of matrix proteins in mammalian retroviruses, the conserved structural elements of a central core allow an M domain sequence motif to be described for all retroviruses. The surface of the M domain has a highly clustered positive patch comprised of sequentially distant residues. An analysis of the backbone dynamics, incorporating rotational anisotropy, is used to estimate the thermodynamics of proposed domain oligomerization.},
	keywords = {heteronuclear NMR spectroscopy, protein dynamics, RSV matrix protein, sequence homology, three-dimensional structure},
	isbn = {0022-2836},
	doi = {10.1006/jmbi.1998.1788},
	url = {http://www.sciencedirect.com/science/article/pii/S0022283698917880},
	author = {McDonnell,James M and Fushman, David and Cahill,Sean M. and Zhou,Wenjun and Wolven,Amy and Wilson,Carol B and Nelle,Timothy D and Resh,Marilyn D and Wills,John and Cowburn,David}
}
@article {18723,
	title = {The Solution Structure and Dynamics of the Pleckstrin Homology Domain of G Protein-coupled Receptor Kinase 2 (β-Adrenergic Receptor Kinase 1) A BINDING PARTNER OF Gβγ SUBUNITS},
	journal = {Journal of Biological ChemistryJ. Biol. Chem.},
	volume = {273},
	year = {1998},
	month = {1998/01/30/},
	pages = {2835 - 2843},
	abstract = {The solution structure of an extended pleckstrin homology (PH) domain from the β-adrenergic receptor kinase is obtained by high resolution NMR. The structure establishes that the β-adrenergic receptor kinase extended PH domain has the same fold and topology as other PH domains, and there are several unique features, most notably an extended C-terminal α-helix that behaves as a molten helix, and a surface charge polarity that is extensively modified by positive residues in the extended α-helix and the C terminus. These observations complement biochemical evidence that the C-terminal portion of this PH domain participates in protein-protein interactions with Gβγ subunits. This suggests that the C-terminal segment of the PH domain may function to mediate protein-protein interactions with the targets of PH domains.},
	isbn = {0021-9258, 1083-351X},
	doi = {10.1074/jbc.273.5.2835},
	url = {http://www.jbc.org/content/273/5/2835},
	author = {Fushman, David and Najmabadi-Haske,Taraneh and Cahill,Sean and Zheng,Jie and LeVine,Harry and Cowburn,David}
}
@article {17375,
	title = {Sorting out searching: a user-interface framework for text searches},
	journal = {Communications of the ACM},
	volume = {41},
	year = {1998},
	month = {1998/04//},
	pages = {95 - 98},
	isbn = {0001-0782},
	doi = {10.1145/273035.273069},
	url = {http://doi.acm.org/10.1145/273035.273069},
	author = {Shneiderman, Ben and Byrd,Donald and Croft,W. Bruce}
}
@article {16337,
	title = {Specification-based Testing of Reactive Software: A Case Study in Technology Transfer},
	journal = {Journal of Systems and Software},
	volume = {40},
	year = {1998},
	month = {1998///},
	pages = {249 - 262},
	author = {Jategaonkar Jagadeesan,L. and Porter, Adam and Puchol,C. and Ramming,J. C and Votta,L. G.}
}
@article {16572,
	title = {Spreading depression in focal ischemia: A computational study},
	journal = {Journal of Cerebral Blood Flow \& Metabolism},
	volume = {18},
	year = {1998},
	month = {1998///},
	pages = {998 - 1007},
	author = {Revett,K. and Ruppin,E. and Goodall,S. and Reggia, James A.}
}
@article {17734,
	title = {SRRIT--A FORTRAN Subroutine to Calculate the Dominant Invariant Subspace of a Nonsymmetric Matrix},
	volume = {UMIACS-TR-92-61},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {SRRIT is a FORTRAN program to calculate an approximateorthonormal basis for a dominant invariant subspace of a real matrix
$A$ by the method of simultaneous iteration \cite{stewart76a}.
Specifically, given an integer $m$, {\sl SRRIT} attempts to compute a
matrix $Q$ with $m$ orthonormal columns and real quasi-triangular
matrix $T$ of order $m$ such that the equation
\[
AQ = QT
\]
is satisfied up to a tolerance specified by the user.  The
eigenvalues of $T$ are approximations to the $m$ largest eigenvalues
of $A$, and the columns of $Q$ span the invariant subspace
corresponding to those eigenvalues.  {\sl SRRIT} references $A$ only
through a user provided subroutine to form the product $AQ$; hence it
is suitable for large sparse problems.
(Also cross-referenced as UMIACS-TR-92-61)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/572},
	author = {Bai,Z. and Stewart, G.W.}
}
@article {15673,
	title = {Stabbing Orthogonal Objects in 3-Space},
	volume = {UMIACS-TR-96-71},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {We consider a problem that arises in the design of data structuresfor answering {\em visibility range queries}, that is, given a
$3$-dimensional scene defined by a set of polygonal patches, 
we wish to preprocess the scene to answer queries involving the set of
patches of the scene that are visible from a given range of points
over a given range of viewing directions.  These data structures 
recursively subdivide space into cells until some criterion is satisfied.  
One of the important problems that arise in the construction of
such data structures is that of determining whether a cell represents
a nonempty region of space, and more generally computing the size of
a cell.
In this paper we introduce a measure of the {\em size} of the subset
of lines in 3-space that stab a given set of $n$ polygonal patches,
based on the maximum angle and distance between any two lines in the set.
Although the best known algorithm for computing this size measure runs
in $O(n^2)$ time, we show that if the polygonal patches are orthogonal
rectangles, then this measure can be approximated to within a constant
factor in $O(n)$ time.
(Also cross-referenced as UMIACS-TR-96-71)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu//handle/1903/850},
	author = {Mount, Dave and Pu,Fan-Tao}
}
@conference {14656,
	title = {A study of large object spaces},
	booktitle = {Proceedings of the 1st international symposium on Memory management},
	series = {ISMM {\textquoteright}98},
	year = {1998},
	month = {1998///},
	pages = {138 - 145},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper examines the design space for copying garbage collectors (GCs) in which "large objects" are managed in a separate, non-copy-collected space. We focus on two main issues:1. how to set the policy for classifying objects as "large"2. how to manage the large object spaceWe explore these issues experimentally using the Oscar GC testbed. In particular, we vary the threshold size of large objects and also whether the objects may contain pointers. Furthermore, we compare the performance of treadmill collection to that of mark-and-sweep collection for managing the large object space.We find that for some heaps there is a minimum cutoff size below which adding objects to the large object space does not result in a performance improvement, while for others no such cutoff exists. In general, including pointer-containing objects in the large object space seems beneficial. Finally, the exact method used to collect the large object space does not significantly influence overall performance.},
	isbn = {1-58113-114-3},
	doi = {10.1145/286860.286875},
	url = {http://doi.acm.org/10.1145/286860.286875},
	author = {Hicks, Michael W. and Hornof,Luke and Moore,Jonathan T. and Nettles,Scott M.}
}
@article {17716,
	title = {On Sublinear Convergence},
	volume = {UMIACS-TR-95-92},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This note develops a theory of sublinearly convergingsequences, including a categorization of the rates of convergence and a 
method for determining the rate from an iteration function.
(Also cross-referenced as UMIACS-TR-95-92)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/760},
	author = {Stewart, G.W.}
}
@article {13715,
	title = {A Survey of Current Paradigms in Machine Translation},
	year = {1998},
	month = {1998///},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This is paper is a survey of the current machine translation research in the US, Eu-rope, and Japan. A short history of machine translation is presented first, followed by
an overview of the current research work. Representative examples of a wide range of
different approaches adopted by machine translation researchers are presented. These
are described in detail along with a discussion of the practicalities of scaling up these
approaches for operational environments. In support of this discussion, issues in, and
techniques for, evaluating machine translation systems are discussed.
},
	author = {Dorr, Bonnie J and Jordan,P.W. and Benoit,J.W.}
}
@article {13717,
	title = {A Survey of Multilingual Text Retrieval},
	year = {1998},
	month = {1998/10/15/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This report reviews the present state of the artin selection of texts in one language based on queries in another, a
problem we refer to as {\textquoteleft}{\textquoteleft}multilingual{\textquoteright}{\textquoteright} text retrieval.  Present
applications of multilingual text retrieval systems are limited by the
cost and complexity of developing and using the multilingual thesauri
on which they are based and by the level of user training that is
required to achieve satisfactory search effectiveness.  A general
model for multilingual text retrieval is used to review the
development of the field and to describe modern production and
experimental systems.  The report concludes with some observations on
the present state of the art and an extensive bibliography of the
technical literature on multilingual text retrieval.  The research 
reported herein was supported, in part, by Army Research
Office contract DAAL03-91-C-0034 through Battelle Corporation, NSF NYI
IRI-9357731, Alfred P.  Sloan Research Fellow Award BR3336, and a
General Research Board Semester Award. 
(Also cross-referenced as UMIACS-TR-96-19)
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/807},
	author = {Oard, Douglas and Dorr, Bonnie J}
}
@article {12079,
	title = {The SwitchWare active network architecture},
	journal = {IEEE Network},
	volume = {12},
	year = {1998},
	month = {1998/06//May},
	pages = {29 - 36},
	abstract = {Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance must be achieved while maintaining the usability of the network. The SwitchWare active network architecture is a novel approach to achieving this balance using three layers: active packets, which contain mobile programs that replace traditional packets; active extensions, which provide services on the network elements and can be dynamically loaded; and a secure active router infrastructure, which forms a high-integrity base on which the security of the other layers depends. In addition to integrity checking and cryptography-based authentication, security in our architecture depends heavily on verification techniques from programming languages, such as strong type checking},
	keywords = {active extensions, active packets, Authentication, Computer languages, Computer networks, cryptography, cryptography-based authentication, high-integrity base, integrity checking, IP networks, LAN interconnection, mobile programs, network operating systems, packet switching, programmable network infrastructure, programming languages, Protocols, Safety, safety requirements, scalability, secure active router infrastructure, Security, security requirements, services, strong type checking, Switches, SwitchWare active network architecture, telecommunication network routing, Tin, usability, verification techniques},
	isbn = {0890-8044},
	doi = {10.1109/65.690959},
	author = {Alexander,D. S and Arbaugh, William A. and Hicks, Michael W. and Kakkar,P. and Keromytis,A. D and Moore,J. T and Gunter,C. A and Nettles,S. M and Smith,J. M}
}
@article {14745,
	title = {The switchware active network implementation},
	journal = {The ML Workshop, International Conference on Functional Programming (ICFP)},
	year = {1998},
	month = {1998///},
	author = {Alexander,D. S and Hicks, Michael W. and Kakkar,P. and Keromytis,A. D and Shaw,M. and Moore,J. T and Gunter,C. A and Jim,T. and Nettles,S. M and Smith,J. M}
}
@article {13019,
	title = {Satellite DNA repeat sequence variation is low in three species of burying beetles in the genus {\i}t Nicrophorus (Coleoptera: Silphidae)},
	journal = {Mol Biol Evol},
	volume = {14},
	year = {1997},
	month = {1997/11//},
	pages = {1088 - 1095},
	abstract = {Three satellite DNA families were identified in three species of burying beetles, Nicrophorus orbicollis, N. marginatus, and N. americanus. Southern hybridization and nucleotide sequence analysis of individual randomly cloned repeats shows that these satellite DNA families are highly abundant in the genome, are composed of unique repeats, and are species-specific. The repeats do not have identifiable core elements or substructures that are similar in all three families, and most interspecific sequence similarity is confined to homopolymeric runs of A and T. Satellite DNA from N. marginatus and N. americanus show single-base-pair indels among repeats, but single-nucleotide substitutions characterize most of the repeat variability. Although the repeat units are of similar lengths (342, 350, and 354 bp) and A + T composition (65\%, 71\%, and 71\%, respectively), the average nucleotide divergence among sequenced repeats is very low (0.18\%, 1.22\%, and 0.71\%, respectively). Transition/transversion ratios from the consensus sequence are 0.20, 0.69, and 0.70, respectively.},
	author = {King,L. M and Cummings, Michael P.}
}
@article {17654,
	title = {Scheduling and load-balancing via randomization},
	volume = {TR11/97},
	year = {1997},
	month = {1997/11/01/undef},
	institution = {DSpace at School of Computing, NUS},
	author = {Srinivasan, Aravind}
}
@conference {17848,
	title = {Scheduling in a high performance remote-sensing data server},
	booktitle = {Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing. SIAM},
	year = {1997},
	month = {1997///},
	author = {Chang,C. and Sussman, Alan and Saltz, J.}
}
@conference {12092,
	title = {A secure and reliable bootstrap architecture},
	booktitle = {, 1997 IEEE Symposium on Security and Privacy, 1997. Proceedings},
	year = {1997},
	month = {1997/05/04/7},
	pages = {65 - 71},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In a computer system, the integrity of lower layers is typically treated as axiomatic by higher layers. Under the presumption that the hardware comprising the machine (the lowest layer) is valid, the integrity of a layer can be guaranteed if and only if: (1) the integrity of the lower layers is checked and (2) transitions to higher layers occur only after integrity checks on them are complete. The resulting integrity {\textquotedblleft}chain{\textquotedblright} inductively guarantees system integrity. When these conditions are not met, as they typically are not in the bootstrapping (initialization) of a computer system, no integrity guarantees can be made, yet these guarantees are increasingly important to diverse applications such as Internet commerce, security systems and {\textquotedblleft}active networks{\textquotedblright}. In this paper, we describe the AEGIS architecture for initializing a computer system. It validates integrity at each layer transition in the bootstrap process. AEGIS also includes a recovery process for integrity check failures, and we show how this results in robust systems},
	keywords = {active networks, AEGIS architecture, bootstrap architecture, Computer architecture, computer bootstrapping, data integrity, Distributed computing, Hardware, hardware validity, initialization, integrity chain, integrity check failures, Internet, Internet commerce, IP networks, Laboratories, lower-layer integrity, Microprogramming, Operating systems, recovery process, reliability, robust systems, Robustness, Security, security of data, software reliability, system integrity guarantees, system recovery, transitions, Virtual machining},
	isbn = {0-8186-7828-3},
	doi = {10.1109/SECPRI.1997.601317},
	author = {Arbaugh, William A. and Farber,D. J and Smith,J. M}
}
@conference {16714,
	title = {Selectional preference and sense disambiguation},
	booktitle = {Proceedings of the ACL SIGLEX Workshop on Tagging Text with Lexical Semantics: Why, What, and How},
	year = {1997},
	month = {1997///},
	pages = {52 - 57},
	author = {Resnik, Philip}
}
@conference {16464,
	title = {Semantic query optimization for object databases},
	booktitle = {Data Engineering, 1997. Proceedings. 13th International Conference on},
	year = {1997},
	month = {1997///},
	pages = {444 - 453},
	author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa}
}
@conference {15524,
	title = {Semantic query optimization for object databases},
	booktitle = {Data Engineering, 1997. Proceedings. 13th International Conference on},
	year = {1997},
	month = {1997/04//},
	pages = {444 - 453},
	abstract = {Presents a technique for semantic query optimization (SQO) for object databases. We use the ODMG-93 (Object Data Management Group) standard ODL (Object Database Language) and OQL (Object Query Language) languages. The ODL object schema and the OQL object query are translated into a DATALOG representation. Semantic knowledge about the object model and the particular application is expressed as integrity constraints. This is an extension of the ODMG-93 standard. SQO is performed in the DATALOG representation, and an equivalent logic query and (subsequently) an equivalent OQL object query are obtained. SQO is based on the residue technique of Chakravarthy et al. (1990). We show that our technique generalizes previous research on SQO for object databases. It can be applied to queries with structure constructors and method application. It utilizes integrity constraints about keys, methods and knowledge of access support relations, to produce equivalent queries, which may have more efficient evaluation plans},
	keywords = {application;object, constraints;keys;method, constructors;DATALOG;data, databases;object-oriented, databases;query, Datalog, Evaluation, integrity;data, languages;query, Logic, object, optimization;structure, plans;residue, processing;software, query, query;access, query;integrity, relations;equivalent, representation;ODL, schema;ODMG-93, standard;OQL, standards;, structures;object-oriented, Support, technique;semantic},
	doi = {10.1109/ICDE.1997.581983},
	author = {Grant,J. and Gryz,J. and Minker, Jack and Raschid, Louiqa}
}
@conference {16666,
	title = {Semi-automatic acquisition of domain-specific translation lexicons},
	booktitle = {Proceedings of the fifth conference on Applied natural language processing},
	year = {1997},
	month = {1997///},
	pages = {340 - 347},
	author = {Resnik, Philip and Melamed,I.D.}
}
@article {14655,
	title = {A Service Layer Routing Protocol for PLAN},
	journal = {PLAN documentation, September},
	year = {1997},
	month = {1997///},
	author = {Moore,J. T and Hicks, Michael W.}
}
@article {15900,
	title = {Serving Users in Many Languages: Cross-Language Information Retrievalfor Digital Libraries},
	year = {1997},
	month = {1997///},
	institution = {Corporation for National Research Initiatives},
	author = {Oard, Douglas}
}
@article {15976,
	title = {Sources of, and exploiting, inconsistency: preliminary report},
	journal = {JOURNAL OF APPLIED NONCLASSICAL LOGICS},
	volume = {7},
	year = {1997},
	month = {1997///},
	pages = {13 - 24},
	author = {Perlis, Don}
}
@conference {13862,
	title = {Spanish EuroWordNet and LCS-Based Interlingual MT},
	booktitle = {IN PROCEEDINGS OF THE MT SUMMIT WORKSHOP ON INTERLINGUAS IN MT},
	year = {1997},
	month = {1997///},
	abstract = {We present a machine translation framework in which the interlingua --  Lexical Conceptual Structure (LCS) -- is coupled with a definitional component  that includes bilingual (EuroWordNet) links between words in the  source and target languages. While the links between individual words  are language-specific, the LCS is designed to be a language-independent,  compositional representation. We take the view that the two types of  information -- shallower, transfer-like knowledge as well as deeper, compositional  knowledge -- can be reconciled in interlingual machine translation,  the former for overcoming the intractability of LCS-based lexical selection,  and the latter for relating the underlying semantics of two words  cross-linguistically. We describe the acquisition process for these two information  types and present results of hand-verification of the acquired  lexicon. Finally, we demonstrate the utility of the two information types  in interlingual MT.},
	author = {Dorr, Bonnie J and Marti,M. Antonia and Castellon,Irene}
}
@conference {16336,
	title = {Specification-based Testing of Reactive Software: Tools and Experiments},
	booktitle = {Software Engineering, International Conference on},
	year = {1997},
	month = {1997///},
	pages = {525 - 525},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	abstract = {Testing commercial software is expensive and time consuming. Automated testing methods promise to save a great deal of time and money throughout the software industry. One approach that is well-suited for the reactive systems found in telephone switching systems is specification-based testing.We have built a set of tools to automatically test softmare applications for violations of safety properties expressed in temporal logic. Our testing system automatically constructs finite state machine oracles corresponding to safety properties, builds test harnesses, and integrates them with the application. The test harness then generates inputs automatically to test the application.We describe a study examining the feasibility of this approach for testing industrial applications. To conduct this study we formally modeled an Automatic Protection Switching system (APS), which is an application common to many telephony systems. We then asked a number of computer science graduate students to develop several versions of the APS and use our tools to test them. We found that the tools are very effective, save significant amounts of human effort (at the expense of machine resources), and are easy to use. We also discuss improvements that are needed before we can use the tools with professional developers building commercial products.},
	keywords = {empirical studies, reactive systems, specification-based testing, temporal logic},
	doi = {http://doi.ieeecomputersociety.org/10.1109/ICSE.1997.610373},
	author = {Jagadeesan,Lalita Jategaonkar and Porter, Adam and Puchol,Carlos and Ramming,J. Christopher and Votta,Lawrence G.}
}
@article {15871,
	title = {The state of the art in text filtering},
	journal = {User Modeling and User-Adapted Interaction},
	volume = {7},
	year = {1997},
	month = {1997///},
	pages = {141 - 178},
	author = {Oard, Douglas}
}
@article {14882,
	title = {Stochastic completion fields: A neural model of illusory contour shape and salience},
	journal = {Neural Computation},
	volume = {9},
	year = {1997},
	month = {1997///},
	pages = {837 - 858},
	abstract = {Describes an algorithm- and representation-level theory of illusory contour shape and salience. Unlike previous theories, the model is derived from a single assumption: that the prior probability distribution of boundary completion shape can be modeled by a random walk. The model does not use numerical relaxation or other explicit minimization, but instead relies on the fact that the probability that a particle following a random walk will pass through a given position, and orientation on a path joining 2 boundary fragments can be computed directly as the product of 2 vector-field convolutions. It is shown that for the random walk defined, the maximum likelihood paths are curves of least energy, that is, on average, random walks follow paths commonly assumed to model the shape of illusory contours. A computer model is demonstrated on numerous illusory contour stimuli from the literature. (PsycINFO Database Record (c) 2012 APA, all rights reserved)},
	author = {Williams,L. R and Jacobs, David W.}
}
@article {14095,
	title = {A survey of the Trypanosoma brucei rhodesiense genome using shotgun sequencing},
	journal = {Molecular and Biochemical Parasitology},
	volume = {84},
	year = {1997},
	month = {1997/02//},
	pages = {167 - 178},
	abstract = {A comparison of the efficiency of sequencing random genomic DNA fragments versus random cDNAs for the discovery of new genes in African trypanosomes was undertaken. Trypanosome DNA was sheared to a 1.5-2.5 kb size distribution, cloned into a plasmid and the sequences at both ends of 183 cloned fragments determined. Sequences of both kinetoplast and nuclear DNA were identified. New coding regions were discovered for a variety of proteins, including cell division proteins, an RNA-binding protein and a homologue of the Leishmania surface protease GP63. In some cases, each end of a fragment was found to contain a different gene, demonstrating the proximity of those genes and suggesting that the density of genes in the African trypanosome genome is quite high. Repetitive sequence elements found included telomeric hexamer repeats, 76 bp repeats associated with VSG gene expression sites, 177 bp satellite repeats in minichromosomes and the Ingi transposon-like elements. In contrast to cDNA sequencing, no ribosomal protein genes were detected. For the sake of comparison, the sequences of 190 expressed sequence tags (ESTs) were also determined, and a similar number of new trypanosomal homologues were found including homologues of another putative surface protein and a human leucine-rich repeat-containing protein. We conclude from this analysis and our previous work that sequencing random DNA fragments in African trypanosomes is as efficient for gene discovery as is sequencing random cDNA clones.},
	keywords = {Expressed sequence tag, Genome survey sequence, Trypanosoma brucei rhodesiense},
	isbn = {0166-6851},
	doi = {16/S0166-6851(96)02792-2},
	url = {http://www.sciencedirect.com/science/article/pii/S0166685196027922},
	author = {El-Sayed, Najib M. and Donelson,John E.}
}
@article {13655,
	title = {Symbolic Compression and Processing of Document Images},
	volume = {LAMP-TR-004,CFAR-TR-849,CS-TR-3734},
	year = {1997},
	month = {1997/01//},
	institution = {University of Maryland, College Park},
	abstract = {In this paper we describe a compression and representation scheme which exploits the component-level redundancy found within a document image. The approach identifies patterns which appear repeatedly, represents similar patterns with a single prototype, stores the location of pattern instances and codes the residuals between the prototypes and the pattern instances. Using a novel encoding scheme, we provide a representation which facilitates scalable lossy compression and progressive transmission, and supports document image analysis in the compressed domain. We motivate the approach, provide details of the encoding procedures, report compression results and describe a class of document image understanding tasks which operate on the compressed representation.},
	author = {Kia,Omid and David Doermann and Rosenfeld,Azriel and Chellapa, Rama}
}
@conference {16359,
	title = {Symbolic model checking of infinite state systems using Presburger arithmetic},
	booktitle = {Computer Aided Verification},
	year = {1997},
	month = {1997///},
	pages = {400 - 411},
	author = {Bultan,T. and Gerber,R. and Pugh, William}
}
@conference {16474,
	title = {Scaling heterogeneous databases and the design of DISCO},
	booktitle = {ICDCS},
	year = {1996},
	month = {1996///},
	pages = {449 - 449},
	author = {Tomasic,A. and Raschid, Louiqa and Valduriez,P.}
}
@article {16672,
	title = {Selectional constraints: an information-theoretic model and its computational realization},
	journal = {Cognition},
	volume = {61},
	year = {1996},
	month = {1996///},
	pages = {127 - 159},
	abstract = {A new, information-theoretic model of selectional constraints is proposed. The strategy adopted here is a minimalist one: how far can one get making as few assumptions as possible? In keeping with that strategy, the proposed model consists of only two components: first, a fairly generic taxonomic representation of concepts, and, second, a probabilistic formalization of selectional constraints defined in terms of that taxonomy, computed on the basis of simple, observable frequencies of co-occurrence between predicates and their arguments. Unlike traditional selection restrictions, the information-theoretic approach avoids empirical problems associated with definitional theories of word meaning, accommodates the observation that semantic anomaly often appears to be a matter of degree, and provides an account of how selectional constraints can be learned. A computational implementation of the model {\textquotedblleft}learns{\textquotedblright} selectional constraints from collections of naturally occurring text; the predictions of the implemented model are evaluated against judgments elicited from adult subjects, and used to explore the way that arguments are syntactically realized for a class of English verbs. The paper concludes with a discussion of the role of selectional constraints in the acquisition of verb meaning.},
	isbn = {0010-0277},
	doi = {10.1016/S0010-0277(96)00722-6},
	url = {http://www.sciencedirect.com/science/article/pii/S0010027796007226},
	author = {Resnik, Philip}
}
@article {15532,
	title = {Semantic query optimization for bottom-up evaluation},
	journal = {Foundations of Intelligent Systems},
	year = {1996},
	month = {1996///},
	pages = {561 - 571},
	abstract = {Semantic query optimization uses semantic knowledge in databases (represented in the form of integrity constraints) to rewrite queries and logic programs to achieve efficient query evaluation. Much work has been done to develop various techniques for optimization. Most of it, however, is applicable to top-down query evaluation strategies. Moreover, little attention has been paid to the cost of the optimization. We address the issue of semantic query optimization for bottom-up query evaluation strategies with an emphasis on overall efficiency. We focus on a single optimization technique, join elimination. We discuss factors that influence the cost of semantic optimization, and present two different abstract algorithms for optimization. The first pre-processes a query statically before it is evaluated; the second combines query evaluation with semantic optimization using heuristics to achieve the largest possible savings.},
	doi = {10.1007/3-540-61286-6_180},
	author = {Godfrey,P. and Gryz,J. and Minker, Jack}
}
@article {12826,
	title = {Semantic theories and system design},
	journal = {ACM Computing Surveys (CSUR)},
	volume = {28},
	year = {1996},
	month = {1996///},
	pages = {41 - 41},
	author = {Cleaveland, Rance}
}
@mastersthesis {15528,
	title = {Semantics of knowledge-based systems with multiple forms of negation},
	year = {1996},
	month = {1996///},
	school = {University of Maryland at College Park},
	author = {Ruiz,C. and Minker, Jack}
}
@article {15443,
	title = {SEROS {\textendash} A SELF-ROUTING OPTICAL ATM SWITCH},
	journal = {International Journal of Communication Systems},
	volume = {9},
	year = {1996},
	month = {1996///},
	pages = {115 - 125},
	abstract = {A fault-tolerant high-performance SElf-Routing 2 {\texttimes} 2 Optical ATM Switch (SEROS) is proposed. The switch is designed using all-optical components which allows the exploitation of spatial parallelism. SEROS can be used with any multistage interconnection network such as Omega, Banyan, Shuffle or Benes. For the purpose of this study, SEROS has been incorporated into a generic self-routing multistage interconnection network that uses 2 {\texttimes} 2 switches and is not fault tolerant. Reliability analysis is carried out and the results are compared with two major fault-tolerant networks. They show that without redundant switches, better network survivability is achieved. All the switches in the network are 2 {\texttimes} 2, making it easier to mass produce.},
	keywords = {2 {\texttimes} 2 ATM switch, fault-tolerant, MINs, photonic switching network, reliability, self-routing},
	isbn = {1099-1131},
	doi = {10.1002/(SICI)1099-1131(199603)9:2<115::AID-DAC301>3.0.CO;2-B},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1099-1131(199603)9:2<115::AID-DAC301>3.0.CO;2-B/abstract},
	author = {Guizani,Mohsen and Memon, Atif M.}
}
@conference {17940,
	title = {Simplification envelopes},
	booktitle = {Proceedings of the 23rd annual conference on Computer graphics and interactive techniques},
	series = {SIGGRAPH {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {119 - 128},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {geometric modeling, hierarchical approximation, levels-of-detail generation, model simplification, offsets, shape approximation},
	isbn = {0-89791-746-4},
	doi = {10.1145/237170.237220},
	url = {http://doi.acm.org/10.1145/237170.237220},
	author = {Cohen,Jonathan and Varshney, Amitabh and Manocha,Dinesh and Turk,Greg and Weber,Hans and Agarwal,Pankaj and Brooks,Frederick and Wright,William}
}
@article {15404,
	title = {Simulation of the logic switching characteristics of hot-carrier-degraded ultra-thin SOI CMOS inverters},
	journal = {Solid-State Electronics},
	volume = {39},
	year = {1996},
	month = {1996/11//},
	pages = {1669 - 1674},
	abstract = {The switching characteristics of ultra-thin SOI CMOS inverters with hot-carrier-induced degradations are examined by using device simulations. The simulator employs a robust fixed-point iteration method to avoid conventional matrix solutions. Potential-dependent interface traps and oxide trapped charges are used to model the degradations. The effects of front and back channel degradations in an nMOS device of a CMOS inverter are investigated in steady-state and transient regimes. The nonlinear variation of interface charges cannot be simulated by using a single nMOS device alone since the transition of the inverter is also determined by the pMOS transistor. It is found that the stagnant holes generated by impact ionization have a much greater effect on the rate of the pull-down transient than that of interface charges.},
	isbn = {0038-1101},
	doi = {10.1016/0038-1101(96)00073-1},
	url = {http://www.sciencedirect.com/science/article/pii/0038110196000731},
	author = {Tai,Gwo-Chung and Korman,Can E. and Mayergoyz, Issak D}
}
@conference {17371,
	title = {Social impact statements: engaging public participation in information technology design},
	booktitle = {Proceedings of the symposium on Computers and the quality of life},
	series = {CQL {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {90 - 96},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {0-89791-827-4},
	doi = {10.1145/238339.238378},
	url = {http://doi.acm.org/10.1145/238339.238378},
	author = {Shneiderman, Ben and Rose,Anne}
}
@article {18430,
	title = {Software engineering technology infusion within NASA},
	journal = {Engineering Management, IEEE Transactions on},
	volume = {43},
	year = {1996},
	month = {1996/08//},
	pages = {250 - 261},
	abstract = {Abstract technology transfer is of crucial concern to both government and industry today. In this paper, several software engineering technologies used within NASA are studied, and the mechanisms, schedules, and efforts at transferring these technologies are investigated. The goals of this study are: (1) to understand the difference between technology transfer (the adoption of a new method by large segments of an industry) as an industrywide phenomenon and the adoption of a new technology by an individual organization (called technology infusion); and (2) to see if software engineering technology transfer differs from other engineering disciplines. While there is great interest today in developing technology transfer models for industry, it is the technology infusion process that actually causes changes in the current state of the practice},
	keywords = {and, computing;aerospace, development, development;aerospace, disciplines;government;industry;software, engineering, industry;research, infusion;technology, management;software, management;technology, MODELS, NASA;engineering, technologies;technology, transfer, transfer;},
	isbn = {0018-9391},
	doi = {10.1109/17.511836},
	author = {Zelkowitz, Marvin V}
}
@book {12332,
	title = {Software synthesis from dataflow graphs},
	year = {1996},
	month = {1996///},
	publisher = {Springer},
	organization = {Springer},
	author = {Bhattacharyya, Shuvra S. and Murthy,P. K and Lee,E. A}
}
@article {15025,
	title = {Sorting strings and constructing digital search trees in parallel},
	journal = {Theoretical Computer Science},
	volume = {154},
	year = {1996},
	month = {1996/02/05/},
	pages = {225 - 245},
	abstract = {We describe two simple optimal-work parallel algorithms for sorting a list L= (X1, X2, {\textellipsis}, Xm) of m strings over an arbitrary alphabet Σ, where ∑i = 1m{\textbrokenbar}Xi{\textbrokenbar} = n and two elements of Σ can be compared in unit time using a single processor. The first algorithm is a deterministic algorithm that runs in O(log2m/log log m) time and the second is a randomized algorithm that runs in O(logm) time. Both algorithms use O(m log m + n) operations. Compared to the best-known parallel algorithms for sorting strings, our algorithms offer the following improvements. 1.1. The total number of operations used by our algorithms is optimal while all previous parallel algorithms use a nonoptimal number of operations.
2.
2. We make no assumption about the alphabet while the previous algorithms assume that the alphabet is restricted to {1, 2, {\textellipsis}, no(1)}.
3.
3. The computation model assumed by our algorithms is the Common CRCW PRAM unlike the known algorithms that assume the Arbitrary CRCW PRAM.
4.
4. Our algorithms use O(m log m + n) space, while the previous parallel algorithms use O(n1 + ε) space, where ε is a positive constant.
We also present optimal-work parallel algorithms to construct a digital search tree for a given set of strings and to search for a string in a sorted list of strings. We use our parallel sorting algorithms to solve the problem of determining a minimal starting point of a circular string with respect to lexicographic ordering. Our solution improves upon the previous best-known result to solve this problem.
},
	isbn = {0304-3975},
	doi = {10.1016/0304-3975(94)00263-0},
	url = {http://www.sciencedirect.com/science/article/pii/0304397594002630},
	author = {JaJa, Joseph F. and Ryu,Kwan Woo and Vishkin, Uzi}
}
@article {14890,
	title = {The space requirements of indexing under perspective projections},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {18},
	year = {1996},
	month = {1996/03//},
	pages = {330 - 333},
	abstract = {Object recognition systems can be made more efficient through the use of table lookup to match features. The cost of this indexing process depends on the space required to represent groups of model features in such a lookup table. We determine the space required to perform indexing of arbitrary sets of 3D model points for lookup from a single 2D image formed under perspective projection. We show that in this case, one must use a 3D surface to represent model groups, and we provide an analytic description of such a surface. This is in contrast to the cases of scaled-orthographic or affine projection, in which only a 2D surface is required to represent a group of model features. This demonstrates a fundamental way in which the recognition of objects under perspective projection is more complex than is recognition under other projection models},
	keywords = {2D, complexity;feature, complexity;table, extraction;image, hashing;indexing, image, images;3D, lookup;, lookup;computational, matching;geometric, matching;indexing;object, model, points;feature, process;invariants;object, processing;table, projections;space, recognition;perspective, recognition;stereo},
	isbn = {0162-8828},
	doi = {10.1109/34.485561},
	author = {Jacobs, David W.}
}
@conference {14897,
	title = {Space/time trade-offs for associative memory},
	booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on},
	volume = {4},
	year = {1996},
	month = {1996/08//},
	pages = {296 -302 vol.4 - 296 -302 vol.4},
	abstract = {In any storage scheme, there is some trade-off between the space used (size of memory) and access time. However, the nature of this trade-off seems to depend on more than just what is being stored-it also depends the types of queries we consider. We justify this claim by considering a particular memory model and contrast recognition (membership queries) with associative recall. We show that the latter task can require exponentially larger memories even when identical information is stored},
	keywords = {access, matching;set, memory;associative, nets;pattern, processing;content-addressable, query;memory, recall;membership, scheme;associative, space;set, storage;neural, theory;, theory;storage, time;associative},
	doi = {10.1109/ICPR.1996.547434},
	author = {GROVE,A. J and Jacobs, David W.}
}
@inbook {14259,
	title = {Spatiotemporal representations for visual navigation},
	booktitle = {Computer Vision {\textemdash} ECCV {\textquoteright}96Computer Vision {\textemdash} ECCV {\textquoteright}96},
	series = {Lecture Notes in Computer Science},
	volume = {1064},
	year = {1996},
	month = {1996///},
	pages = {671 - 684},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The study of visual navigation problems requires the integration of visual processes with motor control. Most essential in approaching this integration is the study of appropriate spatio-temporal representations which the system computes from the imagery and which serve as interfaces to all motor activities. Since representations resulting from exact quantitative reconstruction have turned out to be very hard to obtain, we argue here for the necessity of representations which can be computed easily, reliably and in real time and which recover only the information about the 3D world which is really needed in order to solve the navigational problems at hand. In this paper we introduce a number of such representations capturing aspects of 3D motion and scene structure which are used for the solution of navigational problems implemented in visual servo systems. In particular, the following three problems are addressed: (a) to change the robot{\textquoteright}s direction of motion towards a fixed direction, (b) to pursue a moving target while keeping a certain distance from the target, and (c) to follow a wall-like perimeter. The importance of the introduced representations lies in the following: \&$\#$x96; They can be extracted using minimal visual information, in particular the sign of flow measurements or the the first order spatiotemporal derivatives of the image intensity function. In that sense they are direct representations needing no intermediate level of computation such as correspondence. \&$\#$x96; They are global in the sense that they represent how three-dimensional information is globally encoded in them. Thus, they are robust representations since local errors do not affect them. \&$\#$x96; Usually, from sequences of images, three-dimensional quantities such as motion and shape are computed and used as input to control processes. The representations discussed here are given directly as input to the control procedures, thus resulting in a real time solution.},
	isbn = {978-3-540-61122-6},
	url = {http://dx.doi.org/10.1007/BFb0015577},
	author = {LoongFah Cheong and Ferm{\"u}ller, Cornelia and Aloimonos, J.},
	editor = {Buxton,Bernard and Cipolla,Roberto}
}
@inbook {18680,
	title = {On stratified sampling for high coverage estimations},
	booktitle = {Dependable Computing {\textemdash} EDCC-2},
	series = {Lecture Notes in Computer Science},
	volume = {1150},
	year = {1996},
	month = {1996///},
	pages = {35 - 54},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This paper addresses the problem of estimating the coverage of a fault tolerance mechanism through statistical processing of observations collected in faultinjection experiments. In an earlier paper, several techniques for sampling the fault/activity input space of a fault tolerance mechanism were presented. Various estimators based on simple sampling in the whole space and stratified sampling in a partitioned space were studied; confidence limits were derived based on a normal approximation. In this paper, the validity of this approximation is analyzed, especially for high coverage systems. The theory of confidence regions is then introduced to estimate the coverage without approximation when, for practical reasons, stratification is used. Three statistics are considered for defining confidence regions. It is shown that one of these statistics {\textemdash} a vectorial statistic {\textemdash} is often more conservative than the other two. However, only the vectorial statistic is computationally tractable. The results obtained are compared with those based on approximation by means of three hypothetical example systems.},
	keywords = {Computer science},
	isbn = {978-3-540-61772-3},
	url = {http://www.springerlink.com/content/7t2w2u472601h730/abstract/},
	author = {Powell,David and Michel Cukier and Arlat,Jean},
	editor = {Hlawiczka,Andrzej and Silva,Jo{\~a}o and Simoncini,Luca}
}
@conference {17897,
	title = {Stripe: a software tool for efficient triangle strips},
	booktitle = {ACM SIGGRAPH 96 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH {\textquoteright}96},
	series = {SIGGRAPH {\textquoteright}96},
	year = {1996},
	month = {1996///},
	pages = {153{\textendash} - 153{\textendash}},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {0-89791-784-7},
	doi = {10.1145/253607.253894},
	url = {http://doi.acm.org/10.1145/253607.253894},
	author = {Evans,Francine and Skiena,Steven and Varshney, Amitabh}
}
@article {15221,
	title = {On strongly connected digraphs with bounded cycle length},
	journal = {Discrete Applied Mathematics},
	volume = {69},
	year = {1996},
	month = {1996/08/27/},
	pages = {281 - 289},
	abstract = {Given a directed graph G = (V, E), a natural problem is to choose a minimum number of the edges in E such that, for any two vertices u and v, if there is a path from u to v in E, then there is a path from u to v among the chosen edges. We show that in graphs having no directed cycle with more than three edges, this problem is equivalent to Maximum Bipartite Matching. This leads to a small improvement in the performance guarantee of the previous best approximation algorithm for the general problem.},
	isbn = {0166-218X},
	doi = {10.1016/0166-218X(95)00105-Z},
	url = {http://www.sciencedirect.com/science/article/pii/0166218X9500105Z},
	author = {Khuller, Samir and Raghavachari,Balaji and Young,Neal}
}
@conference {13652,
	title = {Structural compression for document analysis},
	booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on},
	volume = {3},
	year = {1996},
	month = {1996/08//},
	pages = {664 -668 vol.3 - 664 -668 vol.3},
	abstract = {In this paper we describe a structural compression technique to be used for document text image storage and retrieval. The primary objective is to provide an efficient representation, storage, transmission and display. A secondary objective is to provide an encoding which allows access to specified regions within the image and facilitates traditional document processing operations without requiring complete decoding. We describe an algorithm which symbolically decomposes a document image and structurally orders the error bitmap based on a probabilistic model. The resultant symbol and error representations lend themselves to reasonably high compression ratios and are structured so as to allow operations directly on the compressed image. The compression scheme is implemented and compared to traditional compression methods},
	keywords = {analysis;document, bitmap;error, coding;image, compression, compression;document, compression;symbol, decomposition;data, image, manipulation;, processing;image, ratios;document, recognition;probability;symbol, representations;structural, representations;symbolic, retrieval;document, storage;error, text},
	doi = {10.1109/ICPR.1996.547029},
	author = {Kia,O. E and David Doermann}
}
@conference {13653,
	title = {Structure Preserving Document Image Compression and Transmission},
	booktitle = {ICIP},
	year = {1996},
	month = {1996///},
	pages = {193 - 196},
	author = {Kia,O. and David Doermann}
}
@article {11997,
	title = {The synthesis of vision and action},
	journal = {Exploratory vision: the active eye},
	year = {1996},
	month = {1996///},
	pages = {205 - 205},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@article {13018,
	title = {Sampling properties of DNA sequence data in phylogenetic analysis},
	journal = {Mol Biol Evol},
	volume = {12},
	year = {1995},
	month = {1995/09//},
	pages = {814 - 822},
	abstract = {We inferred phylogenetic trees from individual genes and random samples of nucleotides from the mitochondrial genomes of 10 vertebrates and compared the results to those obtained by analyzing the whole genomes. Individual genes are poor samples in that they infrequently lead to the whole-genome tree. A large number of nucleotide sites is needed to exactly determine the whole-genome tree. A relatively small number of sites, however, often results in a tree close to the whole-genome tree. We found that blocks of contiguous sites were less likely to lead to the whole-genome tree than samples composed of sites drawn individually from throughout the genome. Samples of contiguous sites are not representative of the entire genome, a condition that violates a basic assumption of the bootstrap method as it is applied in phylogenetic studies.},
	author = {Cummings, Michael P. and Otto,S. P and Wakeley,J.}
}
@article {15022,
	title = {Scalable data parallel algorithms for texture synthesis using Gibbs random fields},
	journal = {Image Processing, IEEE Transactions on},
	volume = {4},
	year = {1995},
	month = {1995/10//},
	pages = {1456 - 1460},
	abstract = {This article introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov random field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. The use of fine-grained, data parallel processing techniques yields real-time algorithms for texture synthesis and compression that are substantially faster than the previously known sequential implementations. Although current implementations are on Connection Machines, the methodology presented enables machine-independent scalable algorithms for a number of problems in image processing and analysis},
	keywords = {algorithms;maximum, algorithms;parallel, algorithms;scalable, algorithms;texture, analysis;image, CM-2;Thinking, CM-5;fine-grained, compression;image, compression;texture, Connection, data, estimation;model, estimation;parallel, field;Thinking, fields;Markov, likelihood, machine, Machines;Gibbs, machines;random, Parallel, parameter, processes;, processes;data, processing;image, processing;machine-independent, random, representation;real-time, scalable, synthesis;Markov, texture;maximum},
	isbn = {1057-7149},
	doi = {10.1109/83.465111},
	author = {Bader, D.A. and JaJa, Joseph F. and Chellapa, Rama}
}
@article {14409,
	title = {Scope and abstraction: Two criteria for localized planning},
	journal = {INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE},
	volume = {14},
	year = {1995},
	month = {1995///},
	pages = {1612 - 1619},
	abstract = {Localization is a general-purpose representational technique for partitioning a problem intosubproblems. A localized problem-solver searches several smaller search spaces, one for each
subproblem. Unlike most methods of partitioning, however, localization allows for subprob-
lems that overlap  i.e. multiple search spaces may be involved in constructing shared pieces
of the overall plan. In this paper we focus on two criteria for forming localizations: scope
and abstraction. We describe a method for automatically generating such localizations and
provide empirical results that contrast their use in an o ce-building construction domain.
},
	author = {Lansky,A. L and Getoor, Lise}
}
@article {14255,
	title = {Seeing and understanding: representing the visual world},
	journal = {ACM Comput. Surv.},
	volume = {27},
	year = {1995},
	month = {1995/09//},
	pages = {307 - 309},
	isbn = {0360-0300},
	doi = {10.1145/212094.212101},
	url = {http://doi.acm.org/10.1145/212094.212101},
	author = {Aloimonos, J. and Ferm{\"u}ller, Cornelia and Rosenfeld, A.}
}
@conference {13853,
	title = {Selecting Tense, Aspect, and Connecting Words In Language Generation},
	booktitle = {In Proceedings of IJCAI-95},
	year = {1995},
	month = {1995///},
	pages = {1299 - 1305},
	abstract = {Generating language that reflects the temporal organization of represented knowledge requires a language generation model that integrates contemporary theories of tense and aspect, temporal representations, and methods to plan text. This paper presents a model that produces complex sentences that reflect temporal relations present in underlying temporal concepts. The main result of this work is the successful application of constrained linguistic theories of tense and aspect to a generator which produces meaningful event combinations and selects appropriate connecting words that relate them.  1 Introduction  Reasoning about temporal knowledge and formulating answers to questions that involve time necessitate the presentation of temporal information to users. One approach is to incorporate the temporal information directly into natural language paraphrases of the represented knowledge. This requires a method to plan language that contains not only tense selections, but aspect selections...},
	author = {Dorr, Bonnie J and Gaasterland,Terry}
}
@article {18426,
	title = {SEL{\textquoteright}s software process improvement program},
	journal = {Software, IEEE},
	volume = {12},
	year = {1995},
	month = {1995/11//},
	pages = {83 - 87},
	abstract = {We select candidates for process change on the basis of quantified Software Engineering Laboratory (SEL) experiences and clearly defined goals for the software. After we select the changes, we provide training and formulate experiment plans. We then apply the new process to one or more production projects and take detailed measurements. We assess process success by comparing these measures with the continually evolving baseline. Based upon the results of the analysis, we adopt, discard, or revise the process},
	keywords = {baseline;detailed, engineering, engineering;, evolving, improvement, Laboratory;continually, measurements;experiment, plans;production, process, program;software, projects;training;software, SEL, software},
	isbn = {0740-7459},
	doi = {10.1109/52.469763},
	author = {Basili, Victor R. and Zelkowitz, Marvin V and McGarry,F. and Page,J. and Waligora,S. and Pajerski,R.}
}
@article {15215,
	title = {A simple randomized sieve algorithm for the closest-pair problem},
	journal = {Information and Computation},
	volume = {118},
	year = {1995},
	month = {1995///},
	pages = {34 - 37},
	abstract = {We present a linear time randomized sieve algorithm for the closest-pair problem. Thealgorithm as well as its analysis are simple. The algorithm is extended to obtain a randomized
linear time approximation algorithm for the closest bichromatic pair problem.
},
	author = {Khuller, Samir and Matias,Y.}
}
@article {17726,
	title = {On the solution of block Hessenberg systems},
	journal = {Numerical Linear Algebra with Applications},
	volume = {2},
	year = {1995},
	month = {1995/05/01/},
	pages = {287 - 296},
	abstract = {This paper describes a divide-and-conquer strategy for solving block Hessenberg systems. For dense matrices the method is as efficient as Gaussian elimination; however, because it works almost entirely with the original blocks, it is much more efficient for sparse matrices or matrices whose blocks can be generated on the fly. For Toeplitz matrices, the algorithm can be combined with the fast Fourier transform.},
	keywords = {block Hessenberg matrix, Block Toeplitz matrix, linear system, queue},
	isbn = {1099-1506},
	doi = {10.1002/nla.1680020309},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/nla.1680020309/abstract},
	author = {Stewart, G.W.}
}
@conference {12176,
	title = {Space-scale diagrams: understanding multiscale interfaces},
	booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems},
	year = {1995},
	month = {1995///},
	pages = {234 - 241},
	author = {Furnas,G.W. and Bederson, Benjamin B.}
}
@conference {17660,
	title = {Splitters and near-optimal derandomization},
	booktitle = {, 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings},
	year = {1995},
	month = {1995/10/23/25},
	pages = {182 - 191},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2k configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal ΣIIΣ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits},
	keywords = {Boosting, Circuit testing, computational complexity, computational linguistics, Computer science, Contracts, derandomization, deterministic constructions, Educational institutions, Engineering profession, exhaustive testing, fairly general method, fixed-subgraph finding algorithms, hardness of approximation, Information systems, k-restrictions, learning, local-coloring protocol, MATHEMATICS, near-optimal constructions, near-optimal derandomization, Parallel algorithms, probabilistic bound, probability, Protocols, randomised algorithms, Set cover, splitters},
	isbn = {0-8186-7183-1},
	doi = {10.1109/SFCS.1995.492475},
	author = {Naor,M. and Schulman,L. J and Srinivasan, Aravind}
}
@article {17727,
	title = {On the stability of sequential updates and downdates},
	journal = {Signal Processing, IEEE Transactions on},
	volume = {43},
	year = {1995},
	month = {1995/11//},
	pages = {2642 - 2648},
	abstract = {The updating and downdating of Cholesky decompositions has important applications in a number of areas. There is essentially one standard updating algorithm, based on plane rotations, which is backward stable. Three downdating algorithms have been treated in the literature: the LINPACK algorithm, the method of hyperbolic transformations, and Chambers{\textquoteright} (1971) algorithm. Although none of these algorithms is backward stable, the first and third satisfy a relational stability condition. It is shown that relational stability extends to a sequence of updates and downdates. In consequence, other things being equal, if the final decomposition in the sequence is well conditioned, it will be accurately computed, even though intermediate decompositions may be almost completely inaccurate. These results are also applied to the two-sided orthogonal decompositions, such as the URV decomposition},
	keywords = {algorithm;Cholesky, algorithm;downdating, algorithm;error, algorithm;URV, algorithms;hyperbolic, analysis;matrix, analysis;sequential, Chambers{\textquoteright}, condition;rounding, decomposition;backward, decomposition;numerical, decomposition;plane, decompositions;LINPACK, decompositions;updating, downdates;sequential, error, errors;sequences;, orthogonal, rotations;relational, stability, stability;roundoff, stable, transformations;matrix, updates;stability;two-sided},
	isbn = {1053-587X},
	doi = {10.1109/78.482114},
	author = {Stewart, G.W.}
}
@article {17380,
	title = {Starfield information visualization with interactive smooth zooming},
	journal = {Proc. IFIP 2.6 Visual Databases Systems},
	year = {1995},
	month = {1995///},
	pages = {3 - 14},
	abstract = {This paper discusses the design and implementation of interactive smooth zooming of a starfield display (which is a visualization of a multi-attribute database) and introduces the zoom bar, a new widget for zooming and panning. Whereas traditional zoom techniques are based on zooming towards or away from a focal point, this paper introduces a novel approach based on zooming towards or away from a fixed line.Starfield displays plot items from a database as small selectable glyphs using two of the ordinal attributes of the data as the variables along the display axes. One way of filtering this visual information is by changing the range of displayed values on either of the display axes. If this is done incrementally and smoothly, the starfield display appears to zoom in and out, and users can track the motion of the glyphs without getting disoriented by sudden, large changes in context.
},
	author = {Jog,N. and Shneiderman, Ben}
}
@inbook {17381,
	title = {Starfield visualization with interactive smooth zooming},
	booktitle = {Visual database systems, IIIVisual database systems, III},
	volume = {3},
	year = {1995},
	month = {1995///},
	pages = {1 - 1},
	abstract = {This paper discusses the design and implementation of interactive smooth zooming of a starfield display (which is a visualization of a multi-attribute database) and introduces the zoom bar, a new widget for zooming and panning. Whereas traditional zoom techniques are based on zooming towards or away from a focal point, this paper introduces a novel approach based on zooming towards or away from a fixed line.Starfield displays plot items from a database as small selectable glyphs using two of the ordinal attributes of the data as the variables along the display axes. One way of filtering this visual information is by changing the range of displayed values on either of the display axes. If this is done incrementally and smoothly, the starfield display appears to zoom in and out, and users can track the motion of the glyphs without getting disoriented by sudden, large changes in context.
},
	author = {Jogt,NK and Shneiderman, Ben}
}
@conference {14855,
	title = {Stochastic completion fields: a neural model of illusory contour shape and salience},
	booktitle = {Computer Vision, 1995. Proceedings., Fifth International Conference on},
	year = {1995},
	month = {1995/06//},
	pages = {408 - 415},
	abstract = {We describe an algorithm and representation level theory of illusory contour shape and salience. Unlike previous theories, our model is derived from a single assumption-namely, that the prior probability distribution of boundary completion shape can be modeled by a random walk in a lattice whose points are positions and orientations in the image plane (i.e. the space which one can reasonably assume is represented by neurons of the mammalian visual cortex). Our model does not employ numerical relaxation or other explicit minimization, but instead relies on the fact that the probability that a particle following a random walk will pass through a given position and orientation on a path joining two boundary fragments can be computed directly as the product of two vector-field convolutions. We show that for the random walk we define, the maximum likelihood paths are curves of least energy, that is, on average, random walks follow paths commonly assumed to model the shape of illusory contours. A computer model is demonstrated on numerous illusory contour stimuli from the literature},
	keywords = {boundary, completion, computational, Computer, contour, contours;, convolutions;, cortex;, curves, detection;, distribution;, edge, energy;, estimation;, fields;, fragments;, geometry;, illusory, image, lattice;, least, likelihood, mammalian, maximum, model;, nets;, neural, of, paths;, plane;, probability, probability;, random, recognition;, shape;, stimuli;, Stochastic, vector-field, visual, walk;},
	doi = {10.1109/ICCV.1995.466910},
	author = {Williams,L. R and Jacobs, David W.}
}
@article {18435,
	title = {Striving for correctness},
	journal = {Computers \& Security},
	volume = {14},
	year = {1995},
	month = {1995///},
	pages = {719 - 738},
	abstract = {In developing information technology, you want assurance that systems are secure and reliable, but you cannot have assurance or security without correctness. We discuss methods used to achieve correctness, focusing on weaknesses and approaches that management might take to increase belief in correctness. Formal methods, simulation, testing, and process modeling are addressed in detail. Structured programming, life-cycle modeling like the spiral model, use of CASE tools, use of formal methods, object-oriented design, reuse of existing code are also mentioned. Reliance on these methods involves some element of belief since no validated metrics on the effectiveness of these methods exist. Suggestions for using these methods as the basis for managerial decisions conclude the paper.},
	keywords = {Assurance, belief, correctness, Formal Methods, MATHEMATICAL MODELS, metrics, Process models, Risk management, Security testing, Silver bullets, simulation, Trustworthiness},
	isbn = {0167-4048},
	doi = {10.1016/0167-4048(95)00022-4},
	url = {http://www.sciencedirect.com/science/article/pii/0167404895000224},
	author = {Abrams,Marshall D. and Zelkowitz, Marvin V}
}
@article {17388,
	title = {Survival of the fittest: the evolution of multimedia user interfaces},
	journal = {ACM Computing Surveys},
	volume = {27},
	year = {1995},
	month = {1995/12//},
	pages = {557 - 559},
	isbn = {0360-0300},
	doi = {10.1145/234782.234789},
	url = {http://doi.acm.org/10.1145/234782.234789},
	author = {Preece,Jenny and Shneiderman, Ben}
}
@inbook {15821,
	title = {The SVD in Image Restoration},
	booktitle = {SVD and Signal Processing III: Algorithms, Architectures, and ApplicationsSVD and Signal Processing III: Algorithms, Architectures, and Applications},
	year = {1995},
	month = {1995///},
	pages = {315 - 322},
	publisher = {Elsevier},
	organization = {Elsevier},
	address = {New York},
	author = {O{\textquoteright}Leary, Dianne P.},
	editor = {Moonen,Marc and DeMoor,Bart}
}
@article {15406,
	title = {Switching as an exit problem},
	journal = {Magnetics, IEEE Transactions on},
	volume = {31},
	year = {1995},
	month = {1995/11//},
	pages = {3545 - 3547},
	abstract = {Previously, it has been shown that Preisach type models driven by stochastic inputs can be employed to model aftereffect. In this model, the machinery of the ldquo;exit problem rdquo; is instrumental in computing the time evolutions of the expected value and the distributions of switching times. Here, for the first time, we present numerical simulation results of the aforementioned viscosity models and demonstrate that these models can be employed to compute switching times and time evolutions of the expected value of magnetization},
	keywords = {aftereffect;magnetic, aftereffect;stochastic, analysis;, distribution;viscosity, force;fluctuations;magnetic, hysteresis;magnetic, inputs;switching, models;coercive, models;exit, Preisach, problem;expected, switching;numerical, times, type, value;magnetization;model},
	isbn = {0018-9464},
	doi = {10.1109/20.489564},
	author = {Korman,C.E. and Mayergoyz, Issak D}
}
@article {16507,
	title = {Symmetries of natural and artificial neural networks},
	journal = {Symmetry: Culture and Science},
	volume = {6},
	year = {1995},
	month = {1995///},
	pages = {446 - 449},
	author = {Reggia, James A.}
}
@article {18866,
	title = {Systematic approach to analysing the manufacturability of machined parts},
	journal = {Computer-Aided Design},
	volume = {27},
	year = {1995},
	month = {1995/05//},
	pages = {323 - 342},
	abstract = {The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce leadtimes, analysing the manufacturability of the proposed design has become an important step in the design stage. The paper presents an approach to analysing the manufacturability of machined parts.Evaluating the manufacturability of a proposed design involves determining whether or not it is manufacturable with a given set of manufacturing operations, and, if it is, finding the associated manufacturing efficiency. Since there can be several different ways to manufacture a proposed design, this requires that different ways to manufacture it be considered, in order to determine which one best meets the design and manufacturing objectives.
The first step in the approach is to identify all the machining operations which can potentially be used to create the given design. Using these operations, different operation plans are generated for machining the part. Each time a new operation plan is generated, the user examines whether it can produce the desired shape and tolerances, and calculates its manufacturability rating. If no operation plan can be found that is capable of producing the design, then the given design is considered unmachinable; otherwise, the manufacturability rating for the design is the rating of the best operation plan.
The authors expect that, by providing feedback about possible problems with the design, the work described in the paper will help in speeding up the evaluation of new product designs so that it can be decided how or whether to manufacture them. Such a capability will be useful in responding quickly to changing demands and opportunities in the marketplace.
},
	keywords = {computer-aided manufacturability analysis, design for manufacturability, feature-based models},
	isbn = {0010-4485},
	doi = {10.1016/0010-4485(95)96797-P},
	url = {http://www.sciencedirect.com/science/article/pii/001044859596797P},
	author = {Gupta, Satyandra K. and Nau, Dana S.}
}
@conference {14881,
	title = {Segmenting independently moving, noisy points},
	booktitle = {Motion of Non-Rigid and Articulated Objects, 1994., Proceedings of the 1994 IEEE Workshop on},
	year = {1994},
	month = {1994/11//},
	pages = {96 - 103},
	abstract = {There has been much work on using point features tracked through a video sequence to determine structure and motion. In many situations, to use this work, we must first isolate subsets of points that share a common motion. This is hard because we must distinguish between independent motions and apparent deviations from a single motion due to noise. We propose several methods of searching for point-sets with consistent 3D motions. We analyze the potential sensitivity of each method for detecting independent motions, and experiment with each method on a real image sequence},
	keywords = {3D, common, consistent, estimation;, features;, image, independently, linear, MOTION, motion;, moving, noisy, point, points;, programming;, real, segmentation;, sequence;, sequences;, video},
	doi = {10.1109/MNRAO.1994.346249},
	author = {Jacobs, David W. and Chennubhotla,C.}
}
@article {16465,
	title = {A Semantics for a class of non-deterministic and causal production system programs},
	journal = {Journal of Automated Reasoning},
	volume = {12},
	year = {1994},
	month = {1994///},
	pages = {305 - 349},
	author = {Raschid, Louiqa and Lobo,J.}
}
@conference {14579,
	title = {A SIMD solution to the sequence comparison problem on the MGAP},
	booktitle = {International Conference on Application Specific Array Processors, 1994. Proceedings},
	year = {1994},
	month = {1994/08/22/24},
	pages = {336 - 345},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Molecular biologists frequently compare an unknown biosequence with a set of other known biosequences to find the sequence which is maximally similar, with the hope that what is true of one sequence, either physically or functionally, could be true of its analogue. Even though efficient dynamic programming algorithms exist for the problem, when the size of the database is large, the time required is quite long, even for moderate length sequences. In this paper, we present an efficient pipelined SIMD solution to the sequence alignment problem on the Micro-Grain Array Processor (MGAP), a fine-grained massively parallel array of processors with nearest-neighbor connections. The algorithm compares K sequences of length O(M) with the actual sequence of length N, in O(M+N+K) time with O(MN) processors, which is AT-optimal. The implementation on the MGAP computes at the rate of about 0.1 million comparisons per second for sequences of length 128},
	keywords = {AT-optimal algorithm, Biological information theory, biology computing, biosequence comparison problem, computational complexity, Computer science, Costs, database size, Databases, DNA computing, dynamic programming, dynamic programming algorithms, fine-grained massively parallel processor array, Genetics, Heuristic algorithms, maximally similar sequence, MGAP parallel computer, Micro-Grain Array Processor, Military computing, molecular biology, molecular biophysics, Nearest neighbor searches, nearest-neighbor connections, Parallel algorithms, pipeline processing, pipelined SIMD solution, sequence alignment problem, sequences},
	isbn = {0-8186-6517-3},
	doi = {10.1109/ASAP.1994.331791},
	author = {Borah,M. and Bajwa,R. S and Hannenhalli, Sridhar and Irwin,M. J}
}
@article {16365,
	title = {Simplifying polynomial constraints over integers to make dependence analysis more precise},
	journal = {Parallel Processing: CONPAR 94{\textemdash}VAPP VI},
	year = {1994},
	month = {1994///},
	pages = {737 - 748},
	author = {Maslov,V. and Pugh, William}
}
@article {15405,
	title = {Simulation of the transient characteristics of partially- and fully-depleted SOI MOSFETs},
	journal = {Solid-State Electronics},
	volume = {37},
	year = {1994},
	month = {1994/07//},
	pages = {1387 - 1394},
	abstract = {We present a numerical technique which employs a local-in-time initial guess for the transient simulation of SOI MOSFETs. Specifically, the goal of this work is to compute the transient drain current which exhibits overshoot. A critical factor in such computations is the choice of the initial guess at each time point after the gate ramp. Our numerical simulations have shown that the use of the previous time point solution as an initial guess in the Gummel iterations fails to predict the decay in the drain current from its maximum overshoot value. This difficulty is circumvented when the steady-state solution is used as a local-in-time initial guess. We use the diagonally implicit Runge-Kutta method for the time domain discretization. A fixed-point iteration technique is employed for the space domain iterations. To demonstrate the usefulness of the local-in-time method, numerical results of the transient drain current for various device parameters, such as the silicon film doping, silicon film thickness and back-gate bias are presented.},
	isbn = {0038-1101},
	doi = {10.1016/0038-1101(94)90197-X},
	url = {http://www.sciencedirect.com/science/article/pii/003811019490197X},
	author = {Tai,Gwo-Chung and Korman,Can E. and Mayergoyz, Issak D}
}
@article {16476,
	title = {A simulation-based study on the concurrent execution of rules in a database environment},
	journal = {Journal of Parallel and Distributed computing},
	volume = {20},
	year = {1994},
	month = {1994///},
	pages = {20 - 42},
	author = {Raschid, Louiqa and Sellis,T. and Delis,A.}
}
@article {13022,
	title = {Slipped-strand mispairing in a plastid gene: {\i}t rpoC2 in grasses (Poaceae)},
	journal = {Mol Biol Evol},
	volume = {11},
	year = {1994},
	month = {1994/01//},
	pages = {1 - 8},
	abstract = {An exception to the generally conservative nature of plastid gene evolution is the gene coding for the beta" subunit of RNA polymerase, rpoC2. Previous work by others has shown that maize and rice have an insertion in the coding region of rpoC2, relative to spinach and tobacco. To assess the distribution of this extra coding sequence, we surveyed a broad phylogenetic sample comprising 55 species from 17 angiosperm families by using Southern hybridization. The extra coding sequence is restricted to the grasses (Poaceae). DNA sequence analysis of 11 species from all five subfamilies within the grass family demonstrates that the extra sequence in the coding region of rpoC2 is a repetitive array that exhibits more than a twofold increase in nucleotide substitution, as well as a large number of insertion/deletion events, relative to the adjacent flanking sequences. The structure of the array suggests that slipped-strand mispairing causes the repeated motifs and adds to the mechanisms through which the coding sequence of plastid genes are known to evolve. Phylogenetic analyses based on the sequence data from grass species support several relationships previously suggested by morphological work, but they are ambiguous about broad relationships within the family.},
	author = {Cummings, Michael P. and King,L. M and Kellogg,E. A}
}
@article {18432,
	title = {Software Process Improvement in the NASA Software Engineering Laboratory.},
	year = {1994},
	month = {1994/12//},
	institution = {CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INSTITUTE},
	abstract = {The Software Engineering Laboratory (SEL) was established in 1976 for the purpose of studying and measuring software processes with the intent of identifying improvements that could be applied to the production of ground support software within the Flight Dynamics Division (FDD) at the National Aeronautics and Space Administration (NASA)/Goddard Space Flight Center (GSFC). The SEL has three member organizations: NASA/GSFC, the University of Maryland, and Computer Sciences Corporation (CSC). The concept of process improvement within the SEL focuses on the continual understanding of both process and product as well as goal-driven experimentation and analysis of process change within a production environment.},
	keywords = {*AWARDS, *SOFTWARE ENGINEERING, *SYSTEMS ANALYSIS, *WORK MEASUREMENT, ADMINISTRATION AND MANAGEMENT, COMPUTER PROGRAMMING AND SOFTWARE, COMPUTER PROGRAMS, COMPUTERS, data acquisition, ENVIRONMENTS, EXPERIMENTAL DATA, GROUND SUPPORT., measurement, Organizations, PE63756E, Production, SOFTWARE PROCESS IMPROVEMENT, SPI(SOFTWARE PROCESS IMPROVEMENT), SPN-19950120014},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA289912},
	author = {McGarry,Frank and Pajerski,Rose and Page,Gerald and Waligora,Sharon and Basili, Victor R.}
}
@inbook {18691,
	title = {Software reliability analysis of three successive generations of a Switching System},
	booktitle = {Dependable Computing {\textemdash} EDCC-1},
	series = {Lecture Notes in Computer Science},
	volume = {852},
	year = {1994},
	month = {1994///},
	pages = {471 - 490},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Most current approaches to software reliability evaluation are based on data collected on a single generation of products. However, many applications are developed through improvements of the existing software: to the families of products are added various generations as the need for new functionalities arises. Experimental studies dealing with the analysis of data collected on families of products are seldom reported. In this paper, we analyze the data (failure and correction reports) collected on the software of three successive generations of the Brazilian Switching System {\textemdash} TROPICO-R, during validation and operation. A comparative analysis of the three products is done and the main results are outlined. Emphasis is placed on the evolution of the software and the corresponding failures and corrected faults. The analysis addresses: i) the modifications introduced on system components, ii) the distribution of failures and corrected faults in the components and the functions fulfilled by the system, and iii) the evolution of the failure intensity functions.},
	keywords = {Computer science},
	isbn = {978-3-540-58426-1},
	url = {http://www.springerlink.com/content/f71g30v177521471/abstract/},
	author = {Ka{\^a}niche,M. and Kanoun,K. and Michel Cukier and Martini,M.},
	editor = {Echtle,Klaus and Hammer,Dieter and Powell,David}
}
@book {18433,
	title = {Software Specification: A Comparison of Formal Methods},
	year = {1994},
	month = {1994///},
	publisher = {Intellect Books},
	organization = {Intellect Books},
	keywords = {Computer software, Computer software/ Specifications, Computers / General, Computers / Programming / General, Formal methods (Computer science), software engineering, specifications},
	isbn = {9781567500332},
	author = {Gannon,John D. and Purtilo,James and Zelkowitz, Marvin V}
}
@inbook {15809,
	title = {Some Themes in Gene H.Golub{\textquoteright}s Work on Iterative Methods},
	booktitle = {Recent Advances in Iterative MethodsRecent Advances in Iterative Methods},
	volume = {60},
	year = {1994},
	month = {1994///},
	pages = {1 - 11},
	publisher = {Springer-Verlag IMA Volumes in Mathematics and Its Applications},
	organization = {Springer-Verlag IMA Volumes in Mathematics and Its Applications},
	address = {New York},
	author = {O{\textquoteright}Leary, Dianne P.},
	editor = {Golub, Gene H. and Greenbaum,Anne and Luskin,Mitchell}
}
@article {12183,
	title = {Space variant image processing},
	journal = {International Journal of Computer Vision},
	volume = {13},
	year = {1994},
	month = {1994///},
	pages = {71 - 90},
	author = {Wallace,R.S. and Ong,P.W. and Bederson, Benjamin B. and Schwartz,E.L.}
}
@article {15028,
	title = {Special issue on data parallel algorithms and programming},
	journal = {Journal of Parallel and Distributed Computing},
	volume = {21},
	year = {1994},
	month = {1994/04//},
	pages = {1 - 3},
	isbn = {0743-7315},
	doi = {10.1006/jpdc.1994.1037},
	url = {http://dx.doi.org/10.1006/jpdc.1994.1037},
	author = {JaJa, Joseph F. and Wang,Pearl Y.}
}
@article {17379,
	title = {Split menus: effectively using selection frequency to organize menus},
	journal = {ACM Transactions on Computer-Human Interaction},
	volume = {1},
	year = {1994},
	month = {1994/03//},
	pages = {27 - 51},
	abstract = {When some items in a menu are selected more frequently than others, as is often the case, designers or individual users may be able to speed performance and improve preference ratings by placing several high-frequency items at the top of the menu. Design guidelines for split menus were developed and applied. Split menus were implemented and tested in two in situ usability studies and a controlled experiment. In the usability studies performance times were reduced by 17 to 58\% depending on the site and menus. In the controlled experiment split menus were significantly faster than alphabetic menus and yielded significantly higher subjective preferences. A possible resolution to the continuing debate among cognitive theorists about predicting menu selection times is  offered. We conjecture and offer evidence that, at least when selecting items from pull-down menus, a logarithmic model applies to familiar (high-frequency) items, and a linear model to unfamiliar (low-frequency) items.},
	keywords = {Human-computer interaction, menus, selection frequency, split menus, user interface},
	isbn = {1073-0516},
	doi = {10.1145/174630.174632},
	url = {http://doi.acm.org/10.1145/174630.174632},
	author = {Sears,Andrew and Shneiderman, Ben}
}
@article {16358,
	title = {Static analysis of upper and lower bounds on dependences and parallelism},
	journal = {ACM Transactions on Programming Languages and SystemsACM Trans. Program. Lang. Syst.},
	volume = {16},
	year = {1994},
	month = {1994/07//},
	pages = {1248 - 1278},
	isbn = {01640925},
	doi = {10.1145/183432.183525},
	url = {http://dl.acm.org/citation.cfm?id=183525},
	author = {Pugh, William and Wonnacott,David}
}
@article {14873,
	title = {A study of affine matching with bounded sensor error},
	journal = {International Journal of Computer Vision},
	volume = {13},
	year = {1994},
	month = {1994///},
	pages = {7 - 32},
	abstract = {Affine transformations of the plane have been used in a number of model-based recognition systems. Because the underlying mathematics are based on exact data, in practice various heuristics are used to adapt the methods to real data where there is positional uncertainty. This paper provides a precise analysis of affine point matching under uncertainty. We obtain an expression for the range of affine-invariant values that are consistent with a given set of four points, where each image point lies in an isin-disc of uncertainty. This range is shown to depend on the actualx-y-positions of the data points. In other words, given uncertainty in the data there are no representations that are invariant with respect to the Cartesian coordinate system of the data. This is problematic for methods, such as geometric hashing, that are based on affine-invariant representations. We also analyze the effect that uncertainty has on the probability that recognition methods using affine transformations will find false positive matches. We find that there is a significant probability of false positives with even moderate levels of sensor error, suggesting the importance of good verification techniques and good grouping techniques.},
	doi = {10.1007/BF01420793},
	author = {Grimson,W. E.L and Huttenlocher,D. P and Jacobs, David W.}
}
@article {19003,
	title = {Suppressor U1 snRNAs in Drosophila.},
	journal = {GeneticsGenetics},
	volume = {138},
	year = {1994},
	month = {1994/10/01/},
	pages = {365 - 378},
	abstract = {Although the role of U1 small nuclear RNAs (snRNAs) in 5{\textquoteright} splice site recognition is well established, suppressor U1 snRNAs active in intact multicellular animals have been lacking. Here we describe suppression of a 5{\textquoteright} splice site mutation in the Drosophila melanogaster white gene (w(DR18)) by compensatory changes in U1 snRNA. Mutation of positions -1 and +6 of the 5{\textquoteright} splice site of the second intron (ACG|GTGACT to ACC|GTGAGC) results in the accumulation of RNA retaining this 74-nucleotide intron in both transfected cells and transgenic flies. U1-3G, a suppressor U1 snRNA which restores basepairing at position +6 of the mutant intron, increases the ratio of spliced to unspliced w(DR18) RNA up to fivefold in transfected Schneider cells and increases eye pigmentation in w(DR18) flies. U1-9G, which targets position -1, suppresses w(DR18) in transfected cells less well. U1-3G,9G has the same effect as U1-3G although it accumulates to lower levels. Suppression of w(DR18) has revealed that the U1b embryonic variant (G134 to U) is active in Schneider cells and pupal eye discs. However, the combination of 9G with 134U leads to reduced accumulation of both U1b-9G and U1b-3G,9G, possibly because nucleotides 9 and 134 both participate in a potential long-range intramolecular base-pairing interaction. High levels of functional U1-3G suppressor reduce both viability and fertility in transformed flies. These results show that, despite the difficulties inherent in stably altering splice site selection in multicellular organisms, it is possible to obtain suppressor U1 snRNAs in flies.},
	isbn = {0016-6731, 1943-2631},
	url = {http://www.genetics.org/content/138/2/365},
	author = {Lo,P. C. and Roy,D. and Mount, Stephen M.}
}
@conference {18050,
	title = {Symmetry breaking for suffix tree construction},
	booktitle = {Proceedings of the twenty-sixth annual ACM symposium on Theory of computing},
	year = {1994},
	month = {1994///},
	pages = {300 - 309},
	author = {Sahinalp,S. C and Vishkin, Uzi}
}
@article {14189,
	title = {A syntactic approach to scale-space-based corner description},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {16},
	year = {1994},
	month = {1994/07//},
	pages = {748 - 751},
	abstract = {Planar curves are described by information about corners integrated over various levels of resolution. The detection of corners takes place on a digital representation. To compensate for ambiguities arising from sampling problems due to the discreteness, results about the local behavior of curvature extrema in continuous scale-space are employed},
	keywords = {Computer vision, corner detection, curvature extrema, edge detection, IMAGE PROCESSING, image resolution, Image segmentation, Laboratories, Large-scale systems, PARALLEL PROCESSING, pattern recognition, planar curves, resolution, Sampling methods, sampling problems, scale space based corner description, SHAPE, Smoothing methods, syntactic approach},
	isbn = {0162-8828},
	doi = {10.1109/34.297957},
	author = {Ferm{\"u}ller, Cornelia and Kropatsch,W.}
}
@inbook {16221,
	title = {Scheduling home control devices: a case study of the transition from the research project to a product},
	booktitle = {Sparks of innovation in human-computer interactionSparks of innovation in human-computer interaction},
	year = {1993},
	month = {1993///},
	pages = {205 - 205},
	publisher = {Intellect Books},
	organization = {Intellect Books},
	isbn = {9781567500783},
	author = {Plaisant, Catherine and Shneiderman, Ben and Battagtia,J.}
}
@article {12365,
	title = {Scheduling synchronous dataflow graphs for efficient looping},
	journal = {The Journal of VLSI Signal Processing},
	volume = {6},
	year = {1993},
	month = {1993///},
	pages = {271 - 288},
	author = {Bhattacharyya, Shuvra S. and Lee,E. A}
}
@conference {16695,
	title = {Semantic classes and syntactic ambiguity},
	booktitle = {Proceedings of the workshop on Human Language Technology},
	year = {1993},
	month = {1993///},
	pages = {278 - 283},
	author = {Resnik, Philip}
}
@article {16513,
	title = {Simple systems that exhibit template-directed replication},
	journal = {Science},
	volume = {259},
	year = {1993},
	month = {1993///},
	pages = {1282 - 1287},
	author = {Reggia, James A. and Armentrout,S. L and Chou,H. H. and Peng,Y.}
}
@conference {16020,
	title = {Situated reasoning within tight deadlines and realistic space and computation bounds},
	booktitle = {Proc. Common Sense},
	volume = {93},
	year = {1993},
	month = {1993///},
	author = {Nirkhe,M. and Kraus,S. and Perlis, Don}
}
@conference {13469,
	title = {SOCAP: lessons learned in automating military operations planning},
	booktitle = {Proceedings of the 6th international conference on Industrial and engineering applications of artificial intelligence and expert systems},
	series = {IEA/AIE{\textquoteright}93},
	year = {1993},
	month = {1993///},
	pages = {384 - 393},
	publisher = {Gordon \&amp; Breach Science Publishers},
	organization = {Gordon \&amp; Breach Science Publishers},
	isbn = {2-88124-604-4},
	url = {http://dl.acm.org/citation.cfm?id=1114022.1114082},
	author = {Desimone,R. and Wilkins,D. E. and Bienkowski,M. and desJardins, Marie}
}
@book {17376,
	title = {Sparks of innovation in human-computer interaction},
	year = {1993},
	month = {1993///},
	publisher = {Intellect Books},
	organization = {Intellect Books},
	abstract = {These key papers from the 10th anniversary of the Human-Computer Interaction Laboratory (HCIL) at the University of Maryland, exemplify different research methodologies, and show the maturation of human-computer interaction research. The first section introduces how HCIL does what they do, including some of their failures and background stories that are not appropriate for journal papers. This book is a tribute to the faculty, staff, visitors, and students who have shared in a decade of work.},
	keywords = {Computers / Interactive \& Multimedia, Computers / Social Aspects / Human-Computer Interaction, Human-computer interaction},
	isbn = {9781567500783},
	author = {Shneiderman, Ben}
}
@article {18997,
	title = {Species-specific signals for the splicing of a short Drosophila intron in vitro.},
	journal = {Molecular and Cellular BiologyMol. Cell. Biol.},
	volume = {13},
	year = {1993},
	month = {1993/02/01/},
	pages = {1104 - 1118},
	abstract = {The effects of branchpoint sequence, the pyrimidine stretch, and intron size on the splicing efficiency of the Drosophila white gene second intron were examined in nuclear extracts from Drosophila and human cells. This 74-nucleotide intron is typical of many Drosophila introns in that it lacks a significant pyrimidine stretch and is below the minimum size required for splicing in human nuclear extracts. Alteration of sequences of adjacent to the 3{\textquoteright} splice site to create a pyrimidine stretch was necessary for splicing in human, but not Drosophila, extracts. Increasing the size of this intron with insertions between the 5{\textquoteright} splice site and the branchpoint greatly reduced the efficiency of splicing of introns longer than 79 nucleotides in Drosophila extracts but had an opposite effect in human extracts, in which introns longer than 78 nucleotides were spliced with much greater efficiency. The white-apricot copia insertion is immediately adjacent to the branchpoint normally used in the splicing of this intron, and a copia long terminal repeat insertion prevents splicing in Drosophila, but not human, extracts. However, a consensus branchpoint does not restore the splicing of introns containing the copia long terminal repeat, and alteration of the wild-type branchpoint sequence alone does not eliminate splicing. These results demonstrate species specificity of splicing signals, particularly pyrimidine stretch and size requirements, and raise the possibility that variant mechanisms not found in mammals may operate in the splicing of small introns in Drosophila and possibly other species.},
	isbn = {0270-7306, 1098-5549},
	doi = {10.1128/MCB.13.2.1104},
	url = {http://mcb.asm.org/content/13/2/1104},
	author = {Guo,M. and Lo,P. C. and Mount, Stephen M.}
}
@article {17377,
	title = {Speech versus mouse commands for word processing: an empirical evaluation},
	journal = {International Journal of Man-Machine Studies},
	volume = {39},
	year = {1993},
	month = {1993/10//},
	pages = {667 - 687},
	abstract = {Despite advances in speech technology, human factors research since the late 1970s has provided only weak evidence that automatic speech recognition devices are superior to conventional input devices such as keyboards and mice. However, recent studies indicate that there may be advantages to providing an additional input channel based on speech input to supplement the more common input modes. Recently the authors conducted an experiment to demonstrate the advantages of using speech-activated commands over mouse-activated commands for word processing applications when, in both cases, the keyboard is used for text entry and the mouse for direct manipulation. Sixteen experimental subjects, all professionals and all but one novice users of speech input, performed four simple word processing tasks using both input groups in this counterbalanced experiment. Performance times for all tasks were significantly faster when using speech to activate commands as opposed to using the mouse. On average, the reduction in task time due to using speech was 18{\textperiodcentered}7\%. The error rates due to subject mistakes were roughly the same for both input groups, and recognition errors, averaged over all the tasks, occurred for 6{\textperiodcentered}3\% of the speech-activated commands. Subjects made significantly more memorization errors when using speech as compared with the mouse for command activation. Overall, the subjects reacted positively to using speech input and preferred it over the mouse for command activation; however, they also voiced concerns about recognition accuracy, the interference of background noise, inadequate feedback and slow response time. The authors believe that the results of the experiment provide evidence for the utility of speech input for command activation in application programs.},
	isbn = {0020-7373},
	doi = {10.1006/imms.1993.1078},
	url = {http://www.sciencedirect.com/science/article/pii/S0020737383710783},
	author = {Karl,Lewis R. and Pettey,Michael and Shneiderman, Ben}
}
@conference {16710,
	title = {Structural ambiguity and conceptual relations},
	booktitle = {Proceedings of the Workshop on Very Large Corpora: Academic and Industrial Perspectives},
	year = {1993},
	month = {1993///},
	pages = {58 - 64},
	author = {Resnik, Philip and Hearst,M.}
}
@article {16945,
	title = {A study of file manipulation by novices using commands vs, direct manipulation},
	journal = {Sparks of innovation in human-computer interaction},
	year = {1993},
	month = {1993///},
	pages = {39 - 39},
	author = {Margono,S. and Shneiderman, Ben}
}
@article {18809,
	title = {A Systematic Approach for Analyzing the Manufacturability of Machined Parts},
	volume = {ISR; TR 1993-76},
	year = {1993},
	month = {1993///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed design has become an important step in the design stage. This paper presents an approach for analyzing the manufacturability of machined parts.<P>Evaluating the manufacturability of a proposed design involves determining whether or not it is manufacturable with a given set of manufacturing operations - and if so, then finding the associated manufacturing efficiency. Since there can be several different ways to manufacture a proposed design, this requires us to consider different ways to manufacture it, in order to determine which one best meets the design and manufacturing objectives.<P>The first step in our approach is to identify all machining operations which can potentially be used to create the given design. Using these operations, we generate different operation plans for machining the part. Each time we generate a new operation plan, we examine whether it can produce the desired shape and tolerances, and calculate its manufacturability rating. If no operation plan can be found that is capable of producing the design, then the given design is considered unmachinable; otherwise, the manufacturability rating for the design is the rating of the best operation plan.<P>We anticipate that by providing feedback about possible problems with the design, this work will help in speeding up the evaluation of new product designs in order to decide how or whether to manufacture them. Such a capability will be useful in responding quickly to changing demands and opportunities in the marketplace.},
	keywords = {Automation, computer aided manufacturing, Feature extraction, manufacturability, Systems Integration},
	url = {http://drum.lib.umd.edu//handle/1903/5420},
	author = {Gupta, Satyandra K. and Nau, Dana S.}
}
@article {15032,
	title = {Systolic architectures for finite-state vector quantization},
	journal = {The Journal of VLSI Signal Processing},
	volume = {5},
	year = {1993},
	month = {1993///},
	pages = {249 - 259},
	abstract = {We present a new systolic architecture for implementing Finite State Vector Quantization in real-time for both speech and image data. This architecture is modular and has a very simple control flow. Only one processor is needed for speech compression. A linear array of processors is used for image compression; the number of processors needed is independent of the size of the image. We also present a simple architecture for converting line-scanned image data into the format required by this systolic architecture. Image data is processed at a rate of 1 pixel per clock cycle. An implementation at 31.5 MHz can quantize 1024{\texttimes}1024 pixel images at 30 frames/sec in real-time. We describe a VLSI implementation of these processors.},
	doi = {10.1007/BF01581299},
	author = {Kolagotla,R. K. and Yu,S. S. and JaJa, Joseph F.}
}
@article {16224,
	title = {Scheduling home control devices: design issues and usability evaluation of four touchscreen interfaces},
	journal = {International Journal of Man-Machine Studies},
	volume = {36},
	year = {1992},
	month = {1992/03//},
	pages = {375 - 393},
	abstract = {This article describes four different user interfaces supporting scheduling two-state (ON/OFF) devices over time periods ranging from minutes to days. The touchscreen-based user interfaces including a digital 12-h clock, 24-h linear and 24-h dial prototypes are described and compared on a feature by feature basis. A formative usability test with 14 subjects, feedback from more than 30 reviewers, and the flexibility to add functions favour the 24-h linear version.},
	isbn = {0020-7373},
	doi = {10.1016/0020-7373(92)90040-R},
	url = {http://www.sciencedirect.com/science/article/pii/002073739290040R},
	author = {Plaisant, Catherine and Shneiderman, Ben}
}
@conference {16481,
	title = {Semantics for Rule-based Programs that Express Non-determinism, Causality and Exception Handling Behavior},
	booktitle = {Workshop on Deductive Databases, JICSLP},
	year = {1992},
	month = {1992///},
	pages = {163 - 174},
	author = {Raschid, Louiqa}
}
@article {16650,
	title = {Simple systems exhibiting self-directed replication: annex of transition functions and software documentation},
	year = {1992},
	month = {1992///},
	institution = {University of Maryland at College Park},
	address = {College Park, MD, USA},
	author = {Reggia, James A. and Chou,Hui-Hsien and Armentrout,Steven L. and Peng,Yun}
}
@conference {13647,
	title = {Simulating Pressure Variations in Handwriting},
	booktitle = {Proceedings of the Twenty-Third Annual Modeling and Simulation Conference},
	year = {1992},
	month = {1992///},
	pages = {2141 - 2148},
	address = {Pittsburgh, PA},
	author = {David Doermann and Varma,V.}
}
@article {17971,
	title = {Six Generations of Building Walkthrough: Final Technical Report to the National Science Foundation},
	year = {1992},
	month = {1992///},
	institution = {University of North Carolina at Chapel Hill},
	address = {Chapel Hill, NC, USA},
	author = {Brooks,Frederick P. and Airey,John and Alspaugh,John and Bell,Andrew and Brown,Randolph and Hill,Curtis and Nimscheck,Uwe and Rheingans,Penny and Rohlf,John and Smith,Dana and Turner,Douglass and Varshney, Amitabh and Wang,Yulan and Weber,Hans and Yuan,Xialin}
}
@article {17372,
	title = {Socially responsible computing I: a call to action following the LA riots},
	journal = {ACM SIGCHI Bulletin},
	volume = {24},
	year = {1992},
	month = {1992///},
	pages = {14 - 15},
	author = {Shneiderman, Ben}
}
@article {17373,
	title = {Socially responsible computing II: first steps on the path to positive contributions},
	journal = {ACM SIGCHI Bulletin},
	volume = {24},
	year = {1992},
	month = {1992/07//},
	pages = {16 - 17},
	abstract = {Now that we are past the initial emotional responses to the LA riots, maybe we can use these tragic events as a stimulus for innovative and constructive efforts. Computing professionals have been active in social causes on an individual basis and in some large projects, but with the growing maturity of our industry we can promote larger initiatives and accept greater responsibility.},
	isbn = {0736-6906},
	doi = {10.1145/134421.134432},
	url = {http://doi.acm.org/10.1145/134421.134432},
	author = {Shneiderman, Ben}
}
@article {16545,
	title = {Software approaches to segmentation analysis},
	journal = {Computer Science Technical Report Series; Vol. CS-TR-2991},
	year = {1992},
	month = {1992///},
	pages = {24 - 24},
	author = {D{\textquoteright}Autrechy,C. L and Reggia, James A. and Berndt,R. S}
}
@conference {14837,
	title = {Space efficient 3-D model indexing},
	booktitle = {Computer Vision and Pattern Recognition, 1992. Proceedings CVPR {\textquoteright}92., 1992 IEEE Computer Society Conference on},
	year = {1992},
	month = {1992/06//},
	pages = {439 - 444},
	abstract = {It is shown that the set of 2-D images produced by a group of 3-D point features of a rigid model can be optimally represented with two lines in two high-dimensional spaces. This result is used to match images and model groups by table lookup. The table is efficiently built and accessed through analytic methods that account for the effect of sensing error. In real images, it reduces the set of potential matches by a factor of several thousand. This representation of a model{\textquoteright}s images is used to analyze two other approaches to recognition. It is determined when invariants exist in several domains, and it is shown that there is an infinite set of qualitatively similar nonaccidental properties},
	keywords = {3-D, error;table, features;sensing, indexing;3-D, lookup;, lookup;image, model, point, processing;table},
	doi = {10.1109/CVPR.1992.223153},
	author = {Jacobs, David W.}
}
@article {19000,
	title = {Splicing signals in Drosophila: intron size, information content, and consensus sequences},
	journal = {Nucleic Acids ResearchNucl. Acids Res.},
	volume = {20},
	year = {1992},
	month = {1992/08/25/},
	pages = {4255 - 4262},
	abstract = {A database of 209 Drosophila Introns was extracted from Genbank (release number 64.0) and examined by a number of methods in order to characterize features that might serve as signals for messenger RNA splicing. A tight distribution of sizes was observed: while the smallest introns in the database are 51 nucleotides, more than half are less than 80 nucleotides in length, and most of these have lengths in the range of 59 {\textendash} 67 nucleotides. Drosophila splice sites found in large and small introns differ in only minor ways from each other and from those found in vertebrate Introns. However, larger introns have greater pyrimidlne-richness in the region between 11 and 21 nucleotides upstream of 3' splice sites. The Drosophila branchpoint consensus matrix resembles C T A A T (in which branch formation occurs at the underlined A), and differs from the corresponding mammalian signal in the absence of G at the position immediately preceding the branchpoint. The distribution of occurrences of this sequence suggests a minimum distance between 5' splice shies and branchpoints of about 38 nucleotides, and a minimum distance between 3' splice sites and branchpoints of 15 nucleotides. The methods we have used detect no information in exon sequences other than in the few nucleotides immediately adjacent to the splice sites. However, Drosophila resembles many other species in that there is a discontinuity in A + T content between exons and introns, which are A + T rich.},
	isbn = {0305-1048, 1362-4962},
	doi = {10.1093/nar/20.16.4255},
	url = {http://nar.oxfordjournals.org/content/20/16/4255},
	author = {Mount, Stephen M. and Burks,Christian and Herts,Gerald and Stormo,Gary D. and White,Owen and Fields,Chris}
}
@article {18434,
	title = {Standards-are software engineering process standards really necessary?},
	journal = {Computer},
	volume = {25},
	year = {1992},
	month = {1992/11//},
	pages = {82 - 84},
	abstract = {The need for software engineering process standards-as opposed to product standards-is discussed from two different viewpoints. M.V. Zelkowitz states that process standards are generally written as policy statements on how to conduct certain processes. As such, they give the framework of the underlying model, but not enough guidance to specify details. They are fuzzy and hard to implement, and they make conformance testing extremely difficult. F.J. Buckley responds to several significant issues raised in Zelkowitz{\textquoteright}s arguments},
	keywords = {conformance, engineering, engineering;standards;, process, standards;software, statements;product, testing;policy},
	isbn = {0018-9162},
	doi = {10.1109/2.166422},
	author = {Zelkowitz, Marvin V and Buckley,F.J.}
}
@article {17382,
	title = {Structural analysis of hypertexts: identifying hierarchies and useful metrics},
	journal = {ACM Transactions on Information Systems},
	volume = {10},
	year = {1992},
	month = {1992/04//},
	pages = {142 - 180},
	abstract = {Hypertext users often suffer from the {\textquotedblleft}lost in hyperspace{\textquotedblright} problem: disorientation from too many jumps while traversing a complex network. One solution to this problem is improved authoring to create more comprehensible structures. This paper proposes several authoring tools, based on hypertext structure analysis.In many hypertext systems authors are encouraged to create hierarchical structures, but when writing, the hierarchy is lost because of the inclusion of cross-reference links. The first part of this paper looks at ways of recovering lost hierarchies and finding new ones, offering authors different views of the same hypertext. The second part helps authors by identifying properties of the hypertext document. Multiple metrics are developed including compactness and stratum. Compactness indicates the intrinsic connectedness of the hypertext, and stratum reveals to what degree the hypertext is organized so that some nodes must be read before others.
Several existing hypertexts are used to illustrate the benefits of each technique. The collection of techniques provides a multifaceted view of the hypertext, which should allow authors to reduce undesired structural complexity and create documents that readers can traverse more easily.
},
	keywords = {graph theory, hierarchies, hypertext, metrics, structural analysis},
	isbn = {1046-8188},
	doi = {10.1145/146802.146826},
	url = {http://doi.acm.org/10.1145/146802.146826},
	author = {Botafogo,Rodrigo A. and Rivlin,Ehud and Shneiderman, Ben}
}
@article {14854,
	title = {A study of affine matching with bounded sensor error},
	journal = {Computer Vision{\textemdash}ECCV{\textquoteright}92},
	year = {1992},
	month = {1992///},
	pages = {291 - 306},
	abstract = {Affine transformations of the plane have been used by modelbased recognition systems to approximate the effects of perspective projection. Because the underlying mathematics are based on exact data, in practice various heuristics are used to adapt the methods to real data where there is positional uncertainty. This paper provides a precise analysis of affine point matching under uncertainty. We obtain an expression for the range of affine-invariant values consistent with a given set of four points, where each data point lies in an exist-disc. This range is shown to depend on the actual x- y-positions of the data points. Thus given uncertainty in the data, the representation is no longer invariant with respect to the Cartesian coordinate system. This is problematic for methods, such as geometric hashing, that depend on the invariant properties of the representation. We also analyze the effect that uncertainty has on the probability that recognition methods using affine transformations will find false positive matches. We find that such methods will produce false positives with even moderate levels of sensor error.},
	doi = {10.1007/3-540-55426-2_34},
	author = {Grimson,W. and Huttenlocher,D. and Jacobs, David W.}
}
@conference {16232,
	title = {Scheduling on-off home control devices},
	booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: Reaching through technology},
	series = {CHI {\textquoteright}91},
	year = {1991},
	month = {1991///},
	pages = {459 - 460},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	isbn = {0-89791-383-3},
	doi = {10.1145/108844.109002},
	url = {http://doi.acm.org/10.1145/108844.109002},
	author = {Plaisant, Catherine and Shneiderman, Ben}
}
@conference {16501,
	title = {Semantics for update rule programs and implementation in a relational database management system},
	booktitle = {ACM Transactions on Database Systems},
	year = {1991},
	month = {1991///},
	author = {Raschid, Louiqa and Lobo,J.}
}
@article {13860,
	title = {Solving divergences in machine translation},
	year = {1991},
	month = {1991///},
	institution = {University of Maryland at College Park},
	address = {College Park, MD, USA},
	author = {Dorr, Bonnie J}
}
@article {14888,
	title = {Space and time bounds on indexing 3D models from 2D images},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {13},
	year = {1991},
	month = {1991/10//},
	pages = {1007 - 1017},
	abstract = {Model-based visual recognition systems often match groups of image features to groups of model features to form initial hypotheses, which are then verified. In order to accelerate recognition considerably, the model groups can be arranged in an index space (hashed) offline such that feasible matches are found by indexing into this space. For the case of 2D images and 3D models consisting of point features, bounds on the space required for indexing and on the speedup that such indexing can achieve are demonstrated. It is proved that, even in the absence of image error, each model must be represented by a 2D surface in the index space. This places an unexpected lower bound on the space required to implement indexing and proves that no quantity is invariant for all projections of a model into the image. Theoretical bounds on the speedup achieved by indexing in the presence of image error are also determined, and an implementation of indexing for measuring this speedup empirically is presented. It is found that indexing can produce only a minimal speedup on its own. However, when accompanied by a grouping operation, indexing can provide significant speedups that grow exponentially with the number of features in the groups},
	keywords = {2D, bounds;time, bounds;visual, extraction;grouping, features;model, features;model-based, images;3D, indexing;feature, model, operation;image, pattern, picture, processing;, recognition, recognition;computerised, recognition;space, systems;computerised},
	isbn = {0162-8828},
	doi = {10.1109/34.99235},
	author = {Clemens,D. T and Jacobs, David W.}
}
@article {15980,
	title = {Stop the world{\textemdash}I want to think},
	journal = {International Journal of Intelligent Systems},
	volume = {6},
	year = {1991},
	month = {1991///},
	pages = {443 - 456},
	author = {Perlis, Don and Elgot-Drapkin,J. J and Miller,M.}
}
@article {18077,
	title = {Structural parallel algorithmics},
	journal = {Automata, Languages and Programming},
	year = {1991},
	month = {1991///},
	pages = {363 - 380},
	author = {Vishkin, Uzi}
}
@article {12977,
	title = {A superfamily of {\i}t Arabidopsis thaliana retrotransposons},
	journal = {Genetics},
	volume = {127},
	year = {1991},
	month = {1991/04//},
	pages = {801 - 809},
	abstract = {We describe a superfamily of Arabidopsis thaliana retrotransposable elements that consists of at least ten related families designated Ta1-Ta10. The Ta1 family has been described previously. Two genomic clones representing the Ta2 and Ta3 elements were isolated from an A. thaliana (race Landsberg erecta) lambda library using sequences derived from the reverse transcriptase region of Ta1 as hybridization probes. Nucleotide sequence analysis showed that the Ta1, Ta2 and Ta3 families share greater than 75\% amino acid identity in pairwise comparisons of their reverse transcriptase and RNase H genes. In addition to Ta1, Ta2 and Ta3, we identified seven other related retrotransposon families in Landsberg erecta, Ta4-Ta10, using degenerate primers and the polymerase chain reaction to amplify a highly conserved region of retrotransposon-encoded reverse transcriptase. One to two copies of elements Ta2-Ta10 are present in the genomes of the A. thaliana races Landsberg erecta and Columbia indicating that the superfamily comprises at least 0.1\% of the A. thaliana genome. The nucleotide sequences of the reverse transcriptase regions of the ten element families place them in the category of copia-like retrotransposons and phylogenetic analysis of the amino acid sequences suggests that horizontal transfer may have played a role in their evolution.},
	author = {Konieczny,A and Voytas,D. F and Cummings, Michael P. and Ausubel,F. M}
}
@article {18992,
	title = {Sequence of a cDNA from the Drosophila melanogaster white gene.},
	journal = {Nucleic Acids ResearchNucleic Acids Res},
	volume = {18},
	year = {1990},
	month = {1990/03/25/},
	pages = {1633 - 1633},
	isbn = {0305-1048},
	url = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC330539/},
	author = {Pepling,M and Mount, Stephen M.}
}
@article {16362,
	title = {Skip lists: a probabilistic alternative to balanced trees},
	journal = {Communications of the ACMCommun. ACM},
	volume = {33},
	year = {1990},
	month = {1990/06//},
	pages = {668 - 676},
	isbn = {00010782},
	doi = {10.1145/78973.78977},
	url = {http://dl.acm.org/citation.cfm?id=78977,},
	author = {Pugh, William}
}
@conference {13861,
	title = {Solving thematic divergences in machine translation},
	booktitle = {Proceedings of the 28th annual meeting on Association for Computational Linguistics},
	series = {ACL {\textquoteright}90},
	year = {1990},
	month = {1990///},
	pages = {127 - 134},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {Though most translation systems have some mechanism for translating certain types of divergent predicate-argument structures, they do not provide a general procedure that takes advantage of the relationship between lexical-semantic structure and syntactic structure. A divergent predicate-argument structure is one in which the predicate (e.g., the main verb) or its arguments (e.g., the subject and object) do not have the same syntactic ordering properties for both the source and target language. To account for such ordering differences, a machine translator must consider language-specific syntactic idiosyncrasies that distinguish a target language from a source language, while making use of lexical-semantic uniformities that tie the two languages together. This paper describes the mechanisms used by the UNITRAN machine translation system for mapping an underlying lexical-conceptual structure to a syntactic structure (and vice versa), and it shows how these mechanisms coupled with a set of general linking routines solve the problem of thematic divergence in machine translation.},
	doi = {10.3115/981823.981840},
	url = {http://dx.doi.org/10.3115/981823.981840},
	author = {Dorr, Bonnie J}
}
@article {19001,
	title = {Structure and expression of the Drosophila melanogaster gene for the U1 small nuclear ribonucleoprotein particle 70K protein.},
	journal = {Molecular and Cellular BiologyMol. Cell. Biol.},
	volume = {10},
	year = {1990},
	month = {1990/06/01/},
	pages = {2492 - 2502},
	abstract = {A genomic clone encoding the Drosophila U1 small nuclear ribonucleoprotein particle 70K protein was isolated by hybridization with a human U1 small nuclear ribonucleoprotein particle 70K protein cDNA. Southern blot and in situ hybridizations showed that this U1 70K gene is unique in the Drosophila genome, residing at cytological position 27D1,2. Polyadenylated transcripts of 1.9 and 3.1 kilobases were observed. While the 1.9-kilobase mRNA is always more abundant, the ratio of these two transcripts is developmentally regulated. Analysis of cDNA and genomic sequences indicated that these two RNAs encode an identical protein with a predicted molecular weight of 52,879. Comparison of the U1 70K proteins predicted from Drosophila, human, and Xenopus cDNAs revealed 68\% amino acid identity in the most amino-terminal 214 amino acids, which include a sequence motif common to many proteins which bind RNA. The carboxy-terminal half is less well conserved but is highly charged and contains distinctive arginine-rich regions in all three species. These arginine-rich regions contain stretches of arginine-serine dipeptides like those found in transformer, transformer-2, and suppressor-of-white-apricot proteins, all of which have been identified as regulators of mRNA splicing in Drosophila melanogaster.},
	isbn = {0270-7306, 1098-5549},
	doi = {10.1128/MCB.10.6.2492},
	url = {http://mcb.asm.org/content/10/6/2492},
	author = {Mancebo,R. and Lo,P. C. and Mount, Stephen M.}
}
@article {13025,
	title = {The structure, distribution and evolution of the {\i}t Ta1 retrotransposable element family of {\i}t Arabidopsis thaliana},
	journal = {Genetics},
	volume = {126},
	year = {1990},
	month = {1990/11//},
	pages = {713 - 721},
	abstract = {The Ta1 elements are a low copy number, copia-like retrotransposable element family of Arabidopsis thaliana. Six Ta1 insertions comprise all of the Ta1 element copies found in three geographically diverse A. thaliana races. These six elements occupy three distinct target sites: Ta1-1 is located on chromosome 5 and is common to all three races (Col-0, Kas-1 and La-0). Ta1-2 is present in two races on chromosome 4 (Kas-1 and La-0), and Ta1-3, also located on chromosome 4, is present only in one race (La-0). The six Ta1 insertions share greater than 96\% nucleotide identity, yet are likely to be incapable of further transposition due to deletions or nucleotide changes that alter either the coding capacity of the elements or conserved protein domains required for retrotransposition. Nucleotide sequence comparisons of these elements and the distribution of Ta1 among 12 additional A. thaliana geographical races suggest that Ta1-1 predated the global dispersal of A. thaliana. As the species spread throughout the world, two additional transposition events occurred which gave rise first to Ta1-2 and finally to Ta1-3.},
	author = {Voytas,D. F and Konieczny,A and Cummings, Michael P. and Ausubel,F. M}
}
@article {12009,
	title = {Structure from motion using line correspondences},
	journal = {International Journal of Computer VisionInt J Comput Vision},
	volume = {4},
	year = {1990},
	month = {1990/06//},
	pages = {171 - 183},
	isbn = {0920-5691},
	doi = {10.1007/BF00054994},
	url = {http://www.springerlink.com/content/r4h10053528335k2/},
	author = {Spetsakis, Minas E. and Aloimonos, J.}
}
@conference {16575,
	title = {Supervised and reinforced competitive learning},
	booktitle = {Neural Networks, 1990., 1990 IJCNN International Joint Conference on},
	year = {1990},
	month = {1990///},
	pages = {563 - 567},
	author = {Sutton III,G. G. and Reggia, James A. and Maisog,J. M}
}
@article {15033,
	title = {Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decomposition},
	journal = {Computers, IEEE Transactions on},
	volume = {39},
	year = {1990},
	month = {1990/11//},
	pages = {1359 - 1368},
	abstract = {Two-dimensional systolic array implementations for computing the discrete Hartley transform (DHT) and the discrete cosine transform (DCT) when the transform size <e1>N</e1> is decomposable into mutually prime factors are proposed. The existing two-dimensional formulations for DHT and DCT are modified, and the corresponding algorithms are mapped into two-dimensional systolic arrays. The resulting architecture is fully pipelined with no control units. The hardware design is based on bit serial left to right MSB (most significant bit) to LSB (least significant bit) binary arithmetic},
	keywords = {architectures;, architectures;two-dimensional, arithmetic;discrete, arrays;fast, binary, cosine, decomposition;systolic, design;prime, factor, Fourier, Hartley;discrete, systolic, transforms;hardware, transforms;parallel},
	isbn = {0018-9340},
	doi = {10.1109/12.61045},
	author = {Chakrabarti,C. and JaJa, Joseph F.}
}
@conference {12793,
	title = {A semantics based verification tool for finite state systems},
	booktitle = {Proceedings of the IFIP WG6},
	volume = {1},
	year = {1989},
	month = {1989///},
	pages = {287 - 302},
	author = {Cleaveland, Rance and Parrow,J. and Steffen,B.}
}
@article {17366,
	title = {Social and Individual Impact},
	journal = {Educational Media International},
	volume = {26},
	year = {1989},
	month = {1989///},
	pages = {101 - 106},
	isbn = {0952-3987},
	doi = {10.1080/0952398890260208},
	url = {http://www.tandfonline.com/doi/abs/10.1080/0952398890260208},
	author = {Shneiderman, Ben}
}
@conference {16320,
	title = {Software metric classification trees help guide the maintenance of large-scale systems},
	booktitle = {, Conference on Software Maintenance, 1989., Proceedings},
	year = {1989},
	month = {1989/10/16/19},
	pages = {116 - 123},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The 80:20 rule states that approximately 20\% of a software system is responsible for 80\% of its errors. The authors propose an automated method for generating empirically-based models of error-prone software objects. These models are intended to help localize the troublesome 20\%. The method uses a recursive algorithm to automatically generate classification trees whose nodes are multivalued functions based on software metrics. The purpose of the classification trees is to identify components that are likely to be error prone or costly, so that developers can focus their resources accordingly. A feasibility study was conducted using 16 NASA projects. On average, the classification trees correctly identified 79.3\% of the software modules that had high development effort or faults},
	keywords = {automated method, automatic programming, classification, Classification tree analysis, classification trees, Computer errors, empirically-based models, error-prone software objects, Fault diagnosis, feasibility study, high development effort, Large-scale systems, multivalued functions, NASA, NASA projects, recursive algorithm, Software algorithms, software engineering, Software maintenance, Software measurement, software metrics, software modules, Software systems, trees (mathematics)},
	isbn = {0-8186-1965-1},
	doi = {10.1109/ICSM.1989.65202},
	author = {Selby,R. W and Porter, Adam}
}
@article {14144,
	title = {Some aspects of parallel implementation of the finite-element method on message passing architectures},
	journal = {Journal of Computational and Applied Mathematics},
	volume = {27},
	year = {1989},
	month = {1989/09//},
	pages = {157 - 187},
	abstract = {We discuss some aspects of implementing the finite-element method on parallel computers with local memory and message passing. In particular, we compare the costs of using high-order and low-order elements and of direct and iterative solvers for solving the linear systems that occur. Our model of parallel computation is a two-dimensional grid of processors chosen to be similar in shape to the underlying grid. Our main conclusions are that use of high-order methods is an effective way to achieve high accuracy for some problems, on both serial and parallel computers, and that such methods provide a natural way to achieve efficiency in parallel implementations. In addition, we show that sparse direct solvers generalize naturally to methods based on high-order elements, and that direct solvers are adequate for two-dimensional problems, especially for multiple load vectors.},
	keywords = {Finite-element methods, hp-version, nested dissection, parallel computations, preconditioned conjugate gradient},
	isbn = {0377-0427},
	doi = {16/0377-0427(89)90365-8},
	url = {http://www.sciencedirect.com/science/article/pii/0377042789903658},
	author = {Babuska, I. and Elman, Howard}
}
@article {16027,
	title = {Some Brief Essays on Mind},
	year = {1989},
	month = {1989/07//},
	institution = {ROCHESTER UNIV NY DEPT OF COMPUTER SCIENCE},
	abstract = {The author tries to explain his view of artificial intelligence, and more broadly how it fits into science as a whole. In doing so, he will not hesitate to indulge in sheer speculation when it seems to fit the topic. He will begin with a negative thought (one that he does not agree with). Consider the statement that, while robots and AI (artificial intelligence) may make great strides in the future, still they never will be able to produce music with the sensitivity of certain humans with great musical talent. (kr)},
	keywords = {*ARTIFICIAL INTELLIGENCE, CYBERNETICS, HUMANS, Music, Robots},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA213887},
	author = {Perlis, Don}
}
@article {15808,
	title = {Some History of the Conjugate Gradient and Lanczos Algorithms: 1948{\textendash}1976},
	journal = {SIAM Review},
	volume = {31},
	year = {1989},
	month = {1989///},
	pages = {50 - 102},
	abstract = {This paper gives some of the history of the conjugate gradient and Lanczos algorithms and an annotated bibliography for the period 1948-1976},
	keywords = {Conjugate gradient algorithm, Lanczos algorithm, variable metric algorithms},
	doi = {10.1137/1031003},
	url = {http://link.aip.org/link/?SIR/31/50/1},
	author = {Golub, Gene H. and O{\textquoteright}Leary, Dianne P.}
}
@article {16235,
	title = {A spectrum of automatic hypertext constructions},
	journal = {Hypermedia},
	volume = {1},
	year = {1989},
	month = {1989///},
	pages = {179 - 195},
	abstract = {We describe our experiences with four separate conversions from paper documents into hypertext and discuss the lessons we have learned. The paper document{\textquoteright}s organization affects the ease with which it can be converted and the appropriateness of the resu lting hypertext. The form of the paper document{\textquoteright}s machine-readable {\textquoteleft}markup{\textquoteright} description affects the ability to transform the structure automatically. Designing the link structures that tie together the parts of the hypertext takes special care in automa ting, as badly-designed and incorrectly-formed links destroy the integrity of the hypertext. Overall, each of the conversions followed the same basic methodology, providing the handle for the development of {\textquoteleft}power tools{\textquoteright} that can be applied to simplify s ubsequent conversions.},
	author = {Furuta,R. and Plaisant, Catherine and Shneiderman, Ben}
}
@inbook {18363,
	title = {A support tool for teaching computer programming},
	booktitle = {Issues in software engineering educationIssues in software engineering education},
	year = {1989},
	month = {1989///},
	pages = {139 - 167},
	publisher = {Springer-Verlag New York, Inc.},
	organization = {Springer-Verlag New York, Inc.},
	address = {New York, NY, USA},
	isbn = {0-387-96840-7},
	url = {http://dl.acm.org/citation.cfm?id=73064.73074},
	author = {Zelkowitz, Marvin V and Kowalchack,B. and Itkin,D. and Herman,L.},
	editor = {Fairley,Richard and Freeman,Peter}
}
@article {17354,
	title = {Selection devices for user of an electronic encyclopedia: An empirical comparison of four possibilities},
	journal = {Information Processing \& Management},
	volume = {24},
	year = {1988},
	month = {1988///},
	pages = {665 - 680},
	abstract = {This study measured the speed, error rates, and subjective evaluation of arrow-jump keys, a jump-mouse, number keys, and a touch screen in an interactive encyclopedia. A summary of previous studies comparing selection devices and strategies is presented to provide the background for this study. We found the touch screen to be the fastest in time, the least accurate but the overall favorite of the participants. The results are discussed and improvements are suggested accordingly.},
	isbn = {0306-4573},
	doi = {10.1016/0306-4573(88)90004-0},
	url = {http://www.sciencedirect.com/science/article/pii/0306457388900040},
	author = {Ostroff,Daniel and Shneiderman, Ben}
}
@article {16561,
	title = {Self-processing networks and their biomedical implications},
	journal = {Proceedings of the IEEE},
	volume = {76},
	year = {1988},
	month = {1988///},
	pages = {680 - 692},
	author = {Reggia, James A. and Sutton III,G. G.}
}
@article {12067,
	title = {Shape from patterns: Regularization},
	journal = {International journal of computer vision},
	volume = {2},
	year = {1988},
	month = {1988///},
	pages = {171 - 187},
	author = {Aloimonos, J. and Swain, M.}
}
@article {12018,
	title = {Shape from texture},
	journal = {Biological Cybernetics},
	volume = {58},
	year = {1988},
	month = {1988///},
	pages = {345 - 360},
	author = {Aloimonos, J.}
}
@article {15807,
	title = {Some algorithms for approximating convolutions},
	journal = {Computer Vision, Graphics, and Image Processing},
	volume = {41},
	year = {1988},
	month = {1988/03//},
	pages = {333 - 345},
	abstract = {This paper presents some algorithms for approximating two-dimensional convolution operators of size n {\texttimes} n, n odd, by a product, or sum of products, of 3 {\texttimes} 3 convolutions. Inaccuracies resulting from the approximation as well as from fixed point computation are discussed and examples are given.},
	isbn = {0734-189X},
	doi = {10.1016/0734-189X(88)90107-7},
	url = {http://www.sciencedirect.com/science/article/pii/0734189X88901077},
	author = {O{\textquoteright}Leary, Dianne P.}
}
@book {18427,
	title = {Selected reprints in software},
	year = {1987},
	month = {1987///},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	author = {Zelkowitz, Marvin V}
}
@article {18994,
	title = {Sequence similarity},
	journal = {Nature},
	volume = {325},
	year = {1987},
	month = {1987/02/05/},
	pages = {487 - 487},
	doi = {10.1038/325487c0},
	url = {http://www.nature.com/nature/journal/v325/n6104/abs/325487c0.html},
	author = {Mount, Stephen M.}
}
@article {15595,
	title = {Shared memory algorithms and the medial axis transform},
	journal = {IEEE Workshop on Computer Architecture for PAMI},
	year = {1987},
	month = {1987///},
	pages = {44 - 50},
	author = {Chandran,S. and Mount, Dave}
}
@article {11953,
	title = {Spatiotemporal blur paths for image flow estimation (A)},
	journal = {Journal of the Optical Society of America A},
	volume = {4},
	year = {1987},
	month = {1987///},
	pages = {35 - 35},
	author = {Spetsakis, M. E and Aloimonos, J.}
}
@article {15582,
	title = {Storing the subdivision of a polyhedral surface},
	journal = {Discrete \& Computational Geometry},
	volume = {2},
	year = {1987},
	month = {1987///},
	pages = {153 - 174},
	abstract = {A common structure arising in computational geometry is the subdivision of a plane defined by the faces of a straight-line planar graph. We consider a natural generalization of this structure on a polyhedral surface. The regions of the subdivision are bounded by geodesics on the surface of the polyhedron. A method is given for representing such a subdivision that is efficient both with respect to space and the time required to answer a number of different queries involving the subdivision. For example, given a pointx on the surface of the polyhedron, the region of the subdivision containingx can be determined in logarithmic time. Ifn denotes the number of edges in the polyhedron,m denotes the number of geodesics in the subdivision, andK denotes the number of intersections between edges and geodesics, then the space required by the data structure isO((n +m) log(n +m)), and the structure can be built inO(K + (n +m) log(n +m)) time. Combined with existing algorithms for computing Voronoi diagrams on the surface of polyhedra, this structure provides an efficient solution to the nearest-neighbor query problem on polyhedral surfaces.},
	doi = {10.1007/BF02187877},
	author = {Mount, Dave}
}
@book {12064,
	title = {Structure from Motion from Line Correspondencies: New Results},
	year = {1987},
	month = {1987///},
	author = {Science, University of Maryland at College Park. Dept. of Computer and Spetsakis, M. E and Aloimonos, J. and Research, University of Maryland at College Park. Center for Automation}
}
@article {17384,
	title = {Subjective user evaluation of CF PASCAL programming tools},
	journal = {Department of Computer Science and Human-Computer Interaction Laboratory Working Paper},
	year = {1987},
	month = {1987///},
	abstract = {This study investigated subjective evaluations of two programming environments: 1) SUPPORT, an interactive programming environment with a syntax directed editor on a personal computer and 2) a batch run environment on a large mainframe computer. Participants were students in a 15 week introductory computer science course. In Part 1, one group of 128 first used SUPPORT, while another group of 85 programmed on a mainframe environment. After 6 weeks they were given an evaluative questionnaire and then switched programming environments. In Part 2, 68 used SUPPORT and 60 used the mainframe. At the twelfth week of the course, they were given two questionnaires, one evaluating the environment they had used in the last 6 weeks and one comparing both enviro nments. A measure of programming performance (exam and programming project grades) was also collected. SUPPORT was predicted to reduce the burden of remembering syntactic details resulting in better performance and higher subjective evaluations. Unexpectedly, the SUPPORT users did not earn statistically significantly higher grades. Furthermore, participants expressed a preference for the mainframe over SUPPORT. Specific items on the questionnaires were used to diagnose the strengths and weaknesses of each environment. Designers of syntax directed editors should focus on reducing the syntactic burden not only in programming , but also in the user interface of these tools.},
	author = {Chin,JP and Norman,K. L and Shneiderman, Ben}
}
@article {15814,
	title = {Systolic Arrays for Matrix Transpose and Other Reorderings},
	journal = {Computers, IEEE Transactions on},
	volume = {C-36},
	year = {1987},
	month = {1987/01//},
	pages = {117 - 122},
	abstract = {In this correspondence, a systolic array is described for computing the transpose of an n {\~A} n matrix in time 3n - 1 using n<sup>2</sup> switching processors and n<sup>2</sup> bit buffers. A one-dimensional implementation is also described. Arrays are also given to take a matrix in by rows and put it out by diagonals, and vice versa.},
	isbn = {0018-9340},
	doi = {10.1109/TC.1987.5009457},
	author = {O{\textquoteright}Leary, Dianne P.}
}
@conference {15933,
	title = {Self-reference, knowledge, belief, and modality},
	booktitle = {Proc 5th National Conference on AI},
	year = {1986},
	month = {1986///},
	pages = {416 - 420},
	author = {Perlis, Don}
}
@article {17355,
	title = {Seven plus or minus two central issues in human-computer interaction},
	journal = {ACM SIGCHI Bulletin - Special issue: CHI {\textquoteright}86 Conference Proceedings},
	volume = {17},
	year = {1986},
	month = {1986/04//},
	pages = {343 - 349},
	abstract = {This paper offers seven issues and specific challenges for researchers and developers of human-computer interaction. These issues are: interaction styles, input techniques, output organization, response time, error handling, individual differences, explanatory and predictive theories.},
	isbn = {0736-6906},
	doi = {10.1145/22339.22394},
	url = {http://doi.acm.org/10.1145/22339.22394},
	author = {Shneiderman, Ben}
}
@conference {11966,
	title = {Shape and 3-d motion from contour without point to point correspondences: General principles},
	booktitle = {CVPR86},
	year = {1986},
	month = {1986///},
	pages = {518 - 527},
	author = {Aloimonos, J. and Basu, A.}
}
@article {16445,
	title = {A Special-Function Unit for Sorting and Sort-Based Database Operations},
	journal = {IEEE Transactions on Computers},
	volume = {C-35},
	year = {1986},
	month = {1986/12//},
	pages = {1071 - 1077},
	abstract = {Achieving efficiency in database management functions is a fundamental problem underlying many computer applications. Efficiency is difficult to achieve using the traditional general-purpose von Neumann processors. Recent advances in microelectronic technologies have prompted many new research activities in the design, implementation, and application of database machines which are tailored for processing database management functions. To build an efficient system, the software algorithms designed for this type of system need to be tailored to take advantage of the hardware characteristics of these machines. Furthermore, special hardware units should be used, if they are cost- effective, to execute or to assist the execution of these software algorithms.},
	keywords = {Application software, Computer applications, Database machines, Hardware, hardware sorter, Microelectronics, Software algorithms, Software design, Software systems, sort-based algorithms for database operations, sorting, special-function processor, Technology management},
	isbn = {0018-9340},
	doi = {10.1109/TC.1986.1676715},
	author = {Raschid, Louiqa and Fei,T. and Lam,H. and Su,S. Y.W}
}
@article {14127,
	title = {A Stability Analysis of Incomplete LU Factorizations},
	journal = {Mathematics of Computation},
	volume = {47},
	year = {1986},
	month = {1986/07/01/},
	pages = {191 - 217},
	abstract = {The combination of iterative methods with preconditionings based on incomplete LU factorizations constitutes an effective class of methods for solving the sparse linear systems arising from the discretization of elliptic partial differential equations. In this paper, we show that there are some settings in which the incomplete LU preconditioners are not effective, and we demonstrate that their poor performance is due to numerical instability. Our analysis consists of an analytic and numerical study of a sample two-dimensional non-self-adjoint elliptic problem discretized by several finite-difference schemes.},
	isbn = {0025-5718},
	doi = {10.2307/2008089},
	url = {http://www.jstor.org/stable/2008089},
	author = {Elman, Howard}
}
@conference {15945,
	title = {Step-logics: An alternative approach to limited reasoning},
	booktitle = {Proceedings of the European Conf. on Artificial Intelligence},
	year = {1986},
	month = {1986///},
	pages = {160 - 163},
	author = {Drapkin,J. and Perlis, Don}
}
@article {16752,
	title = {Schema manipulation in self-describing and self-documenting data models},
	journal = {International Journal of Parallel Programming},
	volume = {14},
	year = {1985},
	month = {1985///},
	pages = {1 - 28},
	author = {Roussopoulos, Nick and Mark,L.}
}
@article {16751,
	title = {SEES{\textemdash}A Software testing Environment Support System},
	journal = {IEEE Transactions on Software Engineering},
	volume = {SE-11},
	year = {1985},
	month = {1985/04//},
	pages = {355 - 366},
	abstract = {SEES is a database system to support program testing. The program database is automatically created during the compilation of the program by a compiler built using the YACC compiler-compiler.},
	keywords = {Computer architecture, Database systems, Error correction, Program processors, Programming profession, Relational databases, Software testing, software tools, Workstations, Writing},
	isbn = {0098-5589},
	doi = {10.1109/TSE.1985.232225},
	author = {Roussopoulos, Nick and Yeh,R. T}
}
@article {16786,
	title = {SELF-DESCRIBING AND SELF-DOCUMENTING DATABASE SYSTEMS},
	journal = {Languages for automation},
	year = {1985},
	month = {1985///},
	pages = {275 - 275},
	author = {Roussopoulos, Nick and Mark,L.}
}
@article {18122,
	title = {Solving NP-hard problems in [] almost trees{\textquoteright}: Vertex cover},
	journal = {Discrete applied mathematics},
	volume = {10},
	year = {1985},
	month = {1985///},
	pages = {27 - 45},
	author = {Coppersmith,D. and Vishkin, Uzi}
}
@article {17424,
	title = {The Structure of Information in Online and Paper Technical Manuals},
	journal = {Proceedings of the Human Factors and Ergonomics Society Annual MeetingProceedings of the Human Factors and Ergonomics Society Annual Meeting},
	volume = {29},
	year = {1985},
	month = {1985/10/01/},
	pages = {1110 - 1113},
	abstract = {An experiment was conducted to compare online computer manuals to paper manuals. For each type of manual there were two different database structures {\textendash} a linear (sequential) structure and a tree structure. The results showed that people using the paper manuals were faster at performing a switch setting task based on information in the manual than were people using the online manuals. No significant differences were found in speed of performance between the linear and tree structures. Nor were there any differences in the number of correct switch settings for the different types of manuals. The subjective evaluation data revealed that the online manuals were rated as better and judged to be more organized than the paper manuals.},
	isbn = {1071-1813,},
	doi = {10.1177/154193128502901207},
	url = {http://pro.sagepub.com/content/29/12/1110},
	author = {Weldon,Linda J. and Koved,Larry and Shneiderman, Ben}
}
@conference {16589,
	title = {Simulation of phonemic errors using artificial intelligence symbol processing techniques},
	booktitle = {Proceedings of the 17th annual symposium on Simulation},
	year = {1984},
	month = {1984///},
	pages = {49 - 64},
	author = {Reggia, James A. and Ahuja,S. B}
}
@article {16582,
	title = {SLIPS},
	journal = {Journal of Medical Systems},
	volume = {8},
	year = {1984},
	month = {1984///},
	pages = {197 - 204},
	author = {Morris,M. S and Reggia, James A. and Ahuja,S. B and Hart,J. and Watson,V.}
}
@article {18429,
	title = {Software Engineering Practices in the US and Japan},
	journal = {Computer},
	volume = {17},
	year = {1984},
	month = {1984/06//},
	pages = {57 - 66},
	isbn = {0018-9162},
	doi = {10.1109/MC.1984.1659162},
	author = {Zelkowitz, Marvin V and Yeh,R. T and Hamlet,R.G. and Gannon,J. D and Basili, Victor R.}
}
@article {18130,
	title = {Solving NP-hard problems on graphs that are almost trees and an application to facility location problems},
	journal = {Journal of the ACM (JACM)},
	volume = {31},
	year = {1984},
	month = {1984///},
	pages = {459 - 473},
	author = {Gurevich,Y. and Stockmeyer,L. and Vishkin, Uzi}
}
@article {16547,
	title = {S., Wang. PY, Diagnostic Expert Systems Based on a Set Covering Model},
	journal = {International Journal on Man-Machine studies},
	volume = {19},
	year = {1983},
	month = {1983///},
	pages = {437{\textendash}46O - 437{\textendash}46O},
	author = {Reggia, James A. and Nau, Dana S.}
}
@conference {16723,
	title = {A self-describing meta-schema for the RM/T data model},
	booktitle = {IEEE Workshop On Languages for Automation, IEEE Computer Society Press},
	year = {1983},
	month = {1983///},
	author = {Roussopoulos, Nick and Mark,L.}
}
@article {18996,
	title = {Small Ribonucleoproteins from Eukaryotes: Structures and Roles in RNA Biogenesis},
	journal = {Cold Spring Harbor Symposia on Quantitative BiologyCold Spring Harb Symp Quant Biol},
	volume = {47},
	year = {1983},
	month = {1983/01/01/},
	pages = {893 - 900},
	abstract = {Detailed reviews describing work presented at the annual Cold Spring Harbor Symposia on Quantitative Biology},
	isbn = {0091-7451, 1943-4456},
	doi = {10.1101/SQB.1983.047.01.103},
	url = {http://symposium.cshlp.org/content/47/893},
	author = {Steitz,J. A. and Wolin,S. L. and Rinke,J. and Pettersson,I. and Mount, Stephen M. and Lerner,E. A. and Hinterberger,M. and Gottlieb,E.}
}
@article {18444,
	title = {The Software Industry: A State of the Art Survey},
	journal = {Foundations of Empirical Software Engineering: The Legacy of Victor R. Basili},
	volume = {1},
	year = {1983},
	month = {1983///},
	pages = {383 - 383},
	author = {Zelkowitz, Marvin V and Yeh,R. and Hamlet,R.G. and Gannon,J. D and Basili, Victor R.}
}
@article {18999,
	title = {Splicing of messenger RNA precursors is inhibited by antisera to small nuclear ribonucleoprotein},
	journal = {Cell},
	volume = {35},
	year = {1983},
	month = {1983/11//},
	pages = {101 - 107},
	isbn = {00928674},
	doi = {10.1016/0092-8674(83)90212-X},
	url = {http://ukpmc.ac.uk/abstract/MED/6194895},
	author = {Padgett,Richard A. and Mount, Stephen M. and Steitz,Joan A. and Sharp,Phillip A.}
}
@conference {18946,
	title = {Syntactic constraints and efficient parsability},
	series = {ACL {\textquoteright}83},
	year = {1983},
	month = {1983///},
	pages = {119 - 122},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {A central goal of linguistic theory is to explain why natural languages are the way they are. It has often been supposed that computational considerations ought to play a role in this characterization, but rigorous arguments along these lines have been difficult to come by. In this paper we show how a key "axiom" of certain theories of grammar, Subjacency, can be explained by appealing to general restrictions on on-line parsing plus natural constraints on the rule-writing vocabulary of grammars. The explanation avoids the problems with Marcus{\textquoteright} [1980] attempt to account for the same constraint. The argument is robust with respect to machine implementation, and thus avoids the problems that often arise when making detailed claims about parsing efficiency. It has the added virtue of unifying in the functional domain of parsing certain grammatically disparate phenomena, as well as making a strong claim about the way in which the grammar is actually embedded into an on-line sentence processor.},
	doi = {10.3115/981311.981335},
	url = {http://dx.doi.org/10.3115/981311.981335},
	author = {Berwick,Robert C. and Weinberg, Amy}
}
@article {19002,
	title = {Structure and function of small ribonucleoproteins from eukaryotic cells},
	journal = {Princess Takamatsu symposiaInt. Symp. Princess Takamatsu Cancer Res. Fund},
	volume = {12},
	year = {1982},
	month = {1982///},
	pages = {101 - 107},
	abstract = {Autoantibodies from patients with systemic lupus erythematosus and other related diseases have been used to identify and study small RNA-protein complexes from mammalian cells. Properties of three previously described and several new classes of small ribonucleoproteins (RNPs) are reviewed. The sequence of Drosophila U1 RNA reveals that the region proposed to pair with 5{\textquoteright} splice junctions is conserved, while that proposed to interact with 3{\textquoteright} junctions diverges; this forces some revision of the model for U1 small nuclear (sn)RNP participation in hnRNA splicing. Further characterization of the Ro and La small RNPs has shown that the Ro small cytoplasmic (sc)RNPs are a subclass of La RNPs. Both tRNA and 5S rRNA precursors are at least transiently associated with the La protein. This raises the possibility that the La protein may be an RNA polymerase III transcription factor.},
	keywords = {Antigen-Antibody Complex, Autoantibodies, HUMANS, Lupus Erythematosus, Systemic, Nucleoproteins, Ribonucleoproteins, RNA Polymerase III, Transcription, Genetic},
	url = {http://www.ncbi.nlm.nih.gov/pubmed/7166547},
	author = {Steitz,J. A. and Berg,C and Gottlieb,E. and Hardin,J A and Hashimoto,C and Hendrick,J P and Hinterberger,M. and Krikeles,M and Lerner,M R and Mount, Stephen M.}
}
@book {17390,
	title = {System message design: Guidelines and experimental results},
	year = {1982},
	month = {1982///},
	publisher = {Ablex Publishing Company: Norwood, NJ},
	organization = {Ablex Publishing Company: Norwood, NJ},
	author = {Shneiderman, Ben}
}
@article {17391,
	title = {SYSTEM MESSAGE GUIDELINES: POSITIVE TONE, CONSTRUCTIVE, SPECIFIC, AND USER CENTERED},
	journal = {Gathering Information for Problem Formulation},
	year = {1982},
	month = {1982///},
	author = {Shneiderman, Ben}
}
@article {18993,
	title = {Sequence of U1 RNA from Drosophila melanogaster: implications for U1 secondary structure and possible involvement in splicing},
	journal = {Nucleic Acids ResearchNucl. Acids Res.},
	volume = {9},
	year = {1981},
	month = {1981/12/11/},
	pages = {6351 - 6368},
	abstract = {U1 RNA from cultured Drosophila melanogaster cells (Kc) was identified by its ability to be recognized, as an RNP, by anti-(U1)RNP antibodies from human lupus patients. Its sequence was deduced largely from direct analysis of the RNA molecule and then confirmed by DNA sequence determinations on a genomic clone isolated by hybridization to Drosophila U1 RNA. The Drosophila U1 RNA sequence exhibits 72\% agreement with human U1 RNA. Nucleotides 3-11, which are complementary to the entire consensus sequence for donor (5') splice junctions in hnRNA, and to part of the acceptor (3') consensus, are exactly conserved. However, nucleotides 14-21, postulated to interact only with acceptor junctions, differ. Comparison of the Drosophila U1 sequence with vertebrate U1 sequences allows a particular secondary structure model to be preferred over others. These results are consistent with the hypothesis that U1 snRNPs are involved in splicing, but suggest specific modifications of the model detailing molecular interactions between U1 RNA and hnRNA during the splicing reaction.},
	isbn = {0305-1048, 1362-4962},
	doi = {10.1093/nar/9.23.6351},
	url = {http://nar.oxfordjournals.org/content/9/23/6351},
	author = {Mount, Stephen M. and Steitz,Joan A.}
}
@book {18428,
	title = {Selected reprints in software: selected reprints from Computer},
	year = {1980},
	month = {1980///},
	publisher = {Computer Society Press},
	organization = {Computer Society Press},
	author = {Zelkowitz, Marvin V}
}
@book {17374,
	title = {Software psychology: Human factors in computer and information systems (Winthrop computer systems series)},
	year = {1980},
	month = {1980///},
	publisher = {Winthrop Publishers},
	organization = {Winthrop Publishers},
	isbn = {0876268165},
	author = {Shneiderman, Ben}
}
@conference {16770,
	title = {Systematic Derivation of Software Requirements},
	booktitle = {Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design},
	year = {1980},
	month = {1980///},
	pages = {403 - 404},
	author = {Yeh,R. Y and Roussopoulos, Nick and Chang,P.}
}
@article {18436,
	title = {Surveyor{\textquoteright}s Forum: A Question of Transition},
	journal = {ACM Computing Surveys (CSUR)},
	volume = {11},
	year = {1979},
	month = {1979/12//},
	pages = {411 - 412},
	isbn = {0360-0300},
	doi = {10.1145/356789.356799},
	url = {http://doi.acm.org/10.1145/356789.356799},
	author = {Zelkowitz, Marvin V}
}
@article {17389,
	title = {Syntactic/semantic interactions in programmer behavior: A model and experimental results},
	journal = {International Journal of Parallel Programming},
	volume = {8},
	year = {1979},
	month = {1979///},
	pages = {219 - 238},
	abstract = {This paper presents a cognitive framework for describing behaviors involved in program composition, comprehension, debugging, modification, and the acquisition of new programming concepts, skills, and knowledge. An information processing model is presented which includes a long-term store of semantic and syntactic knowledge, and a working memory in which problem solutions are constructed. New experimental evidence is presented to support the model of syntactic/semantic interaction.},
	isbn = {0885-7458},
	url = {http://dx.doi.org/10.1007/BF00977789},
	author = {Shneiderman, Ben and Mayer,Richard}
}
@conference {18443,
	title = {The software engineering laboratory: Objectives},
	booktitle = {Proceedings of the fifteenth annual SIGCPR conference},
	series = {SIGCPR {\textquoteright}77},
	year = {1977},
	month = {1977///},
	pages = {256 - 269},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {A great deal of time and money has been and will continue to be spent in developing software. Much effort has gone into the generation of various software development methodologies that are meant to improve both the process and the product ([MYER, 75], [BAKE, 74], [WOLV, 72]). Unfortunately, it has not always been clear what the underlying principles involved in the software development process are and what effect the methodologies have; it is not always clear what constitutes a better product. Thus progress in finding techniques that produce better, cheaper software depends on developing new deeper understandings of good software and the software development process through studying the underlying principles involved in software and the development process. At the same time we must continue to produce software. A better understanding of the factors that affect the development of software and their interrelationships is required in order to gain better insights into the underlying principles. The Software Engineering Laboratory has been established, in August 1976, at NASA Goddard Space Flight Center in cooperation with the University of Maryland to promote such understanding. The next section gives an overview of the research objectives and experiments being performed at the Laboratory. Section III contains the current list of factors that affect the software development process or product and are to be studied or neutralized. The data collection and data management activities are discussed in Section IV. The last section contains information on the current status and future plans for the Laboratory.},
	doi = {10.1145/800100.803251},
	url = {http://doi.acm.org/10.1145/800100.803251},
	author = {Basili, Victor R. and Zelkowitz, Marvin V}
}
@article {17383,
	title = {Structured data structures},
	journal = {Communications of the ACM},
	volume = {17},
	year = {1974},
	month = {1974/10//},
	pages = {566 - 574},
	abstract = {Programming systems which permit arbitrary linked list structures enable the user to create complicated structures without sufficient protection. Deletions can result in unreachable data elements, and there is no guarantee that additions will be performed properly. To remedy this situation, this paper proposes a Data Structure Description and Manipulation Language which provides for the creation of a restricted class of data structures but ensures the correctness of the program. This is accomplished by an explicit structure declaration facility, a restriction on the permissible operations, and execution-time checks.},
	keywords = {data base management system, Data structures, structured programming},
	isbn = {0001-0782},
	doi = {10.1145/355620.361170},
	url = {http://doi.acm.org/10.1145/355620.361170},
	author = {Shneiderman, Ben and Scheuermann,Peter}
}
