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

Other Computer Engineering Commons

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

829 Full-Text Articles 1,165 Authors 458,142 Downloads 90 Institutions

All Articles in Other Computer Engineering

Faceted Search

829 full-text articles. Page 35 of 36.

Gpu Implementation Of A Novel Approach To Cramer’S Algorithm For Solving Large Scale Linear Systems, Rosanne Lane West 2010 University of Tennessee - Knoxville

Gpu Implementation Of A Novel Approach To Cramer’S Algorithm For Solving Large Scale Linear Systems, Rosanne Lane West

Masters Theses

Scientific computing often requires solving systems of linear equations. Most software pack- ages for solving large-scale linear systems use Gaussian elimination methods such as LU- decomposition. An alternative method, recently introduced by K. Habgood and I. Arel, involves an application of Cramer’s Rule and Chio’s condensation to achieve a better per- forming system for solving linear systems on parallel computing platforms. This thesis describes an implementation of this algorithm on an nVidia graphics processor card us- ing the CUDA language. Increased performance, relative to the serial implementation, is demonstrated, paving the way for future parallel realizations of the ...


A Novel Technique For Ctis Image-Reconstruction, Mitchel Dewayne Horton 2010 University of Tennessee, Knoxville

A Novel Technique For Ctis Image-Reconstruction, Mitchel Dewayne Horton

Doctoral Dissertations

Computed tomography imaging spectrometer (CTIS) technology is introduced and its use is discussed. An iterative method is presented for CTIS image-reconstruction in the presence of both photon noise in the image and post-detection Gaussian system noise. The new algorithm assumes the transfer matrix of the system has a particular structure. Error analysis, performance evaluation, and parallelization of the algorithm is done. Complexity analysis is performed for the proof of concept code developed. Future work is discussed relating to potential improvements to the algorithm.

An intuitive explanation for the success of the new algorithm is that it reformulates the image reconstruction ...


A Computer Vision Application To Accurately Estimate Object Distance, Kayton B. Parekh 2010 Macalester College

A Computer Vision Application To Accurately Estimate Object Distance, Kayton B. Parekh

Mathematics, Statistics, and Computer Science Honors Projects

Scientists have been working to create robots that perform manual work for years. However, creating machines that can navigate themselves and respond to their environment has proven to be difficult. One integral task to such research is to estimate the position of objects in the robot's visual field.

In this project we examine an implementation of computer vision depth perception. Our application uses color-based object tracking combined with model-based pose estimation to estimate the depth of specific objects in the view of our Pioneer 2 and Power Wheels robots. We use the Camshift algorithm for color-based object tracking, which ...


Detecting Mutually-Salient Landmark Pairs With Mrf Regularization, Yangming Ou, Ahmed Besbes, Michel Bilello, Mohamed Mansour, Christos Davatzikos, Nikos Paragios 2010 University of Pennsylvania

Detecting Mutually-Salient Landmark Pairs With Mrf Regularization, Yangming Ou, Ahmed Besbes, Michel Bilello, Mohamed Mansour, Christos Davatzikos, Nikos Paragios

Departmental Papers (BE)

In this paper, we present a framework for extracting mutually-salient landmark pairs for registration. Traditional methods detect landmarks one-by-one and separately in two images. Therefore, the detected landmarks might inherit low discriminability and are not necessarily good for matching. In contrast, our method detects landmarks pair-by-pair across images, and those pairs are required to be mutually-salient, i.e., uniquely corresponding to each other. The second merit of our framework is that, instead of finding individually optimal correspondence, which is a local approach and could cause self-intersection of the resultant deformation, our framework adopts a Markov-random-field (MRF)-based spatial arrangement to ...


Global Positioning Logger, Matthew Hall 2010 California Polytechnic State University - San Luis Obispo

Global Positioning Logger, Matthew Hall

Computer Engineering

The Global Positioning Logger (GPL) is a mobile embedded device that utilizes GPS technology. The GPS data is used to display current speed and past global locations.


