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

Physical Sciences and Mathematics Commons™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 11371 - 11400 of 12809

Full-Text Articles in Physical Sciences and Mathematics

Fast Packet Classification Using Bloom Filters, Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, John Lockwood Jan 2006

Fast Packet Classification Using Bloom Filters, Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, John Lockwood

All Computer Science and Engineering Research

While the problem of general packet classification has received a great deal of attention from researchers over the last ten years, there is still no really satisfactory solution. Ternary Content Addressable Memory (TCAM), although widely used in practice, is both expensive and consumes a lot of power. Algorithmic solutions, which rely on commodity memory chips, are relatively inexpensive and power-efficient, but have not been able to match the generality and performance of TCAMs. In this paper we propose a new approach to packet classification, which combines architectural and algorithmic techniques. Our starting point is the well-known crossproducting algorithm, which is …

Go to article

Smooth Key-Framing Using The Image Plane, Leon Barrett, Cindy Grimm Jan 2006

Smooth Key-Framing Using The Image Plane, Leon Barrett, Cindy Grimm

All Computer Science and Engineering Research

This paper demonstrates the use of image-space constraints for key frame interpolation. Interpolating in image-space results in sequences with predictable and controlable image trajectories and projected size for selected objects, particularly in cases where the desired center of rotation is not fixed or when the key frames contain perspective distortion changes. Additionally, we provide the user with direct image-space control over {\em how} the key frames are interpolated by allowing them to directly edit the object's projected size and trajectory. Image-space key frame interpolation requires solving the inverse camera problem over a sequence of point constraints. This is a variation …

Go to article

Limit Crossing For Decision Problems, Sharlee Climer, Weixiong Zhang Jan 2006

Limit Crossing For Decision Problems, Sharlee Climer, Weixiong Zhang

All Computer Science and Engineering Research

Limit crossing is a methodology in which modified versions of a problem are solved and compared, yielding useful information about the original problem. Pruning rules that are used to exclude portions of search trees are excellent examples of the limit-crossing technique. In our previous work, we examined limit crossing for optimization problems. In this paper, we extend this methodology to decision problems. We demonstrate the use of limit crossing in our design of a tool for identifying K-SAT backbones. This tool is guaranteed to identify all of the backbone variables by solving at most n+1 formulae, where n is the …

Go to article

Design Of A Diversified Network Substrate, Jonathan Turner Jan 2006

Design Of A Diversified Network Substrate, Jonathan Turner

All Computer Science and Engineering Research

A diversified network substrate enables multiple end-to-end metanetworks to co-exist within a shared physical infrastructure. Metanetworks are implemented by metarouters, hosted by substrate routers, and metarouters are connected by metalinks. The substrate allocates resources (both link bandwidth and processing resources) to metarouters based on advance reservations received from metanetwork planning systems. It also enables dynamic creation of access metalinks, connecting end systems to metarouters, and supports mobility of end systems under the control of their metanetworks. This report defines a model for a diversified internet and presents a detailed design of the substrate that enables metanetworks to co-exist. The design …

Go to article

A Proposed Architecture For The Geni Backbone Platform, Jonathan Turner Jan 2006

A Proposed Architecture For The Geni Backbone Platform, Jonathan Turner

All Computer Science and Engineering Research

The GENI Project (Global Environment for Network Innovation) is a major NSF-sponsored initiative that seeks to create a national research facility to enable experimental deployment of innovative new network architectures on a sufficient scale to enable realistic evaluation. One key component of the GENI system will be the GENI Backbone Platform (GBP) that provides the resources needed to allow multiple experimental networks to co-exist within the shared GENI infrastructure. This report reviews the objectives for the GBP, reviews the key issues that affect its design and develops a detailed reference architecture in order to provide a concrete example for how …

Go to article

Feature Detection Using Curvature Maps And The Min-Cut/Max-Flow Graph Cut Algorithm, Timothy Gatzke, Cindy Grimm Jan 2006

Feature Detection Using Curvature Maps And The Min-Cut/Max-Flow Graph Cut Algorithm, Timothy Gatzke, Cindy Grimm

All Computer Science and Engineering Research

