Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons™

Open Access. Powered by Scholars. Published by Universities.®

Life Sciences

Institution
Keyword
Publication Year
Publication
Publication Type

Articles 631 - 660 of 727

Full-Text Articles in Databases and Information Systems

A Proposed Undergraduate Bioinformatics Curriculum For Computer Scientists, Travis E. Doom, Michael L. Raymer, Dan E. Krane, Oscar Garcia Jan 2002

A Proposed Undergraduate Bioinformatics Curriculum For Computer Scientists, Travis E. Doom, Michael L. Raymer, Dan E. Krane, Oscar Garcia

Kno.e.sis Publications

Bioinformatics is a new and rapidly evolving discipline that has emerged from the fields of experimental molecular biology and biochemistry, and from the the artificial intelligence, database, and algorithms disciplines of computer science. Largely because of the inherently interdisciplinary nature of bioinformatics research, academia has been slow to respond to strong industry and government demands for trained scientists to develop and apply novel bioinformatics techniques to the rapidly-growing, freely-available repositories of genetic and proteomic data. While some institutions are responding to this demand by establishing graduate programs in bioinformatics, the entrance barriers for these programs are high, largely due to …


Multi-Dimensional Regression Analysis Of Time-Series Data Streams, Yixin Chen, Guozhu Dong, Jiawei Han, Benjamin W. Wah, Jianyong Wang Jan 2002

Multi-Dimensional Regression Analysis Of Time-Series Data Streams, Yixin Chen, Guozhu Dong, Jiawei Han, Benjamin W. Wah, Jianyong Wang

Kno.e.sis Publications

Real-time production systems and other dynamic environments often generate tremendous (potentially infinite) amount of stream data; the volume of data is too huge to be stored on disks or scanned multiple times. Can we perform on-line, multi-dimensional analysis and data mining of such data to alert people about dramatic changes of situations and to initiate timely, high-quality responses? This is a challenging task.

In this paper, we investigate methods for online, multi-dimensional regression analysis of time-series stream data, with the following contributions: (1) our analysis shows that only a small number of compressed regression measures instead of the complete stream …


Xml-Based Modeling And Simulation: Web Service Technologies And Their Synergy With Simulation, Senthilanand Chandrasekaran, Gregory S. Silver, John A. Miller, Jorge Cardoso, Amit P. Sheth Jan 2002

Xml-Based Modeling And Simulation: Web Service Technologies And Their Synergy With Simulation, Senthilanand Chandrasekaran, Gregory S. Silver, John A. Miller, Jorge Cardoso, Amit P. Sheth

Kno.e.sis Publications

The World Wide Web has had an huge influence on the computing field in general as well as simulation in particular (e.g., Web-based simulation). A new wave of development based upon XML has started. Two of the most interesting aspects of this development are the Semantic Web and Web services. This paper examines the synergy between Web service technology and simulation. In one direction, Web service processes can be simulated for the purpose of correcting/improving the design. In the other direction, simulation models/components can be built out of Web services. Work on seamlessly using simulation as a part of Web …


Authorization And Access Control Of Application Data In Workflow Systems, Shengli Wu, Amit P. Sheth, John A. Miller, Zongwei Luo Jan 2002

Authorization And Access Control Of Application Data In Workflow Systems, Shengli Wu, Amit P. Sheth, John A. Miller, Zongwei Luo

Kno.e.sis Publications

Workflow Management Systems (WfMSs) are used to support the modeling and coordinated execution of business processes within an organization or across organizational boundaries. Although some research efforts have addressed requirements for authorization and access control for workflow systems, little attention has been paid to the requirements as they apply to application data accessed or managed by WfMSs. In this paper, we discuss key access control requirements for application data in workflow applications using examples from the healthcare domain, introduce a classification of application data used in workflow systems by analyzing their sources, and then propose a comprehensive data authorization and …


The Latent Maximum Entropy Principle, Shaojun Wang, Ronald Rosenfeld, Yunxin Zhao, Dale Schuurmans Jan 2002