Exploring The Relationship Of The Closeness Of A Genetic Algorithm’S Chromosome Encoding To Its Problem Space, Kevin McCullough 2010 California Polytechnic State University, San Luis Obispo

Exploring The Relationship Of The Closeness Of A Genetic Algorithm’S Chromosome Encoding To Its Problem Space, Kevin Mccullough

Master's Theses and Project Reports

For historical reasons, implementers of genetic algorithms often use a haploid binary primitive type for chromosome encoding. I will demonstrate that one can reduce development effort and achieve higher fitness by designing a genetic algorithm with an encoding scheme that closely matches the problem space. I will show that implicit parallelism does not result in binary encoded chromosomes obtaining higher fitness scores than other encodings. I will also show that Hamming distances should be understood as part of the relationship between the closeness of an encoding to the problem instead of assuming they should always be held constant. Closeness to ...


Controlling The Uncontrollable: A New Approach To Digital Storytelling Using Autonomous Virtual Actors And Environmental Manipulation, Matthew J. Colon 2010 California Polytechnic State University, San Luis Obispo

Controlling The Uncontrollable: A New Approach To Digital Storytelling Using Autonomous Virtual Actors And Environmental Manipulation, Matthew J. Colon

Master's Theses and Project Reports

In most video games today that focus on a single story, scripting languages are used for controlling the artificial intelligence of the virtual actors. While scripting is a great tool for reliably performing a story, it has many disadvantages; mainly, it is limited by only being able to respond to those situations that were explicitly declared, causing unreliable responses to unknown situations, and the believability of the virtual actor is hindered by possible conflicts between scripted actions and appropriate responses as perceived by the viewer. This paper presents a novel method of storytelling by manipulating the environment, whether physically or ...


A Graduate Education In Software Management And The Software Business For Mid-Career Professionals, Ray Bareiss, Gladys Mercier 2010 Carnegie Mellon University

A Graduate Education In Software Management And The Software Business For Mid-Career Professionals, Ray Bareiss, Gladys Mercier

Ray Bareiss

Given the unique nature of the software business, the faculty of Carnegie Mellon University’s Silicon Valley campus concluded that mid-career software professionals would be better served by a tailored master’s degree focusing on software management and more broadly on the business of software than by a typical MBA. Our software management master’s program integrates business, technical, and soft skills to prepare our students for technical leadership in their current companies or in entrepreneurial ventures. Our initial program built on the strengths of Carnegie Mellon’s world-class software engineering education. We targeted students working in large companies, engaged ...


Coaching Via Cognitive Apprenticeship, Ray Bareiss, Martin Radley 2010 Carnegie Mellon University

Coaching Via Cognitive Apprenticeship, Ray Bareiss, Martin Radley

Ray Bareiss

At Carnegie Mellon’s Silicon Valley campus we employ a learn by- doing educational approach in which nearly all student learning, and thus instruction, is in the context of realistic, team based projects. Consequently, we have adopted coaching as our predominant teaching model. In this paper we reflect on our experience with the nature of teaching by coaching using a framework derived from Cognitive Apprenticeship, and explain how we employ the techniques it suggests in our teaching. We also discuss a range of instructional tensions that arise in teaching by coaching and present a survey of student attitudes regarding the ...


An Mpi-Cuda Implementation For Massively Parallel Incompressible Flow Computations On Multi-Gpu Clusters, Dana A. Jacobsen, Julien C. Thibault, Inanc Senocak 2010 Boise State University

An Mpi-Cuda Implementation For Massively Parallel Incompressible Flow Computations On Multi-Gpu Clusters, Dana A. Jacobsen, Julien C. Thibault, Inanc Senocak

Inanc Senocak

Modern graphics processing units (GPUs) with many-core architectures have emerged as general-purpose parallel computing platforms that can accelerate simulation science applications tremendously. While multi-GPU workstations with several TeraFLOPS of peak computing power are available to accelerate computational problems, larger problems require even more resources. Conventional clusters of central processing units (CPU) are now being augmented with multiple GPUs in each compute-node to tackle large problems. The heterogeneous architecture of a multi-GPU cluster with a deep memory hierarchy creates unique challenges in developing scalable and efficient simulation codes. In this study, we pursue mixed MPI-CUDA implementations and investigate three strategies to ...


