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 11041 - 11070 of 12808

Full-Text Articles in Physical Sciences and Mathematics

Ceg 461/661-01: Object-Oriented Programming And Design, Thomas C. Hartrum Jan 2007

Ceg 461/661-01: Object-Oriented Programming And Design, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Study of object-oriented design and programming. Programming topics emphasize the core concepts of encapsulation, inheritance, polymorphism, and dynamic binding. Additional topics include class organization, software maintenance, and design of reusable components. There is a project to be implemented in a modem object-oriented language such as Java or C++.

Go to article

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

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

Computer Science & Engineering Syllabi

This course will cover some of the challenges and issues associated with managing software projects. Emphasis will occur on two fronts: (1) the software project manager's view (that is, what considerations and obstacles confront project managers during software development), and (2) the organizational view (that is, how organizations can foster a climate where software project management is performed smartly throughout an organization).

Go to article

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

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.

Go to article

Ceg 499/699-01: Wireless Sensor Networks, Bin Wang Jan 2007

Ceg 499/699-01: Wireless Sensor Networks, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 498-01: Team Projects I And Ii, John C. Gallagher Jan 2007

Ceg 498-01: Team Projects I And Ii, John C. Gallagher

Computer Science & Engineering Syllabi

CEG 498 (Team Projects I and II) 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 journals and on the quality of their collective efforts as reflected in group generated products.

Go to article

Ceg 750-01: Microprocessor, Jack Jean Jan 2007

Ceg 750-01: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 820-01: Computer Architecture Ii, Soon M. Chung Jan 2007

Ceg 820-01: Computer Architecture Ii, Soon M. Chung

Computer Science & Engineering Syllabi

Continuation of CEG720 with more details on multiprocessor systems, parallel processing, and performance analysis.

Go to article

Ceg 725-01: Computer Vision Ii, Bin Wang Jan 2007

Ceg 725-01: Computer Vision Ii, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

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

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

Dna Repair In Incipient Alzheimer's Disease, Monika Ray, Weixiong Zhang Jan 2007

Dna Repair In Incipient Alzheimer's Disease, Monika Ray, Weixiong Zhang

All Computer Science and Engineering Research

Alzheimer’s disease (AD) is a progressive neurodegenerative disorder currently with no cure. Understanding the pathogenesis in the early stages of late-onset AD can help gain important mechanistic insights into this disease as well as aid in effective drug development. The analysis of incipient AD is steeped in difficulties due to its slight pathological and genetic differences from normal ageing. The difficulty also lies in the choice of analysis techniques as statistical power to analyse incipient AD with a small sample size, as is common in pilot studies, can be low if the proper analytical tool is not employed. In this …

Go to article

Splice: A Standardized Peripheral Logic And Interface Creation Engine, Justin Thiel Jan 2007

Splice: A Standardized Peripheral Logic And Interface Creation Engine, Justin Thiel

All Computer Science and Engineering Research

Recent advancements in FPGA technology have allowed manufacturers to place general-purpose processors alongside user-configurable logic gates on a single chip. At first glance, these integrated devices would seem to be the ideal deployment platform for hardware-software co-designed systems, but some issues, such as incompatibility across vendors and confusion over which bus interfaces to support, have impeded adoption of these platforms. This thesis describes the design and operation of Splice, a software-based code generation tool intended to address these types of issues by providing a bus-independent structure that allows end-users to easily integrate their customized peripheral logic into embedded systems. To …

Go to article

Extending Bpel For Interoperable Pervasive Computing, Gregory Hackmann, Christopher Gill, Christopher Gill, Gruia-Catalin Roman Jan 2007

Extending Bpel For Interoperable Pervasive Computing, Gregory Hackmann, Christopher Gill, Christopher Gill, Gruia-Catalin Roman

All Computer Science and Engineering Research

