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

Physical Sciences and Mathematics Commons

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

Wright State University

Series

2010

Discipline
Keyword
Publication

Articles 181 - 204 of 204

Full-Text Articles in Physical Sciences and Mathematics

Provenance Context Entity (Pace): Scalable Provenance Tracking For Scientific Rdf Data, Satya S. Sahoo, Olivier Bodenreider, Pascal Hitzler, Amit P. Sheth, Krishnaprasad Thirunarayan Jan 2010

Provenance Context Entity (Pace): Scalable Provenance Tracking For Scientific Rdf Data, Satya S. Sahoo, Olivier Bodenreider, Pascal Hitzler, Amit P. Sheth, Krishnaprasad Thirunarayan

Kno.e.sis Publications

The Resource Description Framework (RDF) format is being used by a large number of scientific applications to store and disseminate their datasets. The provenance information, describing the source or lineage of the datasets, is playing an increasingly significant role in ensuring data quality, computing trust value of the datasets, and ranking query results. Current provenance tracking approaches using the RDF reification vocabulary suffer from a number of known issues, including lack of formal semantics, use of blank nodes, and application-dependent interpretation of reified RDF triples. In this paper, we introduce a new approach called Provenance Context Entity (PaCE) that uses …


Mobicloud - Making Clouds Reachable: A Toolkit For Easy And Efficient Development Of Customized Cloud Mobile Hybrid Applications, Ashwin Manjunatha, Ajith Harshana Ranabahu, Amit P. Sheth, Krishnaprasad Thirunarayan Jan 2010

Mobicloud - Making Clouds Reachable: A Toolkit For Easy And Efficient Development Of Customized Cloud Mobile Hybrid Applications, Ashwin Manjunatha, Ajith Harshana Ranabahu, Amit P. Sheth, Krishnaprasad Thirunarayan

Kno.e.sis Publications

The advancements in computing have resulted in a boom of cheap, ubiquitous, connected mobile devices, as well as seemingly unlimited, utility style, pay as you go computing resources, commonly referred to as Cloud computing. However, taking full advantage of this mobile and cloud computing landscape, especially for the data intensive domains, has been hampered by the many heterogeneities that exist in the mobile space, as well as the Cloud space. Our research attempts to exploit the capabilities of the mobile and cloud landscape by introducing MobiCloud, an online toolkit to efficiently develop Cloud-mobile hybrid (CMH) applications. We define a CMH …


From Questions To Effective Answers: On The Utility Of Knowledge-Driven Querying Systems For Life Sciences Data, Amir H. Asiaee, Prashant Doshi, Todd Minning, Satya S. Sahoo, Priti Parikh, Amit P. Sheth, Rick L. Tarleton Jan 2010

From Questions To Effective Answers: On The Utility Of Knowledge-Driven Querying Systems For Life Sciences Data, Amir H. Asiaee, Prashant Doshi, Todd Minning, Satya S. Sahoo, Priti Parikh, Amit P. Sheth, Rick L. Tarleton

Kno.e.sis Publications

We compare two distinct approaches for querying data in the context of the life sciences. The first approach utilizes conventional databases to store the data and intuitive form-based interfaces to facilitate easy querying of the data. These interfaces could be seen as implementing a set of 'pre-canned' queries commonly used by the life science researchers that we study. The second approach is based on semantic Web technologies and is knowledge (model) driven. It utilizes a large OWL ontology and same datasets as before but associated as RDF instances of the ontology concepts. An intuitive interface is provided that allows the …


Approximate Instance Retrieval On Ontologies, Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzler Jan 2010

Approximate Instance Retrieval On Ontologies, Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzler

Computer Science and Engineering Faculty Publications

With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexity for efficient reasoning. In application cases that require scalable reasoning with expressive ontologies, non-standard reasoning solutions such as approximate reasoning are necessary to tackle the intractability of reasoning in expressive DLs. In this paper, we are concerned with the approximation of the reasoning task of instance retrieval on DL knowledge bases, trading correctness of retrieval results for gain of speed. We introduce our notion of an approximate concept extension and we provide …


Distributed Reasoning With El++ Using Mapreduce, Frederick Maier, Raghava Mutharaju, Pascal Hitzler Jan 2010

Distributed Reasoning With El++ Using Mapreduce, Frederick Maier, Raghava Mutharaju, Pascal Hitzler

Computer Science and Engineering Faculty Publications

It has recently been shown that the MapReduce framework for distributed computation can be used effectively for large-scale RDF Schema reasoning, computing the deductive closure of over a billion RDF triples within a reasonable time. Later work has carried this approach over to OWL Horst. In this paper, we provide a MapReduce algorithm for classifying knowledge bases in the description logic EL++, which is essentially the OWL 2 profile OWL 2 EL. The traditional EL++ classification algorithm is recast into a form compatible with MapReduce, and it is shown how the revised algorithm can be realized within …


