Computer Engineering Commons^™

Formal Analysis Of Arithmetic Circuits Using Computer Algebra - Verification, Abstraction And Reverse Engineering, Cunxi Yu

Doctoral Dissertations

Despite a considerable progress in verification and abstraction of random and control logic, advances in formal verification of arithmetic designs have been lagging. This can be attributed mostly to the difficulty in an efficient modeling of arithmetic circuits and datapaths without resorting to computationally expensive Boolean methods, such as Binary Decision Diagrams (BDDs) and Boolean Satisfiability (SAT), that require “bit blasting”, i.e., flattening the design to a bit-level netlist. Approaches that rely on computer algebra and Satisfiability Modulo Theories (SMT) methods are either too abstract to handle the bit-level nature of arithmetic designs or require solving computationally expensive decision or …

Adaft: A Resource-Efficient Framework For Adaptive Fault-Tolerance In Cyber-Physical Systems, Ye Xu

Doctoral Dissertations

Cyber-physical systems frequently have to use massive redundancy to meet application requirements for high reliability. While such redundancy is required, it can be activated adaptively, based on the current state of the controlled plant. Most of the time the physical plant is in a state that allows for a lower level of fault-tolerance. Avoiding the continuous deployment of massive fault-tolerance will greatly reduce the workload of CPSs. In this dissertation, we demonstrate a software simulation framework (AdaFT) that can automatically generate the sub-spaces within which our adaptive fault-tolerance can be applied. We also show the theoretical benefits of AdaFT, and …

Analyzing Spark Performance On Spot Instances, Jiannan Tian

Masters Theses

Amazon Spot Instances provide inexpensive service for high-performance computing. With spot instances, it is possible to get at most 90% off as discount in costs by bidding spare Amazon Elastic Computer Cloud (Amazon EC2) instances. In exchange for low cost, spot instances bring the reduced reliability onto the computing environment, because this kind of instance could be revoked abruptly by the providers due to supply and demand, and higher-priority customers are first served.

To achieve high performance on instances with compromised reliability, Spark is applied to run jobs. In this thesis, a wide set of spark experiments are conducted to …

Navigation Instruction Validation Tool And Indoor Wayfinding Training System For People With Disabilities, Linlin Ding

Masters Theses

According to World Health Survey, there are 785 million (15.6%) people in the world that live with a disability. It is a well-known fact that lack of access to public transportation is a barrier for people with disabilities in seeking work or accessing health care. In this research, we seek to increase access to public transportation by introducing a virtual pre-travel training system that enables people with disabilities to get familiar with a public transportation venue prior to arriving at the venue. Using this system, users establish a mental map of the target environment prior to their arrival to the …

Efficient Scaling Of A Web Proxy Cluster, Hao Zhang

Masters Theses

With the continuing growth in network traffic and increasing diversity in web content, web caching, together with various network functions (NFs), has been introduced to enhance security, optimize network performance, and save expenses. In a large enterprise network with more than tens of thousands of users, a single proxy server is not enough to handle a large number of requests and turns to group processing. When multiple web cache proxies are working as a cluster, they talk with each other and share cached objects by using internet cache protocol (ICP). This leads to poor scalability.

This thesis describes the development …

Query On Knowledge Graphs With Hierarchical Relationships, Kaihua Liu

Masters Theses

The dramatic popularity of graph database has resulted in a growing interest in graph queries. Two major topics are included in graph queries. One is based on structural relationship to find meaningful results, such as subgraph pattern match and shortest-path query. The other one focuses on semantic-based query to find question answering from knowledge bases. However, most of these queries take knowledge graphs as flat forms and use only normal relationship to mine these graphs, which may lead to mistakes in the query results. In this thesis, we find hierarchical relationship in the knowledge on their semantic relations and make …

Magneto-Electric Approximate Computational Framework For Bayesian Inference, Sourabh Kulkarni

Masters Theses

Probabilistic graphical models like Bayesian Networks (BNs) are powerful artificial-intelligence formalisms, with similarities to cognition and higher order reasoning in the human brain. These models have been, to great success, applied to several challenging real-world applications. Use of these formalisms to a greater set of applications is impeded by the limitations of the currently used software-based implementations. New emerging-technology based circuit paradigms which leverage physical equivalence, i.e., operating directly on probabilities vs. introducing layers of abstraction, promise orders of magnitude increase in performance and efficiency of BN implementations, enabling networks with millions of random variables. While majority of applications with …

Oracle Guided Incremental Sat Solving To Reverse Engineer Camouflaged Circuits, Xiangyu Zhang

Masters Theses

This study comprises two tasks. The first is to implement gate-level circuit camouflage techniques. The second is to implement the Oracle-guided incremental de-camouflage algorithm and apply it to the camouflaged designs.

The circuit camouflage algorithms are implemented in Python, and the Oracle- guided incremental de-camouflage algorithm is implemented in C++. During this study, I evaluate the Oracle-guided de-camouflage tool (Solver, in short) performance by de-obfuscating the ISCAS-85 combinational benchmarks, which are camouflaged by the camouflage algorithms. The results show that Solver is able to efficiently de-obfuscate the ISCAS-85 benchmarks regardless of camouflaging style, and is able to do so 10.5x …