The Latent Maximum Entropy Principle, Shaojun Wang, Ronald Rosenfeld, Yunxin Zhao, Dale Schuurmans

Kno.e.sis Publications

We present an extension of Jaynes' maximum entropy principle to handle latent variables. We use an EM algorithm that incorporates nested iterative scaling to approximately calculate maximum entropy solutions for this principle, and give a proof of its convergence.


Knowledge Discovery In Biological Datasets Using A Hybrid Bayes Classifier/Evolutionary Algorithm, Michael L. Raymer, Leslie A. Kuhn, William F. Punch Nov 2001

Knowledge Discovery In Biological Datasets Using A Hybrid Bayes Classifier/Evolutionary Algorithm, Michael L. Raymer, Leslie A. Kuhn, William F. Punch

Kno.e.sis Publications

A key element of bioinformatics research is the extraction of meaningful information from large experimental data sets. Various approaches, including statistical and graph theoretical methods, data mining, and computational pattern recognition, have been applied to this task with varying degrees of success. We have previously shown that a genetic algorithm coupled with a k-nearest-neighbors classifier performs well in extracting information about protein-water binding from X-ray crystallographic protein structure data. Using a novel classifier based on the Bayes discriminant function, we present a hybrid algorithm that employs feature selection and extraction to isolate salient features from large biological data sets. The …


Profile Combinatorics For Fragment Selection In Comparative Protein Structure Modeling, Deacon Sweeney, Travis E. Doom, Michael L. Raymer Nov 2001

Profile Combinatorics For Fragment Selection In Comparative Protein Structure Modeling, Deacon Sweeney, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Sequencing of the human genome was a great stride towards modeling cellular complexes, massive systems whose key players are proteins and DNA. A major bottleneck limiting the modeling process is structure and function annotation for the new genes. Contemporary protein structure prediction algorithms represent the sequence of every protein of known structure with a profile to which the profile of a protein sequence of unknown structure is compared for recognition. We propose a novel approach to increase the scope and resolution of protein structure profiles. Our technique locates equivalent regions among the members of a structurally similar fold family, and …


Online Bayesian Tree-Structured Transformation Of Hmms With Optimal Model Selection For Speaker Adaptation, Shaojun Wang, Yunxin Zhao Sep 2001

Online Bayesian Tree-Structured Transformation Of Hmms With Optimal Model Selection For Speaker Adaptation, Shaojun Wang, Yunxin Zhao

Kno.e.sis Publications

This paper presents a new recursive Bayesian learning approach for transformation parameter estimation in speaker adaptation. Our goal is to incrementally transform or adapt a set of hidden Markov model (HMM) parameters for a new speaker and gain large performance improvement from a small amount of adaptation data. By constructing a clustering tree of HMM Gaussian mixture components, the linear regression (LR) or affine transformation parameters for HMM Gaussian mixture components are dynamically searched. An online Bayesian learning technique is proposed for recursive maximum a posteriori (MAP) estimation of LR and affine transformation parameters. This technique has the advantages of …


Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler Jul 2001

Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We consider rather general operators mapping valuations to (sets of) valuations in the context of the semantics of logic programming languages. This notion generalizes several of the standard operators encountered in this subject and is inspired by earlier work of M.C. Fitting. The fixed points of such operators play a fundamental role in logic programming semantics by providing standard models of logic programs and also in determining the computability properties of these standard models. We discuss some of our recent work employing topological ideas, in conjunction with order theory, to establish methods by which one can find the fixed points …


Summarizing Data Sets For Classification, Christopher W. Kinzig, Krishnaprasad Thirunarayan, Gary B. Lamont, Robert E. Marmelstein Jun 2001

Summarizing Data Sets For Classification, Christopher W. Kinzig, Krishnaprasad Thirunarayan, Gary B. Lamont, Robert E. Marmelstein

Kno.e.sis Publications

This paper describes our approach and experiences with implementing a data mining system using genetic algorithms in C++. In contrast with earlier classification algorithms that tended to “tile” the data sets using some pre-specified “shapes”, the proposed system is based on Marmelstein’s work on determining natural boundaries for class homogeneous regions. These boundaries are further refined to construct a compact set of simple data mining rules for classification.


