Computer Sciences Commons^™

A New Cyber Forensic Philosophy For Digital Watermarks In The Context Of Copyright Laws, Vinod P. Bhattathiripad, Sneha Sudhakaran, Roshna K. Thalayaniyil

Annual ADFSL Conference on Digital Forensics, Security and Law

The objective of this paper is to propose a new cyber forensic philosophy for watermark in the context of copyright laws for the benefit of the forensic community and the judiciary worldwide. The paper first briefly introduces various types of watermarks, and then situates watermarks in the context of the ideaexpression dichotomy and the copyright laws. It then explains the forensic importance of watermarks and proposes a forensic philosophy for them in the context of copyright laws. Finally, the paper stresses the vital need to incorporate watermarks in the forensic tests to establish software copyright infringement and also urges the …

A Survey Of Software-Based String Matching Algorithms For Forensic Analysis, Yi-Ching Liao

Annual ADFSL Conference on Digital Forensics, Security and Law

Employing a fast string matching algorithm is essential for minimizing the overhead of extracting structured files from a raw disk image. In this paper, we summarize the concept, implementation, and main features of ten software-based string matching algorithms, and evaluate their applicability for forensic analysis. We provide comparisons between the selected software-based string matching algorithms from the perspective of forensic analysis by conducting their performance evaluation for file carving. According to the experimental results, the Shift-Or algorithm (R. Baeza-Yates & Gonnet, 1992) and the Karp-Rabin algorithm (Karp & Rabin, 1987) have the minimized search time for identifying the locations of …

Investigating Forensics Values Of Windows Jump Lists Data, Ahmad Ghafarian

Annual ADFSL Conference on Digital Forensics, Security and Law

Starting with Windows 7, Microsoft introduced a new feature to the Windows Operating Systems called Jump Lists. Jump Lists stores information about user activities on the host machine. These activities may include links to the recently visited web pages, applications executed, or files processed. Computer forensics investigators may find traces of misuse in Jump Lists auto saved files. In this research, we investigate the forensics values of Jump Lists data. Specifically, we use several tools to view Jump Lists data on a virtual machine. We show that each tool reveal certain types of information about user’s activity on the host …

An Empirical Comparison Of Widely Adopted Hash Functions In Digital Forensics: Does The Programming Language And Operating System Make A Difference?, Satyendra Gurjar, Ibrahim Baggili, Frank Breitinger, Alice Fischer

Annual ADFSL Conference on Digital Forensics, Security and Law

Hash functions are widespread in computer sciences and have a wide range of applications such as ensuring integrity in cryptographic protocols, structuring database entries (hash tables) or identifying known files in forensic investigations. Besides their cryptographic requirements, a fundamental property of hash functions is efficient and easy computation which is especially important in digital forensics due to the large amount of data that needs to be processed when working on cases. In this paper, we correlate the runtime efficiency of common hashing algorithms (MD5, SHA-family) and their implementation. Our empirical comparison focuses on C-OpenSSL, Python, Ruby, Java on Windows and …

Two Challenges Of Stealthy Hypervisors Detection: Time Cheating And Data Fluctuations, Igor Korkin

Annual ADFSL Conference on Digital Forensics, Security and Law

Hardware virtualization technologies play a significant role in cyber security. On the one hand these technologies enhance security levels, by designing a trusted operating system. On the other hand these technologies can be taken up into modern malware which is rather hard to detect. None of the existing methods is able to efficiently detect a hypervisor in the face of countermeasures such as time cheating, temporary self-uninstalling, memory hiding etc. New hypervisor detection methods which will be described in this paper can detect a hypervisor under these countermeasures and even count several nested ones. These novel approaches rely on the …

Two Correspondence Problems Easier Than One, Aaron Michaux, Zygmunt Pizlo

MODVIS Workshop

