@article {20323, title = {Natural Disasters and Cholera Outbreaks: Current Understanding and Future Outlook}, journal = {Current Environmental Health Reports}, year = {2017}, month = {Jan-03-2017}, pages = {99 - 107}, abstract = {Purpose of Review Diarrheal diseases remain a serious global public health threat, especially for those populations lacking access to safe water and sanitation infrastructure. Although association of several diarrheal diseases, e.g., cholera, shigellosis, etc., with climatic processes has been documented, the global human population remains at heightened risk of outbreak of diseases after natural disasters, such as earthquakes, floods, or droughts. In this review, cholera was selected as a signature diarrheal disease and the role of natural disasters in triggering and transmitting cholera was analyzed. Recent Findings Key observations include identification of an inherent feedback loop that includes societal structure, prevailing climatic processes, and spatio-temporal seasonal variability of natural disasters. Data obtained from satellite-based remote sensing are concluded to have application, although limited, in predicting risks of a cholera outbreak(s). Summary We argue that with the advent of new high spectral and spatial resolution data, earth observation systems should be seamlessly integrated in a decision support mechanism to be mobilize resources when a region suffers a natural disaster. A framework is proposed that can be used to assess the impact of natural disasters with response to outbreak of cholera, providing assessment of short- and long-term influence of climatic processes on disease outbreaks.}, doi = {10.1007/s40572-017-0132-5}, url = {http://link.springer.com/10.1007/s40572-017-0132-5}, author = {Jutla, Antarpreet and Khan, Rakibul and Rita R Colwell} } @article {20351, title = {Non-O1/Non-O139 Vibrio cholerae Carrying Multiple Virulence Factors and V. cholerae O1 in the Chesapeake Bay, Maryland}, journal = {Applied and Environmental Microbiology}, year = {2015}, month = {Mar-03-2016}, pages = {1909 - 1918}, abstract = {Non-O1/non-O139 Vibrio cholerae inhabits estuarine and coastal waters globally, but its clinical significance has not been sufficiently investigated, despite the fact that it has been associated with septicemia and gastroenteritis. The emergence of virulent non-O1/non-O139 V. cholerae is consistent with the recognition of new pathogenic variants worldwide. Oyster, sediment, and water samples were collected during a vibrio surveillance program carried out from 2009 to 2012 in the Chesapeake Bay, Maryland. V. cholerae O1 was detected by a direct fluorescent-antibody (DFA) assay but was not successfully cultured, whereas 395 isolates of non-O1/non-O139 V. cholerae were confirmed by multiplex PCR and serology. Only a few of the non-O1/non-O139 V. cholerae isolates were resistant to ampicillin and/or penicillin. Most of the isolates were sensitive to all antibiotics tested, and 77 to 90\% carried the El Tor variant hemolysin gene hlyA ET, the actin cross-linking repeats in toxin gene rtxA, the hemagglutinin protease gene hap, and the type 6 secretion system. About 19 to 21\% of the isolates carried the neuraminidase-encoding gene nanH and/or the heat-stable toxin (NAG-ST), and only 5\% contained a type 3 secretion system. None of the non-O1/non-O139 V. cholerae isolates contained Vibrio pathogenicity island-associated genes. However, ctxA, ace, or zot was present in nine isolates. Fifty-five different genotypes showed up to 12 virulence factors, independent of the source of isolation, and represent the first report of both antibiotic susceptibility and virulence associated with non-O1/non-O139 V. cholerae from the Chesapeake Bay. Since these results confirm the presence of potentially pathogenic non-O1/non-O139 V. cholerae, monitoring for total V. cholerae, regardless of serotype, should be done within the context of public health.}, issn = {0099-2240}, doi = {10.1128/AEM.03540-14}, url = {http://aem.asm.org/lookup/doi/10.1128/AEM.03540-14}, author = {Ceccarelli, Daniela and Chen, Arlene and Hasan, Nur A. and Rashed, Shah M. and Huq, Anwar and Rita R Colwell}, editor = {Elkins, C. A.} } @article {20338, title = {Nontoxigenic Vibrio cholerae Non-O1/O139 Isolate from a Case of Human Gastroenteritis in the U.S. Gulf Coast}, journal = {Journal of Clinical Microbiology}, year = {2015}, month = {Jun-01-2016}, pages = {9 - 14}, abstract = {An occurrence of Vibrio cholerae non-O1/O139 gastroenteritis in the U.S. Gulf Coast is reported here. Genomic analysis revealed that the isolate lacked known virulence factors associated with the clinical outcome of a V. cholerae infection but did contain putative genomic islands and other accessory virulence factors. Many of these factors are widespread among environmental strains of V. cholerae, suggesting that there might be additional virulence factors in non-O1/O139 V. cholerae yet to be determined. Phylogenetic analysis revealed that the isolate belonged to a phyletic lineage of environmental V. cholerae isolates associated with sporadic cases of gastroenteritis in the Western Hemisphere, suggesting a need to monitor non-O1/O139 V. cholerae in the interest of public health.}, issn = {0095-1137}, doi = {10.1128/JCM.02187-14}, url = {http://jcm.asm.org/lookup/doi/10.1128/JCM.02187-14}, author = {Hasan, Nur A. and Rezayat, Talayeh and Blatz, Peter J. and Choi, Seon Young and Griffitt, Kimberly J. and Rashed, Shah M. and Huq, Anwar and Conger, Nicholas G. and Rita R Colwell and Grimes, D. Jay}, editor = {Munson, E.} } @article {20371, title = {A new integrative conjugative element detected in Haitian isolates of Vibrio cholerae non-O1/non-O139}, journal = {Research in Microbiology}, volume = {164}, year = {2013}, month = {Jan-11-2013}, pages = {891 - 893}, abstract = {The presence of SXT/R391-related integrating conjugative elements (ICEs) in Vibrio cholerae O1 and non-O1/non-O139 isolated from clinical and environmental samples in Haiti in 2010 was studied. The main finding of this work was the identification of the novel ICEVchHai2 among closely related V. cholerae non-O1/non-O139 clinical strains. The mosaic structure of this element confirms the role of ICEs as efficient recombination systems whereby new genetic material can be acquired and exchanged, according V. cholerae strains new accessory functions. }, issn = {09232508}, doi = {10.1016/j.resmic.2013.08.004}, url = {https://linkinghub.elsevier.com/retrieve/pii/S092325081300154X}, author = {Ceccarelli, Daniela and Spagnoletti, Matteo and Hasan, Nur A. and Lansing, Stephanie and Huq, Anwar and Rita R Colwell} } @conference {17630, title = {Networking lessons: From computers to water}, booktitle = {2012 Fourth International Conference on Communication Systems and Networks (COMSNETS)}, year = {2012}, month = {2012/01/03/7}, pages = {1 - 6}, publisher = {IEEE}, organization = {IEEE}, abstract = {As an instance of using IT to green non-IT domains, we consider the question whether lessons from computer networking can be applied in water distribution networks to improve their energy footprint and/or efficiency. Our contributions in this work are: (i) we identify several areas where principles from computer networking can be used to better water distribution; (ii) we focus on a specific infrastructure enhancement problem caused by increasing demands on a water utility network and present solutions (similar to those used in computer networks) that optimize both operational expenditure and total cost of ownership. We validate our solutions through simulations and compare their efficacy against techniques that are traditionally used in enhancing water networks. Our results show that lessons from computer networks can help in enhancing water networks.}, keywords = {Biological cells, computer networking, Computer networks, COMPUTERS, energy footprint, Genetic algorithms, green nonIT domains, infrastructure enhancement problem, Internet, network theory (graphs), networking lessons, planning, pricing, water distribution networks, water supply, water utility network}, isbn = {978-1-4673-0296-8}, doi = {10.1109/COMSNETS.2012.6151373}, author = {Narayanan,I. and Sarangan,V. and Vasan, A. and Srinivasan, Aravind and Sivasubramaniam,A.} } @article {13610, title = {No-Reference Image Quality Assessment using Visual Codebooks}, journal = {Image Processing, IEEE Transactions on}, volume = {PP}, year = {2012}, month = {2012///}, pages = {1 - 1}, abstract = {The goal of no-reference objective image quality assessment (NR-IQA) is to develop a computational model that can predict the human perceived quality of distorted images accurately and automatically without any prior knowledge of reference images. Most existing NR-IQA approaches are distortionspecific (DS) and are typically limited to one or two specific types of distortions. In most practical applications, however, information about the distortion type is not really available. In this paper, we propose a general-purpose NR-IQA approach based on visual codebooks. A visual codebook consisting of Gabor filter based local features extracted from local image patches is used to capture complex statistics of a natural image. The codebook encodes statistics by quantizing the feature space and accumulating histograms of patch appearances. This method does not assume any specific types of distortions, however, when evaluating images with a particular type of distortion, it does require examples with the same or similar distortion for training. Experimental results demonstrate that the predicted quality score using our method is consistent with human perceived image quality. The proposed method is comparable to state-ofthe- art general purpose NR-IQA methods and outperforms the full-reference image quality metrics, peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM) on the LIVE image quality assessment database.}, isbn = {1057-7149}, doi = {10.1109/TIP.2012.2190086}, author = {Ye,P. and David Doermann} } @conference {17306, title = {NetVisia: Heat Map \& Matrix Visualization of Dynamic Social Network Statistics \& Content}, 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 = {19 - 26}, publisher = {IEEE}, organization = {IEEE}, abstract = {Visualizations of static networks in the form of node-link diagrams have evolved rapidly, though researchers are still grappling with how best to show evolution of nodes over time in these diagrams. This paper introduces NetVisia, a social network visualization system designed to support users in exploring temporal evolution in networks by using heat maps to display node attribute changes over time. NetVisia{\textquoteright}s novel contributions to network visualizations are to (1) cluster nodes in the heat map by similar metric values instead of by topological similarity, and (2) align nodes in the heat map by events. We compare NetVisia to existing systems and describe a formative user evaluation of a NetVisia prototype with four participants that emphasized the need for tool tips and coordinated views. Despite the presence of some usability issues, in 30-40 minutes the user evaluation participants discovered new insights about the data set which had not been discovered using other systems. We discuss implemented improvements to NetVisia, and analyze a co-occurrence network of 228 business intelligence concepts and entities. This analysis confirms the utility of a clustered heat map to discover outlier nodes and time periods.}, keywords = {business intelligence concept, business intelligence entity, competitive intelligence, data visualisation, dynamic networks, dynamic social network, heat map, Heating, Image color analysis, Information Visualization, Layout, matrix visualization, measurement, NetVisia system, network evolution, network visualization, node-link diagrams, outlier node, social network content, Social network services, social network statistics, social networking (online), social networks, static network visualization, time period, topological similarity, Training, usability, user evaluation, User interfaces}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.216}, author = {Gove,R. and Gramsky,N. and Kirby,R. and Sefer,E. and Sopan,A. and Dunne,C. and Shneiderman, Ben and Taieb-Maimon,M.} } @article {17629, title = {Network Clustering Approximation Algorithm Using One Pass Black Box Sampling}, journal = {arXiv:1110.3563}, year = {2011}, month = {2011/10/16/}, abstract = {Finding a good clustering of vertices in a network, where vertices in the same cluster are more tightly connected than those in different clusters, is a useful, important, and well-studied task. Many clustering algorithms scale well, however they are not designed to operate upon internet-scale networks with billions of nodes or more. We study one of the fastest and most memory efficient algorithms possible - clustering based on the connected components in a random edge-induced subgraph. When defining the cost of a clustering to be its distance from such a random clustering, we show that this surprisingly simple algorithm gives a solution that is within an expected factor of two or three of optimal with either of two natural distance functions. In fact, this approximation guarantee works for any problem where there is a probability distribution on clusterings. We then examine the behavior of this algorithm in the context of social network trust inference.}, keywords = {Computer Science - Social and Information Networks, Physics - Physics and Society}, url = {http://arxiv.org/abs/1110.3563}, author = {DuBois,Thomas and Golbeck,Jennifer and Srinivasan, Aravind} } @article {16489, title = {New models and algorithms for throughput maximization in broadcast scheduling}, journal = {Approximation and Online Algorithms}, year = {2011}, month = {2011///}, pages = {71 - 82}, author = {Chekuri,C. and Gal,A. and Im,S. and Khuller, Samir and Li,J. and McCutchen,R. and Moseley,B. and Raschid, Louiqa} } @article {19111, title = {Next Generation Sequence Assembly with AMOS}, journal = {Current Protocols in Bioinformatics}, volume = {11}, year = {2011}, month = {2011}, pages = {1 - 11}, author = {Treangen, T.J. and Sommer, D.D. and Angly, F.E. and Koren, S. and Pop, Mihai} } @conference {13609, title = {No-reference image quality assessment based on visual codebook}, booktitle = {Image Processing (ICIP), 2011 18th IEEE International Conference on}, year = {2011}, month = {2011/09//}, pages = {3089 - 3092}, abstract = {In this paper, we propose a new learning based No-Reference Image Quality Assessment (NR-IQA) algorithm, which uses a visual codebook consisting of robust appearance descriptors extracted from local image patches to capture complex statistics of natural image for quality estimation. We use Gabor filter based local features as appearance descriptors and the codebook method encodes the statistics of natural image classes by vector quantizing the feature space and accumulating histograms of patch appearances based on this coding. This method does not assume any specific types of distortion and experimental results on the LIVE image quality assessment database show that this method provides consistent and reliable performance in quality estimation that exceeds other state-of-the-art NR-IQA approaches and is competitive with the full reference measure PSNR.}, keywords = {assessment;quality, codebook;Gabor, descriptors;complex, estimation;visual, extraction;image, filter;appearance, filters;feature, gabor, image, image;no-reference, patches;natural, QUALITY, statistics;local, texture;}, doi = {10.1109/ICIP.2011.6116318}, author = {Ye,Peng and David Doermann} } @article {15774, title = {Nouveau-ROUGE: A Novelty Metric for Update Summarization}, journal = {Computational Linguistics}, volume = {37}, year = {2011}, month = {2011///}, pages = {1 - 8}, abstract = {An update summary should provide a fluent summarization of new information on a time-evolving topic, assuming that the reader has already reviewed older documents or summaries. In 2007 and 2008, an annual summarization evaluation included an update summarization task. Several participating systems produced update summaries indistinguishable from human-generated summaries when measured using ROUGE. However, no machine system performed near human-level performance in manual evaluations such as pyramid and overall responsiveness scoring.}, isbn = {0891-2017}, doi = {10.1162/coli_a_00033}, url = {http://dx.doi.org/10.1162/coli_a_00033}, author = {Conroy,John M. and Schlesinger,Judith D. and O{\textquoteright}Leary, Dianne P.} } @conference {13070, title = {A novel feature descriptor based on the shearlet transform}, booktitle = {Image Processing (ICIP), 2011 18th IEEE International Conference on}, year = {2011}, month = {2011/09//}, pages = {1033 - 1036}, abstract = {Problems such as image classification, object detection and recognition rely on low-level feature descriptors to represent visual information. Several feature extraction methods have been proposed, including the Histograms of Oriented Gradients (HOG), which captures edge information by analyzing the distribution of intensity gradients and their directions. In addition to directions, the analysis of edge at different scales provides valuable information. Shearlet transforms provide a general framework for analyzing and representing data with anisotropic information at multiple scales. As a consequence, signal singularities, such as edges, can be precisely detected and located in images. Based on the idea of employing histograms to estimate the distribution of edge orientations and on the accurate multi-scale analysis provided by shearlet transforms, we propose a feature descriptor called Histograms of Shearlet Coefficients (HSC). Experimental results comparing HOG with HSC show that HSC provides significantly better results for the problems of texture classification and face identification.}, keywords = {analysis;multiscale, analysis;object, classification;face, classification;image, classification;intensity, coefficients;image, descriptor;feature, detection;object, distribution, edge, EXTRACTION, extraction;image, gradient, gradients;histograms, identification;feature, methods;histograms, of, orientations;face, oriented, recognition;feature, recognition;shearlet, recognition;transforms;, shearlet, singularities;texture, texture;object, transform;signal}, doi = {10.1109/ICIP.2011.6115600}, author = {Schwartz, W.R. and da Silva,R.D. and Davis, Larry S. and Pedrini,H.} } @conference {14994, title = {NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates}, booktitle = {Proceedings of the 42nd ACM technical symposium on Computer science education}, year = {2011}, month = {2011///}, pages = {617 - 618}, author = {Prasad,S. K. and Chtchelkanova,A. and Das,S. and Dehne,F. and Gouda,M. and Gupta,A. and JaJa, Joseph F. and Kant,K. and La Salle,A. and LeBlanc,R. and others} } @article {17720, title = {On the Numerical Analysis of Oblique Projectors}, journal = {SIAM Journal on Matrix Analysis and Applications}, volume = {32}, year = {2011}, month = {2011///}, pages = {309 - 348}, abstract = {An oblique projector is an idempotent matrix whose null space is oblique to its range, in contrast to an orthogonal projector, whose null space is orthogonal to its range. Oblique projectors arise naturally in many applications and have a substantial literature. Missing from that literature, however, are systematic expositions of their numerical properties, including their perturbation theory, their various representations, their behavior in the presence of rounding error, the computation of complementary projections, and updating algorithms. This article is intended to make a start at filling this gap. The first part of the article is devoted to the first four of the above topics, with particular attention given to complementation. In the second part, stable algorithms are derived for updating an XQRY representation of projectors, which was introduced in the first part.}, keywords = {$B$-orthogonality, oblique projector, Perturbation theory, updating algorithms, XQRY form}, doi = {10.1137/100792093}, url = {http://link.aip.org/link/?SML/32/309/1}, author = {Stewart, G.W.} } @article {15300, title = {Natural language annotations for the Semantic Web}, journal = {On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE}, year = {2010}, month = {2010///}, pages = {1317 - 1331}, author = {Katz,B. and Jimmy Lin and Quan,D.} } @conference {12499, title = {Nearest-neighbor search algorithms on non-Euclidean manifolds for computer vision applications}, booktitle = {Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing}, series = {ICVGIP {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {282 - 289}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Nearest-neighbor searching is a crucial component in many computer vision applications such as face recognition, object recognition, texture classification, and activity recognition. When large databases are involved in these applications, it is also important to perform these searches in a fast manner. Depending on the problem at hand, nearest neighbor strategies need to be devised over feature and model spaces which in many cases are not Euclidean in nature. Thus, metrics that are tuned to the geometry of this space are required which are also known as geodesics. In this paper, we address the problem of fast nearest neighbor searching in non-Euclidean spaces, where in addition to dealing with the large size of the dataset, the significant computational load involves geodesic computations. We study the applicability of the various classes of nearest neighbor algorithms toward this end. Exact nearest neighbor methods that rely solely on the existence of a metric can be extended, albeit with a huge computational cost. We derive an approximate method of searching via approximate embeddings using the logarithmic map. We study the error incurred in such an embedding and show that it performs well in real experiments.}, keywords = {Grassmann manifold, hashing, manifold, nearest-neighbor, region covariance, shapes}, isbn = {978-1-4503-0060-5}, doi = {10.1145/1924559.1924597}, url = {http://doi.acm.org/10.1145/1924559.1924597}, author = {Turaga,Pavan and Chellapa, Rama} } @conference {13318, title = {Nested refinement domains for tetrahedral and diamond hierarchies}, booktitle = {IEEE Visualization}, year = {2010}, month = {2010///}, abstract = {Three nested refinement domains for hierarchies of tetrahedra and diamonds. The descendant domain (left) is the limit shape of thedomain covered by all descendants of a given diamond (colored). Due to the fractal nature of these shapes, we introduce the more conservative convex descendant domain (middle) and bounding box descendant domain (right) to simplify the computation while still tightly covering the descendant domain. In each case, the refinement domain of one of the diamond{\textquoteright}s parents, grandparents and great-grandparents is shown. }, author = {Weiss,K. and De Floriani, Leila} } @conference {18589, title = {Network I/O fairness in virtual machines}, booktitle = {Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures}, series = {VISA {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {73 - 80}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {We present a mechanism for achieving network I/O fairness in virtual machines, by applying flexible rate limiting mechanisms directly to virtual network interfaces. Conventional approaches achieve this fairness by implementing rate limiting either in the virtual machine monitor or hypervisor, which generates considerable CPU interrupt and instruction overhead for forwarding packets. In contrast, our design pushes per-VM rate limiting as close as possible to the physical hardware themselves, effectively implementing per-virtual interface rate limiting in hardware. We show that this design reduces CPU overhead (both interrupts and instructions) by an order of magnitude. Our design can be applied either to virtual servers for cloud-based services, or to virtual routers}, keywords = {netfpga, network virtualization, xen}, isbn = {978-1-4503-0199-2}, doi = {10.1145/1851399.1851412}, url = {http://doi.acm.org/10.1145/1851399.1851412}, author = {Anwer,Muhammad Bilal and Nayak,Ankur and Feamster, Nick and Liu,Ling} } @inbook {15597, title = {New Approaches to Robust, Point-Based Image Registration}, booktitle = {Image Registration for Remote SensingImage Registration for Remote Sensing}, year = {2010}, month = {2010///}, publisher = {Cambridge University Press}, organization = {Cambridge University Press}, abstract = {We consider various algorithmic solutions to image registration based on thealignment of a set of feature points. We present a number of enhancements to a branch-and-bound algorithm introduced by Mount, Netanyahu, and Le Moigne (Pattern Recognition, Vol. 32, 1999, pp. 17{\textendash}38), which presented a registration algorithm based on the partial Hausdorff distance. Our enhance- ments include a new distance measure, the discrete Gaussian mismatch, and a number of improvements and extensions to the above search algorithm. Both distance measures are robust to the presence of outliers, that is, data points from either set that do not match any point of the other set. We present experimental studies, which show that the new distance measure considered can provide significant improvements over the partial Hausdorff distance in instances where the number of outliers is not known in advance. These experiments also show that our other algorithmic improvements can offer tangible improvements. We demonstrate the algorithm{\textquoteright}s efficacy by considering images involving different sensors and different spectral bands, both in a traditional framework and in a multiresolution framework. }, isbn = {9780521516112}, author = {Mount, Dave and Netanyahu,N. S and Ratanasanya,S.}, editor = {LeMoigne,Jacqueline and Netanyahu,Nathan S. and Eastman,Roger D.} } @conference {17633, title = {New Constructive Aspects of the Lovasz Local Lemma}, booktitle = {2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS)}, year = {2010}, month = {2010/10/23/26}, pages = {397 - 406}, publisher = {IEEE}, organization = {IEEE}, abstract = {The Lov{\textquoteright}{a}sz Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of {\textquoteleft}{\textquoteleft}bad{\textquoteright}{\textquoteright} events, with positive probability. A series of results have provided algorithms to efficiently construct structures whose existence is non-constructively guaranteed by the LLL, culminating in the recent breakthrough of Moser \& Tardos. We show that the output distribution of the Moser-Tardos algorithm well-approximates the emph{conditional LLL-distribution} {\textendash} the distribution obtained by conditioning on all bad events being avoided. We show how a known bound on the probabilities of events in this distribution can be used for further probabilistic analysis and give new constructive and non-constructive results. We also show that when an LLL application provides a small amount of slack, the number of resamplings of the Moser-Tardos algorithm is nearly linear in the number of underlying independent variables (not events!), and can thus be used to give efficient constructions in cases where the underlying proof applies the LLL to super-polynomially many events. Even in cases where finding a bad event that holds is computationally hard, we show that applying the algorithm to avoid a polynomial-sized {\textquoteleft}{\textquoteleft}core{\textquoteright}{\textquoteright} subset of bad events leads to a desired outcome with high probability. We demonstrate this idea on several applications. We give the first constant-factor approximation algorithm for the Santa Claus problem by making an LLL-based proof of Feige constructive. We provide Monte Carlo algorithms for acyclic edge coloring, non-repetitive graph colorings, and Ramsey-type graphs. In all these applications the algorithm falls directly out of the non-constructive LLL-based proof. Our algorithms are very simple, often provide better bounds than previous algorithms, and are in several cases the first efficient algorithms known. As a second type of application we consider settings beyond the critical dependency threshold of the LLL: - - avoiding all bad events is impossible in these cases. As the first (even non-constructive) result of this kind, we show that by sampling from the LLL-distribution of a selected smaller core, we can avoid a fraction of bad events that is higher than the expectation. MAX $k$-SAT is an example of this.}, keywords = {acyclic edge coloring, Algorithm design and analysis, Approximation algorithms, Approximation methods, computational complexity, Computer science, constant factor approximation algorithm, graph colouring, Linearity, Lovasz Local Lemma, MAX k-SAT, Monte Carlo Algorithm, Monte Carlo methods, Moser-Tardos algorithm, nonrepetitive graph coloring, output distribution, polynomial sized core subset, Polynomials, Probabilistc Method, probabilistic analysis, probabilistic logic, probability, Ramsey type graph, Sampling methods, Santa Claus Problem}, isbn = {978-1-4244-8525-3}, doi = {10.1109/FOCS.2010.45}, author = {Haeupler,B. and Saha,B. and Srinivasan, Aravind} } @article {16053, title = {New forms of Human-Computer Interaction for Visualizing Information}, journal = {Information Visualization}, year = {2010}, month = {2010///}, abstract = {The Graphical User Interface (GUI) {\textendash} although developed in research laboratories in the late 1970s {\textendash} is still the dominant interaction paradigm in Information Visualization. We propose a new interaction paradigm called Blended Interaction. It combines ideas of Embodied Cognition, Multimodal Interaction, Reality-Based Interaction \& Ubiquitous Computing. This is intended to stress that a single increase in the reality aspect of the interaction cannot go far enough. The particular challenge {\textendash} and from the user{\textquoteright}s standpoint, the key advantage {\textendash} lies in a meaningful marriage between the tested real-world options and the digital world. As a minimum this marriage must exist on the levels of the interaction, communication, of the way we solve problems with conventional tools (workflows), and of the design of the space or the architecture of buildings and places. The digital world often offers entirely new possibilities and takes the form of interactive devices of various shapes but also of intelligent everyday objects (e.g. the {\textquoteright}Internet of things{\textquoteright}). In our view, interaction concepts can indeed offer a new quality of interaction, but only when the design of the interaction includes all these domains at the same time and with equal weighting. We test the suitability of our ideas of Blended Interaction concepts by using specific application examples that are being worked on as part of current research projects. Our experiences show that this new interaction paradigm has also great potential for interacting with visualization. For example, we have developed multi-touch scatter plots \& facet maps for tangible user interfaces supporting the searching \& browsing in Digital Libraries. We have embedded different visualizations into a Zoomable Object-oriented Information Landscape (ZOIL), which supports our vision of using visualizations on different displays of different size at the same time. We have developed specific kind of search tokens that supports collaborative search activities. For example, we try to address the following research questions: * How can future interactive InfoVis tools look like, especially in the light of the idea Blended Interaction? * How can future interactive InfoVis tools benefit from Multi-Displays \& Multimodal environments used by Multiple Users? * What are the specific design requirements for multi-touch visualizations? * How can we support the collaborative use visualization tools?}, author = {Reiterer,H. and Kerren,A. and Plaisant, Catherine and Stasko,J.T.} } @conference {15137, title = {A new framework for efficient password-based authenticated key exchange}, booktitle = {Proceedings of the 17th ACM conference on Computer and communications security}, series = {CCS {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {516 - 525}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-line dictionary attacks in which an eavesdropping adversary exhaustively enumerates the dictionary of likely passwords in an attempt to match a password to the set of observed transcripts. To date, few general frameworks for constructing PAKE protocols in the standard model are known. Here, we abstract and generalize a protocol by Jiang and Gong to give a new methodology for realizing PAKE without random oracles, in the common reference string model. In addition to giving a new approach to the problem, the resulting construction off ers several advantages over prior work. We also describe an extension of our protocol that is secure within the universal composability (UC) framework and, when instantiated using El Gamal encryption, is more efficient than a previous protocol of Canetti et al.}, keywords = {exchange, key, password-based}, isbn = {978-1-4503-0245-6}, doi = {10.1145/1866307.1866365}, url = {http://doi.acm.org/10.1145/1866307.1866365}, author = {Groce,Adam and Katz, Jonathan} } @article {15070, title = {A New Framework for Password-Based Authenticated Key Exchange}, journal = {ACM CCCS 2010}, year = {2010}, month = {2010///}, abstract = {Protocols for password-based authenticated key exchange (PAKE) allowtwo users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-line dictionary attacks in which an eavesdropping adversary exhaustively enumerates the dictionary of likely passwords in an attempt to match a password to the set of observed transcripts. To date, few general frameworks for constructing PAKE protocols in the standard model are known. Here, we abstract and generalize a protocol by Jiang and Gong to give a new methodology for realizing PAKE without random oracles, in the common reference string model. In addition to giving a new approach to the problem, the resulting construction offers several advantages over prior work. We also describe an extension of our protocol that is secure within the universal composability~(UC) framework and, when instantiated using El Gamal encryption, is more efficient than a previous protocol of Canetti et al. }, keywords = {Cryptographic protocols, password-based key exchange}, url = {http://eprint.iacr.org/2010/147}, author = {Groce,Adam and Katz, Jonathan} } @conference {18641, title = {Nfsight: netflow-based network awareness tool}, year = {2010}, month = {2010///}, abstract = {Network awareness is highly critical for network and se-curity administrators. It enables informed planning and management of network resources, as well as detection and a comprehensive understanding of malicious activ- ity. It requires a set of tools to efficiently collect, process, and represent network data. While many such tools al- ready exist, there is no flexible and practical solution for visualizing network activity at various granularities, and quickly gaining insights about the status of network as- sets. To address this issue, we developed Nfsight, a Net- Flow processing and visualization application designed to offer a comprehensive network awareness solution. Nfsight constructs bidirectional flows out of the unidi- rectional NetFlow flows and leverages these bidirectional flows to provide client/server identification and intrusion detection capabilities. We present in this paper the in- ternal architecture of Nfsight, the evaluation of the ser- vice, and intrusion detection algorithms. We illustrate the contributions of Nfsight through several case studies conducted by security administrators on a large univer- sity network. }, url = {http://www.usenix.org/event/lisa10/tech/full_papers/Berthier.pdf}, author = {Berthier,R. and Michel Cukier and Hiltunen,M. and Kormann,D. and Vesonder,G. and Sheleheda,D.} } @article {16049, title = {Non-visual exploration of geographic maps: Does sonification help?}, journal = {Disability \& Rehabilitation: Assistive Technology}, volume = {5}, year = {2010}, month = {2010/05//}, pages = {164 - 174}, abstract = {Purpose. This study aims at evaluating the effectiveness of sonification as a mean to provide access to geo-referenced information to users with visual impairments.Method. Thiry-five participants (10 congenitally blind, 10 with acquired blindness and 15 blindfolded sighted) completed four tasks of progressive difficulty. During each task, participants first explored a sonified map by using either a tablet or a keyboard to move across regions and listened to sounds giving information about the current location. Then the participants were asked to identify, among four tactile maps, the one that crossmodally corresponds to the sonifed map they just explored. Finally, participants answered a self-report questionnaire of understanding and satisfaction. Results. Participants achieved high accuracy in all of the four tactile map discrimination tasks. No significant performance difference was found neither between subjects that used keyboard or tablet, nor between the three groups of blind and sighted participants. Differences between groups and interfaces were found in the usage strategies. High levels of satisfaction and understanding of the tools and tasks emerged from users{\textquoteright} reports. }, isbn = {1748-3107, 1748-3115}, doi = {10.3109/17483100903100277}, url = {http://informahealthcare.com/doi/abs/10.3109/17483100903100277}, author = {Delogu,Franco and Palmiero,Massimiliano and Federici,Stefano and Plaisant, Catherine and Zhao,Haixia and Belardinelli,Olivetti} } @article {18534, title = {A Narrow Waist for Multipath Routing}, year = {2009}, month = {2009///}, institution = {School of Computer Science, Georgia Tech}, abstract = {Many applications can use multipath routing to improvereliability or throughput, and many multipath routing pro- tocols exist. Despite this diversity of mechanisms and applications, no common interface exists to allow an ap- plication to select these paths. This paper presents a de- sign for such a common interface, called path bits. Path bits are a small string of opaque, semantic-free bits in a packet header; these bits have a simple property: changing a packet{\textquoteright}s path bits should, with high probability, result in the packet taking a different path to the destination. This paper presents the design of path bits and demonstrates that they are simple enough to be easily implemented in both hardware and software and expressive enough to sup- port a variety of applications that can benefit from mul- tipath routing. We present both hardware and software implementations of multipath routing protocols that im- plement the path bits abstraction, as well as implementa- tions of applications that can use this abstraction with only small modifications. }, author = {Motiwala,M. and bin Tariq,M. and Anwer,B. and Andersen,D. and Feamster, Nick} } @article {16936, title = {A National Initiative for Social Participation}, journal = {ScienceScience}, volume = {323}, year = {2009}, month = {2009/03/13/}, pages = {1426 - 1427}, isbn = {0036-8075, 1095-9203}, doi = {10.1126/science.323.5920.1426}, url = {http://www.sciencemag.org/content/323/5920/1426}, author = {Shneiderman, Ben} } @conference {14564, title = {Network-aware forward caching}, booktitle = {Proceedings of the 18th international conference on World wide web}, series = {WWW {\textquoteright}09}, year = {2009}, month = {2009///}, pages = {291 - 300}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {This paper proposes and evaluates a Network Aware Forward Caching approach for determining the optimal deployment strategy of forward caches to a network. A key advantage of this approach is that we can reduce the network costs associated with forward caching to maximize the benefit obtained from their deployment. We show in our simulation that a 37\% increase to net benefits could be achieved over the standard method of full cache deployment to cache all POPs traffic. In addition, we show that this maximal point occurs when only 68\% of the total traffic is cached. Another contribution of this paper is the analysis we use to motivate and evaluate this problem. We characterize the Internet traffic of 100K subscribers of a US residential broadband provider. We use both layer 4 and layer 7 analysis to investigate the traffic volumes of the flows as well as study the general characteristics of the applications used. We show that HTTP is a dominant protocol and account for 68\% of the total downstream traffic and that 34\% of that traffic is multimedia. In addition, we show that multimedia content using HTTP exhibits a 83\% annualized growth rate and other HTTP traffic has a 53\% growth rate versus the 26\% over all annual growth rate of broadband traffic. This shows that HTTP traffic will become ever more dominent and increase the potential caching opportunities. Furthermore, we characterize the core backbone traffic of this broadband provider to measure the distance travelled by content and traffic. We find that CDN traffic is much more efficient than P2P content and that there is large skew in the Air Miles between POP in a typical network. Our findings show that there are many opportunties in broadband provider networks to optimize how traffic is delivered and cached.}, keywords = {caching, Web}, isbn = {978-1-60558-487-4}, doi = {10.1145/1526709.1526749}, url = {http://doi.acm.org/10.1145/1526709.1526749}, author = {Erman,Jeffrey and Gerber,Alexandre and Hajiaghayi, Mohammad T. and Pei,Dan and Spatscheck,Oliver} } @article {12887, title = {New records of phytoplankton for Bangladesh. 9. Some rare and a new species}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {16}, year = {2009}, month = {2009/06/25/}, abstract = {Ten taxa belonging to Chlorophyceae, Cyanophyceae, Bacillariophyceae and Euglenophyceae, and one with an uncertain taxonomic position have been described in this paper. Of these, 10 taxa have been found to be globally rare and new records for Bangladesh, whereas Strombomonas islamii Khondker sp. nov. has been described as new to science.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v16i1.2734}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/2734}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {19500, title = {No Downtime for Data Conversions: Rethinking Hot Upgrades (CMU-PDL-09-106)}, journal = {Parallel Data Laboratory}, year = {2009}, month = {2009/07/01/}, url = {http://repository.cmu.edu/pdl/74}, author = {Tudor Dumitras and Narasimhan, Priya} } @article {15391, title = {Nonlinear Resonant and Chaotic Dynamics in Microwave Assisted Magnetization Switching}, journal = {Magnetics, IEEE Transactions on}, volume = {45}, year = {2009}, month = {2009/10//}, pages = {3950 - 3953}, abstract = {The switching process of a uniformly magnetized magnetic nanoparticle is considered. The particle is subject to applied fields having both dc and linearly-polarized radio-frequency (RF) components. The possibility of using the RF power to obtain a reduced coercivity of the particle is related to the onset of chaotic magnetization dynamics for moderately low values of the RF field amplitude. Perturbation technique for the evaluation of the reduced coercive field is developed and applied to the microwave assisted switching of the particle. Numerical simulations confirm the predictions of the theory.}, keywords = {amplitude;chaotic, components;magnetic, dynamical, dynamics;coercive, dynamics;numerical, field, field;coercivity;linearly-polarized, force;magnetic, magnetization, nanoparticle;microwave-assisted, particles;magnetic, radiofrequency, resonant, RF, simulations;perturbation, switching;nanoparticles;nonlinear, switching;nonlinear, systems;perturbation, technique;chaos;coercive, theory;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2009.2023242}, author = {d{\textquoteright}Aquino,M. and Serpico,C. and Bertotti,G. and Mayergoyz, Issak D and Bonin,R.} } @conference {13032, title = {Non-parametric bayesian areal linguistics}, 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 = {593 - 601}, author = {Daum{\'e}, Hal} } @article {13045, title = {Name translation in statistical machine translation: Learning when to transliterate}, journal = {Proceedings of ACL-08: HLT}, year = {2008}, month = {2008///}, pages = {389 - 397}, author = {Hermjakob,U. and Knight,K. and Daum{\'e}, Hal} } @article {18502, title = {NANO: Network Access Neutrality Observatory}, volume = {GT-CS-08-03}, year = {2008}, month = {2008///}, institution = {Georgia Institute of Technology}, abstract = {This paper tackles a technical problem that is of growing interest in light of the ongoing network neutrality debate: We aim to develop a system that can reliably determine whether particular ISP is discriminating against a service using only passive measurements from end-hosts. This problem presents significant challenges because many types of discrimination can often resemble commonplace performance degradations (e.g., resulting from failure or misconfiguration). To distinguish discrimination from degradation, we propose a statistical method to estimate causal effect and develop a system, NANO, based on this method. NANO aggregates passive measurements from end-hosts, stratifies the measurements to account for possible confounding factors, and distinguishes when an ISP is discriminating against a particular service or group of clients. Preliminary simulation results demonstrate the promise of NANO for both detecting various types of discrimination and absolving an ISP when it is not discriminating.}, url = {http://hdl.handle.net/1853/25461}, author = {Tariq,M.B. and Motiwala,M. and Feamster, Nick} } @article {17303, title = {NASDAQ Velocity and Forces: An Interactive Visualization of Activity and Change}, journal = {Journal of Universal Computer Science}, volume = {14}, year = {2008}, month = {2008///}, pages = {1391 - 1410}, author = {Dao,H.T. and Bazinet,A. and Berthier,R. and Shneiderman, Ben} } @article {15290, title = {Navigating information spaces: A case study of related article search in PubMed}, journal = {Information Processing \& Management}, volume = {44}, year = {2008}, month = {2008///}, pages = {1771 - 1783}, abstract = {The concept of an {\^a}{\texteuro}{\oe}information space{\^a}{\texteuro} provides a powerful metaphor for guiding the design of interactive retrieval systems. We present a case study of related article search, a browsing tool designed to help users navigate the information space defined by results of the PubMed{\^A}{\textregistered} search engine. This feature leverages content-similarity links that tie MEDLINE{\^A}{\textregistered} citations together in a vast document network. We examine the effectiveness of related article search from two perspectives: a topological analysis of networks generated from information needs represented in the TREC 2005 genomics track and a query log analysis of real PubMed users. Together, data suggest that related article search is a useful feature and that browsing related articles has become an integral part of how users interact with PubMed.}, keywords = {Browsing, Interactive IR, MEDLINE, TREC genomics}, isbn = {0306-4573}, doi = {10.1016/j.ipm.2008.04.002}, url = {http://www.sciencedirect.com/science/article/pii/S0306457308000502}, author = {Jimmy Lin and DiCuccio,Michael and Grigoryan,Vahan and Wilbur,W. John} } @conference {13389, title = {Network-Aware Join Processing in Global-Scale Database Federations}, booktitle = {IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008}, year = {2008}, month = {2008/04/07/12}, pages = {586 - 595}, publisher = {IEEE}, organization = {IEEE}, abstract = {We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation. This metric allows algorithms to exploit excess capacity in the network, while avoiding narrow, long-haul paths. We give a two- approximate, polynomial-time algorithm for serial (left-deep) join schedules. We also present extensions to this algorithm that explore parallel schedules, reduce resource usage, and define tradeoffs between computation and network utilization. We evaluate these techniques within the SkyQuery federation of Astronomy databases using spatial-join queries submitted by SkyQuery{\textquoteright}s users. Experiments show that our algorithms realize near-optimal network utilization with minor computational overhead.}, keywords = {Astronomy, Computer networks, Concurrent computing, global-scale database federations, join scheduling algorithms, network utilization, network-aware join processing, parallel schedules, polynomial-time algorithm, Polynomials, Processor scheduling, Query processing, reduce resource usage, Scheduling algorithm, Spatial databases, spatial-join queries, Telecommunication traffic, Throughput}, isbn = {978-1-4244-1836-7}, doi = {10.1109/ICDE.2008.4497467}, author = {Xiaodan Wang and Burns,R. and Terzis,A. and Deshpande, Amol} } @conference {15060, title = {A New Approach of Dynamic Background Modeling for Surveillance Information}, booktitle = {Computer Science and Software Engineering, 2008 International Conference on}, volume = {1}, year = {2008}, month = {2008/12//}, pages = {850 - 855}, abstract = {This paper presents a new approach of best background modeling for surveillance information. The approach makes orthogonal non-separable wavelet transformation of information frames used for background modeling, extracts the approximate information to reconstruct information frames, filters out the disturbance, shadow and noise from the reconstructed frames, constructs basic background with the method of binary mask images, uses multi-frame combination of non-uniform noise to filter noise in basic background, applies mutual information to detect the situation of adjacent changes. If the background has a gradual change, weighted superposition of multi background modeling images with time will be applied to update the background. If the background has a major or sudden change, the background will remodel from this frame.}, keywords = {approximate information extraction, binary mask images, disturbance filtering, dynamic background modeling, Feature extraction, filtering theory, Image reconstruction, information frame reconstruction, NOISE, noise filtering, orthogonal nonseparable wavelet transformation, Surveillance, surveillance information, Wavelet transforms}, doi = {10.1109/CSSE.2008.601}, author = {Gao,Dongfa and Zhuolin Jiang and Ye,Ming} } @conference {15916, title = {A new multiresolution generalized directional filter bank design and application in image enhancement}, booktitle = {15th IEEE International Conference on Image Processing, 2008. ICIP 2008}, year = {2008}, month = {2008/10//}, pages = {2816 - 2819}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we present an image enhancement technique based on a new multiscale generalized directional filter bank design. The design presented is a shift-invariant overcomplete representation, which is well suited to extracting geometric features such as edges. Special cases of this design method can be made to reduce to different and improved implementations of the shearlet and the contourlet transforms, which are known to represent certain classes of images optimally. Use of this new filter bank design has proven itself competitive in image restoration for noisy images and is well suited for distinguishing noise from weak edges. Experimental results show that our unique image enhancement technique out-performs wavelet and contourlet based enhancement methods.}, keywords = {Algorithm design and analysis, Approximation error, Channel bank filters, contourlet transform, Design methodology, Discrete transforms, Feature extraction, Filter bank, Frequency, geometric feature extraction, Image Enhancement, IMAGE PROCESSING, image resolution, image restoration, Multidimensional digital filters, Multidimensional systems, multiresolution generalized directional filter bank design, shearlet transform, shift-invariant overcomplete representation, transforms, Wavelet transforms}, isbn = {978-1-4244-1765-0}, doi = {10.1109/ICIP.2008.4712380}, author = {Patel, Vishal M. and Easley,G. R and Healy,D. M} } @article {12900, title = {New records of phytoplankton for Bangladesh. 2. Cryptophyceae and Synurophyceae}, journal = {Bangladesh Journal of Botany}, volume = {36}, year = {2008}, month = {2008/11/05/}, abstract = {This study presents two species of Rhodomonas, four species of Chroomonas, six species of Cryptomonas and Cryptochrysis minor, Cyanomonas coeruleus, Chrysodidymus synuroideus and Mallomonas akrokomos. These species have been reported from some ponds of Mathbaria in Pirojpur and Bakerganj of Barisal district in Bangladesh.}, isbn = {0253-5416}, doi = {10.3329/bjb.v36i1.1549}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1549}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12902, title = {New records of phytoplankton for Bangladesh. 5. Euglena, Euglenocapsa}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {15}, year = {2008}, month = {2008/06/16/}, abstract = {This study presents 20 taxa of the genus Euglena and one species of the rare euglenoid genus Euglenocapsa. All these taxa are reported for the first time from some pond ecosystems of Mathbaria in Pirojpur and Bakerganj of Barisal districts of Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v15i1.910}, url = {http://www.banglajol.info/index.php/BJPT/article/viewArticle/910}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12899, title = {New records of phytoplankton for Bangladesh. 7. Phacus spp.}, journal = {Bangladesh Journal of Botany}, volume = {37}, year = {2008}, month = {2008/11/05/}, abstract = {Thirteen species of Phacus hitherto not reported from Bangladesh have been described and illustrated. Freshwater ponds at southern districts of Pirojpur and Barisal revealed these presence of the species.}, isbn = {0253-5416}, doi = {10.3329/bjb.v37i1.1564}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1564}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12897, title = {New records of phytoplankton for Bangladesh. 8. Trachelomonas Ehr. (Euglenophyceae)}, journal = {Bangladesh Journal of Botany}, volume = {37}, year = {2008}, month = {2008/12/19/}, abstract = {Investigation of pelagic plankton communities from some freshwater ponds of Pirojpur and Barisal districts revealed the presence of 17 species under the genus Trachelomonas Ehr. for the first time in Bangladesh.}, isbn = {0253-5416}, doi = {10.3329/bjb.v37i2.1719}, url = {http://www.banglajol.info/bd/index.php/BJB/article/viewArticle/1719}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @conference {16839, title = {NewsStand: a new view on news}, booktitle = {Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems}, series = {GIS {\textquoteright}08}, year = {2008}, month = {2008///}, pages = {18:1{\textendash}18:10 - 18:1{\textendash}18:10}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {News articles contain a wealth of implicit geographic content that if exposed to readers improves understanding of today{\textquoteright}s news. However, most articles are not explicitly geotagged with their geographic content, and few news aggregation systems expose this content to users. A new system named NewsStand is presented that collects, analyzes, and displays news stories in a map interface, thus leveraging on their implicit geographic content. NewsStand monitors RSS feeds from thousands of online news sources and retrieves articles within minutes of publication. It then extracts geographic content from articles using a custom-built geotagger, and groups articles into story clusters using a fast online clustering algorithm. By panning and zooming in NewsStand{\textquoteright}s map interface, users can retrieve stories based on both topical significance and geographic region, and see substantially different stories depending on position and zoom level.}, keywords = {clustering, geotagging, knowledge discovery, text mining}, isbn = {978-1-60558-323-5}, doi = {10.1145/1463434.1463458}, url = {http://doi.acm.org/10.1145/1463434.1463458}, author = {Teitler,Benjamin E. and Lieberman,Michael D. and Panozzo,Daniele and Sankaranarayanan,Jagan and Samet, Hanan and Sperling,Jon} } @article {15339, title = {Nitric oxide production from surface recombination of oxygen and nitrogen atoms}, journal = {Journal of Thermophysics and Heat Transfer}, volume = {22}, year = {2008}, month = {2008///}, pages = {178 - 186}, author = {Pejakovi{\'c},D. A and Marschall,J. and Duan,L. and Martin, M.P} } @article {16937, title = {A Node Aggregation Strategy to Reduce Complexity of Network Visualization using Semantic Substrates}, year = {2008}, month = {2008///}, institution = {Human-Computer Interaction Lab, University of Maryland}, abstract = {Semantic substrates are spatial templates for networks, wherenodes are grouped into regions and laid out within each region according to one or more node attributes. Analysts{\textquoteright} ability to design their own substrates leads to a different approach than other more automatic approaches to layout nodes (force-directed, circular, etc.). While the semantic substrate approach provides more interpretable node locations, sometimes a set of nodes is compressed into a small space on the display, leading to node overlap. In this paper, we significantly improve this situation by introducing the node aggregation mechanism in the context of semantic substrates. We illustrate this functionality in a document citation network and provide pros and cons of the approach. We conclude with guidelines and future directions for this research. Throughout the paper, examples are illustrated with NVSS 3.0, the network visualization tool developed to explore the semantic substrate idea. }, author = {Aris,A. and Shneiderman, Ben} } @conference {12548, title = {A Non-generative Approach for Face Recognition Across Aging}, booktitle = {Biometrics: Theory, Applications and Systems, 2008. BTAS 2008. 2nd IEEE International Conference on}, year = {2008}, month = {2008/10//undefin}, pages = {1 - 6}, abstract = {Human faces undergo a lot of change in appearance as they age. Though facial aging has been studied for decades, it is only recently that attempts have been made to address the problem from a computational point of view. Most of these early efforts follow a simulation approach in which matching is performed by synthesizing face images at the target age. Given the innumerable different ways in which a face can potentially age, the synthesized aged image may not be similar to the actual aged image. In this paper, we bypass the synthesis step and directly analyze the drifts of facial features with aging from a purely matching perspective. Our analysis is based on the observation that facial appearance changes in a coherent manner as people age. We provide measures to capture this coherency in feature drifts. Illustrations and experimental results show the efficacy of such an approach for matching faces across age progression.}, keywords = {appearance;nongenerative, approach;face, Face, image, matching;, recognition;facial, recognition;image, synthesis;face}, doi = {10.1109/BTAS.2008.4699331}, author = {Biswas,S. and Aggarwal,G. and Ramanathan,N. and Chellapa, Rama} } @article {17547, title = {A note on the distribution of the number of prime factors of the integers}, journal = {Information Processing Letters}, volume = {109}, year = {2008}, month = {2008/12/31/}, pages = {133 - 135}, abstract = {The Chernoff{\textendash}Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors of a random integer in { 1 , 2 , {\textellipsis} , n } . The method illustrates tail bounds in negatively-correlated settings.}, keywords = {Chernoff bounds, Dependent random variables, Primes, Probabilistic number theory, randomized algorithms, Tail bounds}, isbn = {0020-0190}, doi = {10.1016/j.ipl.2008.09.010}, url = {http://www.sciencedirect.com/science/article/pii/S0020019008002688}, author = {Srinivasan, Aravind} } @book {18596, title = {NETB{\textquoteright}07: Proceedings of the 3rd USENIX international workshop on Networking meets databases}, year = {2007}, month = {2007///}, publisher = {USENIX Association}, organization = {USENIX Association}, address = {Berkeley, CA, USA}, editor = {Cooper,Brian and Feamster, Nick} } @article {12214, title = {NetLens: iterative exploration of content-actor network data}, journal = {Information Visualization}, volume = {6}, year = {2007}, month = {2007///}, pages = {18 - 31}, author = {Kang,H. and Plaisant, Catherine and Lee,B. and Bederson, Benjamin B.} } @article {16077, title = {NetLens: Iterative Exploration of Content-Actor Network Data}, journal = {Information VisualizationInformation Visualization}, volume = {6}, year = {2007}, month = {2007/03/20/}, pages = {18 - 31}, abstract = {Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper offers an abstract Content-Actor network data model, a classification of tasks, and a tool to support them. The NetLens interface was designed around the abstract Content-Actor network data model to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify. NetLens is general and scalable in that it applies to any data set that can be represented with our abstract data model. This paper describes the use of NetLens with a subset of the ACM Digital Library consisting of about 4000 papers from the CHI conference written by about 6000 authors, and reports on a usability study with nine participants.}, keywords = {content-actor network data, digital library, incremental data exploration, iterative query refinement, User interfaces}, isbn = {1473-8716, 1473-8724}, doi = {10.1057/palgrave.ivs.9500143}, url = {http://ivi.sagepub.com/content/6/1/18}, author = {Kang,Hyunmo and Plaisant, Catherine and Lee,Bongshin and Bederson, Benjamin B.} } @article {18590, title = {Network-Wide Prediction of BGP Routes}, journal = {Networking, IEEE/ACM Transactions on}, volume = {15}, year = {2007}, month = {2007/04//}, pages = {253 - 266}, abstract = {This paper presents provably correct algorithms for computing the outcome of the BGP route-selection process for each router in a network, without simulating the complex details of BGP message passing. The algorithms require only static inputs that can be easily obtained from the routers: the BGP routes learned from neighboring domains, the import policies configured on the BGP sessions, and the internal topology. Solving the problem would be easy if the route-selection process were deterministic and every router received all candidate BGP routes. However, two important features of BGP-the Multiple Exit Discriminator (MED) attribute and route reflectors-violate these properties. After presenting a simple route-prediction algorithm for networks that do not use these features, we present algorithms that capture the effects of the MED attribute and route reflectors in isolation. Then, we explain why the interaction between these two features precludes efficient route prediction. These two features also create difficulties for the operation of BGP itself, leading us to suggest improvements to BGP that achieve the same goals as MED and route reflection without introducing the negative side effects}, keywords = {BGP message passing, BGP route-selection process, border gateway protocol, Message passing, multiple exit discriminator attribute, network-wide prediction, route reflectors, route-prediction algorithm, routing protocols, telecommunication network topology}, isbn = {1063-6692}, doi = {10.1109/TNET.2007.892876}, author = {Feamster, Nick and Rexford,J.} } @conference {16851, title = {A new database for medical images and information}, booktitle = {Proceedings of SPIE-Medical Imaging}, year = {2007}, month = {2007///}, abstract = {We present a medical image and medical record database for the storage, research,transmission, and evaluation of medical images, as well as tele-medicine applications. Any medical image from a source that supports the DICOM standard can be stored and accessed, as well as associated analysis and annotations. Information and image retrieval can be done based on patient info, date, doctor{\textquoteright}s annotations, features in the images, or a spatial combination of features. Secure access and transmission is addressed for tele- medicine applications. This database application follows all HIPAA regulations. }, author = {Tahmoush,D. and Samet, Hanan} } @article {12918, title = {New records of phytoplankton for Bangladesh. 3. Volvocales}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {14}, year = {2007}, month = {2007/12/01/}, abstract = {This study presents 21 species of Chlamydomonas, four species of Carteria, two species of each of Nephroselmis, Pyramidomonas and Scherffelia, and Collodictyon triciliatum, Polytoma minus, Tetrachloridium ? allorgei and Tetraselmis cordiformis. These species have been reported from some ponds of Mathbaria of Pirojpur and Bakerganj of Barisal districts in Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v14i1.518}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/518}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasmin,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @article {12917, title = {New records of phytoplankton for Bangladesh. 4. Chlorococcales}, journal = {Bangladesh Journal of Plant Taxonomy}, volume = {14}, year = {2007}, month = {2007/12/02/}, abstract = {This study presents three species from each of Schroederia, Monoraphidium and Ankistrodesmus, two species and one variety of Dictyosphaerium, two varieties of Pediastrum, and Tetraedron arthrodesmiforme var. contorta, Chlorotetraedron polymorphum, Myrmecia aquatica, Oocystis tainoensis, Nephrocytium spirale, Kirchneriella irregularis, Coelastrum indicum and Scenedesmus similagineus. These taxa have been reported from some ponds of Mathbaria of Pirojpur and Bakerganj of Barisal Districts in Bangladesh.}, isbn = {1028-2092}, doi = {10.3329/bjpt.v14i2.528}, url = {http://www.banglajol.info/bd/index.php/BJPT/article/viewArticle/528}, author = {Khondker,Moniruzzaman and Bhuiyan,Rauf Ahmed and Yeasim,Jenat and Alam,Munirul and Sack,R. Bradley and Huq,Anwar and Rita R Colwell} } @conference {14991, title = {New techniques for ensuring the long term integrity of digital archives}, booktitle = {Proceedings of the 8th annual international conference on Digital government research}, year = {2007}, month = {2007///}, pages = {57 - 65}, abstract = {A large portion of the government, business, cultural, andscientific digital data being created today needs to be archived and preserved for future use of periods ranging from a few years to decades and sometimes centuries. A fundamental requirement of a long term archive is to ensure the integrity of its holdings. In this paper, we develop a new methodology to address the integrity of long term archives using rigorous cryptographic techniques. Our approach involves the generation of a small-size integrity token for each digital object to be archived, and some cryptographic summary information based on all the objects handled within a dynamic time period. We present a framework that enables the continuous auditing of the holdings of the archive depending on the policy set by the archive. Moreover, an independent auditor will be able to verify the integrity of every version of an archived digital object as well as link the current version to the original form of the object when it was ingested into the archive. We built a - prototype system that is completely independent of the archive{\textquoteright}s underlying architecture, and tested it on large scale data. We include in this paper some preliminary results on the validation and performance of our prototype. }, author = {Song,S. and JaJa, Joseph F.} } @article {14074, title = {New Trypanosoma cruzi Repeated Element That Shows Site Specificity for Insertion}, journal = {Eukaryotic Cell}, volume = {6}, year = {2007}, month = {2007/07/01/}, pages = {1228 - 1238}, abstract = {A new family of site-specific repeated elements identified in Trypanosoma cruzi, which we named TcTREZO, is described here. TcTREZO appears to be a composite repeated element, since three subregions may be defined within it on the basis of sequence similarities with other T. cruzi sequences. Analysis of the distribution of TcTREZO in the genome clearly indicates that it displays site specificity for insertion. Most TcTREZO elements are flanked by conserved sequences. There is a highly conserved 68-bp sequence at the 5{\textquoteright} end of the element and a sequence domain of [~]500 bp without a well-defined borderline at the 3{\textquoteright} end. Northern blot hybridization and reverse transcriptase PCR analyses showed that TcTREZO transcripts are expressed as oligo(A)-terminated transcripts whose length corresponds to the unit size of the element (1.6 kb). Transcripts of [~]0.2 kb derived from a small part of TcTREZO are also detected in steady-state RNA. TcTREZO transcripts are unspliced and not translated. The copy number of TcTREZO sequences was estimated to be [~]173 copies per haploid genome. TcTREZO appears to have been assembled by insertions of sequences into a progenitor element. Once associated with each other, these subunits were amplified as a new transposable element. TcTREZO shows site specificity for insertion, suggesting that a sequence-specific endonuclease could be responsible for its insertion at a unique site.}, doi = {

10.1128/EC.00036-07

}, url = {http://ec.asm.org/cgi/content/abstract/6/7/1228}, author = {Souza,Renata T. and Santos,Marcia R. M. and Lima,Fabio M. and El-Sayed, Najib M. and Myler,Peter J. and Ruiz,Jeronimo C. and da Silveira,Jose Franco} } @conference {18255, title = {Noise Features for Image Tampering Detection and Steganalysis}, booktitle = {Image Processing, 2007. ICIP 2007. IEEE International Conference on}, volume = {6}, year = {2007}, month = {2007/10/16/19}, pages = {VI -97 -VI -100 - VI -97 -VI -100}, abstract = {With increasing availability of low-cost image editing softwares, the authenticity of digital images can no longer be taken for granted. Digital images have also been used as cover data for transmitting secret information in the field of steganography. In this paper, we introduce a new set of features for multimedia forensics to determine if a digital image is an authentic camera output or if it has been tampered or embedded with hidden data. We perform such image forensic analysis employing three sets of statistical noise features, including those from denoising operations, wavelet analysis, and neighborhood prediction. Our experimental results demonstrate that the proposed method can effectively distinguish digital images from their tampered or stego versions.}, keywords = {analysis;cryptography;data, analysis;image, analysis;wavelet, authenticity;hidden, computing;statistical, data;image, denoising, denoising;multimedia, detection;low-cost, editing, encapsulation;feature, extraction;image, features;steganalysis;wavelet, forensic, forensics;neighborhood, image, NOISE, operations;digital, prediction;statistical, softwares;multimedia, tampering, transforms;}, doi = {10.1109/ICIP.2007.4379530}, author = {Gou,Hongmei and Swaminathan,A. and M. Wu} } @article {18257, title = {Nonintrusive component forensics of visual sensors using output images}, journal = {Information Forensics and Security, IEEE Transactions on}, volume = {2}, year = {2007}, month = {2007/03//}, pages = {91 - 106}, abstract = {Rapid technology development and the widespread use of visual sensors have led to a number of new problems related to protecting intellectual property rights, handling patent infringements, authenticating acquisition sources, and identifying content manipulations. This paper introduces nonintrusive component forensics as a new methodology for the forensic analysis of visual sensing information, aiming to identify the algorithms and parameters employed inside various processing modules of a digital device by only using the device output data without breaking the device apart. We propose techniques to estimate the algorithms and parameters employed by important camera components, such as color filter array and color interpolation modules. The estimated interpolation coefficients provide useful features to construct an efficient camera identifier to determine the brand and model from which an image was captured. The results obtained from such component analysis are also useful to examine the similarities between the technologies employed by different camera models to identify potential infringement/licensing and to facilitate studies on technology evolution}, keywords = {ACQUISITION, array;color, authenticating, component, filter, forensics;patent, infringements;visual, Interpolation, manipulations;intellectual, modules;content, property, property;, protection;nonintrusive, rights, sensors;image, sensors;industrial, sources;color}, isbn = {1556-6013}, doi = {10.1109/TIFS.2006.890307}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @article {15392, title = {Numerical Analysis of Nanoparticle-Structured Plasmon Waveguides of Light}, journal = {Magnetics, IEEE Transactions on}, volume = {43}, year = {2007}, month = {2007/04//}, pages = {1685 - 1688}, abstract = {A novel numerical approach to the analysis of nanoparticle-structured plasmon waveguides of light is presented. The extinct cross-sections and resonance (propagation) frequencies are computed for various geometries of these waveguides and compared with available experimental data. The computational results for resonance frequencies corresponding to different light polarizations are reported as well}, keywords = {analysis;optical, analysis;resonant, cross-sections;light, Frequency, frequency;light, nanoparticle-structured, plasmon, polarisation;light, polarization;numerical, propagation;numerical, waveguides;light, waveguides;plasmonics;plasmons;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2006.892270}, author = {Mayergoyz, Issak D and Zhang,Zhenyu} } @article {15394, title = {Numerical Analysis of Plasmon Resonances in Metallic Nanoshells}, journal = {Magnetics, IEEE Transactions on}, volume = {43}, year = {2007}, month = {2007/04//}, pages = {1689 - 1692}, abstract = {A novel boundary integral equation-based technique for the direct computations of resonance frequencies for plasmon resonances in metallic nanoshells is presented. In this technique, the calculation of resonance frequencies is reduced to a generalized eigenvalue problem. Numerical results that demonstrate fairly good agreement with theoretical results and available experimental data are reported}, keywords = {analysis;plasmon, and, boundary, eigenfunctions;nanostructured, equation-based, equations;eigenvalues, frequency;boundary, integral, materials;nanotechnology;plasmons;, nanoshells;numerical, problems;metallic, resonance;resonant, techniques;eigenvalue}, isbn = {0018-9464}, doi = {10.1109/TMAG.2006.892271}, author = {Mayergoyz, Issak D and Zhang,Zhenyu} } @article {13993, title = {Numerical Analysis of Plasmon Resonances in Nanoparticles Based on Fast Multipole Method}, journal = {Magnetics, IEEE Transactions on}, volume = {43}, year = {2007}, month = {2007/04//}, pages = {1465 - 1468}, abstract = {A novel technique for the numerical analysis of plasmon resonances by using the fast multipole method (FMM) is presented. This approach is based on the solution of the eigenvalue problem for boundary integral equations, which can be naturally implemented by using the FMM. Numerical examples that highlight the efficiency of the fast multipole implementation are reported}, keywords = {analysis;boundary, and, boundary, eigenfunctions;nanoparticles;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;nanoparticle, multipole, plasmon, problems;fast, resonance;numerical}, isbn = {0018-9464}, doi = {10.1109/TMAG.2007.891413}, author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani} } @article {14483, title = {Name reference resolution in organizational email archives}, journal = {SIAM International Conference on Data Mining}, year = {2006}, month = {2006///}, pages = {20 - 22}, author = {Diehl,C. P and Getoor, Lise and Namata,G.} } @article {17307, title = {Network Visualization by Semantic Substrates}, journal = {IEEE Transactions on Visualization and Computer Graphics}, volume = {12}, year = {2006}, month = {2006/10//Sept}, pages = {733 - 740}, abstract = {Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on user-defined semantic substrates, which are non-overlapping regions in which node placement is based on node attributes, (2) users interactively adjust sliders to control link visibility to limit clutter and thus ensure comprehensibility of source and destination. Scalability is further facilitated by user control of which nodes are visible. We illustrate our semantic substrates approach as implemented in NVSS 1.0 with legal precedent data for up to 1122 court cases in three regions with 7645 legal citations}, keywords = {Automatic control, data visualisation, Data visualization, Displays, Filters, Graphical user interfaces, Information Visualization, information visualization designers, Law, legal citations, Legal factors, legal precedent data, network visualization, NVSS 1.0, scalability, semantic substrate, Terminology, Tunneling, user-defined semantic substrates}, isbn = {1077-2626}, doi = {10.1109/TVCG.2006.166}, author = {Shneiderman, Ben and Aris,A.} } @conference {15344, title = {New DNS results of shockwave/turbulent boundary layer interaction}, booktitle = {3rd AIAA Flow Control Conference}, year = {2006}, month = {2006///}, author = {Wu,M. and Martin, M.P} } @article {14799, title = {A New Hardware Monitor Design to Measure Data Structure-Specific Cache Eviction Information}, journal = {International Journal of High Performance Computing Applications}, volume = {20}, year = {2006}, month = {2006///}, pages = {353 - 363}, abstract = {In this paper, we propose a hardware performance monitor that provides support not only for measuring cache misses and the addresses associated with them, but also for determining what data is being evicted from the cache when a miss occurs. We describe how to use this hardware support to efficiently determine the cache behavior of application data structures at the source code level. We also present the results of a simulation-based study of this technique, in which we examined the overhead, perturbation of results, and usefulness of collecting this information.}, doi = {10.1177/1094342006067470}, url = {http://hpc.sagepub.com/content/20/3/353.abstract}, author = {Buck, B. R and Hollingsworth, Jeffrey K} } @conference {14557, title = {New lower bounds for oblivious routing in undirected graphs}, booktitle = {Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm}, year = {2006}, month = {2006///}, pages = {918 - 927}, author = {Hajiaghayi, Mohammad T. and Kleinberg,R. D and Leighton,T. and R\{\"a}cke,H.} } @article {14237, title = {Noise causes slant underestimation in stereo and motion}, journal = {Vision Research}, volume = {46}, year = {2006}, month = {2006/10//}, pages = {3105 - 3120}, abstract = {This paper discusses a problem, which is inherent in the estimation of 3D shape (surface normals) from multiple views. Noise in the image signal causes bias, which may result in substantial errors in the parameter estimation. The bias predicts the underestimation of slant found in psychophysical and computational experiments. Specifically, we analyze the estimation of 3D shape from motion and stereo using orientation disparity. For the case of stereo, we show that bias predicts the anisotropy in the perception of horizontal and vertical slant. For the case of 3D motion we demonstrate the bias by means of a new illusory display. Finally, we discuss statistically optimal strategies for the problem and suggest possible avenues for visual systems to deal with the bias.}, keywords = {Bias, Partial bias correction, shape estimation, Shape from motion, Stereo orientation disparity}, isbn = {0042-6989}, doi = {10.1016/j.visres.2006.04.010}, url = {http://www.sciencedirect.com/science/article/pii/S0042698906002124}, author = {Hui Ji and Ferm{\"u}ller, Cornelia} } @conference {18256, title = {Non-Intrusive Forensic Analysis of Visual Sensors Using Output Images}, booktitle = {Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on}, volume = {5}, year = {2006}, month = {2006/05//}, pages = {V - V}, abstract = {This paper considers the problem of non-intrusive forensic analysis of the individual components in visual sensors and its implementation. As a new addition to the emerging area of forensic engineering, we present a framework for analyzing technologies employed inside digital cameras based on output images, and develop a set of forensic signal processing algorithms for visual sensors based on color array sensor and interpolation methods. We show through simulations that the proposed method is robust against compression and noise, and can help identify various processing components inside the camera. Such a non-intrusive forensic framework would provide useful evidence for analyzing technology infringement and evolution for visual sensors}, keywords = {algorithms;interpolation, analysis;image, analysis;output, array, cameras;forensic, Color, colour, engineering;forensic, forensic, images;visual, methods;nonintrusive, PROCESSING, sensor;digital, sensors;cameras;image, sensors;interpolation;, signal}, doi = {10.1109/ICASSP.2006.1661297}, author = {Swaminathan,A. and M. Wu and Liu,K. J.R} } @article {17677, title = {A note on generalized and hypergeneralized projectors}, journal = {Linear Algebra and its Applications}, volume = {412}, year = {2006}, month = {2006/01/15/}, pages = {408 - 411}, abstract = {Gro{\ss} and Trenkler [Generalized and hypergeneralized projectors, Linear Algebra Appl. 264 (1997) 463{\textendash}474] have introduced two generalizations of orthogonal projectors called generalized projectors and hypergeneralized projectors. In this note we characterize these generalizations by their spectral decompositions.}, keywords = {Generalized projection, projection, Spectral decomposition}, isbn = {0024-3795}, doi = {10.1016/j.laa.2005.07.022}, url = {http://www.sciencedirect.com/science/article/pii/S0024379505003836}, author = {Stewart, G.W.} } @article {14933, title = {A Novel Information-Aware Octree for the Visualization of Large Scale Time-Varying Data}, volume = {UMIACS-TR-2006-03}, year = {2006}, month = {2006/04/20/T16:3}, institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park}, abstract = {Large scale scientific simulations are increasingly generatingvery large data sets that present substantial challenges to current visualization systems. In this paper, we develop a new scalable and efficient scheme for the visual exploration of 4-D isosurfaces of time varying data by rendering the 3-D isosurfaces obtained through an arbitrary axis-parallel hyperplane cut. The new scheme is based on: (i) a new 4-D hierarchical indexing structure, called Information-Aware Octree; (ii) a controllable delayed fetching technique; and (iii) an optimized data layout. Together, these techniques enable efficient and scalable out-of-core visualization of large scale time varying data sets. We introduce an entropy-based dimension integration technique by which the relative resolutions of the spatial and temporal dimensions are established, and use this information to design a compact size 4-D hierarchical indexing structure. We also present scalable and efficient techniques for out-of-core rendering. Compared with previous algorithms for constructing 4-D isosurfaces, our scheme is substantially faster and requires much less memory. Compared to the Temporal Branch-On-Need octree (T-BON), which can only handle a subset of our queries, our indexing structure is an order of magnitude smaller and is at least as effective in dealing with the queries that the T-BON can handle. We have tested our scheme on two large time-varying data sets and obtained very good performance for a wide range of isosurface extraction queries using an order of magnitude smaller indexing structures than previous techniques. In particular, we can generate isosurfaces at intermediate time steps very quickly. }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/3335}, author = {Kim,Jusub and JaJa, Joseph F.} } @article {14993, title = {NSF Workshop Storage Resource Broker Data Grid Preservation Assessment}, volume = {TR-2006.3}, year = {2006}, month = {2006///}, institution = {San Diego Supercomputer Center}, author = {JaJa, Joseph F.} } @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 {14010, title = {Numerical Analysis of Plasmon Resonances Based on Fast Multipole Method}, booktitle = {Electromagnetic Field Computation, 2006 12th Biennial IEEE Conference on}, year = {2006}, month = {2006///}, pages = {459 - 459}, abstract = {A novel technique for the numerical analysis of plasmon resonances by using fast multipole method (FMM) is presented. This approach is based on the solution of eigenvalue problem for boundary integral equations, which can be naturally implemented by using the fast multipole method. Numerical examples that highlight the efficiency of the fast multipole implementation are reported}, keywords = {analysis;plasmon, and, boundary, eigenfunctions;plasmons;, equations;eigenvalue, equations;eigenvalues, integral, method;numerical, multipole, problem;fast, resonances;boundary}, doi = {10.1109/CEFC-06.2006.1633249}, author = {Zhang,Zhenyu and Mayergoyz, Issak D and Gumerov, Nail A. and Duraiswami, Ramani} } @article {15395, title = {Numerical analysis of plasmon resonances in nanoparticles}, journal = {Magnetics, IEEE Transactions on}, volume = {42}, year = {2006}, month = {2006/04//}, pages = {759 - 762}, abstract = {Plasmon (electrostatic) resonances in nanoparticles are treated as an eigenvalue problem for a specific boundary integral equation. This leads to direct calculation of resonance values of permittivity and resonance frequency. The numerical technique is illustrated by examples of calculation of resonance frequencies for three-dimensional nanoparticles}, keywords = {3D, analysis;plasmon, and, boundary, eigenfunctions;electrostatics;nanoparticles;permittivity;surface, equation;boundary, equations;eigenvalues, integral, nanoparticles;eigenvalue, plasmon, problem;numerical, resonance;, resonances;specific}, isbn = {0018-9464}, doi = {10.1109/TMAG.2006.870976}, author = {Mayergoyz, Issak D and Zhang,Zhenyu} } @article {14004, title = {Numerical computation of the Green?s function for two-dimensional finite-size photonic crystals of infinite length}, journal = {Optics ExpressOpt. Express}, volume = {14}, year = {2006}, month = {2006/11/13/}, pages = {11362 - 11371}, abstract = {We develop a numerical algorithm that computes the Green{\textquoteright}s function of Maxwell equation for a 2D finite-size photonic crystal, composed of rods of arbitrary shape. The method is based on the boundary integral equation, and a Nystr{\"o}m discretization is used for the numerical solution. To provide an exact solution that validates our code we derive multipole expansions for circular cylinders using our integral equation approach. The numerical method performs very well on the test case. We then apply it to crystals of arbitrary shape and discuss the convergence.}, keywords = {Diffraction and gratings, Multiple scattering}, doi = {10.1364/OE.14.011362}, url = {http://www.opticsexpress.org/abstract.cfm?URI=oe-14-23-11362}, author = {Seydou,F. and Ramahi,Omar M. and Duraiswami, Ramani and Sepp{\"a}nen,T.} } @conference {13835, title = {NeurAlign: combining word alignments using neural networks}, booktitle = {Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing}, series = {HLT {\textquoteright}05}, year = {2005}, month = {2005///}, pages = {65 - 72}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper presents a novel approach to combining different word alignments. We view word alignment as a pattern classification problem, where alignment combination is treated as a classifier ensemble, and alignment links are adorned with linguistic features. A neural network model is used to learn word alignments from the individual alignment systems. We show that our alignment combination approach yields a significant 20--34\% relative error reduction over the best-known alignment combination technique on English-Spanish and English-Chinese data.}, doi = {10.3115/1220575.1220584}, url = {http://dx.doi.org/10.3115/1220575.1220584}, author = {Ayan,Necip Fazil and Dorr, Bonnie J and Monz,Christof} } @article {14027, title = {Neuromimetic sound representation for percept detection and manipulation}, journal = {EURASIP Journal on Applied Signal Processing}, volume = {9}, year = {2005}, month = {2005///}, pages = {1350 - 1350}, abstract = {The acoustic wave received at the ears is processed by the human auditory system to separate different sounds along the intensity,pitch, and timbre dimensions. Conventional Fourier-based signal processing, while endowed with fast algorithms, is unable to easily represent a signal along these attributes. In this paper, we discuss the creation of maximally separable sounds in auditory user interfaces and use a recently proposed cortical sound representation, which performs a biomimetic decomposition of an acoustic signal, to represent and manipulate sound for this purpose. We briefly overview algorithms for obtaining, manipulating, and inverting a cortical representation of a sound and describe algorithms for manipulating signal pitch and timbre separately. The algorithms are also used to create sound of an instrument between a {\textquotedblleft}guitar{\textquotedblright} and a {\textquotedblleft}trumpet.{\textquotedblright} Excellent sound quality can be achieved if processing time is not a concern, and intelligible signals can be reconstructed in reasonable processing time (about ten seconds of computational time for a one-second signal sampled at 8 kHz). Work on bringing the algorithms into the real-time processing domain is ongoing. }, author = {Zotkin,Dmitry N and Chi,T. and Shamma,S.A. and Duraiswami, Ramani} } @conference {15600, title = {A new approach to image fusion based on cokriging}, booktitle = {Information Fusion, 2005 8th International Conference on}, volume = {1}, year = {2005}, month = {2005/07//}, pages = {8 pp. - 8 pp.}, abstract = {We consider the image fusion problem involving remotely sensed data. We introduce cokriging as a method to perform fusion. We investigate the advantages of fusing Hyperion with ALI. This evaluation is performed by comparing the classification of the fused data with that of input images and by calculating well-chosen quantitative fusion quality metrics. We consider the invasive species forecasting system (ISFS) project as our fusion application. The fusion of ALI with Hyperion data is studied using PCA and wavelet-based fusion. We then propose utilizing a geostatistical based interpolation method called cokriging as a new approach for image fusion.}, keywords = {ALI;, analysis;, based, cokriging;, component, data;, forecasting, fusion, fusion;, geophysical, geostatistical, Hyperion, image, Interpolation, interpolation;, invasive, ISFS, method;, metrics;, PCA;, principal, processing;, project;, QUALITY, quantitative, remote, remotely, sensed, sensing;, sensor, sensors;, signal, species, system;, techniques;, transforms;, wavelet, wavelet-based}, doi = {10.1109/ICIF.2005.1591912}, author = {Memarsadeghi,N. and Le Moigne,J. and Mount, Dave and Morisette,J.} } @article {15329, title = {New experimental data of STBLI at DNS/LES accessible Reynolds numbers}, journal = {AIAA paper}, volume = {309}, year = {2005}, month = {2005///}, pages = {2005 - 2005}, author = {Bookey,P. and Wyckham,C. and Smits,A. J. and Martin, M.P} } @article {14932, title = {A new framework for addressing temporal range queries and some preliminary results}, journal = {Theoretical Computer Science}, volume = {332}, year = {2005}, month = {2005/02/28/}, pages = {109 - 121}, abstract = {Given a set of n objects, each characterized by d attributes specified at m fixed time instances, we are interested in the problem of designing space efficient indexing structures such that a class of temporal range search queries can be handled efficiently. When m = 1 , our problem reduces to the d-dimensional orthogonal search problem. We establish efficient data structures to handle several classes of the general problem. Our results include a linear size data structure that enables a query time of O ( log n log m + f ) for one-sided queries when d = 1 , where f is the number of objects satisfying the query. A similar result is shown for counting queries. We also show that the most general problem can be solved with a polylogarithmic query time using superlinear space data structures.}, keywords = {algorithms, Data structures, Orthogonal range search, temporal data}, isbn = {0304-3975}, doi = {10.1016/j.tcs.2004.10.013}, url = {http://www.sciencedirect.com/science/article/pii/S0304397504007005}, author = {Shi,Qingmin and JaJa, Joseph F.} } @article {14903, title = {Non-negative lighting and specular object recognition}, journal = {Proc. of IEEE International Conference on Computer Vision}, volume = {2}, year = {2005}, month = {2005///}, author = {Jacobs, David W. and Shirdhonkar,S.} } @conference {14861, title = {Non-negative lighting and specular object recognition}, booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on}, volume = {2}, year = {2005}, month = {2005/10//}, pages = {1323 -1330 Vol. 2 - 1323 -1330 Vol. 2}, abstract = {Recognition of specular objects is particularly difficult because their appearance is much more sensitive to lighting changes than that of Lambertian objects. We consider an approach in which we use a 3D model to deduce the lighting that best matches the model to the image. In this case, an important constraint is that incident lighting should be non-negative everywhere. In this paper, we propose a new method to enforce this constraint and explore its usefulness in specular object recognition, using the spherical harmonic representation of lighting. The method follows from a novel extension of Szego{\textquoteright}s eigenvalue distribution theorem to spherical harmonics, and uses semidefinite programming to perform a constrained optimization. The new method is faster as well as more accurate than previous methods. Experiments on both synthetic and real data indicate that the constraint can improve recognition of specular objects by better separating the correct and incorrect models}, keywords = {and, distribution, eigenfunctions;image, eigenvalue, harmonic, Lambertian, lighting;nonnegative, lighting;semidefinite, matching;object, object, objects;Szego, optimization;incident, programming;specular, recognition;optimisation;, recognition;spherical, representation;eigenvalues, theorem;constrained}, doi = {10.1109/ICCV.2005.168}, author = {Shirdhonkar,S. and Jacobs, David W.} } @conference {12644, title = {Non-Stationary "Shape Activities"}, booktitle = {Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC {\textquoteright}05. 44th IEEE Conference on}, year = {2005}, month = {2005/12//}, pages = {1521 - 1528}, abstract = {The changing configuration of a group of moving landmarks can be modeled as a moving and deforming shape. The landmarks defining the shape could be moving objects(people/vehicles/robots) or rigid components of an articulated shape like the human body. In past work, the term "shape activity" has been used to denote a particular stochastic model for shape deformation. Dynamical models have been proposed for characterizing stationary shape activities (assume constant mean shape). In this work we define stochastic dynamic models for non-stationary shape activities and show that the stationary shape activity model follows as a special case of this. Most activities performed by a group of moving landmarks (here, objects) are not stationary and hence this more general model is needed. We also define a piecewise stationary model with non-stationary transitions which can be used to segment out and track a sequence of activities. Noisy observations coming from these models can be tracked using a particle filter. We discuss applications of our framework to abnormal activity detection, tracking and activity sequence segmentation.}, doi = {10.1109/CDC.2005.1582374}, author = {Vaswani, N. and Chellapa, Rama} } @article {14992, title = {Novel transformation techniques using q-heaps with applications to computational geometry}, journal = {SIAM Journal on Computing}, volume = {34}, year = {2005}, month = {2005///}, pages = {1474 - 1492}, abstract = {Using the notions of Q-heaps and fusion trees developed by Fredman and Willard,we develop general transformation techniques to reduce a number of computational geometry prob- lems to their special versions in partially ranked spaces. In particular, we develop a fast fractional cascading technique, which uses linear space and enables sublogarithmic iterative search on catalog trees in the case when the degree of each node is bounded by O(log∈ n), for some constant ϵ > 0, where n is the total size of all the lists stored in the tree. We apply the fast fractional cascading tech- nique in combination with the other techniques to derive the first linear-space sublogarithmic time algorithms for the two fundamental geometric retrieval problems: orthogonal segment intersection and rectangular point enclosure. }, author = {Shi,Q. and JaJa, Joseph F.} } @conference {18729, title = {New directions in design for manufacturing}, year = {2004}, month = {2004///}, pages = {1 - 9}, abstract = {This paper gives an overview of research that is expandingthe domain of design for manufacturing (DFM) into new and important areas. This paper covers DFM and concurrent engineering, DFM for conceptual design, DFM for embodiment design, DFM for detailed design, design for production, platform design for reducing time-to-market, design for system quality, design for life cycle costs, and design for environment. The paper concludes with some general guidelines that suggest how manufacturing firms can develop useful, effective DFM tools. }, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.198.8706\&rep=rep1\&type=pdf}, author = {Herrmann,J.W. and Cooper,J. and Gupta,S.K. and Hayes,C. C. and Ishii,K. and Kazmer,D. and Sandborn,P. A. and Wood,W. H.} } @article {12149, title = {New year{\textquoteright}s resolutions for software quality}, journal = {IEEE Software}, volume = {21}, year = {2004}, month = {2004///}, pages = {12 - 13}, abstract = {In the spirit of making resolutions for betterment in the New Year, ten distinguished individuals in the software quality field offer their recommendations on how organizations can improve software quality In the spirit of making resolutions for betterment in the New Year, ten distinguished individuals in the software quality field offer their recommendations on how organizations can improve software quality.}, author = {Basili, Victor R. and Boehm,B. and Davis,A. and Humphrey,W. S and Leveson,N. and Mead,N. R and Musa,J. D and Parnas,D. L and Pfleeger,S. L and Weyuker,E.} } @article {14590, title = {A Note on Efficient Computation of Haplotypes via Perfect Phylogeny}, journal = {Journal of Computational Biology}, volume = {11}, year = {2004}, month = {2004/10//}, pages = {858 - 866}, abstract = {The problem of inferring haplotype phase from a population of genotypes has received a lot of attention recently. This is partly due to the observation that there are many regions on human genomic DNA where genetic recombination is rare (Helmuth, 2001; Daly et al., 2001; Stephens et al., 2001; Friss et al., 2001). A Haplotype Map project has been announced by NIH to identify and characterize populations in terms of these haplotypes. Recently, Gusfield introduced the perfect phylogeny haplotyping problem, as an algorithmic implication of the no-recombination in long blocks observation, together with the standard population-genetic assumption of infinite sites. Gusfield{\textquoteright}s solution based on matroid theory was followed by direct θ(nm2 ) solutions that use simpler techniques (Bafna et al., 2003; Eskin et al., 2003), and also bound the number of solutions to the PPH problem. In this short note, we address two questions that were left open. First, can the algorithms of Bafna et al. (2003) and Eskin et al. (2003) be sped-up to O(nm + m2 ) time, which would imply an O(nm) time-bound for the PPH problem? Second, if there are multiple solutions, can we find one that is most parsimonious in terms of the number of distinct haplotypes.We give reductions that suggests that the answer to both questions is "no." For the first problem, we show that computing the output of the first step (in either method) is equivalent to Boolean matrix multiplication. Therefore, the best bound we can presently achieve is O(nmω{\textendash}1), where ω <= 2.52 is the exponent of matrix multiplication. Thus, any linear time solution to the PPH problem likely requires a different approach. For the second problem of computing a PPH solution that minimizes the number of distinct haplotypes, we show that the problem is NP-hard using a reduction from Vertex Cover (Garey and Johnson, 1979).}, isbn = {1066-5277, 1557-8666}, doi = {10.1089/cmb.2004.11.858}, url = {http://www.liebertonline.com/doi/abs/10.1089/cmb.2004.11.858}, author = {Bafna,Vineet and Gusfield,Dan and Hannenhalli, Sridhar and Yooseph,Shibu} } @article {15372, title = {A novel approach to removing intersymbol interference from spin-stand images}, journal = {Magnetics, IEEE Transactions on}, volume = {40}, year = {2004}, month = {2004/07//}, pages = {2197 - 2199}, abstract = {A novel intersymbol interference (ISI) removal technique based on the "response function" characterization of giant-magnetoresistive heads is presented. It is demonstrated that the ISI-free readback image that corresponds to the actual underlying magnetization patterns can be extracted from the ISI-distorted readback signal through deconvolution. A new image deconvolution algorithm has been implemented, and it has been shown that it effectively removes the ISI distortions.}, keywords = {algorithm;, characterization;, Deconvolution, function, function;, giant, giant-magnetoresistive, Head, heads;, image, image;, imaging;, Interference, interference;, intersymbol, ISI-distorted, ISI-free, magnetic, magnetization, magnetoresistance;, patterns;, readback, removal;, response, signal;, spin-stand, suppression;}, isbn = {0018-9464}, doi = {10.1109/TMAG.2004.830153}, author = {Mayergoyz, Issak D and Tse,C. and Krafft,C. and McAvoy,P.} } @conference {13031, title = {Np bracketing by maximum entropy tagging and SVM reranking}, booktitle = {Proceedings of EMNLP}, volume = {4}, year = {2004}, month = {2004///}, author = {Daum{\'e}, Hal and Marcu,D.} } @inbook {16147, title = {Navigation Patterns and Usability of Zoomable User Interfaces With and Without an Overview}, booktitle = {The craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {120 - 120}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {978-1-55860-915-0}, author = {Bederson, Benjamin B. and Plaisant, Catherine} } @article {16127, title = {Navigation patterns \& usability of zoomable user interfaces: with and without an overview}, journal = {interactions}, volume = {10}, year = {2003}, month = {2003/01//}, pages = {11 - 12}, abstract = {The following abstracts are from recent issues and the forthcoming issue of ACM{\textquoteright}s Transactions of Computer Human Interaction (ToCHI). They are included here to alert interactions{\textquoteright} readers to what research is being done in the field of Computer Human Interaction. The complete papers, when published, can be found in ACM{\textquoteright}s Digital Library at www.acm.org/pubs/contents/journals/tochi/}, isbn = {1072-5520}, doi = {10.1145/604575.604582}, url = {http://doi.acm.org/10.1145/604575.604582}, author = {Hornbaek,Kasper and Bederson, Benjamin B. and Plaisant, Catherine} } @article {13007, title = {Necessity is the mother of invention: a simple grid computing system using commodity tools}, journal = {J Parallel Distr Com}, volume = {63}, year = {2003}, month = {2003/05//}, pages = {578 - 589}, abstract = {Access to sufficient resources is a barrier to scientific progress for many researchers facing large computational problems. Gaining access to large-scale resources (i.e., university-wide or federally supported computer centers) can be difficult, given their limited availability, particular architectures, and request/review/approval cycles. Simultaneously, researchers often find themselves with access to workstations and older clusters overlooked by their owners in favor of newer hardware. Software to tie these resources into a coherent Grid, however, has been problematic. Here, we describe our experiences building a Grid computing system to conduct a large-scale simulation study using "borrowed" computing resources distributed over a wide area. Using standard software components, we have produced a Grid computing system capable of coupling several hundred processors spanning multiple continents and administrative domains. We believe that this system fills an important niche between a closely coupled local system and a heavyweight, highly customized wide area system. (C) 2003 Elsevier Science (USA). All rights reserved.}, keywords = {Apache;, computing;, distributed, Grid, HTTP;, Java;, Linux;, Perl;, SQL;, Unix;, XML-RPC}, doi = {DOI 10.1016/S0743-7315(03)00004-2}, author = {Myers,D. S and Cummings, Michael P.} } @conference {16137, title = {New approaches to help users get started with visual interfaces: multi-layered interfaces and integrated initial guidance}, booktitle = {Proceedings of the 2003 annual national conference on Digital government research}, series = {dg.o {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {1 - 6}, publisher = {Digital Government Society of North America}, organization = {Digital Government Society of North America}, abstract = {We are investigating new ways to help users learn to use public access interactive tools, in particular for the visual exploration of government statistics. Our work led to a series of interfaces using multi-layered design and a new help method called Integrated Initial Guidance. Multi-layer designs structure an interface so that a simpler interface is available for users to get started and more complex features are accessed as users move through the more advanced layers. Integrated Initial Guidance provides help within the working interface, right at the start of the application. Using the metaphor of "sticky notes" overlaid on top of the functional interface locates the main widgets, demonstrates their manipulation, and explains the resulting actions using preset animation of the interface. Usability testing with 12 participants led to refined designs and guidelines for the design of Integrated Initial Guidance interfaces.}, url = {http://dl.acm.org/citation.cfm?id=1123196.1123269}, author = {Kang,Hyunmo and Plaisant, Catherine and Shneiderman, Ben} } @conference {14235, title = {New eyes for robotics}, booktitle = {2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings}, volume = {1}, year = {2003}, month = {2003/10/27/31}, pages = {1018- 1023 vol.1 - 1018- 1023 vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {This paper describes an imaging system that has been designed to facilitate robotic tasks of motion. The system consists of a number of 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. Pairs of cameras may also be arranged in multiple stereo configurations which provide additional advantages for segmentation. Algorithms for the calibration of the system and the 3D motion estimation are provided.}, keywords = {3D motion estimation, Argus eye, array signal processing, Birds, Calibration, CAMERAS, Control systems, Eyes, geometric configuration, imaging, imaging system, Layout, Motion estimation, multiple stereo configurations, Robot kinematics, robot vision, Robot vision systems, ROBOTICS, Robotics and automation, SHAPE, shape models}, isbn = {0-7803-7860-1}, doi = {10.1109/IROS.2003.1250761}, author = {Baker, P. and Ogale, A. S and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @conference {18258, title = {Nonlinear collusion attacks on independent fingerprints for multimedia}, booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on}, volume = {5}, year = {2003}, month = {2003/04//}, pages = {V - 664-7 vol.5 - V - 664-7 vol.5}, abstract = {Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Collusion attack is a cost effective attack against digital fingerprinting where several copies with the same content but different fingerprints are combined to remove the original fingerprints. In this paper, we investigate average and nonlinear collusion attacks of independent Gaussian fingerprints and study both their effectiveness and the perceptual quality. We also propose the bounded Gaussian fingerprints to improve the perceptual quality of the fingerprinted copies. We further discuss the tradeoff between the robustness against collusion attacks and the perceptual quality of a fingerprinting system.}, keywords = {attacks;, average, bounded, collusion, computing;, content, copies;, digital, distribution;, fingerprinted, fingerprinting;, fingerprints;, Gaussian, independent, multimedia, nonlinear, perceptual, quality;, robustness;, watermarking;}, doi = {10.1109/ICASSP.2003.1200058}, author = {Zhao,Hong and M. Wu and Wang,Z.J. and Liu,K. J.R} } @conference {11905, title = {Non-parametric expectation maximization: a learning automata approach}, booktitle = {IEEE International Conference on Systems, Man and Cybernetics, 2003}, volume = {3}, year = {2003}, month = {2003/10//}, pages = {2996- 3001 vol.3 - 2996- 3001 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {The famous expectation maximization technique suffers two major drawbacks. First, the number of components has to be specified apriori. Also, the expectation maximization is sensitive to initialization. In this paper, we present a new stochastic technique for estimating the mixture parameters. Parzen Window is used to estimate a discrete estimate of the PDF of the given data. Stochastic learning automata is then used to select the mixture parameters that minimize the distance between the discrete estimate of the PDF and the estimate of the expectation maximization. The validity of the proposed approach is verified using bivariate simulation data.}, keywords = {Automatic speech recognition, bivariate simulation data, Computational modeling, Computer vision, Density functional theory, expectation maximization technique, learning automata, mixture parameters estimation, nonparametric expectation maximization, nonparametric statistics, optimisation, parameter estimation, Parzen Window, PDF, probability, probability density function, Speech processing, Speech recognition, stochastic learning automata, Stochastic processes, stochastic technique}, isbn = {0-7803-7952-7}, doi = {10.1109/ICSMC.2003.1244347}, author = {Abd-Almageed, Wael and El-Osery,A. and Smith,C.E.} } @article {16152, title = {Navigation patterns and usability of zoomable user interfaces with and without an overview}, journal = {ACM Transactions on Computer-Human Interaction (TOCHI)}, volume = {9}, year = {2002}, month = {2002///}, pages = {362 - 389}, author = {Hornbaek,K. and Bederson, Benjamin B. and Plaisant, Catherine} } @article {18495, title = {Network-wide BGP route prediction for traffic engineering}, journal = {Proceedings of ITCOM}, year = {2002}, month = {2002///}, abstract = {The Internet consists of about 13,000 Autonomous Systems (AS{\textquoteright}s) that exchange routing information using the BorderGateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS{\textquoteright}s. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers. Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS{\textquoteright}s. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT\&T{\textquoteright}s commercial IP network. Our route prediction techniques help support the operation of large IP backbone networks, where interdomain routing is an important aspect of traffic engineering. }, author = {Feamster, Nick and Rexford,J.} } @article {14090, title = {A new, expressed multigene family containing a hot spot for insertion of retroelements is associated with polymorphic subtelomeric regions of Trypanosoma brucei}, journal = {Eukaryotic cell}, volume = {1}, year = {2002}, month = {2002///}, pages = {137 - 137}, author = {Bringaud,F. and Biteau,N. and Melville,S. E. and Hez,S. and El-Sayed, Najib M. and Leech,V. and Berriman,M. and Hall,N. and Donelson,J. E and Baltz,T.} } @conference {13061, title = {A noisy-channel model for document compression}, booktitle = {Proceedings of the 40th Annual Meeting on Association for Computational Linguistics}, series = {ACL {\textquoteright}02}, year = {2002}, month = {2002///}, pages = {449 - 456}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {We present a document compression system that uses a hierarchical noisy-channel model of text production. Our compression system first automatically derives the syntactic structure of each sentence and the overall discourse structure of the text given as input. The system then uses a statistical hierarchical model of text production in order to drop non-important syntactic and discourse constituents so as to generate coherent, grammatical document compressions of arbitrary length. The system outperforms both a baseline and a sentence-based compression system that operates by simplifying sequentially all sentences in a text. Our results support the claim that discourse knowledge plays an important role in document summarization.}, doi = {10.3115/1073083.1073159}, url = {http://dx.doi.org/10.3115/1073083.1073159}, author = {Daum{\'e}, Hal and Marcu,Daniel} } @conference {11901, title = {A non-intrusive Kalman filter-based tracker for pursuit eye movement}, booktitle = {American Control Conference, 2002. Proceedings of the 2002}, volume = {2}, year = {2002}, month = {2002///}, pages = {1443- 1447 vol.2 - 1443- 1447 vol.2}, publisher = {IEEE}, organization = {IEEE}, abstract = {In this paper, we introduce a new non-intrusive approach to estimating the eye position during pursuit motion of the eye. We introduce a new characterization for the pursuit eye movement. Our characterization is based on the decomposition of the pursuit eye motion into a deterministic component and random component. We use a discrete Kalman filter to estimate the random component and calculate the deterministic component. We add the two components to obtain an estimate of the eye position. Simulation results are provided to illustrate the eye position estimation.}, keywords = {Application software, characterization, Computer vision, Current measurement, deterministic component, Electric variables measurement, eye position estimation, eye tracking, gaze tracking, Human computer interaction, Kalman filter, Kalman filters, Lenses, Motion estimation, Optical reflection, pursuit eye movement, pursuit motion, random component, Skin, tracking}, isbn = {0-7803-7298-0}, doi = {10.1109/ACC.2002.1023224}, url = {http://ieeexplore.ieee.org/ielx5/7965/22015/01023224.pdf?tp=\&arnumber=1023224\&isnumber=22015}, author = {Abd-Almageed, Wael and Fadali,M. S and Bebis,G.} } @article {18259, title = {Nonlinear collusion attacks on independent multimedia fingerprints}, journal = {submitted to IEEE Trans. on Image Proc}, year = {2002}, month = {2002///}, author = {Zhao,H. and Wu,M. and Wang,Z.J. and Liu,K. J.R} } @conference {13319, title = {Non-manifold decomposition in arbitrary dimensions}, booktitle = {Discrete Geometry for Computer Imagery}, year = {2002}, month = {2002///}, pages = {59 - 115}, abstract = {In this paper we consider the problem of decomposing a nonmanifold n-dimensional object described by an abstract simplicial complex into an assembly of {\textquoteleft}more-regular{\textquoteright} components. Manifolds, which would be natural candidates for components, cannot be used to this aim in high dimensions because they are not decidable sets. Therefore, we define d-quasi-manifolds, a decidable superset of the class of combinatorial d-manifolds that coincides with d-manifolds in dimension less or equal than two. We first introduce the notion of d-quasi-manifold complexes, then we sketch an algorithm to decompose an arbitrary complex into an assembly of quasi-manifold components abutting at non-manifold joints. This result provides a rigorous starting point for our future work, which includes designing efficient data structures for non-manifold modeling, as well as defining a notion of measure of shape complexity of such models.}, doi = {10.1007/3-540-45986-3_6}, author = {De Floriani, Leila and Mesmoudi,M. and Morando,F. and Puppo,E.} } @conference {14536, title = {Numerical study of the influence of the torso on the HRTF}, booktitle = {Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on}, volume = {2}, year = {2002}, month = {2002///}, pages = {II{\textendash}II - II{\textendash}II}, author = {Gumerov, Nail A. and Duraiswami, Ramani and Tang,Z.} } @article {17628, title = {Near-optimal design of MP S tunnels with shared recovery}, journal = {DIMACS Mini-Workshop on Quality of Service Issues in the Internet}, year = {2001}, month = {2001///}, abstract = {We describe the optimization problem associ-ated with the concurrent routing of demands with guar- anteed shared recovery in case of network failures. This problem arises in routing with protection in meshes and is known to be hard. We describe the problem in the context of the efficient design of restorable MP S tunnels in optical networks. The underlying design gives rise to a stochastic optimization problem that is equivalent to a (very) large- scale linear programming (LP) problem that explicitly in- corporates the network failure scenarios. The feasible re- gion for this LP is given by combined packing and cover- ing constraints for concurrent and optimal multicommodity flows. We develop a novel -approximation procedure for this problem and demonstrate its performance for a variety of real network sizes. An attraction of our approach is that its main computation consists of routing flow along a pair of short paths and these paths are easily found. Commer- cial general-purpose LP solvers are typically unable to solve these problems once they become large enough, while our approach scales for large networks. We conclude that the proposed scheme provides guaranteed approximation to the design of restorable MP S tunnels with shared protection within realistic network settings. }, author = {Fleischer,L. and Meyerson,A. and Saniee,I. and Shepherd,FB and Srinivasan, Aravind} } @conference {17632, title = {New approaches to covering and packing problems}, booktitle = {Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {567 - 576}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, abstract = {Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic probabilistic method: showing that a certain randomized approach produces a good approximation with positive probability. This approach seems inherently sequential; by employing the method of alteration we present the first RNC and NC approximation algorithms that match the best sequential guarantees. Extending our approach, we get the first RNC and NC approximation algorithms for certain multi-criteria versions of these problems. We also present the first NC algorithms for two packing and covering problems that are not subsumed by the above result: finding large independent sets in graphs, and rounding fractional Group Steiner solutions on trees.}, isbn = {0-89871-490-7}, url = {http://dl.acm.org/citation.cfm?id=365411.365535}, author = {Srinivasan, Aravind} } @conference {15589, title = {Nearly optimal expected-case planar point location}, booktitle = {Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on}, year = {2000}, month = {2000///}, pages = {208 - 218}, abstract = {We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to compute a search structure to determine which cell of the subdivision contains a given query point, so as to minimize the expected search time. This is a generalization of the classical problem of computing an optimal binary search tree for one-dimensional keys. In the one-dimensional case it has long been known that the entropy H of the distribution is the dominant term in the lower bound on the expected-case search time, and further there exist search trees achieving expected search times of at most H+2. Prior to this work, there has been no known structure for planar point location with an expected search time better than 2H, and this result required strong assumptions on the nature of the query point distribution. Here we present a data structure whose expected search time is nearly equal to the entropy lower bound, namely H+o(H). The result holds for any polygonal subdivision in which the number of sides of each of the polygonal cells is bounded, and there are no assumptions on the query distribution within each cell. We extend these results to subdivisions with convex cells, assuming a uniform query distribution within each cell}, keywords = {computational geometry, convex cells, data structure, expected search time, nearly optimal expected-case planar point location, optimal binary search tree, planar point location, planar polygonal subdivision, polygonal cells, polygonal subdivision, probability, search problems, search structure, subdivision, trees (mathematics)}, doi = {10.1109/SFCS.2000.892108}, author = {Arya,S. and Malamatos,T. and Mount, Dave} } @article {18154, title = {A Neural Network Approach for Predicting Network Resource Requirements in Video Transmission Systems}, journal = {Proc. IEEE Pacific RIM Conference on Multimedia, Sydney, Australia}, year = {2000}, month = {2000///}, abstract = {Dynamic resource allocation is important for ensuring ef-ficient network utilization in Internet-based multimedia content delivery system. To allow accurate network traf- fic prediction in the case of video delivery, relevant infor- mation based on video contents and the short term traffic pattern has to be taken into account, while the inclusion of non-relevant features will deterioriate the prediction per- formance due to the "curse of dimensionality" problem. In this work, we propose a neural network-based predic- tion system and specifically address the determination of relevant input features for the system. Experiments have shown that the current system is capable of identifying a highly relevant subset of features for traffic prediction given a large number of video content and short-term net- work traffic descriptors. }, author = {Wong,H.S. and Wu,M. and Joyce,R.A. and Guan,L. and Kung, S.Y.} } @article {14234, title = {New eyes for building models from video}, journal = {Computational Geometry}, volume = {15}, year = {2000}, month = {2000/02//}, pages = {3 - 23}, abstract = {Models of real-world objects and actions for use in graphics, virtual and augmented reality and related fields can only be obtained through the use of visual data and particularly video. This paper examines the question of recovering shape models from video information. Given video of an object or a scene captured by a moving camera, a prerequisite for model building is to recover the three-dimensional (3D) motion of the camera which consists of a rotation and a translation at each instant. It is shown here that a spherical eye (an eye or system of eyes providing panoramic vision) is superior to a camera-type eye (an eye with restricted field of view such as a common video camera) as regards the competence of 3D motion estimation. This result is derived from a geometric/statistical analysis of all the possible computational models that can be used for estimating 3D motion from an image sequence. Regardless of the estimation procedure for a camera-type eye, the parameters of the 3D rigid motion (translation and rotation) contain errors satisfying specific geometric constraints. Thus, translation is always confused with rotation, resulting in inaccurate results. This confusion does not happen for the case of panoramic vision. Insights obtained from this study point to new ways of constructing powerful imaging devices that suit particular tasks in visualization and virtual reality better than conventional cameras, thus leading to a new camera technology. Such new eyes are constructed by putting together multiple existing video cameras in specific ways, thus obtaining eyes from eyes. For a new eye of this kind we describe an implementation for deriving models of scenes from video data, while avoiding the correspondence problem in the video sequence.}, keywords = {model building, shape reconstruction, structure from motion, video analysis}, isbn = {0925-7721}, doi = {10.1016/S0925-7721(99)00044-9}, url = {http://www.sciencedirect.com/science/article/pii/S0925772199000449}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J. and Brodsk{\'y},Tom{\'a}{\v s}} } @inbook {14236, title = {New Eyes for Shape and Motion Estimation}, booktitle = {Biologically Motivated Computer VisionBiologically Motivated Computer Vision}, series = {Lecture Notes in Computer Science}, volume = {1811}, year = {2000}, month = {2000///}, pages = {23 - 47}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Motivated by the full field of view of insect eyes and their fast and accurate estimation of egomotion, we constructed a system of cameras to take advantage of the full field of view (FOV) constraints that insects use. In this paper, we develop a new ego-motion algorithm for a rigidly mounted set of cameras undergoing arbitrary rigid motion. This egomotion algorithm combines the unambiguous components of the motion computed by each separate camera. We prove that the cyclotorsion is resistant to errors and show this empirically. We show how to calibrate the system with two novel algorithms, one using secondary cameras and one using self calibration. Given this system calibration, the new 3D motion algorithm first computes the rotation and then the 3D translation. We apply this algorithm to a camera system constructed with four rigidly mounted synchronized cameras pointing in various directions and present motion estimation results at www.cfar.umd.edu/ pbaker/argus.html.}, isbn = {978-3-540-67560-0}, url = {http://dx.doi.org/10.1007/3-540-45482-9_12}, author = {Baker,Patrick and Pless,Robert and Ferm{\"u}ller, Cornelia and Aloimonos, J.}, editor = {Lee,Seong-Whan and B{\"u}lthoff,Heinrich and Poggio,Tomaso} } @conference {14186, title = {A New Framework for Multi-camera Structure from Motion}, booktitle = {Mustererkennung 2000, 22. DAGM-Symposium}, year = {2000}, month = {2000///}, pages = {75 - 82}, author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {17676, title = {A new relative perturbation theorem for singular subspaces}, journal = {Linear Algebra and its Applications}, volume = {313}, year = {2000}, month = {2000/07/01/}, pages = {41 - 51}, abstract = {This note addresses the sensitivity of singular subspaces of a matrix under relative perturbations. It employs a new technique of separating a multiplicative perturbation D into two components: one is the distance of a scalar multiple of D to the nearest unitary matrix Q and the other is the distance of Q to the identity. Consequently, the new bounds reflect the intrinsic differences in how left and right multiplicative perturbations affect left and right singular subspaces.}, keywords = {Multiplicative perturbation, Relative gap, Relative perturbation theory, Singular subspace}, isbn = {0024-3795}, doi = {10.1016/S0024-3795(00)00074-4}, url = {http://www.sciencedirect.com/science/article/pii/S0024379500000744}, author = {Li,Ren-Cang and Stewart, G.W.} } @conference {18029, title = {A no-busy-wait balanced tree parallel algorithmic paradigm}, booktitle = {Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures}, series = {SPAA {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {147 - 155}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Suppose that a parallel algorithm can include any number of parallel threads. Each thread can proceed without ever having to busy wait to another thread. A thread can proceed till its termination, but no new threads can be formed. What kind of problems can such restrictive algorithms solve and still be competitive in the total number of operations they perform with the fastest serial algorithm for the same problem?Intrigued by this informal question, we considered one of the most elementary parallel algorithmic paradigms, that of balanced binary trees. The main contribution of this paper is a new balanced (not necessarily binary) tree no-busy-wait paradigm for parallel algorithms; applications of the basic paradigm to two problems are presented: building heaps, and executing parallel tree contraction (assuming a preparatory stage); the latter is known to be applicable to evaluating a family of general arithmetic expressions. For putting things in context, we also discuss our {\textquotedblleft}PRAM-on-chip{\textquotedblright} vision (actually a small update to it), presented at SPAA98. }, isbn = {1-58113-185-2}, doi = {10.1145/341800.341818}, url = {http://doi.acm.org/10.1145/341800.341818}, author = {Vishkin, Uzi} } @article {15396, title = {Numerical simulation of small-signal microwave performance of 4H{\textendash}SiC MESFET}, journal = {Solid-State Electronics}, volume = {44}, year = {2000}, month = {2000/07/01/}, pages = {1281 - 1287}, abstract = {Small-signal high frequency characteristics of 4H{\textendash}SiC MESFET has been studied by using two-dimensional numerical drift-diffusion model in frequency domain. Non-ideal Schottky boundary conditions have been introduced that take into account a thin interfacial layer and interface energy states. It has been demonstrated that the 10 dB/dec small-signal current gain roll-off can be attributed to the existence of high density interface states at the metal{\textendash}semiconductor interface. It has been found that as the gate length is reduced to 0.1 μm, fT and fmax may reach as high as 30 and 62 GHz, respectively.}, isbn = {0038-1101}, doi = {10.1016/S0038-1101(00)00025-3}, url = {http://www.sciencedirect.com/science/article/pii/S0038110100000253}, author = {Huang,Mingwei and Mayergoyz, Issak D and Goldsman,Neil} } @article {18862, title = {Nano-to-millimeter scale integrated systems}, journal = {Components and Packaging Technologies, IEEE Transactions on}, volume = {22}, year = {1999}, month = {1999/06//}, pages = {338 - 343}, abstract = {Over the last several years various industries have been developing nano, micro, and millimeter scale technologies, which have resulted in components ranging from quantum transistors, to widely commercialized integrated circuits, to microelectromechanical sensors. A common emphasis of these fabrication industries has been on the integration of different functions in miniaturized systems; however, the technology currently used to realize these systems is monolithic. A unique class of hybrid technology systems is Integrated nano to millimeter (In2m) systems. An In2m system typically has components spanning multiple sizes, diverse technology domains, and mixtures of electrical, mechanical, thermal, chemical, fluidic, and biological functions}, keywords = {fabrication technology, In2m, integrated nano to millimeter system, micromechanical devices, nanotechnology}, isbn = {1521-3331}, doi = {10.1109/6144.774758}, author = {Last,H.R. and Deeds,M. and Garvick,D. and Kavetsky,R. and Sandborn,P. A. and Magrab,E. B. and Gupta,S.K.} } @inbook {14712, title = {Network Programming Using PLAN}, booktitle = {Internet Programming LanguagesInternet Programming Languages}, series = {Lecture Notes in Computer Science}, volume = {1686}, year = {1999}, month = {1999///}, pages = {127 - 143}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {We present here a methodology for programming active networks in the environment defined by our new language PLAN (Packet Language for Active Networks). This environment presumes a two-level architecture consisting of: 1. active packets carrying PLAN code; and 2. downloadable, node-resident services written in more general-purpose languages. We present several examples which illustrate how these two features can be combined to implement various network functions.}, isbn = {978-3-540-66673-8}, url = {http://dx.doi.org/10.1007/3-540-47959-7_7}, author = {Hicks, Michael W. and Kakkar,Pankaj and Moore,Jonathan and Gunter,Carl and Nettles,Scott}, editor = {Bal,Henri and Belkhouche,Boumediene and Cardelli,Luca} } @conference {15687, title = {Network service selection for distributed multimedia applications}, booktitle = {Third International Conference on Computational Intelligence and Multimedia Applications, 1999. ICCIMA {\textquoteright}99. Proceedings}, year = {1999}, month = {1999///}, pages = {388 - 392}, publisher = {IEEE}, organization = {IEEE}, abstract = {An important question in the development of system support for distributed multimedia is the type of network service offered to applications. This paper compares two network service disciplines: weighted fair queueing (WFQ) and non-preemptive earliest deadline first (NEDF). We show that, for a broad class of high-bandwidth distributed multimedia applications, WFQ outperforms NEDF in terms of network throughput while still providing an application-adequate end-to-end service. This result holds despite the fact that NEDF offers applications far greater flexibility in terms of control over end-to-end delivery delay}, keywords = {Admission control, Application software, application-adequate end-to-end service, Bandwidth, Communication system traffic control, Computer science, Delay, distributed processing, end-to-end delivery delay control, flexibility, high-bandwidth distributed multimedia applications, interactive multimedia, multimedia systems, network service selection, network throughput, nonpreemptive earliest deadline first, queueing theory, Regulators, system support, telecommunication services, Throughput, Traffic control, weighted fair queueing}, isbn = {0-7695-0300-4}, doi = {10.1109/ICCIMA.1999.798561}, author = {Simon,R. and Sood,A. and Mundur, Padma} } @article {16634, title = {A neural network model of lateralization during letter identification}, journal = {Journal of Cognitive Neuroscience}, volume = {11}, year = {1999}, month = {1999///}, pages = {167 - 181}, author = {Shevtsova,N. and Reggia, James A.} } @conference {17631, title = {New algorithmic aspects of the Local Lemma with applications to routing and partitioning}, booktitle = {Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms}, series = {SODA {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {643 - 652}, publisher = {Society for Industrial and Applied Mathematics}, organization = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, isbn = {0-89871-434-6}, url = {http://dl.acm.org/citation.cfm?id=314500.314886}, author = {Leighton,Tom and Rao,Satish and Srinivasan, Aravind} } @article {14931, title = {A new deterministic parallel sorting algorithm with an experimental evaluation}, journal = {Journal of Experimental Algorithmics (JEA)}, volume = {3}, year = {1998}, month = {1998/09//}, abstract = {We introduce a new deterministic parallel sorting algorithm for distributed memory machines based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead. Moreover, unlike previous variations, our algorithm efficiently handles the presence of duplicate values without the overhead of tagging each element with a unique identifier. This algorithm was implemented in SPLIT-C and run on a variety of platforms, including the Thinking Machines CM-5, the IBM SP-2-WN, and the Cray Research T3D. We ran our code using widely different benchmarks to examine the dependence of our algorithm on the input distribution. Our experimental results illustrate the efficiency and scalability of our algorithm across different platforms. In fact, the performance compares closely to that of our random sample sort algorithm, which seems to outperform all similar algorithms known to the authors on these platforms. Together, their performance is nearly invariant over the set of input distributions, unlike previous efficient algorithms. However, unlike our randomized sorting algorithm, the performance and memory requirements of our regular sorting algorithm can be deterministically guaranteed.}, keywords = {generalized sorting, integer sorting, Parallel algorithms, parallel performance, sorting by regular sampling}, isbn = {1084-6654}, doi = {10.1145/297096.297128}, url = {http://doi.acm.org/10.1145/297096.297128}, author = {Helman,David R. and JaJa, Joseph F. and Bader,David A.} } @article {15368, title = {A New Method to Recover Vectorial Electric Fields and Current Densities from Unstructured Meshes}, journal = {VLSI DESIGN}, volume = {6}, year = {1998}, month = {1998///}, pages = {117 - 122}, abstract = {In the context of 2-D and 3-D unstructured mixed-element meshes, a new method of recover-ing vectorial fields and currents in multidimensional simulation is introduced. The new method, called the method of edge elements, directly interpolates the projections of the vec- tors on the edges of an element into its interior. The new method is compared to two other recovery methods on the basis of resolution, consistency, and implementation ease. }, author = {Kerr,D. C. and Mayergoyz, Issak D} } @article {13008, title = {Nucleotide sequence diversity at the alcohol dehydrogenase 1 locus in wild barley ({\i}t Hordeum vulgare ssp. {\i}t spontaneum): an evaluation of the background selection hypothesis}, journal = {Proc Natl Acad Sci USA}, volume = {95}, year = {1998}, month = {1998/05//}, pages = {5637 - 5642}, abstract = {The background selection hypothesis predicts a reduction in nucleotide site diversity and an excess of rare variants, owing to linkage associations with deleterious alleles. This effect is expected to be amplified in species that are predominantly self-fertilizing. To examine the predictions of the background selection hypothesis in self-fertilizing species, we sequenced 1,362 bp of adh1, a gene for alcohol dehydrogenase (Adh; alcohol:NAD+ oxidoreductase, EC 1.1.1.1), in a sample of 45 accessions of wild barley, Hordeum vulgare ssp. spontaneum, drawn from throughout the species range. The region sequenced included 786 bp of exon sequence (part of exon 4, all of exons 5-9, and part of exon 10) and 576 bp of intron sequence (all of introns 4-9). There were 19 sites polymorphic for nucleotide substitutions, 8 in introns, and 11 in exons. Of the 11 nucleotide substitutions in codons, 4 were synonymous and 7 were nonsynonymous, occurring uniquely in the sample. There was no evidence of recombination in the region studied, and the estimated effective population size (Ne) based on synonymous sites was approximately 1.8-4.2 x 10(5). Several tests reveal that the pattern of nonsynonymous substitutions departs significantly from neutral expectations. However, the data do not appear to be consistent with recovery from a population bottleneck, recent population expansion, selective sweep, or strong positive selection. Though several features of the data are consistent with background selection, the distributions of polymorphic synonymous and intron sites are not perturbed toward a significant excess of rare alleles as would be predicted by background selection.}, author = {Cummings, Michael P. and Clegg,M. T} } @conference {17936, title = {Navigating static environments using image-space simplification and morphing}, booktitle = {Proceedings of the 1997 symposium on Interactive 3D graphics}, series = {I3D {\textquoteright}97}, year = {1997}, month = {1997///}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-884-3}, doi = {10.1145/253284.253298}, url = {http://doi.acm.org/10.1145/253284.253298}, author = {Darsa,Lucia and Costa Silva,Bruno and Varshney, Amitabh} } @article {15223, title = {A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees}, journal = {Journal of Algorithms}, volume = {24}, year = {1997}, month = {1997/08//}, pages = {310 - 324}, abstract = {Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, the problem of computing a low-weight spanning tree such that the degree of each vertex is at most its specified bound is considered. In particular, modifying a given spanning treeTusingadoptionsto meet the degree constraints is considered. A novel network-flow-based algorithm for finding a good sequence of adoptions is introduced. The method yields a better performance guarantee than any previous algorithm. If the degree constraintd(v) for eachvis at least 2, the algorithm is guaranteed to find a tree whose weight is at most the weight of the given tree times 2\&$\#$xa0;-\&$\#$xa0;min{(d(v)\&$\#$xa0;-\&$\#$xa0;2)/(degT(v)\&$\#$xa0;-\&$\#$xa0;2)\&$\#$xa0;:\&$\#$xa0;degT(v)\&$\#$xa0;\>\&$\#$xa0;2}, where degT(v) is the initial degree ofv. Equally importantly, it takes this approach to the limit in the following sense: if any performance guarantee that is solely a function of the topology and edge weights of a given tree holds foranyalgorithm at all, then it also holds for the given algorithm. Examples are provided in which no lighter tree meeting the degree constraint exists. Linear-time algorithms are provided with the same worst-case performance guarantee. ChoosingTto be a minimum spanning tree yields approximation algorithms with factors less than 2 for the general problem on geometric graphs with distances induced by variousLpnorms. Finally, examples of Euclidean graphs are provided in which the ratio of the lengths of an optimal Traveling Salesman path and a minimum spanning tree can be arbitrarily close to 2.}, isbn = {0196-6774}, doi = {10.1006/jagm.1997.0862}, url = {http://www.sciencedirect.com/science/article/pii/S0196677497908622}, author = {Fekete,S{\'a}ndor P and Khuller, Samir and Klemmstein,Monika and Raghavachari,Balaji and Young,Neal} } @article {17419, title = {The next generation of graphical user interfaces: information visualization and better window management}, journal = {Displays}, volume = {17}, year = {1997}, month = {1997/05/01/}, pages = {125 - 129}, isbn = {0141-9382}, doi = {10.1016/S0141-9382(97)00005-X}, url = {http://www.sciencedirect.com/science/article/pii/S014193829700005X}, author = {Shneiderman, Ben} } @article {14106, title = {A note on conjugate gradient convergence}, journal = {Numerische Mathematik}, volume = {76}, year = {1997}, month = {1997///}, pages = {209 - 230}, author = {Naiman, A. E and Babu{\v s}ka, I. M and Elman, Howard} } @conference {12835, title = {The NCSU concurrency workbench}, booktitle = {Computer Aided Verification}, year = {1996}, month = {1996///}, pages = {394 - 397}, author = {Cleaveland, Rance and Sims,S.} } @article {16548, title = {A neural model of positive schizophrenic symptoms}, journal = {Schizophrenia Bulletin}, volume = {22}, year = {1996}, month = {1996///}, pages = {105 - 123}, author = {Ruppin,E. and Reggia, James A. and Horn,D.} } @article {16524, title = {A neural model of delusions and hallucinations in schizophrenia}, journal = {Advances in Neural Information Processing Systems}, year = {1995}, month = {1995///}, pages = {149 - 156}, author = {Ruppin,E. and Reggia, James A. and Horn,D.} } @article {16630, title = {A neural model of memory impairment in diffuse cerebral atrophy}, journal = {The British Journal of Psychiatry}, volume = {166}, year = {1995}, month = {1995///}, pages = {19 - 19}, author = {Ruppin,E. and Reggia, James A.} } @article {16210, title = {Next generation network management technology}, journal = {AIP Conference Proceedings}, volume = {325}, year = {1995}, month = {1995/01/25/}, pages = {75 - 82}, abstract = {Today{\textquoteright}s telecommunications networks are becoming increasingly large, complex, mission critical and heterogeneous in several dimensions. For example, the underlying physical transmission facilities of a given network may be {\textquoteleft}{\textquoteleft}mixed media{\textquoteright}{\textquoteright} (copper, fiber-optic, radio, and satellite); the subnetworks may be acquired from different vendors due to economic, performance, or general availability reasons; the information being transmitted over the network may be {\textquoteleft}{\textquoteleft}multimedia{\textquoteright}{\textquoteright} (video, data, voice, and images) and, finally, varying performance criteria may be imposed e.g., data transfer may require high throughput while the others, whose concern is voice communications, may require low call blocking probability. For these reasons, future telecommunications networks are expected to be highly complex in their services and operations. Due to this growing complexity and the disparity among management systems for individual sub-networks, efficient network management systems have become critical to the current and future success of telecommunications companies. This paper addresses a research and development effort which focuses on prototyping configuration management, since that is the central process of network management and all other network management functions must be built upon it. Our prototype incorporates ergonomically designed graphical user interfaces tailored to the network configuration management subsystem and to the proposed advanced object-oriented database structure. The resulting design concept follows open standards such as Open Systems Interconnection (OSI) and incorporates object oriented programming methodology to associate data with functions, permit customization, and provide an open architecture environment. {\textcopyright} 1995 American Institute of Physics}, isbn = {0094243X}, doi = {doi:10.1063/1.47255}, url = {http://proceedings.aip.org/resource/2/apcpcs/325/1/75_1?isAuthorized=no}, author = {Baras,John S and Atallah,George C and Ball,Mike and Goli,Shravan and Karne,Ramesh K and Kelley,Steve and Kumar,Harsha and Plaisant, Catherine and Roussopoulos, Nick and Schneiderman,Ben and Srinivasarao,Mulugu and Stathatos,Kosta and Teittinen,Marko and Whitefield,David} } @conference {18047, title = {A note on reducing parallel model simulations to integer sorting}, booktitle = {Parallel Processing Symposium, 1995. Proceedings., 9th International}, year = {1995}, month = {1995///}, pages = {208 - 212}, author = {Matias,E. and Vishkin, Uzi} } @article {17305, title = {Navigating in hyperspace: designing a structure-based toolbox}, journal = {Communications of the ACM}, volume = {37}, year = {1994}, month = {1994/02//}, pages = {87 - 96}, isbn = {0001-0782}, doi = {10.1145/175235.175242}, url = {http://doi.acm.org/10.1145/175235.175242}, author = {Rivlin,Ehud and Botafogo,Rodrigo and Shneiderman, Ben} } @article {16508, title = {A neural model of cortical map reorganization following a focal lesion}, journal = {Artificial Intelligence in Medicine}, volume = {6}, year = {1994}, month = {1994///}, pages = {383 - 400}, author = {Armentrout,S. L and Reggia, James A. and Weinrich,M.} } @article {16217, title = {Next Generation Network Management Technology}, year = {1994}, month = {1994///}, abstract = {Today{\textquoteright}s telecommunications networks are becoming increasingly large, complex, mission critical and heterogeneous in several dimensions. For example, the underlying physical transmission facilities of a given network may be ﲭixed media (copper, fiber- optic, radio, and satellite); the sub networks may be acquired from different vendors due to economic, performance, or general availability reasons; the information being transmitted over the network may be ﲭultimedia (video, data, voice, and images) and, finally, varying performance criteria may be imposed e.g. data transfer may require high throughput while the others, whose concern is voice communications, may require low call blocking probability. For these reasons, future telecommunications networks are expected to be highly complex in their services and operations. Due to this growing complexity and the disparity among management systems for individual sub networks, efficient network management systems have become critical to the current and future success of telecommunications companies. This paper addresses a research and development effort which focuses on prototyping configuration management, since that is the central process of network management and all other network management functions must be built upon it. Our prototype incorporates ergonomically designed graphical user interfaces tailored to the network configuration management subsystem and to the proposed advanced object-oriented database structure. The resulting design concept follows open standards such as Open Systems Interconnection (OSI) and incorporates object oriented programming methodology to associate data with functions, permit customization, and provide an open architecture environment. }, keywords = {Constraints for Network Management., Network Configuration Management, network management, Object Oriented Data Base Model for Network Management, Rules, Systems Integration, Visual Information Management for Network Configuration Management}, url = {http://drum.lib.umd.edu/handle/1903/5519}, author = {Atallah,George C and Ball,Michael O and Baras,John S and Goli,Shravan K and Karne,Ramesh K and Kelley,Stephen and Kumar,Harsha P. and Plaisant, Catherine and Roussopoulos, Nick and Shneiderman, Ben and Srinivasarao,Mulugu and Stathatos,Kostas and Teittinen,Marko and Whitefield,David} } @article {16644, title = {Neural computation in medicine}, journal = {Artificial Intelligence in Medicine}, volume = {5}, year = {1993}, month = {1993///}, pages = {143 - 157}, author = {Reggia, James A.} } @article {15371, title = {A new point of view on the mathematical structure of Maxwell{\textquoteright}s equations}, journal = {Magnetics, IEEE Transactions on}, volume = {29}, year = {1993}, month = {1993/03//}, pages = {1315 - 1320}, abstract = {It is emphasized that the Maxwell equations have a peculiar mathematical structure which leads to boundary value problems with an overspecified number of partial differential equations and an underspecified number of boundary conditions. An attempt is made to reduce these boundary value problems to standard mathematical formulations with equal numbers of partial differential equations and boundary conditions. It is demonstrated that these formulations have some attractive features which appreciably facilitate their finite element discretizations. A numerical example involving scattering of plane electromagnetic waves from a perfect conducting thin plate illustrates the discussion}, keywords = {analysis;partial, conditions;boundary, conducting, differential, discretizations;mathematical, element, EM, equations;, equations;boundary, equations;boundary-value, equations;perfect, example;partial, Maxwell{\textquoteright}s, plate;plane, problems;electromagnetic, problems;finite, scattering;finite, scattering;Maxwell, structure;numerical, thin, value, wave}, isbn = {0018-9464}, doi = {10.1109/20.250640}, author = {Mayergoyz, Issak D and D{\textquoteright}Angelo,J.} } @article {16938, title = {A nonanthropomorphic style guide: overcoming the Humpty Dumpty syndrome}, journal = {Sparks of innovation in human-computer interaction}, year = {1993}, month = {1993///}, pages = {331 - 331}, author = {Shneiderman, Ben} } @conference {18406, title = {On the nature of bias and defects in the software specification process}, booktitle = {Computer Software and Applications Conference, 1992. COMPSAC {\textquoteright}92. Proceedings., Sixteenth Annual International}, year = {1992}, month = {1992/09//}, pages = {17 - 24}, abstract = {Implementation bias in a specification is an arbitrary constraint in the solution space. The authors describe the problem of bias and then present a model of the specification and design processes describing individual subprocesses in terms of precision/detail programs, and a model of bias in multi-attribute software specifications. While studying how bias is introduced into a specification it was realized that software defects and bias are dual problems of a single phenomenon. This has been used to explain the large proportion of faults found during the coding phase at the Software Engineering Laboratory at NASA Goddard Space Flight Center}, keywords = {Center;NASA;Software, defects;software, engineering, Flight, Goddard, Laboratory;bias;coding, phase;design, processes;multiattribute, reliability;, reliability;formal, software, space, specification;software}, doi = {10.1109/CMPSAC.1992.217609}, author = {Straub,P. and Zelkowitz, Marvin V} } @article {16225, title = {A new era for high precision touchscreens}, journal = {Advances in human-computer interaction}, volume = {3}, year = {1992}, month = {1992///}, pages = {1 - 33}, abstract = {While many input devices allow interfaces to be customized, increased directness distinguishes touchscreens. Touchscreens are easy to learn to use, fast, and result in low error rates when interfaces are designed carefully. Many actions which are diffi cult with a mouse, joystick, or keyboard are simple when using a touchscreen. Making rapid selections at widely separated locations on the screen, signing your name, dragging the hands of a clock in a circular motion are all simple when using a touchscre en, but may be awkward using other devices. This paper presents recent empirical research which can provide a basis for theories of touchscreen usage. We believe recent improvements warrant increased use of touchscreens.}, author = {Sears,A. and Plaisant, Catherine and Shneiderman, Ben} } @article {16226, title = {A new era for touchscreen applications: High precision, dragging icons, and refined feedback}, journal = {Advances in Human-Computer Interaction}, volume = {3}, year = {1992}, month = {1992///}, author = {Sears,A. and Plaisant, Catherine and Shneiderman, Ben} } @article {15925, title = {Nonmonotonicity and the scope of reasoning}, journal = {Artificial Intelligence}, volume = {52}, year = {1991}, month = {1991///}, pages = {221 - 261}, author = {Etherington,D. W and Kraus,S. and Perlis, Don} } @article {15654, title = {The number of shortest paths on the surface of a polyhedron}, journal = {SIAM Journal on Computing}, volume = {19}, year = {1990}, month = {1990///}, pages = {593 - 593}, author = {Mount, Dave} } @article {14930, title = {A new approach to realizing partially symmetric functions}, journal = {Computers, IEEE Transactions on}, volume = {38}, year = {1989}, month = {1989/06//}, pages = {896 - 898}, abstract = {Consideration is given to the class of partially symmetric functions and a method for realizing them is outlined. Each such function can be expressed as a sum of totally symmetric functions such that a circuit can be designed with its complexity dependent on the size of such symmetric cover. The authors compare the sizes of symmetric and sum-of-product covers and show that the symmetric cover will be substantially smaller for this class of functions}, keywords = {class, complexity;logic, cover;symmetric, covers;switching, design;switching, functions;Boolean, functions;complexity;partially, functions;computational, functions;sum-of-product, of, symmetric, theory;, theory;symmetric}, isbn = {0018-9340}, doi = {10.1109/12.24302}, author = {JaJa, Joseph F. and Wu,S.-M.} } @article {15373, title = {A numerical analysis for the small-signal response of the MOS capacitor}, journal = {Solid-State Electronics}, volume = {32}, year = {1989}, month = {1989/03//}, pages = {207 - 213}, abstract = {Simulation results for the small-signal sinusoidal steady-state response of the MOS capacitor using time perturbation analysis of the basic semiconductor equations are presented. The effects of interface and bulk trap dynamics are included. The model uses Fermi-Dirac statistics and Shockley-Read-Hall recombination to describe the traps. This analysis is an improvement over previous techniques since it can simulate the effect of trap dynamics on the small-signal sinusoidal steady-state response of a semiconductor device with arbitrary geometry, doping and trap distributions.}, isbn = {0038-1101}, doi = {10.1016/0038-1101(89)90093-2}, url = {http://www.sciencedirect.com/science/article/pii/0038110189900932}, author = {Gaitan,Michael and Mayergoyz, Issak D} } @article {15703, title = {A note on the capacitance matrix algorithm, substructuring, and mixed or neumann boundary conditions}, journal = {Applied Numerical Mathematics}, volume = {3}, year = {1987}, month = {1987/08//}, pages = {339 - 345}, abstract = {We develop in this work variants of the capacitance matrix algorithm which can be used to solve discretizations of elliptic partial differential equations when either the original system of equations or one which arises from substructuring has a rank-deficient matrix.}, isbn = {0168-9274}, doi = {10.1016/0168-9274(87)90038-9}, url = {http://www.sciencedirect.com/science/article/pii/0168927487900389}, author = {O{\textquoteright}Leary, Dianne P.} } @article {17308, title = {No members, no officers, no dues: A ten year history of the software psychology society}, journal = {ACM SIGCHI Bulletin}, volume = {18}, year = {1986}, month = {1986/10//}, pages = {14 - 16}, abstract = {For ten years we have joyfully overcome our insecurity with anarchy and successfully conducted the "business" of the Software Psychology Society. Our business has always been science; to improve our understanding of how people use computers. The two-horse team of computer science and psychology usually pulled in the same direction. Sometimes it leaned towards design guidelines, software, and hardware, other times it leaned towards cognitive models, personality theory, and human problem-solving. Mostly our travel was steadied by an appreciation of the importance of empirical studies, data collection, and controlled experiments with an occasional diversion into theoretical models or inspirational system designs. Our destinations have included programming and command language design, human-computer interaction models, menu selection strategies, natural language interaction, software engineering metrics and methods, educational packages, expert system user interfaces, voice communications and conferencing systems, screen readability, use of color, user interface management systems, and text editor design.}, isbn = {0736-6906}, doi = {10.1145/15683.15685}, url = {http://doi.acm.org/10.1145/15683.15685}, author = {Shneiderman, Ben} } @article {14929, title = {A New Approach for Compiling Boolean Functions}, volume = {ISR; TR 1985-39}, year = {1985}, month = {1985///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {We propose a new approach for laying out Boolean functions which is based on extracting the symmetries of a given set of functions and applying optimization procedures especially tailored to exploit these symmetries. This paper establishes a rigorous foundation for this approach and shows that it will outperform existing methods for many classes of the functions. The different components of a newly developed system, SYMBL, will be briefly described.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/4412}, author = {JaJa, Joseph F. and Wu,S. M.} } @conference {15958, title = {Non-monotonicity and real-time reasoning}, booktitle = {AAAI Workshop on Nonmonotonic Reasoning}, year = {1984}, month = {1984///}, author = {Perlis, Don} } @conference {16605, title = {A New Inference Method for Frame-based Expert System}, booktitle = {Proceedings of the National Conference on Artificial Intelligence}, year = {1983}, month = {1983///}, pages = {333 - 337}, author = {Reggia, James A. and Nau, Dana S. and Wang,P. Y} } @article {14147, title = {The (new) Yale sparse matrix package}, journal = {Elliptic problem solvers II}, year = {1983}, month = {1983///}, pages = {45 - 52}, author = {Eisenstat, S. C and Elman, Howard and Schultz, M. H and Sherman, A. H} } @article {16939, title = {A note on human factors issues of natural language interaction with database systems}, journal = {Information Systems}, volume = {6}, year = {1981}, month = {1981///}, pages = {125 - 129}, abstract = {Efforts at constructing natural language computer systems have turned to implementing database query facilities. If the application domain is limited there is renewed hope for the success of natural language interfaces. This paper reviews arguments for and against such facilities, stresses research in human semantic knowledge, and emphasizes controlled psychologically oriented experimentation. The results of recent experiments are reported.}, isbn = {0306-4379}, doi = {10.1016/0306-4379(81)90034-X}, url = {http://www.sciencedirect.com/science/article/pii/030643798190034X}, author = {Shneiderman, Ben} } @conference {17304, title = {Natural vs. precise concise languages for human operation of computers: research issues and experimental approaches}, booktitle = {Proceedings of the 18th annual meeting on Association for Computational Linguistics}, series = {ACL {\textquoteright}80}, year = {1980}, month = {1980///}, pages = {139 - 141}, publisher = {Association for Computational Linguistics}, organization = {Association for Computational Linguistics}, address = {Stroudsburg, PA, USA}, abstract = {This paper raises concerns that natural language front ends for computer systems can limit a researcher{\textquoteright}s scope of thinking, yield inappropriately complex systems, and exaggerate public fear of computers. Alternative modes of computer use are suggested and the role of psychologically oriented controlled experimentation is emphasized. Research methods and recent experimental results are briefly reviewed.}, doi = {10.3115/981436.981478}, url = {http://dx.doi.org/10.3115/981436.981478}, author = {Shneiderman, Ben} } @article {15775, title = {Numerical Solution of Nonlinear Elliptic Partial Differential Equations by a Generalized Conjugate Gradient Method}, journal = {Computing}, volume = {19}, year = {1978}, month = {1978///}, pages = {321 - 339}, abstract = {We have studied previously a generalized conjugate gradient method for solving sparse positive-definite systems of linear equations arising from the discretization of elliptic partial-differential boundary-value problems. Here, extensions to the nonlinear case are considered. We split the original discretized operator into the sum of two operators, one of which corresponds to a more easily solvable system of equations, and accelerate the associated iteration based on this splitting by (nonlinear) conjugate gradients. The behavior of the method is illustrated for the minimal surface equation with splittings corresponding to nonlinear SSOR, to approximate factorization of the Jacobian matrix, and to elliptic operators suitable for use with fast direct methods. The results of numerical experiments are given as well for a mildy nonlinear example, for which, in the corresponding linear case, the finite termination property of the conjugate gradient algorithm is crucial.}, author = {Concus,Paul and Golub, Gene H. and O{\textquoteright}Leary, Dianne P.} }