1,427 research outputs found

    Specific TATAA and bZIP requirements suggest that HTLV-I Tax has transcriptional activity subsequent to the assembly of an initiation complex

    Get PDF
    BACKGROUND: Human T-cell leukemia virus type I (HTLV-I) Tax protein is a transcriptional regulator of viral and cellular genes. In this study we have examined in detail the determinants for Tax-mediated transcriptional activation. RESULTS: Whereas previously the LTR enhancer elements were thought to be the sole Tax-targets, herein, we find that the core HTLV-I TATAA motif also provides specific responsiveness not seen with either the SV40 or the E1b TATAA boxes. When enhancer elements which can mediate Tax-responsiveness were compared, the authentic HTLV-I 21-bp repeats were found to be the most effective. Related bZIP factors such as CREB, ATF4, c-Jun and LZIP are often thought to recognize the 21-bp repeats equivalently. However, amongst bZIP factors, we found that CREB, by far, is preferred by Tax for activation. When LTR transcription was reconstituted by substituting either κB or serum response elements in place of the 21-bp repeats, Tax activated these surrogate motifs using surfaces which are different from that utilized for CREB interaction. Finally, we employed artificial recruitment of TATA-binding protein to the HTLV-I promoter in "bypass" experiments to show for the first time that Tax has transcriptional activity subsequent to the assembly of an initiation complex at the promoter. CONCLUSIONS: Optimal activation of the HTLV-I LTR by Tax specifically requires the core HTLV-I TATAA promoter, CREB and the 21-bp repeats. In addition, we also provide the first evidence for transcriptional activity of Tax after the recruitment of TATA-binding protein to the promoter

    Validation of the perceived stress scale (Pss-10) in medical and health sciences students in Hong Kong

    Get PDF
    INTRODUCTION: The demanding nature of medical and health sciences studies can cause stress among students in these disciplines affecting their wellbeing and academic performance. The Perceived Stress Scale (PSS-10) is a widely used measure of perceived stress among medical students and healthcare professionals that has not yet been validated among medical and health sciences students in Hong Kong. The aim of this study is to establish the construct validity and reliability of the PSS-10 in this context. METHODS: 267 final year medical and health sciences students were surveyed using the PSS-10. The data were analysed using exploratory factor analysis for construct validity and Cronbach’s alpha coefficient and corrected item-total correlations for reliability. RESULTS: Exploratory factor analysis revealed a two-factor structure for PSS-10, with Cronbach’s alpha of 0.865 and 0.796, indicating good internal consistency. Corrected item-total correlations showed satisfactory correlation ranged from 0.539 to 0.748 for all items and their respective subscale. Both tests supported PSS-10 as a two-factor scale. CONCLUSIONS: The PSS-10 is a valid measure for assessing perceived stress in Hong Kong medical and health sciences students

    Recurrent airway obstructions in a patient with benign tracheal stenosis and a silicone airway stent: a case report

    Get PDF
    Airway stents (silicone and metal stents) are used to treat patients with benign tracheal stenosis, who are symptomatic and in whom tracheal surgical reconstruction has failed or is not appropriate. However airway stents are often associated with complications such as migration, granuloma formation and mucous hypersecretion, which cause significant morbidity, especially in patients with benign tracheal stenosis and relatively normal life expectancy. We report a patient who had frequent critical airway obstructions over 8 years due to granuloma and mucus hypersecretion in a silicone airway stent. The problem was resolved when the silicone stent was removed and replaced with a covered self expanding metal stent

    Non-polynomial Worst-Case Analysis of Recursive Programs

    Full text link
    We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions. We show that measure functions provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in nonpolynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form O(nlogn)\mathcal{O}(n\log n) as well as O(nr)\mathcal{O}(n^r) where rr is not an integer. We present experimental results to demonstrate that our approach can obtain efficiently worst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the divide-and-conquer algorithm for the Closest-Pair problem, where we obtain O(nlogn)\mathcal{O}(n \log n) worst-case bound, and (ii) Karatsuba's algorithm for polynomial multiplication and Strassen's algorithm for matrix multiplication, where we obtain O(nr)\mathcal{O}(n^r) bound such that rr is not an integer and close to the best-known bounds for the respective algorithms.Comment: 54 Pages, Full Version to CAV 201

    Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation

    Get PDF
    Symbolic execution is a well established method for test input generation. Despite of having achieved tremendous success over numerical domains, existing symbolic execution techniques for heap-based programs are limited due to the lack of a succinct and precise description for symbolic values over unbounded heaps. In this work, we present a new symbolic execution method for heap-based programs based on separation logic. The essence of our proposal is context-sensitive lazy initialization, a novel approach for efficient test input generation. Our approach differs from existing approaches in two ways. Firstly, our approach is based on separation logic, which allows us to precisely capture preconditions of heap-based programs so that we avoid generating invalid test inputs. Secondly, we generate only fully initialized test inputs, which are more useful in practice compared to those partially initialized test inputs generated by the state-of-the-art tools. We have implemented our approach as a tool, called Java StarFinder, and evaluated it on a set of programs with complex heap inputs. The results show that our approach significantly reduces the number of invalid test inputs and improves the test coverage
    corecore