Computer Engineering Commons^™

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 …

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 commercial cloud …

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 ideas from T-theory, game …

Node Filtering And Face Routing For Sensor Network, Umang Amatya

College of Engineering: Graduate Celebration Programs

Main Contributions

•Efficient Algorithms for identifying Redundant Sensor Nodes

•New Technique for Filtering Redundant Nodes in Sensor Network

•Reliable Algorithm for Message Routing - Forwarding

•User Friendly Prototype Implementation in Java

•Results of Experimental Investigation

Cognitive Congestion Control For Data Portal, Ershad Sharifahmadian, Shahram Latifi

College of Engineering: Graduate Celebration Programs

Network congestion is one of challenging tasks in communication networks and leads to queuing delay, packet loss or the blocking of new connections. Here, a data portal is considered as an application-based network, and a cognitive method is proposed to deal with congestion in this kind of network. The cognitive method is proposed to improve bandwidth sharing, and deal with congestion in a data portal. When the data portal is about climate change data, congestion control is more emphasized, because the scientific climate data is voluminous and there is a high traffic to/from data portal by the scientific community, research …

Optical Network-On-Chip Architectures And Designs, Lei Zhang

UNLV Theses, Dissertations, Professional Papers, and Capstones

As indicated in the latest version of ITRS roadmap, optical wiring is a viable interconnection technology for future SoC/SiC/SiP designs that can provide broad band data transfer rates unmatchable by the existing metal/low-k dielectric interconnects. In this dissertation study, a set of different optical interconnection architectures are presented for future on-chip optical micro-networks.

Three Optical Network-on-Chip (ONoC) architectures, i.e., Wavelength Routing Optical Network-on-Chip (WRON), Redundant Wavelength Routed Optical Network (RDWRON) and Recursive Wavelength Routed Optical Network (RCWRON) are proposed. They are fully connected networks designed based on passive switching Microring Resonator (MRR) optical switches. Given enough different routing optical wavelengths, …

Understanding The Influence Of Blog On The Development Of Social Capital, Reza Vaezi, Gholamreza Torkzadeh, Jerry Cha-Jan Chang

Management, Entrepreneurship and Technology Faculty Publications

The rapid use and application of blogs in diverse areas such as education, marketing, journalism, and human resource management in recent years underlines the need for a better understanding of the impact of this new technology on social capital. Social capital reflects the norm of reciprocity and the level of trust among individuals who connect, interact, and benefit from one another. Blog is expected to influence the extent and the scope of this interaction by providing new means of networking among people. This paper examines the relationship between blog use and social capital and reports on the results of an …

Investigations Into Library Web Scale Discovery Services, Jason Vaughan

Library Faculty Publications

Web scale discovery services for libraries provide deep discovery to a library’s local and licensed content, and represent an evolution, perhaps a revolution, for end user information discovery as pertains to library collections. This article frames the topic of Web scale discovery, and begins by illuminating Web scale discovery from an academic library’s perspective – that is, the internal perspective seeking widespread staff participation in the discovery conversation. This included the creation of a Discovery Task Force, a group which educated library staff, conducted internal staff surveys, and gathered observations from early adopters. The article next addresses the substantial research …

Development Of Visualization Facility At The Gis And Remote Sensing Core Lab, University Of Nevada, Las Vegas, Haroon Stephen, William J. Smith, Zhongwei Liu

Public Policy and Leadership Faculty Presentations

Visualization using advanced computational and graphic equipment has become a standard way of present day research. Availability of low cost and fast processing units, high resolution displays with graphic processing units, and specialized software has brought complex visualization capabilities to an office desktop. Nevertheless, when dealing with large datasets such as, global climate, geospatial, and social data the office desktop falls short and calls for a centralized visualization facility with high end computing and graphics equipment.

Visualization Facility at GIS and Remote Sensing Core Lab would be a useful and important addition to the UNLV IT infrastructure. It would provide …

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 …

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 …

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 …

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 …

Networking And Computing Infrastructure In Nevada: Current Status And Future Developments, Frederick C. Harris