Query Processing With An Fpga Coprocessor Board, Jack S. Jean, Guozhu Dong, Hwa Zhang, Xinzhong Guo, Baifeng Zhang Jun 2001

Query Processing With An Fpga Coprocessor Board, Jack S. Jean, Guozhu Dong, Hwa Zhang, Xinzhong Guo, Baifeng Zhang

Kno.e.sis Publications

In this paper, a commercial FPGA coprocessor board is used to accelerate the processing of queries on a relational database that contains texts and images. FPGA designs for text searching and image matching are described and their performances summarized. A potential design for a database JOIN operator is then studied. A query optimization preprocessor is then proposed.


Making Use Of The Most Expressive Jumping Emerging Patterns For Classification, Jinyan Li, Guozhu Dong, Kotagiri Ramamohanarao May 2001

Making Use Of The Most Expressive Jumping Emerging Patterns For Classification, Jinyan Li, Guozhu Dong, Kotagiri Ramamohanarao

Kno.e.sis Publications

Classification aims to discover a model from training data that can be used to predict the class of test instances. In this paper, we propose the use of jumping emerging patterns (JEPs) as the basis for a new classifier called the JEP-Classifier. Each JEP can capture some crucial difference between a pair of datasets. Then, aggregating all JEPs of large supports can produce a more potent classification power. Procedurally, the JEP-Classifier learns the pair-wise features (sets of JEPs) contained in the training data, and uses the collective impacts contributed by the most expressive pair-wise features to determine the class labels …


Survivability Architecture For Workflow Management Systems, Jorge Cardoso, Zongwei Luo, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut Mar 2001

Survivability Architecture For Workflow Management Systems, Jorge Cardoso, Zongwei Luo, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut

Kno.e.sis Publications

The survivability of critical infrastructure systems has been gaining increasing concern from the industry. The survivability research area addresses the issue of infrastructure systems that continues to provide pre-established service levels to users in the face of disorders and react to changes in the surrounding environment. Workflow management systems need to be survivable since they are used to support critical and sensitive business processes. They require a high level of dependability and should not allow process instances to be interrupted or aborted due to failures. Moreover, due to their sensitivity, business process should reflect any change in the environment. In …


A "Converse" Of The Banach Contraction Mapping Theorem, Pascal Hitzler, Anthony K. Seda Jan 2001

A "Converse" Of The Banach Contraction Mapping Theorem, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

We prove a type of converse of the Banach contraction mapping theorem for metric spaces: if X is a T1 topological space and f: X -> X is a function with the unique fixed point a such that fn(x) converges to a for each x is a member of X, then there exists a distance function d on X such that f is a contraction on the complete ultrametric space (X,d) with contractivity factor 1/2. We explore properties of the resulting space (X,d).


Unique Supported-Model Classes Of Logic Programs, Pascal Hitzler, Anthony K. Seda Jan 2001

Unique Supported-Model Classes Of Logic Programs, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

We study classes of programs, herein called unique supported-model classes, with the property that each program in the class has a unique supported model. Elsewhere, the authors examined these classes from the point of view of operators defined relative to certain three-valued logics. In this paper, we complement our earlier results by considering how unique supported-model classes fit into the framework given by various classes of programs in several well-known approaches to semantics.


Kontraktionssatze Auf Verallgemeinerten Metrischen Raumen, Pascal Hitzler Jan 2001

Kontraktionssatze Auf Verallgemeinerten Metrischen Raumen, Pascal Hitzler

Computer Science and Engineering Faculty Publications


Latent Maximum Entropy Principle For Statistical Language Modeling, Shaojun Wang, Ronald Rosenfeld, Yunxin Zhao Jan 2001

Latent Maximum Entropy Principle For Statistical Language Modeling, Shaojun Wang, Ronald Rosenfeld, Yunxin Zhao

Kno.e.sis Publications

