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

Computer Sciences Commons

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

2004

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 91 - 120 of 797

Full-Text Articles in Computer Sciences

Mercer Kernels For Object Recognition With Local Features, Siwei Lyu Oct 2004

Mercer Kernels For Object Recognition With Local Features, Siwei Lyu

Computer Science Technical Reports

In this paper, we propose a new class of kernels for object recognition based on local image feature representations. Formal proofs are given to show that these kernels satisfy the Mercer condition and reflect similarities between sets of local features. In addition, multiple types of local features and semilocal constraints are incorporated to reduce mismatches between local features, thus further improve the classification performance. Experimental results of SVM classifiers coupled with the proposed kernels are reported on ecognition tasks with the standard COIL-100 database and compared with existing methods. The proposed kernels achieved satisfactory performance and were robust to changes …


Efficient Wait-Free Implementation Of Multiword Ll/Sc Variables, Prasad Jayanti, Srdjan Petrovic Oct 2004

Efficient Wait-Free Implementation Of Multiword Ll/Sc Variables, Prasad Jayanti, Srdjan Petrovic

Computer Science Technical Reports

Since the design of lock-free data structures often poses a formidable intellectual challenge, researchers are constantly in search of abstractions and primitives that simplify this design. The multiword LL/SC object is such a primitive: many existing algorithms are based on this primitive, including the nonblocking and wait-free universal constructions of Anderson and Moir (1995), the closed objects construction of Chandra et al.(1998) and the snapshot algorithms of Jayanti (2002, 2004). In this paper, we consider the problem of implementing a W-word LL/SC object shared by N processes. The previous best algorithm, due to Anderson and Moir (1995), is time optimal …


Experimental Evaluation Of Wireless Simulation Assumptions, David Kotz, Calvin Newport, Robert S. Gray, Jason Liu, Yougu Yuan, Chip Elliot Oct 2004

Experimental Evaluation Of Wireless Simulation Assumptions, David Kotz, Calvin Newport, Robert S. Gray, Jason Liu, Yougu Yuan, Chip Elliot

Dartmouth Scholarship

All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. We provide a comprehensive review of six assumptions that are still part of many ad hoc network simulation studies, despite increasing awareness of the need to represent more realistic features, including hills, obstacles, link asymmetries, and unpredictable fading. We use an extensive set of measurements from a large outdoor routing experiment to demonstrate the weakness of these assumptions, and show how these assumptions cause simulation results to differ significantly from experimental results. We close with a series of recommendations for researchers, whether …


Ceg 361/561-01: Introduction To Software Testing, John A. Reisner Oct 2004

Ceg 361/561-01: Introduction To Software Testing, John A. Reisner

Computer Science & Engineering Syllabi

This course covers software testing strategies, along with established best practices, so students learn how to test their software in a complete and systematic (vice ad-hoc) manner. Particular attention is paid to planning, writing, and executing software testing documentation, i.e., software test plan, to include documented results. Various projects are assigned, designed to illustrate various challenges associated with software testing, and to reinforce the strategies and techniques used to overcome these challenges.


Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2004

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.


Ceg 770: Computer Engineering Mathematics, Yong Pei Oct 2004

Ceg 770: Computer Engineering Mathematics, Yong Pei

Computer Science & Engineering Syllabi

Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, queueing theory, mathematics of signal processing, difference equations, and related differential and matrix equations. In addition to mathematical theory, appropriate applications will be presented.


Cs 240: Introduction To Computer Science I, Dale E. Nelson Oct 2004

Cs 240: Introduction To Computer Science I, Dale E. Nelson

Computer Science & Engineering Syllabi

No abstract provided.


Lsdis: Large Scale Distributed Information Systems Lab, Amit P. Sheth Oct 2004

Lsdis: Large Scale Distributed Information Systems Lab, Amit P. Sheth

Kno.e.sis Publications

The LSDIS (Large Scale Distributed Information Systems) lab was established in 1994 with the guidance and direction provided by Dr. Amit P. Sheth with the help of Dr. John A. Miller and Dr. Krzysztof J. Kochut. In 1998 this faculty group was further strengthened by the addition of Dr. Ismailcem B. Arpinar. LSDIS is the largest research group in Computer Science at UGA and one of the strongest in its area. During Fall 2004, it is funding 15 students (majority of them PhD), and has one research staff.

Over the years LSDIS has been actively involved in research projects in …


On Thacker's Biomedia (2004), Nicholas Ruiz Iii Oct 2004

On Thacker's Biomedia (2004), Nicholas Ruiz Iii

Reconstruction: Studies in Contemporary Culture

[First paragraph]

Only we could have done it. The Code (DNA and its analogs, etc.) that we perhaps only narrate, never forgetting all of the fictions that narration portends, today consciously edits the text that evolution has edited unconsciously for eons. Thacker considers how humans -- perhaps little more than interactive Code, manipulate the Code -- with the technology of the Code. No other faction of Code has yet to make such heady ‘gains.’ Where posthumanity was always a literary endeavor, a literary bypass, out of instrumental science and into fictive states, it now is a technical endeavor, encompassing a …


Ceg 434/634: Concurrent Software Design, Thomas C. Hartrum Oct 2004

Ceg 434/634: Concurrent Software Design, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency, and their solutions are examined through course projects and through readings on operating system design.


