Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

2009

Discipline
Institution
Keyword
Publication
Publication Type

Articles 241 - 270 of 545

Full-Text Articles in Computer Engineering

A Video Manager, Nicholas Omann Apr 2009

A Video Manager, Nicholas Omann

Honors Capstones

Capstone submitted as a graduate requirement for the BSU Honors Program.


From General Technology Familiarity To Anti-Spyware Program Adoption: Comparison Between The U.S. And South Korea, Dong-Heon Kwak Apr 2009

From General Technology Familiarity To Anti-Spyware Program Adoption: Comparison Between The U.S. And South Korea, Dong-Heon Kwak

Morehead State Theses and Dissertations

A thesis presented to the faculty of the College of Business at Morehead State University in partial fulfillment of the requirements for the Degree of Master of Science by Dong-Heon Kwak on April 7, 2009.


Selecting The Best Network For The Labview Remote Control System To Achieve Better Performance, Sivakrishna Nannapaneni Apr 2009

Selecting The Best Network For The Labview Remote Control System To Achieve Better Performance, Sivakrishna Nannapaneni

Morehead State Theses and Dissertations

A thesis presented to the faculty of the College of Science and Technology at Morehead State University in partial fulfillment of the requirements for Degree of Masters of Science by Sivakrishna Nannapaneni on April 6, 2009.


Expert Knowledge Is Needed For Design Under Uncertainty: For P-Boxes, Backcalculation Is, In General, Np-Hard, Vladik Kreinovich Apr 2009

Expert Knowledge Is Needed For Design Under Uncertainty: For P-Boxes, Backcalculation Is, In General, Np-Hard, Vladik Kreinovich

Departmental Technical Reports (CS)

In engineering design problems, we want to make sure that a certain quantity c of the designed system lies within given bounds -- or at least that the probability of this quantity to be outside these bounds does not exceed a given threshold. We may have several such requirements -- thus the requirement can be formulated as bounds on the cumulative distribution function F(x) of the quantity c; such bounds are known as a p-box.

The value of the desired quantity c depends on the design parameters a and the parameters b characterizing the environment: c=f(a,b). To achieve the design …


What Is The Best Way To Distribute Efforts Among Students: Towards Quantitative Approach To Human Cognition, Olga Kosheleva, Vladik Kreinovich Apr 2009

What Is The Best Way To Distribute Efforts Among Students: Towards Quantitative Approach To Human Cognition, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In a typical class, we have students at different levels of knowledge, student with different ability to learn the material. In the ideal world, we should devote unlimited individual attention to all the students and make sure that everyone learns all the material. In real life, our resources are finite. Based on this finite amount of resources, what is the best way to distribute efforts between different students?

Even when we know the exact way each student learns, the answer depends on what is the objective of teaching the class. This can be illustrated on two extreme example: If the …


2009 (Spring) Ensi Informer Magazine, Morehead State University. Engineering Sciences Department Apr 2009

2009 (Spring) Ensi Informer Magazine, Morehead State University. Engineering Sciences Department

ENSI Informer Magazine Archive

The ENSI Informer Magazine published in the spring of 2009.


A Hidden Markov Model Based Approach To Detect Rogue Access Points, Gayathri Shivaraj Apr 2009

A Hidden Markov Model Based Approach To Detect Rogue Access Points, Gayathri Shivaraj

Electrical & Computer Engineering Theses & Dissertations

One of the most challenging security concerns for network administrators is the presence of Rogue access points. The challenge is to detect and disable a Rogue access point before it can cause hazardous damage to the network. This thesis proposes a statistically based approach to detect Rogue access points using a Hidden Markov Model, which is applied to passively measure packet-header data collected at a gateway router or any monitoring point. This approach utilizes variations in packet inter-arrival time to differentiate between authorized access points and Rouge access points. This approach used the inter-arrival time of a packet as a …


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

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

Computer Science & Engineering Syllabi

No abstract provided.


Cs 209-01: Computer Programming For Business Ii, David M. Hutchison Apr 2009

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 776: Functional Programming, Krishnaprasad Thirunarayan Apr 2009

Cs 776: Functional Programming, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will discuss important concepts of functional programming such as recursive definitions, higher-order functions, type inference, polymorphism, abstract data types, modules etc. The programming exercises will illustrate the utility of list-processing, pattern matching, abstraction of data/control, strong typing, and parameterized modules (functors). We also study the mathematical reasoning involved in the design of functional programs and techniques for proving properties about functions so defined.


Cs 784: Programming Languages, Krishnaprasad Thirunarayan Apr 2009

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 205: Computer Literacy And Office Automation, Ann Tirpack Apr 2009

Cs 205: Computer Literacy And Office Automation, Ann Tirpack

Computer Science & Engineering Syllabi

No abstract provided.


Cs 801: Advanced Database Systems, Soon M. Chung Apr 2009

Cs 801: Advanced Database Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of current trends and research issues in database systems.


Cs 240: Computer Programming I, Vanessa Starkey Apr 2009

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. Prerequisite: MTH 130 or MPL 5.


