Segmentation and Identification of Handwriting in Noisy Documents - Zheng,Y.; Li,H.; David Doermann (IAPRConference on Document Analysis System, 2002)
In this paper we present an approach to the problem of segmenting and identifying handwritten annotations in noisy document images. In many types of documents such as correspondence, it is not uncommon for handwritten annotations to be added as part of a note, correction, clarification, or instruction, or a signature to appear as an authentication mark. It is important to be able to segment and identify such handwriting so we can 1) locate, interpret and re-trieve them efficiently in large document databases, and 2) use different algo-rithms for printed/handwritten text recognition and signature verification. Our approach consists of two processes: 1) a segmentation process, which divides the text into regions at an appropriate level (character, word, or zone), and 2) a classification process which identifies the segmented regions as handwritten. To determine the approximate region size where classification can be reliably per-formed, we conducted experiments at the character, word and zone level. We found that the reliable results can be achieved at the word level with a classifi-cation accuracy of 97.3%. The identified handwritten text is further grouped into zones and verified to reduce false alarms. Experiments show our approach is promising and robust.

Simple Procedure for Rapid Identification of Vibrio Cholerae from the Aquatic Environment - Choopun,Nipa; Louis,Valérie; Huq,Anwar; Rita R Colwell (Applied and Environmental MicrobiologyAppl. Environ. Microbiol., 2002)
Biochemical tests commonly used to screen for Vibrio cholerae in environmental samples were evaluated, and we found that a combination of alkaline peptone enrichment followed by streaking on thiosulfate citrate bile salts sucrose agar and testing for arginine dihydrolase activity and esculin hydrolysis was an effective rapid technique to screen for aquatic environmental V. cholerae. This technique provided 100% sensitivity and ≥70% specificity.

The START multimedia information system: Current technology and future directions - Katz,B.; Jimmy Lin; Felshin,S. (In Proceedings of the International Workshop on Multimedia Information Systems (MIS 2002), 2002)
To address the problem of information overload intoday’s world, we have developed Start, a natural language question answering system that provides users with high-precision multimedia information ac- cess through the use of natural language annota- tions. To address the difficulty of accessing large amounts of heterogeneous data, we have developed Omnibase, which assists Start by integrating struc- tured and semistructured Web databases into a sin- gle, uniformly structured “virtual database.” Our ultimate goal is to develop a computer system that acts like a “smart reference librarian,” and we be- lieve we have laid a firm foundation for achieving our goal. This paper describes our current implemented system and discusses future research directions.

Text Quality Estimation in Digital Video - Li,H.; David Doermann (SPIE Conf. on Document Recognition and Information Retrieval, 2002)

Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment - Dix,Jürgen; Munoz-Avila,Hector; Nau, Dana S.; Zhang,Lingling (Logics in Artificial Intelligence, 2002)
We give the theoretical foundations and empirical evaluation of a planning agent, ashop, performing HTN planning in a multi-agent environment. ashop is based on ASHOP , an agentised version of the original SHOP HTN planning algorithm, and is integrated in the IMPACT multi-agent environment. We ran several experiments involving accessing various distributed, heterogeneous information sources, based on simplified versions of noncombatant evacuation operations, NEO’s. As a result, we noticed that in such realistic settings the time spent on communication (including network time) is orders of magnitude higher than the actual inference process. This has important consequences for optimisations of such planners. Our main results are: (1) using NEO’s as new, more realistic benchmarks for planners acting in an agent environment, and (2) a memoization mechanism implemented on top of shop, which improves the overall performance considerably.
Keywords: Computer science

Two-frame multi-scale optical flow estimation using wavelet decomposition - Liu,Haiying; Rosenfeld,Azriel; Chellapa, Rama (Acoustics, Speech, and Signal Processing (ICASSP), 2002 IEEE International Conference on, 2002)
A multi-scale algorithm using wavelet decomposition is proposed to estimate dense optical flow using only two frames. Hierarchical image representation by wavelet decomposition is used to exploit the assumption of local rigid motion in a new multi-scale framework. It is shown that if a wavelet basis with one vanishing moment is carefully selected, we can get hierarchical images, edges, and comers from the wavelet decomposition. Based on this result, all the components of the wavelet decomposition are used to estimate relatively accurate optical flow even under the inadequate image sampling condition, and overcome the #x201C;flattening-out #x201D; problem in traditional pyramid methods, which produce high errors when low-texture regions become flat at coarse levels due to blurring. Local affine transforms are also used to speed up flow estimation. Experiments on different types of image sequences together with quantitative and qualitative comparisons with several other optical flow methods are given to demonstrate the effectiveness and robustness of our algorithm.

Vision geometry XI(Seattle WA, 7-8 July 2002) - Latecki,L.J.; Mount, Dave; Wu,A. Y (SPIE proceedings series, 2002)

Web question answering: is more always better? - Dumais,Susan; Banko,Michele; Brill,Eric; Jimmy Lin; Ng,Andrew (Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, 2002)
This paper describes a question answering system that is designed to capitalize on the tremendous amount of data that is now available online. Most question answering systems use a wide variety of linguistic resources. We focus instead on the redundancy available in large corpora as an important resource. We use this redundancy to simplify the query rewrites that we need to use, and to support answer mining from returned snippets. Our system performs quite well given the simplicity of the techniques being utilized. Experimental results show that question answering accuracy can be greatly improved by analyzing more and more matching passages. Simple passage ranking and n-gram extraction techniques work well in our system making it efficient to use with many backend retrieval engines.

Web-based innovation alert services to support product design evolution - Gupta,S.K.; Lin,E.; Lo,A. J.; Xu,C. (2002)
Technological innovations provide an opportunity toimprove product performance and reduce cost. Therefore, design organizations are interested in monitoring technological innovations. A large number of innovations are announced every year. Monitoring them manually is very time consuming. We are developing web-based innovation-alert services that can be used to monitor and communicate information about innovations relevant to a particular product design. In this paper, we discuss the required infrastructure, relevant design issues, and our approach to developing web-based innovation alert services to support product design evolution. We also describe a prototype innovation monitoring service for computer components and an interactive tool to transform semi-structured web contents into semantic representations in XML.

What we have learned about fighting defects - Shull, F.; Basili, Victor R.; Boehm,B.; Brown,A. W; Costa,P.; Lindvall,M.; Port,D.; Rus,I.; Tesoriero,R.; Zelkowitz, Marvin V (Software Metrics, 2002. Proceedings. Eighth IEEE Symposium on, 2002)
The Center for Empirically Based Software Engineering helps improve software development by providing guidelines for selecting development techniques, recommending areas for further research, and supporting software engineering education. A central activity toward achieving this goal has been the running of "e- Workshops" that capture expert knowledge with a minimum of overhead effort to formulate heuristics on a particular topic. The resulting heuristics are a useful summary of the current state of knowledge in an area based on expert opinion. This paper discusses the results to date of a series of e-Workshops on software defect reduction. The original discussion items are presented along with an encapsulated summary of the expert discussion. The reformulated heuristics can be useful both to researchers (for pointing out gaps in the current state of the knowledge requiring further investigation) and to practitioners (for benchmarking or setting expectations about development practices).
Keywords: based; Center; Computer; defect; development; education; electronic; Empiric; engineering; engineering; eWorkshops; for; heuristics; reduction; Science; software; workshops

Word-level Alignment for Multilingual Resource Acquisition - Lopez,Adam; Nossal,Michael; Hwa,Rebecca; Resnik, Philip (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2002)
We present a simple, one-pass word alignment algorithm for parallel text. Our algorithm utilizes synchronous parsing and takes advantage of existing syntactic annotations. In our experiments the performance of this model is comparable to more complicated iterative methods. We discuss the challenges and potential benefits of using the model to train syntactic parsers for new languages.
Keywords: *LEARNING MACHINES; *MULTILINGUAL RESOURCES; *WORDS(LANGUAGE); ACQUISITION; algorithms; ALIGNMENT; BENEFITS; ITERATIONS; LANGUAGE; linguistics

Adaptive negative cycle detection in dynamic graphs - Chandrachoodan,N.; Bhattacharyya, Shuvra S.; Liu,K. J.R (Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on, 2001)

Analysis of a donor gene region for a variant surface glycoprotein and its expression site in African trypanosomes - LaCount,D. J; El‐Sayed, Najib M.; Kaul,S.; Wanless,D.; Turner,C. M.R; Donelson,J. E (Nucleic acids research, 2001)

Analysis of attacks on SDMI audio watermarks - M. Wu; Craver,S.; Felten,E.W.; Liu,B. (Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on, 2001)
This paper explains and analyzes the successful attacks submitted by the authors on four audio watermark proposals during a 3-week SDMI public challenge. Our analysis points out some weaknesses in the watermark techniques currently under SDMI consideration and suggests directions for further improvement. The paper also discusses the framework and strategies for analyzing the robustness and security of watermarking systems as well as the difficulty, uniqueness, and unrealistic expectations of the attack setup
Keywords: attacks; watermark; audio; coding; copy; digital; encapsulation; Initiative; attack; Music; protection; data; SDMI; setup; robustness; security; successful; watermarks; Secure; weaknesses; audio

Becoming a Scholar in the Digital Age - Duderstadt,James; Arms,William; Messina,Paul; Ellisman,Mark; Atkins,Daniel; Fox,Edward; Shneiderman, Ben; Nissenbaum,Helen; Lederberg,Joshua (National Research Council, 2001)
Keywords: bibtex-import; digital-library; dlbook

Building an Experience Base for Software Engineering: A report on the first CeBASE eWorkshop - Basili, Victor R.; Tesoriero,R.; Costa,P.; Lindvall,M.; Rus,I.; Shull, F.; Zelkowitz, Marvin V (Product Focused Software Process Improvement, 2001)
New information is obtained by research and disseminated by papers in conferences and journals. The synthesis of knowledge depends upon social discourse among the experts in a given domain to discuss the impact of this new information. Meetings among such experts are, however, expensive and time consuming. In this paper we discuss the organization of CeBASE, a center whose goal is the collection and dissemination of empirically-based software engineering knowledge, and the concept of the online workshop or eWorkshop as a way to use the Internet to minimize the needs of face-to-face meetings. We discuss the design of our eWorkshop and give the results of one eWorkshop that discussed the impact of defect reduction strategies.We want to thank Barry Boehm, Scott Henninger, Rayford Vaughn, Winsor Brown, Dan Port and Michael Frey as well as all participants for their contribution to the success of the eWorkshop. We also want to thank students at USC and UMD for their contribution in testing the system and Jennifer Dix for proof reading this paper.

CLEF experiments at Maryland: Statistical stemming and backoff translation - Oard, Douglas; Levow,G.A.; Cabezas,C. (Cross-Language Information Retrieval and Evaluation, 2001)

