Kent State University

Kent State University
Not a member yet
    2199 research outputs found

    TechKNOW Volume 11, Issue 4

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/techknow/16/thumbnail.jp

    The Kovacs Guide to Electronic Library Collection Development: Essential Core Subject Collections, Selection Criteria, and Guidelines

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/facultybooks/114/thumbnail.jpgCovers how to build an electronic library and how to update and expand it. Each chapter addresses selecting and evaluating web-based resources in subject areas such as business, social science, health, medicine and law, and offers guidelines for an electronic library collection development plan.</p

    ICON Fall 2004

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/icon/vol39/iss3/1/thumbnail.jp

    The Kent Trumbull Gander, Vol. 3, Issue 8

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/node/10053/10087-thumbnail.jpgVolume 3, Issue 8 Dated August 30, 2004</p

    TechKNOW Volume 10, Issue 2

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/techknow/18/thumbnail.jp

    Fusion Fall 2004

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/fusion/2/thumbnail.jp

    TechKNOW Volume 10, Issue 1

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/techknow/17/thumbnail.jp

    A-kinase Anchoring Protein Targeting of Protein Kinase A in the Heart

    No full text
    There is increasing evidence that subcellular targeting of signaling molecules is an important means of regulating the protein kinase A (PKA) pathway. Subcellular organization of the signaling molecules in the PKA pathway insures that a signal initiated at the receptor level is transferred efficiently to a PKA substrate eliciting some cellular response. This subcellular targeting appears to regulate the function of a highly specialized cell such as the cardiac myocyte. This review focuses on A-kinase anchoring proteins (AKAPs) which are expressed in the heart. It has been determined that, of the approximately 13 different AKAPs expressed in cardiac tissue, several of these are expressed in cardiac myocytes. These AKAPs bind several PKA substrates and some appear to regulate PKA-dependent phosphorylation of these substrates. AKAP tethering of PKA may be essential for efficient regulation of cardiac muscle contraction. The ability of an AKAP to anchor PKA may be altered in the failing heart, thus compromising the ability of the myocyte to respond to stimuli which elicit the PKA pathway.</p

    The Kent Trumbull Gander, Vol. 3, Issue 9

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/node/10055/10090-thumbnail.jpgVolume 3, Issue 9 Dated October 20, 2004</p

    Solving a 2D Knapsack Problem Using a Hybrid Data-Parallel/Control Style of Computing

    No full text
    https://kent-islandora.s3.us-east-2.amazonaws.com/node/16805/87475-thumbnail.jpgThis paper describes a parallel solution of the sequential dynamic programming method for solving a NP class, 2D knapsack (or cutting-stock) problem which is the optimal packing of multiples of n rectangular objects into a knapsack of size LW×and are only obtainable with guillotine-type (side to side) cuts. Here, we describe and analyze this problem for the associative model. Since the introduction of associative SIMD computers over a quarter of a century ago, associative computing and the data-parallel paradigm remain popular. The MASC (Multiple instruction stream ASsociative Computer) parallel model supports a generalized version of an associative style of computing. This model supports data parallelism, constant time maximum and minimum operations, one or more instruction streams (ISs) which are sent to an equal number of partition sets of processors, and assignment of tasks to ISs using control parallelism. We solve this NP class problem with a parallel algorithm that runs in O(W(n+L+W)) time using L processors, where L≥W for a 2D knapsack problem with a capacity of L×W. The new multiple IS version using LW processors and max{L,M} ISs runs in O(n+L+W) given practical hardware considerations. Both of these results are cost optimal with respect to the best sequential implementation. &nbsp;Moreover, an efficient MASC algorithm for this well-known problem should give insight to how the associative model compares to other parallel models such as PRAM.</p

    0

    full texts

    2,199

    metadata records
    Updated in last 30 days.
    Kent State University
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