Computer Engineering Commons^™

Identifying A Computer Forensics Expert: A Study To Measure The Characteristics Of Forensic Computer Examiners, Gregory H. Carlton, Reginald Worthley

Journal of Digital Forensics, Security and Law

The usage of digital evidence from electronic devices has been rapidly expanding within litigation, and along with this increased usage, the reliance upon forensic computer examiners to acquire, analyze, and report upon this evidence is also rapidly growing. This growing demand for forensic computer examiners raises questions concerning the selection of individuals qualified to perform this work. While courts have mechanisms for qualifying witnesses that provide testimony based on scientific data, such as digital data, the qualifying criteria covers a wide variety of characteristics including, education, experience, training, professional certifications, or other special skills. In this study, we compare task …

On The Applications Of Deterministic Chaos For Encrypting Data On The Cloud, Jonathan Blackledge, Nikolai Ptitsyn

Conference papers

Cloud computing is expected to grow considerably in the future because it has so many advantages with regard to sale and cost, change management, next generation architectures, choice and agility. However, one of the principal concerns for users of the Cloud is lack of control and above all, data security. This paper considers an approach to encrypting information before it is ‘place’ on the Cloud where each user has access to their own encryption algorithm, an algorithm that is based on a set of Iterative Function Systems that outputs a chaotic number stream, designed to produce a cryptographically secure cipher. …

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, …

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 …

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

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

Adaptive Resource Allocation For Cognitive Wireless Ad Hoc Networks, Behdis Eslamnour

Doctoral Dissertations

"Widespread use of resource constrained wireless ad hoc networks requires careful management of the network resources in order to maximize the utilization. In cognitive wireless networks, resources such as spectrum, energy, communication links/paths, time, space, modulation scheme, have to be managed to maintain quality of service (QoS). Therefore in the first paper, a distributed dynamic channel allocation scheme is proposed for multi-channel wireless ad hoc networks with single-radio nodes. The proposed learning scheme adapts the probabilities of selecting each channel as a function of the error in the performance index at each step.

Due to frequent changes in topology and …

Computational Thinking Across The Curriculum: A Conceptual Framework, Amber Settle, Ljubomir Perkovic

Technical Reports

We describe a framework for implementing computational thinking in a broad variety of general education courses. The framework is designed to be used by faculty without formal training in information technology in order to understand and integrate computational thinking into their own general education courses. The framework includes examples of computational thinking in a variety of general education courses, as well as sample in-class activities, assignments, and other assessments for the courses. The examples in the different courses are related and differentiated using categories taken from Peter Denning’s Great Principles of Computing, so that similar types of computational thinking appearing …

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 …

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.

Computer Forensics For Graduate Accountants: A Motivational Curriculum Design Approach, Grover S. Kearns

Journal of Digital Forensics, Security and Law

Computer forensics involves the investigation of digital sources to acquire evidence that can be used in a court of law. It can also be used to identify and respond to threats to hosts and systems. Accountants use computer forensics to investigate computer crime or misuse, theft of trade secrets, theft of or destruction of intellectual property, and fraud. Education of accountants to use forensic tools is a goal of the AICPA (American Institute of Certified Public Accountants). Accounting students, however, may not view information technology as vital to their career paths and need motivation to acquire forensic knowledge and skills. …

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.

Delta-Sigma Subarray Beamforming For Ultrasound Imaging, Hasan Şaki̇r Bi̇lge

Turkish Journal of Electrical Engineering and Computer Sciences

In this study, an ultrasonic digital beamformer based on subarray processing of 1-bit delta-sigma (\Delta \Sigma ) oversampled echo signals is presented. The single-bit oversampling \Delta \Sigma conversion simplifies the coherent processing in beamforming with improved timing accuracy. Subarray processing also aims to simplify the beamforming complexity, where the partial-beam sums (low-resolution beams) are acquired from small subarrays, and then these partial beams are coherently processed for producing high-resolution beams. In the \Delta \Sigma subarray beamforming, the \Delta \Sigma coded echo signals are summed over the subarray channels, and then these partial beam-sums are first \Delta \Sigma demodulated, then processed …

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 …

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.

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 …

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.

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 …

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.

E-Fraud Prevention Based On The Self-Authentication Of E-Documents, Jonathan Blackledge, Eugene Coyle

Conference papers

We consider a method for preventing e-Fraud in which a binary image is encrypted with a floating point cipher using a convolution operation and the output quantized into a 1-bit array generating a binary image ciphertext. The output is then ‘embedded’ in a host image to hide the encrypted information. Embedding is undertaken either in the lowest 1-bit layer or multiple 1-bit layers. Decryption is accomplished by: (i) extracting the binary image from the host image; (ii) correlating the result with the original cipher. In principle, any cipher generator can be used for this purpose and the method has been …