The widespread deployment of mobile devices like PDAs and mobile phones has created a vast computation and communication platform for pervasive computing applications. However, these devices feature an array of incompatible hardware and software architectures, discouraging ad-hoc interactions among devices. The Business Process Execution Language (BPEL) allows users in wired computing settings to model applications of significant complexity, leveraging Web standards to guarantee interoperability. However, BPEL's inflexible communication model effectively prohibits its deployment on the kinds of dynamic wireless networks used by most pervasive computing devices. This paper presents extensions to BPEL that address these restrictions, transforming BPEL into a …

Go to article

The Effect Of Object Color On Depth Ordering, Reynold Bailey, Cindy Grimm, Christopher Davoli, Richard Abrams Jan 2007

The Effect Of Object Color On Depth Ordering, Reynold Bailey, Cindy Grimm, Christopher Davoli, Richard Abrams

All Computer Science and Engineering Research

The relationship between color and perceived depth for realistic, colored objects with varying shading was explored. Background: Studies have shown that warm-colored stimuli tend to appear nearer in depth than cool-colored stimuli. The majority of these studies asked human observers to view physically equidistant, colored stimuli and compare them for relative depth. However, in most cases, the stimuli presented were rather simple: straight colored lines, uniform color patches, point light sources, or symmetrical objects with uniform shading. Additionally, the colors were typically highly saturated. Although such stimuli are useful for isolating and studying depth cues in certain contexts, they leave …

Go to article

Determining Alpha-Helix Correspondence For Protein Structure Prediction From Cryo-Em Density Maps, Master's Thesis, May 2007, Sasakthi S. Abeysinghe Jan 2007

Determining Alpha-Helix Correspondence For Protein Structure Prediction From Cryo-Em Density Maps, Master's Thesis, May 2007, Sasakthi S. Abeysinghe

All Computer Science and Engineering Research

Determining protein structure is an important problem for structural biologists, which has received a significant amount of attention in the recent years. In this thesis, we describe a novel, shape-modeling approach as an intermediate step towards recovering 3D protein structures from volumetric images. The input to our method is a sequence of alpha-helices that make up a protein, and a low-resolution volumetric image of the protein where possible locations of alpha-helices have been detected. Our task is to identify the correspondence between the two sets of helices, which will shed light on how the protein folds in space. The central …

Go to article

Strong Performance Guarantees For Asynchronous Buffered Crossbar Schedulers, Jonathon Turner Jan 2007

Strong Performance Guarantees For Asynchronous Buffered Crossbar Schedulers, Jonathon Turner

All Computer Science and Engineering Research

Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Until recently, such performance guarantees have only been developed for crossbars that switch cells rather than variable length packets. Cell-based crossbars incur a worst-case bandwidth penalty of up to a factor of two, since they must fragment variable length packets into fixed length cells. In addition, schedulers for cell-based crossbars may fail to deliver the expected performance guarantees when …

Go to article

Efficient Fair Algorithms For Message Communication, Sergey Gorinsky, Eric J. Friedman, Shane Henderson, Christoph Jechlitschek Jan 2007

Efficient Fair Algorithms For Message Communication, Sergey Gorinsky, Eric J. Friedman, Shane Henderson, Christoph Jechlitschek

All Computer Science and Engineering Research

A computer network serves distributed applications by communicating messages between their remote ends. Many such applications desire minimal delay for their messages. Beside this efficiency objective, allocation of the network capacity is also subject to the fairness constraint of not shutting off communication for any individual message. Processor Sharing (PS) is a de facto standard of fairness but provides significantly higher average delay than Shortest Remaining Processing Time (SRPT), which is an optimally efficient but unfair algorithm. In this paper, we explore efficient fair algorithms for message communication where fairness means that no message is delivered later than under PS. …

Go to article

Context-Aware Publish Subscribe In Mobile Ad Hoc Networks, Davide Frey, Gruia-Catalin Roman Jan 2007

Context-Aware Publish Subscribe In Mobile Ad Hoc Networks, Davide Frey, Gruia-Catalin Roman

