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

Computer Engineering Commons™

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

Physical Sciences and Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 10861 - 10890 of 13562

Full-Text Articles in Computer Engineering

Generating System Requirements For A Mobile Digital Evidence Collection System: A Preliminary Step Towards Enhancing The Forensic Collection Of Digital Devices, Ibrahim Baggili Jan 2010

Generating System Requirements For A Mobile Digital Evidence Collection System: A Preliminary Step Towards Enhancing The Forensic Collection Of Digital Devices, Ibrahim Baggili

Electrical & Computer Engineering and Computer Science Faculty Publications

Collecting digital devices in a forensically sound manner is becoming more critical since 80% of all cases have some sort of digital evidence involved in them (Rogers, 2006, p. 1) .The process of documenting and tagging digital devices is cumbersome and involves details that might not apply to other types of evidence, since each evidence item has unique physical characteristics (Hesitis & Wilbon, 2005, p. 17). The process becomes less manageable when a large number of digital devices are seized. This paper examines the information and issues investigators should be aware of when collecting digital devices at crime scenes. Furthermore, …

Go to article

Higate (High Grade Anti-Tamper Equipment) Prototype And Application To E-Discovery, Yui Sakurai, Yuki Ashino, Tetsutaro Uehara, Hiroshi Yoshiura, Ryoichi Sasaki Jan 2010

Higate (High Grade Anti-Tamper Equipment) Prototype And Application To E-Discovery, Yui Sakurai, Yuki Ashino, Tetsutaro Uehara, Hiroshi Yoshiura, Ryoichi Sasaki

Journal of Digital Forensics, Security and Law

These days, most data is digitized and processed in various ways by computers. In the past, computer owners were free to process data as desired and to observe the inputted data as well as the interim results. However, the unrestricted processing of data and accessing of interim results even by computer users is associated with an increasing number of adverse events. These adverse events often occur when sensitive data such as personal or confidential business information must be handled by two or more parties, such as in the case of e-Discovery, used in legal proceedings, or epidemiologic studies. To solve …

Go to article

State Variable Distributed-Parameter Representation Of Transmission Line For Transient Simulations, Mehmet Sali̇h Mami̇ş, Asim Kaygusuz, Muhammet Köksal Jan 2010

State Variable Distributed-Parameter Representation Of Transmission Line For Transient Simulations, Mehmet Sali̇h Mami̇ş, Asim Kaygusuz, Muhammet Köksal

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, a distributed-parameter state variable approach is used to calculate transients on transmission lines based on the concept of travelling waves. The method of characteristics for lossless line is used and the state equations are derived for the system. These equations are converted to a set of difference equations using the trapezoidal rule of integration and solved in time domain using LU decomposition. Single- and multi-phase transmission lines with various linear and non-linear terminations are considered in the illustrative examples. State-space modeling of transposed lines using modal decomposition is introduced and the effects caused by lumped parameter approximation …

Go to article

On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz Jan 2010

On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz

Engineering Faculty Articles and Research

We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.

Go to article

Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari Jan 2010

Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari

Engineering Faculty Articles and Research

Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …

Go to article

Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil Jan 2010

Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.

Go to article

Authentication Of Biometric Features Using Texture Coding For Id Cards, Jonathan Blackledge, Eugene Coyle Jan 2010

Authentication Of Biometric Features Using Texture Coding For Id Cards, Jonathan Blackledge, Eugene Coyle

Conference papers

The use of image based information exchange has grown rapidly over the years in terms of both e-to-e image storage and transmission and in terms of maintaining paper documents in electronic form. Further, with the dramatic improvements in the quality of COTS (Commercial-Off-The-Shelf) printing and scanning devices, the ability to counterfeit electronic and printed documents has become a widespread problem. Consequently, there has been an increasing demand to develop digital watermarking techniques which can be applied to both electronic and printed images (and documents) that can be authenticated, prevent unauthorized copying of their content and, in the case of printed …

Go to article