We describe a unified probabilistic framework for statistical language modeling, the latent maximum entropy principle. The salient feature of this approach is that the hidden causal hierarchical dependency structure can be encoded into the statistical model in a principled way by mixtures of exponential families with a rich expressive power. We first show the problem formulation, solution, and certain convergence properties. We then describe how to use this machine learning technique to model various aspects of natural language, such as syntactic structure of sentences, semantic information in a document. Finally, we draw a conclusion and point out future research directions.


Herba Online, Dol Bakri Zen Akmal Jan 2001

Herba Online, Dol Bakri Zen Akmal

Student Works (2000-2009)

Sistem Herba Online merupakan satu sistem informasi dengan pangkalan data berasaskan web yang dibangunkan untuk membantu memperkembangkan pengetahuan rakyat Malaysia amnya tentang herba di Malaysia serta kepentingannya dalam kehidupan. Objektif utama sistem dibangunkan ialah selaku pemangkin meningkatkan pengetahuan pengguna dalam topik herba dengan memudahkan cara mencapai maklumat yang mereka inginkan. Sasaran pengguna bagu sistem ini ialah individu atau organisasi yang terlibat dalam pembelajaran, kajian, penghasilan, pemprosesan atau pemasaran tumbuhan-tumbuhan herba atau produk-produk yang dihasilkannya. Bab pertama laporan ini menceritakan secara ringkas pengenalan, objektif dan skop projek. Bab kedua merupakan hasil daripada kajian literasi yang telah dilakukan berkaitan dengan topik. Secara …


Buah-Buahan Malaysia, Awang Mohd Rafidi Jan 2001

Buah-Buahan Malaysia, Awang Mohd Rafidi

Student Works (2000-2009)

Latihan llmiah merupakan satu kursus yang wajib bagi pejajar tahun akhir memenuhi Kepertuan Sarjana Muda Sains Komputer di Universiti Malaya. Menerusi kursus ini, pelajar perlu menyiapkan satu projek yang mana pelajar dapat mengadaptasikan apa yang telah dipelajari selama ini. Selain itu, pelajar juga mencari serta mempelajari sesuatu daripada projek yang dibangunkan. Sistem yang dibangunkan ini merupakan sistem berinformasi yang berbentuk stand alone mengenai buah-buahan tempatan di negara ini. Selaras dengan perkembangan komputeran teknologi maklumat, sistem yang akan saya bangunkan ini sememangnya dinantikan oleh para pengguna sekarang yang semestinya inginkan sumber maklumat dalam bentuk yang mudah lagi menarik. Sistem ini untuk …


Classes Of Logic Programs Which Possess Unique Supported Models, Anthony K. Seda, Pascal Hitzler Oct 2000

Classes Of Logic Programs Which Possess Unique Supported Models, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Logic programming is concerned with the use of logic as a programming language. The main manifestation of this computing paradigm is in the various versions of Prolog which are now available, in which computation is viewed as deduction from sets of Horn clauses, although there is also growing interest in the related form known as answer set programming, see [10]. The reference [1] contains a good survey of the growth of logic programming over the last twenty-five years both as a stand-alone programming language and as a software component of large information systems. One advantage a logic program P has …


Semantic Web And Information Brokering: Opportunities, Commercialization, And Challenges, Amit P. Sheth Sep 2000

Semantic Web And Information Brokering: Opportunities, Commercialization, And Challenges, Amit P. Sheth

Kno.e.sis Publications

From the chairs' report published in SIGMOD record: The keynote address entitled 'Semantic Web and Information Brokering: Opportunities, Early Commercializations, and Challenges' was delivered by Amit Sheth (University of Georgia and Taalee Corp). Sheth characterized semantics as the next step in the evolution of the WWW and stressed the importance of semantically organized information for supporting ubiquitous, powerful, accurate and efficient access to this information. Sheth also reviewed proposals for semantic interoperability frameworks such as the DAML(DARPA Agent Mark-Up Language), the Oingo family of tools for defining concepts and extracting knowledge from large databases, as well as several scenarios on …


