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 1681 - 1710 of 3840

Full-Text Articles in Physical Sciences and Mathematics

Cs 470/670: Systems Simulation, Thomas C. Hartrum Apr 2010

Cs 470/670: Systems Simulation, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Introduction to simulation and comparison with other techniques. Discrete simulation models. Introduction to queuing theory and stochastic processes. Comparison of simulation languages. Simulation methodology and selected applications.


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

Cs 242: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 790: Optimizing Compliers For Modern Architectures, Meilin Liu Apr 2010

Cs 790: Optimizing Compliers For Modern Architectures, Meilin Liu

Computer Science & Engineering Syllabi

This course studies compiler optimization for modern architectures. Between parsing the input program and generating the target machine code, optimizing compilers perform a wide range of program transformations on a program to improve its performance. In this course we focus on data dependence analysis, program transformations and loop transformations, loop scheduling, and a combination of these optimizing techniques.


Cs 740: Algorithms, Complexity And The Theory Of Computability, Pascal Hitzler Apr 2010

Cs 740: Algorithms, Complexity And The Theory Of Computability, Pascal Hitzler

Computer Science & Engineering Syllabi

What does it mean to say that some computational problem is intrinsically more difficult than some other problem? How can I claim that I have found a good algorithmic solution? The study of these questions gives rise to an area of Theoretical Computer Science called Complexity Theory, which is based on a systematic and thorough formal study of the complexity of problems with respect to their algorithmic solvability, using Turing machines as main conceptual tool. In this class, we will understand how problem and algorithmic complexity is measured, and discuss some of the main complexity classes arising from this study. …


Cs 240: Computer Programming I, Vanessa Starkey Apr 2010

Cs 240: Computer Programming I, Vanessa Starkey

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, Michael Ondrasek Apr 2010

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 languages. 4 credit hours.


Cs 209: Computer Programming For Business Ii, Dennis Kellermeier Apr 2010

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 205-04, 05, 06: Introduction To Computers And Office Productivity Software, Terri Bauer Apr 2010

Cs 205-04, 05, 06: Introduction To Computers And Office Productivity Software, Terri Bauer

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.


Cs 141: Computer Programming - I, Michael Ondrasek Apr 2010

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.


Ceg 479/679-01: Computer Animation, Thomas Wischgoll Apr 2010

Ceg 479/679-01: Computer Animation, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 463/663-01: The Personal Software Development Process, John A. Reisner Apr 2010

Ceg 463/663-01: The Personal Software Development Process, John A. Reisner

Computer Science & Engineering Syllabi