All Computer Science and Engineering Research

The publish-subscribe communication paradigm is enjoying increasing popularity thanks to its ability to simplify the development of complex distributed applications. However, existing solutions in the publish-subscribe domain address only part of the challenges associated with the development of applications in dynamic scenarios such as mobile ad hoc networks. Mobile applications must be able to assist users in a variety of situations, responding not only to their inputs but also to the characteristics of the environment in which they operate. In this paper, we address these challenges by extending the publish-subscribe paradigm with the ability to manage and exploit context information …

Go to article

Experimental Evaluation Of A Coarse-Grained Switch Scheduler, Charlie Wiseman, Jon Turner, Ken Wong, Brandon Heller Jan 2007

Experimental Evaluation Of A Coarse-Grained Switch Scheduler, Charlie Wiseman, Jon Turner, Ken Wong, Brandon Heller

All Computer Science and Engineering Research

Modern high performance routers rely on sophisticated interconnection networks to meet ever increasing demands on capacity. Regulating the flow of packets through these interconnects is critical to providing good performance, particularly in the presence of extreme traffic patterns that result in sustained overload at output ports. Previous studies have used a combination of analysis and idealized simulations to show that coarse-grained scheduling of traffic flows can be effective in preventing congestion, while ensuring high utilization. In this paper, we study the performance of a coarse-grained scheduler in a real router with a scalable architecture similar to those found in high …

Go to article

Improving Individual Flow Performance With Multiple Queue Fair Queuing, Manfred Georg, Christopher Jechlitschek, Sergey Gorinsky Jan 2007

Improving Individual Flow Performance With Multiple Queue Fair Queuing, Manfred Georg, Christopher Jechlitschek, Sergey Gorinsky

All Computer Science and Engineering Research

Fair Queuing (FQ) algorithms provide isolation between packet flows, allowing max-min fair sharing of a link even when flows misbehave. However, fairness comes at the expense of per-flow state. To keep the memory requirement independent of the flow count, the router can isolate aggregates of flows, rather than individual flows. We investigate the feasibility of protecting individual flows under such aggregate isolation in the context of Multiple Queue Fair Queuing (MQFQ), where the router maintains a fixed number of queues and associates multiple queues with each flow. MQFQ places packets in the shortest queue associated with their flow. The redundancy …

Go to article

Configurable Component Middleware For Distributed Real-Time Systems With Aperiodic And Periodic Tasks, Yuanfang Zhang, Christopher Gill, Chenyang Lu Jan 2007

Configurable Component Middleware For Distributed Real-Time Systems With Aperiodic And Periodic Tasks, Yuanfang Zhang, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

Many distributed real-time applications must handle mixed periodic and aperiodic tasks with diverse requirements. However, existing middleware lacks flexible configuration mechanisms needed to manage end-to-end timing easily for a wide range of different applications with both periodic and aperiodic tasks. The primary contribution of this work is the design, implementation and performance evaluation of the first configurable component middleware services for admission control and load balancing of aperiodic and periodic tasks in distributed real-time systems. Empirical results demonstrate the need for and effectiveness of our configurable component middleware approach in supporting different applications with periodic and aperiodic tasks.

Go to article

Optimal Discrete Rate Adaptation For Distributed Real-Time Systems, Yingming Chen, Chenyang Lu, Xenofon Kutsoukos Jan 2007

Optimal Discrete Rate Adaptation For Distributed Real-Time Systems, Yingming Chen, Chenyang Lu, Xenofon Kutsoukos

All Computer Science and Engineering Research

Many distributed real-time systems face the challenge of dynamically maximizing system utility in response to fluctuations in system workload. We present the MultiParametric Rate Adaptation (MPRA) algorithm for discrete rate adaptation in distributed real-time systems with end-to-end tasks. The key novelty and advantage of MPRA is that it can efficiently produce optimal solutions in response to workload variations such as dynamic task arrivals. Through offline preprocessing MPRA transforms an NP-hard utility optimization problem to the evaluation of a piecewise linear function of the CPU utilization. At run time MPRA produces optimal solutions by evaluating the function based on the CPU …

