Physical Sciences and Mathematics Commons^™

Research In Semantic Web And Information Retrieval: Trust, Sensors, And Search, Krishnaprasad Thirunarayan

Kno.e.sis Publications

No abstract provided.

Towards Reasoning Pragmatics, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenges, which force us to question established lines of research and to rethink the underlying approaches.

Morphology Of The Dayside Ionosphere Of Mars: Implications For Ion Outflows, Jane L. Fox

Physics Faculty Publications

Significant fluxes of tailward streaming ions have been detected in the Martian wake by instruments on spacecraft. Imposing outward fluxes at the top of a model will produce dayside ion density profiles that are characterized by smaller scale heights than those of diffusive equilibrium. We determine the maximum outward fluxes of ions, and those implied by radio occultation data, by constructing ∼180 models, with upward velocity boundary conditions in the range from 0 to (7–8) × 10⁵ cm s⁻¹ in small increments. As the upward velocity is increased, the topside ion or electron densities decrease until eventually the …

A Contrast Pattern Based Clustering Quality Index For Categorical Data, Qingbao Liu, Guozhu Dong

Kno.e.sis Publications

Since clustering is unsupervised and highly explorative, clustering validation (i.e. assessing the quality of clustering solutions) has been an important and long standing research problem. Existing validity measures have significant shortcomings. This paper proposes a novel contrast pattern based clustering quality index (CPCQ) for categorical data, by utilizing the quality and diversity of the contrast patterns (CPs) which contrast the clusters in clusterings. High quality CPs can characterize clusters and discriminate them against each other. Experiments show that the CPCQ index (1) can recognize that expert-determined classes are the best clusters for many datasets from the UCI repository; (2) does …

Sparql Query Re-Writing For Spatial Datasets Using Partonomy Based Transformation Rules, Prateek Jain, Cory Andrew Henson, Amit P. Sheth, Peter Z. Yeh, Kunal Verma

Kno.e.sis Publications

Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying ontology’s containing spatial information, the precise relationships between spatial entities has to be specified in the basic graph pattern of SPARQL query which can result in long and complex queries. We present a novel approach to help users intuitively write SPARQL queries to query spatial data, rather than relying on knowledge of the ontology structure. Our framework re-writes queries, using transformation rules to exploit part-whole relations between geographical entities to address the mismatches between query …

A Local Qualitative Approach To Referral And Functional Trust, Krishnaprasad Thirunarayan, Dharan Althuru, Cory Andrew Henson, Amit P. Sheth

Kno.e.sis Publications

Trust and confidence are becoming key issues in diverse applications such as ecommerce, social networks, semantic sensor web, semantic web information retrieval systems, etc. Both humans and machines use some form of trust to make informed and reliable decisions before acting. In this work, we briefly review existing work on trust networks, pointing out some of its drawbacks. We then propose a local framework to explore two different kinds of trust among agents called referral trust and functional trust, that are modelled using local partial orders, to enable qualitative trust personalization. The proposed approach formalizes reasoning with trust, distinguishing between …

An Anytime Algorithm For Computing Inconsistency Measurement, Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zuoquan Lin

Computer Science and Engineering Faculty Publications

Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods have been proposed to solve this problem and a main class of them is based on some kind of paraconsistent semantics. In this paper, we consider the computational aspects of inconsistency degrees of propositional knowledge bases under 4-valued semantics. We first analyze its computational complexity. As it turns out that computing the exact inconsistency degree is intractable, we then propose an anytime algorithm that provides tractable approximation of the inconsistency degree from above and below. We show that …

The Regular Excluded Minors For Signed-Graphic Matroids, Hongxun Qin, Dan Slilaty, Xiangqian Zhou

Mathematics and Statistics Faculty Publications

We show that the complete list of regular excluded minors for the class of signed-graphic matroids is M*(G₁),...,M*(G₂₉),R₁₅,R₁₆. Here G₁,...,G₂₉ are the vertically 2-connected excluded minors for the class of projective-planar graphs and R₁₅ and R₁₆ are two regular matroids that we will define in the article.

Ontology-Driven Provenance Management In Escience: An Application In Parasite Research, Satya S. Sahoo, D. Brent Weatherly, Raghava Mutharaju, Pramod Anantharam, Amit P. Sheth, Rick L. Tarleton

Kno.e.sis Publications

