A Graduate Education In Software Management And The Software Business For Mid-Career Professionals,
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 in large-scale enterprise software …
Coaching Via Cognitive Apprenticeship,
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 effectiveness …
An Mpi-Cuda Implementation For Massively Parallel Incompressible Flow Computations On Multi-Gpu Clusters,
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 …
Evaluating A New Mac For Current And Next Generation Rfid,
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,
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 triangulation …
An Mpi-Cuda Implementation For Massively Parallel Incompressible Flow Computations On Multi-Gpu Clusters,
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 …
Authentication Of Biometric Features Using Texture Coding For Id Cards,
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 Empirical Evaluation Of The Effectiveness Of Jml Assertions As Test Oracles,
2010
University of Denver
An Empirical Evaluation Of The Effectiveness Of Jml Assertions As Test Oracles, Kavir Shrestha
Electronic Theses and Dissertations
Test oracles remain one of the least understood aspects of the modern testing process. An oracle is a mechanism used by software testers and software engineers for determining whether a test has passed or failed. One widely-supported approach to oracles is the use of runtime assertion checking during the testing activity. Method invariants,pre- and postconditions help detect bugs during runtime. While assertions are supported by virtually all programming environments, are used widely in practice, and are often assumed to be effective as test oracles, there are few empirical studies of their efficacy in this role. In this thesis, we present …
A Machine Learning Approach To Hierarchical Categorisation Of Auditory Objects,
2010
Technological University Dublin
A Machine Learning Approach To Hierarchical Categorisation Of Auditory Objects, William Coleman, Sarah Jane Delany, Charlie Cullen, Ming Yan Dr.
Articles
With the advent of new audio delivery technologies comes opportunities and challenges for content creators and providers. The proliferation of consumption modes (stereo headphones, home cinema systems, ‘hearables’), media formats (mp3, CD, video and audio streaming) and content types (gaming, music, drama & current affairs broadcasting) has given rise to a complicated landscape where content must often be adapted for multiple end-use scenarios. The concept of object-based audio envisages content delivery not via a fixed mix but as a series of auditory objects which can then be controlled either by consumers or by content creators & providers via accompanying metadata. …
Using Virtual Reality To Enhance Electrical Safety And Design In The Built Environment,
2010
Technological University Dublin
Using Virtual Reality To Enhance Electrical Safety And Design In The Built Environment, Martin Barrett, Jonathan Blackledge, Eugene Coyle
Articles
Electricity and the inherent risks associated with its use in the built environment have long since been a priority for the electrical services industry and also the general public who must live and work in this environment. By its nature virtual reality has the advantage of being safe for both the user and equipment. In addition, it offers the user an opportunity to be exposed to a range of scenarios and conditions that either occur infrequently or are hazardous to replicate. This paper presents a prototype desktop virtual reality model, to enhance electrical safety and design in the built environment. …
Bitopological Duality For Distributive Lattices And Heyting Algebras,
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 the study …
On Coalgebras Over Algebras,
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.
On Universal Algebra Over Nominal Sets,
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,
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 good …
Algebraic Theories Over Nominal Sets,
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.
Super Special Codes Using Super Matrices,
2010
University of New Mexico
Super Special Codes Using Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes. This book has four chapters. In chapter one basic properties of codes and super matrices are given. A new type of super special vector space is constructed in chapter two of this book. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced in chapter three. Applications of these …
Forty Years Of Movie Hacking: Considering The Potential Implications Of The Popular Media Representation Of Computer Hackers From 1968 To 2008,
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 …