Automatic detection of features in three-dimensional objects is a critical part of shape matching tasks such as object registration and recognition. Previous approaches to local surface matching have either focused on man-made objects, where features are generally well-defined, or required some type of user interaction to select features. Manual selection of corresponding features and subjective determination of the difference between objects are time consuming processes requiring a high level of expertise. Curvature is a useful property of a surface, but curvature calculation on a discrete mesh is often noisy and not always accurate. However, the em Curvature Map, which represents …

Go to article

Acceleration Of Gapped Alignment In Blastp Using The Mercury System, Brandon B. Harris Jan 2006

Acceleration Of Gapped Alignment In Blastp Using The Mercury System, Brandon B. Harris

All Computer Science and Engineering Research

Protein databases have grown exponentially over the last decade. This exponential growth has made extracting valuable information from these databases increasingly time consuming. This project presents a new method of accelerating a commonly used program for performing similarity searching on protein databases, BLASTP. This project describes the design and implementation of Mercury BLASTP, a customized hardware accelerated variant of BLASTP. This project focuses on the gapped alignment stage of Mercury BLASTP and provides design details and implementation results.

Go to article

Mixed-Integer Linear Programming Solution To Multi-Robot Task Allocation Problem, Nuzhet Atay, Burchan Bayazit Jan 2006

Mixed-Integer Linear Programming Solution To Multi-Robot Task Allocation Problem, Nuzhet Atay, Burchan Bayazit

All Computer Science and Engineering Research

Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. This paper introduces a mixed-integer linear programming solution to coordinate multiple heterogenenous robots for detecting and controlling multiple regions of interest in an unknown environment. The objective function contains four basic requirements of a multi-robot system serving this purpose: control regions of interest, provide communication between robots, control maximum area and detect regions of interest. Our solution defines optimum locations of robots in order to maximize the objective function while efficiently satisfying some constraints such as avoiding obstacles and staying within the speed capabilities of the robots. …

Go to article

Efficient Scheduling For Sdmg Cioq Switches, Mei Yang, S. Q. Zheng Jan 2006

Efficient Scheduling For Sdmg Cioq Switches, Mei Yang, S. Q. Zheng

Electrical & Computer Engineering Faculty Research

Combined input and output queuing (CIOQ) switches are being considered as high-performance switch architectures due to their ability to achieve 100% throughput and perfectly emulate output queuing (OQ) switch performance with a small speedup factor S. To realize a speedup factor S, a conventional CIOQ switch requires the switching fabric and memories to operate S times faster than the line rate. In this paper, we propose to use a CIOQ switch with space-division multiplexing expansion and grouped input/output ports (SDMG CIOQ switch for short) to realize speedup while only requiring the switching fabric and memories to operate at the line …

Go to article

Development And Delivery Of Coursework: The Legal/Regulatory/Policy Environment Of Cyberforensics, John W. Bagby, John C. Ruhnka Jan 2006

Development And Delivery Of Coursework: The Legal/Regulatory/Policy Environment Of Cyberforensics, John W. Bagby, John C. Ruhnka

Journal of Digital Forensics, Security and Law

This paper describes a cyber-forensics course that integrates important public policy and legal issues as well as relevant forensic techniques. Cyber-forensics refers to the amalgam of multi-disciplinary activities involved in the identification, gathering, handling, custody, use and security of electronic files and records, involving expertise from the forensic domain, and which produces evidence useful in the proof of facts for both commercial and legal activities. The legal and regulatory environment in which electronic discovery takes place is of critical importance to cyber-forensics experts because the legal process imposes both constraints and opportunities for the effective use of evidence gathered through …

Go to article

The Design Of An Undergraduate Degree Program In Computer & Digital Forensics, Gary C. Kessler, Michael E. Schirling Jan 2006

The Design Of An Undergraduate Degree Program In Computer & Digital Forensics, Gary C. Kessler, Michael E. Schirling

Journal of Digital Forensics, Security and Law

Champlain College formally started an undergraduate degree program in Computer & Digital Forensics in 2003. The underlying goals were that the program be multidisciplinary, bringing together the law, computer technology, and the basics of digital investigations; would be available as on online and oncampus offering; and would have a process-oriented focus. Success of this program has largely been due to working closely with practitioners, maintaining activity in events related to both industry and academia, and flexibility to respond to ever-changing needs. This paper provides an overview of how this program was conceived, developed, and implemented; its evolution over time; and …