Provenance, from the French word “provenir”, describes the lineage or history of a data entity. Provenance is critical information in scientific applications to verify experiment process, validate data quality and associate trust values with scientific results. Current industrial scale eScience projects require an end-to-end provenance management infrastructure. This infrastructure needs to be underpinned by formal semantics to enable analysis of large scale provenance information by software applications. Further, effective analysis of provenance information requires well-defined query mechanisms to support complex queries over large datasets. This paper introduces an ontology-driven provenance management infrastructure for biology experiment data, as part …

3d Reconstruction And Visualization Of A Hovering Dragonfly, Christopher Koehler, Thomas Wischgoll, Haibo Dong, Zachary Gaston, Hui Wan

Computer Science and Engineering Faculty Publications

No abstract provided.

A Survey Of The Semantic Specification Of Sensors, Michael Compton, Cory Andrew Henson, Laurent Lefort, Holger Neuhaus, Amit P. Sheth

Kno.e.sis Publications

Semantic sensor networks use declarative descriptions of sensors promote reuse and integration, and to help solve the difficulties of installing, querying and maintaining complex, heterogeneous sensor networks. This paper reviews the state of the art for the semantic specification of sensors, one of the fundamental technologies in the semantic sensor network vision. Twelve sensor ontologies are reviewed and analysed for the range and expressive power of their concepts. The reasoning and search technology developed in conjunction with these ontologies is also reviewed, as is technology for annotating OGC standards with links to ontologies. Sensor concepts that cannot be expressed accurately …

Provenir Ontology: Towards A Framework For Escience Provenance Management, Satya S. Sahoo, Amit P. Sheth

Kno.e.sis Publications

Provenance metadata describes the 'lineage' or history of an entity and necessary information to verify the quality of data, validate experiment protocols, and associate trust value with scientific results. eScience projects generate data and the associated provenance metadata in a distributed environment (such as myGrid) and on a very large scale that often precludes manual analysis. Given this scenario, provenance information should be, (a) interoperable across projects, research groups, and application domains, and (b) support analysis over large datasets using reasoning to discover implicit information. In this paper, we introduce an ontology-driven framework for eScience provenance management underpinned by an …

Fantom - Lessons Learned From Design, Implementation, Administration, And Use Of A Visualization System For Over 10 Years, Alexander Wiebel, Christoph Garth, Mario Hlawitschka, Thomas Wischgoll, Gerik Scheuermann

Computer Science and Engineering Faculty Publications

No abstract provided.

Ceg 210: Pc Networking I, Chris P. Fickert

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 141: Computer Programming - I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer 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. Prerequisite: MTH 127 (College Algebra) or equivalent.

Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros

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.

Cs 208: Computer Programming For Business I, David M. Hutchison

Computer Science & Engineering Syllabi

CS 208 is the first In a sequence of two programming classes required for MIS majors. This course will introduce students to the basic concepts of programming. Examples are from business applications and display graphics and emphasis is on problem solving with the computer as a tool.

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.

Cs 240: Computer Programming I, Sarah Gothard

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced.
Emphasis is on structured programming and stepwise refinement.

Cs 214: Visual Basic Programming, Vanessa Starkey

Computer Science & Engineering Syllabi

This course will cover the fundamentals of object-oriented computer
programming including design, structure, debugging, and testing. Visual Basic 2008 will be used for
developing programs.

Cs 242: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241: Computer Science Ii, Travis E. Doom

Computer Science & Engineering Syllabi

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

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 Dietel et al 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.

Cs 405/605-02: Introduction To Database Management Systems, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the following topics: (1) Logical and physical aspects of database management systems (2) Data models including entity-relationship (ER) and relational models (3) Physical implementation (data organization and indexing) methods. (4) Query languages including SQL, relational algebra, and relational calculus. Students will gain experience in creating and manipulating a database, and gain knowledge on professional and ethical responsibility and on the importance of privacy/security of data.

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 475/675: Web Information Systems, Amit P. Sheth

Computer Science & Engineering Syllabi

This course covers advanced topics in managing W eh-based resources, with a focus on building applications involving heterogeneous data. It will expose students to the following concept, topics, architectures, techniques, and technologies:

• data, metadata, information, knowledge, and ontologies
• unstructured, semi-structured, structured, multimodal, multimedia, and sensor data syntax,
structural/representational, and semantic aspects of data
• architectures: federated databases, mediator, information brokering
• integration and analysis of Web-based information
• automatic information/metadata extraction (entity identification/recognition, disambiguation)
• Web search engines, social networks, Web 2.0
• Semantic Web and Web 3.0
• relevant Web standards and technologies
• real-world examples that …

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 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.

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 5 and in scheme.