An Approach Based On Particle Swarm Computation To Study The Nanoscale Dg Mosfet-Based Circuits, Fayacl Djeffal, Toufik Bendib, Redha Benzid, Abdelhamid Benhaya Jan 2010

An Approach Based On Particle Swarm Computation To Study The Nanoscale Dg Mosfet-Based Circuits, Fayacl Djeffal, Toufik Bendib, Redha Benzid, Abdelhamid Benhaya

Turkish Journal of Electrical Engineering and Computer Sciences

The analytical modeling of nanoscale Double-Gate MOSFETs (DG) requires generally several necessary simplifying assumptions to lead to compact expressions of current-voltage characteristics for nanoscale CMOS circuits design. Further, progress in the development, design and optimization of nanoscale devices necessarily require new theory and modeling tools in order to improve the accuracy and the computational time of circuits' simulators. In this paper, we propose a new particle swarm strategy to study the nanoscale CMOS circuits. The latter is based on the 2-D numerical Non-Equilibrium Green's Function (NEGF) simulation and a new extended long channel DG MOSFET compact model. Good agreement between …

Go to article

Asynchronous Particle Swarm Optimization-Based Search With A Multi-Robot System: Simulation And Implementation On A Real Robotic System, Sali̇h Burak Akat, Veysel Gazi̇, Lino Marques Jan 2010

Asynchronous Particle Swarm Optimization-Based Search With A Multi-Robot System: Simulation And Implementation On A Real Robotic System, Sali̇h Burak Akat, Veysel Gazi̇, Lino Marques

Turkish Journal of Electrical Engineering and Computer Sciences

In this article we consider a version of the Particle Swarm Optimization (PSO) algorithm which is appropriate for search tasks of multi-agent systems consisting of small robots with limited sensing capability. The proposed method adopts asynchronous mechanism for information exchange and position (way point) updates of the agents. Moreover, at each (information exchange) step the agents communicate with only a possibly different subset of the other agents leading to a dynamic neighborhood topology. We implement the algorithm using the Player/Stage realistic robot simulator as well as on real KheperaIII robots using experimentally collected realistic data of ethanol gas concentration. Simulation …

Go to article

Split And Merge Functions For Supporting Multiple Processing Pipelines In Mercury Blastn, Jwalant Ahir, Jeremy Buhler, Roger D. Chamberlain Jan 2010

Split And Merge Functions For Supporting Multiple Processing Pipelines In Mercury Blastn, Jwalant Ahir, Jeremy Buhler, Roger D. Chamberlain

All Computer Science and Engineering Research

Biosequence similarity search is an important application in computational biology. Mercury BLASTN, an FPGA-based implementation of BLAST for DNA, is one of the alternatives for fast DNA sequence comparison. The re-design of BLAST into a streaming application combined with a high-throughput hardware pipeline have enabled Mercury BLAST to emerge as one of the fastest implementations of bio-sequence similarity search. This performance can be further enhanced by exploiting the data-level parallelism present within the application. Here we present a multiple FPGA-based Mercury BLASTN design in order to double the speed and throughput of DNA sequence computation. This paper describes a dual …

Go to article

Optimal Time Utility Based Scheduling Policy Design For Cyber-Physical Systems , Terry Tidwell, Robert Glaubius, Christopher D. Gill, William D. Smart Jan 2010

Optimal Time Utility Based Scheduling Policy Design For Cyber-Physical Systems , Terry Tidwell, Robert Glaubius, Christopher D. Gill, William D. Smart

All Computer Science and Engineering Research

Classical scheduling abstractions such as deadlines and priorities do not readily capture the complex timing semantics found in many real-time cyber-physical systems. Time utility functions provide a necessarily richer description of timing semantics, but designing utility-aware scheduling policies using them is an open research problem. In particular, optimal utility accrual scheduling design is needed for real-time cyber-physical domains. In this paper we design optimal utility accrual scheduling policies for cyber-physical systems with periodic, non-preemptable tasks that run with stochastic duration. These policies are derived by solving a Markov Decision Process formulation of the scheduling problem. We use this formulation to …

Go to article

