858 research outputs found

    Faster Deterministic Algorithms for Packing, Matching and tt-Dominating Set Problems

    Full text link
    In this paper, we devise three deterministic algorithms for solving the mm-set kk-packing, mm-dimensional kk-matching, and tt-dominating set problems in time O(5.44mk)O^*(5.44^{mk}), O(5.44(m1)k)O^*(5.44^{(m-1)k}) and O(5.44t)O^*(5.44^{t}), respectively. Although recently there has been remarkable progress on randomized solutions to those problems, our bounds make good improvements on the best known bounds for deterministic solutions to those problems.Comment: ISAAC13 Submission. arXiv admin note: substantial text overlap with arXiv:1303.047

    The Complexity of Testing Monomials in Multivariate Polynomials

    Full text link
    The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its sum-product expansion. The complexity aspects of this problem and its variants are investigated with two folds of objectives. One is to understand how this problem relates to critical problems in complexity, and if so to what extent. The other is to exploit possibilities of applying algebraic properties of polynomials to the study of those problems. A series of results about ΠΣΠ\Pi\Sigma\Pi and ΠΣ\Pi\Sigma polynomials are obtained in this paper, laying a basis for further study along this line

    An empirical examination on the links of cross-functional integration of productionmarketing, BTO competitiveness and performance

    Get PDF
    Purpose – This paper is to explore how cross-functional integration (CFI) of production-marketing can impact the firm’s build-to-order (BTO) competitiveness, marketing performance (MP) and financial performance (FP). Design/methodology/approach – Empirical study with the structural equation modeling approach is applied. Six hypotheses are constructed and tested based on survey data collected from Chinese manufacturing firms. Findings – The survey data supports that production-marketing integration (PMI) improves BTO competitiveness (BTOC) and MP and that BTOC also positively affects marketing outcome which, in turn, impacts a firm’s FP. The results reveal that CFI of production-marketing is an effective approach for achieving the BTO manufacturing strategy and can improve organizational performance. Originality/value – The paper uncovers the role of CFI of production-marketing in BTO manufacturing strategy and its impacts on a firm’s MP and FP and provides important managerial implications for practitioners to improve organizational time-based competitiveness and performance in today’s time-based competition era.info:eu-repo/semantics/publishedVersio

    Research on energy-efficient VLSI decoder for LDPC code

    Get PDF
    制度:新 ; 報告番号:甲3742号 ; 学位の種類:博士(工学) ; 授与年月日:2012/9/15 ; 早大学位記番号:新6113Waseda Universit

    A quadratic lower bound for Rocchio’s similarity-based relevance feedback algorithm with a fixed query updating factor

    Get PDF
    Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised learning algorithm from examples. In practice, Rocchio’s algorithm often uses a fixed query updating factor. When this is the case, we strengthen the linear Ω(n) lower bound obtained by Chen and Zhu (Inf. Retr. 5:61–86, 2002) and prove that Rocchio’s algorithm makes Ω(k(n−k)) mistakes in searching for a collection of documents represented by a monotone disjunction of k relevant features over the n-dimensional binary vector space {0,1}n, when the inner product similarity measure is used. A quadratic lower bound is obtained when k is linearly proportional to n. We also prove an O(k(n−k)3) upper bound for Rocchio’s algorithm with the inner product similarity measure in searching for such a collection of documents with a constant query updating factor and a zero classification threshold

    iJTyper: An Iterative Type Inference Framework for Java by Integrating Constraint- and Statistically-based Methods

    Full text link
    Inferring the types of API elements in incomplete code snippets (e.g., those on Q&A forums) is a prepositive step required to work with the code snippets. Existing type inference methods can be mainly categorized as constraint-based or statistically-based. The former imposes higher requirements on code syntax and often suffers from low recall due to the syntactic limitation of code snippets. The latter relies on the statistical regularities learned from a training corpus and does not take full advantage of the type constraints in code snippets, which may lead to low precision. In this paper, we propose an iterative type inference framework for Java, called iJTyper, by integrating the strengths of both constraint- and statistically-based methods. For a code snippet, iJTyper first applies a constraint-based method and augments the code context with the inferred types of API elements. iJTyper then applies a statistically-based method to the augmented code snippet. The predicted candidate types of API elements are further used to improve the constraint-based method by reducing its pre-built knowledge base. iJTyper iteratively executes both methods and performs code context augmentation and knowledge base reduction until a termination condition is satisfied. Finally, the final inference results are obtained by combining the results of both methods. We evaluated iJTyper on two open-source datasets. Results show that 1) iJTyper achieves high average precision/recall of 97.31% and 92.52% on both datasets; 2) iJTyper significantly improves the recall of two state-of-the-art baselines, SnR and MLMTyper, by at least 7.31% and 27.44%, respectively; and 3) iJTyper improves the average precision/recall of the popular language model, ChatGPT, by 3.25% and 0.51% on both datasets

    Roles of arabidopsis WRKY18, WRKY40 and WRKY60 transcription factors in plant responses to abscisic acid and abiotic stress

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>WRKY transcription factors are involved in plant responses to both biotic and abiotic stresses. Arabidopsis WRKY18, WRKY40, and WRKY60 transcription factors interact both physically and functionally in plant defense responses. However, their role in plant abiotic stress response has not been directly analyzed.</p> <p>Results</p> <p>We report that the three WRKYs are involved in plant responses to abscisic acid (ABA) and abiotic stress. Through analysis of single, double, and triple mutants and overexpression lines for the WRKY genes, we have shown that <it>WRKY18 </it>and <it>WRKY60 </it>have a positive effect on plant ABA sensitivity for inhibition of seed germination and root growth. The same two WRKY genes also enhance plant sensitivity to salt and osmotic stress. <it>WRKY40</it>, on the other hand, antagonizes <it>WRKY18 </it>and <it>WRKY60 </it>in the effect on plant sensitivity to ABA and abiotic stress in germination and growth assays. Both <it>WRKY18 </it>and <it>WRKY40 </it>are rapidly induced by ABA, while induction of <it>WRKY60 </it>by ABA is delayed. ABA-inducible expression of <it>WRKY60 </it>is almost completely abolished in the <it>wrky18 </it>and <it>wrky40 </it>mutants. WRKY18 and WRKY40 recognize a cluster of W-box sequences in the <it>WRKY60 </it>promoter and activate WRKY60 expression in protoplasts. Thus, <it>WRKY60 </it>might be a direct target gene of WRKY18 and WRKY40 in ABA signaling. Using a stable transgenic reporter/effector system, we have shown that both WRKY18 and WRKY60 act as weak transcriptional activators while WRKY40 is a transcriptional repressor in plant cells.</p> <p>Conclusions</p> <p>We propose that the three related WRKY transcription factors form a highly interacting regulatory network that modulates gene expression in both plant defense and stress responses by acting as either transcription activator or repressor.</p
    corecore