Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 24 of 24

Full-Text Articles in Computer Engineering

Design On High Performance Nanoscale Cmos Circuits With Low Temperature Sensitivity, Ming Zhu May 2018

Design On High Performance Nanoscale Cmos Circuits With Low Temperature Sensitivity, Ming Zhu

UNLV Theses, Dissertations, Professional Papers, and Capstones

With the rapid development of integrated circuit (IC) design and manufacturing technology, the transistor size now can be shrunk into only couple of nanometers whereas billions of transistors can be squeezed into a square millimeter, providing unprecedented computation power. However, accompanied with continuous device miniaturization and increased integration density is the explosive growth of on-chip power dissipation and a wide range of temperature fluctuation, which can heavily and negatively affect the delay performance of the circuit, or in the worst case, the circuit may malfunction and the system can be unreliable. Therefore, improved performance resilience against temperature variations has become ...


Improving Pattern Recognition And Neural Network Algorithms With Applications To Solar Panel Energy Optimization, Ernesto Zamora Ramos Aug 2017

Improving Pattern Recognition And Neural Network Algorithms With Applications To Solar Panel Energy Optimization, Ernesto Zamora Ramos

UNLV Theses, Dissertations, Professional Papers, and Capstones

Artificial Intelligence is a big part of automation and with today's technological advances, artificial intelligence has taken great strides towards positioning itself as the technology of the future to control, enhance and perfect automation. Computer vision includes pattern recognition and classification and machine learning. Computer vision is at the core of decision making and it is a vast and fruitful branch of artificial intelligence. In this work, we expose novel algorithms and techniques built upon existing technologies to improve pattern recognition and neural network training, initially motivated by a multidisciplinary effort to build a robot that helps maintain and ...


Vulnerability Analysis And Security Framework For Zigbee Communication In Iot, Charbel Azzi Dec 2016

Vulnerability Analysis And Security Framework For Zigbee Communication In Iot, Charbel Azzi

UNLV Theses, Dissertations, Professional Papers, and Capstones

Securing IoT (Internet of Things) systems in general, regardless of the communication technology used, has been the concern of many researchers and private companies. As for ZigBee security concerns, much research and many experiments have been conducted to better predict the nature of potential security threats. In this research we are addressing several ZigBee vulnerabilities by performing first hand experiments and attack simulations on ZigBee protocol. This will allow us to better understand the security issues surveyed and find ways to mitigate them. Based on the attack simulations performed and the survey conducted, we have developed a ZigBee IoT framework ...


Efficient Algorithms For Clustering Polygonal Obstacles, Sabbir Kumar Manandhar May 2016

Efficient Algorithms For Clustering Polygonal Obstacles, Sabbir Kumar Manandhar

UNLV Theses, Dissertations, Professional Papers, and Capstones

Clustering a set of points in Euclidean space is a well-known problem having applications in pattern recognition, document image analysis, big-data analytics, and robotics. While there are a lot of research publications for clustering point objects, only a few articles have been reported for clustering a given distribution of obstacles. In this thesis we examine the development of efficient algorithms for clustering a given set of convex obstacles in the 2D plane. One of the methods presented in this work uses a Voronoi diagram to extract obstacle clusters. We also consider the implementation issues of point/obstacle clustering algorithms.


Design And Implementation Of An Instruction Set Architecture And An Instruction Execution Unit For The Rez9 Coprocessor System, Daniel Spencer Anderson Dec 2014

Design And Implementation Of An Instruction Set Architecture And An Instruction Execution Unit For The Rez9 Coprocessor System, Daniel Spencer Anderson

UNLV Theses, Dissertations, Professional Papers, and Capstones

While the use of RNS has provided groundbreaking theory and progress in this field, the applications still lack viable testing platforms to test and verify the theory. This Thesis outlines the processing of developing an instruction set architecture (ISA) and an instruction execution unit (IEU) to help make the first residue based general processor a viable testing platform to address the mentioned problems.

Consider a 32-bit ripple adder. The delay on this device will be 32N where N is the delay for each adder to complete its operation. The delay of this process is due to the need to propagate ...


Simulation, And Overload And Stability Analysis Of Continuous Time Sigma Delta Modulator, Kyung Kang Dec 2014

Simulation, And Overload And Stability Analysis Of Continuous Time Sigma Delta Modulator, Kyung Kang

UNLV Theses, Dissertations, Professional Papers, and Capstones

The ever increasing demand for faster and more powerful digital applications requires high speed, high resolution ADCs. Currently, sigma delta modulators ADCs are extensively used in broadband telecommunication systems because they are an effective solution for high data-rate wireless communication systems that require low power consumption, high speed, high resolution, and large signal bandwidths.

