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

Computer Sciences Commons™

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

Wright State University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1441 - 1470 of 2694

Full-Text Articles in Computer Sciences

Segmenting Brain Tumors Using Pseudo-Conditional Random Fields, Chi-Hoon Lee, Shaojun Wang, Albert Murtha, Matthew R.G. Brown, Russell Greiner Sep 2008

Segmenting Brain Tumors Using Pseudo-Conditional Random Fields, Chi-Hoon Lee, Shaojun Wang, Albert Murtha, Matthew R.G. Brown, Russell Greiner

Kno.e.sis Publications

Locating Brain tumor segmentation within MR (magnetic resonance) images is integral to the treatment of brain cancer. This segmentation task requires classifying each voxel as either tumor or non-tumor, based on a description of that voxel. Unfortunately, standard classifiers, such as Logistic Regression (LR) and Support Vector Machines (SVM), typically have limited accuracy as they treat voxels as independent and identically distributed (iid). Approaches based on random fields, which are able to incorporate spatial constraints, have recently been applied to brain tumor segmentation with notable performance improvement over iid classifiers. However, previous random field systems involved computationally intractable …

Go to article

A Faceted Classification Based Approach To Search And Rank Web Apis, Karthik Gomadam, Ajith Harshana Ranabahu, Meenakshi Nagarajan, Amit P. Sheth, Kunal Verma Sep 2008

A Faceted Classification Based Approach To Search And Rank Web Apis, Karthik Gomadam, Ajith Harshana Ranabahu, Meenakshi Nagarajan, Amit P. Sheth, Kunal Verma

Kno.e.sis Publications

Web application hybrids, popularly known as mashups, are created by integrating services on the Web using their APIs. Support for finding an API is currently provided by generic search engines or domain specific solutions such as Google and ProgrammableWeb. Shortcomings of both these solutions in terms of and reliance on user tags make the task of identifying an API challenging. Since these APIs are described in HTML documents, it is essential to look beyond the boundaries of current approaches to Web service discovery that rely on formal descriptions. In this work, we present a faceted approach to searching and ranking …

Go to article

Semantics Enhanced Services: Meteor-S, Sawsdl And Sa-Rest, Amit P. Sheth, Karthik Gomadam, Ajith Harshana Ranabahu Sep 2008

Semantics Enhanced Services: Meteor-S, Sawsdl And Sa-Rest, Amit P. Sheth, Karthik Gomadam, Ajith Harshana Ranabahu

Kno.e.sis Publications

Services Research Lab at the Knoesis center and the LSDIS lab at University of Georgia have played a significant role in advancing the state of research in the areas of workflow management, semantic Web services and service oriented computing. Starting with the METEOR workflow management system in the 90's, researchers have addressed key issues in the area of semantic Web services and more recently, in the domain of RESTful services and Web 2.0. In this article, we present a brief discussion on the various contributions of METEOR-S including SAWSDL, publication and discovery of semantic Web services, data mediation, dynamic configuration …

Go to article

Challenges Of Creating A Knowledge-Based Society: Education & Research For India & Gujarat, Amit P. Sheth Aug 2008

Challenges Of Creating A Knowledge-Based Society: Education & Research For India & Gujarat, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Tcruzikb: Enabling Complex Queries For Genomic Data Exploration, Pablo N. Mendes, Bobby Mcknight, Amit P. Sheth, Jessica C. Kissinger Aug 2008

Tcruzikb: Enabling Complex Queries For Genomic Data Exploration, Pablo N. Mendes, Bobby Mcknight, Amit P. Sheth, Jessica C. Kissinger

Kno.e.sis Publications

We developed a novel analytical environment to aid in the examination of the extensive amount of interconnected data available for genome projects. Our focus is to enable flexibility and abstraction from implementation details, while retaining the expressivity required for post-genomic research. To achieve this goal, we associated genomics data to ontologies and implemented a query formulation and execution environment with added visualization capabilities. We use ontology schemas to guide the user through the process of building complex queries in a flexible Web interface. Queries are serialized in SPARQL and sent to servers via Ajax. A component for visualization of the …

Go to article

Text Analytics For Semantic Computing - The Good, The Bad And The Ugly, Meenakshi Nagarajan, Cartic Ramakrishnan, Amit P. Sheth Aug 2008

Text Analytics For Semantic Computing - The Good, The Bad And The Ugly, Meenakshi Nagarajan, Cartic Ramakrishnan, Amit P. Sheth

Kno.e.sis Publications

This tutorial was give at the Second IEEE International Conference on Semantic Computing Santa Clara, CA, USA - August 4-7, 2008.

Go to article

Connectionist Model Generation: A First-Order Approach, Sebastian Bader, Pascal Hitzler, Steffen Holldobler Aug 2008

Connectionist Model Generation: A First-Order Approach, Sebastian Bader, Pascal Hitzler, Steffen Holldobler

Computer Science and Engineering Faculty Publications

