141 research outputs found

    The ISCIP Analyst, Volume VIII, Issue 16

    Full text link
    This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy

    The ISCIP Analyst, Volume IX, Issue 5

    Full text link
    This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy

    The ISCIP Analyst, Volume VIII, Issue 20

    Full text link
    This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy

    The ISCIP Analyst, Volume IX, Issue 3

    Full text link
    This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy

    The ISCIP Analyst, Volume IX, Issue 4

    Full text link
    This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy

    Temperature of the arterial wall after stent implantation: the role of poststent inflammation

    Get PDF
    This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy

    A study on using genetic niching for query optimisation in document retrieval

    Get PDF
    International audienceThis paper presents a new genetic approach for query optimisation in document retrieval. The main contribution of the paper is to show the effectiveness of the genetic niching technique to reach multiple relevant regions of the document space. Moreover, suitable merging procedures have been proposed in order to improve the retrieval evaluation. Experimental results obtained using a TREC sub-collection indicate that the proposed approach is promising for applications

    Lifelong learning tendency scale: the study of validity and reliability

    Get PDF
    AbstractThe aim of this research is to develop a scale to determine university students’ lifelong learning tendencies. The pre-trial form of Lifelong Tendency Scale (LLTS) containing 74 items was administered to 642 university students and explanatory factor analysis was conducted so as to determine the construct validity. On the data, items that were not significant according to the t value results were deleted from the scale and item-total correlations were also calculated. For concurrent validity, “Curiosity Index” was used and Pearson correlation coefficient having relation with the lack of curiosity sub-dimension of LLTS was found as .76. Consequently, the Cronbach alpha internal consistency coefficient of the ultimate scale containing 27 items and four sub-dimensions (motivation, perseverance, lack of regulating learning, and lack of curiosity) was calculated as .89. All the analyses conducted made it clear that LLTS was valid and reliable as a scale to determine lifelong learning tendencies

    On the ultimate complexity of factorials

    Get PDF
    AbstractIt has long been observed that certain factorization algorithms provide a way to write the product of many different integers succinctly. In this paper, we study the problem of representing the product of all integers from 1 to n (i.e. n!) by straight-line programs. Formally, we say that a sequence of integers an is ultimately f(n)-computable, if there exists a nonzero integer sequence mn such that for any n, anmn can be computed by a straight-line program (using only additions, subtractions and multiplications) of length at most f(n). Shub and Smale [12] showed that if n! is ultimately hard to compute, then the algebraic version of NP≠P is true. Assuming a widely believed number theory conjecture concerning smooth numbers in a short interval, a subexponential upper bound (exp(clognloglogn)) for the ultimate complexity of n! is proved in this paper, and a randomized subexponential algorithm constructing such a short straight-line program is presented as well

    PDB28 Economic Evaluation of Vildagliptin As Add-on Therapy to Metformin in Diabetes Mellitus Treatment in China

    Get PDF
    This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy
    • …
    corecore