Supporting Trajectory Udf Queries And Indexes On Postgis, Pyoung Woo Yang, Kwang Woo Nam

Free and Open Source Software for Geospatial (FOSS4G) Conference Proceedings

In this paper, we propose a system model for querying and indexing the GPS trajectory of moving objects on PostGIS/PostgreSQL. We developed moving object data types including MPoint(moving point), MDouble(moving double) for GPS trajectories. Also, various moving objects UDFs(user-defined functions) are implemented for moving objects queries. For efficient query processing, r-tree index is extended for trajectory, and pre-materialization techniques are proposed for fast UDF processing. Experimental results show that the pre-materialization techniques are about 1.2 times faster than naïve query processing using r-tree index.

Analyzing The Performance Of Nosql Vs. Sql Databases For Spatial And Aggregate Queries, Sarthak Agarwal, Ks Rajan

Free and Open Source Software for Geospatial (FOSS4G) Conference Proceedings

Relational databases have been around for a long time and spatial databases have exploited this feature for close to two decades. The recent past has seen the development of NoSQL non-relational databases, which are now being adopted for spatial object storage and handling, too. While SQL databases face scalability and agility challenges and fail to take the advantage of the cheap memory and processing power available these days, NoSQL databases can handle the rise in the data storage and frequency at which it is accessed and processed - which are essential features needed in geospatial scenarios, which do not deal …

Virtualization Of Closed-Loop Sensor Networks, Priyanka Dattatri Kedalagudde

Masters Theses

The existing closed-loop sensor networks are based on architectures that are designed and implemented for one specific application and require dedicated sensing and computational resources. This prevents the sharing of these networks. In this work, we propose an architecture of virtualization to allow sharing of closed-loop sensor networks. We also propose a scheduling approach that will manage requests from competing applications and evaluate their impact on system utilization against utilization achieved by more traditional, dedicated sensor networks. These algorithms are evaluated through trace-driven simulations, where the trace data is taken from CASA’s closed-loop weather radar sensor network. Results from this …

Belief-Space Planning For Resourceful Manipulation And Mobility, Dirk Ruiken

Doctoral Dissertations

Robots are increasingly expected to work in partially observable and unstructured environments. They need to select actions that exploit perceptual and motor resourcefulness to manage uncertainty based on the demands of the task and environment. The research in this dissertation makes two primary contributions. First, it develops a new concept in resourceful robot platforms called the UMass uBot and introduces the sixth and seventh in the uBot series. uBot-6 introduces multiple postural configurations that enable different modes of mobility and manipulation to meet the needs of a wide variety of tasks and environmental constraints. uBot-7 extends this with the use …

Explorations Into Machine Learning Techniques For Precipitation Nowcasting, Aditya Nagarajan

Masters Theses

Recent advances in cloud-based big-data technologies now makes data driven solutions feasible for increasing numbers of scientific computing applications. One such data driven solution approach is machine learning where patterns in large data sets are brought to the surface by finding complex mathematical relationships within the data. Nowcasting or short-term prediction of rainfall in a given region is an important problem in meteorology. In this thesis we explore the nowcasting problem through a data driven approach by formulating it as a machine learning problem.

State-of-the-art nowcasting systems today are based on numerical models which describe the physical processes leading to …

Achieving Perfect Location Privacy In Wireless Devices Using Anonymization, Zarrin Montazeri

Masters Theses

The popularity of mobile devices and location-based services (LBS) have created great concerns regarding the location privacy of the users of such devices and services. Anonymization is a common technique that is often being used to protect the location privacy of LBS users. This technique assigns a random pseudonym to each user and these pseudonyms can change over time. Here, we provide a general information theoretic definition for perfect location privacy and prove that perfect location privacy is achievable for mobile devices when using the anonymization technique appropriately. First, we assume that the user’s current location is independent from her …

Inference In Networking Systems With Designed Measurements, Chang Liu

Doctoral Dissertations

Networking systems consist of network infrastructures and the end-hosts have been essential in supporting our daily communication, delivering huge amount of content and large number of services, and providing large scale distributed computing. To monitor and optimize the performance of such networking systems, or to provide flexible functionalities for the applications running on top of them, it is important to know the internal metrics of the networking systems such as link loss rates or path delays. The internal metrics are often not directly available due to the scale and complexity of the networking systems. This motivates the techniques of inference …

Image Processing And Understanding Based On Graph Similarity Testing: Algorithm Design And Software Development, Jieqi Kang

Doctoral Dissertations

Image processing and understanding is a key task in the human visual system. Among all related topics, content based image retrieval and classification is the most typical and important problem. Successful image retrieval/classification models require an effective fundamental step of image representation and feature extraction. While traditional methods are not capable of capturing all structural information on the image, using graph to represent the image is not only biologically plausible but also has certain advantages. Graphs have been widely used in image related applications. Traditional graph-based image analysis models include pixel-based graph-cut techniques for image segmentation, low-level and high-level image …

Superhero Robotics, Frank Sup, Brian Umberger, Nick Sawyer

Science and Engineering Saturday Seminars

No abstract provided.