Search Constraints

Start Over
Filtering by: Creator Chandra, M. Subhosh Remove constraint Creator: Chandra, M. Subhosh Academic Affiliation Electrical Engineering and Computer Science Remove constraint Academic Affiliation: Electrical Engineering and Computer Science

Search Results

  • Building Self Adaptive Software Systems via Test-based Modifications

    Creator:
    Christi, Arpit M.
    Abstract:
    Building software systems that adapt to the changing environment is challenging. Developers cannot anticipate all the changes in advance, and even if they could, the effort required to handle such situations is too onerous for practical purposes. Self Adaptive Software (SAS) adapts itself as per changing environment. The area of...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . viii 2.1 Average increase in memory use (mean M+) for NetBeans IDE ver- sions

  • Low-cost deposition methods for transparent thin-film transistors

    Creator:
    Norris, Benjamin J.
    Abstract:
    The objective of this dissertation is to introduce low-cost processing methods for the fabrication of ZnO transparent thin-film transistors (TTFTs). A novel method for depositing ZnO body layers via spin-coating of a zinc nitrate-based spin solution is presented. The processing conditions of spin-coated ZnO are optimized to produce continuous and...
    Resource Type:
    Dissertation
    Full Text:
    ZnO film on a CorningTM 1737 glass substrate which is coated and annealed nine times with 0.055 M zinc

  • A Structural Theorem For Shortest Vertex-Disjoint Paths Computation in Planar Graphs

    Creator:
    Zafarani, Farzad
    Abstract:
    Given k terminal pairs (s₁,t₁),(s₂,t₂),..., (s[subscript k],t[subscript k]) in an edge-weighted graph G, the k Shortest Vertex-Disjoint Paths problem is to find a collection P₁, P₂,..., P[subscript k] of vertex-disjoint paths with minimum total length, where P[subscript i] is an s[subscript i]-to-t[subscript i] path. As a special case of the...
    Resource Type:
    Masters Thesis
    Full Text:
    terms of hardness. The best approximation algorithm so far is O(min{n2/3, √ m}) for both directed and

  • iMAC : improved medium access control for multi-channel multi-hop wireless networks

    Creator:
    Maiya, Megha
    Abstract:
    Trends in wireless networks are increasingly pointing towards a future with multi-hop networks deployed in multi-channel environments. In this thesis, we present the design for iMAC—a protocol targeted at medium access control in such environments. iMAC uses control packets on a common control channel to faciliate a three-way handshake between...
    Resource Type:
    Masters Thesis
    Full Text:
    Area of environment m Number of channels η Network load F Number of flows Ri Bandwidth rate of ith flow

  • Benchmarking Linux Containers and Virtual Machines

    Creator:
    Mittal, Pranjal
    Abstract:
    In data-centers, running multiple isolated workloads while getting the most performance out of available hardware is key. For many years Virtual Machines (VMs) have been an enabler, but native containers which offer isolation similar to virtual machines while reducing overhead costs associated with emulating hardware resources have become an increasingly...
    Resource Type:
    Masters Thesis
    Full Text:
    200000000 250000000 300000000 350000000 400000000 0 10 20 30 40 50 pe rf or m an ce  (c on st an

  • Towards Long Short Term Memory Based Proactive In-Network Caching for Cloud RANs

    Creator:
    Tirupathi, Chittibabu
    Abstract:
    The rapid population growth in large urban cities has led to an unprecedented increase in both the number and the diversity of wireless devices and applications with varying quality of service requirements in terms of latency and data rates. LinkNYC is an example of an urban communication network infrastructure, which...
    Resource Type:
    Masters Thesis
    Full Text:
    and is denoted by M . The number of clusters of BSs is denoted by K. We denote by F the set of all

  • Non-enzymatic electrochemical sensors based on functionalized nanomaterials

    Creator:
    Wu, Bo
    Abstract:
    Unlike other biosensing, electrochemical biosensor has the advantages of robustness, easy miniaturization, excellent detection limits, and capability in handling small analyte volumes. The detection selectivity of the electrochemical biosensors is mainly supported by bioreceptors. However, these receptors always suffer from the performance variation caused by the environment and the thermal-...
    Resource Type:
    Dissertation
    Full Text:
    . ...................................................................................................... 8 Figure 1.5. A schematic illustration of the IHOAM model in which M* is the reductive metal

  • New Detection Methods for Transmission at Faster-Than-Nyquist Rates Using Quasi-Orthogonal Sequences

    Creator:
    Fang, Zhou
    Abstract:
    Direct sequence spread spectrum (DSSS) was initially used for anti-jamming in military applications and was later developed in other commercial applications. Walsh codes, which are a set of mutually orthogonal codes, are one type of the spreading codes used in DSSS systems. For any spreading codes of length N, these...
    Resource Type:
    Masters Thesis
    Full Text:
    Preferred Pair for Gold Codes for m = 3, 5, 6, 7 . . . . . . . . . . . . . . . 13 3.1 Cross-Correlation and

  • Collaborative Filtering-Based In-Network Content Placement and Caching for 5G Networks

    Creator:
    Alorayj, Haya
    Abstract:
    As the number of wireless devices, the demand for high data rates, and the need for always-on connectivity are growing and becoming more stringent with the evolvement and emergence of 5G systems, network engineers and researchers are being faced with new unique challenges that need to be addressed. Among many...
    Resource Type:
    Masters Thesis
    Full Text:
    popularities, P for each CD. Srank contains a set of the M most popular �les, F1,. . . ,FM, with F1 being the

  • A Blockchains-Enabled Protocol for Distributed IoT Resource Sharing On-Demand

    Creator:
    Al-kalbani, Mohamed A.
    Abstract:
    In this thesis, we propose a Blockchain-based distributed protocol for enabling deployment of dynamic, on-demand IoT networks. Specifically, the proposed protocol leverages Blockchain technology to: (i) enable distributed and secure authentication, registration, and management of IoT devices; (ii) provide fast discovery of IoT resources and scalable and secure instantiation of...
    Resource Type:
    Masters Thesis
    Full Text:
    . Our proposed protocol uses a blockchains, BC , and hence, a set M of IoT devices are designated to