On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan 2010 Chapman University

On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan

Engineering Faculty Articles and Research

We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.


Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari 2010 Institute for Logic, Language and Computation - Amsterdam

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


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

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.


On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz 2010 University Politehnica of Bucharest

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.


Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz 2010 New Mexico State University

Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz

Engineering Faculty Articles and Research

We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for ...


Evaluating A New Mac For Current And Next Generation Rfid, Serge Zhilyaev 2010 University of Massachusetts Amherst

Evaluating A New Mac For Current And Next Generation Rfid, Serge Zhilyaev

Masters Theses 1911 - February 2014

We evaluate SQUASH, a new MAC for RFID, in hardware and software. A smaller hardware design for SQUASH is proposed which also reduces latency. Area and latency in hardware are reduced further with a new variant we call permuted SQUASH. We explore SQUASH on embedded microprocessors and propose a method to choose the optimal partial product ordering to reduce latency.


Wi-Fi Localization Using Rssi Fingerprinting, Michael Quan, Eduardo Navarro, Benjamin Peuker 2010 California Polytechnic State University - San Luis Obispo

Wi-Fi Localization Using Rssi Fingerprinting, Michael Quan, Eduardo Navarro, Benjamin Peuker

Computer Engineering

Wireless Local Area Networks using Wi-Fi is becoming more and more ubiquitous. As such, they provide a potential pre-built infrastructure for small area localization. This project serves as a proof of concept for a playground child tracking system to be deployed at Cal Poly's Child Development Playground Lab. The two main options for doing Wi-Fi localization are triangulation and fingerprinting. Triangulation involves mapping signal strength as a function of distance while fingerprinting creates a probability distribution of signal strengths at a given location and uses a map of these distributions to predict a location given signal strength samples. The ...


Forty Years Of Movie Hacking: Considering The Potential Implications Of The Popular Media Representation Of Computer Hackers From 1968 To 2008, Damian Gordon 2010 Technological University Dublin

Forty Years Of Movie Hacking: Considering The Potential Implications Of The Popular Media Representation Of Computer Hackers From 1968 To 2008, Damian Gordon

Articles

Increasingly movies are being produced which feature plots that incorporate elements of computer security and hacking, and cumulatively these movies are creating a public perception as to the nature of computer security. This research examines movies that feature hackers (and hacking) to identify if any common themes emerge from these movies in their representation of these issues. To achieve this, first a corpus of hacking movies is created, and then using a qualitative data analysis technique, guidelines are developed which distinguish those movies that actually have the potential to create a perception with the general public. The resultant dataset is ...


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

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


An Mpi-Cuda Implementation For Massively Parallel Incompressible Flow Computations On Multi-Gpu Clusters, Dana A. Jacobsen, Julien C. Thibault, Inanc Senocak 2010 Boise State University

An Mpi-Cuda Implementation For Massively Parallel Incompressible Flow Computations On Multi-Gpu Clusters, Dana A. Jacobsen, Julien C. Thibault, Inanc Senocak

Mechanical and Biomedical Engineering Faculty Publications and Presentations

Modern graphics processing units (GPUs) with many-core architectures have emerged as general-purpose parallel computing platforms that can accelerate simulation science applications tremendously. While multi-GPU workstations with several TeraFLOPS of peak computing power are available to accelerate computational problems, larger problems require even more resources. Conventional clusters of central processing units (CPU) are now being augmented with multiple GPUs in each compute-node to tackle large problems. The heterogeneous architecture of a multi-GPU cluster with a deep memory hierarchy creates unique challenges in developing scalable and efficient simulation codes. In this study, we pursue mixed MPI-CUDA implementations and investigate three strategies to ...


Digital Commons powered by bepress