@conference {18334,
	title = {Co-designing an e-health tutorial for older adults},
	booktitle = {Proceedings of the 2012 iConference},
	series = {iConference {\textquoteright}12},
	year = {2012},
	month = {2012///},
	pages = {240 - 247},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Older adults{\textquoteright} ability to access and use electronic health information is generally low, requiring innovative approaches for improvement. An integrated e-tutorial overlays instructions onto Websites. The literature suggests integrated e-tutorials are more effective than paper or video-based tutorials for younger people, but little is known about their effectiveness for older adults. This study explores the applicability of an integrated e-health tutorial for older adults. An integrated e-tutorial, the Online Tutorial Overlay Presenter (OnTOP), added an instructional overlay to the NIHSeniorHealth.gov Website. Overlay features were examined in seven participatory design sessions with seven older adults. Participatory design techniques were used to elicit participants{\textquoteright} preferences for tutorial features. Three themes emerged: 1) using contextual cues; 2) tailoring to the learner{\textquoteright}s literacy level; and 3) enhancing interfaces with multimedia cues. These findings improved the design features of OnTOP. They also generated empirical evidence about the effects of multimedia learning among older adults.},
	keywords = {e-health literacy, health information seeking, integrated e-tutorial, participatory design},
	isbn = {978-1-4503-0782-6},
	doi = {10.1145/2132176.2132207},
	url = {http://doi.acm.org/10.1145/2132176.2132207},
	author = {Xie,Bo and Tom Yeh and Walsh,Greg and Watkins,Ivan and Huang,Man}
}
@article {18335,
	title = {Co-designing contextual tutorials for older adults on searching health information on the internet},
	journal = {Proceedings of the American Society for Information Science and Technology},
	volume = {48},
	year = {2011},
	month = {2011/01/01/},
	pages = {1 - 4},
	abstract = {Evidence in the literature suggests an integrated e-tutorial is more effective than a paper- or video-based tutorial among younger people. Yet, relatively little is known about the effectiveness of an integrated e-tutorial on the older population. This study explored the applicability of an integrated e-tutorial to an older population, focusing on the content area of e-health literacy. A specific integrated e- tutorial, the Online Tutorial Overlay Presenter (OnTOP), was used to add an overlay to the NIHSeniorHealth.gov Website. Features of the overlay were examined thoroughly in seven 2-hour-long participatory design sessions with ten older adults. Several participatory design techniques were used to elicit participants{\textquoteright} preferences for design features of the OnTOP tutorial. These techniques included drawing on the board, voice recording and integration, and peer instruction. Three major themes emerged: 1) using contextual cues to facilitate learning; 2) tailoring to accommodate the learner{\textquoteright}s literacy level; and 3) enhancing existing interfaces with multimedia cues. These findings improved the design of OnTOP. They also contribute to the multimedia learning literature, generating empirical evidence about the effects of multimedia learning among the understudied older adult population.},
	isbn = {1550-8390},
	doi = {10.1002/meet.2011.14504801160},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/meet.2011.14504801160/abstract},
	author = {Xie,Bo and Tom Yeh and Walsh,Greg and Watkins,Ivan and Huang,Man}
}
@conference {13081,
	title = {Creating contextual help for GUIs using screenshots},
	booktitle = {Proceedings of the 24th annual ACM symposium on User interface software and technology},
	series = {UIST {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {145 - 154},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Contextual help is effective for learning how to use GUIs by showing instructions and highlights on the actual interface rather than in a separate viewer. However, end-users and third-party tech support typically cannot create contextual help to assist other users because it requires programming skill and source code access. We present a creation tool for contextual help that allows users to apply common computer skills-taking screenshots and writing simple scripts. We perform pixel analysis on screenshots to make this tool applicable to a wide range of applications and platforms without source code access. We evaluated the tool{\textquoteright}s usability with three groups of participants: developers, in-structors, and tech support. We further validated the applicability of our tool with 60 real tasks supported by the tech support of a university campus.},
	keywords = {contextual help, help, pixel analysis},
	isbn = {978-1-4503-0716-1},
	doi = {10.1145/2047196.2047214},
	url = {http://doi.acm.org/10.1145/2047196.2047214},
	author = {Tom Yeh and Chang,Tsung-Hsiang and Xie,Bo and Walsh,Greg and Watkins,Ivan and Wongsuphasawat,Krist and Huang,Man and Davis, Larry S. and Bederson, Benjamin B.}
}
@conference {13533,
	title = {Cross-Language Entity Linking in Maryland during a Hurricane},
	booktitle = {TAC},
	year = {2011},
	month = {2011///},
	abstract = {Our team from the JHUHLTCOE and the University of Maryland submitted runs for all three variants of the TACKBP entity linking task. For the monolingual tasks, we essentially mirrored our HLTCOETAC-KBP 2010 submission, making only modest changes to accommodate differences in 2011, namely the requirement to cluster NIL responses, and the change in evaluation measure. However, our work on the cross-lingual task was significantly more involved, requiring development of robust, multiphased transliteration software, use of techniques in cross-language information retrieval, and reliance on a Chinese-to- English statistical machine translation system. In this paper we describe our work for the 2011 evaluation and the results we obtained.},
	author = {McNamee,Paul and Mayfield,James and Oard, Douglas and David Doermann and Xu,Tan and Wu,Ke}
}
@article {13914,
	title = {Connecting generations: developing co-design methods for older adults and children},
	journal = {Behaviour \& Information Technology},
	volume = {99999},
	year = {2010},
	month = {2010///},
	pages = {1 - 11},
	author = {Xie,B. and Druin, Allison and Fails,J. and Massey,S. and Golub,E. and Franckel,S. and Schneider,K.}
}
@conference {15620,
	title = {Tight lower bounds for halfspace range searching},
	booktitle = {Proceedings of the 2010 annual symposium on Computational geometry},
	series = {SoCG {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {29 - 37},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We establish two new lower bounds for the halfspace range searching problem: Given a set of n points in ℜd, where each point is associated with a weight from a commutative semigroup, compute the semigroup sum of the weights of the points lying within any query halfspace. Letting $m$ denote the space requirements, we prove a lower bound for general semigroups of Ω(n1-1/(d+1)/m1/(d+1)) and for integral semigroups of Ω(n/m1/d). Our lower bounds are proved in the semigroup arithmetic model. Neglecting logarithmic factors, our result for integral semigroups matches the best known upper bound due to Matou{\v s}ek. Our result for general semigroups improves upon the best known lower bound due to Br{\"o}nnimann, Chazelle, and Pach. Moreover, Fonseca and Mount have recently shown that, given uniformly distributed points, halfspace range queries over idempotent semigroups can be answered in O(n1-1/(d+1)/m1/(d+1)) time in the semigroup arithmetic model. As our lower bounds are established for uniformly distributed point sets, it follows that they also resolve the computational complexity of halfspace range searching over idempotent semigroups in this important special case.},
	keywords = {Idempotence, lower bounds, Range searching},
	isbn = {978-1-4503-0016-2},
	doi = {10.1145/1810959.1810964},
	url = {http://doi.acm.org/10.1145/1810959.1810964},
	author = {Arya,Sunil and Mount, Dave and Xia,Jian}
}
@conference {15855,
	title = {Arabic Cross-Document Coreference Resolution},
	booktitle = {Proceedings of the ACL-IJCNLP 2009 Conference Short Papers$}$},
	year = {2009},
	month = {2009///},
	pages = {357 - 360},
	author = {Sayeed,A. and Elsayed,T. and Garera,N. and Alexander,D. and Xu,T. and Oard, Douglas and Yarowsky,D. and Piatko,C.}
}
@conference {14208,
	title = {Combining powerful local and global statistics for texture description},
	booktitle = {IEEE Conference on Computer Vision and Pattern Recognition, 2009. CVPR 2009},
	year = {2009},
	month = {2009/06/20/25},
	pages = {573 - 580},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A texture descriptor is proposed, which combines local highly discriminative features with the global statistics of fractal geometry to achieve high descriptive power, but also invariance to geometric and illumination transformations. As local measurements SIFT features are estimated densely at multiple window sizes and discretized. On each of the discretized measurements the fractal dimension is computed to obtain the so-called multifractal spectrum, which is invariant to geometric transformations and illumination changes. Finally to achieve robustness to scale changes, a multi-scale representation of the multifractal spectrum is developed using a framelet system, that is, a redundant tight wavelet frame system. Experiments on classification demonstrate that the descriptor outperforms existing methods on the UIUC as well as the UMD high-resolution dataset.},
	keywords = {Computer science, discretized measurements, fractal geometry, Fractals, geometric transformations, global statistics, Histograms, illumination transformations, image classification, image resolution, Image texture, lighting, local measurements SIFT features, local statistics, MATHEMATICS, multifractal spectrum, multiscale representation, Power engineering and energy, Power engineering computing, Robustness, Solids, Statistics, texture description, UMD high-resolution dataset, wavelet frame system, Wavelet transforms},
	isbn = {978-1-4244-3992-8},
	doi = {10.1109/CVPR.2009.5206741},
	author = {Yong Xu and Si-Bin Huang and Hui Ji and Ferm{\"u}ller, Cornelia}
}
@article {13895,
	title = {The Maryland Modular Method: An Approach to Doctoral Education in Information Studies},
	journal = {Journal of education for library and information science},
	volume = {50},
	year = {2009},
	month = {2009///},
	pages = {293 - 301},
	author = {Druin, Allison and Jaeger,P. T and Golbeck,J. and Fleischmann,K.R. and Jimmy Lin and Qu,Y. and Wang,P. and Xie,B.}
}
@article {19726,
	title = {Three genomes from the phylum Acidobacteria provide insight into the lifestyles of these microorganisms in soils.},
	journal = {Appl Environ Microbiol},
	volume = {75},
	year = {2009},
	month = {2009 Apr},
	pages = {2046-56},
	abstract = {<p>The complete genomes of three strains from the phylum Acidobacteria were compared. Phylogenetic analysis placed them as a unique phylum. They share genomic traits with members of the Proteobacteria, the Cyanobacteria, and the Fungi. The three strains appear to be versatile heterotrophs. Genomic and culture traits indicate the use of carbon sources that span simple sugars to more complex substrates such as hemicellulose, cellulose, and chitin. The genomes encode low-specificity major facilitator superfamily transporters and high-affinity ABC transporters for sugars, suggesting that they are best suited to low-nutrient conditions. They appear capable of nitrate and nitrite reduction but not N(2) fixation or denitrification. The genomes contained numerous genes that encode siderophore receptors, but no evidence of siderophore production was found, suggesting that they may obtain iron via interaction with other microorganisms. The presence of cellulose synthesis genes and a large class of novel high-molecular-weight excreted proteins suggests potential traits for desiccation resistance, biofilm formation, and/or contribution to soil structure. Polyketide synthase and macrolide glycosylation genes suggest the production of novel antimicrobial compounds. Genes that encode a variety of novel proteins were also identified. The abundance of acidobacteria in soils worldwide and the breadth of potential carbon use by the sequenced strains suggest significant and previously unrecognized contributions to the terrestrial carbon cycle. Combining our genomic evidence with available culture traits, we postulate that cells of these isolates are long-lived, divide slowly, exhibit slow metabolic rates under low-nutrient conditions, and are well equipped to tolerate fluctuations in soil hydration.</p>},
	keywords = {Anti-Bacterial Agents, bacteria, Biological Transport, Carbohydrate Metabolism, Cyanobacteria, DNA, Bacterial, Fungi, Genome, Bacterial, Macrolides, Molecular Sequence Data, Nitrogen, Phylogeny, Proteobacteria, Sequence Analysis, DNA, sequence homology, Soil Microbiology},
	issn = {1098-5336},
	doi = {10.1128/AEM.02294-08},
	author = {Ward, Naomi L and Challacombe, Jean F and Janssen, Peter H and Henrissat, Bernard and Coutinho, Pedro M and Wu, Martin and Xie, Gary and Haft, Daniel H and Sait, Michelle and Badger, Jonathan and Barabote, Ravi D and Bradley, Brent and Brettin, Thomas S and Brinkac, Lauren M and Bruce, David and Creasy, Todd and Daugherty, Sean C and Davidsen, Tanja M and DeBoy, Robert T and Detter, J Chris and Dodson, Robert J and Durkin, A Scott and Ganapathy, Anuradha and Gwinn-Giglio, Michelle and Han, Cliff S and Khouri, Hoda and Kiss, Hajnalka and Kothari, Sagar P and Madupu, Ramana and Nelson, Karen E and Nelson, William C and Paulsen, Ian and Penn, Kevin and Ren, Qinghu and Rosovitz, M J and Jeremy D Selengut and Shrivastava, Susmita and Sullivan, Steven A and Tapia, Roxanne and Thompson, L Sue and Watkins, Kisha L and Yang, Qi and Yu, Chunhui and Zafar, Nikhat and Zhou, Liwei and Kuske, Cheryl R}
}
@article {14273,
	title = {Viewpoint Invariant Texture Description Using Fractal Analysis},
	journal = {International Journal of Computer Vision},
	volume = {83},
	year = {2009},
	month = {2009///},
	pages = {85 - 100},
	abstract = {Image texture provides a rich visual description of the surfaces in the scene. Many texture signatures based on various statistical descriptions and various local measurements have been developed. Existing signatures, in general, are not invariant to 3D geometric transformations, which is a serious limitation for many applications. In this paper we introduce a new texture signature, called the multifractal spectrum (MFS). The MFS is invariant under the bi-Lipschitz map, which includes view-point changes and non-rigid deformations of the texture surface, as well as local affine illumination changes. It provides an efficient framework combining global spatial invariance and local robust measurements. Intuitively, the MFS could be viewed as a {\textquotedblleft}better histogram{\textquotedblright} with greater robustness to various environmental changes and the advantage of capturing some geometrical distribution information encoded in the texture. Experiments demonstrate that the MFS codes the essential structure of textures with very low dimension, and thus represents an useful tool for texture classification.},
	isbn = {0920-5691},
	url = {http://dx.doi.org/10.1007/s11263-009-0220-6},
	author = {Yong Xu and Hui Ji and Ferm{\"u}ller, Cornelia}
}
@article {14156,
	title = {Convergence analysis of iterative solvers in inexact Rayleigh quotient iteration},
	journal = {CONVERGENCE},
	volume = {31},
	year = {2008},
	month = {2008///},
	pages = {877 - 899},
	author = {Xue, F. and Elman, Howard}
}
@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.}
}
@article {15413,
	title = {Using a pilot study to derive a GUI model for automated testing},
	journal = {ACM Transactions on Software Engineering and Methodology (TOSEM)},
	volume = {18},
	year = {2008},
	month = {2008/11//},
	pages = {7:1{\textendash}7:35 - 7:1{\textendash}7:35},
	abstract = {Graphical user interfaces (GUIs) are one of the most commonly used parts of today{\textquoteright}s software. Despite their ubiquity, testing GUIs for functional correctness remains an understudied area. A typical GUI gives many degrees of freedom to an end-user, leading to an enormous input event interaction space that needs to be tested. GUI test designers generate and execute test cases (modeled as sequences of user events) to traverse its parts; targeting a subspace in order to maximize fault detection is a nontrivial task. In this vein, in previous work, we used informal GUI code examination and personal intuition to develop an event-interaction graph (EIG). In this article we empirically derive the EIG model via a pilot study, and the resulting EIG validates our intuition used in previous work; the empirical derivation process also allows for model evolution as our understanding of GUI faults improves. Results of the pilot study show that events interact in complex ways; a GUI{\textquoteright}s response to an event may vary depending on the context established by preceding events and their execution order. The EIG model helps testers to understand the nature of interactions between GUI events when executed in test cases and why certain events detect faults, so that they can better traverse the event space. New test adequacy criteria are defined for the EIG; new algorithms use these criteria and EIG to systematically generate test cases that are shown to be effective on four fielded open-source applications.},
	keywords = {Graphical user interfaces, model-based testing, test minimization, Test suite management},
	isbn = {1049-331X},
	doi = {10.1145/1416563.1416567},
	url = {http://doi.acm.org/10.1145/1416563.1416567},
	author = {Xie,Qing and Memon, Atif M.}
}
@article {14190,
	title = {A View-Point Invariant Texture Descriptor},
	journal = {Journal of VisionJ Vis},
	volume = {8},
	year = {2008},
	month = {2008/05/10/},
	pages = {354 - 354},
	abstract = {A new texture descriptor based on fractal geometry, called the multi fractal spectrum (MFS) is introduced. The key quantity in the study of fractal geometry is the fractal dimension, which is a measure of how an object changes over scale. Consider the intensity of an image as a 3D surface and slice it at regular intervals at the dimension of height. For each interval we obtain a point set, for which we compute the fractal dimension. The vector composed of the fractal dimensions of all point sets is called the MFS of intensity. Replacing the intensity with other quantities, such as the density function, or the output of various filters (e.g. Laplacian, Gradient filters), different MFS descriptors are obtained. The MFS is shown mathematically to be invariant under any smooth mapping (bi-Lipschitz maps), which includes view-point changes and non-rigid deformations of the surface as well as local affine illumination changes. Computational experiments on unstructured textures, such as landscapes and shelves in a supermarket, demonstrate the robustness of the MFS to environmental changes. On standard data sets the MFS performs comparable to the top texture descriptors in the task of classification. However, in contrast to other descriptors, it has extremely low dimension and can be computed very efficiently and robustly. Psychophysical demonstrate that humans can differentiate black and white textures on the basis of the fractal dimension.},
	isbn = {, 1534-7362},
	doi = {10.1167/8.6.354},
	url = {http://www.journalofvision.org/content/8/6/354},
	author = {Ferm{\"u}ller, Cornelia and Yong Xu and Hui Ji}
}
@inbook {15425,
	title = {Agile Quality Assurance Techniques for GUI-Based Applications},
	booktitle = {Agile software development quality assuranceAgile software development quality assurance},
	year = {2007},
	month = {2007///},
	pages = {114 - 114},
	publisher = {Idea Group Inc (IGI)},
	organization = {Idea Group Inc (IGI)},
	isbn = {1599042169, 9781599042169},
	author = {Memon, Atif M. and Xie,Q.}
}
@article {16998,
	title = {Browsing large online data tables using generalized query previews},
	journal = {Information Systems},
	volume = {32},
	year = {2007},
	month = {2007/05//},
	pages = {402 - 423},
	abstract = {Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purpose. Users query such tables with front-ends that typically use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. Such a situation leads users to waste time and network/server resources posing queries that have zero- or mega-hit results. Generalized query previews enable efficient browsing of large online data tables by supplying data distribution information to users. The data distribution information provides continuous feedback about the size of the result set as the query is being formed. Our paper presents a new user interface architecture and discusses three controlled experiments (with 12, 16, and 48 participants). Our prototype systems provide flexible user interfaces for research and testing of the ideas. The user studies show that for exploratory querying tasks, generalized query previews can speed user performance for certain user domains and can reduce network/server load.},
	keywords = {Information Visualization, Internet, Online querying, World-wide web},
	isbn = {0306-4379},
	doi = {10.1016/j.is.2005.12.006},
	url = {http://www.sciencedirect.com/science/article/pii/S0306437905001213},
	author = {Tanin,Egemen and Shneiderman, Ben and Xie,Hairuo}
}
@article {13740,
	title = {Combining outputs from multiple machine translation systems},
	journal = {Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference},
	year = {2007},
	month = {2007///},
	pages = {228 - 235},
	abstract = {Currently there are several approaches tomachine translation (MT) based on differ-
ent paradigms; e.g., phrasal, hierarchical
and syntax-based. These three approaches
yield similar translation accuracy despite
using fairly different levels of linguistic
knowledge. The availability of such a
variety of systems has led to a growing
interest toward finding better translations
by combining outputs from multiple sys-
tems. This paper describes three differ-
ent approaches to MT system combina-
tion. These combination methods oper-
ate on sentence, phrase and word level
exploiting information from N -best lists,
system scores and target-to-source phrase
alignments. The word-level combination
provides the most robust gains but the
best results on the development test sets
(NIST MT05 and the newsgroup portion
of GALE 2006 dry-run) were achieved by
combining all three methods.
},
	author = {Rosti,A.V.I. and Ayan,N.F. and Xiang,B. and Matsoukas,S. and Schwartz,R. and Dorr, Bonnie J}
}
@article {15411,
	title = {Designing and comparing automated test oracles for GUI-based software applications},
	journal = {ACM Trans. Softw. Eng. Methodol.},
	volume = {16},
	year = {2007},
	month = {2007/02//},
	abstract = {Test designers widely believe that the overall effectiveness and cost of software testing depends largely on the type and number of test cases executed on the software. This article shows that the test oracle, a mechanism that determines whether a software is executed correctly for a test case, also significantly impacts the fault detection effectiveness and cost of a test case. Graphical user interfaces (GUIs), which have become ubiquitous for interacting with today{\textquoteright}s software, have created new challenges for test oracle development. Test designers manually {\textquotedblleft}assert{\textquotedblright} the expected values of specific properties of certain GUI widgets in each test case; during test execution, these assertions are used as test oracles to determine whether the GUI executed correctly. Since a test case for a GUI is a sequence of events, a test designer must decide: (1) what to assert; and (2) how frequently to check an assertion, for example, after each event in the test case or after the entire test case has completed execution. Variations of these two factors significantly impact the fault-detection ability and cost of a GUI test case. A technique to declaratively specify different types of automated GUI test oracles is described. Six instances of test oracles are developed and compared in an experiment on four software systems. The results show that test oracles do affect the fault detection ability of test cases in different and interesting ways: (1) Test cases significantly lose their fault detection ability when using {\textquotedblleft}weak{\textquotedblright} test oracles; (2) in many cases, invoking a {\textquotedblleft}thorough{\textquotedblright} oracle at the end of test case execution yields the best cost-benefit ratio; (3) certain test cases detect faults only if the oracle is invoked during a small {\textquotedblleft}window of opportunity{\textquotedblright} during test execution; and (4) using thorough and frequently-executing test oracles can compensate for not having long test cases.},
	keywords = {Graphical user interfaces, GUI state, GUI testing, test oracles, User interfaces, widgets},
	isbn = {1049-331X},
	doi = {10.1145/1189748.1189752},
	url = {http://doi.acm.org/10.1145/1189748.1189752},
	author = {Xie,Qing and Memon, Atif M.}
}
@article {18564,
	title = {Diagnosing network disruptions with network-wide analysis},
	journal = {SIGMETRICS Perform. Eval. Rev.},
	volume = {35},
	year = {2007},
	month = {2007/06//},
	pages = {61 - 72},
	abstract = {To maintain high availability in the face of changing network conditions, network operators must quickly detect, identify, and react to events that cause network disruptions. One way to accomplish this goal is to monitor routing dynamics, by analyzing routing update streams collected from routers. Existing monitoring approaches typically treat streams of routing updates from different routers as independent signals, and report only the "loud" events (i.e., events that involve large volume of routing messages). In this paper, we examine BGP routing data from all routers in the Abilene backbone for six months and correlate them with a catalog of all known disruptions to its nodes and links. We find that many important events are not loud enough to be detected from a single stream. Instead, they become detectable only when multiple BGP update streams are simultaneously examined. This is because routing updates exhibit network-wide dependencies. This paper proposes using network-wide analysis of routing information to diagnose (i.e., detect and identify) network disruptions. To detect network disruptions, we apply a multivariate analysis technique on dynamic routing information, (i.e., update traffic from all the Abilene routers) and find that this technique can detect every reported disruption to nodes and links within the network with a low rate of false alarms. To identify the type of disruption, we jointly analyze both the network-wide static configuration and details in the dynamic routing updates; we find that our method can correctly explain the scenario that caused the disruption. Although much work remains to make network-wide analysis of routing data operationally practical, our results illustrate the importance and potential of such an approach.},
	keywords = {anomaly detection, network management, statistical inference},
	isbn = {0163-5999},
	doi = {10.1145/1269899.1254890},
	url = {http://doi.acm.org/10.1145/1269899.1254890},
	author = {Huang,Yiyi and Feamster, Nick and Lakhina,Anukool and Xu,Jim (Jun)}
}
@conference {19637,
	title = {Geometry and Charge State of Mixed-Ligand Au13 Nanoclusters},
	booktitle = {X-RAY ABSORPTION FINE STRUCTURE - XAFS13: 13th International Conference},
	volume = {882},
	year = {2007},
	month = {2007/02/02/},
	pages = {749 - 751},
	publisher = {AIP Publishing},
	organization = {AIP Publishing},
	abstract = {The integration of synthetic, experimental and theoretical tools into a self-consistent data analysis methodology allowed us to develop unique new levels of detail in nanoparticle characterization. We describe our methods using an example of Au 13 monolayer-protected clusters (MPCs), synthesized by ligand exchange methods. The combination of atom counting methods of scanning transmission electron microscopy and Au L3-edge EXAFS allowed us to characterize these clusters as icosahedral, with surface strain reduced from 5\% (as in ideal, regular icosahedra) to 3\%, due to the interaction with ligands. Charge transfer from Au to the thiol and phosphine ligands was evidenced by S and P K-edge XANES. A comparison of total energies of bare clusters of different geometries was performed by equivalent crystal theory calculations.},
	keywords = {Atom surface interactions, Charge transfer, Data analysis, Extended X-ray absorption fine structure spectroscopy, Gold, nanoparticles, Scanning transmission electron microscopy, Surface strains, Total energy calculations, X-ray absorption near edge structure},
	url = {http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.2644652},
	author = {Frenkel, A. I. and Menard, L. D. and Northrup, P. and Rodriguez, J. A. and Zypman, F. and Dana Dachman-Soled and Gao, S.-P. and Xu, H. and Yang, J. C. and Nuzzo, R. G.}
}
@conference {13723,
	title = {Annotation compatibility working group report},
	booktitle = {Proceedings of the Workshop on Frontiers in Linguistically Annotated Corpora 2006},
	series = {LAC {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {38 - 53},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {This report explores the question of compatibility between annotation projects including translating annotation formalisms to each other or to common forms. Compatibility issues are crucial for systems that use the results of multiple annotation projects. We hope that this report will begin a concerted effort in the field to track the compatibility of annotation schemes for part of speech tagging, time annotation, treebanking, role labeling and other phenomena.},
	isbn = {1-932432-78-7},
	url = {http://dl.acm.org/citation.cfm?id=1641991.1641997},
	author = {Meyers,A. and Fang,A. C. and Ferro,L. and K{\"u}bler,S. and Jia-Lin,T. and Palmer,M. and Poesio,M. and Dolbey,A. and Schuler,K. K. and Loper,E. and Zinsmeister,H. and Penn,G. and Xue,N. and Hinrichs,E. and Wiebe,J. and Pustejovsky,J. and Farwell,D. and Hajicova,E. and Dorr, Bonnie J and Hovy,E. and Onyshkevych,B. A. and Levin,L.}
}
@conference {15483,
	title = {Model-based testing of community-driven open-source GUI applications},
	booktitle = {Software Maintenance, 2006. ICSM{\textquoteright}06. 22nd IEEE International Conference on},
	year = {2006},
	month = {2006///},
	pages = {145 - 154},
	abstract = {Although the World-Wide-Web (WWW) has significantly enhanced open-source software (OSS) development, it has also created new challenges for quality assurance (QA), especially for OSS with a graphical-user interface (GUI) front-end. Distributed communities of developers, connected by the WWW, work concurrently on loosely-coupled parts of the OSS and the corresponding GUI code. Due to the unprecedented code churn rates enabled by the WWW, developers may not have time to determine whether their recent modifications have caused integration problems with the overall OSS; these problems can often be detected via GUI integration testing. However, the resource-intensive nature of GUI testing prevents the application of existing automated QA techniques used during conventional OSS evolution. In this paper we develop new process support for three nested techniques that leverage developer communities interconnected by the WWW to automate model-based testing of evolving GUI-based OSS. The "innermost" technique (crash testing) operates on each code check-in of the GUI software and performs a quick and fully automatic integration test. The second technique {smoke testing) operates on each day{\textquoteright}s GUI build and performs functional "reference testing" of the newly integrated version of the GUI. The third (outermost) technique (comprehensive GUI testing) conducts detailed integration testing of a major GUI release. An empirical study involving four popular OSS shows that (1) the overall approach is useful to detect severe faults in GUI-based OSS and (2) the nesting paradigm helps to target feedback and makes effective use of the WWW by implicitly distributing QA},
	isbn = {0-7695-2354-4},
	doi = {10.1109/ICSM.2006.39},
	author = {Xie,Q. and Memon, Atif M.}
}
@article {17309,
	title = {Nuclear Envelope Dystrophies Show a Transcriptional Fingerprint Suggesting Disruption of Rb{\textendash}MyoD Pathways in Muscle Regeneration},
	journal = {BrainBrain},
	volume = {129},
	year = {2006},
	month = {2006/04/01/},
	pages = {996 - 1013},
	abstract = {Mutations of lamin A/C (LMNA) cause a wide range of human disorders, including progeria, lipodystrophy, neuropathies and autosomal dominant Emery{\textendash}Dreifuss muscular dystrophy (EDMD). EDMD is also caused by X-linked recessive loss-of-function mutations of emerin, another component of the inner nuclear lamina that directly interacts with LMNA. One model for disease pathogenesis of LMNA and emerin mutations is cell-specific perturbations of the mRNA transcriptome in terminally differentiated cells. To test this model, we studied 125 human muscle biopsies from 13 diagnostic groups (125 U133A, 125 U133B microarrays), including EDMD patients with LMNA and emerin mutations. A Visual and Statistical Data Analyzer (VISDA) algorithm was used to statistically model cluster hierarchy, resulting in a tree of phenotypic classifications. Validations of the diagnostic tree included permutations of U133A and U133B arrays, and use of two probe set algorithms (MAS5.0 and MBEI). This showed that the two nuclear envelope defects (EDMD LMNA, EDMD emerin) were highly related disorders and were also related to fascioscapulohumeral muscular dystrophy (FSHD). FSHD has recently been hypothesized to involve abnormal interactions of chromatin with the nuclear envelope. To identify disease-specific transcripts for EDMD, we applied a leave-one-out (LOO) cross-validation approach using LMNA patient muscle as a test data set, with reverse transcription{\textendash}polymerase chain reaction (RT{\textendash}PCR) validations in both LMNA and emerin patient muscle. A high proportion of top-ranked and validated transcripts were components of the same transcriptional regulatory pathway involving Rb1 and MyoD during muscle regeneration (CRI-1, CREBBP, Nap1L1, ECREBBP/p300), where each was specifically upregulated in EDMD. Using a muscle regeneration time series (27 time points) we develop a transcriptional model for downstream consequences of LMNA and emerin mutations. We propose that key interactions between the nuclear envelope and Rb and MyoD fail in EDMD at the point of myoblast exit from the cell cycle, leading to poorly coordinated phosphorylation and acetylation steps. Our data is consistent with mutations of nuclear lamina components leading to destabilization of the transcriptome in differentiated cells.},
	keywords = {EDMD = Emery{\textendash}Dreifuss muscular dystrophy, emerin, Emery-Dreifuss muscular dystrophy, FSHD = fascioscapulohumeral muscular dystrophy, IDG = individual discriminatory genes, JDG = jointly discriminatory genes, lamin A/C, LGMD = limb-girdle muscular dystrophy, LOO = leave-one-out, RT{\textendash}PCR = reverse transcription{\textendash}polymerase chain reaction; VISDA = Visual and Statistical Data Analyzer, Skeletal muscle, wFC = weighted Fisher criterion},
	isbn = {0006-8950, 1460-2156},
	doi = {10.1093/brain/awl023},
	url = {http://brain.oxfordjournals.org/content/129/4/996},
	author = {Bakay,Marina and Wang,Zuyi and Melcon,Gisela and Schiltz,Louis and Xuan,Jianhua and Zhao,Po and Sartorelli,Vittorio and Seo,Jinwook and Pegoraro,Elena and Angelini,Corrado and Shneiderman, Ben and Escolar,Diana and Chen,Yi-Wen and Winokur,Sara T and Pachman,Lauren M and Fan,Chenguang and Mandler,Raul and Nevo,Yoram and Gordon,Erynn and Zhu,Yitan and Dong,Yibin and Wang,Yue and Hoffman,Eric P}
}
@conference {14187,
	title = {A Projective Invariant for Textures},
	booktitle = {2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
	volume = {2},
	year = {2006},
	month = {2006///},
	pages = {1932 - 1939},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Image texture analysis has received a lot of attention in the past years. Researchers have developed many texture signatures based on texture measurements, for the purpose of uniquely characterizing the texture. Existing texture signatures, in general, are not invariant to 3D transforms such as view-point changes and non-rigid deformations of the texture surface, which is a serious limitation for many applications. In this paper, we introduce a new texture signature, called the multifractal spectrum (MFS). It provides an efficient framework combining global spatial invariance and local robust measurements. The MFS is invariant under the bi-Lipschitz map, which includes view-point changes and non-rigid deformations of the texture surface, as well as local affine illumination changes. Experiments demonstrate that the MFS captures the essential structure of textures with quite low dimension.},
	keywords = {Computer science, Computer vision, Educational institutions, Fractals, Geometry, Image texture, Level set, lighting, Robustness, Surface texture},
	isbn = {0-7695-2597-0},
	doi = {10.1109/CVPR.2006.38},
	author = {Yong Xu and Hui Ji and Ferm{\"u}ller, Cornelia}
}
@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 {13416,
	title = {Active Constrained Clustering by Examining Spectral Eigenvectors},
	booktitle = {Discovery ScienceDiscovery Science},
	series = {Lecture Notes in Computer Science},
	volume = {3735},
	year = {2005},
	month = {2005///},
	pages = {294 - 307},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examining Spectral eigenvectorS (ACCESS) derived from a similarity matrix. The ACCESS method uses an analysis based on the theoretical properties of spectral decomposition to identify data items that are likely to be located on the boundaries of clusters, and for which providing constraints can resolve ambiguity in the cluster descriptions. Empirical results on three synthetic and five real data sets show that ACCESS significantly outperforms constrained spectral clustering using randomly selected constraints.},
	isbn = {978-3-540-29230-2},
	url = {http://dx.doi.org/10.1007/11563983_25},
	author = {Xu,Qianjun and desJardins, Marie and Wagstaff,Kiri},
	editor = {Hoffmann,Achim and Motoda,Hiroshi and Scheffer,Tobias}
}
@article {15445,
	title = {Automating regression testing for evolving GUI software},
	journal = {Journal of Software Maintenance and Evolution: Research and Practice},
	volume = {17},
	year = {2005},
	month = {2005///},
	pages = {27 - 64},
	abstract = {With the widespread deployment of broadband connections worldwide, software development and maintenance are increasingly being performed by multiple engineers, often working around-the-clock to maximize code churn rates. To ensure rapid quality assurance of such software, techniques such as {\textquoteleft}nightly/daily building and smoke testing{\textquoteright} have become widespread since they often reveal bugs early in the software development process. During these builds, a development version of the software is checked out from the source code repository tree, compiled, linked, and (re)tested with the goal of (re)validating its basic functionality. Although successful for conventional software, smoke tests are difficult to develop and automatically re-run for software that has a graphical user interface (GUI). In this paper, we describe a framework called DART (Daily Automated Regression Tester) that addresses the needs of frequent and automated re-testing of GUI software. The key to our success is automation: DART automates everything from structural GUI analysis, smoke-test-case generation, test-oracle creation, to code instrumentation, test execution, coverage evaluation, regeneration of test cases, and their re-execution. Together with the operating system{\textquoteright}s task scheduler, DART can execute frequently with little input from the developer/tester to re-test the GUI software. We provide results of experiments showing the time taken and memory required for GUI analysis, test case and test oracle generation, and test execution. We empirically compare the relative costs of employing different levels of detail in the GUI test oracle. We also show the events and statements covered by the smoke test cases. Copyright {\textcopyright} 2005 John Wiley \& Sons, Ltd.},
	keywords = {daily/nightly builds, event-flow graphs, Graphical user interfaces, GUI regression testing, GUI testing, smoke testing, Software quality},
	isbn = {1532-0618},
	doi = {10.1002/smr.305},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/smr.305/abstract},
	author = {Memon, Atif M. and Nagarajan,Adithya and Xie,Qing}
}
@conference {13427,
	title = {Constrained spectral clustering under a local proximity structure assumption},
	booktitle = {In Proceedings of the 18th International Conference of the Florida Artificial Intelligence Research Society (FLAIRS-05)},
	year = {2005},
	month = {2005///},
	abstract = {This work focuses on incorporating pairwise constraints into a spectral clustering algorithm. A new constrained spectral clustering method is proposed, as well as an active constraint acquisition technique and a heuristic for parameter selection. We demonstrate that our constrained spectral clustering method, CSC, works well when the data exhibits what we term local proximity structure. Empirical results on synthetic and real data sets show that CSC outperforms two other constrained clustering algorithms.},
	author = {Xu,Q. and desJardins, Marie}
}
@conference {15482,
	title = {Rapid "crash testing" for continuously evolving GUI-based software applications},
	booktitle = {Software Maintenance, 2005. ICSM{\textquoteright}05. Proceedings of the 21st IEEE International Conference on},
	year = {2005},
	month = {2005/09//},
	pages = {473 - 482},
	abstract = {Several rapid-feedback-based quality assurance mechanisms are used to manage the quality of continuously evolving software. Even though graphical user interfaces (GUIs) are one of the most important parts of software, there are currently no mechanisms to quickly retest evolving GUI software. We leverage our previous work on GUI testing to define a new automatic GUI re-testing process called "crash testing" that is integrated with GUI evolution. We describe two levels of crash testing: (1) immediate feedback-based in which a developer indicates that a GUI bug was fixed in response to a previously reported crash; only select crash test cases are rerun and the developer is notified of the results in a matter of seconds, and (2) between code changes in which new crash test cases are generated on-the-fly and executed on the GUI. Since the code may be changed by another developer before all the crash tests have been executed, hence requiring restarting of the process, we use a simple rotation-based scheme to ensure that all crash tests are executed over a series of code changes. We show, via empirical studies, that our crash tests are effective at revealing serious problems in the GUI.},
	keywords = {crash testing, graphical user interface software retesting, Graphical user interfaces, GUI-based software application, immediate feedback, program testing, rapid-feedback-based quality assurance, software evolution, Software maintenance, software prototyping, Software quality},
	doi = {10.1109/ICSM.2005.72},
	author = {Xie,Q. and Memon, Atif 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.}
}
@conference {18792,
	title = {Algorithmic Foundations for Consistency-Checking of Interaction-States of Mechatronic Systems},
	year = {2004},
	month = {2004///},
	address = {Salt Lake City, Utah, USA},
	abstract = {In order to reduce product development time, we needsoftware tools that can perform automated validation of the
proposed design concepts. These tools will ensure that only
valid design concepts are transferred to the detailed design
stage for further development. This paper provides a step
towards the automated validation of proposed design concepts.
We define the problem of consistency-checking of interaction-
states as a key step in the design concept validation. We present
a polynomial time algorithm for solving the interaction
consistency-checking problem. We also present an algorithm
for analyzing inconsistent interaction-states and identifying the
inconsistent interactions. We believe that the framework
described in this paper will provide the underlying foundations
for constructing the next generation software tools for
conceptual design of complex mechatronic systems.
},
	url = {ftp://ftp.eng.umd.edu/:/home/glue/s/k/skgupta/pub/Publication/DETC04_Xu.pdf},
	author = {Xu,C. and Gupta,S.K.}
}
@article {15342,
	title = {Assessment of inflow boundary conditions for compressible turbulent boundary layers},
	journal = {Physics of Fluids},
	volume = {16},
	year = {2004},
	month = {2004///},
	pages = {2623 - 2623},
	author = {Xu,S. and Martin, M.P}
}
@conference {15480,
	title = {Empirical evaluation of the fault-detection effectiveness of smoke regression test cases for GUI-based software},
	booktitle = {Software Maintenance, 2004. Proceedings. 20th IEEE International Conference on},
	year = {2004},
	month = {2004/09//},
	pages = {8 - 17},
	abstract = {Daily builds and smoke regression tests have become popular quality assurance mechanisms to detect defects early during software development and maintenance. In previous work, we addressed a major weakness of current smoke regression testing techniques, i.e., their lack of ability to automatically (re)test graphical user interface (GUI) event interactions - we presented a GUI smoke regression testing process called daily automated regression tester (DART). We have deployed DART and have found several interesting characteristics of GUI smoke tests that we empirically demonstrate in this paper. We also combine smoke tests with different types of test oracles and present guidelines for practitioners to help them generate and execute the most effective combinations of test-case length and test oracle complexity. Our experimental subjects consist of four GUI-based applications. We generate 5000-8000 smoke tests (enough to be run in one night) for each application. Our results show that: (1) short GUI smoke tests with certain test oracles are effective at detecting a large number of faults; (2) there are classes of faults that our smoke test cannot detect; (3) short smoke tests execute a large percentage of code; and (4) the entire smoke testing process is feasible to do in terms of execution time and storage space.},
	keywords = {daily automated regression tester, daily builds, fault-detection effectiveness, graphical user interface, Graphical user interfaces, GUI-based software, program testing, Quality assurance, Regression analysis, smoke regression test cases, software development, software fault tolerance, Software maintenance, Software quality, software quality assurance, test oracle complexity, test oracles, test-case length},
	doi = {10.1109/ICSM.2004.1357785},
	author = {Memon, Atif M. and Xie,Qing}
}
@conference {18778,
	title = {A Framework for Conceptual Design of Multiple Interaction-State Mechatronic Systems},
	year = {2004},
	month = {2004///},
	address = {Lausanne, Switzerland},
	abstract = {Increasingly, complex mechatronic systems are beingdesigned to have higher levels of autonomy and
intelligence. This requires them to operate in
multiple interaction-states. To facilitate computer-
aided conceptual design of complex mechatronic
systems, this paper provides a framework for
modeling design concepts behind mechatronic
systems with multiple interaction-states. We
introduce the primitives and operators used in the
modeling framework, and illustrate the modeling
process by an example.
},
	url = {http://www.glue.umd.edu/~skgupta/Publication/TMCE04_Xu.pdf},
	author = {Gupta,S.K. and Xu,C. and Yao,Z.}
}
@conference {15429,
	title = {Using transient/persistent errors to develop automated test oracles for event-driven software},
	booktitle = {Automated Software Engineering, 2004. Proceedings. 19th International Conference on},
	year = {2004},
	month = {2004/09//},
	pages = {186 - 195},
	abstract = {Today{\textquoteright}s software-intensive systems contain an important class of software, namely event-driven software (EDS). All EDS take events as input, change their state, and (perhaps) output an event sequence. EDS is typically implemented as a collection of event-handlers designed to respond to individual events. The nature of EDS creates new challenges for test automation. In this paper, we focus on those relevant to automated test oracles. A test oracle is a mechanism that determines whether a software executed correctly for a test case. A test case for an EDS consists of a sequence of events. The test case is executed on the EDS, one event at a time. Errors in the EDS may "appear" and later {\textquotedblright}disappear" at several points (e.g., after an event is executed) during test case execution. Because of the behavior of these transient (those that disappear) and persistent (those that don{\textquoteright}t disappear) errors, EDS require complex and expensive test oracles that compare the expected and actual output multiple times during test case execution. We leverage our previous work to study several applications and observe the occurrence of persistent/transient errors. Our studies show that in practice, a large number of errors in EDS are transient and that there are specific classes of events that lead to transient errors. We use the results of this study to develop a new test oracle that compares the expected and actual output at strategic points during test case execution. We show that the oracle is effective at detecting errors and efficient in terms of resource utilization},
	keywords = {automated test oracles, Automatic testing, event driven software, Graphical user interfaces, persistent errors, program testing, resource allocation, resource utilization, software intensive systems, test case execution, transient errors},
	doi = {10.1109/ASE.2004.1342736},
	author = {Memon, Atif M. and Xie,Qing}
}
@inbook {14598,
	title = {Combinatorial Algorithms for Design of DNA Arrays},
	booktitle = {Chip TechnologyChip Technology},
	series = {Advances in Biochemical Engineering/Biotechnology},
	volume = {77},
	year = {2002},
	month = {2002///},
	pages = {1 - 19},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Optimal design of DNA arrays requires the development of algorithms with two-fold goals: reducing the effects caused by unintended illumination ( border length minimization problem ) and reducing the complexity of masks ( mask decomposition problem ). We describe algorithms that reduce the number of rectangles in mask decomposition by 20{\textendash}30\% as compared to a standard array design under the assumption that the arrangement of oligonucleotides on the array is fixed. This algorithm produces provably optimal solution for all studied real instances of array design. We also address the difficult problem of finding an arrangement which minimizes the border length and come up with a new idea of threading that significantly reduces the border length as compared to standard designs.},
	isbn = {978-3-540-43215-9},
	url = {http://dx.doi.org/10.1007/3-540-45713-5_1},
	author = {Hannenhalli, Sridhar and Hubbell,Earl and Lipshutz,Robert and Pevzner,Pavel},
	editor = {Hoheisel,J{\"o}rg and Brazma,A. and B{\"u}ssow,K. and Cantor,C. and Christians,F. and Chui,G. and Diaz,R. and Drmanac,R. and Drmanac,S. and Eickhoff,H. and Fellenberg,K. and Hannenhalli, Sridhar and Hoheisel,J. and Hou,A. and Hubbell,E. and Jin,H. and Jin,P. and Jurinke,C. and Konthur,Z. and K{\"o}ster,H. and Kwon,S. and Lacy,S. and Lehrach,H. and Lipshutz,R. and Little,D. and Lueking,A. and McGall,G. and Moeur,B. and Nordhoff,E. and Nyarsik,L. and Pevzner,P. and Robinson,A. and Sarkans,U. and Shafto,J. and Sohail,M. and Southern,E. and Swanson,D. and Ukrainczyk,T. and van den Boom,D. and Vilo,J. and Vingron,M. and Walter,G. and Xu,C.}
}
@article {15094,
	title = {Key-insulated public key cryptosystems},
	journal = {Advances in Cryptology{\textemdash}Eurocrypt 2002},
	year = {2002},
	month = {2002///},
	pages = {65 - 82},
	abstract = {Cryptographic computations (decryption, signature generation, etc.) are often performed on a relatively insecure device (e.g., a mobile device or an Internet-connected host) which cannot be trusted to maintain secrecy of the private key. We propose and investigate the notion of key-insulated security whose goal is to minimize the damage caused by secret-key exposures. In our model, the secret key(s) stored on the insecure device are refreshed at discrete time periods via inter-action with a physically-secure - but computationally-limited - device which stores a {\textquotedblleft}master key{\textquotedblright}. All cryptographic computations are still done on the insecure device, and the public key remains unchanged. In a (t, N)-key-insulated scheme, an adversary who compromises the insecure device and obtains secret keys for up to t periods of his choice is unable to violate the security of the cryptosystem for any of the remaining N - t periods. Furthermore, the scheme remains secure (for all time periods) against an adversary who compromises only the physically-secure device. We focus primarily on key-insulated public-key encryption. We construct a (t, N)-key-insulated encryption scheme based on any (standard) public-key encryption scheme, and give a more efficient construction based on the DDH assumption. The latter construction is then extended to achieve chosen-ciphertext security.},
	doi = {10.1007/3-540-46035-7_5},
	author = {Dodis,Y. and Katz, Jonathan and Xu,S. and Yung,M.}
}
@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.}
}
@conference {18765,
	title = {Web-based innovation alert services to support product design evolution},
	year = {2002},
	month = {2002///},
	abstract = {Technological innovations provide an opportunity toimprove product performance and reduce cost. Therefore,
design organizations are interested in monitoring technological
innovations. A large number of innovations are announced
every year. Monitoring them manually is very time consuming.
We are developing web-based innovation-alert services that can
be used to monitor and communicate information about
innovations relevant to a particular product design. In this
paper, we discuss the required infrastructure, relevant design
issues, and our approach to developing web-based innovation
alert services to support product design evolution. We also
describe a prototype innovation monitoring service for
computer components and an interactive tool to transform
semi-structured web contents into semantic representations in
XML.
},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.198.1039\&rep=rep1\&type=pdf},
	author = {Gupta,S.K. and Lin,E. and Lo,A. J. and Xu,C.}
}
@conference {13501,
	title = {ARobust Method for Unknown Forms Analysis},
	booktitle = {ICDAR},
	year = {1999},
	month = {1999///},
	pages = {531 - 534},
	author = {Xingyuan,L. and David Doermann and Oh,W. and Gao,W.}
}
@article {17969,
	title = {Adaptive real-time level-of-detail based rendering for polygonal models},
	journal = {Visualization and Computer Graphics, IEEE Transactions on},
	volume = {3},
	year = {1997},
	month = {1997/06//apr},
	pages = {171 - 183},
	abstract = {We present an algorithm for performing adaptive real-time level-of-detail-based rendering for triangulated polygonal models. The simplifications are dependent on viewing direction, lighting, and visibility and are performed by taking advantage of image-space, object-space, and frame-to-frame coherences. In contrast to the traditional approaches of precomputing a fixed number of level-of-detail representations for a given object, our approach involves statically generating a continuous level-of-detail representation for the object. This representation is then used at run time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications, where there are a limited number of highly complex objects that stay relatively close to the viewer. Our approach is applicable for scalar (such as distance from the viewer) as well as vector (such as normal direction) attributes},
	keywords = {(computer, adaptive, attributes;scientific, attributes;view-dependent, coherence;image-space;lighting;multiresolution, direction;visibility;computational, geometry;data, graphics);, hierarchies;object-space;run, hierarchies;triangulated, level-of-detail, models;vector, polygonal, real-time, refinement;triangle, rendering;displayed, simplifications;viewing, systems;rendering, time;scalar, triangles;frame-to-frame, visualisation;real-time, visualization;selective},
	isbn = {1077-2626},
	doi = {10.1109/2945.597799},
	author = {Xia,J. C and El-Sana,J. and Varshney, Amitabh}
}
@conference {14813,
	title = {MDL: a language and compiler for dynamic program instrumentation},
	booktitle = {, 1997 International Conference on Parallel Architectures and Compilation Techniques., 1997. Proceedings},
	year = {1997},
	month = {1997/11/10/14},
	pages = {201 - 212},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We use a form of dynamic code generation, called dynamic instrumentation, to collect data about the execution of an application program. Dynamic instrumentation allows us to instrument running programs to collect performance and other types of information. The instrumentation code is generated incrementally and can be inserted and removed at any time. Our instrumentation currently runs on the SPARC, PA-RISC, Power 2, Alpha, and x86 architectures. Specification of what data to collect are written in a specialized language called the Metric Description Language, that is part of the Paradyn Parallel Performance Tools. This language allows platform independent descriptions of how to collect performance data. It also provides a concise way to specify, how to constrain performance data to particular resources such as modules, procedures, nodes, files, or message channels (or combinations of these resources). We also describe the details of how we weave instrumentation into a running program},
	keywords = {Alpha architecture, application program, application program interfaces, Application software, compiler generators, Computer science, dynamic code generation, Dynamic compiler, dynamic program instrumentation, Educational institutions, files, instrumentation code, Instruments, MDL, measurement, message channels, Message passing, Metric Description Language, modules, nodes, Operating systems, optimising compilers, PA-RISC, Paradyn Parallel Performance Tools, Parallel architectures, parallel programming, performance data, platform independent descriptions, Power 2 architecture, Power generation, procedures, program debugging, Program processors, running programs, Runtime, software metrics, SPARC, Specification languages, x86 architecture},
	isbn = {0-8186-8090-3},
	doi = {10.1109/PACT.1997.644016},
	author = {Hollingsworth, Jeffrey K and Niam, O. and Miller, B. P and Zhichen Xu and Goncalves,M. J.R and Ling Zheng}
}
@conference {17960,
	title = {Dynamic view-dependent simplification for polygonal models},
	booktitle = {Visualization {\textquoteright}96. Proceedings.},
	year = {1996},
	month = {1996///},
	pages = {327 - 334},
	abstract = {Presents an algorithm for performing view-dependent simplifications of a triangulated polygonal model in real-time. The simplifications are dependent on viewing direction, lighting and visibility, and are performed by taking advantage of image-space, object-space and frame-to-frame coherences. A continuous level-of-detail representation for an object is first constructed off-line. This representation is then used at run-time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications where there are a limited number of highly complex objects that stay relatively close to the viewer.},
	keywords = {coherence;image-space, coherence;incremental, coherence;real-time, continuous, direction;visibility;data, dynamic, level-of-detail, list, model;viewing, polygonal, representation;displayed, selection;triangulated, simplification;scientific, triangle, updating;frame-to-frame, updating;lighting;object-space, view-dependent, visualisation;, visualization;triangle},
	doi = {10.1109/VISUAL.1996.568126},
	author = {Xia,J. C and Varshney, Amitabh}
}