Exception Handling In Workflow Systems, Zongwei Luo, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller Sep 2000

Exception Handling In Workflow Systems, Zongwei Luo, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller

Kno.e.sis Publications

In this paper, defeasible workflow is proposed as a framework to support exception handling for workflow management. By using the “justified” ECA rules to capture more contexts in workflow modeling, defeasible workflow uses context dependent reasoning to enhance the exception handling capability of workflow management systems. In particular, this limits possible alternative exception handler candidates in dealing with exceptional situations. Furthermore, a case-based reasoning (CBR) mechanism with integrated human involvement is used to improve the exception handling capabilities. This involves collecting cases to capture experiences in handling exceptions, retrieving similar prior exception handling cases, and reusing the exception handling experiences …


Dimensionality Reduction Using Genetic Algorithms, Michael L. Raymer, William F. Punch, Erik D. Goodman, Leslie A. Kuhn, Anil K. Jain Jul 2000

Dimensionality Reduction Using Genetic Algorithms, Michael L. Raymer, William F. Punch, Erik D. Goodman, Leslie A. Kuhn, Anil K. Jain

Kno.e.sis Publications

Pattern recognition generally requires that objects be described in terms of a set of measurable features. The selection and quality of the features representing each pattern affect the success of subsequent classification. Feature extraction is the process of deriving new features from original features to reduce the cost of feature measurement, increase classifier efficiency, and allow higher accuracy. Many feature extraction techniques involve linear transformations of the original pattern vectors to new vectors of lower dimensionality. While this is useful for data visualization and classification efficiency, it does not necessarily reduce the number of features to be measured since each …


A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler Jul 2000

A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We present a new fixed-point theorem akin to the Banach contraction mapping theorem, but in the context of a novel notion of generalized metric space, and show how it can be applied to analyse the denotational semantics of certain logic programs. The theorem is obtained by generalizing a theorem of Priess-Crampe and Ribenboim, which grew out of applications within valuation theory, but is also inspired by a theorem of S.G. Matthews which grew out of applications to conventional programming language semantics. The class of programs to which we apply our theorem was defined previously by us in terms of operators …


On-Line Bayesian Speaker Adaptation By Using Tree-Structured Transformation And Robust Priors, Shaojun Wang, Yunxin Zhao Jun 2000

On-Line Bayesian Speaker Adaptation By Using Tree-Structured Transformation And Robust Priors, Shaojun Wang, Yunxin Zhao

Kno.e.sis Publications

This paper presents new results by using our previously proposed on-line Bayesian learning approach for affine transformation parameter estimation in speaker adaptation. The on-line Bayesian learning technique allows updating parameter estimates after each utterance and it can accommodate flexible forms of transformation functions as well as prior probability density functions. We show through experimental results the robustness of heavy tailed priors to mismatch in prior density estimation. We also show that by properly choosing the transformation matrices and depths of hierarchical trees, recognition performance improved significantly.


Local Properties Of Query Languages, Guozhu Dong, Leonid Libkin, Limsoon Wong May 2000

Local Properties Of Query Languages, Guozhu Dong, Leonid Libkin, Limsoon Wong

Kno.e.sis Publications

In this paper we study the expressiveness of local queries. By locality we mean — informally — that in order to check if a tuple belongs to the result of a query, one only has to look at a certain predetermined portion of the input. Examples include all relational calculus queries. We start by proving a general result describing outputs of local queries. This result leads to many easy inexpressibility proofs for local queries. We then consider a closely related property, namely, the bounded degree property. It describes the outputs of local queries on structures that locally look “simple.” Every …


Crop Updates 2000 Cereals - Part 4, C. Tang, Z. Rengel, E. Diatloff, B. Mcgann, Mehmet Cakir, Nick Galwey, David Poulsen, M. Carter, A. Briney, R. Wilson, R. H. Potter, M. G. K. Jones, Ian Barclay, Robyn Mclean, Dean A. Diepeveen, Rob Loughman, Ross Kingwell, Michael O'Connell, Simone Blennerhasset, Benjamin Michael Tiller, Senthold Asseng, Holger Meinke, Bill Bowden, Jeff Russell, Ivan Lee, Clare Johnson, Chris Newman, Robert Emery, Romolo Tassone, Ernestos Kostas, Graeme Ralph, Robert Sudmeyer, David Hall, Harvey Jones Feb 2000

