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

Physical Sciences and Mathematics Commons™

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

Wright State University

2010

Discipline
Keyword
Publication
Publication Type

Articles 1 - 30 of 259

Full-Text Articles in Physical Sciences and Mathematics

Spatial Semantics For Better Interoperability And Analysis: Challenges And Experiences In Building Semantically Rich Applications In Web 3.0, Amit P. Sheth Dec 2010

Spatial Semantics For Better Interoperability And Analysis: Challenges And Experiences In Building Semantically Rich Applications In Web 3.0, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Flexible Bootstrapping-Based Ontology Alignment, Prateek Jain, Pascal Hitzler, Amit P. Sheth Nov 2010

Flexible Bootstrapping-Based Ontology Alignment, Prateek Jain, Pascal Hitzler, Amit P. Sheth

Kno.e.sis Publications

BLOOMS (Jain et al, ISWC2010) is an ontology alignment system which, in its core, utilizes the Wikipedia category hierarchy for establishing alignments. In this paper, we present a Plug-and-Play extension to BLOOMS, which allows to flexibly replace or complement the use of Wikipedia by other online or offline resources, including domain-specific ontologies or taxonomies. By making use of automated translation services and of Wikipedia in languages other than English, it makes it possible to apply BLOOMS to alignment tasks where the input ontologies are written in different languages.

Go to article

The Positive Solutions Of The Matukuma Equation And The Problem Of Finite Radius And Finite Mass, Jurgen Batt, Yi Li Nov 2010

The Positive Solutions Of The Matukuma Equation And The Problem Of Finite Radius And Finite Mass, Jurgen Batt, Yi Li

Yi Li

This work is an extensive study of the 3 different types of positive solutions of the Matukuma equation 1r2(r2ϕ′)′=−rλ−2(1+r2)λ/2ϕp,p>1,λ>0 : the E-solutions (regular at r = 0), the M-solutions (singular at r = 0) and the F-solutions (whose existence begins away from r = 0). An essential tool is a transformation of the equation into a 2-dimensional asymptotically autonomous system, whose limit sets (by a theorem of H. R. Thieme) are the limit sets of Emden–Fowler systems, and serve as to characterizate the different solutions. The emphasis lies on the study of the M-solutions. …

Go to article

The Positive Solutions Of The Matukuma Equation And The Problem Of Finite Radius And Finite Mass, Jurgen Batt, Yi Li Nov 2010

The Positive Solutions Of The Matukuma Equation And The Problem Of Finite Radius And Finite Mass, Jurgen Batt, Yi Li

Mathematics and Statistics Faculty Publications

This work is an extensive study of the 3 different types of positive solutions of the Matukuma equation 1r2(r2ϕ′)′=−rλ−2(1+r2)λ/2ϕp,p>1,λ>0 : the E-solutions (regular at r = 0), the M-solutions (singular at r = 0) and the F-solutions (whose existence begins away from r = 0). An essential tool is a transformation of the equation into a 2-dimensional asymptotically autonomous system, whose limit sets (by a theorem of H. R. Thieme) are the limit sets of Emden–Fowler systems, and serve as a characterization of the different solutions. The emphasis lies on the study of the M …

Go to article

Defects At Oxygen Plasma Cleaned Zno Polar Surfaces, Y. F. Dong, Z-Q. Fang, David C. Look, Daniel R. Doutt, G. Cantwell, J. Zhang, J. J. Song, L. J. Brillson Nov 2010

Defects At Oxygen Plasma Cleaned Zno Polar Surfaces, Y. F. Dong, Z-Q. Fang, David C. Look, Daniel R. Doutt, G. Cantwell, J. Zhang, J. J. Song, L. J. Brillson

Physics Faculty Publications

Depth-resolved cathodoluminescence spectroscopy (DRCLS) reveals the evolution of surface and near surface defects at polar surfaces with remote oxygen plasma (ROP) treatment. Furthermore, this evolution exhibits significant differences that depend on surface polarity. ROP decreased the predominant 2.5 eV defect emission related to oxygen vacancies on the O face, while creating a new 2.1 eV defect emission on the Zn face that increases with ROP time. The surface-located 2.1 eV emission correlates with carrier profiles from capacitance-voltage measurements and a shift of the E3 trap to higher binding energy from deep level transient spectroscopy (DLTS). This result suggests that ROP …

Go to article

A Clustering Comparison Measure Using Density Profiles And Its Application To The Discovery Of Alternate Clusterings, Eric Bae, James Bailey, Guozhu Dong Nov 2010

A Clustering Comparison Measure Using Density Profiles And Its Application To The Discovery Of Alternate Clusterings, Eric Bae, James Bailey, Guozhu Dong

Kno.e.sis Publications

Data clustering is a fundamental and very popular method of data analysis. Its subjective nature, however, means that different clustering algorithms or different parameter settings can produce widely varying and sometimes conflicting results. This has led to the use of clustering comparison measures to quantify the degree of similarity between alternative clusterings. Existing measures, though, can be limited in their ability to assess similarity and sometimes generate unintuitive results. They also cannot be applied to compare clusterings which contain different data points, an activity which is important for scenarios such as data stream analysis. In this paper, we introduce a …

Go to article

Ontology Alignment For Linked Open Data, Prateek Jain, Pascal Hitzler, Amit P. Sheth, Kunal Verma, Peter Z. Yeh Nov 2010

Ontology Alignment For Linked Open Data, Prateek Jain, Pascal Hitzler, Amit P. Sheth, Kunal Verma, Peter Z. Yeh

Kno.e.sis Publications

