Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (144)
- Engineering (108)
- Computer Engineering (100)
- Bioinformatics (36)
- Communication (36)
-
- Communication Technology and New Media (36)
- Databases and Information Systems (36)
- Life Sciences (36)
- OS and Networks (36)
- Science and Technology Studies (36)
- Social and Behavioral Sciences (36)
- Physics (13)
- Statistics and Probability (6)
- Applied Mathematics (5)
- Applied Statistics (5)
- Mathematics (5)
- Earth Sciences (2)
- Environmental Sciences (2)
- Chemistry (1)
- Institutional and Historical (1)
- Keyword
-
- II-VI semiconductors (5)
- Carrier density (4)
- Photoluminescence (4)
- Wide band gap semiconductors (4)
- Zinc compounds (4)
-
- Hall effect (3)
- SSW (3)
- Semantic Sensor Web (3)
- Semantic Web (3)
- Annealing (2)
- Carrier mobility (2)
- Deep level transient spectroscopy (2)
- Gold (2)
- Palladium (2)
- Plasma materials processing (2)
- Schottky barriers (2)
- Spatio-Temporal-Thematic Analysis of Social Data (2)
- ASYMPTOTIC EXPANSIONS (1)
- Abductive Reasoning (1)
- Advertising on Social Networks (1)
- Analysis of User Generated Content (1)
- Aspen parkland (1)
- Austrian pine (1)
- Best Practices (1)
- CEG 416-01 (1)
- Canada (1)
- Cathodoluminescence (1)
- Charcoal (1)
- Citizen Sensor (1)
- Cloud (1)
Articles 31 - 60 of 165
Full-Text Articles in Physical Sciences and Mathematics
Cs 499/699: Special Topics In Information Security, Meilin Liu
Cs 499/699: Special Topics In Information Security, Meilin Liu
Computer Science & Engineering Syllabi
This course gives a comprehensive study of security vulnerabilities in information systems and the basic techniques for developing secure applications and practicing safe computing. Topics include: Conventional encryption; Data Encryption Standard; Advanced Encryption Standard; Hashing functions and data integrity; Basic Number Theory; Public-key encryption (RSA); Digital signature; Security standards and applications; Access Control; Management and analysis of security. After taking this course, students will have the knowledge of several well-known security standards and their applications; and the students should be able to increase system security and develop secure applications.
Cs 705: Introduction To Data Mining, Guozhu Dong
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, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.
Cs 784: Programming Languages, Krishnaprasad Thirunarayan
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/Mth 316/516: Numerical Methods For Digital Computers, Ronald F. Taylor
Cs/Mth 316/516: Numerical Methods For Digital Computers, 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.
Suggestions For Owl 3, Pascal Hitzler
Suggestions For Owl 3, Pascal Hitzler
Computer Science and Engineering Faculty Publications
With OWL 2 about to be completed, it is the right time to start discussions on possible future modifications of OWL. We present here a number of suggestions in order to discuss them with the OWL user community. They encompass expressive extensions on polynomial OWL 2 profiles, a suggestion for an OWL Rules language, and expressive extensions for OWL DL.
Paraconsistent Reasoning For Owl 2, Yue Ma, Pascal Hitzler
Paraconsistent Reasoning For Owl 2, Yue Ma, Pascal Hitzler
Computer Science and Engineering Faculty Publications
A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can be implemented by invoking classical reasoners to keep the same complexity as under the classical semantics. However, this approach has so far only been studied for the basid description logic ALC. In this paper, we further study how to extend the four-valued semantics to the more expressive description logic SROIQ which underlies the forthcoming revision of the Web Ontology Language, OWL 2, and also investigate how it fares when adapated to tractable description logics including …
A Preferential Tableaux Calculus For Circumscriptive Alco, Stephan Grimm, Pascal Hitzler
A Preferential Tableaux Calculus For Circumscriptive Alco, Stephan Grimm, Pascal Hitzler
Computer Science and Engineering Faculty Publications
Nonmonotonic extensions of description logics (DLs) allow for default and local closed-world reasoning and are an acknowledged desired feature for applications, e.g. in the Semantic Web. A recent approach to such an extension is based on McCarthy's circumscription, which rests on the principle of minimising the extension of selected predicates to close off dedicated parts of a domain model. While decidability and complexity results have been established in the literature, no practical algorithmisation for circumscriptive DLs has been proposed so far. In this paper, we present a tableaux calculus that can be used as a decision procedure for concept satisfiability …
Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer
Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer
Computer Science & Engineering Syllabi
Theory-oriented approach to the application of contemporary algorithms to bioinformatics. Graph theory, complexity theory, dynamic programming and optimization techniques are introduced in the context of application toward solving specific computational problems in molecular genetics. 4 credit hours.
Cs 499/699: Cloud Computing, Keke Chen
Cs 499/699: Cloud Computing, Keke Chen
Computer Science & Engineering Syllabi
In this course, we will explore a few aspects of cloud computing: distributed data crunching with MapReduce, cloud and datacenter filesystems, virtualization, security&privacy, Amazon Web Services, and interactive web-based applications. Students are expected to finish a few mini projects, read some papers, and take the final exam. Participation in the class discussion is strongly encouraged. Guest speakers might be invited for some particular topics. (3 Hours Lecture+ 1 Hour lab).
Cs 400-01: Data Structures And Algorithms, Sarah Gothard
Cs 400-01: Data Structures And Algorithms, Sarah Gothard
Computer Science & Engineering Syllabi
No abstract provided.
Cs 415: Social Implications Of Computing, Leo Finkelstein
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.
Ceg 770-01: Computer Engineering Mathematics, Yong Pei
Ceg 770-01: Computer Engineering Mathematics, Yong Pei
Computer Science & Engineering Syllabi
Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.
Ceg 724-01: Computer Vision I, Arthur A. Goshtasby
Ceg 724-01: Computer Vision I, Arthur A. Goshtasby
Computer Science & Engineering Syllabi
This course covers basic a]algorithms for low-level and mid-level vision. The algorithms deal with reducing image noise and segment images into objects or their parts. Other a]algorithms covered in the course analyze and quantify texture, register images, and recover 3-D shapes from 2-D images.
Ceg 720-01: Computer Architecture I, Soon M. Chung
Ceg 720-01: Computer Architecture I, Soon M. Chung
Computer Science & Engineering Syllabi
Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer, pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing.
Ceg 476/676-01: Computer Graphics I, Thomas Wischgoll
Ceg 476/676-01: Computer Graphics I, Thomas Wischgoll
Computer Science & Engineering Syllabi
By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D objects as well as manipulating and rendering the objects using OpenGL.
Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum
Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum
Computer Science & Engineering Syllabi
This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.
Ceg 360/560-01: Digital System Design, Travis E. Doom
Ceg 360/560-01: Digital System Design, Travis E. Doom
Computer Science & Engineering Syllabi
Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG260.
Ceg 260-01: Digital Computer Hardware/Switching Circuits, Meilin Liu
Ceg 260-01: Digital Computer Hardware/Switching Circuits, Meilin Liu
Computer Science & Engineering Syllabi
We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.
Ceg 320/520-01: Computer Organization, Michael L. Raymer
Ceg 320/520-01: Computer Organization, Michael L. Raymer
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 221-01: Introduction To C Programming For Engineers, Jay Dejongh
Ceg 221-01: Introduction To C Programming For Engineers, Jay Dejongh
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, and numerical methods applications. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).
Ceg 402/602-01: Introduction To Computer Communication, Jianing Ma
Ceg 402/602-01: Introduction To Computer Communication, Jianing Ma
Computer Science & Engineering Syllabi
This course provides an introduction to basic concepts of communication
networks, different types of networks, protocols over different layers, and network
applications through lectures, labs, homework, and reading on relevant materials. You will
•Understand networking principles, protocols, and technologies.
•Understand some design and performance issues involved in providing a
network service.
•Acquire background for supporting e-commerce, e-government, and e-education.
•Gain hands-on experience with programming techniques for network
protocols.
•Obtain background for original research in computer networks.
Ceg 434/634-01: Concurrent Software Design, Douglas J. Kelly
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, homework, and readings on operating system design.
Ceg 433/633-01: Operating Systems, Thomas Wischgoll
Ceg 433/633-01: Operating Systems, Thomas Wischgoll
Computer Science & Engineering Syllabi
By the end of this quarter, you should be able to apply the learned concepts to the following:
•Develop, test and debug programs in Unix.
•Improve the performance of programs by tuning virtual memory usage, and file io.
•Design and construct device drivers for Unix.
•Design and build newer file systems for any OS.
During the course we will discuss topics from the following areas:
•Operating system structures
•Operating system interfaces
•Process management and scheduling
•Interprocess communication
•File systems
•Memory management
Ceg 453/653: Embedded Systems, Jack Jean
Ceg 453/653: Embedded Systems, Jack Jean
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 702-01: Advanced Computer Networks, Yong Pei
Ceg 702-01: Advanced Computer Networks, Yong Pei
Computer Science & Engineering Syllabi
This course provides an in-depth examination of the fundamental concepts and principles in communications and computer networks. Topics include: queuing analysis, ATM, frame relay, performance analysis of routings, and flow and congestion controls.
Ceg 498-01: Design Experience, Thomas C. Hartrum
Ceg 498-01: Design Experience, Thomas C. Hartrum
Computer Science & Engineering Syllabi
CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journal and on the quality of their collective efforts as reflected in group generated products.
Ceg 760-01: Advanced Software Computer Engineering, Thomas C. Hartrum
Ceg 760-01: Advanced Software Computer Engineering, Thomas C. Hartrum
Computer Science & Engineering Syllabi
This course covers advanced topics in software engineering. Aspects of problem specification, design, verification, and evaluation are discussed. We will focus on design methods, including software patterns and software architecture, plus some advanced topics involving formal methods of software specification or evaluation using software metrics. Students will participate in team projects to apply the methods discussed.
Ceg 730-01: Distributed Computing Principles, Prabhaker Mateti
Ceg 730-01: Distributed Computing Principles, Prabhaker Mateti
Computer Science & Engineering Syllabi
[4 Credit Hours] Communicating sequential processes, clients and servers, remote procedure calls, stub generation, weak and strong semaphores, split-binary-semaphores, and distributed termination. Example languages: SR, Linda. Prerequisite: CEG 633
Student Fact Book, Fall 2009, Thirty-Third Annual Edition, Wright State University, Office Of Student Information Systems, Wright State University
Student Fact Book, Fall 2009, Thirty-Third 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, 2009.
Ibm Altocumulus: A Cross-Cloud Middleware And Platform, E. Michael Maximilien, Ajith Harshana Ranabahu, Roy Engehausen, Laura Anderson
Ibm Altocumulus: A Cross-Cloud Middleware And Platform, E. Michael Maximilien, Ajith Harshana Ranabahu, Roy Engehausen, Laura Anderson
Kno.e.sis Publications
Cloud computing has become the new face of computing and promises to offer virtually unlimited, cheap, readily available, "utility type" computing resources. Many vendors have entered this market with different offerings ranging from infrastructure-as-a-service such as Amazon, to fully functional platform services such as Google App Engine. However, as a result of this heterogeneity, deploying applications to a cloud and managing them needs to be done using vendor specific methods. This "lock in" is seen as a major hurdle in adopting cloud technologies to the enterprise. IBM Altocumulus, the cloud middleware platform from IBM Almaden Services Research, aims to solve …