Global Constructive Optimization Of Vascular Systems, Manfred Georg, Tobias Preusser, Horst K. Hahn Jan 2010

Global Constructive Optimization Of Vascular Systems, Manfred Georg, Tobias Preusser, Horst K. Hahn

All Computer Science and Engineering Research

We present a framework for the construction of vascular systems based on optimality principles of theoretical physiology. Given the position and flow distribution of end points of a vascular system, we construct the topology and positions of internal nodes to complete the vascular system in a realistic manner. Optimization is driven by intravascular volume minimization with constraints derived from physiological principles. Direct optimization of a vascular system, including topological changes, is used instead of simulating vessel growth. A good initial topology is found by extracting key information from a previously optimized model with less detail. This technique is used iteratively …

Go to article

Arch: Practical Channel Hopping For Reliable Home-Area Sensor Networks, Mo Sha, Gregory Hackmann, Chenyang Lu Jan 2010

Arch: Practical Channel Hopping For Reliable Home-Area Sensor Networks, Mo Sha, Gregory Hackmann, Chenyang Lu

All Computer Science and Engineering Research

Home area networks (HANs) promise to enable sophisticated home automation applications such as smart energy usage and assisted living. However, recent empirical study of HAN reliability in real-world residential environments revealed significant challenges to achieving reliable performance in the face of significant and variable interference from a multitude of coexisting wireless devices. We propose the Adaptive and Robust Channel Hopping (ARCH) protocol: a lightweight receiveroriented protocol which handles the dynamics of residential environments by reactively channel hopping when channel conditions have degraded. ARCH has several key features. First, ARCH is an adaptive protocol that channel-hops based on changes in channel …

Go to article

Sorting As A Streaming Application Executing On Chip Multiprocessors, Roger D. Chamberlain, Greg A. Galloway, Mark A. Franklin Jan 2010

Sorting As A Streaming Application Executing On Chip Multiprocessors, Roger D. Chamberlain, Greg A. Galloway, Mark A. Franklin

All Computer Science and Engineering Research

Expressing concurrency in applications has always been a difficult and error-prone endeavor, yet effective utilization of multi-core processors requires that the concurrency in applications be understood. One approach to the expression of concurrency is streaming, which has shown real promise as a safe and effective method for many application classes. Here, we express a classic problem, sorting, in the streaming paradigm and explore the implications of various algorithm and architectural design parameters on the performance of the application.

Go to article

Toward A Two-Tier Clinical Warning System For Hospitalized Patients, Gregory Hackmann, Minmin Chen, Octav Chipara, Chenyang Lu, Yixin Chen, Marin Kollef, Thomas C. Bailey Jan 2010

Toward A Two-Tier Clinical Warning System For Hospitalized Patients, Gregory Hackmann, Minmin Chen, Octav Chipara, Chenyang Lu, Yixin Chen, Marin Kollef, Thomas C. Bailey

All Computer Science and Engineering Research

Clinical study has found early detection and intervention to be essential for preventing clinical deterioration in patients at general hospital units. In this paper, we envision a two-tiered early warning system designed to identify the signs of clinical deterioration and provide early warning of serious clinical events. The first tier of the system automatically identifies patients at risk of clinical deterioration from existing electronic medical record databases. The second tier performs real-time clinical event detection based on real-time vital sign data collected from on-body wireless sensors attached to those high-risk patients. We employ machine-learning techniques to analyze data from both …

Go to article

An Inexpensive Robot Platform For Teleoperation And Experimentation, Daniel A. Lazewatsky, William D. Smart Jan 2010

An Inexpensive Robot Platform For Teleoperation And Experimentation, Daniel A. Lazewatsky, William D. Smart

All Computer Science and Engineering Research

Most commercially-available robots are either aimed at the research community, or are designed with a single purpose in mind. The extensive hobbyist community has tended to focus on the hardware and the low-level software aspects. We claim that there is a need for a low-cost, general-purpose robot, accessible to the hobbyist community, with sufficient computation and sensing to run ``research-grade'' software. In this paper, we describe the design and implementation of such a robot. We explicitly outline our design goals, and show how a capable robot can be assembled from off-the-shelf parts, for a modest cost, by a single person …