Go to article

Alphaco: A Teaching Case On Information Technology Audit And Security, Hüseyin Tanriverdi, Joshua Bertsch, Jonathan Harrison, Po-Ling Hsiao, Ketan S. Mesuria, David Hendrawirawan Jan 2006

Alphaco: A Teaching Case On Information Technology Audit And Security, Hüseyin Tanriverdi, Joshua Bertsch, Jonathan Harrison, Po-Ling Hsiao, Ketan S. Mesuria, David Hendrawirawan

Journal of Digital Forensics, Security and Law

Recent regulations in the United States (U.S.) such as the Sarbanes-Oxley Act of 2002 require top management of a public firm to provide reasonable assurance that they institute internal controls that minimize risks over the firm’s operations and financial reporting. External auditors are required to attest to the management’s assertions over the effectiveness of those internal controls. As firms rely more on information technology (IT) in conducting business, they also become more vulnerable to IT related risks. IT is critical for initiating, recording, processing, summarizing and reporting accurate financial and non-financial data. Thus, understanding IT related risks and instituting internal …

Go to article

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.

Go to article

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.

Go to article

Cs 205-04,05,06: Computer Literacy And Office Automation, Terri Bauer Jan 2006

Cs 205-04,05,06: Computer Literacy And Office Automation, Terri Bauer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 142-01: Computer Programming Ii, Eric Maston Jan 2006

Cs 142-01: Computer Programming Ii, Eric Maston

Computer Science & Engineering Syllabi

This course provides a continuation to the general introduction of computer programming begun in CS 141. Examples from and applications to a broad range of problems are given. The concepts covered will be applied to the Java programming language. (Students must register for both lecture and one laboratory section.)

Go to article

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.

Go to article

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.

Go to article

Ceg 750-01: Microprocessor, Jack Jean Jan 2006

Ceg 750-01: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 435/635-01: Distributed Computing And Systems, Yong Pei Jan 2006

Ceg 435/635-01: Distributed Computing And Systems, Yong Pei

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.

Go to article

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 C/C++ language and include the design of portions of an operating system. 4 credit hours.

Go to article

Ceg 411/611: Microprocessor-Based System Design, Jack Jean Jan 2006

Ceg 411/611: Microprocessor-Based System Design, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 360/560-01: Digital System Design, Travis E. Doom Jan 2006

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.

Go to article

Design And Evaluation Of A Blast Ungapped Extension Accelerator, Master's Thesis, Joseph M. Lancaster Jan 2006

Design And Evaluation Of A Blast Ungapped Extension Accelerator, Master's Thesis, Joseph M. Lancaster

All Computer Science and Engineering Research

The amount of biosequence data being produced each year is growing exponentially. Extracting useful information from this massive amount of data is becoming an increasingly difficult task. This thesis focuses on accelerating the most widely-used software tool for analyzing genomic data, BLAST. This thesis presents Mercury BLAST, a novel method for accelerating searches through massive DNA databases. Mercury BLAST takes a streaming approach to the BLAST computation by offloading the performance-critical sections onto reconfigurable hardware. This hardware is then used in combination with the processor of the host system to deliver BLAST results in a fraction of the time of …

Go to article

Automatic Application-Specific Customization Of Softcore Processor Microarchitecture, Masters Thesis, May 2006, Shobana Padmanabhan Jan 2006

Automatic Application-Specific Customization Of Softcore Processor Microarchitecture, Masters Thesis, May 2006, Shobana Padmanabhan

All Computer Science and Engineering Research

Applications for constrained embedded systems are subject to strict runtime and resource utilization bounds. With soft core processors, application developers can customize the processor for their application, constrained by available hardware resources but aimed at high application performance. The more reconfigurable the processor is, the more options the application developers will have for customization and hence increased potential for improving application performance. However, such customization entails developing in-depth familiarity with all the parameters, in order to configure them effectively. This is typically infeasible, given the tight time-to-market pressure on the developers. Alternatively, developers could explore all possible configurations, but being …

Go to article