Cs 466/666: Introduction To Formal Languages, Guozhu Dong Apr 2009

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: the syntax of languages can be defined using grammars and patterns 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 and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science, by Thomas Sudkamp.


Cs 142: Computer Programming - Ii, Michael Ondrasek Apr 2009

Cs 142: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

The concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and handling runtime errors with an emphasis on program verification and testing. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: CS 141 (Computer Programming I) and MTH 127 (College Algebra) or equivalent.


Cs 701: Database Systems And Design I, Guozhu Dong Apr 2009

Cs 701: Database Systems And Design I, Guozhu Dong

Computer Science & Engineering Syllabi

An introduction to database design, database system implementation issues and techniques, and advanced data models.


Cs 206-01: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog Apr 2009

Cs 206-01: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of word processing, spreadsheets, databases, and presentation software and web design using Microsoft Word, Microsoft SharePoint, Microsoft Excel, Access, and PowerPoint covering the following topics.

Microsoft Excel 2007:

Chapter 4: Creating Loan Information

Chapter 5: Working With Lists, Working With Logical Functions

Chapter 6: Working With Multiple Worksheets And Workbooks, Database Functions, And Filtering, And Integrating Excel with Other Window Programs

Microsoft Access 2007:

Chapter 4: Enhancing a Table's Design, and Creating Advanced Queries, Creating Custom Reports

Chapter 5: Creating Custom Forms …


Cs 241-02: Computer Programming - Ii, Michael Ondrasek Apr 2009

Cs 241-02: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

A continuation of CS240. The emphasis is on solving more complex problems using object oriented programming. Prerequisite: CS240. Students must register for both lecture and one laboratory section. 4 credit hours.


Cs 415: Social Implications Of Computing, Leo Finkelstein Apr 2009

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 211-01: Pc Networking Ii, Karen Meyer Apr 2009

Ceg 211-01: Pc Networking Ii, Karen Meyer

Computer Science & Engineering Syllabi

The goal of this course is to prepare students for the real-world challenges of a networking professional. It is designed for students interested in network and server administration. The text includes extensive hands-on projects, exercises, and review questions in each chapter, which reinforce network administration skills as they are learned. Case projects at the end of each chapter allow students to take on the role of a network administrator, making decisions and troubleshooting real-life problems. Specific topic coverage includes: network administration and management, administering active directory, managing group policy, administering file resources, administering web resources in windows server 2003, administering …


Cs 400-01: Data Structures And Algorithms, Sarah Gothard Apr 2009

Cs 400-01: Data Structures And Algorithms, Sarah Gothard

Computer Science & Engineering Syllabi

No abstract provided.


Cs/Mth 316/516: Numerical Methods For Digital Computers - I, Ronald F. Taylor Apr 2009

Cs/Mth 316/516: Numerical Methods For Digital Computers - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods of interpolation, data smoothing, functional approximation, numerical differentiation and integration. Solution techniques for linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to engineering, science, and applied mathematics are an integral part of the course. Special topics presented as schedule permits. 4 credit hours.


Cs 208: Computer Programming For Business I, Dennis Kellermeier Apr 2009

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first 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. This course assumes students have never written a program before.


Cs 790: Optimizing Compilers For Modern Architectures, Meilin Liu Apr 2009

Cs 790: Optimizing Compilers 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 271/Bio 371: Introduction To Bioinformatics, Michael L. Raymer, Dan E. Krane Apr 2009

Cs 271/Bio 371: Introduction To Bioinformatics, Michael L. Raymer, Dan E. Krane

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 499/699-01: Scientific Visualization And Virtual Environments, Thomas Wischgoll Apr 2009

Ceg 499/699-01: Scientific Visualization And Virtual Environments, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will be familiar with techniques ed for visualizing various types of data sets, such as medical, vector or general data sets.


Ceg 416-01: Matrix Computations, Ronald F. Taylor Apr 2009

Ceg 416-01: Matrix Computations, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is a survey of numerical methods in linear algebra for application to problems in engineering and the sciences. Emphasis is on using modern software tools on high performance computing systems. This course covers the mathematics of linear equations, eigenvalue problems, singular value decomposition, and least squares. Material covered will be relevant to applications areas such as structural analysis, heat transfer, neural networks, mechanical vibrations, and image processing in biomedical engineering. A familiarity with MATLAB is useful, and the ability to program in languages such as CIC++ or Fortran is very important. A basic knowledge of matrix algebra is …


Ceg 433/633-01: Operating Systems, Prabhaker Mateti Apr 2009

Ceg 433/633-01: Operating Systems, Prabhaker Mateti

Computer Science & Engineering Syllabi

Overview of operating systems internals. File-system usage and design, process usage and control, virtual memory, multi user systems, access control. Course projects use C++ language. 4 Credit Hours. Three hours lecture, two hours lab. Prerequisites: CEG 320 and CS 400


Ceg 210-01: Pc Networking I, Karen Meyer Apr 2009

Ceg 210-01: Pc Networking I, Karen Meyer

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.