Computer vision research rarely makes use of symmetry in stereo reconstruction despite its established importance in perceptual psychology. Such stereo reconstructions produce visually satisfying figures with precisely located points and lines, even when input images have low or moderate resolution. However, because few invariants exist, there are no known general approaches to solving symmetry correspondence on real images. The problem is significantly easier when combined with the binocular correspondence problem, because each correspondence problem provides strong non-overlapping constraints on the solution space. We demonstrate a system that leverages these constraints to produce accurate stereo models from pairs of binocular images …

College Of Engineering Senior Design Competition Spring 2015, University Of Nevada, Las Vegas

Fred and Harriet Cox Senior Design Competition Projects

Part of every UNLV engineering student’s academic experience, the senior design project stimulates engineering innovation and entrepreneurship. Each student in their senior year chooses, plans, designs, and prototypes a product in this required element of the curriculum. A capstone to the student’s educational career, the senior design project encourages the student to use everything learned in the engineering program to create a practical, real world solution to an engineering challenge. The senior design competition helps focus the senior students in increasing the quality and potential for commercial application for their design projects. Judges from local industry evaluate the projects on …

Non-Invasive Detection Of Moving And Stationary Human With Wifi, Chenshu Wu, Zheng Yang, Zimu Zhou, Xuefeng Liu, Yunhao Liu, Jiannong Cao

Research Collection School Of Computing and Information Systems

Non-invasive human sensing based on radio signals has attracted a great deal of research interest and fostered a broad range of innovative applications of localization, gesture recognition, smart health-care, etc., for which a primary primitive is to detect human presence. Previous works have studied the detection of moving humans via signal variations caused by human movements. For stationary people, however, existing approaches often employ a prerequisite scenario-tailored calibration of channel profile in human-free environments. Based on in-depth understanding of human motion induced signal attenuation reflected by PHY layer channel state information (CSI), we propose DeMan, a unified scheme for non-invasive …

Naturalized Communication And Testing, Marly Roncken, Swetha Mettala Gilla, Hoon Park, Navaneeth Prasannakumar Jamadagni, Christopher Cowan, Ivan Sutherland

Computer Science Faculty Publications and Presentations

We ”naturalize” the handshake communication links of a self-timed system by assigning the capabilities of filling and draining a link and of storing its full or empty status to the link itself. This contrasts with assigning these capabilities to the joints, the modules connected by the links, as was previously done. Under naturalized communication, the differences between Micropipeline, GasP, Mousetrap, and Click circuits are seen only in the links — the joints become identical; past, present, and future link and joint designs become interchangeable. We also “naturalize” the actions of a self-timed system, giving actions status equal to states — …

Tweetement: Pseudo-Relevance Feedback For Twitter Search, Kanatbay Bektemirov

Computer Science and Computer Engineering Undergraduate Honors Theses

Microblogging platforms such as Twitter let users communicate with short messages. Due to the messages’ short content and the users’ tendency to type short queries while searching, it is particularly challenging to locate useful tweets that match user queries. The fundamental problems of word mismatch due to ambiguity are especially acute. To solve this problem, this thesis explores and compares multiple automatic query expansion methods that involve the most frequent hashtags and keywords. We built a Web service that provides real-time Twitter Search results incorporating automatic query expansion. Six pseudo-relevance feedback methods were studied and the numbers indicate that results …

Design, Programming, And User-Experience, Kaila G. Manca

Honors Scholar Theses

This thesis is a culmination of my individualized major in Human-Computer Interaction. As such, it showcases my knowledge of design, computer engineering, user-experience research, and puts into practice my background in psychology, com- munications, and neuroscience.

I provided full-service design and development for a web application to be used by the Digital Media and Design Department and their students.This process involved several iterations of user-experience research, testing, concepting, branding and strategy, ideation, and design. It lead to two products.

The first product is full-scale development and optimization of the web appli- cation.The web application adheres to best practices. It was …

Using A Nearest Neighbor Algorithm And Logistic Regression To Assess Hazard Identification In The U.S. Army Risk Management Process, Heath L. Mccormick

Theses and Dissertations