Because mixed-signal integrated circuits such as Continuous Time sigma delta modulators contain both analog and digital circuits, mixed signal circuits are not as simple to model and simulate as all discrete or all analog systems. In this dissertation, the delta transform is used to simulate CT ...


Designing A Biomimetic Testing Platform For Actuators In A Series-Elastic Co-Contraction System, Ryan Tyler Schroeder Dec 2014

Designing A Biomimetic Testing Platform For Actuators In A Series-Elastic Co-Contraction System, Ryan Tyler Schroeder

UNLV Theses, Dissertations, Professional Papers, and Capstones

Actuators determine the performance of robotic systems at the most intimate of levels. As a result, much work has been done to assess the performance of different actuator systems. However, biomimetics has not previously been utilized as a pretext for tuning a series elastic actuator system with the purpose of designing an empirical testing platform. Thus, an artificial muscle tendon system has been developed in order to assess the performance of two distinct actuator types: (1) direct current electromagnetic motors and (2) ultrasonic rotary piezoelectric motors. Because the design of the system takes advantage of biomimetic operating principles such as ...


Gate Monte Carlo Simulations In A Cloud Computing Environment, Blake Austin Rowedder Aug 2014

Gate Monte Carlo Simulations In A Cloud Computing Environment, Blake Austin Rowedder

UNLV Theses, Dissertations, Professional Papers, and Capstones

The GEANT4-based GATE is a unique and powerful Monte Carlo (MC) platform, which provides a single code library allowing the simulation of specific medical physics applications, e.g. PET, SPECT, CT, radiotherapy, and hadron therapy. However, this rigorous yet flexible platform is used only sparingly in the clinic due to its lengthy calculation time. By accessing the powerful computational resources of a cloud computing environment, GATE's runtime can be significantly reduced to clinically feasible levels without the sizable investment of a local high performance cluster. This study investigated a reliable and efficient execution of GATE MC simulations using a ...


Non-Learning Semantic Analysis For Context Discovery And Sentiment Estimation: Transportation Application, Himanshu Verma Aug 2014

Non-Learning Semantic Analysis For Context Discovery And Sentiment Estimation: Transportation Application, Himanshu Verma

UNLV Theses, Dissertations, Professional Papers, and Capstones

With enormous amount of linguistic data present on web, text analysis has become one of the major fields of interest today. This field includes sentiment analysis, information retrieval, text document classification, knowledge based modeling, content similarity measure, data clustering, words prediction/correction, decision making etc. Managing and processing such data has vital importance. The field being quite broad, our focus is mainly on transportation related social media(Twitter) data extraction, text categorization/classification which can be further sub-divided into concept discovery, word sense disambiguation and sentiment analysis to analyze performance of existing transportation system worldwide. Concept discovery is the method ...


Modeling And Development Of Human Interface For Pedestrian Simulator, Romesh Khaddar Aug 2014

Modeling And Development Of Human Interface For Pedestrian Simulator, Romesh Khaddar

UNLV Theses, Dissertations, Professional Papers, and Capstones

According to Traveler opinion and perception survey of 2005, 107.4 million Americans use walking as regular mode of travel, which amounts to 51% of American population. In 2009, 4092 pedestrian fatalities have been reported nationwide with a fatality rate of 1.33 which totals 59,000 crashes. Also, pedestrians are over represented in crash data by accounting more than 12% of fatalities but on 10.9% of trips. This makes a perfect case for understanding the causes behind such statistics, calling for a continuous research on pedestrians walking behavior and their interactions with surroundings.

Current research in pedestrian simulation ...


Co-Emulation Of Scan-Chain Based Designs Utilizing Sce-Mi Infrastructure, Bill Jason Pidlaoan Tomas May 2014

Co-Emulation Of Scan-Chain Based Designs Utilizing Sce-Mi Infrastructure, Bill Jason Pidlaoan Tomas

UNLV Theses, Dissertations, Professional Papers, and Capstones

Simulation times of complex System-on-Chips (SoC) have grown exponentially as designs reach the multi-million ASIC gate range. Verification teams have adopted emulation as a prominent methodology, incorporating high-level testbenches and FPGA/ASIC hardware for system-level testing (SLT). In addition to SLT, emulation enables software teams to incorporate software applications with cycle-accurate hardware early on in the design cycle. The Standard for Co-Emulation Modeling Interface (SCE-MI) developed by the Accelera Initiative, is a widely used communication protocol for emulation which has been accepted by major electronic design automation (EDA) companies.