Ceg 449/699: Mobile Computing, Yong Pei Oct 2004

Ceg 449/699: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

This senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help students in the networking area establish a solid foundation in wireless networking protocols, fundamental concepts and principles. It will also introduce students to a few hot topics in wireless networking and mobile computing research.

The course will start with a review over fundamental design challenges, architectural principles and philosophy for the Internet and heterogeneous networks. The focus will then move on to an in-depth examination of wireless networking protocols, and system design techniques for mobile …


Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor Oct 2004

Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor

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. Some programming assignments may involve complex arithmetic and trigonometric exponential functions.


Ceg 360/560 Ee 415/651: Digital System Design, Travis E. Doom Oct 2004

Ceg 360/560 Ee 415/651: 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.


Cs 405/605: Introduction To Database Management Systems, Soon M. Chung Oct 2004

Cs 405/605: Introduction To Database Management Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Entity Relationship, relational, object-oriented models for databases are presented. Physical implementation methods are discussed.


Cs 784: Programming Languages, Krishnaprasad Thirunarayan Oct 2004

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 409/609: Principles Of Artificial Intelligence, Michael T. Cox Oct 2004

Cs 409/609: Principles Of Artificial Intelligence, Michael T. Cox

Computer Science & Engineering Syllabi

"Principles of Artificial Intelligence" is a graduate/undergraduate level introductory course in Artificial Intelligence (AI), designed for students interested in or specializing in AL We will cover several basic topics ranging from knowledge representation, inference, problem solving, search, the predicate calculus and other fundamentals of AI, to selected topics concerning intelligent agents, natural language processing, planning, learning, and case-based reasoning. The intent of the course is to provide a background in artificial intelligence, an exposure to the major issues and methods in the field, and experience in writing AI programs. The course will also examine real AI systems and allow the …


Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan Oct 2004

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

No abstract provided.


Cs 205: Computer Literacy And Office Automation, Kim Gros Oct 2004

Cs 205: Computer Literacy And Office Automation, Kim Gros

Computer Science & Engineering Syllabi

To understand basic computer operations and the principal components of a computer and connected peripheral devices

To understand and examine current operating systems, software utilities, device drivers and application software

To define and understand current storage technology and learn about logical file storage and management

To become proficient in using application software categories that are covered in the seven modules

To understand the basics of e-mail

To introduce networking concepts including the Internet and its components and web browser basics

To learn ways to protect your data and avoid computer disasters


Ceg 460/660: Introduction To Software Computer Engineering, Robert J. Weber Oct 2004

Ceg 460/660: 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.


Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan Oct 2004

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 208: Computer Programming For Business With Java, I, Robert Rea Oct 2004

Cs 208: Computer Programming For Business With Java, I, Robert Rea

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 an intermediate-level of programming in Java. This course assumes students have never written a program before.


Ceg 702: Advanced Computer Communications, Daniel C. Lee Oct 2004

Ceg 702: Advanced Computer Communications, Daniel C. Lee

Computer Science & Engineering Syllabi

The general objective of this graduate-level course on advanced computer communication and networking technologies is to develop students' abilities to (1) conduct research in the area of computer networks and (2) innovate network technologies. This objective will be achieved through a reading/lecture/discussion component and a project component. In particular, we will read papers on various aspects of advanced computer networking, e.g., routing, admission control, congestion/flow control, queuing theory, link scheduling, internetworking, wireless technologies, quality of service, and peer-to-peer networks. We will also learn how to apply (mathematical) optimization to networking.


Cs 340: Programming Language Workshop In Java, Ronald F. Taylor Oct 2004

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://fuva.stm.com. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.


Ceg 720: Computer Architecture I, Soon M. Chung Oct 2004

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. 3 hours lecture and 2 hours lab.


Ceg 255: Introduction To The Design Of Information Technology Systems, Eric Matson Oct 2004

Ceg 255: Introduction To The Design Of Information Technology Systems, Eric Matson

Computer Science & Engineering Syllabi

Information systems consist of modern elements such as database systems, networks, multiplatform distributed computing, web infrastructure and multimedia computing. In this course we will address these areas individually and also where they intersect to gain a basic understanding of how information technology can be used to solve real problems.


Ceg 210: Pc Networking I, Chris P. Fickert Oct 2004

Ceg 210: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

The objective of the course is to provide an introduction to PC networking hardware, concepts, and technologies with a focus on hardware configuration and LAN administration using in-class, hands-on exercises with Novell NetWare.


Ceg 433/633: Operating Systems, Prabhaker Mateti Oct 2004

Ceg 433/633: 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 C/C++ language and include the design of portions of an operating system.


Ceg/Ee 260: Digital Computer Hardware Switching Circuits, Jack Jean Oct 2004

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum Oct 2004

Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course covers advanced topics in software engineering. Aspects of problem specification, design, verification, and evaluation are discussed. We will focus on design methods, including software patterns and software architecture, plus some advanced topics involving formal methods of software specification or evaluation using software metrics. Students will participate in team projects to apply the methods discussed.


Cs 141: Computer Programming I, Robert Rea Oct 2004

Cs 141: Computer Programming I, Robert Rea

Computer Science & Engineering Syllabi

CS 141 is dedicated to teaching the fundamentals of computer programming The concepts covered in this class will be applied using the Java programming language.