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

Computer Sciences Commons™

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

Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 15451 - 15480 of 17309

Full-Text Articles in Computer Sciences

Ceg 730-01: Distributed Computing Principles, Prabhaker Mateti Jan 2006

Ceg 730-01: Distributed Computing Principles, Prabhaker Mateti

Computer Science & Engineering Syllabi

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.


Ceg 750-01: Microprocessor, Jack Jean Jan 2006

Ceg 750-01: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 860-01: Object-Oriented Programming, Krishnaprasad Thirunarayan Jan 2006

Ceg 860-01: Object-Oriented Programming, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course motivates the need for object-oriented programming, and studies, in detail, object-oriented programming techniques, languages, and technology. The lectures will focus on the foundations of OOP, while the student presentations will focus on the applications and extensions of Object Technology.


Ceg 260-01: Digital Computer Hardware/Switching Circuits, Eric Maston Jan 2006

Ceg 260-01: Digital Computer Hardware/Switching Circuits, Eric Maston

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 221-01: Advanced C Programming For Engineers, Robert Helt Jan 2006

Ceg 221-01: Advanced C Programming For Engineers, Robert Helt

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, stacks, queues, hash tables, and binary trees. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).


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

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

Computer Science & Engineering Syllabi

The management of resources in multi-user computer systems. Emphasis is on problems of file-system design, process scheduling, memory allocation, protection, and tools needed for solutions. Course projects use the CIC++ language and include the design of portions of an operating system. 4 credit hours.


Ceg 477/677-01: Computer Graphics Ii, Thomas Wischgoll Jan 2006

Ceg 477/677-01: Computer Graphics Ii, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 333-01: Introduction To Unix, Thomas Wischgoll Jan 2006

Ceg 333-01: Introduction To Unix, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 498-01: Design Experience, Thomas C. Hartrum Jan 2006

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 c01mnunications 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 journals and on the quality of their collective efforts as reflected in group generated products.


Cs 340-01: Programming Language Workshop In C#, Krishnaprasad Thirunarayan Jan 2006

Cs 340-01: Programming Language Workshop In C#, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in C#. You are expected to learn the language and solve a set of programming problems assigned to you using MS Visual Studio.Net. 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.


Ceg 460/660-01: Introduction To Software Computer Engineering, Robert J. Weber Jan 2006

Ceg 460/660-01: Introduction To Software Computer Engineering, Robert J. Weber

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 468/668: Managing The Software Development Process, John A. Reisner Jan 2006

Ceg 468/668: Managing The Software Development Process, John A. Reisner

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 416-01: Matrix Computations, Bin Wang Jan 2006

Ceg 416-01: Matrix Computations, Bin Wang

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 student should familiarize himself/herself with MATLAB. A basic knowledge of matrix algebra is required.


Ceg 402/602-01: Introduction To Computer Communication, Bin Wang Jan 2006

Ceg 402/602-01: Introduction To Computer Communication, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 320/520-01: Computer Organization And Assembly Language Programming, Sridhar Ramachandran Jan 2006

Ceg 320/520-01: Computer Organization And Assembly Language Programming, Sridhar Ramachandran

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operation of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument passing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used. Three hours lecture, two hours lab. Prerequisite: CS 242, CEO 260.


Cs 214-01: Visual Basic.Net, Roddy Keish Jan 2006

Cs 214-01: Visual Basic.Net, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.


Cs 790-01: Multimedia Coding And Communication (I), Yong Pei Jan 2006

Cs 790-01: Multimedia Coding And Communication (I), Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt Jan 2006

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt

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 I) or EGR 101 (Engineering Mathematics).


Cs 141-01: Computer Programming - I, Michael Ondrasek Jan 2006

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.


Cs 415-01: Social Implications Of Computing, Leo Finkelstein Jan 2006

Cs 415-01: 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-01: Introduction To Formal Languages, Thomas Sudkamp Jan 2006

Cs 466/666-01: Introduction To Formal Languages, Thomas Sudkamp

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 with 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.


Multiple View Geometry For Video Analysis And Post-Production, Xiaochun Cao Jan 2006

Multiple View Geometry For Video Analysis And Post-Production, Xiaochun Cao

Electronic Theses and Dissertations

Multiple view geometry is the foundation of an important class of computer vision techniques for simultaneous recovery of camera motion and scene structure from a set of images. There are numerous important applications in this area. Examples include video post-production, scene reconstruction, registration, surveillance, tracking, and segmentation. In video post-production, which is the topic being addressed in this dissertation, computer analysis of the motion of the camera can replace the currently used manual methods for correctly aligning an artificially inserted object in a scene. However, existing single view methods typically require multiple vanishing points, and therefore would fail when only …


Collaboration Enforcement In Mobile Ad Hoc Networks, Ning Jiang Jan 2006

Collaboration Enforcement In Mobile Ad Hoc Networks, Ning Jiang

Electronic Theses and Dissertations

Mobile Ad hoc NETworks (MANETs) have attracted great research interest in recent years. Among many issues, lack of motivation for participating nodes to collaborate forms a major obstacle to the adoption of MANETs. Many contemporary collaboration enforcement techniques employ reputation mechanisms for nodes to avoid and penalize malicious participants. Reputation information is propagated among participants and updated based on complicated trust relationships to thwart false accusation of benign nodes. The aforementioned strategy suffers from low scalability and is likely to be exploited by adversaries. To address these problems, we first propose a finite state model. With this technique, no reputation …