2010 Annual Nevada NSF EPSCoR Climate Change Conference

12 PowerPoint slides Session 2: Infrastructure Convener: Sergiu Dascalu, UNR

Architecture And Usability Aspects Of Environmental Data Portals, Michael Mcmahon, Jr.

2010 Annual Nevada NSF EPSCoR Climate Change Conference

12 PowerPoint slides Session 2: Infrastructure Convener: Sergiu Dascalu, UNR Abstract: -Web Portal: A web site that acts as a starting point or gateway to Internet content, services, and information. Portals expose this information via a consistent set of visual elements and organizational constructs that improve the user experience and may relate, unify, or otherwise enhance the content. -Data Portal: A web site that acts as a starting point or gateway to Internet content, web/data services, and related information. Portals expose this information via a consistent set of visual elements and organizational constructs that improve the user experience and relate, …

Survey Of Environmental Data Portals: Features, Characteristics, And Reliability Issues, Shahram Latifi, David Walker

2010 Annual Nevada NSF EPSCoR Climate Change Conference

24 PowerPoint slides Session 2: Infrastructure Convener: Sergiu Dascalu, UNR Abstract: -What is a Data Portal? -Presents information from diverse sources in a unified way -Enables instant, reliable and secure exchange of information over the Web -The "portal" concept is to offer a single web page that aggregates content from several systems or servers.

Goals, Plans, And Strategies Of The Cyberinfrastructure Project Component, Sergiu Dascalu

2010 Annual Nevada NSF EPSCoR Climate Change Conference

15 PowerPoint slides Session 2: Infrastructure Convener: Sergiu Dascalu, UNR Abstract: -Team -Goal and Targets -Strategies and Activities -Progress: Activities & Milestones -Plans

Research Poster: Software Frameworks For Improved Productivity In Climate Change Research, Sohei Okamoto

2010 Annual Nevada NSF EPSCoR Climate Change Conference

Research poster

Research Poster: Architecture And Usability Aspects Of Environmental Data Portals, Victor Ivanov

2010 Annual Nevada NSF EPSCoR Climate Change Conference

Research poster

Research Poster: Htsma: A Hybrid Temporal-Spatial Multi-Channel Assignment Scheme In Heterogeneous Wireless Mesh Networks, Yan Jin, Ju-Yeon Jo, Mei Yang, Yoohwan Kim, Yingtao Jiang, John Gowens

2010 Annual Nevada NSF EPSCoR Climate Change Conference

Research poster

Research Poster: Survey Of Environmental Data Portals: Features And Characteristics, David Walker

2010 Annual Nevada NSF EPSCoR Climate Change Conference

Research poster

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.

Efficient Scheduling For Sdmg Cioq Switches, Mei Yang, S. Q. Zheng

Electrical & Computer Engineering Faculty Research

Combined input and output queuing (CIOQ) switches are being considered as high-performance switch architectures due to their ability to achieve 100% throughput and perfectly emulate output queuing (OQ) switch performance with a small speedup factor S. To realize a speedup factor S, a conventional CIOQ switch requires the switching fabric and memories to operate S times faster than the line rate. In this paper, we propose to use a CIOQ switch with space-division multiplexing expansion and grouped input/output ports (SDMG CIOQ switch for short) to realize speedup while only requiring the switching fabric and memories to operate at the line …

Stabilizing Inter-Domain Routing In The Internet, Yu Chen, Ajoy K. Datta, Sebastien Tixeuil

Mechanical Engineering Faculty Research

This paper reports the first self-stabilizing Border Gateway Protocol (BGP). BGP is the standard inter-domain routing protocol in the Internet. Self-stabilization is a technique to tolerate arbitrary transient faults.

The routing instability in the Internet can occur due to errors in configuring the routing data structures, the routing policies, transient physical and data link problems, software bugs, and memory corruption. This instability can increase the network latency, slow down the convergence of the routing data structures, and can also cause the partitioning of networks. Most of the previous studies concentrated on routing policies to achieve the convergence of BGP while …