Go to article

Transmitter Optimization In Multiuser Wireless Systems With Quality Of Service Constraints, Danda B. Rawat Jan 2010

Transmitter Optimization In Multiuser Wireless Systems With Quality Of Service Constraints, Danda B. Rawat

Electrical & Computer Engineering Theses & Dissertations

In this dissertation, transmitter adaptation for optimal resource allocation in wireless communication systems are investigated. First, a multiple access channel model is considered where many transmitters communicate with a single receiver. This scenario is a basic component of a. wireless network in which multiple users simultaneously access the resources of a wireless service provider. Adaptive algorithms for transmitter optimization to meet Quality-of-Service (QoS) requirements in a distributed manner are studied. Second, an interference channel model is considered where multiple interfering transmitter-receiver pairs co-exist such that a given transmitter communicates with its intended receiver in the presence of interference from other …

Go to article

Performance Tuning Of Streaming Applications Via Search-Space Decomposition, Shobana Padmanabhan, Roger D. Chamberlain, Yixin Chen Jan 2010

Performance Tuning Of Streaming Applications Via Search-Space Decomposition, Shobana Padmanabhan, Roger D. Chamberlain, Yixin Chen

All Computer Science and Engineering Research

High-performance streaming applications are typically pipelined and deployed on architecturally diverse (hybrid)systems. Developers of such applications are interested in customizing components used, so as to benefit application performance. We present an efficient and automatic technique for design-space exploration of applications in this problem domain. We solve performance tuning as an optimization problem by formulating cost functions using results from queueing theory. This results in a mixed-integer nonlinear optimization problem which is NP-hard. We reduce the search complexity by decomposing the search space. We have developed a domain-specific decomposition technique using topological information of the application embodied in the queueing network …

Go to article

Cloud Computing For Scalable Planning By Stochastic Search, Qiang Lu, You Xu, Ruoyun Huang, Yixin Chen Jan 2010

Cloud Computing For Scalable Planning By Stochastic Search, Qiang Lu, You Xu, Ruoyun Huang, Yixin Chen

All Computer Science and Engineering Research

Graph search has been employed by many AI techniques and applications. A natural way to improve the efficiency of search is to utilize ad- vanced, more powerful computing platforms. However, expensive computing infrastructures, such as supercomputers and large-scale clusters, are traditionally available to only a limited number of projects and researchers. As a results, most AI applications, with access to only commodity com- puters and clusters, cannot benefit from the efficiency improvements of high-performance parallel search algorithms. Cloud computing provides an attractive, highly accessible alternative to other traditional high- performance computing platforms. In this paper, we first show that the …

Go to article

Multi-Channel Reliability And Spectrum Usage In Real Homes: Empirical Studies For Home-Area Sensor Networks, Mo Sha, Gregory Hackmann, Chenyang Lu Jan 2010

Multi-Channel Reliability And Spectrum Usage In Real Homes: Empirical Studies For Home-Area Sensor Networks, Mo Sha, Gregory Hackmann, Chenyang Lu

All Computer Science and Engineering Research

Home area networks (HANs) consisting of wireless sensors have emerged as the enabling technology for important applications such as smart energy and assisted living. A key challenge faced by HANs is maintaining reliable operation in real-world residential environments. This paper presents two in-depth empirical studies on the wireless channels in real homes. The spectrum study analyzes the spectrum usage in the 2.4 GHz band where wireless sensor networks based on the IEEE 802.15.4 standard must coexist with existing wireless devices. We characterize the ambient wireless environment in six apartments through passive spectrum analysis across the entire 2.4 GHz band over …

Go to article

End-To-End Delay Analysis For Fixed Priority Scheduling In Wirelesshart Networks, Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen Jan 2010

End-To-End Delay Analysis For Fixed Priority Scheduling In Wirelesshart Networks, Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen

All Computer Science and Engineering Research