The Web of Data currently coming into existence through the Linked Open Data (LOD) effort is a major milestone in realizing the Semantic Web vision. However, the development of applications based on LOD faces difficulties due to the fact that the different LOD datasets are rather loosely connected pieces of information. In particular, links between LOD datasets are almost exclusively on the level of instances, and schema-level information is being ignored. In this paper, we therefore present a system for finding schema-level links between LOD datasets in the sense of ontology alignment. Our system, called BLOOMS, is based on the …

Go to article

Three-Dimensional Stereoscopic Exploration System For The Heart, Thomas Wischgoll Oct 2010

Three-Dimensional Stereoscopic Exploration System For The Heart, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.

Go to article

Student Fact Book, Fall 2010, Thirty-Fourth Annual Edition, Wright State University, Office Of Student Information Systems, Wright State University Oct 2010

Student Fact Book, Fall 2010, Thirty-Fourth Annual Edition, Wright State University, Office Of Student Information Systems, Wright State University

Wright State University Student Fact Books

The student fact book has general demographic information on all students enrolled at Wright State University for Fall Quarter, 2010.

Go to article

Cs/Mth 316/516: Survey Of Numerical Methods For Computational Science, Ronald F. Taylor Oct 2010

Cs/Mth 316/516: Survey Of Numerical Methods For Computational Science, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences and engineering. Included will be methods for interpolation, data smoothing, integration, differentiation, and solution of systems of linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to science, engineering and applied mathematics are an integral part of the course. Special topics presented as schedule permits. Four hours lecture.

Go to article

Cs 141: Computer Programming I, Vanessa Starkey Oct 2010

Cs 141: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Introduction to use of computers as a problem-solving tool. Examples from and applications to a broad range of problems. Methodology for algorithm design and for structured modular implementation is stressed. Three hours lecture, two hours lab.

Go to article

Cs 240: Computer Programming - I, Dale E. Nelson Oct 2010

Cs 240: Computer Programming - I, Dale E. Nelson

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours.

Go to article

Cs 205: Introduction To Computers And Office Productivity Software, John P. Herzog Oct 2010

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

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including intermediate word processing, 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

Cs 241: Computer Programming, Travis E. Doom Oct 2010

Cs 241: Computer Programming, Travis E. Doom

Computer Science & Engineering Syllabi

A continuation of CS240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.

Go to article

Cs 209: Computer Programming For Business Ii, David M. Hutchison Oct 2010

Cs 209: Computer Programming For Business Ii, David M. Hutchison

Computer Science & Engineering Syllabi

CS 209 is the second in a sequence of two programming classes required for MIS majors. This course will continue teaching students to the basic concepts of programming. Examples are from business applications and emphasis is on problem solving with the computer as a tool.

Go to article

Cs 242: Computer Programming Iii, Mateen M. Rizki Oct 2010

Cs 242: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 400/600: Data Structures And Software Design, Meilin Liu Oct 2010

Cs 400/600: 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.

Go to article

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan Oct 2010

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in Python. You are expected to learn the language and solve a set of programming problems assigned to you from Budd's text using Python available from http://www.python.org. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.

Go to article

Cs 410/610: Theoretical Foundations Of Computing, Pascal Hitzler Oct 2010

Cs 410/610: Theoretical Foundations Of Computing, Pascal Hitzler

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 405/605: Introduction To Database Management Systems, Soon M. Chung Oct 2010

Cs 405/605: Introduction To Database Management Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Entity Relationship, relational, object-oriented models for databases are presented. Physical implementation methods are discussed.

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Oct 2010

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 480/680: Comparative Languages, Krishnaprasad Thirunarayan Oct 2010

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modem 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 and in Scheme.

Go to article

Cs 499/699: Cloud Computing, Keke Chen Oct 2010

Cs 499/699: Cloud Computing, Keke Chen

Computer Science & Engineering Syllabi

This is an introductory course to cloud computing. In this course, we will explore a few aspects of cloud computing virtualization, security & privacy, Amazon Web Services, and interactive web-based applications. Students are expected in the class discussion is strongly encouraged. Guest speakers might be invited for some particular topics. (3 Hours)

Go to article

Cs 705: Introduction To Data Mining, Guozhu Dong Oct 2010

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel and useful knowledge from large amounts of data. This course introduces and studies the fundamental concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, mining of spatial/text/sequence/graph/time-series etc data, privacy, data mining applications, and other topics of interest. 3 hours lecture, 2 hours lab.

Go to article

Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan Oct 2010

Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.

Go to article

Cs 784: Programming Languages, Prabhaker Mateti Oct 2010

Cs 784: Programming Languages, Prabhaker Mateti

Computer Science & Engineering Syllabi

Programming paradigms and concepts for high level programming languages. Techniques for formal specification. 4.000 Credit hours. Prerequisites: CS 480/680.

Go to article

The Statistical Properties Of The Survivor Interaction Contrast, Joseph W. Houpt, James T. Townsend Oct 2010

The Statistical Properties Of The Survivor Interaction Contrast, Joseph W. Houpt, James T. Townsend

Joseph W. Houpt

The Survivor Interaction Contrast (SIC) is a powerful tool for assessing the architecture and stopping rule of a model of mental processes. Despite its demonstrated utility, the methodology has lacked a method for statistical testing until now. In this paper we briefly describe the SIC then develop some basic statistical properties of the measure. These developments lead to a statistical test for rejecting certain classes of models based on the SIC. We verify these tests using simulated data, then demonstrate their use on data from a simple cognitive task.

Go to article

Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer Oct 2010

Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 466/666: Introduction To Formal Languages, Guozhu Dong Oct 2010

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the syntax of languages can be defined using grammars and the patterns accepted by finite state machines. Along with presenting the fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science, by Thomas Sudkamp.

Go to article

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang Oct 2010

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Next Last