Cs 242-01: Computer Programming Iii, Mateen M. Rizki Jan 2010

Cs 242-01: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 302-01: Introduction To Oracle/Sql Databases, Karen Meyer Jan 2010

Cs 302-01: Introduction To Oracle/Sql Databases, Karen Meyer

Computer Science & Engineering Syllabi

Relational client server database design and access techniques. Includes building database tables, writing SQL and PL/SQL statements and programs and developing user interfaces using forms and reports.


Cs 707-01: Information Retrieval, Krishnaprasad Thirunarayan Jan 2010

Cs 707-01: Information Retrieval, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course covers models for information retrieval, techniques for indexing and searching, and algorithms for classification and clustering. It will also cover SVM, latent semantic indexing, link analysis and ranking, Map-Reduce architecture and Hadoop, to different degrees of detail, time permitting.


Cs 415-01: Social Implications Of Computing, Leo Finkelstein Jan 2010

Cs 415-01: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.


Cs 400-01: Data Structures And Software Design, Meilin Liu Jan 2010

Cs 400-01: Data Structures And Software Design, Meilin Liu

Computer Science & Engineering Syllabi

This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.


Ceg 460/660-01: Introduction To Software Computer Engineering, Prabhaker Mateti Jan 2010

Ceg 460/660-01: Introduction To Software Computer Engineering, Prabhaker Mateti

Computer Science & Engineering Syllabi

[4 Credit Hours] Concepts of software engineering. Analysis, design, and implementation of software engineering concepts that comprise structured programming and design. Case studies serve as examples illustrating the software life-cycle model. Three hours lecture, two hours lab. 4.0 Credit hours. Prerequisites: Undergraduate level CS 400 Minimum Grade of D


Ceg 220-01: Introduction To C Programming For Engineers, Jay Dejongh Jan 2010

