Computer Sciences Commons^™

Leveraging Semantic Web Techniques To Gain Situational Awareness, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries-namely conjunctive ones-can be used in conjunction with OWL such that one of the major design criteria of the latter-namely decidability-can be retained. More precisely, we show that querying the tractable fragment EL++ of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted EL++ is undecidable.

Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth

Kno.e.sis Publications

Social networking, distributed problem solving and human computation have gained high visibility. Wikipedia is a well established service that incorporates aspects of these three fields of research. For this reason it is a good object of study for determining quality of solutions in a social setting that is open, completely distributed, bottom up and not peer reviewed by certified experts. In particular, this paper aims at identifying semantic convergence of Wikipedia articles; the notion that the content of an article stays stable regardless of continuing edits. This could lead to an automatic recommendation of good article tags but also add …

Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain

Kno.e.sis Publications

Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, the analytical process requires uncovering and analyzing complex thematic relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful for this purpose. However, these analysis mechanisms are primarily intended for thematic relationships. In this paper, we describe a framework built around the RDF metadata model for analysis of thematic, spatial and temporal relationships between named entities. We …

Visualizing Morphometric Data Of Vasculatures, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

Volume visualization is a common, very well-established visualization technique for volumetric data sets. Numerous advancements have been proposed and sophisticated improvements have been implemented to produce elaborated renderings that are capable of enhancing details within the volume. However, volume visualization alone is often not sufficient for the application domain. Often times, researchers are interested in accurate measurements extracted from volumetric data to gain further insight of the specimen. These extracted measurements can then be used to generate and visualize a geometric reconstruction of the specimen. The visualization can incorporate additional tools that allow researchers to determine additional measurements of the …

A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Isolation of translational efficiency bias can have important applications in gene expression prediction and heterologous protein production. In some genomes the presence of a high GC(AT)-content bias can confound the isolation of translational efficiency bias. In other organisms translational efficiency bias is weak making it difficult to isolate. Described here is a multi-objective genetic algorithm that improves the isolation of translational efficiency bias in Streptomyces coelicolor A3(2) and Pseudomonas aeruginosa PAO1, two organisms shown to have high GC-content and weak translational efficiency bias.

Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai

Kno.e.sis Publications

Distributed programming has shifted from private networks to the Internet using heterogeneous Web APIs. This enables the creation of situational applications of composed services exposing user interfaces, i.e., mashups. However, this programmable Web lacks unified models that can facilitate mashup creation, reuse, and deployments. This poster demonstrates a platform to facilitate Web 2.0 mashups.

A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Nuclear magnetic resonance (NMR) spectroscopy is a non-invasive method of acquiring a metabolic profile from biofluids. This metabolic information may provide keys to the early detection of exposure to a toxin. A typical NMR toxicology data set has low sample size and high dimensionality. Thus, traditional pattern recognition techniques are not always feasible. In this paper, we evaluate several common alternatives for isolating these biomarkers. The fold test, unpaired t-test, and paired t-test were performed on an NMR-derived toxicological data set and results were compared. The paired t-test method was preferred, due to its ability to attribute statistical significance, to …

Ceg 220: Introduction To C Programming For Engineers I, 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 I) or EGR 101 (Engineering Mathematics).

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.

Cs 240: Computer Programming I, Dale E. Nelson

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.

Cs 400/600: Computer Science, Eric Maston

Computer Science & Engineering Syllabi

This is the initial course in the understanding of data structures. This course focuses on data structures with abstract data types, such as trees, stacks, queues and graphs. The course will use projects, developed on UNIX, to create a deeper understanding of data structure and their use.

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 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first 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. This course assumes students have never written a program before.

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 790: Information Theory, Machine Learning And Statistics, Shaojun Wang

Computer Science & Engineering Syllabi

Information theory deals with encoding data in order to transmit it correctly and effectively. Statistics and machine learning deal with estimating models of data and predicting future observations. ls there any relationship between the two? It turns out, perhaps not surprisingly, that the most compact encoding of the data is by the probabilistic model that describes it best. In other words, there is a fundamental link between information and probability.

This course starts with the basic notions of information theory and explores its relationship to machine learning and statistics. The course will have a strong theoretical component, but will also …

Cs 214: Visual Basic Programming, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of object computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. However, students should have a familiarity with programming concepts. The concepts covered will be applied in the Visual Basic programming language. 4 credit hours.

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 Science I, Eric Maston

Computer Science & Engineering Syllabi

This is the initial course in the Introduction to Computer Science series. Beginning concepts and programming will be discussed and taught in this course. This course will use Java as the language of implementation.

Ceg 220: Introduction To C Programming For Engineers I, Robert Helt

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 I) or EGR 101 (Engineering Mathematics).f

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.

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel knowledge from large amounts of data. This course introduces and studies the concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.

Cs 784: Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces concepts related to the specification and design of high-level programming languages. It discusses different programming paradigms, algebraic specification and implementation of data types, and develops interpreters for specifying operationally the various programming language features/constructs. It also introduces attribute grammar formalism and axiomatic semantics briefly. The programming assignments will be coded in Scheme.

Cs 240: Computer Programming I, L. Jane Lin

Computer Science & Engineering Syllabi

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

Cs 790-01: Semantic Web-Course, Amit P. Sheth

Computer Science & Engineering Syllabi

No abstract provided.

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 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 399: Computational Science Programming And Algorithms, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introductory course in programming and algorithms for students with an interest or degree option in Computational Science. Topics include the logic and design of procedural programs, floating point arithmetic, vectors, matrices, complex numbers, and elementary data structures. Applications to areas of science and mathematics. Students will learn the basics of C programming as well as the MATLAB computing environment. This distance learning section offered under "Selected Topics" in computer science. 4 quarter credit hours.

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.