Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (252)
- Computer Sciences (234)
- Electrical and Computer Engineering (66)
- Computer and Systems Architecture (29)
- Digital Communications and Networking (26)
-
- Systems and Communications (15)
- Data Storage Systems (14)
- Electrical and Electronics (14)
- Other Computer Engineering (12)
- Other Electrical and Computer Engineering (12)
- Robotics (12)
- Social and Behavioral Sciences (12)
- Optics (11)
- Physics (11)
- Databases and Information Systems (9)
- Electromagnetics and Photonics (9)
- Mechanical Engineering (8)
- Software Engineering (8)
- Graphics and Human Computer Interfaces (7)
- Mathematics (7)
- Signal Processing (7)
- Biomedical Engineering and Bioengineering (6)
- Business (6)
- Logic and Foundations (6)
- Other Computer Sciences (6)
- Law (5)
- Other Mathematics (5)
- Communication (4)
- Institution
-
- Wright State University (154)
- University of Nebraska - Lincoln (68)
- University of Texas at El Paso (64)
- Washington University in St. Louis (19)
- Marquette University (17)
-
- Technological University Dublin (17)
- Singapore Management University (13)
- University of Dayton (11)
- Old Dominion University (10)
- Portland State University (10)
- Connecticut College (7)
- Cleveland State University (5)
- University of Nevada, Las Vegas (5)
- University of Pennsylvania Carey Law School (4)
- University of Rhode Island (4)
- Western Kentucky University (4)
- Chapman University (3)
- Purdue University (3)
- University of New Mexico (3)
- Air Force Institute of Technology (2)
- Morehead State University (2)
- Pace University (2)
- Syracuse University (2)
- University of New Haven (2)
- Virginia Commonwealth University (2)
- Western University (2)
- California Polytechnic State University, San Luis Obispo (1)
- DePaul University (1)
- Florida International University (1)
- Fordham University (1)
- Keyword
-
- Interval computations (6)
- Security (5)
- Engineering (4)
- Oceanography (4)
- Parallel processing (Electronic computers) (4)
-
- Western Kentucky University (4)
- Classification (3)
- Cooperative Relaying (3)
- Electronic data processing -- Distributed processing (3)
- Functional programming (Computer science) (3)
- Interval uncertainty (3)
- Latency (3)
- Ontology (3)
- Optimization (3)
- Privacy (3)
- Symmetries (3)
- Synchronization (3)
- Vehicular Networks (3)
- Wireless sensor networks (3)
- Bandwidth (2)
- Cloud Computing (2)
- Complex system (2)
- Complexity reduction (2)
- Computer programming (2)
- Cooperative diversity (2)
- Crawl (2)
- Cross Layer (2)
- DSmT (2)
- Data structures (Computer science) (2)
- Delta function (2)
- Publication
-
- Computer Science & Engineering Syllabi (154)
- Departmental Technical Reports (CS) (64)
- Department of Electrical and Computer Engineering: Faculty Publications (to 2015) (28)
- All Computer Science and Engineering Research (19)
- Electrical and Computer Engineering Faculty Publications (17)
-
- Electrical and Computer Engineering Faculty Research and Publications (17)
- Department of Computer Science and Engineering: Dissertations, Theses, and Student Research (14)
- Department of Electrical and Computer Engineering: Faculty Publications (13)
- Research Collection School Of Computing and Information Systems (13)
- Computer Science Faculty Publications (11)
- Computer Science Faculty Publications and Presentations (8)
- Conference papers (6)
- Department of Computer Electronics and Engineering: Dissertations, Theses, and Student Research (6)
- Articles (5)
- All Faculty Scholarship (4)
- Computational Modeling & Simulation Engineering Faculty Publications (4)
- Conference Papers (4)
- Graduate School of Oceanography Faculty Publications (4)
- Branch Mathematics and Statistics Faculty and Staff Publications (3)
- Engineering Faculty Articles and Research (3)
- CSE Conference and Workshop Papers (2)
- Computer Science Publications (2)
- Cornerstone 3 Reports : Interdisciplinary Informatics (2)
- ENSI Informer Magazine Archive (2)
- Electrical & Computer Engineering Faculty Research (2)
- Electrical & Computer Engineering and Computer Science Faculty Publications (2)
- Electrical Engineering and Computer Science - All Scholarship (2)
- Electrical and Computer Engineering Publications (2)
- Engineering Technology Faculty Publications (2)
- Faculty Publications (2)
Articles 31 - 60 of 449
Full-Text Articles in Computer Engineering
Investigating The Effects Of Learning Speeds On Xpilot Agent Evolution, Gary Parker, Phil Fritzsche
Investigating The Effects Of Learning Speeds On Xpilot Agent Evolution, Gary Parker, Phil Fritzsche
Computer Science Faculty Publications
In this paper we present a comparison of the effects of varying play speeds on a genetic algorithm in the space combat game Xpilot. Xpilot-AI, an Xpilot add-on designed for testing learning systems, is used to evolve the controller for an Xpilot combat agent at varying frames per second to determine an optimal speed for learning. The controller is a rule-based system modified to work with a genetic algorithm that learns numeric parameters for the agent’s rule base. The goal of this research is to increase the quality and speed of standard learning algorithms in Xpilot as well as determine …
Fitness Biasing For The Box Pushing Task, Gary Parker, Jim O'Connor
Fitness Biasing For The Box Pushing Task, Gary Parker, Jim O'Connor
Computer Science Faculty Publications
Anytime Learning with Fitness Biasing has been shown in previous works to be an effective tool for evolving hexapod gaits. In this paper, we present the use of Anytime Learning with Fitness Biasing to evolve the controller for a robot learning the box pushing task. The robot that was built for this task, was measured to create an accurate model. The model was used in simulation to test the effectiveness of Anytime Learning with Fitness Biasing for the box pushing task. This work is the first step in new research where an automated system to test the viability of Fitness …
Using Cyclic Genetic Algorithms To Learn Gaits For An Actual Quadruped Robot, Gary Parker, William T. Tarimo
Using Cyclic Genetic Algorithms To Learn Gaits For An Actual Quadruped Robot, Gary Parker, William T. Tarimo
Computer Science Faculty Publications
It is a difficult task to generate optimal walking gaits for mobile legged robots. Generating and coordinating an optimal gait involves continually repeating a series of actions in order to create a sustained movement. In this work, we present the use of a Cyclic Genetic Algorithm (CGA) to learn near optimal gaits for an actual quadruped servo-robot with three degrees of movement per leg. This robot was used to create a simulation model of the movement and states of the robot which included the robot’s unique features and capabilities. The CGA used this model to learn gaits that were optimized …
Cs 240: Computer Programming - I, Michael Ondrasek
Cs 240: Computer Programming - I, Michael Ondrasek
Computer Science & Engineering Syllabi
Basic concepts of programming and programming languages are introduced. Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and 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
Cs 240: Distance Learning Computer Programming - I, Michael Ondrasek
Cs 240: Distance Learning Computer Programming - I, Michael Ondrasek
Computer Science & Engineering Syllabi
Basic concepts of programming and programming languages are introduced. Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and 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 a lecture and laboratory section. 4 credit hours.
Cs 241: Computer Programming Ii, Jay Dejongh
Cs 241: Computer Programming Ii, Jay Dejongh
Computer Science & Engineering Syllabi
A continuation of CS 240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.
Cs 209: Computer Programming For Business Ii, Dennis Kellermeier
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 214: Visual Basic Programming, Eric Saunders
Cs 214: Visual Basic Programming, Eric Saunders
Computer Science & Engineering Syllabi
This course will cover the fundamentals of object-oriented computer programming; with an emphasis on design, structure, debugging, and testing. Visual Basic 2010 will be used for developing programs.
Cs 206-01: Computer Software Productivity Tools, John P. Herzog
Cs 206-01: Computer Software Productivity Tools, John P. Herzog
Computer Science & Engineering Syllabi
Focus on learning MS Office software applications including advanced topics in 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 advanced 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 242: Computer Programming Iii, Mateen M. Rizki
Cs 242: Computer Programming Iii, Mateen M. Rizki
Computer Science & Engineering Syllabi
No abstract provided.
Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan
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 Budd's text 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 400/600: Data Structures And Software Design, Meilin Liu
Cs 400/600: Data Structures And Software Design, Meilin Liu
Computer Science & Engineering Syllabi
This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.
Cs 400/600: Date Structures And Algorithms, Keke Chen
Cs 400/600: Date Structures And Algorithms, Keke Chen
Computer Science & Engineering Syllabi
This course will cover the introduction to the fundamentals of algorithm design and analysis, the implementation of classical data structures and control structures, and the basic problem solving techniques.
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.
Cs 466/666: Introduction To Formal Languages, Guozhu Dong
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 in strings/sentences: the syntax of languages can be defined using grammars and the patterns can be 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 mechanisms and pattern recognition devices. The text will be the third edition of Languages and Machines: An Introduction to the Theory o/Computer Science, by Thomas Sudkamp.
Cs 475/675-01: Web Information Systems, Amit P. Sheth
Cs 475/675-01: Web Information Systems, Amit P. Sheth
Computer Science & Engineering Syllabi
No abstract provided.
Cs 499/699: Cloud Computing, Keke Chen
Cs 499/699: Cloud Computing, Keke Chen
Computer Science & Engineering Syllabi
This is an introductory course to cloud computing. In this course, we will explore a few aspects of cloud computing: distributed data crunching with MapReduce, cloud and datacenter filesystems, virtualization, cloud security&privacy, Amazon Web Services, and interactive web-based applications. Students are expected to finish several 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. (3Hours Lecture + 1 Hour lab).
Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan
Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan
Computer Science & Engineering Syllabi
This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.
Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer
Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer
Computer Science & Engineering Syllabi
No abstract provided.
Cs/Mth 410/610-01: Theoretical Foundations Of Computing, Sarah Gothard
Cs/Mth 410/610-01: Theoretical Foundations Of Computing, Sarah Gothard
Computer Science & Engineering Syllabi
Turing machines; partial-recursive functions; equivalence of computing paradigms; Church-Turing thesis; undecidability; intractability. Four hours lecture.
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/Mth 316/516: Survey Of Numerical Methods For Computational Science, Michael Linger
Cs/Mth 316/516: Survey Of Numerical Methods For Computational Science, Michael Linger
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.
Cs 205-08: Introduction To Computers And Office Productivity Software, Terri Bauer
Cs 205-08: 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.
Towards Interval Techniques For Model Validation, Jaime Nava, Vladik Kreinovich
Towards Interval Techniques For Model Validation, Jaime Nava, Vladik Kreinovich
Departmental Technical Reports (CS)
Propagating Range (Uncertainty) And Continuity Information Through Computations: From Real-Valued Intervals To General Sets, Vladik Kreinovich
Propagating Range (Uncertainty) And Continuity Information Through Computations: From Real-Valued Intervals To General Sets, Vladik Kreinovich
Departmental Technical Reports (CS)
One of the main problems of interval computations is to find an enclosure Y that contains the range f(X1, ..., Xn) of a given function f(x1, ..., xn) over given intervals X1, ..., Xn. Most of the techniques for estimating this range are based on propagating the range through computations. Specifically, we follow the computations of f(x1, ..., xn) step-by-step: we start with ranges X1, ..., Xn of the inputs, and then we sequentially compute the enclosures for the ranges of …
Ceg 260-01: Digital Computer Hardware And Switching Circuits, John C. Gallagher
Ceg 260-01: Digital Computer Hardware And Switching Circuits, John C. Gallagher
Computer Science & Engineering Syllabi
This course covers the design and analysis of basic digital circuits for computation. Topics will Include number systems, basic Boolean algebra, combinational circuit design and analysis, basic Medium Scale Integration (MSI) components, basic memory devices, basic sequential circuits, and binary arithmetic. At the end of this course you should be able to design, optimize, and Implement combinational logic for a variety of applications. You should also be familiar with basic MSI components and sequential circuit concepts In preparation for more advanced study of computer architecture, sequential circuit analysis, design, and optimization.
Cs 208: Computer Programming For Business I, David M. Hutchison
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.
Ceg 210-01: Pc Networking I, Chris P. Fickert
Ceg 210-01: 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.
Ceg 220-01: Introduction To C Programming For Engineers, Jay Dejongh
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: MTR 229 (Calculus I) or EGR 101 (Engineering Mathematics). The course includes a scheduled laboratory section for which you must register.
Ceg 320/520-01: Computer Organization, Sarah Gothard
Ceg 320/520-01: Computer Organization, Sarah Gothard
Computer Science & Engineering Syllabi
Organizational and sequential operation of a digital computer. Program control, memory organization and hierarchy, stacks and parameter passing, interrupts and traps, I/O devices, program structure, machine code and assembly language. Three hours lecture, two hours lab.