Go to article

Scheduling Induced Bounds And The Verification Of Preemptive Real-Time Systems, Terry Tidwell, Christopher Gill, Venkita Subramonian Jan 2007

Scheduling Induced Bounds And The Verification Of Preemptive Real-Time Systems, Terry Tidwell, Christopher Gill, Venkita Subramonian

All Computer Science and Engineering Research

Distributed real-time and embedded (DRE) systems have stringent constraints on timeliness and other properties whose assurance is crucial to correct system behavior. Our previous research has shown that detailed models of essential middleware mechanisms can be developed, composed, and for constrained examples verified tractably, using state of the art timed automata model checkers. However, to apply model checking to a wider range of real-time systems, particularly those involving more general forms of preemptive concurrency, new techniques are needed to address decidability and tractability concerns. This paper makes three contributions to research on formal verification and validation of DRE systems. First, …

Go to article

Control Of A Robotic Arm Using Low-Dimensional Emg And Ecog Biofeedback, Timothy M. Blackely, William D. Smart Jan 2007

Control Of A Robotic Arm Using Low-Dimensional Emg And Ecog Biofeedback, Timothy M. Blackely, William D. Smart

All Computer Science and Engineering Research

In this dissertation we describe a system that uses a low dimensional input derived from electromyography and electrocorticography data to control a robot. The work involves creating a system that allows signals recorded directly from a human body to allow control of a small robot arm. We compare direct joystick control with electromyogram (EMG) input to determine if one input system is superior, or if the quality of control between them is comparable. We also verify the system that is used to record the electromyogram signals is adaptable to other forms of biosignal input; in particular, direct connection to a …

Go to article

Combined Controllers That Follow Imperfect Input Motions For Humanoid Robots, Gazihan Alankus, Burchan O. Bayazit Jan 2007

Combined Controllers That Follow Imperfect Input Motions For Humanoid Robots, Gazihan Alankus, Burchan O. Bayazit

All Computer Science and Engineering Research

Humanoid robots have the potential to become a part of everyday life as their hardware and software challenges are being solved. In this paper we present a system that gets as input a motion trajectory in the form of motion capture data, and produces a controller that controls a humanoid robot in real-time to achieve a motion trajectory that is similar to the input motion data. The controller expects the input motion data not to be dynamically feasible for the robot and employs a combined controller with corrective components to keep the robot balanced while following the motion. Since the …

Go to article

Mercury Blast Dictionaries: Analysis And Performance Measurement, Jeremy Buhler Jan 2007

Mercury Blast Dictionaries: Analysis And Performance Measurement, Jeremy Buhler

All Computer Science and Engineering Research

This report describes a hashing scheme for a dictionary of short bit strings. The scheme, which we call near-perfect hashing, was designed as part of the construction of Mercury BLAST, an FPGA-based accelerator for the BLAST family of biosequence comparison algorithms. Near-perfect hashing is a heuristic variant of the well-known displacement hashing approach to building perfect hash functions. It uses a family of hash functions composed from linear transformations on bit vectors and lookups in small precomputed tables, both of which are especially appropriate for implementation in ardware logic. We show empirically that for inputs derived from genomic DNA sequences, …

Go to article

Configuring Low Cost Metanetworks On A Shared Substrate, Jing Lu, Jonathan Turner Jan 2007

Configuring Low Cost Metanetworks On A Shared Substrate, Jing Lu, Jonathan Turner

All Computer Science and Engineering Research