This research considers whether a person's demographic and experiential attributes play a significant role in how they perceive the presence or absence of hazards in a given situation. The goal of the research is to show that participants with enlisted military experience, prior to being commissioned as a junior officer, would be more successful at identifying the hazards presented in military scenarios than those who had only been trained on the process via their pre-commissioning and initial entry courses of instruction. The research study involves the use of two surveys with realistic military scenarios including both Foot March and Maintenance …

Using Unrestricted Mobile Sensors To Infer Tapped And Traced User Inputs, Trang Duyen Nguyen

Theses and Dissertations

As of January 2014, 58% of Americans over the age of 18 own a smart phone. Of these smart phones, Android devices provide some security by requiring that third-party application developers declare to users which components and features their applications will access. However, many of the real-time environmental sensors on devices are exempt from this requirement. We evaluate the possibility of exploiting this freedom to discretely use these sensors and expand on previous work by developing an application that can use the gyroscope and accelerometer to interpret what the user has written, even of trace input is used. Trace input …

Design And Verification Environment For High-Performance Video-Based Embedded Systems, Michael Mefenza Nentedem

Graduate Theses and Dissertations

In this dissertation, a method and a tool to enable design and verification of computation demanding embedded vision-based systems is presented. Starting with an executable specification in OpenCV, we provide subsequent refinements and verification down to a system-on-chip prototype into an FPGA-Based smart camera. At each level of abstraction, properties of image processing applications are used along with structure composition to provide a generic architecture that can be automatically verified and mapped to the lower abstraction level. The result is a framework that encapsulates the computer vision library OpenCV at the highest level, integrates Accelera's System-C/TLM with UVM and QEMU-OS …

Enabling Runtime Self-Coordination Of Reconfigurable Embedded Smart Cameras In Distributed Networks, Franck Ulrich Yonga Yonga

Graduate Theses and Dissertations

Smart camera networks are real-time distributed embedded systems able to perform computer vision using multiple cameras. This new approach is a confluence of four major disciplines (computer vision, image sensors, embedded computing and sensor networks) and has been subject of intensive work in the past decades. The recent advances in computer vision and network communication, and the rapid growing in the field of high-performance computing, especially using reconfigurable devices, have enabled the design of more robust smart camera systems. Despite these advancements, the effectiveness of current networked vision systems (compared to their operating costs) is still disappointing; the main reason …

Development Of A Tridimensional Measuring Application For Ipads, Michael Casebolt, Nicolas Kouatli, Jack Mullen

Computer Science and Software Engineering

In today’s fast-paced distribution centers workers and management alike are constantly searching for the quickest and most efficient way to package items for distribution. Even with the advancement of app-oriented solutions to a variety of problems across many industries there is a distinct unmet need in distribution environments for an application capable of increasing the efficiency and accuracy of packaging items. This senior project focused on the development and testing of an application utilizing the Structure Three Dimensional Sensor and a 4th generation iPad to scan an object or group of objects to be packaged and determine the overall dimensions …

Ambient Rendezvous: Energy Efficient Neighbor Discovery Via Acoustic Sensing, Keyu Wang, Zheng Yang, Zimu Zhou, Yunhao Liu, Lionel M. Ni

Research Collection School Of Computing and Information Systems

The continual proliferation of mobile devices has stimulated the development of opportunistic encounter-based networking and has spurred a myriad of proximity-based mobile applications. A primary cornerstone of such applications is to discover neighboring devices effectively and efficiently. Despite extensive protocol optimization, current neighbor discovery modalities mainly rely on radio interfaces, whose energy and wake up delay required to initiate, configure and operate these protocols hamper practical applicability. Unlike conventional schemes that actively emit radio tones, we exploit ubiquitous audio events to discover neighbors passively. The rationale is that spatially adjacent neighbors tend to share similar ambient acoustic environments. We propose …