Knowledge-based artificial neural networks have been applied quite successfully to propositional knowledge representation and reasoning tasks. However, as soon as these tasks are extended to structured objects and structure-sensitive processes as expressed e.g., by means of first-order predicate logic, it is not obvious at all what neural-symbolic systems would look like such that they are truly connectionist, are able to learn, and allow for a declarative reading and logical reasoning at the same time. The core method aims at such an integration. It is a method for connectionist model generation using recurrent networks with feed-forward core. We show in this …

Go to article

Mediatability: Estimating The Degree Of Human Involvement In Xml Schema Mediation, Karthik Gomadam, Ajith Harshana Ranabahu, Lakshmish Ramaswamy, Amit P. Sheth, Kunal Verma Aug 2008

Mediatability: Estimating The Degree Of Human Involvement In Xml Schema Mediation, Karthik Gomadam, Ajith Harshana Ranabahu, Lakshmish Ramaswamy, Amit P. Sheth, Kunal Verma

Kno.e.sis Publications

Mediation and integration of data are significant challenges because the number of services on the Web, and heterogeneities in their data representation, continue to increase rapidly. To address these challenges we introduce a new measure, mediatability, which is a quantifiable and computable metric for the degree of human involvement in XML schema mediation. We present an efficient algorithm to compute mediatability and an experimental study to analyze how semantic annotations affect the ease of mediating between two schemas. We validate our approach by comparing mediatability scores generated by our system with user-perceived difficulty. We also evaluate the scalability of our …

Go to article

An Xml-Based Approach To Handling Tables In Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni Aug 2008

An Xml-Based Approach To Handling Tables In Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni

Kno.e.sis Publications

We explore application of XML technology for handling tables in legacy semi-structured documents. Specifically, we analyze annotating heterogeneous documents containing tables to obtain a formalized XML Master document that improves traceability (hence easing verification and update) and enables manipulation using XSLT stylesheets. This approach is useful when table instances far outnumber distinct table types because the effort required to annotate a table instance is relatively less compared to formalizing table processing that respects table’s semantics. This work is also relevant for authoring new documents with tables that should be accessible to both humans and machines.

Go to article

Applications Of Voting Theory To Information Mashups, Alfredo Alba, Varun Bhagwan, Julia Grace, Daniel Gruhl, Kevin Haas, Meenakshi Nagarajan, Jan Pieper, Christine Robson, Nachiketa Sahoo Aug 2008

Applications Of Voting Theory To Information Mashups, Alfredo Alba, Varun Bhagwan, Julia Grace, Daniel Gruhl, Kevin Haas, Meenakshi Nagarajan, Jan Pieper, Christine Robson, Nachiketa Sahoo

Kno.e.sis Publications

Blogs, discussion forums and social networking sites are an excellent source for people's opinions on a wide range of topics. We examine the application of voting theory to "information mashups" - the combining and summarizing of data from the multitude of often-conflicting sources. This paper presents an information mashup in the music domain: a Top 10 artist chart based on user comments and listening behavior from several Web communities. We consider different voting systems as algorithms to combine opinions from multiple sources and evaluate their effectiveness using social welfare functions. Different voting schemes are found to work better in some …

Go to article

Dependence Of Binary Associations On Co-Occurrence Granularity In News Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik Jul 2008

Dependence Of Binary Associations On Co-Occurrence Granularity In News Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik

Kno.e.sis Publications

We describe and formalize an approach to correlate binary associations (such as between entities and events, between persons and events, etc.) implied by News documents on the co-occurrence granularity (such as document-level, paragraph-level, sentence-level, etc.) of the corresponding text phrases in the documents. Specifically, we present both qualitative and quantitative characterization of searching News documents: former in terms of the nature of the content and the queries, and latter in terms of a metric obtained by adapting the notions of precision and recall. Specifically, the approach tries to reduce the manual effort required to analyze the News documents to compare …

Go to article

Semantic Web: Promising Technologies, Current Applications & Future Directions, Amit P. Sheth Jul 2008

Semantic Web: Promising Technologies, Current Applications & Future Directions, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Description Logic Rules, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler Jul 2008

Description Logic Rules, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show that the DL SROIQ – the basis for the ongoing standardisation of OWL 2 – can completely internalise DL rules. On the other hand, DL rules capture many expressive features of SROIQ that are not available in simpler DLs yet. While reasoning in SROIQ …

Go to article

Boosting With Incomplete Information, Gholamreza Haffari, Yang Wang, Shaojun Wang, Greg Mori, Feng Jiao Jul 2008

Boosting With Incomplete Information, Gholamreza Haffari, Yang Wang, Shaojun Wang, Greg Mori, Feng Jiao

Kno.e.sis Publications

In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we present a boosting approach that integrates features with incomplete information and those with complete information to form a strong classifier. By introducing hidden variables to model missing information, we form loss functions that combine fully labeled data with partially labeled data to effectively learn normalized and unnormalized models. The primal problems of the proposed optimization problems with these loss functions are provided to show their close relationship and the motivations behind them. …

Go to article

Cs 242: Computer Programming Iii, Guozhu Dong Jul 2008