Crop Updates 2000 Cereals - Part 4, C. Tang, Z. Rengel, E. Diatloff, B. Mcgann, Mehmet Cakir, Nick Galwey, David Poulsen, M. Carter, A. Briney, R. Wilson, R. H. Potter, M. G. K. Jones, Ian Barclay, Robyn Mclean, Dean A. Diepeveen, Rob Loughman, Ross Kingwell, Michael O'Connell, Simone Blennerhasset, Benjamin Michael Tiller, Senthold Asseng, Holger Meinke, Bill Bowden, Jeff Russell, Ivan Lee, Clare Johnson, Chris Newman, Robert Emery, Romolo Tassone, Ernestos Kostas, Graeme Ralph, Robert Sudmeyer, David Hall, Harvey Jones

Crop Updates

This session covers twelve papers from different authors:

BREEDING

1.Response to subsoil acidity of wheat genotypes differing in Al-tolerance, C. Tang, Z. Rengel, E. Diatloff and B. McGann, Soil Science and Plant Nutrition/CLIMA, University of Western Australia

2. Application of molecular markers in Barley Improvement, Mehmet Cakir1, Nick Galwey1 and David Poulsen2, 1Plant Sciences, Faculty of Agriculture, University of Western Australia, 2Queensland Department of Primary Industries, Hermitage Research Station, Queensland

3. Implementation of molecular markers for wheat improvement in the Western Region, M. Carter1, A. Briney1, …


The Space Of Jumping Emerging Patterns And Its Incremental Maintenance, Jinyan Li, Kotagiri Ramamohanarao, Guozhu Dong Jan 2000

The Space Of Jumping Emerging Patterns And Its Incremental Maintenance, Jinyan Li, Kotagiri Ramamohanarao, Guozhu Dong

Kno.e.sis Publications

The concept of jumping emerging patterns (JEPs) has been proposed to describe those discriminating features which only occur in the positive training instances but do not occur in the negative class at all; JEPs have been used to construct classifiers which generally provide better accuracy than the state-of-the-art classifiers such as C4.5. The algorithms for maintaining the space of jumping emerging patterns (JEP space) are presented in this paper. We prove that JEP spaces satisfy the property of convexity. Therefore JEP spaces can be concisely represented by two bounds: consisting respectively of the most general elements and the most specific …


Separating Auxiliary Arity Hierarchy Of First-Order Incremental Evaluation Using (3+1)-Ary Input Relations, Guozhu Dong, Louxin Zhang Jan 2000

Separating Auxiliary Arity Hierarchy Of First-Order Incremental Evaluation Using (3+1)-Ary Input Relations, Guozhu Dong, Louxin Zhang

Kno.e.sis Publications

Presents a first-order incremental evaluation system that uses first-order queries to maintain a database view defined by a non-first-order query. Reduction of the arity of queries to understand the power of foies; Use of a key lemma for proving a query which encodes the multiple parity problem.


Imprecise Answers In Distributed Environments: Estimation Of Information Loss For Multi-Ontology Based Query Processing, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth Jan 2000

Imprecise Answers In Distributed Environments: Estimation Of Information Loss For Multi-Ontology Based Query Processing, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth

Kno.e.sis Publications

The World Wide Web is fast becoming a ubiquitous computing environment. Prevalent keyword-based search techniques are scalable, but are incapable of accessing information based on concepts. We investigate the use of concepts from multiple, real-world pre-existing, domain ontologies to describe the underlying data content and support information access at a higher level of abstraction. It is not practical to have a single domain ontology to describe the vast amounts of data on the Web. In fact, we expect multiple ontologies to be used as different world views and present an approach to "browse" ontologies as a paradigm for information access. …