Ceg 320/520: Computer Organization,
2010
Wright State University - Main Campus
Ceg 320/520: Computer Organization, Nikolaos Bourbakis
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 360/560-01: Digital System Design,
2010
Wright State University - Main Campus
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: CEG 260.
Ceg 433/633-01: Operating Systems,
2010
Wright State University - Main Campus
Ceg 433/633-01: Operating Systems, Thomas Wischgoll
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 404/604-01: Wireless Sensor Networks,
2010
Wright State University - Main Campus
Ceg 404/604-01: Wireless Sensor Networks, Bin Wang
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 460/660-01: Introduction To Software Computer Engineering,
2010
Wright State University - Main Campus
Ceg 460/660-01: Introduction To Software Computer Engineering, Prabhaker Mateti
Computer Science & Engineering Syllabi
[4 Credit Hours] Concepts of software engineering. Analysis, design, and implementation of software engineering concepts that comprise structured programming and design. Case studies serve as examples illustrating the software life-cycle model. Three hours lecture, two hours lab. 4.0 Credit hours. Prerequisites: Undergraduate level CS 400 Minimum Grade of D
Ceg 498: Design Experience,
2010
Wright State University - Main Campus
Ceg 498: 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 830: Distributed Computing Systems,
2010
Wright State University - Main Campus
Ceg 830: Distributed Computing Systems, Prabhaker Mateti
Computer Science & Engineering Syllabi
Example languages and packages: SR and PYM, file servers, semantics of file sharing, caches and replication, log-structured file systems, remote evaluation, process migration, mobile projects, check pointing and rollback-recovery.
Ceg477/677: Computer Graphics Ii,
2010
Wright State University - Main Campus
Ceg477/677: Computer Graphics Ii, Thomas Wischgoll
Computer Science & Engineering Syllabi
By the end of this quarter, you will be familiar with techniques for generation 3-D scenes and interacting with the generated scenes. You will be introduced to surface rendering techniques, visibility algorithms, illumination models, and geometric modelling.
Ceg 220-01: Introduction To C Programming For Engineers,
2010
Wright State University - Main Campus
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 or EGR l01 (Engineering Mathematics). The course includes a scheduled laboratory section for which you must register.
Ceg 720: Computer Architecture I,
2010
Wright State University - Main Campus
Ceg 720: 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 435/635-01: Distributed Computing And Systems,
2010
Wright State University - Main Campus
Ceg 435/635-01: Distributed Computing And Systems, Keke Chen
Computer Science & Engineering Syllabi
Study of process coordination, client-server computing, network and distributed operating systems, network and distributed file systems, concurrency control, recovery of distributed transactions, and fault-tolerant computing.
Ceg 436/636-01: Mobile Computing,
2010
Wright State University - Main Campus
Ceg 436/636-01: Mobile Computing, Yong Pei
Computer Science & Engineering Syllabi
No abstract provided.
Ceg/Ee 260 Digital Computing Hardware/Switching Circuits,
2010
Wright State University - Main Campus
Ceg/Ee 260 Digital Computing 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.
Cs 141-01: Computer Programming - I,
2010
Wright State University - Main Campus
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.
Improving Performance And Programmer Productivity For I/O-Intensive High Performance Computing Applications,
2010
University of Central Florida
Improving Performance And Programmer Productivity For I/O-Intensive High Performance Computing Applications, Saba Sehrish
Electronic Theses and Dissertations
Due to the explosive growth in the size of scientific data sets, data-intensive computing is an emerging trend in computational science. HPC applications are generating and processing large amount of data ranging from terabytes (TB) to petabytes (PB). This new trend of growth in data for HPC applications has imposed challenges as to what is an appropriate parallel programming framework to efficiently process large data sets. In this work, we study the applicability of two programming models (MPI/MPI-IO and MapReduce) to a variety of I/O-intensive HPC applications ranging from simulations to analytics. We identify several performance and programmer productivity related …
Analyzing Instructtion Based Cache Replacement Policies,
2010
University of Central Florida
Analyzing Instructtion Based Cache Replacement Policies, Ping Xiang
Electronic Theses and Dissertations
The increasing speed gap between microprocessors and off-chip DRAM makes last-level caches (LLCs) a critical component for computer performance. Multi core processors aggravate the problem since multiple processor cores compete for the LLC. As a result, LLCs typically consume a significant amount of the die area and effective utilization of LLCs is mandatory for both performance and power efficiency. We present a novel replacement policy for last-level caches (LLCs). The fundamental observation is to view LLCs as a shared resource among multiple address streams with each stream being generated by a static memory access instruction. The management of LLCs in …
Episodic Memory Model For Embodied Conversational Agents,
2010
University of Central Florida
Episodic Memory Model For Embodied Conversational Agents, Miguel Elvir
Electronic Theses and Dissertations
Embodied Conversational Agents (ECA) form part of a range of virtual characters whose intended purpose include engaging in natural conversations with human users. While works in literature are ripe with descriptions of attempts at producing viable ECA architectures, few authors have addressed the role of episodic memory models in conversational agents. This form of memory, which provides a sense of autobiographic record-keeping in humans, has only recently been peripherally integrated into dialog management tools for ECAs. In our work, we propose to take a closer look at the shared characteristics of episodic memory models in recent examples from the field. …
Programmable Design And Implementation Of A Chaotic System Utilizing Multiple Nonlinear Functions,
2010
TÜBİTAK
Programmable Design And Implementation Of A Chaotic System Utilizing Multiple Nonlinear Functions, Recai̇ Kiliç, Fatma Yildirim Dalkiran
Turkish Journal of Electrical Engineering and Computer Sciences
In addition to exhibiting a rich variety of bifurcation and chaos via tuning parameters, a chaotic system introduced by Sprott can be modeled and realized with a fixed main system block and many different changeable nonlinear function blocks such as piecewise-linear function, cubic function and other trigonometric functions. This system is very suitable for implementing a programmable chaos generator according to its changeable nonlinearity. This paper presents a FPAA (Field Programmable Analog Array)-based programmable implementation of this system. Nonlinear function blocks used in this chaotic system are modeled with FPAA programming and a model is rapidly changed for realizing other …
Defending Privacy: The Development And Deployment Of A Darknet,
2010
Technological University Dublin
Defending Privacy: The Development And Deployment Of A Darknet, Conor Mcmanamon, Fredrick Mtenzi
Conference papers
New measures imposed by governments, Internet service providers and other third parties which threaten the state of privacy are also opening new avenues to protecting it. The unwarranted scrutiny of legitimate services such as file hosters and the BitTorrent protocol, once relatively unknown to the casual Internet user, is becoming more obvious. The darknet is a rising contender against these new measures and will preserve the default right to privacy of Internet users. A darknet is defined in the context of file sharing as a network which operates on top of another network such as the Internet for the purpose …
Data Compression Concepts And Algorithms And Their Applications To Bioinformatics,
2010
University of Nebraska-Lincoln
Data Compression Concepts And Algorithms And Their Applications To Bioinformatics, Ozkan U. Nalbantoglu, David J. Russell, Khalid Sayood
Department of Electrical and Computer Engineering: Faculty Publications
Data compression at its base is concerned with how information is organized in data. Understanding this organization can lead to efficient ways of representing the information and hence data compression. In this paper we review the ways in which ideas and approaches fundamental to the theory and practice of data compression have been used in the area of bioinformatics. We look at how basic theoretical ideas from data compression, such as the notions of entropy, mutual information, and complexity have been used for analyzing biological sequences in order to discover hidden patterns, infer phylogenetic relationships between organisms and study viral …
