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

Engineering Commons

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

Articles 1 - 3 of 3

Full-Text Articles in Engineering

Automated Generation Of Simulink Models For Enumeration Hybrid Automata, David Aaron Heise Aug 2013

Automated Generation Of Simulink Models For Enumeration Hybrid Automata, David Aaron Heise

Masters Theses

An enumeration hybrid automaton has been shown in principle to be ready for automated transformation into a Simulink implementation. This paper describes a strategy for and a demonstration of automated construction. This is accomplished by designing a data model which represents EHA data and providing a mapping from EHA data points to Simulink blocks.


Tor Bridge Distribution Powered By Threshold Rsa, Jordan Hunter Deyton May 2013

Tor Bridge Distribution Powered By Threshold Rsa, Jordan Hunter Deyton

Masters Theses

Since its inception, Tor has offered anonymity for internet users around the world. Tor now offers bridges to help users evade internet censorship, but the primary distribution schemes that provide bridges to users in need have come under attack. This thesis explores how threshold RSA can help strengthen Tor's infrastructure while also enabling more powerful bridge distribution schemes. We implement a basic threshold RSA signature system for the bridge authority and a reputation-based social network design for bridge distribution. Experimental results are obtained showing the possibility of quick responses to requests from honest users while maintaining both the secrecy and …


Programming Dense Linear Algebra Kernels On Vectorized Architectures, Jonathan Lawrence Peyton May 2013

Programming Dense Linear Algebra Kernels On Vectorized Architectures, Jonathan Lawrence Peyton

Masters Theses

The high performance computing (HPC) community is obsessed over the general matrix-matrix multiply (GEMM) routine. This obsession is not without reason. Most, if not all, Level 3 Basic Linear Algebra Subroutines (BLAS) can be written in terms of GEMM, and many of the higher level linear algebra solvers' (i.e., LU, Cholesky) performance depend on GEMM's performance. Getting high performance on GEMM is highly architecture dependent, and so for each new architecture that comes out, GEMM has to be programmed and tested to achieve maximal performance. Also, with emergent computer architectures featuring more vector-based and multi to many-core processors, GEMM performance …