Scan-chain is a design-for-test (DFT) methodology used for testing digital circuits ...


Nonlinear Adaptive Diffusion Models For Image Denoising, Ajay Kumar Mandava Dec 2013

Nonlinear Adaptive Diffusion Models For Image Denoising, Ajay Kumar Mandava

UNLV Theses, Dissertations, Professional Papers, and Capstones

Most of digital image applications demand on high image quality. Unfortunately, images often are degraded by noise during the formation, transmission, and recording processes. Hence, image denoising is an essential processing step preceding visual and automated analyses. Image denoising methods can reduce image contrast, create block or ring artifacts in the process of denoising. In this dissertation, we develop high performance non-linear diffusion based image denoising methods, capable to preserve edges and maintain high visual quality. This is attained by different approaches: First, a nonlinear diffusion is presented with robust M-estimators as diffusivity functions. Secondly, the knowledge of textons derived ...


An Online Algorithm For The 2-Server Problem On The Line With Improved Competitiveness, Lucas Adam Bang May 2013

An Online Algorithm For The 2-Server Problem On The Line With Improved Competitiveness, Lucas Adam Bang

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this thesis we present a randomized online algorithm for the 2-server problem on the line, named R-LINE (for Randomized Line). This algorithm achieves the lowest competitive ratio of any known randomized algorithm for the 2-server problem on the line.

The competitiveness of R-LINE is less than 1.901. This result provides a significant improvement over the previous known competitiveness of 155/78 (approximately 1.987), by Bartal, Chrobak, and Larmore, which was the first randomized algorithm for the 2-server problem one the line with competitiveness less than 2. Taking inspiration from this algorithm,we improve this result by utilizing ...


Communication Artifacts And Interaction Evaluation For Requirements Engineering, Miloslava Plachkinova May 2013

Communication Artifacts And Interaction Evaluation For Requirements Engineering, Miloslava Plachkinova

UNLV Theses, Dissertations, Professional Papers, and Capstones

This paper aims to answer an important question regarding the development of new information systems (IS): "What is the predominant factor for the selection of communication artifacts for requirements engineering (RE)?". Many researchers have focused on the RE and communication as separate disciplines, but little or no research addressed the RE communication issues. These problems are important because they often lead to misunderstanding and misinterpretation of the gathered requirements. We develop expectations about the RE communication process based on prior literature from both disciplines and we test them through several case studies. Our methodology consists of analysis of six case ...


Post Processing Of Optically Recognized Text Using First Order Hidden Markov Model, Spandana Malreddy Dec 2012

Post Processing Of Optically Recognized Text Using First Order Hidden Markov Model, Spandana Malreddy

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this thesis, we report on our design and implementation of a post processing system for Optically Recognized text. The system is based on first order Hidden Markov Model (HMM). The Maximum Likelihood algorithm is used to train the system with over 150 thousand characters. The system is also tested on a file containing 5688 characters. The percentage of errors detected and corrected is 11.76% with a recall of 10.16% and precision of 100%


Hardware-Software Co-Design, Acceleration And Prototyping Of Control Algorithms On Reconfigurable Platforms, Desta Kumsa Edosa Dec 2012

Hardware-Software Co-Design, Acceleration And Prototyping Of Control Algorithms On Reconfigurable Platforms, Desta Kumsa Edosa

UNLV Theses, Dissertations, Professional Papers, and Capstones

Differential equations play a significant role in many disciplines of science and engineering. Solving and implementing Ordinary Differential Equations (ODEs) and partial Differential Equations (PDEs) effectively are very essential as most complex dynamic systems are modeled based on these equations. High Performance Computing (HPC) methodologies are required to compute and implement complex and data intensive applications modeled by differential equations at higher speed. There are, however, some challenges and limitations in implementing dynamic system, modeled by non-linear ordinary differential equations, on digital hardware. Modeling an integrator involves data approximation which results in accuracy error if data values are not considered ...


Node Filtering And Face Routing For Sensor Network, Umang Amatya Aug 2012

Node Filtering And Face Routing For Sensor Network, Umang Amatya

UNLV Theses, Dissertations, Professional Papers, and Capstones

Greedy forward routing and face routing algorithms have been extensively used for sending messages in sensor networks. In this thesis, we consider the problem of filtering redundant nodes in a sensor network as a pre-processing step for face routing. We propose two algorithms for identifying redundant nodes. We test the performance of proposed filtering algorithms on generated networks. The prototype algorithm for testing the proposed algorithms has been implemented in the Java programming language. Experimental investigation shows that the proposed filtering algorithms are effective in removing redundant nodes without compromising the network connectivity.


