Search Constraints

Start Over
Filtering by: DOI 10.1186/gb-2013-14-8-r85 Remove constraint DOI: 10.1186/gb-2013-14-8-r85 Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella

Search Results

  • Empirical study - pairwise prediction of fault based on coverage

    Creator:
    Shamasunder, Shalini
    Abstract:
    Researchers/engineers in the field of software testing have valued coverage as a testing metric for decades now. There have been various empirical results that have shown that as coverage increases the ability of the test program to detect a fault also increases. As a result numerous coverage techniques have been...
    Resource Type:
    Masters Thesis
    Full Text:
    degree of Master of Science Presented June 14, 2012 Commencement June 2013 Master of Science thesis

  • 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:
    Doctor of Philosophy in Computer Science presented on September 14, 2011. Title: Optimal Load and

  • Software composition with extended entity-relationship diagrams

    Creator:
    Muenchaisri, Pornsiri
    Abstract:
    I introduce a compositional approach to application software development. In this approach, an extended entity-relationship diagram (EERD), which represents the component types and the relationship types within an application domain, is used as a template of executable programs in that application domain. As we use structural active objects as the...
    Resource Type:
    Dissertation
    Full Text:
    Computer Science presented on November 14, 1997. Title: Software Composition with Extended Entity

  • Java/MP : A Multiparadigm Programming Language

    Creator:
    Naik, Roshan
    Abstract:
    In this report we present Java/MP, a multiparadigm language designed as an extension to Java. Java/MP is an upward compatible superset of Java and incorporates the object oriented, functional and logical paradigms. Java/MP programs are compatible with the standard Java virtual machine. Many of the ideas in Java/MP have been...
    Resource Type:
    Capstone Project and Presentation

  • 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:
    for the degree of Master of Science in Computer Science presented on June 4, 2013. Title: Cross

  • 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:
    Electrical and Computer Engineering presented on June 10, 2013. Title: Adiabatic Markov Decision Process

  • 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

  • Security protocols for linear network coding

    Creator:
    Adeli, Majid
    Abstract:
    Network coding, as the next generation of data routing protocols, enables each intermediate node in a network to process and encode its received data before forwarding it to the next nodes. Hence, the core idea in network coding is to allow a network to encode the data that is being...
    Resource Type:
    Dissertation
    Full Text:
    Doctor of Philosophy in Electrical and Computer Engineering presented on June 11, 2013. Title: Security

  • AOPS : an abstraction oriented programming system for literate programming

    Creator:
    Shum, Stephen M.
    Abstract:
    The practice of literate programming is not widespread because existing literate programming systems have some undesirable characteristics such as programming language and text processor dependence and lack of flexible tools for viewing and manipulation of the source file. This dissertation describes the literate programming system AOPS (Abstraction Oriented Programming System)...
    Resource Type:
    Dissertation
    Full Text:
    BIBLIOGRAPHY 121 APPENDICES APPENDIX A AOPS 8-QUEENS SOURCE FILE 127 APPENDIX B AOP 8-QUEENS OUTPUT FILE 138

  • 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:
    of The Decomposed Simplex Algorithm 4 8 3.4. Straightforward Parallelization Algorithm 4 9 3.5