Search Constraints

Start Over
Filtering by: Creator Karmarkar, Vidyadhar M. Remove constraint Creator: Karmarkar, Vidyadhar M. Non-Academic Affiliation Oregon State University. Graduate School Remove constraint Non-Academic Affiliation: Oregon State University. Graduate School

Search Results

  • Simple sequence repeat marker development and fingerprinting in Cuphea lanceolata Ait. and C. viscosissima Jacq

    Creator:
    Karmarkar, Vidyadhar M.
    Abstract:
    Microsatellites or simple sequence repeats (SSRs) are highthroughput sequence based DNA markers that have been exploited as tools for measuring genetic distance and diversity in evolutionary studies, protection of intellectual property, genetic resource conservation management, cultivar identification and molecular breeding of crop plants. We isolated and sequenced 1095 clones from...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Vidyadhar M. Karmarkar for the

  • Expert-gate algorithm

    Creator:
    Joshi, Varad Vidyadhar
    Abstract:
    The goal of Inductive Learning is to produce general rules from a set of seen examples, which can then be applied to other unseen examples. ID3 is an inductive learning algorithm that can be used for the classification task. The input to the algorithm is a set of tuples of...
    Resource Type:
    Masters Thesis
    Full Text:
    Varad Vidyadhar Joshi for the degree of Master of Science in Computer Science presented on November 23

  • Extending market potential of blueberries with controlled atmosphere storage

    Creator:
    Boonprasom, Pichaya
    Abstract:
    The goal of this research was to determine if controlled atmosphere (CA) storage could be used to extend the market period of fresh Pacific Northwest blueberries and to evaluate the effects different storage atmospheres have on fruit quality. Furthermore, this research also investigated heat and mass transfer characteristics during cooling...
    Resource Type:
    Dissertation
    Full Text:
    graduate programs. I would like to thank Dr. John P. Bolte and Dr. Paul M. Chen for serving on my

  • Single nucleotide polymorphism diversity in domesticated and wild sunflowers

    Creator:
    Freeman, Carrie
    Abstract:
    Single nucleotide polymorphisms (SNPs) are the most common DNA polymorphisms in plant and animal genomes. SNPs were identified in the allele sequences of up to 12 sunflower (Helianthus annuus L.) genotypes for a genome-wide sample of 81 loci originally mapped using restriction fragment length polymorphism (RFLP) markers. The RFLP loci...
    Resource Type:
    Masters Thesis
    Full Text:
    , Felix Schuppert, Guillermo Pizarro, and Vidyadhar Karmarkar. In particular I thank Dr. Mary Slabaugh

  • A survey of linear programming algorithms

    Creator:
    Maurer, Roger J. (Roger Joseph), 1962-
    Abstract:
    Linear programming is a recent development in the field of Mathematics having its origin in the past seventy-five years. The purpose of this study was to identify several methods for solving linear programming problems. The algorithm for each of the methods is described in detail along with an analysis of...
    Resource Type:
    Masters Thesis
    Full Text:
    constraint equations. The first m of these constraint equations are generally referred to as the functional

  • Breeding tools for Cuphea : An updated genetic linkage map and fatty acid mutant candidate gene analysis

    Creator:
    Powers, Carol Anne
    Abstract:
    Medium chain fatty acids (MCFAs) are important industrial feedstocks for soaps, detergents and surfactants. Interspecific lines derived from Cuphea lanceolata and Cup hea viscosissima are being domesticated as a temperate source of MCFAs. These species also serve as model organisms for understanding the biosynthesis of MCFAs in seeds. Various markers...
    Resource Type:
    Masters Thesis
    Full Text:
    , notably with the addition of recently developed simple sequence repeat (SSR, Karmarkar 2004) and the

  • HELM, hierarchical environment for linear modeling

    Creator:
    Brown, Carol E.
    Abstract:
    Several problems relating to linear programming modeling have been identified: (1) model formulation, validation and explanation are difficult and time consuming; (2) models must be frequently updated and debugged; (3) flexibility is needed to specify the model schema for a class of problems as a group; and (4) significant differences...
    Resource Type:
    Dissertation
    Full Text:
    and Conversion to M.P.S. Format . . 81 4.6.1 Acquiring Data with M-ECR 81 4.6.2 Combining Schema and

  • Mass transfer characteristics of fresh fruits stored in regular and controlled atmosphere conditions

    Creator:
    Hatch, Wayne E.
    Resource Type:
    Masters Thesis
    Full Text:
    crops is: * = VPs " Pa) (1) where: m = transpiration rate, (mg/skg or mg/sm2) K,,, — overall

  • Optimizing spatial and temporal aspects of nature reserve design under economic and ecological objectives

    Creator:
    Nalle, Darek J.
    Abstract:
    Alteration of natural areas in attempts to support increasing human populations has been a crucial yet less publicized contributor to the fall of many of the world's greatest civilizations, since healthy ecosystems can help maintain stable societies and economies. Given this unhappy fact and the ancient relationship between people and...
    Resource Type:
    Dissertation
    Full Text:
    alternative exact algorithms to solve linear programs (Karmarkar 1984)). These traditional solution methods

  • 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:
    finds vector x that minimizes T Z = C x, subject to Ax = b, x >= 0 where A is a matrix of m*n (n > m