The WirelessHART standard has been specifically designed for real-time communication between sensor and actuator devices for industrial process monitoring and control. End-to-end communication delay analysis for WirelessHART networks is required for acceptance test of real-time data flows from sensors to actuators and for workload adjustment in response to network dynamics. In this paper, we map the scheduling of real-time periodic data flows in a WirelessHART network to real-time multiprocessor scheduling. We, then, exploit the response time analysis for multiprocessor scheduling and propose a novel method for the end-to-end delay analysis of the real-time flows that are scheduled using a fixed …

Go to article

The Design And Implementation Of Mcflow: A Real-Time Multi-Core Aware Middleware For Dependent Task Graphs, Huang-Ming Huang, Christopher Gill, Chenyang Lu Jan 2010

The Design And Implementation Of Mcflow: A Real-Time Multi-Core Aware Middleware For Dependent Task Graphs, Huang-Ming Huang, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

Modern computer architectures have evolved from uni-processor platforms to multi-processor and multi-core plat- forms, but traditional real-time distributed middleware such as RT-CORBA has not kept pace with that evolution. To address those issues, this paper describes the design and implementation of MCFlow, a new real-time distributed middleware for dependent task graphs running on multi-core platforms. MCFlow provides the following contributions to the state of the art in real-time middleware: (1) it provides an efficient C++ based component model through which computations can be configured flexibly for execution within a single core, across cores of a common host, or spanning multiple …

Go to article

Priority Assignment For Real-Time Flows In Wirelesshart Sensor-Actuator Networks, Abusayeed Saifullah, You Chenyang, Yixin Chen Jan 2010

Priority Assignment For Real-Time Flows In Wirelesshart Sensor-Actuator Networks, Abusayeed Saifullah, You Chenyang, Yixin Chen

All Computer Science and Engineering Research

Recent years have witnessed the adoption of wireless sensor-actuator networks as a communication infrastructure for process control applications. An important enabling technology for industrial process control is WirelessHART, an open wireless sensor-actuator network standard specifically developed for process industries. A key challenge faced byWirelessHART networks is to meet the stringent real-time communication requirements imposed by feedback control systems in process industries. Fixed priority scheduling, a popular scheduling policy in real-time networks, has recently been shown to be an effective real-time transmission scheduling policy in WirelessHART networks. Priority assignment has a major impact on the schedulability of real-time flows in these …

Go to article

Cs 400-01: Data Structures And Software Design, Meilin Liu Jan 2010

Cs 400-01: Data Structures And Software Design, Meilin Liu

Computer Science & Engineering Syllabi

This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.

Go to article

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

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

Computer Science & Engineering Syllabi

The CS 241 course is a continuation of CS 240. The emphasis in CS 241 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.

Go to article

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

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.

Go to article

Cs 790-01: Knowledge Representation For The Semantic Web, Pascal Hitzler Jan 2010

Cs 790-01: Knowledge Representation For The Semantic Web, Pascal Hitzler

Computer Science & Engineering Syllabi

Semantic Web is a maturing field of technology that continues to be the emphasis of much focused research and industrial investigation. The central idea behind Semantic Web is to enhance data on the World Wide Web by so-called metadata, which describes the meaning (semantics) of the data and thus makes it available for processing in intelligent systems. In this course we cover in depth the standardized knowledge representation languages for expressing metadata, called ontology languages. We will in particular cover the Resource Description Framework RDF and the Web Ontology Language OWL, both of which are recommended standards by the World …

Go to article

Cs 240: Computer Programming I, Vanessa Starkey Jan 2010

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.

Go to article

Cs 241-01: Computer Programming Ii, Travis E. Doom Jan 2010

Cs 241-01: Computer Programming Ii, Travis E. Doom

Computer Science & Engineering Syllabi

A continuation of CS240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.

Go to article

Cs 400/600-01: Data Structures And Software Design, Guozhu Dong Jan 2010

Cs 400/600-01: Data Structures And Software Design, Guozhu Dong

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

First Prev Next Last