Near-Optimal Decentralized Power Supply Restoration In Smart Grids, Pritee Agrawal, Akshat Kumar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Next generation of smart grids face a number of challenges including co-generation from intermittent renewable power sources, a shift away from monolithic control due to increased market deregulation, and robust operation in the face of disasters. Such heterogeneous nature and high operational readiness requirement of smart grids necessitates decentralized control for critical tasks such as power supply restoration (PSR) after line failures. We present a novel multiagent system based approach for PSR using Lagrangian dual decomposition. Our approach works on general graphs, provides provable quality-bounds and requires only local message-passing among different connected sub-regions of a smart grid, enabling decentralized …

Multi-Agent Task Assignment For Mobile Crowdsourcing Under Trajectory Uncertainties, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra

Research Collection School Of Computing and Information Systems

In this work, we investigate the problem of mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually browse and filter tasks to perform, we intend to automatically make task recommendations based on workers' historical trajectories and desired time budgets. However, predicting workers' trajectories is inevitably faced with uncertainties, as no one will take exactly the same route every day; yet such uncertainties are oftentimes abstracted away in the known literature. In this work, we depart from the deterministic modeling and study the stochastic task recommendation problem where …

Formal Specification And Refinement Of The Navigation Tasks Of Autonomous Robots, Eman Rabiah

Theses

Autonomous robots are hybrid systems whose role in our daily life is becoming increasingly critical. They are tasked with various activities requiring reliability, safety, and correctness of their software-controlled behavior. Formal methods have been proved effective in addressing development issues associated with these software qualities. However, even though autonomous robot navigation is a primordial function, there is no research dealing with enhancing reliability of the navigation algorithms. Thus, our focus is to investigate this type of algorithms, and specifically path planning, a fundamental and critical functionality supporting autonomy. We formally address the issue of enhancing reliability of the widely-used A* …

Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu

Research Collection School Of Computing and Information Systems

In an urban city, its transportation network supports efficient flow of people between different parts of the city. Failures in the network can cause major disruptions to commuter and business activities which can result in both significant economic and time losses. In this paper, we investigate the use of centrality measures to determine critical nodes in a transportation network so as to improve the design of the network as well as to devise plans for coping with the network failures. Most centrality measures in social network analysis research unfortunately consider only topological structure of the network and are oblivious of …

Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We address the problem of crowd congestion at venues like theme parks, museums and world expos by providing route guidance to multiple selfish users (with budget constraints) moving through the venue simultaneously. To represent these settings, we introduce the Selfish Orienteering Problem (SeOP) that combines two well studied problems from literature, namely Orienteering Problem (OP) and Selfish Routing (SR). OP is a single agent routing problem where the goal is to minimize latency (or maximize reward) in traversing a subset of nodes while respecting budget constraints. SR is a game between selfish agents looking for minimum latency routes from source …

Secure And Reliable Routing Protocol For Transmission Data In Wireless Sensor Mesh Networks, Nooh Adel Bany Muhammad

Dissertations

Abstract

Sensor nodes collect data from the physical world then exchange it until it reaches the intended destination. This information can be sensitive, such as battlefield surveillance. Therefore, providing secure and continuous data transmissions among sensor nodes in wireless network environments is crucial. Wireless sensor networks (WSN) have limited resources, limited computation capabilities, and the exchange of data through the air and deployment in accessible areas makes the energy, security, and routing major concerns in WSN. In this research we are looking at security issues for the above reasons. WSN is susceptible to malicious activities such as hacking and physical …

Solving Multi-Vehicle Profitable Tour Problem Via Knowledge Adoption In Evolutionary Bi-Level Programming, Stephanus Daniel Handoko, Abhishek Gupta, Chen Kim Heng, Hoong Chuin Lau, Yew Soon Ong, Puay Siew Tan

Research Collection School Of Computing and Information Systems

Profitable tour problem (PTP) belongs to the class of vehicle routing problem (VRP) with profits seeking to maximize the difference between the total collected profit and the total cost incurred. Traditionally, PTP involves single vehicle. In this paper, we consider PTP with multiple vehicles. Unlike the classical VRP that seeks to serve all customers, PTP involves the strategic-level customer selection so as to maximize the total collected profit and the operational-level route optimization to minimize the total cost incurred. Therefore, PTP is essentially the knapsack problem at the strategic level with VRP at the operational level. That means the evolutionary …

