Computer Engineering Commons^™

Digital Watermarking Security, Jonathan Blake, Shahram Latifi

Electrical & Computer Engineering Faculty Research

As creative works (e.g. books, films, music, photographs) become increasingly available in digital formats in a highly connected world, it also becomes increasingly difficult to secure intellectual property rights. Digital watermarking is one potential technology to aid intellectual property owners in controlling and tracking the use of their works. Surveys the state of digital watermarking research and examines the attacks that the technology faces and how it fares against them. Digital watermarking is an inherently difficult design problem subject to many constraints. The technology currently faces an uphill battle to be secure against relatively simple attacks.

Reconfigurable Systems: A Potential Solution To The Von Neumann Bottleneck, Damian L. Miller

Senior Honors Theses

The difficulty of overcoming the disparity between processor speeds and data access speeds, a condition known as the von Neumann bottleneck, has been a source of consternation for computer hardware developers for many years. Although a number of temporary solutions have been proposed and implemented in modern machines, these solutions have only managed to treat the major symptoms, rather than solve the root problem. As the number of transistors on a chip roughly doubles every two years, the von Neumann bottleneck has continued to tighten in spite of these solutions, prompting some computer hardware professionals to advocate a paradigm shift …

Gpu-Based Global Illumination Using Lightcuts, Tong Zhang

Department of Computer Graphics Technology Degree Theses

Global Illumination aims to generate high quality images. But due to its high
requirements, it is usually quite slow. Research documented in this thesis was
intended to offer a hardware and software combined acceleration solution to
global illumination. The GPU (using CUDA) was the hardware part of the whole
method that applied parallelism to increase performance; the “Lightcuts”
algorithm proposed by Walter (2005) at SIGGRAPH 2005 acted as the software
method. As the results demonstrated in this thesis, this combined method offers
a satisfactory performance boost effect for relatively complex scenes.

Polygonal Spatial Clustering, Deepti Joshi

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Clustering, the process of grouping together similar objects, is a fundamental task in data mining to help perform knowledge discovery in large datasets. With the growing number of sensor networks, geospatial satellites, global positioning devices, and human networks tremendous amounts of spatio-temporal data that measure the state of the planet Earth are being collected every day. This large amount of spatio-temporal data has increased the need for efficient spatial data mining techniques. Furthermore, most of the anthropogenic objects in space are represented using polygons, for example – counties, census tracts, and watersheds. Therefore, it is important to develop data mining …

Leveraging Multi-Radio Communication For Mobile Wireless Sensor Networks, Jeremy J. Gummeson

Masters Theses 1911 - February 2014

An important challenge in mobile sensor networks is to enable energy-efficient communication over a diversity of distances while being robust to wireless effects caused by node mobility. In this thesis, we argue that the pairing of two complementary radios with heterogeneous range characteristics enables greater range and interference diversity at lower energy cost than a single radio. We make three contributions towards the design of such multi-radio mobile sensor systems. First, we present the design of a novel reinforcement learning-based link layer algorithm that continually learns channel characteristics and dynamically decides when to switch between radios. Second, we describe a …

Obtaining Speech Assets For Judgement Analysis On Low-Pass Filtered Emotional Speech, John Snel, Charlie Cullen

Conference papers

Investigating the emotional content in speech from acoustic characteristics requires separating the semantic con- tent from the acoustic channel. For natural emotional speech, a widely used method to separate the two channels is the use of cue masking. Our objective is to investigate the use of cue masking in non-acted emotional speech by analyzing the extent to which filtering impacts the perception of emotional content of the modified speech material. However, obtaining a corpus of emotional speech can be quite difficult whereby verifying the emotional content is an issue thoroughly discussed. Currently, speech research is showing a tendency toward constructing …

Using Smartphones For Indoor Navigation, Benjamin Thomas Loulier

Purdue Polytechnic Masters Theses

This directed projet is about the use of smartphones for indoor navigation.

Nowadays, indoor navigation is a real challenge, we are all familiar with the multiple applications of GPS based navigation but all these applications cannot be transfered in an indoor environment as we cannot receive a GPS signal inside.

The document is composed of three different parts related to indoor navigation using smartphones. The first part presents an inertial positioning system for pedestrians walking in an indoor environment, this system is implemented on an iPhone 4. In the second part we introduce a positioning system using RFID tags scattered …

Relation Liftings On Preorders And Posets, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss’s coalgebraic over posets.

Generic Trace Logics, Christian Kissig, Alexander Kurz

Engineering Faculty Articles and Research

We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova.

Towards Nominal Formal Languages, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto

Engineering Faculty Articles and Research

We introduce formal languages over infinite alphabets where words may contain binders.We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.

Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Florentin Smarandache, Jean Dezert, Xinde Li, Xinhan Huang

Branch Mathematics and Statistics Faculty and Staff Publications

This paper presents a new method for reducing the number of sources of evidence to combine in order to reduce the complexity of the fusion processing. Such a complexity reduction is often required in many applications where the real-time constraint and limited computing resources are of prime importance. The basic idea consists in selecting, among all sources available, only a subset of sources of evidence to combine. The selection is based on an evidence supporting measure of similarity (ESMS) criterion which is an efficient generic tool for outlier sources identification and rejection. The ESMS between two sources of evidence can …

Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Xinde Li, Jean Dezert, Florentin Smarandache, Xinhan Huang

Branch Mathematics and Statistics Faculty and Staff Publications

This paper proposes a new solution for reducing the number of sources of evidence to be combined in order to diminish the complexity of the fusion process required in some applications where the real-time constraint and strong computing resource limitation are of prime importance. The basic idea consists in selecting, among the whole set of sources of evidence, only the biggest subset of sources which are not too contradicting based on a criterion of Evidence Supporting Measure of Similarity (ESMS) in order to process solely the coherent information received. The ESMS criterion serves actually as a generic tool for outlier …

A New Approach To Algebraic Coding Theory Through The Applications Of Soft Sets, Florentin Smarandache, Mumtaz Ali

Branch Mathematics and Statistics Faculty and Staff Publications

Algebraic codes play a signifcant role in the minimisation of data corruption which caused by defects such as inference, noise channel, crosstalk, and packet loss. In this paper, we introduce soft codes (soft linear codes) through the application of soft sets which is an approximated collection of codes. We also discuss several types of soft codes such as type-1 soft codes, complete soft codes etc. Further, we construct the soft generator matrix and soft parity check matrix for the soft linear codes. Moreover, we develop two techniques for the decoding of soft codes.