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

Computer Engineering Commons

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

2010

UNLV Theses, Dissertations, Professional Papers, and Capstones

Discipline
Keyword

Articles 1 - 8 of 8

Full-Text Articles in Computer Engineering

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 …


Study Of Stemming Algorithms, Savitha Kodimala Dec 2010

Study Of Stemming Algorithms, Savitha Kodimala

UNLV Theses, Dissertations, Professional Papers, and Capstones

Automated stemming is the process of reducing words to their roots. The stemmed words are typically used to overcome the mismatch problems associated with text searching.


In this thesis, we report on the various methods developed for stemming. In particular, we show the effectiveness of n-gram stemming methods on a collection of documents.


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 …


Data Routing In Multicore Processors Using Dimension Increment Method, Arpita H. Kadakia Dec 2010

Data Routing In Multicore Processors Using Dimension Increment Method, Arpita H. Kadakia

UNLV Theses, Dissertations, Professional Papers, and Capstones

A Deadlock-free routing algorithm can be generated for arbitrary interconnection network using the concept of virtual channels but the virtual channels will lead to more complex algorithms and more demands of NOC resource.


In this thesis, we study a Torus topology for NOC application, design its structure and propose a routing algorithm exploiting the characteristics of NOC. We have chosen a typical 16 (4 by 4) routers Torus and propose the corresponding route algorithm. In our algorithm, all the channels are assigned 4 different dimensions (n0,n1,n2 & n3). By following the dimension increment method, we break the dependent route circles, …


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 …


Automated Procedures For Quantification Of Rhizosphere Physical Properties In Micro Ct Images, Natarajan S. Pillai Aug 2010

Automated Procedures For Quantification Of Rhizosphere Physical Properties In Micro Ct Images, Natarajan S. Pillai

UNLV Theses, Dissertations, Professional Papers, and Capstones

The rhizosphere, i.e. the zone of soil immediately surrounding plant roots plays a prominent role in supplying plants with water and nutrients. However, surprisingly little is known about rhizosphere physical properties and how they affect root growth, water and nutrient uptake. The lack of non-invasive and non-destructive imaging techniques necessary to observe living roots growing in undisturbed soil have been a main reason for this shortcoming. Recent advances in synchrotron X-ray micro tomography (CMT) provide the potential to directly observe soil physical properties around living roots in-situ.In this work we develop procedures for assisting scientist to study the soil properties …


Processor Allocator For Chip Multiprocessors, Dawid Maksymilian Zydek Apr 2010

Processor Allocator For Chip Multiprocessors, Dawid Maksymilian Zydek

UNLV Theses, Dissertations, Professional Papers, and Capstones

Chip MultiProcessor (CMP) architectures consisting of many cores connected through Network-on-Chip (NoC) are becoming main computing platforms for research and computer centers, and in the future for commercial solutions. In order to effectively use CMPs, operating system is an important factor and it should support a multiuser environment in which many parallel jobs are executed simultaneously. It is done by the processor management system of the operating system, which consists of two components: Job Scheduler (JS) and Processor Allocator (PA). The JS is responsible for job scheduling that deals with selection of the next job to be executed, while 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 …