In this course, you will learn about more about one particular way to address some of the challenges and issues associated with successful software development. Specifically, you will learn and use the Personal Software Process (PSP), designed to help individual software practitioners become more adept at their craft through the use of project planning, project tracking, defect analysis, review and verification activities, software measurement, and process management. This course-and the PSP-are somewhat unique in that they aim to help software engineers become more successful, not by examining issues associated with large-scale development (as is the case with many software engineering …


Ceg 434/634-01: Concurrent Software Design, Douglas J. Kelly Apr 2010

Ceg 434/634-01: Concurrent Software Design, Douglas J. Kelly

Computer Science & Engineering Syllabi

This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency, and their solutions are examined through course projects and through readings on operating system design.


Ceg 403/603-01: Personal Area Networks, Yong Pei Apr 2010

Ceg 403/603-01: Personal Area Networks, Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 320/520-01: Computer Organization, Michael L. Raymer Apr 2010

Ceg 320/520-01: Computer Organization, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 220-01: Introduction To C Programming For Engineers, Jay Dejongh Apr 2010

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 101 (Engineering Mathematics). The course includes a scheduled laboratory section for which you must register.


Ceg 233: Linux And Windows, Sarah Gothard Apr 2010

Ceg 233: Linux And Windows, Sarah Gothard

Computer Science & Engineering Syllabi

The goal is for student to develop an effective operational model of computer systems running either Linux or Windows.

Student should develop a basic understanding of GUI and windowing systems, file and directory structures, processes, command-line utilities and scripting, regular expressions, networking basics, user privileges, and system administration.


What Goes Around Comes Around - Improving Linked Open Data Through On-Demand Model Creation, Christopher Thomas, Wenbo Wang, Pankaj Mehra, Delroy H. Cameron, Pablo N. Mendes, Amit P. Sheth Apr 2010

What Goes Around Comes Around - Improving Linked Open Data Through On-Demand Model Creation, Christopher Thomas, Wenbo Wang, Pankaj Mehra, Delroy H. Cameron, Pablo N. Mendes, Amit P. Sheth

Kno.e.sis Publications

Web 2.0 has changed the way we share and keep up with information. We communicate through social media platforms and make the information we exchange to a large extent publicly available. Linked Open Data (LOD) follows the same paradigm of sharing information but also makes it machine accessible. LOD provides an abundance of structured information albeit in a less formally rigorous form than would be desirable for Semantic Web applications. Nevertheless, most of the LOD assertions are community reviewed and we can rely on their accuracy to a large extent. In this work we want to follow the Web 2.0 …


Modeling And Visualization Of Cardiovascular Systems, Thomas Wischgoll Feb 2010

Modeling And Visualization Of Cardiovascular Systems, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

Modeling complex organs, such as the human heart, requires a detailed understanding of the geometric and mechanical properties of that organ. Similarly, the model is only as accurate as the precision of the underlying properties allow. Hence, it is of great importance that accurate measurements of the geometric configuration are available. This paper describes the different steps that are necessary for creating and visualizing such a vascular model, ranging from determining a basic geometric model, gathering statistical data necessary to extend an existing model up to the visualization of the resulting large-scale vascular models.


Integer Functions On The Cycle Space And Edges Of A Graph, Dan Slilaty Feb 2010

Integer Functions On The Cycle Space And Edges Of A Graph, Dan Slilaty

Mathematics and Statistics Faculty Publications

A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the number of backward edges. Such a homomorphism preserves the parity of the length of a cycle and the image of a cycle is bounded by the length of that cycle. Pretzel and Youngs (SIAM J. Discrete Math. 3(4):544–553, 1990) showed that any Z-module homomorphism of a graph’s cycle space to Z that satisfies these two properties for all cycles must be such a map induced from an edge direction …


Mobility Analysis Of Highly Conducting Thin Films: Application To Zno, David C. Look, K. D. Leedy, D. H. Tomich, B. Bayraktaroglu Feb 2010

Mobility Analysis Of Highly Conducting Thin Films: Application To Zno, David C. Look, K. D. Leedy, D. H. Tomich, B. Bayraktaroglu

Physics Faculty Publications

Hall-effect measurements have been performed on a series of highly conductive thin films of Ga-doped ZnO grown by pulsed laser deposition and annealed in a forming-gas atmosphere (5% H2 in Ar). The mobility as a function of thickness d is analyzed by a simple formula involving only ionized-impurity and boundary scattering and having a single fitting parameter, the acceptor/donor concentration ratio K = NA/ND. For samples with d = 3–100 nm, Kavg = 0.41, giving ND = 4.7×1020 and NA = 1.9×1020 cm−3. Thicker samples require a …


Structural Investigations And Magnetic Properties Of Sol-Gel Ni0.5zn0.5fe2o4 Thin Films For Microwave Heating, Pengzhao Z. Gao, Evgeny V. Rebrov, Tiny M. W. G. M. Verhoeven, Jaap C. Schouten, Richard Kleismit, Gregory Kozlowski, John S. Cetnar, Zafer Turgut, Guru Subramanyam Feb 2010

Structural Investigations And Magnetic Properties Of Sol-Gel Ni0.5zn0.5fe2o4 Thin Films For Microwave Heating, Pengzhao Z. Gao, Evgeny V. Rebrov, Tiny M. W. G. M. Verhoeven, Jaap C. Schouten, Richard Kleismit, Gregory Kozlowski, John S. Cetnar, Zafer Turgut, Guru Subramanyam

Physics Faculty Publications

Nanocrystalline Ni0.5Zn0.5Fe2O4 thin films have been synthesized with various grain sizes by a sol-gel method on polycrystalline silicon substrates. The morphology, magnetic, and microwave absorption properties of the films calcined in the 673–1073 K range were studied with x-ray diffraction, scanning electron microscopy, x-ray photoelectron spectroscopy, atomic force microscopy, vibrating sample magnetometry, and evanescent microwave microscopy. All films were uniform without microcracks. Increasing the calcination temperature from 873 to 1073 K and time from 1 to 3 h resulted in an increase of the grain size from 12 to 27 nm. The saturation …


Estimating Permeability From The Grain-Size Distributions Of Natural Sediment, Lawrence Mastera Jan 2010

Estimating Permeability From The Grain-Size Distributions Of Natural Sediment, Lawrence Mastera

Browse all Theses and Dissertations

Permeability, k, can be estimated using the Kozeny-Carman equation, given a grain-size distribution with any number of grain-size categories and the porosity of a sediment. A recursive method was developed to calculate the effective grain-size parameter, d, for sediment mixtures with more than three grain sizes. The method was tested on four sediment models of sand, gravelly sand, sandy gravel, and open-framework gravel created from grain-size distributions. The k estimated from the recursive method were consistent with physical measurements of k.


Wright State University Fact Sheet, 2009-2010, Office Of Institutional Research & Effectiveness, Wright State University Jan 2010

Wright State University Fact Sheet, 2009-2010, Office Of Institutional Research & Effectiveness, Wright State University

Wright State University Fact Sheets

The Wright State University Fact Sheet showcasing numbers and statistics for Wright State University including demographics, funding, programs, and employment for the 2009-2010 academic year.


A New Perspective On Visual Word Processing Efficiency, Joseph W. Houpt, James T. Townsend Jan 2010

A New Perspective On Visual Word Processing Efficiency, Joseph W. Houpt, James T. Townsend

Joseph W. Houpt

As a fundamental part of our daily lives, visual word processing has received much attention in the psychological literature. Despite the well established perceptual advantages of word and pseudoword context using accuracy, a comparable effect using response times has been elusive. Some researchers continue to question whether the advantage due to word context is perceptual. We use the capacity coefficient, a well established, response time based measure of efficiency to provide evidence of word processing as a particularly efficient perceptual process to complement those results from the accuracy domain.


Existence Of Traveling Wave Solutions For A Nonlocal Reaction-Diffusion Model Of Influenza A Drift, Joaquin Riviera, Yi Li Jan 2010

Existence Of Traveling Wave Solutions For A Nonlocal Reaction-Diffusion Model Of Influenza A Drift, Joaquin Riviera, Yi Li

Yi Li

In this paper we discuss the existence of traveling wave solutions for a nonlocal reaction-diffusion model of Influenza A proposed in Lin et. al. (2003). The proof for the existence of the traveling wave takes advantage of the different time scales between the evolution of the disease and the progress of the disease in the population. Under this framework we are able to use the techniques from geometric singular perturbation theory to prove the existence of the traveling wave.


A Reasonable Semantic Web, Pascal Hitzler, Frank Van Harmelen Jan 2010

A Reasonable Semantic Web, Pascal Hitzler, Frank Van Harmelen

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 forces us to question established lines of research and to rethink the underlying approaches. We argue that reasoning for the Semantic Web should be understood as "shared inference," which is not necessarily based on deductive methods. Model-theoretic semantics (and sound and complete reasoning based on it) functions as a gold standard, but applications dealing with large-scale and noisy data usually cannot afford the required runtimes. Approximate methods, including deductive ones, but also approaches based on …


Nominal Schemas For Integrating Rules And Ontologies, Frederick Maier, Adila A. Krisnadhi, Pascal Hitzler Jan 2010

Nominal Schemas For Integrating Rules And Ontologies, Frederick Maier, Adila A. Krisnadhi, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We propose a description-logic style extension of OWL DL, which includes DL-safe variable SWRL and seamlessly integrates datalog rules. Our language also sports a tractable fragment, which we call ELP 2, covering OWL EL, OWL RL, most of OWL QL, and variable restricted datalog.


Semantic Web – Interoperability, Usability, Applicability, Pascal Hitzler, Krzysztof Janowicz Jan 2010

Semantic Web – Interoperability, Usability, Applicability, Pascal Hitzler, Krzysztof Janowicz

Computer Science and Engineering Faculty Publications

No abstract provided.


Traveling Wave Solutions For A Nonlocal Reaction-Diffusion Model Of Influenza A Drift, Joaquin Riviera, Yi Li Jan 2010

Traveling Wave Solutions For A Nonlocal Reaction-Diffusion Model Of Influenza A Drift, Joaquin Riviera, Yi Li

Mathematics and Statistics Faculty Publications

In this paper we discuss the existence of traveling wave solutions for a nonlocal reaction-diffusion model of Influenza A proposed in Lin et. al. (2003). The proof for the existence of the traveling wave takes advantage of the different time scales between the evolution of the disease and the progress of the disease in the population. Under this framework we are able to use the techniques from geometric singular perturbation theory to prove the existence of the traveling wave.


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

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.