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

Physical Sciences and Mathematics Commons™

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

Wright State University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 2191 - 2220 of 3840

Full-Text Articles in Physical Sciences and Mathematics

Semantic Sensor Web, Amit P. Sheth, Cory Andrew Henson Feb 2008

Semantic Sensor Web, Amit P. Sheth, Cory Andrew Henson

Kno.e.sis Publications

No abstract provided.

Go to article

The State Of The Art In Flow Visualization: Partition-Based Techniques, Tobias Salzbrunn, Heike Janicke, Thomas Wischgoll, Gerik Scheuermann Feb 2008

The State Of The Art In Flow Visualization: Partition-Based Techniques, Tobias Salzbrunn, Heike Janicke, Thomas Wischgoll, Gerik Scheuermann

Computer Science and Engineering Faculty Publications

Flow visualization has been a very active subfield of scientific visualization in recent years. From the resulting large variety of methods this paper discusses partition-based techniques. The aim of these approaches is to partition the flow in areas of common structure. Based on this partitioning, subsequent visualization techniques can be applied. A classification is suggested and advantages/disadvantages of the different techniques are discussed as well.

Go to article

Botsniffer: Detecting Botnet Command And Control Channels In Network Traffic, Guofei Gu, Junjie Zhang, Wenke Lee Feb 2008

Botsniffer: Detecting Botnet Command And Control Channels In Network Traffic, Guofei Gu, Junjie Zhang, Wenke Lee

Computer Science and Engineering Faculty Publications

Botnets are now recognized as one of the most serious security threats. In contrast to previous malware, botnets have the characteristic of a command and control (C&C) channel. Botnets also often use existing common protocols, e.g., IRC, HTTP, and in protocol-conforming manners. This makes the detection of botnet C&C a challenging problem. In this paper, we propose an approach that uses network-based anomaly detection to identify botnet C&C channels in a local area network without any prior knowledge of signatures or C&C server addresses. This detection approach can identify both the C&C servers and infected hosts in the network. Our …

Go to article

Approximate Owl Instance Retrieval With Screech, Pascal Hitzler, Markus Krotzsch, Sebastian Rudolph, Tuvshintur Tserendorj Feb 2008

Approximate Owl Instance Retrieval With Screech, Pascal Hitzler, Markus Krotzsch, Sebastian Rudolph, Tuvshintur Tserendorj

Computer Science and Engineering Faculty Publications

With the increasing interest in expressive ontologies for the Semantic Web, it is critical to develop scalable and efficient ontology reasoning techniques that can properly cope with very high data volumes. For certain application domains, approximate reasoning solutions, which trade soundness or completeness for increased reasoning speed, will help to deal with the high computational complexities which state of the art ontology reasoning tools have to face. In this paper, we present a comprehensive overview of the SCREECH approach to approximate instance retrieval with OWL ontologies, which is based on the KAON2 algorithms, facilitating a compilation of OWL DL TBoxes …

Go to article

Semantics And Services Enabled Problem Solving Environment For Trypanosoma Cruzi, Amit P. Sheth, Rick L. Tarleton, Mark Musen, Satya S. Sahoo, Prashant Doshi, Natasha Noy Jan 2008

Semantics And Services Enabled Problem Solving Environment For Trypanosoma Cruzi, Amit P. Sheth, Rick L. Tarleton, Mark Musen, Satya S. Sahoo, Prashant Doshi, Natasha Noy

Kno.e.sis Publications

No abstract provided.

Go to article

Semantic Sensor Web, Cory Andrew Henson Jan 2008

Semantic Sensor Web, Cory Andrew Henson

Kno.e.sis Publications

No abstract provided.

Go to article

Semantic Provenance For Escience: Managing The Deluge Of Scientific Data, Satya S. Sahoo, Amit P. Sheth, Cory Andrew Henson Jan 2008

Semantic Provenance For Escience: Managing The Deluge Of Scientific Data, Satya S. Sahoo, Amit P. Sheth, Cory Andrew Henson

Kno.e.sis Publications

Provenance information in eScience is metadata that's critical to effectively manage the exponentially increasing volumes of scientific data from industrial-scale experiment protocols. Semantic provenance, based on domain-specific provenance ontologies, lets software applications unambiguously interpret data in the correct context. The semantic provenance framework for eScience data comprises expressive provenance information and domain-specific provenance ontologies and applies this information to data management. The authors' "two degrees of separation" approach advocates the creation of high-quality provenance information using specialized services. In contrast to workflow engines generating provenance information as a core functionality, the specialized provenance services are integrated into a scientific workflow …

