Search Constraints

Start Over
Filtering by: Creator Osborn, T. R. Remove constraint Creator: Osborn, T. R. Committee Member Nguyen, Thinh Remove constraint Committee Member: Nguyen, Thinh Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • On edge disjoint Hamiltonian cycles in torus and Gaussian networks

    Creator:
    Alazemi, Fawaz M.
    Abstract:
    Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis,...
    Resource Type:
    Masters Thesis
    Full Text:
    . 2.2.1 n = 2r EDHC on T nk where r ≥ 0 and k ≥ 3 In [5], the authors presented a recurrence function to

  • Diversity combining ARQ over the m(> 2)-ary unidirectional channel

    Creator:
    Elarief, Noha
    Abstract:
    In diversity combining automatic repeat request (ARQ), erroneous packets are combined together forming a single, more reliable, packet. In this thesis, we give a diversity combining scheme for the m-ary unidirectional channel. A system using the given scheme with a t-unidirectional error detecting code is able to correct up to...
    Resource Type:
    Masters Thesis
    Full Text:
    given scheme with a t-unidirectional error detecting code is able to correct up to Emax = ⌊ t 2

  • Limited magnitude error control codes

    Creator:
    Elarief, Noha
    Abstract:
    A relatively new model of error control is the limited magnitude error over high radix channels. In this error model, the error magnitude does not exceed a certain limit known beforehand. In this dissertation, we study systematic error control codes for common channels under the assumption that the maximum error...
    Resource Type:
    Dissertation
    Full Text:
    minimum pos- sible redundancy when kl + l(q r−1 q−1 ) < q r. Then we study the t error detecting prob

  • Some communication algorithms for Gaussian and Eisenstein-Jacobi networks

    Creator:
    Albader, Bader
    Abstract:
    Interconnection networks play important roles in designing high performance computers. Recently two new classes of interconnection networks based on the concept of Gaussian and Eisenstein-Jacobi integers were introduced. In this research, efficient routing and broadcasting algorithms for these networks are developed. Furthermore, constructing edge disjoint Hamiltonian cycles in Gaussian networks...
    Resource Type:
    Dissertation
    Full Text:
    ),…,(r-2j+1,-2j) Step 2 j=1,2,...,t-1 -(2j+1) (r-2j+1,-(2j+1)),(r-2j+2,-(2j+1)),…,(r-2j-3,-(2j+1

  • Convergence Analysis Framework for Fixed-Point Algorithms in Machine Learning and Signal Processing

    Creator:
    Vu, Trung
    Abstract:
    Iterative algorithms are simple yet efficient in solving large-scale optimization problems in practice. With a surge in the amount of data in past decades, these methods have become increasingly important in many application areas including matrix/tensor recovery, deep learning, data mining, and reinforcement learning. To optimize or improve iterative algorithms,...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 210 6.4 Perturbation Expansions for the r-TSVD . . . . . . . . . . . . . . . . 216 6.5 Error Bounds

  • On shortest disjoint paths and Hamiltonian cycles in some interconnection networks

    Creator:
    Hussain, Zaid
    Abstract:
    Parallel processors are classified into two classes: shared-memory multiprocessors and distributed- memory multiprocessors. In the shared-memory system, processors communicate through a common memory unit. However, in the distributed multiprocessor system, each processor has its own memory unit and the communications among the processors are performed through an interconnection network. Thus,...
    Resource Type:
    Dissertation
    Full Text:
    Cycles in Qp, p is Odd and ⌈p2⌉ is Even. r = i− j 2 , s = i− p−j2 , and t = i− j+1 2

  • Gray codes and their applications

    Creator:
    Anantha, Madhusudhanan
    Abstract:
    An n-bit Gray code is an ordered set of all 2n binary strings of length n. The special property of this listing is that Hamming distance between consecutive vectors is exactly 1. If the last and first codeword also have a Hamming distance 1 then the code is said to...
    Resource Type:
    Dissertation
    Full Text:
    be extended to higher radices (k ≥ 4 and k = 2r) for some r, r > 2. The approach we use to solve

  • Data processing for anomaly detection in web-based applications

    Creator:
    Gaarudapuram Sriraghavan, Rajagopal
    Abstract:
    Web applications are popular attack targets. Misuse detection systems use signature databases to detect known attacks. However, it is difficult to keep the database up to date with the rate of discovery of vulnerabilities. They also cannot detect zero-day attacks. By contrast, anomaly detection systems learn the normal behavior of...
    Resource Type:
    Masters Thesis

  • Predicting and Improving Throughput, Responsiveness and Battery Life of Computer Systems by Machine Learning

    Creator:
    Li, Yunfan
    Abstract:
    The Machine Learning (ML) algorithms are increasingly explored in varies of fields including designing and optimizing computer systems. Recent research, such as optimizing memory/cache prefetching by ML training or predicting traffic pattern in throughput processors, also exhibits a promising future of introducing ML into computer system design and optimization. Throughput...
    Resource Type:
    Dissertation
    Full Text:
    EIRs. 22 R RR Router Cache Bank R NI R R R Figure 3.7: Different examples of a 4-EIR group