Improving Routing Efficiency, Fairness, Differentiated Servises And Throughput In Optical Networks, Bin Zhou Jan 2006

Improving Routing Efficiency, Fairness, Differentiated Servises And Throughput In Optical Networks, Bin Zhou

Electronic Theses and Dissertations

Wavelength division multiplexed (WDM) optical networks are rapidly becoming the technology of choice in next-generation Internet architectures. This dissertation addresses the important issues of improving four aspects of optical networks, namely, routing efficiency, fairness, differentiated quality of service (QoS) and throughput. A new approach for implementing efficient routing and wavelength assignment in WDM networks is proposed and evaluated. In this approach, the state of a multiple-fiber link is represented by a compact bitmap computed as the logical union of the bitmaps of the free wavelengths in the fibers of this link. A modified Dijkstra's shortest path algorithm and a wavelength …


Modeling, Simulation, And Visualization Of 3d Lung Dynamics, Anand Santhanam Jan 2006

Modeling, Simulation, And Visualization Of 3d Lung Dynamics, Anand Santhanam

Electronic Theses and Dissertations

Medical simulation has facilitated the understanding of complex biological phenomenon through its inherent explanatory power. It is a critical component for planning clinical interventions and analyzing its effect on a human subject. The success of medical simulation is evidenced by the fact that over one third of all medical schools in the United States augment their teaching curricula using patient simulators. Medical simulators present combat medics and emergency providers with video-based descriptions of patient symptoms along with step-by-step instructions on clinical procedures that alleviate the patient's condition. Recent advances in clinical imaging technology have led to an effective medical visualization …


Sub-Pixel Registration In Computational Imaging And Applications To Enhancement Of Maxillofacial Ct Data, Murat Balci Jan 2006

Sub-Pixel Registration In Computational Imaging And Applications To Enhancement Of Maxillofacial Ct Data, Murat Balci

Electronic Theses and Dissertations

In computational imaging, data acquired by sampling the same scene or object at different times or from different orientations result in images in different coordinate systems. Registration is a crucial step in order to be able to compare, integrate and fuse the data obtained from different measurements. Tomography is the method of imaging a single plane or slice of an object. A Computed Tomography (CT) scan, also known as a CAT scan (Computed Axial Tomography scan), is a Helical Tomography, which traditionally produces a 2D image of the structures in a thin section of the body. It uses X-ray, which …


Algorithms For Discovering Communities In Complex Networks, Hemant Balakrishnan Jan 2006

Algorithms For Discovering Communities In Complex Networks, Hemant Balakrishnan

Electronic Theses and Dissertations

It has been observed that real-world random networks like the WWW, Internet, social networks, citation networks, etc., organize themselves into closely-knit groups that are locally dense and globally sparse. These closely-knit groups are termed communities. Nodes within a community are similar in some aspect. For example in a WWW network, communities might consist of web pages that share similar contents. Mining these communities facilitates better understanding of their evolution and topology, and is of great theoretical and commercial significance. Community related research has focused on two main problems: community discovery and community identification. Community discovery is the problem of extracting …


Wavelets In Real-Time Rendering, Weifeng Sun Jan 2006

Wavelets In Real-Time Rendering, Weifeng Sun

Electronic Theses and Dissertations

Interactively simulating visual appearance of natural objects under natural illumination is a fundamental problem in computer graphics. 3D computer games, geometry modeling, training and simulation, electronic commerce, visualization, lighting design, digital libraries, geographical information systems, economic and medical image processing are typical candidate applications. Recent advances in graphics hardware have enabled real-time rasterization of complex scenes under artificial lighting environment. Meanwhile, pre-computation based soft shadow algorithms are proven effective under low-frequency lighting environment. Under the most practical yet popular all-frequency natural lighting environment, however, real-time rendering of dynamic scenes still remains a challenging problem. In this dissertation, we propose a …


Algorithms For Haplotype Inference And Block Partitioning, Satya Ravi Vijaya Jan 2006

Algorithms For Haplotype Inference And Block Partitioning, Satya Ravi Vijaya

Electronic Theses and Dissertations

The completion of the human genome project in 2003 paved the way for studies to better understand and catalog variation in the human genome. The International HapMap Project was started in 2002 with the aim of identifying genetic variation in the human genome and studying the distribution of genetic variation across populations of individuals. The information collected by the HapMap project will enable researchers in associating genetic variations with phenotypic variations. Single Nucleotide Polymorphisms (SNPs) are loci in the genome where two individuals differ in a single base. It is estimated that there are approximately ten million SNPs in the …


Syntax-Based Concept Extraction For Question Answering, Demetrios Glinos Jan 2006

Syntax-Based Concept Extraction For Question Answering, Demetrios Glinos

Electronic Theses and Dissertations

Question answering (QA) stands squarely along the path from document retrieval to text understanding. As an area of research interest, it serves as a proving ground where strategies for document processing, knowledge representation, question analysis, and answer extraction may be evaluated in real world information extraction contexts. The task is to go beyond the representation of text documents as "bags of words" or data blobs that can be scanned for keyword combinations and word collocations in the manner of internet search engines. Instead, the goal is to recognize and extract the semantic content of the text, and to organize it …