Go to article

Percolation-Based Techniques For Upscaling The Hydraulic Conductivity Of Semi-Realistic Geological Media, Bilal Idriss Jan 2008

Percolation-Based Techniques For Upscaling The Hydraulic Conductivity Of Semi-Realistic Geological Media, Bilal Idriss

Browse all Theses and Dissertations

I tested three schemes for "upscaling" the hydraulic conductivity (K) on aquifers with bimodal K distributions. This bimodality (e.g., sand and mud deposits) was intended to capture typical geological conditions. Results were tested with a numerical model. Upscaling techniques used were inspired by schemes interpolating between arithmetic and harmonic means, but are based on percolation theory: 1) Critical path analysis (CPA), 2) Percolation path analysis (PPA, or standard scaling), and a novel scaling approach. Models chosen were both spatially correlated and uncorrelated, with important differences in critical percolation probabilities, Pc. Volume fractions Ps and 1-Ps (with Ps = sand volume …

Go to article

Preliminary Results From A Holocene Record From Crystal Lake, Southwestern Ohio, Rebecca Teed, Leigh Deuter, Ashley Kesler, Graham Parker, Melissa Sparks Jan 2008

Preliminary Results From A Holocene Record From Crystal Lake, Southwestern Ohio, Rebecca Teed, Leigh Deuter, Ashley Kesler, Graham Parker, Melissa Sparks

Earth and Environmental Sciences Faculty Publications

No abstract provided.

Go to article

Botminer: Clustering Analysis Of Network Traffic For Protocol- And Structure-Independent Botnet Detection, Guofei Gu, Roberto Perdisci, Junjie Zhang, Wenke Lee Jan 2008

Botminer: Clustering Analysis Of Network Traffic For Protocol- And Structure-Independent Botnet Detection, Guofei Gu, Roberto Perdisci, Junjie Zhang, Wenke Lee

Computer Science and Engineering Faculty Publications

Botnets are now the key platform for many Internet attacks, such as spam, distributed denial-of-service (DDoS), identity theft, and phishing. Most of the current botnet detection approaches work only on specific botnet command and control (C&C) protocols (e.g., IRC) and structures (e.g., centralized), and can become ineffective as botnets change their C&C techniques. In this paper, we present a general detection framework that is independent of botnet C&C protocol and structure, and requires no a priori knowledge of botnets (such as captured bot binaries and hence the botnet signatures, and C&C server names/addresses). We start from the definition and essential …

Go to article

Learning Expressive Ontologies, Johanna Volker, Peter Haase, Pascal Hitzler Jan 2008

Learning Expressive Ontologies, Johanna Volker, Peter Haase, Pascal Hitzler

Computer Science and Engineering Faculty Publications

No abstract provided.

Go to article

A Coherent Well-Founded Model For Hybrid Mknf Knowledge Bases, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler Jan 2008

A Coherent Well-Founded Model For Hybrid Mknf Knowledge Bases, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler

Computer Science and Engineering Faculty Publications

With the advent of the Semantic Web, the question becomes important how to best combine open-world based ontology languages, like OWL, with closed-world rules paradigms. One of the most mature proposals for this combination is known as Hybrid MKNF knowledge bases [11], which is based on an adaptation of the stable model semantics to knowledge bases consisting of ontology axioms and rules. In this paper, we propose a well-founded semantics for such knowledge bases which promises to provide better efficiency of reasoning, which is compatible both with the OWL-based semantics and the traditional well-founded semantics for logic programs, and which …

Go to article

What Is Approximate Reasoning?, Sebastian Rudolph, Tuvshintur Tserendorj, Pascal Hitzler Jan 2008

What Is Approximate Reasoning?, Sebastian Rudolph, Tuvshintur Tserendorj, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Approximate reasoning for the Semantic Web is based on the idea of sacrificing soundness or completeness for a significant speed-up of reasoning. This is to be done in such a way that the number of introduced mistakes is at least outweighed by the obtained speed-up. When pursuing such approximate reasoning approaches, however, it is important to be critical not only about appropriate application domains, but also about the quality of the resulting approximate reasoning procedures. With different approximate reasoning algorithms discussed and developed in the literature, it needs to be clarified how these approaches can be compared, i.e. what it …

Go to article

Expressive Tractable Description Logics Based On Sroiq Rules, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler Jan 2008

Expressive Tractable Description Logics Based On Sroiq 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

Cheap Boolean Role Constructors For Description Logics, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler Jan 2008

Cheap Boolean Role Constructors For Description Logics, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today's most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs SHOIQ and SROIQ, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The prominent OWL-fragment SHIQ can be safely extended by safe role expressions, and the tractable fragments EL++ and DLP retain tractability if extended by conjunction on roles, where in the case of DLP the restriction on role simplicity can even be discarded.

Go to article

Origin Of Conductive Surface Layer In Annealed Zno, David C. Look, B. Claflin, Helen Smith Jan 2008

Origin Of Conductive Surface Layer In Annealed Zno, David C. Look, B. Claflin, Helen Smith

Mathematics and Statistics Faculty Publications

The highly conductive surface layers found in nearly all as-grown or annealed bulk ZnO wafers are studied by temperature-dependent Hall-effect and secondary-ion mass spectroscopy (SIMS) measurements. In this work, we have used annealing in N2 at 900 degrees C, and forming gas (5% H2 in N2) at 600 degrees C, to cause a large enough surface conduction that SIMS measurements can be reliably employed. The increased near-surface donor density, as determined from two-layer Hall-effect modeling, is consistent with an increased near-surface concentration of Al, Ga, and In atoms, resulting from diffusion. There is no evidence for …

Go to article

Cs 141-01: Computer Programming I, Michael Ondrasek Jan 2008

Cs 141-01: 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.

Go to article

Cs 142-01: Computer Programming - Ii, Michael Ondrasek Jan 2008

Cs 142-01: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

The concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and handling runtime errors with an emphasis on program verification and testing. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: CS 141 (Computer Programming I) and MTH 127 (College Algebra) or equivalent.

Go to article

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

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.

Go to article

Cs 209-01: Computer Programming For Business Ii, Dennis Kellermeier Jan 2008

Cs 209-01: 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.

Go to article

Cs 701-01: Database Systems And Design, Soon M. Chung Jan 2008

Cs 701-01: Database Systems And Design, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of DB design concepts and operating principles of database systems.

Go to article

Cs 714-01: Machine Learning, Shaojun Wang Jan 2008

Cs 714-01: Machine Learning, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 771-01: Natural Language Processing Techniques, Shaojun Wang Jan 2008

Cs 771-01: Natural Language Processing Techniques, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 765-01: Foundations Of Neurocomputation, John C. Gallagher Jan 2008

Cs 765-01: Foundations Of Neurocomputation, John C. Gallagher

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

Go to article

Cs 790-02: Advanced Data Mining, Guozhu Dong Jan 2008

Cs 790-02: Advanced Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

This course covers advanced topics in data mining. The topics can be roughly classified along the following dimensions: pattern/model types, mining/analysis techniques, and data types. The course will examine sequence mining, text mining, graph mining, data cube mining, microarray gene expression mining, stream mining, time series mining, web mining, bioinformatics, privacy issues, etc.

Go to article

Cs 790-03: Services Science, Yong Pei Jan 2008

Cs 790-03: Services Science, Yong Pei

Computer Science & Engineering Syllabi

Service Science, Management, and Engineering (SSME), often referred to
as Services Science, is emerging as a distinct field of study. It
encompasses numerous areas relating to the increasing role of services
in the world economy. In this course we will focus primarily on
services computing, or the technical aspects of services science, and
secondarily on the allied economic, business, and organizational aspects

Go to article

Cs 317-01: Numerical Methods Ii, Ronald F. Taylor Jan 2008

Cs 317-01: Numerical Methods Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Continuation of CS/MTH/3161516. Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of sources of error in numerical methods. Special topics and applications presented as schedule permits. Four credit hours.

Go to article

Ceg 210-01: Pc Networking I, Karen Meyer Jan 2008

Ceg 210-01: Pc Networking I, Karen Meyer

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.

Go to article

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

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

Go to article

Ceg 221-01: Advanced C Programming For Engineers, Robert Helt Jan 2008

Ceg 221-01: Advanced C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course introduces advanced constructs, algorithms, and data structures in the C programming language. Emphasis is on problem solving and techniques useful to engineers. Topics include functions, array, pointers, structures as well as sorting algorithms, linked lists, complex numbers, stacks, queues, hash tables, and binary trees. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).

Go to article

First Prev Next Last