Search Constraints

Start Over
Filtering by: Creator Callahan, P. S. Remove constraint Creator: Callahan, P. S. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella

Search Results

  • Adiabatic Markov Decision Process : convergence of value iteration algorithm

    Creator:
    Duong, Thai
    Abstract:
    Markov Decision Process (MDP) is a well-known framework for devising the optimal decision making strategies under uncertainty. Typically, the decision maker assumes a stationary environment which is characterized by a time-invariant transition probability matrix. However, in many real-world scenarios, this assumption is not justified, thus the optimal strategy might not...
    Resource Type:
    Masters Thesis
    Full Text:
    : Assumption 1. The reward r(s,a) and the probability p( j|s,a) are stationary. Assumption 2. The reward r(s

  • Implementation and performance analysis of a scalable routing protocol

    Creator:
    Venkatesan, Rudhrakumar
    Abstract:
    Ad Hoc networks are multi-hop wireless networks consisting of mobile hosts. They do not have any pre-existing network infrastructure and are characterized by constantly changing topology, limited battery power and bandwidth. Typical applications of such networks are battlefield networks, medical relief during natural calamities or disasters, conference room networking, and...
    Resource Type:
    Masters Thesis
    Full Text:
    : Implementation and Perfoice nalysis of a Scalable Routing Protocol Abstract approved P. Singh Ad Hoc networks

  • Secure socket layer protocol simulation in Java

    Creator:
    Karri, Nagendra
    Abstract:
    This project aims to study the performance of Secure Sockets Layer (SSL) Protocol implemented in JAVA for web applications. Secure Sockets Layer protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery. In particular, this project focuses on an implementation of...
    Resource Type:
    Capstone Project

  • Information theoretic approach to quantization and classification for signal processing, communications, and machine learning applications

    Creator:
    Thuan Nguyen D.
    Abstract:
    There are five main contributions of this dissertation. The first contribution is new closed-form expressions for channel capacity of a new class of channel matrices. The second contribution is the discovery of the structure for optimal binary quantizer and the associated methods for finding an optimal quantizer that maximizes mutual...
    Resource Type:
    Dissertation
    Full Text:
    , COMMUNICATIONS, AND MACHINE LEARNING APPLICATIONS Abstract approved: Thinh P. Nguyen There are five main

  • Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system

    Creator:
    Nandakumar Thampi, Archana
    Abstract:
    The communication in MLS cross-domain environments faces many challenges. The three most important challenges are efficient key management, privacy preserving and covert channel. We propose an Efficient, Secure and Covert Channel Capacity Bounded Protocol which has three algorithms that addresses these challenges: The Efficient Attribute-based Fine-Grained Authentication (EAFA) algorithm, Anonymous...
    Resource Type:
    Masters Thesis
    Full Text:
    IDU with its public key PUK , signed by the private key of the service provider P S R), and the

  • Optimization of interactive live free viewpoint multiview video streaming bandwidth

    Creator:
    Kramer, Richard A.
    Abstract:
    There are generally two types of multiview video:(1) 3D Multiview Video (“3D MVV” also called “2D plus delta” or “stereo” multi-view video): 3D MVV is widely deployed in cinemas and in the TV industry. 3D MVV typically entails capturing video of an object using two cameras with differing view angles...
    Resource Type:
    Masters Thesis
    Full Text:
    Abstract approved: _____________________________________________________ Thinh P. Nguyen There are

  • Reinforcement Learning for Network Routing

    Creator:
    Yalamanchi, Hema Jyothi
    Abstract:
    Efficient routing of information packets in dynamically changing communication networks requires routing policies that adapt to changes in load levels, traffic patterns and network topologies. Reinforcement Learning (RL) is an area of artificial intelligence that studies algorithms that dynamically optimize their performance based on experience in an environment. RL, thus,...
    Resource Type:
    Capstone Project
    Full Text:
    , instead of estimates of the remaining paths. Say a packet P is generated at node s. This packet

  • Development and Implementation of JetNet : A Decentralized Wireless Sensing Protocol

    Creator:
    Goins, Justin B.
    Abstract:
    Modern sensor network applications are often implemented wirelessly in order to lessen installation costs and reduce deployment times. Unfortunately, these wireless sensor network (WSN) nodes must often rely on batteries or energy harvesting techniques in order to sustain their operation and supply the power needed to maintain communication within the...
    Resource Type:
    Dissertation
    Full Text:
    : Kartikeya Mayaram Terri S. Fiez Modern sensor network applications are often implemented wirelessly in

  • Variable sampling compensation of networked control systems with delays using neural networks

    Creator:
    Lopez-Echevarria, Daniel
    Abstract:
    In networked control systems (NCS) information or packets usually flow from a sensor or a set of sensors to a remotely located controller. Then the controller processes the received information and sends a series of control commands to the actuators through a communication network which could be either wireless or...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . 85 6.4 System subject to delays, τ sc and τ ca had mean μ = 0.06s. . . . . . 87 6.5 Representation

  • Maximum flow in planar digraphs

    Creator:
    Harutyunyan, Anna
    Abstract:
    Worst-case analysis is often meaningless in practice. Some problems never reach the anticipated worst-case complexity. Other solutions get bogged down with impractical constants during implementation, despite having favorable asymptotic running times. In this thesis, we investigate these contrasts in the context of finding maximum flows in planar digraphs. We suggest...
    Resource Type:
    Masters Thesis
    Full Text:
    y. (b) P and Q are non-crossing . . . . . . . . . . . 7 2.4 (a) G embedded on a cylinder with s

  • Parallel simplex algorithms and loop spreading

    Creator:
    Wu, Youfeng
    Abstract:
    Parallel solutions for two classes of linear programs are presented. First we parallelized the two-phase revised simplex algorithm and showed that it is possible to get linear improvement in performance. The simplex algorithm is the best known algorithm for solving linear programs, and we claim our result is the best...
    Resource Type:
    Dissertation
    Full Text:
    . Performance of Parallel Simplex Algorithm. S p e e d U p 18.0 16.2 14.4 12.6 10.8 9.0 7.2 5.4 3.6

  • Offloading of I/O transactions in current CPU architectures

    Creator:
    Larsen, Steen K.
    Abstract:
    IO transactions within a computer system have evolved along with other system components (i.e., CPU, memory, video) from programmed IO (PIO). In current mainstream systems (spanning from HPC to mobile) the IO transactions are CPU-centric descriptor-based DMA transactions. The key benefit is that slower IO devices can DMA write system...
    Resource Type:
    Dissertation
    Full Text:
    core(s) to context-switch to other tasks. However, CPU-controlled descriptor-based DMA has a number

  • Task partitioning and scheduling on arbitrary parallel processing systems

    Creator:
    El-Rewini, Hesham
    Abstract:
    Parallel programming is the major stumbling block preventing the parallel processing industry from quickly satisfying the demand for parallel computer software. This research is aimed at solving some of the problems of software development for parallel computers. ELGDF is a graphical language for designing parallel programs. The goal of ELGDF...
    Resource Type:
    Dissertation
    Full Text:
    PPSE 14 2.2 An ELGDF Design Network 15 2.3 An ELGDF Subnetwork With Node P(i) Replicated N Times and

  • Learning cost-sensitive diagnostic policies from data

    Creator:
    Zubek, Valentina Bayer
    Abstract:
    In its simplest form, the process of diagnosis is a decision-making process in which the diagnostician performs a sequence of tests culminating in a diagnostic decision. For example, a physician might perform a series of simple measurements (body tem- perature, weight, etc.) and laboratory measurements (white blood count, CT scan,...
    Resource Type:
    Dissertation
    Full Text:
    search space is a directed acyclic graph (DAG). . . . . 54 4.2 Qopt(s; x) for unexpanded AND node (s; x

  • On error bounds for linear feature extraction

    Creator:
    Thangavelu, Madan Kumar
    Abstract:
    Linear transformation for dimension reduction is a well established problem in the field of machine learning. Due to the numerous observability of parameters and data, processing of the data in its raw form is computationally complex and difficult to visualize. Dimension reduction by means of feature extraction offers a strong...
    Resource Type:
    Masters Thesis
    Full Text:
    density function of a Gaussian distribution is give by p(x) = 1 √ |2πΣ| e− 1 2 (x−µ)TΣ−1(x−µ). (1.1

  • Design and Analysis of Distributed Resource Allocation Techniques for Large-Scale Dynamic Spectrum Access Networks

    Creator:
    NoroozOliaee, MohammadJavad
    Abstract:
    The widespread use of wireless devices that we have recently been witnessing, such as smartphones, tablets, laptops, and wirelessly accessible devices in general, is causing an unprecedented growth in the required amount of the wireless radio spectrum. On the other hand, the spectrum resource has, for the last several decades,...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . 74 4.1 Forced termination probability as a function of the primary arrival rate λp for k = 1, 2

  • Optimizing the advanced encryption standard on Intel's SIMD architecture

    Creator:
    Godbole, Pankaj
    Abstract:
    The Advanced Encryption Standard (AES) is the new standard for cryptography and has gained wide support as a means to secure digital data. Hence, it is beneficial to develop an implementation of AES that has a high throughput. SIMD technology is very effective in increasing the performance of some cryptographic...
    Resource Type:
    Masters Thesis
    Full Text:
    , P. Fragneto, M. Macchetti, and S. Marchesin. Efficient software implentation of aes on 32-bit

  • Implementation of an information management system for vehicle preventative maintenance using a 4GL

    Creator:
    Hurng, Jyh-Mirng
    Abstract:
    The Vehicle Preventative Maintenance System (VPMS) is a 4GL application system that keep track of information required for vehicle maintenance. It can be used to schedule routine vehicle maintenance, and to produce complete and accurate vehicle cost reports, enabling its users to optimize vehicle maintenance. In this report, after describing...
    Resource Type:
    Capstone Project
    Full Text:
    ,•scr:ipt ion, PrE•·,;s FS to lcu::,k,.;p , tt f u l -na .ri1•::· HELP "Enter fuel description, Pre ss FS

  • ASIC for real time data authentication

    Creator:
    Anjum, Vaseem
    Abstract:
    Authentication is a means of developing an electronic signature that works like a written signature. It assumes that your data is publicly known but nevertheless ensures that the message is not tampered with and that you have an audit trail. This project discusses the techniques and concepts used to design...
    Resource Type:
    Capstone Project
    Full Text:
    ":""P -_. __ Y.01.S 21: :>::i::i:-, .. ?Y DEL !:DZT !"LI? Y.OVE 12: . ->:-n-:...:: ?Y DEL EDIT T

  • Learning hierarchical decomposition rules for planning : an inductive logic programming approach

    Creator:
    Reddy, Chandrasekhara K.
    Abstract:
    Artificial Intelligence (AI) planning techniques have been central to automating a gamut of tasks from the mundane route planning and beer production to the ethereal image processing of space-ship images. Of all the planning techniques, hierarchical- decomposition planning has been the technique most employed in industrial-strength planners. Hierarchical-decomposition planning is...
    Resource Type:
    Dissertation
    Full Text:
    have its own d-rule(s). For example, the subgoal clear(?x) for the goal on(?x, ?y) has the d- rule

  • Fast data replenishment in peer to peer networks

    Creator:
    Dhamodaran, Arul Nambi
    Abstract:
    Peer-to-Peer (P2P) based distributed storage systems have gain much popularity in recent years. These systems rely greatly on the data redundancy to be robust under network dynamics, i.e., the dynamics of peer entering and departing the network. Hence, it is important to implement mechanisms for maintaining a certain level of...
    Resource Type:
    Masters Thesis
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . 25 3.3 (a). Packet flow of packet type P (1) using the existing methods. (b). Packet flow of packet

  • Network Coding, Random Matrices, and Their Applications to Communication Systems

    Creator:
    Nguyen-Huu, Duong
    Abstract:
    In this work, we study network coding technique, its relation to random matrices, and their applications to communication systems. The dissertation consists of three main contributions. First, we propose efficient algorithms for data synchronization via a broadcast channel using random network coding. Second, we study the resiliency of network coding...
    Resource Type:
    Dissertation
    Full Text:
    : Thinh P. Nguyen In this work, we study network coding technique, its relation to random matrices, and

  • Meeting End-to-End Deadlines in Real-Time Networks Using Software Defined Networking (SDN)

    Creator:
    Almahdi, Rafid M.
    Abstract:
    Network flows in Real-Time (RT) systems need to meet stringent end-to-end deadlines in order for such systems to operate safely and reliably. Today, such systems use custom or domain specific network system designs to meet end-to-end deadlines and other constraints of real-time flows. In this work we explore the design...
    Resource Type:
    Dissertation
    Full Text:
    D tp s′,s. This can be computed as: Dtps′,s = D t s′,s +D p s′,s′ 4.2.4 Processing and Queuing

  • A study of model-based average reward reinforcement learning

    Creator:
    Ok, DoKyeong
    Abstract:
    Reinforcement Learning (RL) is the study of learning agents that improve their performance from rewards and punishments. Most reinforcement learning methods optimize the discounted total reward received by an agent, while, in many domains, the natural criterion is to optimize the average reward per time step. In this thesis, we...
    Resource Type:
    Dissertation
    Full Text:
    . The total reward for a starting state s in time t for a policy it can be conveniently denoted by p

  • A pipelined baseband digital predistortion architecture for RF amplifier linearization

    Creator:
    Xu, Xiangqing
    Abstract:
    This thesis describes the design of a baseband digital predistortion architecture for radio frequency (RF) amplifier linearization. Existing amplifier linearization techniques are first examined. The nonlinearity of an amplifier can be characterized as amplitude-to-amplitude distortion and amplitude-to-phase distortion. The distortion can be corrected by providing a predistorted driver signal (both...
    Resource Type:
    Masters Thesis
    Full Text:
    time out of their busy schedules to be present at my defense. Special thanks to Mr. Robert S

  • Metacontent based techniques for the regression testing of component based software : a case study

    Creator:
    Williams, Vasanth
    Abstract:
    Component based software technologies are viewed as essential for creating the software systems of the future. However, the use of externally provided component has serious drawbacks for a wide range of software engineering activities often because of a lack of information about the components. One such drawback involves validation of...
    Resource Type:
    Capstone Project
    Full Text:
    proceeds as follows: 1. Select T/ s T, a set of test cases to execute on P /. 2. Test P / with T

  • Optimal load and resource balance in internet distributed systems

    Creator:
    Nishida, Hiroshi
    Abstract:
    A distributed system is a network of multiple autonomous computational nodes designed primarily for performance scalability and robustness. The performance of a distributed system depends critically on how tasks and resources are distributed among the nodes. Thus, a main thrust in distributed system research is to design schemes for distributing...
    Resource Type:
    Dissertation
    Full Text:
    Resource Balance in Internet Distributed Systems Abstract approved: Thinh P. Nguyen A distributed system

  • Dynamic and Dual Streaming Methods for H.264 Video and Parallel Performance Modeling

    Creator:
    Johnson, Taylor N.
    Abstract:
    Traditional approaches to streaming H.264 video over a network typically rely on a single method of transport (i.e., reliable or unreliable) and/or use static values for parameters that can have a significant negative impact on the perceptual quality of the received video. This dissertation presents a dynamic method for wireless...
    Resource Type:
    Dissertation
    Full Text:
    Dominant Dependence . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 4.2.2 The effect of p on

  • Implementation of processor allocation in an N-Cube multiprocessor on Macintosh

    Creator:
    Liu, Jinyue
    Abstract:
    The processor allocation in an n-dimensional hypercube multiprocessor using buddy strategy, gray code strategy, and a new strategy is implemented on Macintosh. Our implementations show that when processor relinquishment is not considered (i.e. static allocation), all these strategies are optimal in the sense that each incoming request sequence is always...
    Resource Type:
    Capstone Project
    Full Text:
    have already been embedded into subcubes[S]. 2. Processor Allocation Strategies In an N-cube

  • Coordinating secondary-user behaviors for inelastic traffic reward maximization in large-scale DSA networks

    Creator:
    NoroozOliaee, MohammadJavad
    Abstract:
    We develop efficient coordination techniques that support inelastic traffic in large-scale distributed dynamic spectrum access DSA networks. By means of any learning algorithm, the proposed techniques enable DSA users to locate and exploit spectrum opportunities effectively, thereby increasing their achieved throughput (or "rewards" to be more general). Basically, learning algorithms...
    Resource Type:
    Masters Thesis
    Full Text:
    NoroozOliaee for the degree of Master of S ien e in Computer S ien e presented on Mar h 6 , 2013. Title

  • Low-complexity high-speed VLSI design of low-density parity-check decoders

    Creator:
    Cui, Zhiqiang
    Abstract:
    Low-Density Parity-check (LDPC) codes have attracted considerable attention due to their capacity approaching performance over AWGN channel and highly parallelizable decoding schemes. They have been considered in a variety of industry standards for the next generation communication systems. In general, LDPC codes achieve outstanding performance with large codeword lengths (e.g.,...
    Resource Type:
    Dissertation
    Full Text:
    .....................................49 4.10 Decoder architecture (P=2

  • Adaptive Streaming Methods using Dual Protocols and Reinforcement Learning

    Creator:
    Gatimu, Kevin
    Abstract:
    The ubiquity of high quality video and proliferation of mobile devices has contributed to an unprecedented rise in video consumption. HTTP, in conjunction with adaptive streaming, has become the de facto mechanism for delivering the vast majority of video as it readily caters to heterogeneous networks and devices. This dissertation...
    Resource Type:
    Dissertation
    Full Text:
    8 9 10 0 5 10 15 20 25 30 35 40 Time (s) Th ro ug hp ut (M bp s) L2L L2L+iPod

  • Advanced time-varying approaches for modeling the multipath channel in wireless network

    Creator:
    Aljerme, Abdelkader A.
    Abstract:
    This dissertation proposes the use of advanced time-varying approaches for modeling the dynamics of the multipath channel in wireless communication networks. These advanced time-varying approaches include linear Kalman innovation models in observable block companion form, and neural network-based models. The e˙ectiveness of these type of models is evaluated through three...
    Resource Type:
    Dissertation
    Full Text:
    ]. . . . . . . . . . . . . 79 4.1 Plot of %15 vs. p [48]. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 4.2

  • Protocol design and optimization for wireless networks

    Creator:
    Lertsutthiwong, Monchai
    Abstract:
    We investigate a number of techniques for increasing throughput and quality of media applications over wireless networks. A typical media communication application such as video streaming imposes strict requirements on the delay and throughout of its packets, which unfortunately, cannot be guaranteed by the underlying wireless network due inherently to...
    Resource Type:
    Dissertation
    Full Text:
    using the greedy algorithm. (a) Throughput; (b) Transmission probability; (c) Percentage of S slots; (d

  • Network coding in relay networks

    Creator:
    Alban, Eduardo
    Abstract:
    Transmission over wireless networks presents multiple technical challenges due to noise, interference, fading, power constraints and bandwidth limitation. Different solutions have been propposed to overcome these issues and some of them are treated here. Cooperative diversity has been proposed as an implementation for networks where terminals are restricted to using...
    Resource Type:
    Masters Thesis
    Full Text:
    }+ βas,rE{xs}E{z ∗ r} +βa∗s,rE{x ∗ s}E{Zr}+ β 2E{z2r} = β2(|as,r| 2P +N0) ≤ P . 19 Therefore

  • Advances in side-channel cryptanalysis : microarchitectural attacks

    Creator:
    Aciiçmez, Onur
    Abstract:
    Cryptographic devices leak timing and power consumption information that is easily measurable, radiation of various levels, and more. Such devices also have additional inputs, other than plaintext and keys, like voltage, which can be modified to force the device to produce certain faulty outputs that can be used to reveal...
    Resource Type:
    Dissertation
    Full Text:
    4.4 DES S-Box lookup. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65

  • Coding Techniques for Achieving Efficient Wireless Sensor Networks

    Creator:
    Qassim, Yousef M.
    Abstract:
    In this dissertation, we explored multiple coding techniques to reduce energy consumption, improve performance, and secure wireless sensor networks specifically and ad-hoc networks in general. With the introduction of Internet of Things (IoT) and 5G technologies, wireless sensor networks are quickly emerging as an important and key technology in the...
    Resource Type:
    Dissertation
    Full Text:
    TABLES Table Page 2.1 Field elements for GF(16) with p(x) = x4 + x+ 1 . . . . . . . . . . . . . . . 15

  • Smalltalk-like collection classes in Java

    Creator:
    Sirimalle, Vinod
    Abstract:
    Data structures are essential for any programming task. Most of modem programming lan­guages have a library of reusable data structures. In this project, Smalltalk-like collection classes have been implemented as a Java package. This package, collections, con­tains several useful data structures such as binary tree, B-Tree, bag, list, hash table...
    Resource Type:
    Capstone Project
    Full Text:
    of Bound- s Error object: publi c Obj ec t insertAt ( int i, Obje c t a ) thr ows Bound s Error

  • The dynamic speculation and performance prediction of parallel loops

    Creator:
    Zier, David A.
    Abstract:
    General purpose computer systems have seen increased performance potential through the parallel processing capabilities of multicore processors. Yet this potential performance can only be attained through parallel applications, thus forcing software developers to rethink how everyday applications are designed. The most readily form of Thread Level Parallelism (TLP) within any...
    Resource Type:
    Dissertation
    Full Text:
    results for example loop . . . . . . . . . . . . . . . . . . . 74 3.11 Ideal performance for δP

  • Java byte code obfuscator

    Creator:
    Mundle, Maithily
    Abstract:
    This paper discusses Java Bytecode Obfuscation techniques that make the reverse engineering task more difficult. This paper is structured as follows: Java virtual machine and Java language specifications are discussed first. Then the paper talks about different techniques for protecting software and then details one promising approach named Obfuscation. The...
    Resource Type:
    Capstone Project
    Full Text:
    D 'Ambrosio for being the part of the faculty committee for my Master ' s defense. I would like

  • Low-power dynamic CMOS circuits in high-performance memory arrays

    Creator:
    Patwary, Md. Ataur R.
    Abstract:
    Dynamic CMOS circuits are commonly used in high-performance memory arrays to implement wide-NOR logic functions for their read and search operations. This is because dynamic circuits have significantly higher speed and lower area compared to static circuits for performing similar operations. Register File (RF) arrays are located at the top...
    Resource Type:
    Dissertation
    Full Text:
    0.05 0.10 0.15 0.20 0.25 0.30 Input noise (mV) R e la ti v e K e e p e r S iz e 8 PDN/LBL

  • Efficient decoder design for error correction codes

    Creator:
    He, Jinjin
    Abstract:
    Error correction codes (ECCs) have been widely used in communication systems and storage devices. Nowadays, the rapid development of integrated circuit technologies makes feasible the implementation of powerful ECCs such as turbo code and low-density parity-check (LDPC) code. However, these high-performance codes require complex decoding algorithms, resulting in large hardware...
    Resource Type:
    Dissertation
    Full Text:
    modula- 15 S=8-PSK Q(0) Q(1) Q(00) Q(10) Q(01) Q(11) Q(000) Q(100) Q(010) Q(110) Q(001) Q(101) Q

  • Customizable Visual Traces for Program Explanations

    Creator:
    Bajaj, Divya
    Abstract:
    Correctness and efficiency are important properties of programs. However, to support maintenance and debugging, the programs should also be understandable. Program explanations also play a vital role in educational settings, enhancing the understanding of programs among students. Proof trees provide a sound basis for generating dynamic explanations of programs. But...
    Resource Type:
    Masters Thesis
    Full Text:
    hidden. The judgments are of the form v|p ρ, where a value v is matched with a pattern p to generate

  • A visual XML query interface

    Creator:
    Zhao, Shiwei
    Abstract:
    As XML becomes more and more popular, easy-to-use and powerful XML query languages are in great need. Xing is a visual query and restructuring language for XML documents. The objective of this project is to develop a basic version of Xing, including a user-oriented XML query interface and a simple...
    Resource Type:
    Capstone Project
    Full Text:
    the two languages and, in particular, to show Xing' s advantages and limits. We use the following

  • Collaborative filtering with probability and collaborative filtering with privacy

    Creator:
    Yang, Min
    Abstract:
    "Collaborative filtering has seen considerable success in the areas regarding information overload and e-commerce, while the current developed systems are flawed in several respects. Two approaches, the distribution-based algorithm and the blurring profile solution, are proposed to address several outstanding issues. The main findings of this research include: • The...
    Resource Type:
    Capstone Project
    Full Text:
    [S-Plus, 2001] ufx +Λ+= µ (2-10) 14 where { }ijλ=Λ is a p×k matrix. f and u are

  • Cluster partitioning approaches to parallel Monte Carlo simulation on multiprocessors

    Creator:
    Ranawake, Udaya A.
    Abstract:
    We consider the parallelization of Monte Carlo algorithms for analyzing numerical models of charge transport used in semiconductor device physics. Parallel algorithms for the standard k-space Monte Carlo simulation of a three band model of bulk GaAs on hypercube multicomputers are first presented. This Monte Carlo model includes scattering due...
    Resource Type:
    Dissertation
    Full Text:
    particle. The constants s and p are determined by fitting a straight line through a set of data points

  • Cross-layer aware routing approach for lifetime maximization in wireless sensor networks with multiple sinks

    Creator:
    Hamid, Arwa Zakaria
    Abstract:
    In wireless sensor networks (WSNs) nodes are battery powered. Therefore, the available energy resources of sensor nodes should be managed efficiently in order to increase the network lifetime. As a result, researchers have proposed routing schemes in order to maximize network lifetime. Even though these schemes increase the network lifetime,...
    Resource Type:
    Masters Thesis
    Full Text:
    following medium contention constraints hold. ∑ k∈S xkij ≤ W − ∑ (p,q)k∈ ⋃ z∈S Ψzij xkpq (4.6) Note

  • Behavior-based mobility prediction for fast handoffs in wireless LANs

    Creator:
    Wanalertlak, Weetit
    Abstract:
    Wireless Networks have been widely adopted into a major part of today's network infrastructure. They have become a popular technology to not only expand the coverage of wired networks but also to interconnect a large wireless network, i.e., wireless mesh networks. As they allow more flexible communication than traditional wired-networks...
    Resource Type:
    Dissertation

  • Active object systems

    Creator:
    Choi, Sungwoon
    Abstract:
    An active object system is a transition-based object-oriented system suitable for the design of various concurrent systems. An AOS consists of a collection of interacting objects, where the behavior of each object is determined by the transition statements provided in the class of that object. A transition statement is a...
    Resource Type:
    Dissertation
    Full Text:
    . QueuingSystem tm ql p 1 q2 un p2 q3 tm Figure 8. Component hierarchy of the queuing system given in

  • Task Grapher : task graph scheduling in multiprocessor computer systems

    Creator:
    Chu, Lee-Jung Julie
    Abstract:
    This report presents a graphical tool for implementation of the scheduling heuristics provided by Kruatrachue. The input of scheduling is a task graph and the output is a schedule in the form of a Gantt chart. The implemented scheduling heuristics are: 1) Hu's HLF (highest level first) algorithm. 2) Yu's...
    Resource Type:
    Capstone Project
    Full Text:
    example N : Node Number S : Node Size C : Communication Delay longest path from the task node to