Cs 242: Computer Programming Iii, Guozhu Dong

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan Jul 2008

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., Scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will be coded in Java 5 and in Scheme.

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Jul 2008

Cs 415: 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.

Go to article

Cs 240: Computer Programming I, Travis E. Doom Jul 2008

Cs 240: Computer Programming I, Travis E. Doom

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. Prerequisite: MTH 130 or MPL 5.

Go to article

Cs 205-02: Introduction To Computers And Office Productivity Software, John P. Herzog Jul 2008

Cs 205-02: Introduction To Computers And Office Productivity Software, John P. Herzog

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing (intermediate), spreadsheets, database and presentation graphics using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of the basics of computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.

Go to article

Ceg 720-01: Computer Architecture I, Soon M. Chung Jul 2008

Ceg 720-01: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer; pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing. 3 hours lecture and 2 hours lab.

Go to article

Ceg 233-01: Linux And Windows, Bin Wang Jul 2008

Ceg 233-01: Linux And Windows, Bin Wang

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and HTTPS. System Administration. 4 credit hours. 3 hours labs, 2 hours labs. Prerequisites: None.

Go to article

Ceg 460/660-01: Computer Engineering, Eric Maston Jul 2008

Ceg 460/660-01: Computer Engineering, Eric Maston

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large program. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Go to article

Ceg 720-01: Computer Architecture, Jack Jean Jul 2008

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 433/633-01: Operating Systems, Yong Pei Jul 2008

Ceg 433/633-01: Operating Systems, Yong Pei

Computer Science & Engineering Syllabi

This course provides an introduction to operating system design. Topics to be covered include: Operating system structures, Operating system interfaces, Process management and scheduling, Inter-process communication, File systems and Memory management and Device access.

Go to article

Ceg 360/560-01: Digital System Design, Travis E. Doom Jul 2008

Ceg 360/560-01: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG 260.

Go to article

Cs 241: Computer Programming Ii, Eric Maston Jul 2008

Cs 241: Computer Programming Ii, Eric Maston

Computer Science & Engineering Syllabi

This is the second course in the Introduction to Computer Programming series. A continuation of CS240. The emphasis is on data abstraction and software development. Prerequisite: CS240.

Go to article

A Framework For Trust And Distrust Networks, Krishnaprasad Thirunarayan Jun 2008

A Framework For Trust And Distrust Networks, Krishnaprasad Thirunarayan

Kno.e.sis Publications

In this age of internet and electronic commerce it is becoming increasingly important to have and to manipulate information about the trustworthiness of the content or service providers in order to make informed decisions. This paper explores realistic models of trust and distrust based on partially ordered discrete values and proposes a framework, which is sensitive to local, relative ordering of values rather than their magnitudes. The framework distinguishes between direct and inferred trust, preferring direct information over possibly conflicting inferred information. It also represents ambiguity or inconsistency explicitly. The framework is capable of handling general trust and belief networks …

Go to article

A Forgetting-Based Approach For Reasoning With Inconsistent Distributed Ontologies, Guilin Qi, Yimin Wang, Peter Haase, Pascal Hitzler Jun 2008

A Forgetting-Based Approach For Reasoning With Inconsistent Distributed Ontologies, Guilin Qi, Yimin Wang, Peter Haase, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In the context of multiple distributed ontologies, we are often confronted with the problem of dealing with inconsistency. In this paper, we propose an approach for reasoning with inconsistent distributed ontologies based on concept forgetting. We firstly define concept forgetting in description logics. We then adapt the notions of recoveries and preferred recoveries in propositional logic to description logics. Two consequence relations are then defined based on the preferred recoveries.

Go to article

Graph Summaries For Subgraph Frequency Estimation, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman Jun 2008

Graph Summaries For Subgraph Frequency Estimation, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman

Kno.e.sis Publications

A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the frequency of substructures within a query graph. In this work, we present and evaluate two techniques for estimating the frequency of subgraphs from a summary of the data graph. In the first technique, we assume that edge occurrences on edge sequences are position independent and summarize only the most informative dependencies. In the second technique, we prune small subgraphs using a valuation scheme that blends information about their importance and estimation power. In both …

Go to article

Defeasible Inference With Circumscriptive Owl Ontologies, Stephan Grimm, Pascal Hitzler Jun 2008

Defeasible Inference With Circumscriptive Owl Ontologies, Stephan Grimm, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The Web Ontology Language (OWL) adheres to the openworld assumption and can thus not be used for forms of nonmonotonic reasoning or defeasible inference, an acknowledged desirable feature in open Semantic Web environments. We investigate the use of the formalism of circumscriptive description logics (DLs) to realise defeasible inference within the OWL framework. By example, we demonstrate how reasoning with (restricted) circumscribed OWL ontologies facilitates various forms of defeasible inference, also in comparison to alternative approaches. Moreover, we sketch an extension to DL tableaux for handling the circumscriptive case and report on a preliminary implementation.

Go to article

First Prev Next Last