Distributed Utilization Control For Real-Time Clusters With Load Balancing, Yong Fu, Hongan Wang, Chenyang Lu, Ramu S. Chandra Jan 2006

Distributed Utilization Control For Real-Time Clusters With Load Balancing, Yong Fu, Hongan Wang, Chenyang Lu, Ramu S. Chandra

All Computer Science and Engineering Research

Recent years have seen rapid growth of online services that rely on large-scale server clusters to handle high volume of requests. Such clusters must adaptively control the CPU utilizations of many processors in order to maintain desired soft real-time performance and prevent system overload in face of unpredictable workloads. This paper presents DUC-LB, a novel distributed utilization control algorithm for cluster-based soft real-time applications. Compared to earlier works on utilization control, a distinguishing feature of DUC-LB is its capability to handle system dynamics caused by load balancing, which is a common and essential component of most clusters today. Simulation results …

Go to article

A Theory Of Load Adjustments And Its Implications For Congestion Control, Sergey Gorinsky, Manfred Georg, Maxim Podlesny, Christoph Jechlitschek Jan 2006

A Theory Of Load Adjustments And Its Implications For Congestion Control, Sergey Gorinsky, Manfred Georg, Maxim Podlesny, Christoph Jechlitschek

All Computer Science and Engineering Research

Multiplicative Increase (MI), Additive Increase (AI), and Multiplicative Decrease (MD) are linear adjustments used extensively in networking. However, their properties are not fully understood. We analyze responsiveness (time for the total load to reach the target load), smoothness (maximal size of the total load oscillations after reaching the target load), fairing speed (speed of convergence to equal individual loads) and scalabilities of MAIMD algorithms, which generalize AIMD algorithms via optional inclusion of MI. We prove that an MAIMD can provide faster asymptotic fairing than a less smooth AIMD. Furthermore, we discover that loads under a specific MAIMD converge from any …

Go to article

Design Issues Of Reserved Delivery Subnetworks, Doctoral Dissertation, May 2006, Ruibiao Qiu Jan 2006

Design Issues Of Reserved Delivery Subnetworks, Doctoral Dissertation, May 2006, Ruibiao Qiu

All Computer Science and Engineering Research

The lack of per-flow bandwidth reservation in today's Internet limits the quality of service that an information service provider can provide. This dissertation introduces the reserved delivery subnetwork (RDS), a mechanism that provides consistent quality of service by implementing aggregate bandwidth reservation. A number of design and deployment issues of RDSs are studied. First, the configuration problem of a single-server RDS is formulated as a minimum concave cost network flow problem, which properly reflects the economy of bandwidth aggregation, but is also an NP-hard problem. To make the RDS configuration problem tractable, an efficient approximation heuristic, largest demands first (LDF), …

Go to article

Manifold Learning For Natural Image Sets, Doctoral Dissertation August 2006, Richard Souvenir Jan 2006

Manifold Learning For Natural Image Sets, Doctoral Dissertation August 2006, Richard Souvenir

All Computer Science and Engineering Research

The field of manifold learning provides powerful tools for parameterizing high-dimensional data points with a small number of parameters when this data lies on or near some manifold. Images can be thought of as points in some high-dimensional image space where each coordinate represents the intensity value of a single pixel. These manifold learning techniques have been successfully applied to simple image sets, such as handwriting data and a statue in a tightly controlled environment. However, they fail in the case of natural image sets, even those that only vary due to a single degree of freedom, such as a …

Go to article

Design Concepts And Process Analysis For Transmuter Fuel Manufacturing, Georg F. Mauer Jan 2006

Design Concepts And Process Analysis For Transmuter Fuel Manufacturing, Georg F. Mauer

Fuels Campaign (TRP)

The safe and effective manufacturing of actinide-bearing fuels for any transmutation strategy requires that the entire manufacturing process be contained within a shielded hot cell environment. To ensure that the fabrication process is feasible, the entire process must be designed for remote operation. The equipment must be reliable enough to perform over several decades, and also easy to maintain or repair remotely. The facility must also be designed to facilitate its own decontamination and decommissioning. In addition to these design factors, the potential viability of any fuel fabrication process will also be impacted by a number of variables, such as …

Go to article

First Prev Next Last