Using Eye Tracking And Attention Maps In Computer Science Education,
2012
University of Mississippi
Using Eye Tracking And Attention Maps In Computer Science Education, Austin Pernell
Electronic Theses and Dissertations
Eye tracking has been used for many different areas of study where a user's eye movements are considered the most important information available. Before eye tracking was possible, the only way that information could be obtained was to ask the user where they looked and what caught their attention. Now, with the rise of eye tracking cameras, this data can be captured, stored, and processed in a meaningful way. These cameras aren't perfectly accurate however and there is still some interpretation that must be applied to more accurately represent the true gaze path of the user. This paper establishes some …
Virtual Worlds And Conservational Channel Evolution And Pollutant Transport Systems (Concepts),
2012
University of Mississippi
Virtual Worlds And Conservational Channel Evolution And Pollutant Transport Systems (Concepts), Chenchutta Denaye Jackson
Electronic Theses and Dissertations
Many models exist that predict channel morphology. Channel morphology is defined as the change in geometric parameters of a river. Channel morphology is affected by many factors. Some of these factors are caused either by man or by nature. To combat the adverse effects that man and nature may cause to a water system, scientists and engineers develop stream rehabilitation plans. Stream rehabilitation as defined by Shields et al., states that "restoration is the return from a degraded ecosystem back to a close approximation of its remaining natural potential" [Shields et al., 2003]. Engineers construct plans that will restore streams …
Self‐Regulating Action Exploration In Reinforcement Learning,
2012
Singapore Management University
Self‐Regulating Action Exploration In Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Yuan-Sin Tan
Research Collection School Of Computing and Information Systems
The basic tenet of a learning process is for an agent to learn for only as much and as long as it is necessary. With reinforcement learning, the learning process is divided between exploration and exploitation. Given the complexity of the problem domain and the randomness of the learning process, the exact duration of the reinforcement learning process can never be known with certainty. Using an inaccurate number of training iterations leads either to the non-convergence or the over-training of the learning agent. This work addresses such issues by proposing a technique to self-regulate the exploration rate and training duration …
A New One-Level Convex Optimization Approach For Estimating Origin-Destination Demand,
2012
Singapore Management University
A New One-Level Convex Optimization Approach For Estimating Origin-Destination Demand, Wei Shen, Laura Wynter
Research Collection School Of Computing and Information Systems
Accurately estimating Origin–Destination (OD) trip tables based on traffic data has become crucial in many real-time traffic applications. The problem of OD estimation is traditionally modeled as a bilevel network design problem (NDP), which is challenging to solve in large-scale networks. In this paper, we propose a new one-level convex optimization formulation to reasonably approximate the bilevel structure, thus allowing the development of more efficient solution algorithms. This one-level approach is consistent with user equilibrium conditions, and improves previous one-level relaxed OD estimation formulations in the literature by ‘equilibrating’ path flows using external path cost parameters. Our new formulation can, …
Cs 209-01: Computer Programming For Business Ii,
2012
Wright State University - Main Campus
Cs 209-01: Computer Programming For Business Ii, David M. Hutchison
Computer Science & Engineering Syllabi
CS 209 is the second in a sequence of two programming classes required for MIS majors. This course will continue teaching students to the basic concepts of programming. Examples are from business applications and emphasis is on problem solving with the computer as a tool.
Cs 400/600-01: Date Structures And Algorithms,
2012
Wright State University - Main Campus
Cs 400/600-01: Date Structures And Algorithms, Keke Chen
Computer Science & Engineering Syllabi
This course will cover the fundamentals of algorithm design and analysis, the implementation of classical data structures and control structures, and the basic problem solving techniques.
Cs 707-01: Information Retrieval,
2012
Wright State University - Main Campus
Cs 707-01: Information Retrieval, Krishnaprasad Thirunarayan
Computer Science & Engineering Syllabi
This course will cover models for information retrieval techniques for indexing and searching, and algorithms for classification and clustering. It will also cover SVM, latent semantic indexing, link analysis and ranking, Map-Reduce architecture and Hadoop, to different degrees of detail, time penning.
Ceg 411/611: Microprocessor-Based System Design,
2012
Wright State University - Main Campus
Ceg 411/611: Microprocessor-Based System Design, Jack Jean
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 498: Design Experience,
2012
Wright State University - Main Campus
Ceg 498: Design Experience, Thomas C. Hartrum
Computer Science & Engineering Syllabi
CEG 498 (Team Projects I and II) 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.
On The Design Partitioning Of 3d Monolithic Circuits,
2012
Missouri University of Science and Technology
On The Design Partitioning Of 3d Monolithic Circuits, Luke Maresca
Masters Theses
"Conventional three-dimensional integrated circuits (3D ICs) stack multiple dies vertically for higher integration density, shorter wirelength, smaller footprint, faster speed and lower power consumption. Due to the large through-silicon-via (TSV) sizes, 3D design partitioning is typically done at the architecture-level With the emerging monolithic 3D technology, TSVs can be made much smaller, which enables potential block-level partitioning. However, it is still unclear how much benefit can be obtained by block-level partitioning, which is affected by the number of tiers and the sizes of TSVs. In this thesis, an 8-bit ripple carry adder was used as an example to explore the …
Null Convention Logic Applications Of Asynchronous Design In Nanotechnology And Cryptographic Security,
2012
Missouri University of Science and Technology
Null Convention Logic Applications Of Asynchronous Design In Nanotechnology And Cryptographic Security, Jun Wu
Doctoral Dissertations
"This dissertation presents two Null Convention Logic (NCL) applications of asynchronous logic circuit design in nanotechnology and cryptographic security. The first application is the Asynchronous Nanowire Reconfigurable Crossbar Architecture (ANRCA); the second one is an asynchronous S-Box design for cryptographic system against Side-Channel Attacks (SCA). The following are the contributions of the first application: 1) Proposed a diode- and resistor-based ANRCA (DR-ANRCA). Three configurable logic block (CLB) structures were designed to efficiently reconfigure a given DR-PGMB as one of the 27 arbitrary NCL threshold gates. A hierarchical architecture was also proposed to implement the higher level logic that requires a …
The Practicality Of Cloud Computing,
2012
Sacred Heart University
The Practicality Of Cloud Computing, Xiaohua (Cindy) Li
Librarian Publications
Since its inception, cloud computing has become the current paradigm. Organizations of different size and type have embraced the concept because of its both technological and economic advantages. Sacred Heart University Library has recently published its newly designed website on the cloud. For a small academic library, what does it mean to put their online data on the cloud? This paper will analyze and discuss the advantages of cloud computing, and some potential obstacles created by it through the author’s observations. This paper hopes the uniqueness of the case will contribute to the improvement of cloud computing experience of other …
Ceg 210: Pc Networking I,
2012
Wright State University - Main Campus
Ceg 210: Pc Networking I, Jerry Hensley
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: Introduction To C Programming For Engineers,
2012
Wright State University - Main Campus
Ceg 220: 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.
Cs 240-01: Computer Programming I,
2012
Wright State University - Main Campus
Cs 240-01: Computer Programming I, Vaibhav Tendulkar
Computer Science & Engineering Syllabi
No abstract provided.
Cs 242-01: Computer Programming Iii,
2012
Wright State University - Main Campus
Cs 242-01: Computer Programming Iii, Mateen M. Rizki
Computer Science & Engineering Syllabi
No abstract provided.
Cs 240-01: Computer Programming I,
2012
Wright State University - Main Campus
Cs 240-01: Computer Programming I, Vanessa Starkey
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.
Cs 399-01: Introduction To Scientific Visualization,
2012
Wright State University - Main Campus
Cs 399-01: Introduction To Scientific Visualization, Thomas Wischgoll
Computer Science & Engineering Syllabi
By the end of this quarter, you will be familiar with techniques used for visualizing various types of data sets, such as medical, vector or general data sets. This includes appropriate visualization methods for geometric, volumetric, and higher dimensional data sets (e.g. vector or tensor data). In addition, you will learn about user modalities, including different input devices and display types for more advanced visualizations.
Cs 141-01: Computer Programming I,
2012
Wright State University - Main Campus
Cs 141-01: Computer Programming I, Vanessa Starkey
Computer Science & Engineering Syllabi
Introduction to use of computers as a problem-solving tool. Examples from and applications to a broad range of problems. Methodology for algorithm design and for structured modular implementation is stressed. Three hours lecture, two hours lab.
Cs 205-07: Introduction To Computers And Office Productivity Software,
2012
Wright State University - Main Campus
Cs 205-07: Introduction To Computers And Office Productivity Software, John P. Herzog
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.