Efficient algorithms for location and sizing problems in network design - Kumaran,K.; Srinivasan, Aravind; Qiong Wang; Lanning,S.; Ramakrishnan,K. G (IEEE Global Telecommunications Conference, 2001. GLOBECOM '01, 2001)
Large-scale location, sizing and homing problems of distributed network elements, have received much attention recently due to the massive deployment of broadband communication networks for services like Internet telephony and Web caching. Key considerations in designing these networks include modularity of capacity, economies of scale in cost, and reliability. We formulate a general class of such network design problems as Mixed-Integer Programs. These problems are computationally intractable in general; under various asymptotic conditions, we show how to compute near-optimal solutions. To deal with arbitrary instances, we develop new algorithms based on linear programming, as well as greedy randomized adaptive search. These algorithms achieved near-optimal solutions with reasonable computation time for our experiments
Keywords: Algorithm design and analysis; Broadband communication; broadband communication networks; broadband networks; capacity modularity; Communication networks; computer network reliability; distributed network elements; Economies of scale; greedy randomized adaptive search; homing; integer programming; Intelligent networks; Internet telephony; large-scale location problems; Large-scale systems; Linear programming; mixed-integer programs; near-optimal solutions; network design; Optical switches; randomised algorithms; reliability; search problems; sizing; Technological innovation; telecommunication network planning; Web caching

Enrichment of Regulatory Signals in Conserved Non-Coding Genomic Sequence - Levy,Samuel; Hannenhalli, Sridhar; Workman,Christopher (BioinformaticsBioinformatics, 2001)
Motivation: Whole genome shotgun sequencing strategies generate sequence data prior to the application of assembly methodologies that result in contiguous sequence. Sequence reads can be employed to indicate regions of conservation between closely related species for which only one genome has been assembled. Consequently, by using pairwise sequence alignments methods it is possible to identify novel, non-repetitive, conserved segments in non-coding sequence that exist between the assembled human genome and mouse whole genome shotgun sequencing fragments. Conserved non-coding regions identify potentially functional DNA that could be involved in transcriptional regulation.Results: Local sequence alignment methods were applied employing mouse fragments and the assembled human genome. In addition, transcription factor binding sites were detected by aligning their corresponding positional weight matrices to the sequence regions. These methods were applied to a set of transcripts corresponding to 502 genes associated with a variety of different human diseases taken from the Online Mendelian Inheritance in Man database. Using statistical arguments we have shown that conserved non-coding segments contain an enrichment of transcription factor binding sites when compared to the sequence background in which the conserved segments are located. This enrichment of binding sites was not observed in coding sequence. Conserved non-coding segments are not extensively repeated in the genome and therefore their identification provides a rapid means of finding genes with related conserved regions, and consequently potentially related regulatory mechanism. Conserved segments in upstream regions are found to contain binding sites that are co-localized in a manner consistent with experimentally known transcription factor pairwise co-occurrences and afford the identification of novel co-occurring Transcription Factor (TF) pairs. This study provides a methodology and more evidence to suggest that conserved non-coding regions are biologically significant since they contain a statistical enrichment of regulatory signals and pairs of signals that enable the construction of regulatory models for human genes. Contact: samuel.levy@celera.com

E-tables: Non-specialist use and understanding of statistical data - Marchionini,G.; Hert,C.; Shneiderman, Ben; Liddy,L. (SURFACE, the Syracuse University Research Facility And Collaborative Environment, 2001)
This paper provides a progress report on a project that aims to understand how people think about and understand statistical data presented in tables. The focus is on people who are not statistical specialists. To this end, studies of various user populations were conducted, underlying data enrichment and explanation was investigated, and interactive user interface prototypes were developed and tested.

An experience management system for a software engineering research organization - Basili, Victor R.; Costa,P.; Lindvall,M.; Mendonca,M.; Seaman,C.; Tesoriero,R.; Zelkowitz, Marvin V (Software Engineering Workshop, 2001. Proceedings. 26th Annual NASA Goddard, 2001)
Most businesses rely on the fact that their employees possess relevant knowledge and that they can apply it to the task at hand. The problem is that this knowledge is not owned by the organization. It is owned and controlled by its employees. Maintaining an appropriate level of knowledge in the organization is a very important issue. It is, however, not an easy task for most organizations, and it is particularly problematic for software organizations, which are human- and knowledge-intensive. Knowledge management is a relatively new area that has attempted to address these problems. This paper introduces an approach called the "knowledge dust-to-pearls" approach. This approach addresses some of the issues with knowledge management by providing low-barrier mechanisms to "jump start" the experience base. This approach allows the experience base to become more useful more quickly than traditional approaches. This paper describes the approach and gives an example of its use at the Fraunhofer Center for Experimental Software Engineering, Maryland, USA
Keywords: and; approach; knowledge; base; experience; Center; control; knowledge; data; development; dust-to-pearls; engineering; Engineering; business; engineering; software; experimental; for; Fraunhofer; houses; knowledge; employee; knowledge; experience; level; maintenance; knowledge; management; management; knowledge; management; software; mechanisms; software; organization; software; organizational; organizations; administrative; organizations; knowledge; organizations; low-barrier; ownership; knowledge-intensive; processing; personnel; research; research; software; system; human-intensive

Fragment completion in humans and machines - Jacobs, David W.; Rokers,B.; Rudra,A.; Liu,Z. (NIPS, 2001)

Gathering knowledge for a question answering system from heterogeneous information sources - Katz,Boris; Jimmy Lin; Felshin,Sue (Proceedings of the workshop on Human Language Technology and Knowledge Management - Volume 2001, 2001)
Although vast amounts of information are available electronically today, no effective information access mechanism exists to provide humans with convenient information access. A general, open-domain question answering system is a solution to this problem. We propose an architecture for a collaborative question answering system that contains four primary components: an annotations system for storing knowledge, a ternary expression representation of language, a transformational rule system for handling some complexities of language, and a collaborative mechanism by which ordinary users can contribute new knowledge by teaching the system new information. We have developed a initial prototype, called Webnotator, with which to test these ideas.

Implementing the Experience Factory concepts as a set of Experience Bases - Basili, Victor R.; Lindvall,M.; Costa,P. (Proc. 13th Int’l Conf. Software Eng. and Knowledge Eng, 2001)
This talk takes the Experience Factory concept, which was originally developed as organizational support for softwaredevelopment and generalizes it to organizational support for any aspect of a business, e.g., business practices. The Experience Factory supports the evolution of processes and other forms of knowledge, based upon experiences within the organization, and related knowledge gathered from outside the organization. It then discusses how you might design an appropriate experience base for the particular set of organizational needs determined to be of importance. Specific examples are given in developing experience bases for specific organizations and it discusses the Experience Management System (EMS) currently being evolved and how it has been applied.

Improved Bounds on the Sample Complexity of Learning - Li,Yi; Long,Philip M.; Srinivasan, Aravind (Journal of Computer and System Sciences, 2001)
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimates is measured using a variant of the relative error proposed by Haussler and Pollard. We also show that our bound is within a constant factor of the best possible. Our upper bound implies improved bounds on the sample complexity of learning according to Haussler's decision theoretic model.
Keywords: agnostic learning; empirical process theory; machine learning; PAC learning; sample complexity

Improved cross-language retrieval using backoff translation - Resnik, Philip; Oard, Douglas; Levow,G. (Proceedings of the first international conference on Human language technology research, 2001)

Indexing and Retrieving Natural Language Using Ternary Expressions - Lin,J. J (MASSACHUSETTS INSTITUTE OF TECHNOLOGY, 2001)
Traditional information retrieval systems based on the "bag-of-words" paradigm can-not completely capture the semantic content of documents. Yet it is impossible with current technology to build a practical information access system that fully ana- lyzes and understands unrestricted natural language. However, if we avoid the most complex and processing-intensive natural language understanding techniques, we can construct a large-scale information access system which is capable of processing unre- stricted text, largely understanding it, and answering natural language queries with high precision. We believe that ternary expressions are the most suitable representa- tional structure for such a system; they are expressive enough for information retrieval purposes, yet amenable to rapid large-scale indexing.

Intrusion tolerance approaches in ITUA - Michel Cukier; Lyons,J.; Pandey,P.; Ramasamy,H. V.; Sanders,W. H.; Pal,P.; Webber,F.; Schantz,R.; Loyall,J.; Watro,R. (2001)

Mandarin-English Information (MEI): investigating translingual speech retrieval - Meng,Helen; Chen,Berlin; Khudanpur,Sanjeev; Levow,Gina-Anne; Lo,Wai-Kit; Oard, Douglas; Schone,Patrick; Tang,Karen; Wang,Hsin-Min; Wang,Jianqiang (Proceedings of the first international conference on Human language technology research, 2001)
This paper describes the Mandarin-English Information (MEI) project, where we investigated the problem of cross-language spoken document retrieval (CL-SDR), and developed one of the first English-Chinese CL-SDR systems. Our system accepts an entire English news story (text) as query, and retrieves relevant Chinese broadcast news stories (audio) from the document collection. Hence this is a cross-language and cross-media retrieval task. We applied a multi-scale approach to our problem, which unifies the use of phrases, words and subwords in retrieval. The English queries are translated into Chinese by means of a dictionary-based approach, where we have integrated phrase-based translation with word-by-word translation. Untranslatable named entities are transliterated by a novel subword translation technique. The multi-scale approach can be divided into three subtasks -- multi-scale query formulation, multi-scale audio indexing (by speech recognition) and multi-scale retrieval. Experimental results demonstrate that the use of phrase-based translation and subword translation gave performance gains, and multi-scale retrieval outperforms word-based retrieval.
Keywords: cross-language; English-Chinese; spoken document retrieval

Modulation and multiplexing techniques for multimedia data hiding - Wu,M.; Liu,B. (Proc. of SPIE ITcom’01, SPIE vol, 2001)
Many multimedia data hiding systems demand either multiple bits or multiple sets of data to be embedded. Thispaper examines the modulation and multiplexing techniques for accomplishing the task of extending the basic single- bit embedding to multiple-bit embedding. Amplitude modulo modulation, orthogonal/bi-orthogonal modulation, and TDMA or CDMA type modulation/multiplexing are discussed and compared. Several examples are included to demonstrate the use of such techniques in practical designs.

The one-inclusion graph algorithm is near-optimal for the prediction model of learning - Li,Yi; Long,P. M; Srinivasan, Aravind (IEEE Transactions on Information Theory, 2001)
Haussler, Littlestone and Warmuth (1994) described a general-purpose algorithm for learning according to the prediction model, and proved an upper bound on the probability that their algorithm makes a mistake in terms of the number of examples seen and the Vapnik-Chervonenkis (VC) dimension of the concept class being learned. We show that their bound is within a factor of 1+o(1) of the best possible such bound for any algorithm
Keywords: Computer science; concept class; general-purpose algorithm; graph theory; learning prediction model; learning systems; near-optimal algorithm; Neural networks; one-inclusion graph algorithm; optimisation; Prediction algorithms; prediction theory; Predictive models; probability; Probability distribution; Upper bound; Vapnik-Chervonenkis dimension; Virtual colonoscopy

Optimized seamless integration of biomolecular data - Eckman,B. A; Lacroix,Z.; Raschid, Louiqa (Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001, 2001)
Today, scientific data is inevitably digitized, stored in a variety of heterogeneous formats, and is accessible over the Internet. Scientists need to access an integrated view of multiple remote or local heterogeneous data sources. They then integrate the results of complex queries and apply further analysis and visualization to support the task of scientific discovery. Building a digital library for scientific discovery requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that is locally materialized in warehouses or is generated by software. We consider several tasks to provide optimized and seamless integration of biomolecular data. Challenges to be addressed include capturing and representing source capabilities; developing a methodology to acquire and represent metadata about source contents and access costs; and decision support to select sources and capabilities using cost based and semantic knowledge, and generating low cost query evaluation plans
Keywords: analysis; Bioinformatics; biology computing; cost based knowledge; Costs; Data analysis; data mining; data visualisation; Data visualization; Data warehouses; decision support; digital library; Educational institutions; information resources; Internet; low cost query evaluation plans; Mediation; meta data; metadata; molecular biophysics; multiple local heterogeneous data sources; multiple remote heterogeneous data sources; optimized seamless biomolecular data integration; scientific discovery; scientific information systems; semantic knowledge; software libraries; visual databases; Visualization

Probabilistic object bases - Eiter,Thomas; Lu,James J.; Lukasiewicz,Thomas; V.S. Subrahmanian (ACM Trans. Database Syst., 2001)
Although there are many applications where an object-oriented data model is a good way of representing and querying data, current object database systems are unable to handle objects whose attributes are uncertain. In this article, we extend previous work by Kornatzky and Shimony to develop an algebra to handle object bases with uncertainty. We propose concepts of consistency for such object bases, together with an NP-completeness result, and classes of probabilistic object bases for which consistency is polynomially checkable. In addition, as certain operations involve conjunctions and disjunctions of events, and as the probability of conjunctive and disjunctive events depends both on the probabilities of the primitive events involved as well as on what is known (if anything) about the relationship between the events, we show how all our algebraic operations may be performed under arbitrary probabilistic conjunction and disjunction strategies. We also develop a host of equivalence results in our algebra, which may be used as rewrite rules for query optimization. Last but not least, we have developed a prototype probabilistic object base server on top of ObjectStore. We describe experiments to assess the efficiency of different possible rewrite rules.
Keywords: consistency; object-oriented database; probabilistic object algebra; probabilistic object base; probability; query language; Query optimization

Promoter prediction in the human genome - Hannenhalli, Sridhar; Levy,S. (Bioinformatics, 2001)
Computational prediction of eukaryotic polII promoters has been one of the most elusive problems despite considerable effort devoted to the study. Researchers have looked for various types of signals around the transcriptional start site (TSS), viz. oligo-nucleotide statistics, potential binding sites for core factors, clusters of binding sites, proximity to CpG islands etc.. The proximity of CpG islands to gene starts is now a well established fact, although until recently, it was based on very little genomic data. In this work we explore the possibility of enhancing the promoter prediction accuracy by combining CpG island information with a few other, biologically motivated, seemingly independent signals, that cover most of the known knowledge. We benchmarked the method on a much larger genomic datasets compared to previous studies. We were able to improve slightly upon current prediction accuracy. Furthermore, we observe that CpG islands are the most dominant signals and the other signals do not improve the prediction. This suggests that the computational prediction of promoters for genes with no associated CpG-island (typically having tissue-specific expression) looking only at the immediate neighborhood of the TSS may not even be possible. We suggest some biological experiments and studies to better understand the biology of transcription.

Rapidly retargetable interactive translingual retrieval - Levow,Gina-Anne; Oard, Douglas; Resnik, Philip (Proceedings of the first international conference on Human language technology research, 2001)
This paper describes a system for rapidly retargetable interactive translingual retrieval. Basic functionality can be achieved for a new document language in a single day, and further improvements require only a relatively modest additional investment. We applied the techniques first to search Chinese collections using English queries, and have successfully added French, German, and Italian document collections. We achieve this capability through separation of language-dependent and language-independent components and through the application of asymmetric techniques that leverage an extensive English retrieval infrastructure.
Keywords: cross-language; information; retrieval

Reading between the lines: Lessons from the SDMI challenge - Craver,S.A.; Wu,M.; Liu,B.; Stubblefield,A.; Swartzlander,B.; Wallach,D.S.; Dean,D.; Felten,E.W. (Proceedings of the 10th USENIX Security Symposium, 2001)
The Secure Digital Music Initiative is a consortium ofparties interested in preventing piracy of digital music, and to this end they are developing architectures for con- tent protection on untrusted platforms. SDMI recently held a challenge to test the strength of four watermark- ing technologies, and two other security technologies. No documentation explained the implementations of the technologies, and neither watermark embedding nor de- tecting software was directly accessible to challenge par- ticipants. We nevertheless accepted the challenge, and explored the inner workings of the technologies. We re- port on our results here.

Robust matching of wavelet features for sub-pixel registration of Landsat data - Le Moigne,J.; Netanyahu,N. S; Masek,J. G; Mount, Dave; Goward, S.N. (Geoscience and Remote Sensing Symposium, 2001. IGARSS '01. IEEE 2001 International, 2001)
For many Earth and space science applications, automatic geo-registration at sub-pixel accuracy has become a necessity. In this work, we are focusing on building an operational system, which will provide a sub-pixel accuracy registration of Landsat-5 and Landsat-7 data. The input to our registration method consists of scenes that have been geometrically and radiometrically corrected. Such preprocessed scenes are then geo-registered relative to a database of Landsat chips. The method assumes a transformation composed of a rotation and a translation, and utilizes rotation- and translation-invariant wavelets to extract image features that are matched using statistically robust feature matching and a partial Hausdorff distance metric. The registration process is described and results on four Landsat input scenes of the Washington, D.C., area are presented
Keywords: Feature extraction; geo-registration; geophysical measurement technique; geophysical signal processing; geophysical techniques; Hausdorff distance metric; image registration; infrared; IR; land surface; Landsat; Landsat-5; Landsat-7; multispectral remote sensing; robust feature matching; robust matching; sub pixel registration; subpixel accuracy; terrain mapping; visible; wavelet feature; wavelet method; Wavelet transforms

The role of a natural language conversational interface in online sales: A case study - Chai,J.; Jimmy Lin; Zadrozny,W.; Ye,Y.; Stys-Budzikowska,M.; Horvath,V.; Kambhatla,N.; Wolf,C. (International Journal of Speech Technology, 2001)
This paper describes the evaluation of a natural language dialog-based navigation system (HappyAssistant) that helps users access e-commerce sites to find relevant information about products and services. The prototype system leverages technologies in natural language processing and human-computer interaction to create a faster and more intuitive way of interacting with websites, especially for less experienced users. The result of a comparative study shows that users prefer the natural language-enabled navigation two to one over the menu driven navigation. In addition, the study confirmed the efficiency of using natural language dialog in terms of the number of clicks and the amount of time required to obtain the relevant information. In the case study, as compared to the menu driven system, the average number of clicks used in the natural language system was reduced by 63.2% and the average time was reduced by 33.3%.

Rotation, scale, and translation resilient public watermarking for images using a log-polar fourier transform - Bloom,Jeffrey A.; Cox,Ingemar J.; Miller,Matthew L.; M. Wu; Lin,Ching-Yung; Lui,Yui Man (2001)
A method for detecting a watermark signal in digital image data. The detecting method includes the steps of: computing a log-polar Fourier transform of the image data to obtain a log-polar Fourier spectrum; projecting the log-polar Fourier spectrum down to a lower dimensional space to obtain an extracted signal; comparing the extracted signal to a target watermark signal; and declaring the presence or absence of the target watermark signal in the image data based on the comparison. Also provided is a method for inserting a watermark signal in digital image data to obtain a watermarked image. The inserting method includes the steps of: computing a log-polar Fourier transform of the image data to obtain a log-polar Fourier spectrum; projecting the log-polar Fourier spectrum down to a lower dimensional space to obtain an extracted signal; modifying the extracted signal such that it is similar to a target watermark; performing a one-to-many mapping of the modified signal back to...

Rotation, scale, and translation resilient watermarking for images - Lin,C.-Y.; Wu,M.; Bloom,J.A.; Cox,I.J.; Miller,M.L.; Lui,Y.M. (Image Processing, IEEE Transactions on, 2001)
Many electronic watermarks for still images and video content are sensitive to geometric distortions. For example, simple rotation, scaling, and/or translation (RST) of an image can prevent blind detection of a public watermark. In this paper, we propose a watermarking algorithm that is robust to RST distortions. The watermark is embedded into a one-dimensional (1-D) signal obtained by taking the Fourier transform of the image, resampling the Fourier magnitudes into log-polar coordinates, and then summing a function of those magnitudes along the log-radius axis. Rotation of the image results in a cyclical shift of the extracted signal. Scaling of the image results in amplification of the extracted signal, and translation of the image has no effect on the extracted signal. We can therefore compensate for rotation with a simple search, and compensate for scaling by using the correlation coefficient as the detection measure. False positive results on a database of 10 000 images are reported. Robustness results on a database of 2000 images are described. It is shown that the watermark is robust to rotation, scale, and translation. In addition, we describe tests examining the watermarks resistance to cropping and JPEG compression
Keywords: axis; one-dimensional; coding; security; coefficient; cropping; cyclical; compression; RST; coordinates; log-radius; data; detection; correlation; distortions; blind; distortions; images; log-polar; encapsulation; image; Fourier; images; translation; magnitudes; Fourier; measure; geometric; of; protection; data; resilient; shift; detection; signal; public; transform; JPEG; transforms; copy; watermark; resampling; rotation; scale; search; still; watermarking; video; Fourier

Therapeutic play with a storytelling robot - Lathan,Corinna; Vice,Jack Maxwell; Tracey,Michael; Plaisant, Catherine; Druin, Allison; Edward,Kris; Montemayor,Jaime (CHI '01 extended abstracts on Human factors in computing systems, 2001)
We are developing a prototype storytelling robot for use with children in rehabilitation. Children can remotely control a furry robot by using a variety of body sensors adapted to their disability or rehabilitation goal. We believe this robot can motivate children and help them reach their therapy goals through therapeutic play, either by exercising muscles or joints (e.g. for physically challenged children) or by reflecting on the stories (e.g. for children with developmental disabilities). To develop this technology we use an innovative design methodology involving children as design partners.
Keywords: children; design process; rehabilitation; robot; therapeutic play; user interface

Update propagation strategies for improving the quality of data on the web - Labrinidis,A.; Roussopoulos, Nick; SCIENCE,MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER (PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, 2001)

Vision Geometry X - Latecki,L.J.; Mount, Dave; Wu,A. Y; Melter,R.A. (Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series, 2001)

Watermarking scheme for image authentication - M. Wu; Liu,Bede (2001)
A digital watermarking process whereby an invisible watermark inserted into a host image is utilized to determine whether or not the image has been altered and, if so, where in the image such alteration occurred. The watermarking method includes the steps of providing a look-up table containing a plurality of coefficients and corresponding values; transforming the image into a plurality of blocks, wherein each block contains coefficients matching coefficients in the look-up table; and embedding the watermark in the image by performing the following substeps for at least some of the blocks: First, a coefficient is selected for insertion of a marking value representative of a corresponding portion of the watermark. Next, the value of the selected coefficient to used to identify a corresponding value in the look-up table. Finally, the identified coefficient is left unchanged if the corresponding value is the same as the marking value, and is changed if the corresponding value is...

Web-based interactive design of freeform motions - Li,ST; Ge,Q. J; Varshney, Amitabh (Proceedings of the ASME 2001 Design Engineering Technical Conferences and Computers and Information in Engineering Conference, 2001)

What can we reasonably expect from watermarks? - Craver,S.A.; M. Wu; Liu,B. (Applications of Signal Processing to Audio and Acoustics, 2001 IEEE Workshop on the, 2001)
Digital watermarking has been positioned as a solution to copyright protection of digital music, and some doubt exists about its ability to perform in this regard. A survey of watermarking applications assesses the technology's potential for copy protection, as well as other digital audio applications
Keywords: applications; audio; applications; digital; audio; coding; copy; data; databases; music; hashing; steganography; watermarking; music; digital; of; protection; copyright; protection; copyright; music; security; protection; digital; watermarking; copy; watermarking; forensic; watermarking; music

Automatic Text Detection and Tracking in Digital Video - Li,H.; David Doermann; Kia,O. (IEEE Transactions on Image Processing - Special Issue on Image and Video Processing for Digital Libraries, 2000)
Text that appears in a scene or is graphically added to video can provide an important supplemental source of index information as well as clues for decoding the video's structure and for classification. In this work, we present algorithms for detecting and tracking text in digital video. Our system implements a scale-space feature extractor that feeds an artificial neural processor to detect text blocks. Our text tracking scheme consists of two modules: a sum of squared difference (SSD) based module to find the initial position and a contour-based module to refine the position. Experiments conducted with a variety of video sources show that our scheme can detect and track text robustly.

AVideo Text Detection System Based on Automated Training - Li,H.; David Doermann (ICPR, 2000)

Building a Chinese-English Mapping Between Verb Concepts for Multilingual Applications - Dorr, Bonnie J; Levow,Gina-Anne; Lin,Dekang (Envisioning Machine Translation in the Information FutureEnvisioning Machine Translation in the Information Future, 2000)
This paper addresses the problem of building conceptual resources for multilingual applications. We describe new techniques for large-scale construction of a Chinese-English lexicon for verbs, using thematic-role information to create links between Chinese and English conceptual information. We then present an approach to compensating for gaps in the existing resources. The resulting lexicon is used for multilingual applications such as machine translation and cross-language information retrieval.

Chinese-English Semantic Resource Construction - Dorr, Bonnie J; Levow,Gina-Anne; Lin,Dekang; Thomas,Scott (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2000)
We describe an approach to large-scale construction of a semantic lexicon for Chinese verbs. We leverage off of three existing resources-- a classification of English verbs called EVCA (English Verbs Classes and Alternations), a Chinese conceptual database called HowNet, and a large-machine readable dictionary called Optilex. The resulting lexicon is used for determining appropriate word senses in applications such as machine translation and cross-language information retrieval.
Keywords: *CHINESE LANGUAGE; *ENGLISH LANGUAGE; *LEXICONS; *SEMANTICS; *VERBS; *WORD SENSES; *WORDS(LANGUAGE); classification; CONCEPTS; CONSTRUCTION; Dictionaries; INFORMATION SCIENCE; linguistics; VERB CLASSES; Vocabulary

Comparative Evaluation of a Natural Language Dialog Based System and a Menu-Driven System for Information Access: A Case Study - Chai,J.; Jimmy Lin; Zadrozny,W.; Ye,Y.; Budzikowska,M.; Horvath,V.; Kambhatla,N.; Wolf,C. (In Proceedings of the International Conference on Multimedia Information Retrieval (RIAO 2000), 2000)
This paper describes the evaluation of a natural language dialog based navigation system (HappyAssistant) thathelps users access e-commerce sites to find relevant information about products and services. The prototype system leverages technologies in natural language processing and human computer interaction to create a faster and more intuitive way of interacting with websites, especially for the less experienced users. The result of a comparative study shows that users prefer the natural language enabled navigation two to one over the menu driven navigation. In addition, the study confirmed the efficiency of using natural language dialog in terms of the number of clicks and the amount of time required to obtain the relevant information. In the case study, comparing to the menu driven system, the average number of clicks used in the natural language system was reduced by 63.2% and the average time was reduced by 33.3%.

A compositional approach to statecharts semantics - L\üttgen,G.; Von Der Beeck,M.; Cleaveland, Rance (ACM, 2000)

A computational model of lateralization and asymmetries in cortical maps - Levitan,S.; Reggia, James A. (Neural computation, 2000)

Construction of Chinese-English Semantic Hierarchy for Information Retrieval - Levow,G.A.; Dorr, Bonnie J; Lin,D. (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2000)
This paper describes an approach to large-scale construction of a semantic hierarchyfor Chinese verbs. Leveraging off of an existing Chinese conceptual databased called HowNet and a Levin-based Egnlish verb classification, we use thematic-role information to create links between Chinese concepts and English classes. The resulting hierarchy is used for multilingual lexicons in an English-Chinese cross-language information retrieval application. We demonstrate a structured syntax interface that exploits this large-scale hierarchy and its linages to WordNet for English-Chinese cross-language information re- trieval.

Convexity in Perceptual Completion - Liu,Z.; Jacobs, David W.; Basri,R. (KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE, 2000)

Cortical inhibition as explained by the competitive distribution hypothesis - Reggia, James A.; Sutton III,G. G.; Lynne,C.; D'Autrechy,S. C; Armentrout,S. L (Network models for control and processing, 2000)

Data hiding in digital binary image - M. Wu; Tang,E.; Lin, B. (Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on, 2000)
This paper proposes a new method to embed data in binary images, including scanned text, figures and signatures. The method manipulates ldquo;flippable rdquo; pixels and uses shuffling to embed a significant amount of data without causing noticeable artifacts. The extraction of the hidden data does not require the original image. Potential applications include detecting unauthorized use of a digitized signature and authenticating binary documents
Keywords: authentication; data; binary; data; document; encapsulation; image; hiding; digital; image; digital; of; pixels; multimedia; scanned; processing; multimedia; signature; flippable; systems; security; text; shuffling; data; watermarking; digitized

Dynamic node management and measure estimation in a state-driven fault injector - Chandra,R.; Michel Cukier; Lefever,R.; Sanders,W.; others (2000)
Validation of distributed systems using fault injectionis difficult because of their inherent complexity, lack of a global clock, and lack of an easily accessible notion of a global state. To address these challenges, the Loki fault injector injects faults based on a partial view of the global state of a distributed system, and performs a post-runtime analysis using an off-line clock synchronization algorithm to determine whether the faults were properly injected. In this paper, we first describe an enhanced runtime architecture for the Loki fault injector and then present a new method for obtaining measures in Loki. The enhanced runtime allows dynamic entry and exit of nodes in the system. It also offers more efficient multicast of notification messages and more efficient communication between state machines on the same host, and is more scalable than the previous runtime. We then detail a new and flexible method for obtaining a wide range of performance and dependability measures in Loki.

Evaluation challenges for a Federation of heterogeneous information providers: the case of NASA's Earth Science Information Partnerships - Plaisant, Catherine; Komlodi,A.; Lindsay,F. (Enabling Technologies: Infrastructure for Collaborative Enterprises, 2000. (WET ICE 2000). Proeedings. IEEE 9th International Workshops on, 2000)
NASA's Earth Science Information Partnership Federation is an experiment funded to assess the ability of a group of widely heterogeneous earth science data or service providers to self organize and provide improved and affordable access to an expanding earth science user community. As it is self-organizing, the Federation is mandated to set in place an evaluation methodology and collect metrics reflecting the outcomes and benefits of the Federation. This paper describes the challenges of organizing such a federated partnership self-evaluation and discusses the issues encountered during the metrics definition phase of the early data collection. Our experience indicates that a large number of metrics will be needed to fully represent the activities and strengths of all partners, but because of the heterogeneity of the ESIPs the qualitative data (comments accompanying the metric data and success stories) becomes the most useful information. Other lessons learned included the absolute need for online browsing tools to accompany data collection tools. Finally, our experience confirms the effect of evaluation as an agent of change, the best example being the high level of collaboration among the ESIPs which can be in part attributed to the initial identification of collaboration as one of the important evaluation factors of the Federation
Keywords: Browsing; collection; heterogeneous; computing; groupware; data; online; Earth; Federation; data; information; NASA's; Partnership; Science; systems; geophysics; tools; geographic

Exploiting concurrency in a DBMS implementation for production systems - Raschid, Louiqa; Sellis,T.; Lin,C. C (Proceedings of the first international symposium on Databases in parallel and distributed systems, 2000)

Extending understanding of federal statistics in tables - Marchionini,Gary; Hert,Carol; Liddy,Liz; Shneiderman, Ben (Proceedings of the 2000 annual national conference on Digital government research, 2000)
This paper describes progress toward improving user interfaces for US Federal government statistics that are presented in tables. Based on studies of user behaviors and needs related to statistical tables, we describe interfaces to assist diverse users with a range of statistical literacy to explore, find, understand, and use US Federal government statistics.
Keywords: data exploration; dynamic queries; Statistics; tablular data; User interfaces

Facilitating data exploration with query previews: A study of user performance and preference - Tanin,Egemen; Lotem,Amnon; Haddadin,Ihab; Shneiderman, Ben; Plaisant, Catherine; Slaughter,Laura (Behaviour & Information Technology, 2000)
Networked and local data exploration systems that use command languages, menus, or form fill-in interfaces rarely give users an indication of the distribution of data. This often leads users to waste time, posing queries that have zero-hit or mega-hit results. Query previews are a novel visual approach for browsing databases. Query previews supply users with data distribution information for selected attributes of the database, and give continuous feedback about the size of the result set as the query is being formed. Subsequent refinements might be necessary to narrow the search. As there is a risk that query previews are an additional step, leading to a more complex and slow search process, a within-subjects empirical study was ran with 12 subjects who used interfaces with and without query previews and with minimized network delays. Even with 12 subjects and minimized network delays statistically significant differences were found, showing that query previews could speed up performance 1.6 to 2.1 times and lead to higher user satisfaction.Networked and local data exploration systems that use command languages, menus, or form fill-in interfaces rarely give users an indication of the distribution of data. This often leads users to waste time, posing queries that have zero-hit or mega-hit results. Query previews are a novel visual approach for browsing databases. Query previews supply users with data distribution information for selected attributes of the database, and give continuous feedback about the size of the result set as the query is being formed. Subsequent refinements might be necessary to narrow the search. As there is a risk that query previews are an additional step, leading to a more complex and slow search process, a within-subjects empirical study was ran with 12 subjects who used interfaces with and without query previews and with minimized network delays. Even with 12 subjects and minimized network delays statistically significant differences were found, showing that query previews could speed up performance 1.6 to 2.1 times and lead to higher user satisfaction.

Generating dynamic content at database-backed web servers - Labrinidis,Alexandros; Roussopoulos, Nick (ACM SIGMOD RecordSIGMOD Rec., 2000)

The genome sequence of Drosophila melanogaster - Adams,M.D.; Celniker,S.E.; Holt,R.A.; Evans,C.A.; Gocayne,J.D.; Amanatides,P.G.; Scherer,S.E.; Li,P.W.; Hoskins,R.A.; Galle,R.F.; others (Science, 2000)
The fly Drosophila melanogaster is one of the most intensively studied organisms in biology and serves as a model system for the investigation of many developmental and cellular processes common to higher eukaryotes, including humans. We have determined the nucleotide sequence of nearly all of the ∼120-megabase euchromatic portion of theDrosophila genome using a whole-genome shotgun sequencing strategy supported by extensive clone-based sequence and a high-quality bacterial artificial chromosome physical map. Efforts are under way to close the remaining gaps; however, the sequence is of sufficient accuracy and contiguity to be declared substantially complete and to support an initial analysis of genome structure and preliminary gene annotation and interpretation. The genome encodes ∼13,600 genes, somewhat fewer than the smaller Caenorhabditis elegansgenome, but with comparable functional diversity.

Geo-registration of Landsat data by robust matching of wavelet features - Le Moigne,J.; Netanyahu,N. S; Masek,J. G; Mount, Dave; Goward,S.; Honzak,M. (Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International, 2000)
The goal of our project is to build an operational system, which will provide a sub-pixel accuracy registration of Landsat-5 and Landsat-7 data. Integrated within an automated mass processing/analysis system for Landsat data (REALM), the input to our registration method consists of scenes that have been geometrically and radiometrically corrected, as well as pre-processed for the detection of clouds and cloud shadows. Such pre-processed scenes are then geo-registered relative to a database of Landsat chips. This paper describes our registration process, including the use of a database of landmark chips, a feature extraction performed by an overcomplete wavelet representation, and feature matching using statistically robust techniques. Knowing the approximate longitudes and latitudes of the four corners of the scene, a subset of chips which represent landmarks included in the scene are extracted from the database. For each of these selected landmark chips, a corresponding window is extracted from the scene, and each chip-window pair is registered using our robust wavelet feature matching. First results and future directions are presented in the paper
Keywords: atmospheric techniques; automated mass processing/analysis system; chip-window pair; cloud shadows; Clouds; Feature extraction; feature matching; geo-registration; geometrically corrected scene; geophysical signal processing; Image matching; image registration; landmark chips; Landsat chips; Landsat data; Landsat-5 data; Landsat-7 data; overcomplete wavelet representation; pre-processed scenes; radiometrically corrected scene; REALM; Remote sensing; robust matching; robust wavelet feature matching; scenes; statistically robust techniques; sub-pixel accuracy registration; wavelet features; Wavelet transforms; window

Large-Scale Construction of a Chinese-English Semantic Hierarchy - Dorr, Bonnie J; Levow,Gina-Anne; Lin,Dekang (Instititue for Advanced Computer Studies, Univ of Maryland, College Park, 2000)
This paper addresses the problem of building conceptual resources for multilingual applications. We describe new techniques for large-scale construction of a semantic hierarchy for Chinese verbs, using thematic-role information to create links between Chinese concepts and English classes. We then present an approach to compensating for gaps in the existing resources. The resulting hierarchy is used for a multilingual lexicon for Chinese-English machine translation and cross-language information retrieval applications.
Keywords: *CHINESE VERBS; *HIERARCHIES; *SEMANTICS; CHINA; CROSS CORRELATION; Information retrieval; INFORMATION SCIENCE; LANGUAGE; LEXICONS; linguistics; Machine translation; MULTILINGUAL; operations research; SYSTEMS APPROACH

Loki: a state-driven fault injector for distributed systems - Chandra,R.; Lefever,R.M.; Michel Cukier; Sanders,W. H. (2000)
Distributed applications can fail in subtle ways that depend on the state of multiple parts of a system. This complicates the validation of such systems via fault injection, since it suggests that faults should be injected based on the global state of the system. In Loki, fault injection is performed based on a partial view of the global state of a distributed system, i.e. faults injected in one node of the system can depend on the state of other nodes. Once faults are injected, a post-runtime analysis, using off-line clock synchronization, is used to place events and injections on a single global timeline and to determine whether the intended faults were properly injected. Finally, experiments containing successful fault injections are used to estimate the specified measures. In addition to briefly reviewing the concepts behind Loki and its organization, we detail Loki's user interface. In particular, we describe the graphical user interfaces for specifying state machines and faults, for executing a campaign and for verifying whether the faults were properly injected
Keywords: campaign execution; computer testing; distributed applications failure; distributed processing; distributed system validation; Fault diagnosis; fault event placement; fault specification; global system state; global timeline; Graphical user interfaces; Loki; off-line clock synchronization; post-runtime analysis; specified measures estimation; state machine specification; state-driven fault injection; Synchronisation

New Eyes for Shape and Motion Estimation - Baker,Patrick; Pless,Robert; Fermüller, Cornelia; Aloimonos, J. (Biologically Motivated Computer VisionBiologically Motivated Computer Vision, 2000)
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.

A new relative perturbation theorem for singular subspaces - Li,Ren-Cang; Stewart, G.W. (Linear Algebra and its Applications, 2000)
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

Perceptual Completion Behind Occluders: The Role of Convexity - Liu,Z.; Jacobs, David W.; Basri,R. (Perceptual Organization for Artificial Vision Systems, 2000)
An important problem in perceptual organization is to determine whether two image regions belong to the same object. In this chapter, we consider the situation when two image regions potentially group into a single object behind a common occluder. We study the extent to which two image regions are grouped more strongly than two other image regions. Existing theories in both human and computer vision have mainly emphasized the role of good continuation. Namely, the shorter and smoother the completing contours are between two image regions, the stronger the grouping will be. In contrast, Jacobs [3] has proposed a theory that considers relative positions and orientations of two image regions. For instance, the theory predicts that two image regions that can be linked by convex completing contours are grouped more strongly than those that can only be linked by concave completing contours, even though the completing contours are identical in shape. We present, in addition to our previous work (Liu, Jacobs, and Basri, 1999), human psychophysical evidence that concurs with the predictions of this theory and suggests an important role of convexity in perceptual grouping.

Phylogenetic relationships of Acanthocephala based on analysis of 18S ribosomal RNA gene sequences - García-Varela,M; Pérez-Ponce de León,G.; de la Torre,P; Cummings, Michael P.; Sarma,SS; Laclette,J. P (J Mol Evol, 2000)
Acanthocephala (thorny-headed worms) is a phylum of endoparasites of vertebrates and arthropods, included among the most phylogenetically basal tripoblastic pseudocoelomates. The phylum is divided into three classes: Archiacanthocephala, Palaeacanthocephala, and Eoacanthocephala. These classes are distinguished by morphological characters such as location of lacunar canals, persistence of ligament sacs in females, number and type of cement glands in males, number and size of proboscis hooks, host taxonomy, and ecology. To understand better the phylogenetic relationships within Acanthocephala, and between Acanthocephala and Rotifera, we sequenced the nearly complete 18S rRNA genes of nine species from the three classes of Acanthocephala and four species of Rotifera from the classes Bdelloidea and Monogononta. Phylogenetic relationships were inferred by maximum-likelihood analyses of these new sequences and others previously determined. The analyses showed that Acanthocephala is the sister group to a clade including Eoacanthocephala and Palaeacanthocephala. Archiacanthocephala exhibited a slower rate of evolution at the nucleotide level, as evidenced by shorter branch lengths for the group. We found statistically significant support for the monophyly of Rotifera, represented in our analysis by species from the clade Eurotatoria, which includes the classes Bdelloidea and Monogononta. Eurotatoria also appears as the sister group to Acanthocephala.

Resynchronization for multiprocessor DSP systems - Bhattacharyya, Shuvra S.; Sriram,S.; Lee,E. A (Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on, 2000)

REXTOR: a system for generating relations from natural language - Katz,Boris; Jimmy Lin (Proceedings of the ACL-2000 workshop on Recent advances in natural language processing and information retrieval: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 11, 2000)
This paper argues that a finite-state language model with a ternary expression representation is currently the most practical and suitable bridge between natural language processing and information retrieval. Despite the theoretical computational inadequacies of finite-state grammars, they are very cost effective (in time and space requirements) and adequate for practical purposes. The ternary expressions that we use are not only linguistically-motivated, but also amenable to rapid large-scale indexing. REXTOR (Relations EXtracTOR) is an implementation of this model; in one uniform framework, the system provides two separate grammars for extracting arbitrary patterns of text and building ternary expressions from them. These content representational structures serve as the input to our ternary expressions indexer. This approach to natural language information retrieval promises to significantly raise the performance of current systems.

Rotation, scale, and translation resilient public watermarking for images - Lin,C.Y.; Wu,M.; Bloom,J.A.; Cox,I.J.; Miller,M.L.; Lui,Y.M. (PROC SPIE INT SOC OPT ENG, 2000)
Many electronic watermarks for still images and video content are sensitive to geometric distortions. For example,simple rotation, scaling, and/or translation (RST) of an image can prevent detection of a public watermark. In this paper, we propose a watermarking algorithm that is robust to RST distortions. The watermark is embedded into a 1-dimensional signal obtained by first taking the Fourier transform of the image, resampling the Fourier magnitudes into log-polar coordinates, and then summing a function of those magnitudes along the log-radius axis. If the image is rotated, the resulting signal is cyclically shifted. If it is scaled, the signal is multiplied by some value. And if the image is translated, the signal is unaffected. We can therefore compensate for rotation with a simple search, and for scaling by using the correlation coefficient for the detection metric. False positive results on a database of 10,000 images are reported. Robustness results on a database of 2,000 images are described. It is shown that the watermark is robust to rotation, scale and translation. In addition, the algorithm shows resistance to cropping.

A semantic theory for heterogeneous system design - Cleaveland, Rance; L\üttgen,G. (FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science, 2000)

A storytelling robot for pediatric rehabilitation - Plaisant, Catherine; Druin, Allison; Lathan,Corinna; Dakhane,Kapil; Edwards,Kris; Vice,Jack Maxwell; Montemayor,Jaime (Proceedings of the fourth international ACM conference on Assistive technologies, 2000)
Keywords: children; design process; rehabilitation; robot; therapeutic play; user interface

Superresolution-based enhancement of text in digital video - Huiping Li; David Doermann (Pattern Recognition, 2000. Proceedings. 15th International Conference on, 2000)
We present a superresolution-based text enhancement scheme to improve optical character recognition (OCR) and readability of text in digital video. The quality of video text is degraded by factors such as low resolution, antialiasing, clutter and blurring. We use the fact that the same text string often exists in consecutive frames to explore the temporal information and enhance the text image. For graphic text, we register text blocks to subpixel accuracy and fuse them to a new block with high resolution and a cleaner background. We use a projection onto convex sets based method to deblur scene text to improve readability. Experimental results show our scheme can improve OCR for graphic text and readability for scene text significantly
Keywords: accuracy; superresolution-based; antialiasing; blurring; clutter; digital; based; character; convex; Enhancement; enhancement; image; information; text; method; readability; subpixel; onto; recognition; resolution; image; resolution; projection; scheme; temporal; sequences; optical; sets; string; video; text; text; geometry; image; text; low; video; graphic

Textual data mining to support science and technology management - Losiewicz,P.; Oard, Douglas; Kostoff,R.N. (Journal of Intelligent Information Systems, 2000)

Video transcoding by reducing spatial resolution - Yin,Peng; M. Wu; Liu,Bede (Image Processing, 2000. Proceedings. 2000 International Conference on, 2000)
In network delivery of digital video, if the bandwidth required for a video is not available, the video has to be recoded at a reduced bit rate. It is highly desirable that the transcoding is carried out in real time while maintaining reasonable image quality. In this paper, we propose a fast approach to derive from an MPEG stream a new MPEG stream with half the spatial resolution. For the downsized video, we first generate from the original compressed video an improved estimate of the motion vectors. We then propose a compressed domain approach with data hiding to produce DCT residues by an open-loop method. The computational complexity is significantly lower than a number of previous approaches. Simulation suggests that our approach produces reasonable image quality
Keywords: approach; computational; coding; coding; video; complexity; data; compression; data; cosine; DCT; delivery; open-loop; domain; encapsulation; discrete; estimation; network; estimation; transform; hiding; digital; method; spatial; quality; motion; reduction; video; residues; MPEG; resolution; resolution; motion; stream; compressed; transcoding; computational; transforms; image; vectors; video; downsized; video; image

Vision geometry IX:(San Diego CA, 30-31 July 2000) - Latecki,L.J.; Mount, Dave; Wu,A. Y (SPIE proceedings series, 2000)

WebView materialization - Labrinidis,Alexandros; Roussopoulos, Nick (SIGMOD Rec., 2000)
A WebView is a web page automatically created from base data typically stored in a DBMS. Given the multi-tiered architecture behind database-backed web servers, we have the option of materializing a WebView inside the DBMS, at the web server, or not at all, always computing it on the fly (virtual). Since WebViews must be up to date, materialized WebViews are immediately refreshed with every update on the base data. In this paper we compare the three materialization policies (materialized inside the DBMS, materialized at the web server and virtual) analytically, through a detailed cost model, and quantitatively, through extensive experiments on an implemented system. Our results indicate that materializing at the web server is a more scalable solution and can facilitate an order of magnitude more users than the virtual and materialized inside the DBMS policies, even under high update workloads.

Advances in spherical harmonic device modeling: calibration and nanoscale electron dynamics - Lin,Chung-Kai; Goldsman,N.; Mayergoyz, Issak D; Aronowitz,S.; Belova,N. (Simulation of Semiconductor Processes and Devices, 1999. SISPAD '99. 1999 International Conference on, 1999)
Improvements in the Spherical Harmonic (SH) method for solving Boltzmann Transport Equation (BTE) are presented. The simulation results provide the same physical detail as analytical band Monte Carlo (MC) calculations, and are obtained approximately a thousand times faster. A new physical model for surface scattering has also been developed. As a result, the SHBTE model achieves calibration for a complete process of I-V characteristics and substrate current consistently for the first time
Keywords: Boltzmann; characteristics; SHBTE; current; surface; device; dynamics; spherical; electron; equation; calibration; semiconductor; equation; I-V; harmonic; model; substrate; models; surface; scattering; scattering; Boltzmann; simulation; calibration; nanoscale; transport

Agents vs. direct manipulation: what's best to disentangle the Web? - Sánchez,J.A.; Etzioni,O.; Kautz,H.; Lieberman,H.; Shneiderman, Ben (Proceedings of the eighth international conference on World Wide Web, 1999)

Agents vs. direct manipulation: what's best to disentangle the Web? - Sánchez,J. Alfredo; Etzioni,Oren; Kautz,Henry; Lieberman,Henry; Shneiderman, Ben (Computer Networks: The International Journal of Computer and Telecommunications Networking, 1999)

Attacks on digital watermarks - M. Wu; Liu,Bede (Signals, Systems, and Computers, 1999. Conference Record of the Thirty-Third Asilomar Conference on, 1999)
Two methods for attacking watermarks in images and videos have been proposed. The first attack is to remove robust watermarks by iterative block dropping and concealment. Our study suggests that the block size chosen by a robust watermark embedding system should be large enough to circumventing concealment based attacks. The second attacking method is to forge valid watermarks for authentication systems based on fragile-watermarking. Double watermarking is then proposed as one possible countermeasure.
Keywords: attacks; copy; Authentication; authentication; video; based; block; coding; coding; iterative; control; digital; countermeasure; fragile-watermarking; images; iterative; dropping; ownership; EMBEDDING; forging; copyright; image; methods; message; protection; robust; removal; videos; watermarks; size; concealment; system; robust; systems; block; watermark; watermarking; watermarks; watermarks; double

A comparative study of the backbone dynamics of two closely related lipid binding proteins: Bovine heart fatty acid binding protein and porcine ileal lipid binding protein - Lücke,Christian; Fushman, David; Ludwig,Christian; Hamilton,James A.; Sacchettini,James C.; Rüterjans,Heinz (Molecular and Cellular Biochemistry, 1999)
The backbone dynamics of bovine heart fatty acid binding protein (H-FABP) and porcine ileal lipid binding protein (ILBP) were studied by 15N NMR relaxation (T1 and T2) and steady state heteronuclear 15N1H NOE measurements. The microdynamic parameters characterizing the backbone mobility were determined using the ‘model-free’ approach. For H-FABP, the non-terminal backbone amide groups display a rather compact protein structure of low flexibility. In contrast, for ILBP an increased number of backbone amide groups display unusually high internal mobility. Furthermore, the data indicate a higher degree of conformational exchange processes in the µsec-msec time range for ILBP compared to H-FABP. These results suggest significant differences in the conformational stability for these two structurally highly homologous members of the fatty acid binding protein family.
Keywords: Biomedical and Life Sciences

Developing the next generation of Earth science data systems: the Global Land Cover Facility - Lindsay,F.E.; Townshend,J.R.G.; JaJa, Joseph F.; Humphries,J.; Plaisant, Catherine; Shneiderman, Ben (Geoscience and Remote Sensing Symposium, 1999. IGARSS '99 Proceedings. IEEE 1999 International, 1999)
A recent initiative by NASA has resulted in the formation of a federation of Earth science data partners. These Earth Science Information Partners (ESIPs) have been tasked with creating novel Earth science data products and services as well as distributing new and existing data sets to the Earth science community and the general public. The University of Maryland established its ESIP activities with the creation of the Global Land Cover Facility (GLCF). This joint effort of the Institute for Advanced Computer Studies (UMIACS) and the Department of Geography has developed an operational data archiving and distribution system aimed at advancing current land cover research efforts. The success of the GLCF is tied closely to assessing user needs as well. As the timely delivery of data products to the research community. This paper discusses the development and implementation of a web-based interface that allows users to query the authors' data holdings and perform user requested processing tasks on demand. The GLCF takes advantage of a scaleable, high performance computing architecture for the manipulation of very large remote sensing data sets and the rapid spatial indexing of multiple format data types. The user interface has been developed with the cooperation of the Human-Computer Interaction Laboratory (HCIL) and demonstrates advances in spatial and temporal querying tools as well as the ability to overlay multiple raster and vector data sets. Their work provides one perspective concerning how critical earth science data may be handled in the near future by a coalition of distributed data centers
Keywords: Computer architecture; data archiving; data distribution system; Data systems; Distributed computing; Earth science data products; Earth science data system; ESIP; geographic information system; geographic information systems; Geography; geophysical measurement technique; geophysical signal processing; geophysical techniques; Geoscience; GIS; GLCF; Global Land Cover Facility; High performance computing; Indexing; information service; Information services; Institute for Advanced Computer Studies; land cover; NASA; next generation; PACS; Remote sensing; terrain mapping; UMIACS; University of Maryland; User interfaces; web-based interface

Digital watermarking using shuffling - M. Wu; Liu,B. (Image Processing, 1999. ICIP 99. Proceedings. 1999 International Conference on, 1999)
This paper applies shuffling to digital watermarking and data hiding. The data embedding capacity in the multimedia source generally varies significantly from one part of the source to another. Sequential embedding is very sensitive to noise which may cause synchronization problem; the common but conservative solution via partitioning an image into large segments and embedding only one bit per segment is wasteful of the data embedding capacity. This paper shows how random shuffling can be used to equalize the uneven distribution of embedding capacity. The effectiveness of random shuffling is demonstrated by analysis and experiments
Keywords: coding; data; embeddin; data; encapsulation; document; hiding; digital; image; processing; image; shuffling; shuffling; synchronization; data; source; random; watermarking; multimedia

Efficient algorithms for robust feature matching - Mount, Dave; Netanyahu,N. S; Le Moigne,J. (Pattern Recognition, 1999)
One of the basic building blocks in any point-based registration scheme involves matching feature points that areextracted from a sensed image to their counterparts in a reference image. This leads to the fundamental problem of point matching: Given two sets of points, find the (affine) transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between the two point sets be robust to these effects. We measure distances using the partial Hausdorff distance. Point matching can be a computationally intensive task, and a number of theoretical and applied approaches have been proposed for solving this problem. In this paper, we present two algorithmic approaches to the point matching problem, in an attempt to reduce its computational complexity, while still providing a guarantee of the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and- bound approach due to Huttenlocher and Rucklidge, (Technical Report 1321, Dept. of Computer Science, Cornell University, Ithaca, 1992; Proc. IEEE Conf. on Computer vision and Pattern Recognition, New York, 1993, pp. 705—706). We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. This algorithm operates within the framework of a branch-and-bound procedure, but employs point-to-point alignments to accelerate the search. We show that this combination retains many of the strengths of branch-and-bound search, but provides significantly faster search times by exploiting alignments. With high probability, this method succeeds in finding an approximately optimal match. We demonstrate the algorithms’ performances on both synthetically generated data points and actual satellite images.

Gate leakage current simulation by Boltzmann transport equation and its dependence on the gate oxide thickness - Han,Zhiyi; Lin,Chung-Kai; Goldsman,N.; Mayergoyz, Issak D; Yu,S.; Stettler,M. (Simulation of Semiconductor Processes and Devices, 1999. SISPAD '99. 1999 International Conference on, 1999)
As device dimensions shrink toward 0.1 mu;m, gate oxides are becoming so thin that MOSFET gate leakage current and oxide degradation are becoming limiting issues. We provide a more rigorous way to calculate gate leakage current. To achieve this we build upon the Spherical Harmonic Method of modeling, which deterministically solves the Boltzmann equation for an entire device. The method gives the distribution function and is 1000 times faster than MC. Once the distribution function is calculated, the tunneling probability is derived from the first principle WKB method. The barrier lowering effect is accounted for by the method of image charges. We calculate gate leakage current as a function of DC bias. The thermionic and tunneling components are compared at different DC bias points. The dependence of gate leakage current on gate oxide thickness is simulated
Keywords: 30; angstrom; 60; angstrom; Boltzmann; Bias; calculations; leakage; charges; spherical; component; tunneling; current; currents; semiconductor; dependence; method; dependence; MOSFET; barrier; device; effect; distribution; equation; DC; equation; MOSFET; WKB; function; first; harmonic; image; leakage; lowering; method; method; gate; model; thermionic; models; tunnelling; of; oxide; principle; probability; Boltzmann; simulation; gate; thickness; transport; WKB

Interhemispheric effects on map organization following simulated cortical lesions - Levitan,S.; Reggia, James A. (Artificial intelligence in medicine, 1999)

A model of lateralization and asymmetries in cortical maps - Levitan,S.; Stoica,I.; Reggia, James A. (Neural Networks, 1999. IJCNN'99. International Joint Conference on, 1999)

Nano-to-millimeter scale integrated systems - Last,H.R.; Deeds,M.; Garvick,D.; Kavetsky,R.; Sandborn,P. A.; Magrab,E. B.; Gupta,S.K. (Components and Packaging Technologies, IEEE Transactions on, 1999)
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

New algorithmic aspects of the Local Lemma with applications to routing and partitioning - Leighton,Tom; Rao,Satish; Srinivasan, Aravind (Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, 1999)

Perceptual Organization in Computer Vision - Boyer,K.L.; Sarkar,S.; Feldman,J.; Granlund,G.; Horaud,R.; Hutchinson,S.; Jacobs, David W.; Kak,A.; Lowe,D.; Malik,J. (Academic Press, 1999)

A practical approach to implementing real-time semantics - Bhat,G.; Cleaveland, Rance; L\üttgen,G. (Annals of Software Engineering, 1999)

Reports on the AAAI Fall Symposia - De Giacomo,Giuseppe; desJardins, Marie; Canamero,Dolores; Wasson,Glenn; Littman,Michael; Allwein,Gerard; Marriott,Kim; Meyer,Bernd; Webb,Barbara; Consi,Tom (AI Magazine, 1999)
The Association for the Advancement of Artificial Intelligence (AAAI) held its 1998 Fall Symposium Series on 23 to 25 October at the Omni Rosen Hotel in Orlando, Florida. This article contains summaries of seven of the symposia that were conducted: (1) Cognitive Robotics; (2) Distributed, Continual Planning; (3) Emotional and Intelligent: The Tangled Knot of Cognition; (4) Integrated Planning for Autonomous Agent Architectures; (5) Planning with Partially Observable Markov Decision Processes; (6) Reasoning with Visual and Diagrammatic Representations; and (7) Robotics and Biology: Developing Connections.

The role of convexity in perceptual completion: beyond good continuation - Liu,Zili; Jacobs, David W.; Basri,Ronen (Vision Research, 1999)
Since the seminal work of the Gestalt psychologists, there has been great interest in understanding what factors determine the perceptual organization of images. While the Gestaltists demonstrated the significance of grouping cues such as similarity, proximity and good continuation, it has not been well understood whether their catalog of grouping cues is complete — in part due to the paucity of effective methodologies for examining the significance of various grouping cues. We describe a novel, objective method to study perceptual grouping of planar regions separated by an occluder. We demonstrate that the stronger the grouping between two such regions, the harder it will be to resolve their relative stereoscopic depth. We use this new method to call into question many existing theories of perceptual completion (Ullman, S. (1976). Biological Cybernetics, 25, 1–6; Shashua, A., & Ullman, S. (1988). 2nd International Conference on Computer Vision (pp. 321–327); Parent, P., & Zucker, S. (1989). IEEE Transactions on Pattern Analysis and Machine Intelligence, 11, 823–839; Kellman, P. J., & Shipley, T. F. (1991). Cognitive psychology, Liveright, New York; Heitger, R., & von der Heydt, R. (1993). A computational model of neural contour processing, figure-ground segregation and illusory contours. In Internal Conference Computer Vision (pp. 32–40); Mumford, D. (1994). Algebraic geometry and its applications, Springer, New York; Williams, L. R., & Jacobs, D .W. (1997). Neural Computation, 9, 837–858) that are based on Gestalt grouping cues by demonstrating that convexity plays a strong role in perceptual completion. In some cases convexity dominates the effects of the well known Gestalt cue of good continuation. While convexity has been known to play a role in figure/ground segmentation (Rubin, 1927; Kanizsa & Gerbino, 1976), this is the first demonstration of its importance in perceptual completion.
Keywords: Amodal completion; Convexity; Good continuation; Grouping; Stereoscopic depth

Statecharts via process algebra - Liittgen,G.; Cleaveland, Rance (CONCUR'99: concurrency theory: 10th International Conference, Eindhoven, the Netherlands, August 24-27, 1999: proceedings, 1999)

Synthesis of embedded software from synchronous dataflow specifications - Bhattacharyya, Shuvra S.; Murthy,P. K; Lee,E. A (The Journal of VLSI Signal Processing, 1999)

Text Enhancement in Digital Video - Li,H.; Kia,O.; David Doermann (Proceedings of SPIE - Conference on Document Recognition and Retrieval VI, 1999)

Text enhancement in digital video using multiple frame integration - Huiping Li; David Doermann (Proceedings of the seventh ACM international conference on Multimedia (Part 1), 1999)
In this paper a multiple frame based technique to enhance text in digital video is presented. After extracting a reference text block, we use an image matching technique to find the corresponding text blocks in consecutive frames. We register these text blocks to subpixel levels by using image interpolation techniques to improve both correspondence and text resolution. The registered text blocks are averaged to obtain a new text block with a clean background and a higher resolution. Experiments conducted on several video sequences show that our enhancement scheme can improve the accuracy of commercial off-the-shelf OCR considerably.

Vision geometry VIII(Denver CO, 19-20 July 1999) - Latecki,L.J.; Melter,R.A.; Mount, Dave; Wu,A. Y (SPIE proceedings series, 1999)

An algorithm for wipe detection - M. Wu; Wolf,W.; Liu,B. (Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on, 1998)
The detection of transitions between shots in video programs is an important first step in analyzing video content. The wipe is a frequently used transitional form between shots. Wipe detection is more involved than the detection of abrupt and other gradual transitions because a wipe may take various patterns and because of the difficulty in discriminating a wipe from object and camera motion. In this paper, we propose an algorithm for detecting wipes using both structural and statistical information. The algorithm can effectively detect most wipes used in current TV programs. It uses the DC sequence which can be easily extracted from the MPEG stream without full decompression
Keywords: algorithm; image; analysis; video; content; video; DC; DETECTION; detection; statistical; domain; object; information; structural; information; video; motion; compressed; motion; shot; processing; programs; camera; programs; wipe; sequence; MPEG; sequences; signal; signal; stream; TV; transitions

Automatic Identification of Text In Digital Video Key Frames - Li,H.; David Doermann (Proceedings of International Conference on Pattern Recognition, 1998)
Scene and graphic text can provide important supplemental index information in video sequences. In this paper we address the problem automatically identifying text regions in digital video key frames. The text contained in video frames is typically very noisy because it is aliased and/or digitized at a much lower resolution than typical document images, making identification, extraction and recognition difficult. The proposed method is based on the use of a hybrid wavelet/neural network segmenter on a series of overlapping small windows to classify regions which contain text. To detect text over a wide range of font sizes, the method is applied to a pyramid of images and the regions identified at each level are integrated.

Automatic Text Detection and Tracking in Digital Video - Li,H.; David Doermann; Kia,O. (University of Maryland, College Park, 1998)
Text which either appears in a scene or is graphically added to video can provide an important supplemental source of index information as well as clues for decoding the video's structure and for classification. In this paper we present algorithms for detecting and tracking text components that appear within digital video frames. Our system implements a scale-space feature extractor that feeds an artificial neural processor to extract textual regions and track their movement over time. The extracted regions can then be used as input to an appropriate Optical Character Recognition system which produces indexible keywords.

Automatic Text Tracking In Digital Videos - Li,H.; David Doermann (Proceedings of IEEE 1998 Workshop on Multimedia Signal Processing, 1998)
We address the problem of automatically tracking moving text in digital videos. Our scheme consists of two separate processes: monitoring which detects the new text line entering a frame, and tracking which uses prediction techniques to reconcile the text from frame to frame. Temporal consistency allows one to monitor periodically and reduce the computation complexity. The tracking process uses a rapid prediction/search scheme to update the position of the text blocks between frames. We provide details of the implementation and results for text moving in the scene and text which moves as a result of camera motion.

Browsing Unix Directories With Dynamic Queries: An Evaluation of Three Information Display Techniques - Liao,Holmes; Osada,Masakazu; Shneiderman, Ben (Technical Reports of the Computer Science Department, 1998)
We designed, implemented, and evaluated an innovative concept fordynamic queries which involves the direct manipulation of small databases. Our domain was directories in a Unix file system. Dynamic queries allow users to formulate queries and explore the databases with graphical widgets, such as sliders and buttons, without requiring them to have any knowledge about the underlying structure of the database query languages, or command language syntax. Three interfaces for presenting directories were developed and tested with eighteen subjects in a within-subject design. The results of the formative evaluation yielded some useful guidelines for software designers. (Also cross-referenced as CAR-TR-605)
Keywords: Technical Report

Cellular automata models of self-replicating systems - Reggia, James A.; Chou,H. H.; Lohn,J. D (Advances in Computers, 1998)

Data object and label placement for information abundant visualizations - Li,Jia; Plaisant, Catherine; Shneiderman, Ben (Proceedings of the 1998 workshop on New paradigms in information visualization and manipulation, 1998)
Keywords: control panel; data object placement; Information Visualization; label placement; metrics; timelines; visual feedback

The detection of duplicates in document image databases - David Doermann; Huiping Li; Kia,Omid (Image and Vision Computing, 1998)
Document imaging technology has developed to the point where it is not uncommon for organizations to scan large numbers of documents into databases with little or no index information. This may be done for archival purposes with an index as simple as a case number, or with the ultimate goal of automatically extracting index information for content-based queries. Maintaining the integrity of such a database is difficult, however, especially in a distributed environment where copies of the same documents may be scanned at different times.In this paper we present a novel approach to detecting duplicate documents in very large databases using only features extracted from the image. The method is based on a robust `signature' extracted from each document image which is used to index into a table of previously processed documents. The system is able to deal with differences between scanned document instances such resolution, skew and image quality. The approach has a number of advantages over OCR or other recognition-based methods including speed and robustness to imaging distortions. To justify the approach and demonstrate its scalability, we have developed a simulator which allows us to change parameters of the system and examine performance while processing millions of document signatures. A complete system has been implemented and tested on a collection of technical articles and memos.
Keywords: Document image databases; Document indexing; Duplicate detection; Shape coding

Distance learning: is it the end of education as most of us know it? - Laurillard,Diana; Preece,Jenny; Shneiderman, Ben; Neal,Lisa; Wærn,Yvonne (CHI 98 conference summary on Human factors in computing systems, 1998)
Keywords: distance learning; education; Internet; Web

Extension of Spherical Harmonic Method to RF Transient Regime - Lin,C. K.; Goldsman,N.; Chang,C. H.; Mayergoyz, Issak D; Aronowitz,S.; Dong,J.; Belova,N. (Simulation of semiconductor processes and devices 1998: SISPAD 98, 1998)
The space and time dependent electron Boltzmann transport equation (BTE)is solved sclf-consistently with the Poisson and transient hole current-continuity equation. A transient Spherical Harmonic expansion method is used to solve the BTE. By this method we can efficiently solve the BTE in the RF regime to observe how the complete distribution function responds to a rapid transient. Calculations on a BJT, which give the time dependent distribution function over a large energy range 0-3eV, throughout the device, as well as average quantities, require only 40 minutes CPU time on an Alpha workstation.

Facilitating Network Data Exploration with Query Previews: A Study of User Performance and Preference - Tanin,Egemen; Lotem,Amnon; Haddadin,Ihab; Shneiderman, Ben; Plaisant, Catherine; Slaughter,Laura (Technical Reports of the Computer Science Department, 1998)
Current network data exploration systems which use command languages (e.g.SQL) or form fill-in interfaces fail to give users an indication of the distribution of data items. This leads many users to waste time posing queries which have zero-hit or mega-hit result sets. Query previewing is a novel visual approach for browsing huge networked information warehouses. Query previews supply data distribution information about the database that is being searched and give continuous feedback about the size of the result set for the query as it is being formed. Our within-subjects empirical comparison studied 12 subjects using a form fill-in interface with and without query previews. We found statistically significant differences showing that query previews sped up performance 1.6 to 2.1 times and led to higher subjective satisfaction. (Also cross-referenced as UMIACS-98-14)
Keywords: Technical Report

Hydrodynamic Device Simulation with New State Variables Specially Chosen a Block Gummel Iterative Approach - Liang,W.; Kerr,D. C.; Goldsman,N.; Mayergoyz, Issak D (VLSI DESIGN, 1998)
A new numerical formulation for solving the hydrodynamic model of semiconductor devicesis presented. Themethod is based on using new variables to transform the conventional hydrodynamic equations into forms which facilitatenumerical evaluation with a block Gum- mel approach. To demonstrate the new method, we apply it to model a 0.35 wn 2-D LDD MOSFET, where robust convergence properties are observed.

Improved algorithms for robust point pattern matching and applications to image registration - Mount, Dave; Netanyahu,Nathan S.; LeMoigne,Jacqueline (Proceedings of the fourteenth annual symposium on Computational geometry, 1998)

Incorporating String Search in a Hypertext System:User Interface and Signature File Design Issues - Faloutsos,Christos; Lee,Raymond; Plaisant, Catherine; Shneiderman, Ben (Technical Reports of the Computer Science Department, 1998)
Hypertext systems provide an appealing mechanism forinformally browsing databases by traversing selectable links. However, in many fact finding situations string search is an effective complement to browsing. This paper describes the application of the signature file method to achieve rapid and convenient string search in small personal computer hypertext environments. The method has been implemented in a prototype, as well as in a commercial product. Performance data for search times and storage space are presented from a commercial hypertext database. User interface issues are then discussed. Experience with the string search interface indicates that it was used sucessfully by novice users. (Also cross-referenced as CAR-TR-448)
Keywords: Technical Report

Integrated design and rapid manufacturing over the Internet - Rajagopalan,S.; Pinilla,J. M.; Losleben,P.; Tian,Q.; Gupta,S.K. (1998)
An Internet-based infrastructure is being developed inorder to provide designers with access to multiple layered- manufacturing services. The design domain being addressed is that of small mechanisms or electro-mechanical assemblies that would be used in robots or other mechatronic devices. The approach presented relies on the formalization of the data exchange interface between designers and manufacturers. The primary operatives in this system are Design Clients, Manufacturing Services and Process Brokers. The Design Client allows designers to submit completed designs for algorithmic decomposition, or alternately, to compose a design from primitives and library components that have been primed with some process-related information. During this early phase, the Manufacturing Service consists of a highly automated machine that can be used to build ceramic parts, and the associated software components for design decomposition, process planning and machine control. In later phases, multiple service providers will be made accessible. The Process Broker implements a number of supporting services including process selection and optimal part orientation. Future broker services will include manufacturability analysis, directory services and accreditation etc. Currently, this interface is being built and evaluated internally at Stanford and CMU. It will be made available for use by other selected universities in the near future.

LifeLines: using visualization to enhance navigation and analysis of patient records - Plaisant, Catherine; Mushlin,R.; Snyder,A.; Li,J.; Heller,D.; Shneiderman, Ben (In Proceedings of the 1998 American Medical Informatic Association Annual Fall SymposiumProc AMIA Symp, 1998)
LifeLines provide a general visualization environment for personal histories. We explore its use for clinical patient records. A Java user interface is described, which presents a one-screen overview of a computerized patient record using timelines. Problems, diagnoses, test results or medications can be represented as dots or horizontal lines. Zooming provides more details; line color and thickness illustrate relationships or significance. The visual display acts as a giant menu, giving direct access to the data.

LifeLines: using visualization to enhance navigation and analysis of patient records. - Plaisant, Catherine; Mushlin,R.; Snyder,A.; Li,J.; Heller,D.; Shneiderman, Ben (Proceedings of the AMIA Symposium, 1998)
LifeLines provide a general visualization environment for personal histories. We explore its use for clinical patient records. A Java user interface is described, which presents a one-screen overview of a computerized patient record using timelines. Problems, diagnoses, test results or medications can be represented as dots or horizontal lines. Zooming provides more details; line color and thickness illustrate relationships or significance. The visual display acts as a giant menu, giving direct access to the data.

Low-bandwidth routing and electrical power networks - Cook,Doug; Faber,Vance; Marathe,Madhav; Srinivasan, Aravind; Sussmann,Yoram (Automata, Languages and ProgrammingAutomata, Languages and Programming, 1998)
Given a graph G and a (multi-)set of pairs of vertices in it, the classical NP-hard maximum edge-disjoint-paths problem (MDP) is to connect as many of the given pairs as possible using pairwise edge-disjoint paths in G . We study a relative of this problem: we have a network with fixed link capacities that may have to service large demands when necessary. In particular, individual demands are allowed to exceed capacities, and thus flows for some request pairs necessarily have to be split into different flow-paths. This is the framework for computational problems arising from: (i) electrical power networks due to the proposed deregulation of the electric utility industry in the USA, and (ii) applications such as real-time Internet services (e.g., telephone, fax, video). We show that these problems come in a few variants, some efficiently solvable and many NP -hard; we also present approximation algorithms for many of the NP -hard variants presented. Some of our approximation algorithms benefit from certain improved tail estimates that we derive; the latter also yield improved approximations for a family of packing integer programs.

Models and high-performance algorithms for global BRDF retrieval - Zengyan Zhang; Kalluri, SNV; JaJa, Joseph F.; Liang,Shunlin; Townshend,J.R.G. (Computational Science Engineering, IEEE, 1998)
The authors describe three models for retrieving information related to the scattering of light on the Earth's surface. Using these models, they've developed algorithms for the IBM SP2 that efficiently retrieve this information
Keywords: algorithms; BRDF; Earth; geomorphology; geophysical; global; high-performance; IBM; information; light; machines; models; Parallel; processing; reflectivity; retrieval; retrieval; scattering; signal; SP2; surface

Multicommodity flow and circuit switching - Leighton,T.; Rao,S.; Srinivasan, Aravind (, Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998, 1998)
Given a set of request pairs in a network, the problem of routing virtual circuits with low congestion is to connect each pair by a path so that few paths use the same link in the network. We build on an earlier multicommodity flow based approach of Leighton and Rao (1996) to show that short flow paths lead to path selections with low congestion. This shows that such good path selections exist for constant-degree expanders with strong expansion, generalizing a result of (Broder et al., 1994). We also show, for infinitely many n, n-vertex undirected graphs Gn along with a set T of connection requests, such that: T is fractionally realizable using flow-paths that impose a (fractional) congestion of at most 1; but any rounding of such a flow to the given set of flow-paths, leads to a congestion of Ω(log n/log log n). This is progress on a long-standing open problem
Keywords: Application software; Bandwidth; circuit switching; Computer science; constant-degree expanders; graph theory; High speed integrated circuits; Integrated circuit technology; Laboratories; low congestion; MATHEMATICS; multicommodity flow; National electric code; network routing; path selections; Routing; short flow paths; Switching circuits; switching theory; undirected graphs; virtual circuit routing

Phylogenetic relationships of platyhelminthes based on 18S ribosomal gene sequences - Campos,A.; Cummings, Michael P.; Reyes,J. L; Laclette,J. P (Mol Phylogenet Evol, 1998)
Nucleotide sequences of 18S ribosomal RNA from 71 species of Platyhelminthes, the flatworms, were analyzed using maximum likelihood, and the resulting phylogenetic trees were compared with previous phylogenetic hypotheses. Analyses including 15 outgroup species belonging to eight other phyla show that Platyhelminthes are monophyletic with the exception of a sequence putatively from Acoela sp., Lecithoepitheliata, Polycladida, Tricladida, Trematoda (Aspidobothrii + Digenea), Monogenea, and Cestoda (Gyrocotylidea + Amphilinidea + Eucestoda) are monophyletic groups. Catenulids form the sister group to the rest of platyhelminths, whereas a complex clade formed by Acoela, Tricladida, "Dalyellioida", and perhaps "Typhloplanoida" is sister to Neodermata. "Typhloplanoida" does not appear to be monophyletic; Fecampiida does not appear to belong within "Dalyellioida," nor Kalyptorhynchia within "Typhloplanoida." Trematoda is the sister group to the rest of Neodermata, and Monogenea is sister group to Cestoda. Within Trematoda, Aspidobothrii is the sister group of Digenea and Heronimidae is the most basal family in Digenea. Our trees support the hypothesis that parasitism evolved at least twice in Platyhelminthes, once in the ancestor to Neodermata and again in the ancestor of Fecampiida, independently to the ancestor of putatively parasitic "Dalyellioida."

Probabilistic resource failure in real-time process algebra - Philippou,A.; Cleaveland, Rance; Lee,I.; Smolka,S.; Sokolsky,O. (CONCUR'98 Concurrency Theory, 1998)

Self-replicating structures: evolution, emergence, and computation - Reggia, James A.; Lohn,J. D; Chou,H. H. (Artificial Life, 1998)

Semantics for Disjunctive and Normal Disjunctive Logic Programs - Lobo,J.; Minker, Jack; Rajasekar,A. (Handbook of logic in artificial intelligence and logic programming, 1998)

The Solution Structure and Dynamics of the Pleckstrin Homology Domain of G Protein-coupled Receptor Kinase 2 (β-Adrenergic Receptor Kinase 1) A BINDING PARTNER OF Gβγ SUBUNITS - Fushman, David; Najmabadi-Haske,Taraneh; Cahill,Sean; Zheng,Jie; LeVine,Harry; Cowburn,David (Journal of Biological ChemistryJ. Biol. Chem., 1998)
The solution structure of an extended pleckstrin homology (PH) domain from the β-adrenergic receptor kinase is obtained by high resolution NMR. The structure establishes that the β-adrenergic receptor kinase extended PH domain has the same fold and topology as other PH domains, and there are several unique features, most notably an extended C-terminal α-helix that behaves as a molten helix, and a surface charge polarity that is extensively modified by positive residues in the extended α-helix and the C terminus. These observations complement biochemical evidence that the C-terminal portion of this PH domain participates in protein-protein interactions with Gβγ subunits. This suggests that the C-terminal segment of the PH domain may function to mediate protein-protein interactions with the targets of PH domains.

Text Extraction and Recognition in Digital Video - Li,H.; David Doermann; Kia,O. (Proceedings of Third IAPRWorkshop on Document Analysis Systems, 1998)

Trends in the Early Careers of Life Scientists - Tilghman,S; Astin,HS; Brinkley,W; Chilton,MD; Cummings, Michael P.; Ehrenberg,RG; Fox,MF; Glenn,K; Green,PJ; Hans,S; Kelman,A; LaPidus,J; et al. (National Academy Press, 1998)

Trends in the early careers of life scientists - Preface and executive summary - Tilghman,S; Astin,HS; Brinkley,W; Chilton,MD; Cummings, Michael P.; Ehrenberg,RG; Fox,MF; Glenn,K; Green,PJ; Hans,S; Kelman,A; LaPidus,J; et al. (Mol Biol Cell, 1998)

Visualizing medical records with LifeLines - Plaisant, Catherine; Heller,Daniel; Li,Jia; Shneiderman, Ben; Mushlin,Rich; Karat,John (CHI 98 conference summary on Human factors in computing systems, 1998)
Keywords: healthcare; History; medical record; overview; timeline; Visualization

Watermarking for image authentication - M. Wu; Liu,Bede (Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on, 1998)
A data embedding method is proposed for image authentication based on table look-up in frequency domain. A visually meaningful watermark and a set of simple features are embedded invisibly in the marked image, which can be stored in the compressed form. The scheme can detect and localize alterations of the original image, such as the tampering of images exported from a digital camera
Keywords: alterations; analysis; image; analysis; message; authentication; image; authentication; table; camera; frequency; coding; image; colour; compression; frequency-domain; detection; alterations; domain; image; EMBEDDING; image; image; compressed; image; ownership; localisation; color; look-up; watermarking; data; lookup; method; digital; protection; table; storage; data; tampering; marked

Is the Web really different from everything else? - Shneiderman, Ben; Nielsen,Jakob; Butler,Scott; Levi,Michael; Conrad,Frederick (CHI 98 conference summary on Human factors in computing systems, 1998)
Keywords: design; user experience; World Wide Web

2-D MOSFET modeling including surface effects and impact ionization by self-consistent solution of the Boltzmann, Poisson, and hole-continuity equations - Liang,Wenchao; Goldsman,N.; Mayergoyz, Issak D; Oldiges,P.J. (Electron Devices, IEEE Transactions on, 1997)
We present a new two-dimensional (2-D) MOSFET simulation method achieved by directly solving the Boltzmann transport equation for electrons, the hole-current continuity equation, and the Poisson equation self-consistently. The spherical harmonic method is used for the solution of the Boltzmann equation. The solution directly gives the electron distribution function, electrostatic potential, and the hole concentration for the entire 2-D MOSFET. Average quantities such as electron concentration and electron temperature are obtained directly from the integration of the distribution function. The collision integral is formulated to arbitrarily high spherical harmonic order, and new collision terms are included that incorporate effects of surface scattering and electron-hole pair recombination/generation. I-V characteristics, which agree with experiment, are calculated directly from the distribution function for an LDD submicron MOSFET. Electron-hole pair generation due to impact ionization is also included by direct application of the collision integral. The calculations are efficient enough for day-to-day engineering design on workstation-type computers
Keywords: 2D; characteristics; LDD; concentration; electron; concentration; hole-continuity; density; electron-hole; density; impact; device; distribution; effects; surface; equation; collision; equation; I-V; equation; MOSFET; electron; equations; impact; equations; semiconductor; function; electron; generation; electron-hole; harmonic; integral; electron; ionisation; integral; ionization; self-consistent; method; Boltzmann; method; surface; modeling; Boltzmann; models; surface; MOSFET; MOSFET; Poisson; pair; potential; hole; recombination; electrostatic; recombination; hole; scattering; scattering; two-dimensional; simulation; solution; spherical; submicron; temperature; electron-hole; transport

An algebraic theory of multiple clocks - Cleaveland, Rance; L\üttgen,G.; Mendler,M. (CONCUR'97: Concurrency Theory, 1997)

APGAN and RPMC: Complementary heuristics for translating DSP block diagrams into efficient software implementations - Bhattacharyya, Shuvra S.; Murthy,P. K; Lee,E. A (Design Automation for Embedded Systems, 1997)

Approximating hyper-rectangles: learning and pseudo-random sets - Auer,Peter; Long,Philip M.; Srinivasan, Aravind (Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, 1997)
Keywords: approximations of distributions; derandomization; explicit constructions; machine learning; multiple-instance learning; PAC learning; pseudorandomness; Ramsey graphs; random graphs; rectangles; sample complexity

Automatic discovery of self-replicating structures in cellular automata - Lohn,J. D; Reggia, James A. (Evolutionary Computation, IEEE Transactions on, 1997)

Challenges in sending large radiology images over military communications channels - Cleary,K.R.; Levine,B.A.; Norton,G.S.; Mundur,P.V. (Proceedings of SPIE, 1997)

Comments on "Towards a framework for software measurement validation" - Morasca,S.; Briand,L.C.; Basili, Victor R.; Weyuker,E.J.; Zelkowitz, Marvin V; Kitchenham,B.; Lawrence Pfleeger,S.; Fenton,N. (Software Engineering, IEEE Transactions on, 1997)
A view of software measurement that disagrees with the model presented by Kitchenham, Pfleeger, and Fenton (1995), is given. Whereas Kitchenham et al. argue that properties used to define measures should not constrain the scale type of measures, the authors contend that that is an inappropriate restriction. In addition, a misinterpretation of Weyuker's (1988) properties is noted.
Keywords: measurement; metrics; software; testing; program; validation; program; verification; software

Compressed Domain video indexing techniques using DCT and motion vector information in MPEG video - Kobla,V.; David Doermann; Lin,K-I.; Faloutsos,C. (Proceedings of SPIE - conference on Storage and Retrieval for Image and Video Databases V, 1997)
Development of various multimedia applications hinges on the availability of fast and e cient storage, brows-ing, indexing, and retrieval techniques. Given that video is typically stored e ciently in a compressed format, if we can analyze the compressed representation directly, we can avoid the costly overhead of decompressing and operating at the pixel level. Compressed domain parsing of video has been presented in earlier work where a video clip is divided into shots, subshots, and scenes. In this paper, we describe key frame selection, feature extraction, and indexing and retrieval techniques that are directly applicable to MPEG compressed video. We develop a frame-type independent representation of the various types of frames present in an MPEG video in which all frames can be considered equivalent. Features are derived from the available DCT, macroblock, and motion vector information and mapped to a low-dimensional space where they can be accessed with standard database techniques. The spatial information is used as primary index while the temporal information is used to enhance the robustness of the system during the retrieval process. The techniques presented enable fast archiv- ing, indexing, and retrieval of video. Our operational prototype typically takes a fraction of a second to retrieve similar video scenes from our database, with over 95% success.

The Detection of Duplicates in Document Image Databases - David Doermann; Li,H.; Kia,O. (ICDAR, 1997)
The problem of off-line handwritten character recognition has eluded a satisfactory solution for several decades. Researchers working in the area of on-line recognition have had greater success, but the possibility of extracting on-line information from static images has not been fully explored. The experience of forensic document examiners assures us that in many cases, such information can be successfully recovered.We outline the design of a system for the recovery of temporal information from static handwritten images. We provide a taxonomy of local, regional and global temporal clues which are often found in hand-written samples, and describe methods for recovering these clues from the image. We show how this system can benefit from obtaining a comprehensive understanding of the handwriting signal and a detailed analysis of stroke and sub-stroke properties. We suggest that the recovery task requires that we break away from traditional thresholding and thinning techniques, and we provide a framework for such analysis. We demonstrate how isolated temporal clues can reliably be extracted from this framework and propose a control structure for integrating the partial information. We show how many seemingly ambiguous situations can be resolved by the derived clues and our knowledge of the writing process, and provide several examples to illustrate our approach. The support of this research by the Ricoh Corporation is gratefully acknowledged.

Dynamic priorities for modeling real-time - Bhat,G.; Cleaveland, Rance; L\üttgen,G. (Proc. of the Formal Description Techniques and Protocol Specification, Testing and Verification (FORTE X/PSTV XVII’97), 1997)

Editorial: Evaluation and assessment in software engineering - Kitchenham,B.; Brereton,P.; Budgen,D.; Linkman,S.; Almstrum,V. L; Pfleeger,S. L; Zelkowitz, Marvin V; Wallace,D. (Information and Software Technology, 1997)

Efficient algorithms for robust feature matching - Mount, Dave; Netanyahu,N. S; Le Moigne,J. (Image Registration Workshop Proceedings, 1997)
One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from the sensed image to their counterparts in the reference image. This leads to the fundamental problem of point matching: given two sets of points, find the affine transformation that transforms one point set so that its distance from the other point set is minimized. Because of measurement errors and the presence of outlying data points, it is important that the distance measure between two point sets be robust to these effects. We measure distances using the generalized Hausdorff distance. Point matching can be a computationally intensive task, and there have been a number of algorithms and approaches proposed for solving this problem both theoretical and applied. We present two approaches to the point matching problem, in an attempt to reduce the computational complexity of the problem, while still providing guarantees on the quality of the final match. Our first method is an approximation algorithm, which is loosely based on a branch-and-bound approach due to Huttenlocher and Rucklidge. We show that by varying the approximation error bounds, it is possible to achieve a tradeoff between the quality of the match and the running time of the algorithm. Our second method involves a Monte Carlo method for accelerating the search process used in the first algorithm. With high probability this method succeeds in finding an approximately optimal match. We establish the efficiency of our approaches empirically.

Fast algorithms for estimating aerosol optical depth and correcting thematic mapper imagery - Fallah-Adl,H.; JaJa, Joseph F.; Liang, S. (The Journal of Supercomputing, 1997)
Remotely sensed images collected by satellites are usually contaminated by the effects of atmospheric particles through the absorption and scattering of radiation from the earth's surface. The objective of atmospheric correction is to retrieve the surface reflectance from remotely sensed imagery by removing the atmospheric effects, which is usually performed in two steps. First, the optical characteristics of the atmosphere are estimated and then the remotely sensed imagery is corrected by inversion procedures that derive the surface reflectance. In this paper we introduce an efficient algorithm to estimate the optical characteristics of the Thematic Mapper imagery and to remove the atmospheric effects from it. Our algorithm introduces a set of techniques to significantly improve the quality of the retrieved images. We pay particular attention to the computational efficiency of the algorithm, thereby allowing us to correct large TM images quickly. We also provide a parallel implementation of our algorithm and show its portability and scalability on three parallel machines.

Joint minimization of code and data for synchronous dataflow programs - Murthy,P. K; Bhattacharyya, Shuvra S.; Lee,E. A (Formal Methods in System Design, 1997)

Optimizing synchronization in multiprocessor DSP systems - Bhattacharyya, Shuvra S.; Sriram,S.; Lee,E. A (Signal Processing, IEEE Transactions on, 1997)

Regulation of Cable Television - Agrawala, Ashok K.; CILINGIROGLU,A.; Lee,S. (The Froehlich/Kent Encyclopedia of Telecommunications: Volume 15-Radio Astronomy to Submarine Cable SystemsThe Froehlich/Kent Encyclopedia of Telecommunications: Volume 15-Radio Astronomy to Submarine Cable Systems, 1997)

User Interfaces for a Complex Robotic Task: A Comparison of Tiles vs. Overlapped Windows - Lane,J. Corde; Kuester,Steven P; Shneiderman, Ben (Institute for Systems Research Technical Reports, 1997)
High complexity tasks, such as remote teleoperation of robotic vehicles, often require multiple windows. For these complex tasks, the windows necessary for task completion, may occupy more area than available on a single visual display unit (VDU). Since the focus of the robotic task constantly changes, modular control panels that can be opened, closed, and moved on the screen are invaluable to the operator. This study describes a specific robotic task and the need for a multi window interface that can be easily manipulated. This paper examines two multi-window management strategies: tiled (fixed size) and arbitrary overlap. Multi-window searches were performed using the two management styles and they were compared on the basis of search completion time and error rates. Results with 35 novice users showed faster completion times for the tiled management strategy than for the arbitrary overlap strategy. Over factors such as the number of windows available, the number of displayed windows workload of opening or closing windows, and effect of learning are discussed.
Keywords: Human computer interaction; overlapped; Systems Integration Methodology; tiled; user interface design; window management

The vegetation canopy lidar mission - Dubayah, R.; Blair,J. B.; Bufton,J. L.; Clark,D. B.; JaJa, Joseph F.; Knox,R.; Luthcke,S. B.; Prince,S.; Weishampel,J. (Proceedings of Land Satellite Information in the Next Decade, II: Sources and Applications. Bethesda (MD): American Society of Photogrammetry and Remote Sensing, 1997)
The Vegetation Canopy Lidar (VCL) is the first selected mission of NASA’s new EarthSystem Science Pathfinder program. The principal goal of VCL is the characterization of the three-dimensional structure of the earth; in particular, canopy vertical and horizontal structure and land surface topography. Its primary science objectives are: landcover characterization for terrestrial ecosystem modeling, monitoring and prediction; landcover characterization for climate modeling and prediction; and, production of a global reference data set of topographic spot heights and transects. VCL will provide unique data sets for understanding important environ- mental issues including climatic change and variability, biotic erosion and sustainable landuse, and will dramatically improve our estimation of global biomass and carbon stocks, fractional forest cover, forest extent and condition. It will also provide canopy data critical for biodiversity, natural hazard, and climate studies. Scheduled for launch in early 2000, VCL is an active lidar remote sensing system consisting of a five-beam instrument with 25 m contiguous along track resolution. The five beams are in a circular configuration 8 km across and each beam traces a separate ground track spaced 2 km apart, eventually producing 2 km coverage between 65° N and S. VCL’s core measurement objectives are: (1) canopy top heights; (2) vertical distribution of intercepted surfaces (e.g. leaves and branches); and, (3) ground surface topographic elevations. These measurements are used to derive a variety of science data products including canopy heights, canopy vertical distribution, and ground elevations gridded monthly at 1° resolution and every 6 months at 2 km resolution, as well as a 2 km fractional forest cover product.

Archiving, indexing, and retrieval of video in compressed domain - Kobla,V.; David Doermann; Lin,K-I. (SPIEConference on Multimedia Storage and Archiving Systems, 1996)

Basic Electric Circuit Theory: A One-Semester Text - Mayergoyz, Issak D; Lawson,Wes (Academic Press, 1996)
This is the only book on the market that has been conceived and deliberately written as a one-semester text on basic electric circuit theory. As such, this book employs a novel approach to the exposition of the material in which phasors and ac steady-state analysis are introduced at the beginning. This allows one to use phasors in the discussion of transients excited by ac sources, which makes the presentation of transients more comprehensive and meaningful. Furthermore, the machinery of phasors paves the road to the introduction of transfer functions, which are then used in the analysis of transients and the discussion of Bode plots and filters. Another salient feature of the text is the consolidation into one chapter of the material concerned with dependent sources and operational amplifiers. Dependent sources are introduced as linear models for transistors on the basis of small signal analysis. In the text, PSpice simulations are prominently featured to reinforce the basic material and understanding of circuit analysis.Key Features* Designed as a comprehensive one-semester text in basic circuit theory* Features early introduction of phasors and ac steady-state analysis* Covers the application of phasors and ac steady-state analysis* Consolidates the material on dependent sources and operational amplifiers* Places emphasis on connections between circuit theory and other areas in electrical engineering* Includes PSpice tutorials and examples* Introduces the design of active filters* Includes problems at the end of every chapter* Priced well below similar books designed for year-long courses
Keywords: Electric circuits; Technology & Engineering / Electrical

Computational studies of synaptic alterations in Alzheimer’s disease - Ruppin,E.; Horn,D.; Levy,N.; Reggia, James A. (Neural modeling of brain and cognitive disorders, 1996)

The Concurrency Factory: A development environment for concurrent systems - Cleaveland, Rance; Lewis,P.; Smolka,S.; Sokolsky,O. (Computer Aided Verification, 1996)

Efficient algorithms for estimating atmospheric parameters for surface reflectance retrieval - Fallah-Adl,H.; JaJa, Joseph F.; Liang,Shunlin (Parallel Processing, 1996., Proceedings of the 1996 International Conference on, 1996)
The objective of atmospheric correction is to retrieve the surface reflectance from remotely sensed imagery by removing the atmospheric effects. We introduce an efficient algorithm to estimate the optical characteristics of the TM imagery and to remove the atmospheric effects from it. Our algorithm introduces a set of techniques to significantly improve the quality of the retrieved images. We pay a particular attention to the computational efficiency of the algorithm thereby allowing us to correct large TM images quite fast. We also provide a parallel implementation of our algorithm and show its portability and scalability on several parallel machines
Keywords: Atmospheric; correction; atmospheric; effects; atmospheric; imagery; scalability; surface; parameters; portability; remotely; reconstruction; photoreflectance; remote; reflectance; reflectance; surface; retrieval; image; sensed; sensing

The empirical investigation of Perspective-Based Reading - Basili, Victor R.; Green,Scott; Laitenberger,Oliver; Lanubile,Filippo; Shull, Forrest; Sørumgård,Sivert; Zelkowitz, Marvin V (Empirical Software Engineering, 1996)
We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.
Keywords: Computer; Science

Evolutionary biology of parasitic platyhelminths: The role of molecular phylogenetics - Blair,D; Campos,A.; Cummings, Michael P.; Laclette,J. P (Parasitol Today, 1996)
As our appreciation of the diversity within the flatworms has grown, so too has our curiosity about the ways in which these varied creatures are related to one another. In particular, the parasitic groups (trematodes, cestodes and monogeneans have been the focus of enquiry. Until recently, morphology, anatomy and life histories have provided the raw data for building hypotheses on relationships. Now, ultrastructural evidence, and most recently, molecular data from nucleic acid sequences, have been brought to bear on the topic. Here, David Blair, Andrés Campos, Michael Cummings and Juan Pedro Laclette discuss the ways in which molecular data, in particular, are helping us recognize the various lineages of flatworms.

Fast algorithms for removing atmospheric effects from satellite images - Fallah-Adl,H.; JaJa, Joseph F.; Liang, S.; Townshend,J.; Kaufman,Y.J. (Computational Science Engineering, IEEE, 1996)
The varied features of the earth's surface each reflect sunlight and other wavelengths of solar radiation in a highly specific way. This principle provides the foundation for the science of satellite based remote sensing. A vexing problem confronting remote sensing researchers, however, is that the reflected radiation observed from remote locations is significantly contaminated by atmospheric particles. These aerosols and molecules scatter and absorb the solar photons reflected by the surface in such a way that only part of the surface radiation can be detected by a sensor. The article discusses the removal of atmospheric effects due to scattering and absorption, ie., atmospheric correction. Atmospheric correction algorithms basically consist of two major steps. First, the optical characteristics of the atmosphere are estimated. Various quantities related to the atmospheric correction can then be computed by radiative transfer algorithms, given the atmospheric optical properties. Second, the remotely sensed imagery is corrected by inversion procedures that derive the surface reflectance. We focus on the second step, describing our work on improving the computational efficiency of the existing atmospheric correction algorithms. We discuss a known atmospheric correction algorithm and then introduce a substantially more efficient version which we have devised. We have also developed a parallel implementation of our algorithm
Keywords: algorithms; reflectivity; remote; Atmospheric; based; computing; image; correction; atmospheric; effects; atmospheric; efficiency; inversion; enhancement; parallel; imagery; satellite; images; solar; implementation; reflected; particles; computational; photons; surface; procedures; parallel; radiation; atmospheric; radiation; remote; reflectance; atmospheric; remote; research; remotely; sensed; sensing; sensing; sensing; satellite; techniques; geophysics

Feature Normalization for Video Indexing and Retrieval - Kobla,Vikrant; David Doermann; Lin,King-Ip (David); Faloutsos,Christos (University of Maryland, College Park, 1996)
Fast and efficient storage, browsing, indexing, and retrieval of video is necessary for the development of various multimedia database applications. Given that video is typically stored efficiently in a compressed format, if we can analyze the compressed representation directly, we can avoid the costly overhead of decompressing and operating at the pixel level. Compressed domain parsing of video has been presented in earlier work where key frames are identified for shots, subshots, and scenes. In this paper, we describe key frame selection, feature extraction, indexing, and retrieval techniques that are directly applicable to MPEG-compressed video. We develop a frame-type independent representation of the various types of frames present in an MPEG video in which all frames can be considered equivalent. Features are derived from the available DCT, macroblock, and motion vector information and mapped to a low-dimensional space where they can be accessed using standard database techniques. The spatial information is used as primary index while the temporal information is used to enhance the robustness of the system during the retrieval process. The techniques presented enable fast archiving, indexing, and retrieval of video. Our operational prototype typically takes a fraction of a second to retrieve similar video scenes from our database, with over 95% success.

Identification of the Binding Site for Acidic Phospholipids on the PH Domain of Dynamin: Implications for Stimulation of GTPase Activity - Zheng,Jie; Cahill,Sean M.; Lemmon,Mark A.; Fushman, David; Schlessinger,Joseph; Cowburn,David (Journal of Molecular Biology, 1996)
It has recently been suggested that pleckstrin homology (PH) domains bind specifically to phospholipids, with phosphatidylinositol-4,5-bisphosphate (PtdIns(4,5)P2) being most strongly bound. This observation suggests that PH domains may be responsible for membrane association of proteins in which they occur. Further, this membrane association may be regulated by enzymes that modify lipid head groups to which PH domains may bind. We have studied the binding of phospholipids to the PH domain of human dynamin, a 100 kDa GTPase that is involved in the initial stages of endocytosis. We describe a rapid method for screening PH domain/ligand interactions that gives precise binding constants. We confirm that PtdIns(4,5)P2can bind to dynamin PH domain, although not in an aggregated state. Using NMR spectroscopy, we have mapped a specific site on the surface of dynamin PH domain of which binding of gIns(1,4,5)P3(the head-group skeleton of PtdIns(4,5)P2) occurs. The relative affinity of acidic phospholipids for dynamin PH domain correlates with their ability to activate the GTPase of dynamin. We propose, therefore, that the interaction of these phospholipids with dynamin is likely to occurviathe PH domain. Given the fact that PH domains are often found in pro- teins associated with GTPase activity, or in guanine nucleotide exchange factors, we suggest that one role of PH domains may be to couple phosphatidylinositol signalling to GTP hydrolysis.
Keywords: Fluorescence; ligand binding; NMR; PH domain; phospholipid

Inferring phylogenies from DNA sequence data: The effects of sampling - Otto,S. P; Cummings, Michael P.; Wakeley,J. (New Uses for New PhylogeniesNew Uses for New Phylogenies, 1996)

Modeling and verifying distributed systems using priorities: A case study - Cleaveland, Rance; Natarajan,V.; Sims,S.; Luettgen,G. (Software - Concepts and Tools, 1996)

Positional sequencing by hybridization - Hannenhalli, Sridhar; Feldman,William; Lewis,Herbert F.; Skiena,Steven S.; Pevzner,Pavel A. (Computer applications in the biosciences : CABIOS, 1996)
Sequencing by hybridization (SBH) is a promising alternative to the classical DNA sequencing approaches. However, the resolving power of SBH is rather low: with 64kb sequencing chips, unknown DNA fragments only as long as 200 bp can be reconstructed in a single SBH experiment. To improve the resolving power of SBH, positional SBH (PSBH) has recently been suggested; this allows (with additional experimental work) approximate positions of every l-tuple in a target DNA fragment to be measured. We study the positional Eulerian path problem motivated by PSBH. The input to the positional eulerian path problem is an Eulerian graph G( V, E) in which every edge has an associated range of integers and the problem is to find an Eulerian path el, …, e|E| in G such that the range of ei, contains i. We show that the positional Eulerian path problem is NP-complete even when the maximum out-degree (in-degree) of any vertex in the graph is 2. On a positive note we present polynomial algorithms to solve a special case of PSBH (bounded PSBH), where the range of the allowed positions for any edge is bounded by a constant (it corresponds to accurate experimental measurements of positions in PSBH). Moreover, if the positions of every l-tuple in an unknown DNA fragment of length n are measured with O(log n) error, then our algorithm runs in polynomial time. We also present an estimate of the resolving power of PSBH for a more realistic case when positions are measured with Θ(n) error.

Priorities for modeling and verifying distributed systems - Cleaveland, Rance; L\üttgen,G.; Natarajan,V.; Sims,S. (Tools and Algorithms for the Construction and Analysis of Systems, 1996)

A process algebra with distributed priorities - Cleaveland, Rance; L\üttgen,G.; Natarajan,V. (CONCUR'96: Concurrency Theory, 1996)

Software synthesis from dataflow graphs - Bhattacharyya, Shuvra S.; Murthy,P. K; Lee,E. A (Springer, 1996)

Video representations - Bolle,Ruud; Aloimonos, J.; Fermüller, Cornelia (Recent Developments in Computer Vision, 1996)

The COLLAGE/KHOROS link: Planning for image processing tasks - Lansky,A.; Friedman,M.; Getoor, Lise; Schmidler,S.; Short Jr,N. (Integrated Planning Applications, 1995)

Development of interlingual lexical conceptual structures with syntactic markers for machine translation - Dorr, Bonnie J; Lee,J.; Voss,C.; Suh,S. (University of Maryland, 1995)
This document reports on research conducted at the University of Mary-land for the Korean/English Machine Translation (MT) project. Our pri- mary objective was to develop an interlingual representation based on lexical conceptual structure (LCS) and to examine the relation between this repre- sentation and a set of linguistically motivated semantic classes. We view the work of the past year as a critical step toward achieving our goal of building a generator: the classification of LCS's into a semantic hierarchy provides a systematic mapping between semantic knowledge about verbs and their surface syntactic structures. We have focused on several areas in support of our objectives: (1) inves- tigation of morphological structure including distinctions between Korean and English; (2) porting a fast, message-passing parser to Korean (and to the IBM PC); (3) study of free word order and development of the associ- ated processing algorithm; (4) investigation of the aspectual dimension as it impacts morphology, syntax, and lexical semantics; (5) investigation of the relation between semantic classes and syntactic structure; (6) develop- ment of theta-role and lexical-semantic templates through lexical acquisition techniques; (7) definition a mapping between KR concepts and interlingual representations; (8) formalization of the lexical conceptual structure

Discovery of self-replicating structures using a genetic algorithm - Lohn,J. D; Reggia, James A. (Evolutionary Computation, 1995., IEEE International Conference on, 1995)

Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data - Fallah-Adl,H.; JaJa, Joseph F.; Liang,Shunlin; Kaufman,Y.J.; Townshend,J. (Supercomputing, 1995. Proceedings of the IEEE/ACM SC95 Conference, 1995)
Remotely sensed imagery has been used for developing and validating various studies regarding land cover dynamics. However, the large amounts of imagery collected by the satellites are largely contaminated by the effects of atmospheric particles. The objective of atmospheric correction is to retrieve the surface reflectance from remotely sensed imagery by removing the atmospheric effects. We introduce a number of computational techniques that lead to a substantial speedup of an atmospheric correction algorithm based on using look-up tables. Excluding I/O time, the previous known implementation processes one pixel at a time and requires about 2.63 seconds per pixel on a SPARC-10 machine, while our implementation is based on processing the whole image and takes about 4-20 microseconds per pixel on the same machine. We also develop a parallel version of our algorithm that is scalable in terms of both computation and I/O. Experimental results obtained show that a Thematic Mapper (TM) image (36 MB per band, 5 bands need to be corrected) can be handled in less than 4.3 minutes on a 32-node CM-5 machine, including I/O time.
Keywords: Atmospheric; AVHRR; computing; correction; high; I/O; Parallel; performance; processing; remote; scalable; sensing; TM

Efficient parsing for Korean and English: A parameterized message-passing approach - Dorr, Bonnie J; Lee,J.; Lin,D.; Suh,S. (Computational Linguistics, 1995)

Generating compact code from dataflow specifications of multirate signal processing algorithms - Bhattacharyya, Shuvra S.; Buck,J. T; Ha,S.; Lee,E. A (Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on, 1995)

Human-Computer Interaction Laboratory 1995 Video Reports - Plaisant, Catherine; Morrison,S.; Skokowski,C.; Reesch,J.; Shneiderman, Ben; Laboratory,University of Maryland at College Park. Human/Computer Interaction; Channel,F. (University of Maryland at College Park, Human/Computer Interaction Laboratory, 1995)

Land cover dynamics investigation using parallel computers - Liang, S.; Davis, Larry S.; Townshend,J.; Chellapa, Rama; DeFries, R.; Dubayah, R.; Goward,S.; JaJa, Joseph F.; Krishnamachar, S.; Roussopoulos, Nick; Saltz, J.; Samet, Hanan; et al. (Geoscience and Remote Sensing Symposium, 1995. IGARSS '95. 'Quantitative Remote Sensing for Science and Applications', International, 1995)
A comprehensive and highly interdisciplinary research program is being carried out to investigate global land cover dynamics in heterogeneous parallel computing environments. Some of the problems are addressed including atmospheric correction, mixture modeling, image classifications by Markovian random fields and by segmentation, global image/map databases, object oriented parallel programming and parallel/IO. During the initial two years project, significant progress has been made in all of these areas
Keywords: geographic information system; geophysical measurement technique; geophysics computing; image classification; image map database; image segmentation; land cover dynamics; land surface; mixture modeling; object oriented programming; optical imaging; para; GIS; IR imaging; Markovian random fields; atmospheric correction

A modified cellular automata model of nucleotide interactions and non-enzymatic transcription of DNA - Hilke,J.; Reggia, James A.; Navarro-Gonzalez,R.; Lohn,J. (inbs, 1995)

Scope and abstraction: Two criteria for localized planning - Lansky,A. L; Getoor, Lise (INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 1995)
Localization is a general-purpose representational technique for partitioning a problem intosubproblems. A localized problem-solver searches several smaller search spaces, one for each subproblem. Unlike most methods of partitioning, however, localization allows for subprob- lems that overlap i.e. multiple search spaces may be involved in constructing shared pieces of the overall plan. In this paper we focus on two criteria for forming localizations: scope and abstraction. We describe a method for automatically generating such localizations and provide empirical results that contrast their use in an o ce-building construction domain.

Techniques for performance measurement of parallel programs - Hollingsworth, Jeffrey K; Lumpp, J. E; Miller, B. P (Parallel computers: theory and practice, 1995)

Towards a computational theory of genome rearrangements - Hannenhalli, Sridhar; Pevzner,Pavel (Computer Science TodayComputer Science Today, 1995)
Analysis of genome rearrangements in molecular biology started in the late 1930's, when Dobzhansky and Sturtevant published a milestone paper presenting a rearrangement scenario with 17 inversions for the species of Drosophila. However, until recently there were no computer science results allowing a biologist to analyze genome rearrangements. The paper describes combinatorial problems motivated by genome rearrangements, surveys recently developed algorithms for genomic sequence comparison and presents applications of these algorithms to analyze rearrangements in herpes viruses, plant organelles, and mammalian chromosomes.

Use of linear algebra kernels to build an efficient finite element solver - Elman, Howard; Lee,Dennis K. -Y. (Parallel Computing, 1995)
For scientific codes to achieve good performance on computers with hierarchical memories, it is necessary that the ratio of memory references to arithmetic operations be low. In this paper, we show that Level 3 BLAS linear algebra kernels can be used to satisfy this requirement to produce an efficient implementation of a parallel finite element solver on a shared memory parallel computer with a fast cache memory.
Keywords: Cache memory; finite element; hp-version; Level 3 BLAS; Parallel algorithm; shared memory multiprocessor

Using synthetic perturbations and statistical screening to assay shared-memory programs - Snelick,R.; JaJa, Joseph F.; Kacker,R.; Lyon,G. (Information processing letters, 1995)

An Atlas of Drosophila Genes: Sequences and Molecular Features - Maroni,G.; Mount, Stephen M.; Cavener,DR; Cavener,BA; Sharp,PM; Lloyd,AT; Schaeffer,SW (Journal of Heredity, 1994)

Beyond accuracy, reliability, and efficiency: criteria for a good computer system - Friedman,Batya; Levenson,Nancy; Shneiderman, Ben; Suchman,Lucy; Winograd,Terry (Conference companion on Human factors in computing systems, 1994)

Fault tolerant system design - Levi,Shem-Tov; Agrawala, Ashok K. (McGraw-Hill, 1994)
This book presents a comprehensive exploration of the practical issues, tested techniques, and accepted theory for developing fault tolerant systems. It is a ready reference to work already done in the field, with new approaches devised by the authors.
Keywords: Computers / Intelligence (AI) & Semantics; Computers / Programming Languages / General; Computers / Software Development & Engineering / Systems Analysis & Design; Reference / General; Technology & Engineering / Engineering (General)

Human Emotion Recognition From Motion Using A Radial Basis Function Network Architecture - Mark,R.; Yaser,Y.; Larry,D. (University Of Maryland, 1994)

Looped schedules for dataflow descriptions of multirate signal processing algorithms - Bhattacharyya, Shuvra S.; Lee,E. A (Formal Methods in System Design, 1994)

A modified cellular automata model of nucleotide interactions and DNA replication - Hilke,James; Lohn,Jason; Reggia, James A.; Navarro,Rafael (University of Maryland at College Park, 1994)

A paradigm for non-head-driven parsing: Parameterized message-passing - Dorr, Bonnie J; Lin,D.; Lee,J.; Suh,S. (Proceedings of the International Conference on New Methods in Language Processing, Manchester, UK, 1994)

Pattern matching in a digitized image - Landau,G. M; Vishkin, Uzi (Algorithmica, 1994)

Regularization by Truncated Total Least Squares - Fierro,Richardo; Golub, Gene H.; Hansen,Per Christian; O'Leary, Dianne P. (Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, 1994)

Regularization of Ill-Posed Problems in Image Restoration - O'Leary, Dianne P. (Proceedings of the Fifth SIAM Conference on Applied Linear AlgebraProceedings of the Fifth SIAM Conference on Applied Linear Algebra, 1994)

A Semantics for a class of non-deterministic and causal production system programs - Raschid, Louiqa; Lobo,J. (Journal of Automated Reasoning, 1994)

Some Themes in Gene H.Golub's Work on Iterative Methods - O'Leary, Dianne P. (Recent Advances in Iterative MethodsRecent Advances in Iterative Methods, 1994)

Suppressor U1 snRNAs in Drosophila. - Lo,P. C.; Roy,D.; Mount, Stephen M. (GeneticsGenetics, 1994)
Although the role of U1 small nuclear RNAs (snRNAs) in 5' splice site recognition is well established, suppressor U1 snRNAs active in intact multicellular animals have been lacking. Here we describe suppression of a 5' splice site mutation in the Drosophila melanogaster white gene (w(DR18)) by compensatory changes in U1 snRNA. Mutation of positions -1 and +6 of the 5' splice site of the second intron (ACG|GTGACT to ACC|GTGAGC) results in the accumulation of RNA retaining this 74-nucleotide intron in both transfected cells and transgenic flies. U1-3G, a suppressor U1 snRNA which restores basepairing at position +6 of the mutant intron, increases the ratio of spliced to unspliced w(DR18) RNA up to fivefold in transfected Schneider cells and increases eye pigmentation in w(DR18) flies. U1-9G, which targets position -1, suppresses w(DR18) in transfected cells less well. U1-3G,9G has the same effect as U1-3G although it accumulates to lower levels. Suppression of w(DR18) has revealed that the U1b embryonic variant (G134 to U) is active in Schneider cells and pupal eye discs. However, the combination of 9G with 134U leads to reduced accumulation of both U1b-9G and U1b-3G,9G, possibly because nucleotides 9 and 134 both participate in a potential long-range intramolecular base-pairing interaction. High levels of functional U1-3G suppressor reduce both viability and fertility in transformed flies. These results show that, despite the difficulties inherent in stably altering splice site selection in multicellular organisms, it is possible to obtain suppressor U1 snRNAs in flies.

URV ESPRIT for tracking time-varying signals - Liu,K. J.R; O'Leary, Dianne P.; Stewart, G.W.; Wu,Y.-J.J. (Signal Processing, IEEE Transactions on, 1994)
ESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at an array of sensors. Unfortunately, its computational burden makes it unsuitable for real time processing of signals with time-varying directions of arrival. The authors develop a new implementation of ESPRIT that has potential for real time processing. It is based on a rank-revealing URV decomposition, rather than the eigendecomposition or singular value decomposition used in previous ESPRIT algorithms. The authors demonstrate its performance on simulated data representing both constant and time-varying signals. They find that the URV-based ESPRIT algorithm is effective for estimating time-varying directions-of-arrival at considerable computational savings over the SVD-based algorithm
Keywords: arrival; narrowband; decomposition; real; directions; ESPRIT; fixed; estimation; real-time; of; processing; time-varying; signals; performance; rank-revealing; signals; tracking; direction-of-arrival; systems; time-varying; systems; tracking; TIME; URV

An adaptive ESPRIT based on URV decomposition - Liu,K. J.R; O'Leary, Dianne P.; Stewart, G.W.; Wu,Y.-J.J. (Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on, 1993)
ESPRIT is an algorithm for determining the fixed directions of arrival of a set of narrowband signals at an array of sensors. Its computational burden makes it unsuitable for real-time processing of signals with time-varying directions of arrival. The authors develop a new implementation of ESPRIT that has potential for real-time processing. It is based on a rank-revealing URV decomposition, rather than the eigendecomposition or singular value decomposition (SVD) used in previous ESPRIT algorithms. Its performance is demonstrated on simulated data representing both constant and time-varying signals. It is shown that the URV-based ESPRIT algorithm is effective for estimating time-varying directions-of-arrival at considerable computational savings over the SVD-based algorithm.≪ETX≫
Keywords: algorithm; array; complexity; parameter; decomposition; real-time; ESPRIT; estimation; real-time; filters; array; of; processing; adaptive; processing; computational; savings; performance; rank-revealing; sensors; computational; signal; systems; systems; time-varying; URV; URV-based

Alpha Slider: Searching Textual Lists with Sliders - Osada,M.; Liao,Holmes; Shneiderman, Ben (Institute for Systems Research Technical Reports, 1993)
AlphaSlider is a query interface that uses a direct manipulation slider to select words, phrases, or names from an existing list. This paper introduces a prototype of AlphaSlider, describes the design issues, reports on an experimental evaluation, and offers directions for further research. The experiment tested 24 subjects selecting items from lists of 40, 80, 160, and 320 entries. Mean selection times only doubled with the 8-fold increase in list length. Users quickly accommodated to this selection method.
Keywords: direct manipulation; Human-computer interaction; keyboard data entry; sliders; Systems Integration; touchscreen

Alphaslider: Development and Evaluation of Text Retrieval Methods Using Sliders - Osada,M.; Liao,H.; Shneiderman, Ben (Ninth Symposium on Human Interface, 1993)
AlphaSlider is a query interface that uses a direct manipulation slider to select words, phrases, or names from an existing list. This paper introduces a prototype of AlphaSlider, describes the design issues, reports on an experimental evaluation, and offers directions for further research. The experiment tested 24 subjects selecting items from lists of 40, 80, 160, and 320 entries. Mean selection times only doubled with the 8-fold increase in list length. Users quickly accommodated to this selection method.