In a diversified internet, meta-networks (“metanets?for short) share a common substrate and offer value-added services to millions of users around the globe. Therefore, configuring low-cost metanets with links having enough bandwidth to accommodate all anticipated user traffic is critical to the success of the metanets. In this paper, we propose a novel pruning algorithm that configures metanets on any given substrate in a cost-efficient way. In contrast to other testbed configuration systems, we solve the metanet configuration problem from a higher level specification and produces a network that is dimensioned to handle the specified traffic. To the best of our …

Go to article

Mobile Wireless Sensor Network Connectivity Repair With K-Redundanc, Nuzhet Atay, Burchan Bayazit Jan 2007

Mobile Wireless Sensor Network Connectivity Repair With K-Redundanc, Nuzhet Atay, Burchan Bayazit

All Computer Science and Engineering Research

Connectivity is an important requirement for wireless sensor networks especially in real-time monitoring and data transfer applications. However, node movements and failures change the topology of the initial deployed network, which can result in partitioning of the communication graph. In this paper, we present a method for maintaining and repairing the communication network of a dynamic mobile wireless sensor network. We assume that we cannot control the motion of wireless sensor nodes, but there are robots whose motion can be controlled by the wireless sensor nodes to maintain and repair the connectivity of the network. At the heart of our …

Go to article

Customizing Component Middleware For Distributed Real-Time Systems With Aperiodic And Periodic Tasks, Yuanfang Zhang, Christopher Gill, Chenyang Lu Jan 2007

Customizing Component Middleware For Distributed Real-Time Systems With Aperiodic And Periodic Tasks, Yuanfang Zhang, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

Many distributed real-time applications must handle mixed aperiodic and periodic tasks with diverse requirements. However, existing middleware lacks flexible configuration mechanisms needed to manage end-to-end timing easily for a wide range of different applications with both aperiodic and periodic tasks. The primary contribution of this work is the design, implementation and performance evaluation of the first configurable component middleware services for admission control and load balancing of aperiodic and periodic tasks in distributed real-time systems. Empirical results demonstrate the need for, and the effectiveness of, our configurable component middleware approach in supporting different applications with aperiodic and periodic tasks.

Go to article

Some Peer-To-Peer, Democratically And Voluntarily Produced Thoughts About 'The Wealth Of Networks: How Social Production Transforms Markets And Freedom,' By Yochai Benkler, Ann Bartow Jan 2007

Some Peer-To-Peer, Democratically And Voluntarily Produced Thoughts About 'The Wealth Of Networks: How Social Production Transforms Markets And Freedom,' By Yochai Benkler, Ann Bartow

Law Faculty Scholarship

In this review essay, Bartow concludes that The Wealth of Networks: How Social Production Transforms Markets and Freedom by Yochai Benkler is a book well worth reading, but that Benkler still has a bit more work to do before his Grand Unifying Theory of Life, The Internet, and Everything is satisfactorily complete. It isn't enough to concede that the Internet won't benefit everyone. He needs to more thoroughly consider the ways in which the lives of poor people actually worsen when previously accessible information, goods and services are rendered less convenient or completely unattainable by their migration online. Additionally, the …

Go to article

The Common Body Of Knowledge: A Framework To Promote Relevant Information Security Research, Kenneth J. Knapp, F. N. Ford, Thomas E. Marshall, R. K. Rainer Jan 2007

The Common Body Of Knowledge: A Framework To Promote Relevant Information Security Research, Kenneth J. Knapp, F. N. Ford, Thomas E. Marshall, R. K. Rainer

Journal of Digital Forensics, Security and Law

This study proposes using an established common body of knowledge (CBK) as one means of organizing information security literature. Consistent with calls for more relevant information systems (IS) research, this industrydeveloped framework can motivate future research towards topics that are important to the security practitioner. In this review, forty-eight articles from ten IS journals from 1995 to 2004 are selected and cross-referenced to the ten domains of the information security CBK. Further, we distinguish articles as empirical research, frameworks, or tutorials. Generally, this study identified a need for additional empirical research in every CBK domain including topics related to legal …

Go to article

First Prev Next Last