Self-Organizing Neural Networks Integrating Domain Knowledge And Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Jacek M. Zurada

Research Collection School Of Computing and Information Systems

The use of domain knowledge in learning systems is expected to improve learning efficiency and reduce model complexity. However, due to the incompatibility with knowledge structure of the learning systems and real-time exploratory nature of reinforcement learning (RL), domain knowledge cannot be inserted directly. In this paper, we show how self-organizing neural networks designed for online and incremental adaptation can integrate domain knowledge and RL. Specifically, symbol-based domain knowledge is translated into numeric patterns before inserting into the self-organizing neural networks. To ensure effective use of domain knowledge, we present an analysis of how the inserted knowledge is used by …

Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar

Research Collection School Of Computing and Information Systems

Detection of infeasible paths is required in many areas including test coverage analysis, test case generation, security vulnerability analysis, etc. Existing approaches typically use static analysis coupled with symbolic evaluation, heuristics, or path-pattern analysis. This paper is related to these approaches but with a different objective. It is to analyze code of real systems to build patterns of unsatisfiable constraints in infeasible paths. The resulting patterns can be used to detect infeasible paths without the use of constraint solver and evaluation of function calls involved, thus improving scalability. The patterns can be built gradually. Evaluation of the proposed approach shows …

Matchmaking Game Players On Public Transport, Nairan Zhang, Youngki Lee, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

This paper extends our recent work, called GameOn, which presented a system for allowing public transport commuters to engage in multiplayer games with fellow commuters traveling on the same bus or train. An important challenge for GameOn is to group players with reliable connections into the same game. In this case, the meaning of reliability has two dimensions. First, the network connectivity (TCP, UDP etc.) should be robust. Second, the players should be collocated with each other for a sufficiently long duration so that a game session will not be terminated by players leaving the public transport modality such as …

Predicting Bundles Of Spatial Locations From Learning Revealed Preference Data, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

We propose the problem of predicting a bundle of goods, where the goods considered is a set of spatial locations that an agent wishes to visit. This typically arises in the tourism setting where attractions can often be bundled and sold as a package to visitors. While the problem of predicting future locations given the current and past trajectories is well-established, we take a radical approach by looking at it from an economic point of view. We view an agent's past trajectories as revealed preference (RP) data, where the choice of locations is a solution to an optimisation problem according …

Micro-Policies: Formally Verified, Tag-Based Security Monitors, Arthur Azevedo De Amorim, Maxime Denes, Nick Giannarakis, Cătălin Hriţcu, Benjamin C. Pierce, Antal Spector-Zabusky, Andrew Tolmach

Computer Science Faculty Publications and Presentations

Recent advances in hardware design have demonstrated mechanisms allowing a wide range of low-level security policies (or micro-policies) to be expressed using rules on metadata tags. We propose a methodology for defining and reasoning about such tag-based reference monitors in terms of a high-level “symbolic machine,” and we use this methodology to define and formally verify micro-policies for dynamic sealing, compartmentalization, control-flow integrity, and memory safety; in addition, we show how to use the tagging mechanism to protect its own integrity. For each micro-policy, we prove by refinement that the symbolic machine instantiated with the policy’s rules embodies a high-level …

Robust And Real-Time Stereo Matching On Parallel Graphics Hardware Using Gradient-Based Disparity Refinement, Jedrzej Kowalczuk

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

Computer vision attempts to provide camera-equipped machines with visual perception, i.e., the capability to comprehend their surroundings through the analysis and understanding of images. The ability to perceive depth is a vital component of visual perception that enables machines to interpret the three-dimensional structure of their surroundings and allows them to navigate through the environment. In computer vision, depth perception is achieved via stereo matching, a process that identifies correspondences between pixels in images acquired using a pair of horizontally offset cameras. It is possible to calculate depths from correspondences or, more specifically, the positional offsets (disparities) between pixels in …