Ceg 220-01: Introduction To C Programming For Engineers, Jay Dejongh

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: MTH 229 (Calculus or EGR l01 (Engineering Mathematics). The course includes a scheduled laboratory section for which you must register.


Ceg 210-01: Pc Networking I, Jerry Hensley Jan 2010

Ceg 210-01: Pc Networking I, Jerry Hensley

Computer Science & Engineering Syllabi

Introduction to networking technologies including infrastructure and architectures, standards, protocols and directory services, administration, security and management. Integrated lecture and lab.


Cs 416/616: Matrix Computations, Ronald F. Taylor Jan 2010

Cs 416/616: Matrix Computations, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is a survey of numerical methods in linear algebra for application to problems in engineering and the sciences. Emphasis is on using modern software tools on high performance computing systems. This course covers the mathematics of linear equations, eigenvalue problems, singular value decomposition, and least squares. Material covered will be relevant to applications areas such as structural analysis, heat transfer, neural networks, mechanical vibrations, and image processing in biomedical engineering. A familiarity with MATLAB is useful, and the ability to program in languages such as CIC++ or Fortran is very important. A basic knowledge of matrix algebra is …


Ceg/Ee 260 Digital Computing Hardware/Switching Circuits, Meilin Liu Jan 2010

Ceg/Ee 260 Digital Computing Hardware/Switching Circuits, Meilin Liu

Computer Science & Engineering Syllabi

We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.


Ceg 750: Microprocessor, Jack Jean Jan 2010

Ceg 750: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

Design and implement an MC6812 computer system based on an Axiom CSM-12C32 board that allows the loading of a 6812 application program from a PC so as to reconfigure the system as both an analog waveform storage scope and a digital logic analyzer.


Scale: A Scalable Framework For Efficiently Clustering Transactional Data, Hua Yan, Keke Chen, Ling Liu, Zhang Yi Jan 2010

Scale: A Scalable Framework For Efficiently Clustering Transactional Data, Hua Yan, Keke Chen, Ling Liu, Zhang Yi

Kno.e.sis Publications

This paper presents SCALE, a fully automated transactional clustering framework. The SCALE design highlights three unique features. First, we introduce the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and it allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop the weighted coverage density measure based clustering algorithm, a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Third, we introduce two clustering validation metrics and show that these domain …


Automated Isolation Of Translational Efficiency Bias That Resists The Confounding Effect Of Gc(At)-Content, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer Jan 2010

Automated Isolation Of Translational Efficiency Bias That Resists The Confounding Effect Of Gc(At)-Content, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Genomic sequencing projects are an abundant source of information for biological studies ranging from the molecular to the ecological in scale; however, much of the information present may yet be hidden from casual analysis. One such information domain, trends in codon usage, can provide a wealth of information about an organism's genes and their expression. Degeneracy in the genetic code allows more than one triplet codon to code for the same amino acid, and usage of these codons is often biased such that one or more of these synonymous codons is preferred. Detection of this bias is an important tool …


Loqus: Linked Open Data Sparql Querying System, Prateek Jain, Kunal Verma, Peter Z. Yeh, Pascal Hitzler, Amit P. Sheth Jan 2010

Loqus: Linked Open Data Sparql Querying System, Prateek Jain, Kunal Verma, Peter Z. Yeh, Pascal Hitzler, Amit P. Sheth

Kno.e.sis Publications

The LOD cloud is gathering a lot of momentum, with the number of contributors growing manifold. Many prominent data providers have submitted and linked their data to other dataset with the help of manual mappings. The potential of the LOD cloud is enormous ranging from challenging AI issues such as open domain question answering to automated knowledge discovery. We believe that there is not enough technology support available to effectively query the LOD cloud. To this effect, we present a system called Linked Open Data SPARQL Querying System (LOQUS), which automatically maps users queries written in terms of a conceptual …


Linked Open Social Signals, Pablo N. Mendes, Alexandre Passant, Pavan Kapanipathi, Amit P. Sheth Jan 2010

Linked Open Social Signals, Pablo N. Mendes, Alexandre Passant, Pavan Kapanipathi, Amit P. Sheth

Kno.e.sis Publications

In this paper we discuss the collection, semantic annotation and analysis of real-time social signals from micro-blogging data. We focus on users interested in analyzing social signals collectively for sensemaking. Our proposal enables flexibility in selecting subsets for analysis, alleviating information overload. We define an architecture that is based on state-of-the-art Semantic Web technologies and a distributed publish subscribe protocol for real time communication. In addition, we discuss our method and application in a scenario related to the health care reform in the United States.


Getting Code Near The Data: A Study Of Generating Customized Data Intensive Scientific Workflows With Domain Specific Language, Ashwin Manjunatha, Ajith Harshana Ranabahu, Paul E. Anderson, Amit P. Sheth Jan 2010

Getting Code Near The Data: A Study Of Generating Customized Data Intensive Scientific Workflows With Domain Specific Language, Ashwin Manjunatha, Ajith Harshana Ranabahu, Paul E. Anderson, Amit P. Sheth

Kno.e.sis Publications

The amount of data produced in modern biological experiments such as Nuclear Magnetic Resonance (NMR) analysis far exceeds the processing capability of a single machine. The present state-of-the-art is taking the ”data to code”, the philosophy followed by many of the current service oriented workflow systems. However this is not feasible in some cases such as NMR data analysis, primarily due to the large scale of data.

The objective of this research is to bring ”code to data”, preferred in the cases when the data is extremely large. We present a DSL based approach to develop customized data intensive scientific …


Semantics Centric Solutions For Application And Data Portability In Cloud Computing, Ajith Harshana Ranabahu, Amit P. Sheth Jan 2010

Semantics Centric Solutions For Application And Data Portability In Cloud Computing, Ajith Harshana Ranabahu, Amit P. Sheth

Kno.e.sis Publications

Cloud computing has become one of the key considerations both in academia and industry. Cheap, seemingly unlimited computing resources that can be allocated almost instantaneously and pay-as-you-go pricing schemes are some of the reasons for the success of Cloud computing. The Cloud computing landscape, however, is plagued by many issues hindering adoption. One such issue is vendor lock-in, forcing the Cloud users to adhere to one service provider in terms of data and application logic. Semantic Web has been an important research area that has seen significant attention from both academic and industrial researchers. One key property of Semantic Web …


Sensor Data And Perception: Can Sensors Play 20 Questions, Cory Andrew Henson Jan 2010

Sensor Data And Perception: Can Sensors Play 20 Questions, Cory Andrew Henson

Kno.e.sis Publications

Currently, there are many sensors collecting information about our environment, leading to an overwhelming number of observations that must be analyzed and explained in order to achieve situation awareness. As perceptual beings, we are also constantly inundated with sensory data, yet we are able to make sense of our environment with relative ease. Why is the task of perception so easy for us, and so hard for machines; and could this have anything to do with how we play the game 20 Questions?


Provenance Aware Linked Sensor Data, Harshal Kamlesh Patni, Satya S. Sahoo, Cory Andrew Henson, Amit P. Sheth Jan 2010

Provenance Aware Linked Sensor Data, Harshal Kamlesh Patni, Satya S. Sahoo, Cory Andrew Henson, Amit P. Sheth

Kno.e.sis Publications

Provenance, from the French word “provenir”, describes the lineage or history of a data entity. Provenance is critical information in the sensors domain to identify a sensor and analyze the observation data over time and geographical space. In this paper, we present a framework to model and query the provenance information associated with the sensor data exposed as part of the Web of Data using the Linked Open Data conventions. This is accomplished by developing an ontology-driven provenance management infrastructure that includes a representation model and query infrastructure. This provenance infrastructure, called Sensor Provenance Management System (PMS), is …