Non-Blocking Concurrent Operations On Heap, Mahesh Acharya Aug 2012

Non-Blocking Concurrent Operations On Heap, Mahesh Acharya

UNLV Theses, Dissertations, Professional Papers, and Capstones

We present a non-blocking implementation for the concurrent Heap data structure in the asynchronous shared memory system. The system may be a traditional one with a single processor with multiple threads, or it may be the one with multiple processors each possibly with multiple threads. Our implementation supports readMin, deleteMin, and insert operations on the heap. The deleteMin and insert operations are non-blocking operations, whereas the readMin is wait-free. One easy approach of using a heap in multi-threading environment could be by locking the entire heap before performing any operation. This would make the implementation very slow to have any ...


Cpu Scheduling For Power/Energy Management On Heterogeneous Multicore Processors, Rajesh Patel Aug 2012

Cpu Scheduling For Power/Energy Management On Heterogeneous Multicore Processors, Rajesh Patel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Power and energy have become increasingly important concerns in the design and implementation of today's multicore/manycore chips. Many methods have been proposed to reduce a microprocessor's power usage and associated heat dissipation, including scaling a core's operating frequency. However, these techniques do not consider the dynamic performance characteristics of an executing process at runtime, the execution characteristics of the entire task to which this process belongs, the process's priority, the process's cache miss/cache reference ratio, the number of context switches and CPU migrations generated by the process, nor the system load. Also, many ...


Dynamic Distributed Programming And Applications To Swap Edge Problem, Feven Z. Andemeskel Dec 2010

Dynamic Distributed Programming And Applications To Swap Edge Problem, Feven Z. Andemeskel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Link failure is a common reason for disruption in communication networks. If communication between processes of a weighted distributed network is maintained by a spanning tree T, and if one edge e of T fails, communication can be restored by finding a new spanning tree, T’. If the network is 2-edge connected, T’ can always be constructed by replacing e by a single edge, e’, of the network. We refer to e’ as a swap edge of e.


The best swap edge problem is to find the best choice of e’, that is, that e which causes the new spanning ...


Self-Stabilizing Group Membership Protocol, Mahesh Subedi Dec 2010

Self-Stabilizing Group Membership Protocol, Mahesh Subedi

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this thesis, we consider the problem of partitioning a network into groups of bounded diameter.

Given a network of processes X and a constant D, the group partition problem is the problem of finding a D-partition of X, that is, a partition of X into disjoint connected subgraphs, which we call groups, each of diameter no greater than D. The minimal group partition problem is to find a D-partition {G1, ... Gm} of X such that no two groups can be combined; that is, for any Gi and Gj, where i ≠ j, either Gi U Gj is disconnected or Gi ...


Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti Dec 2010

Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti

UNLV Theses, Dissertations, Professional Papers, and Capstones

The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network will eventually reach a legitimate configuration.

Note that any self-stabilizing algorithm for the leader election problem is also an algorithm for the dynamic leader election problem, since when the topology of the network changes, we can consider that the algorithm is starting over again from an arbitrary state. There are a number of such algorithms in the ...


A Secure On-Line Credit Card Transaction Method Based On Kerberos Authentication Protocol, Jung Eun Kim Apr 2010

A Secure On-Line Credit Card Transaction Method Based On Kerberos Authentication Protocol, Jung Eun Kim

UNLV Theses, Dissertations, Professional Papers, and Capstones

Nowadays, electronic payment system is an essential part of modern business. Credit cards or debit cards have been widely used for on-site or remote transactions, greatly reducing the need for inconvenient cash transactions. However, there have been a huge number of incidents of credit card frauds over the Internet due to the security weakness of electronic payment system. A number of solutions have been proposed in the past to prevent this problem, but most of them were inconvenient and did not satisfy the needs of cardholders and merchants at the same time.

In this thesis, we present a new secure ...


Hierarchical Routing In Manets Using Simple Clustering, Adam Carnine Jan 2009

Hierarchical Routing In Manets Using Simple Clustering, Adam Carnine

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis presents both a review of current MANET routing protocols and a new MANET routing algorithm. The routing protocols reviewed include representative samples from the three primary forms of routing found in MANETS: proactive routing, reactive routing and hybrid routing. Secure algorithms are given special treatment in the review. In addition several protocol enhancements are discussed.

The proposed routing protocol is designed to support networks of a medium size, containing over 200 nodes but less than 3,000 nodes. The design is intentionally simple to allow ease of implementation in comparison with other MANET protocols that provide similar functionality.