<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 01:49:22 BST</pubDate>


	<title>CiteULike: Author Callan</title>
	<description>CiteULike: Author Callan</description>


	<link>http://www.citeulike.org/author/Callan</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/pdovy/article/3064656"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/abellogin/article/3032033"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/HugoMarcelo/article/3044182"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/abellogin/article/3007976"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/awarlau/article/2996815"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/abellogin/article/2996213"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/ctl/article/2761664"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/JoseluisGonzalez/article/867188"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mediallo/article/2713169"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/adick/article/2698731"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dah44/article/2264181"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/emptyhb/article/1032936"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/spiritblue/article/2281691"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mj23/article/2538730"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/sugarexpletive/article/1523864"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/sugarexpletive/article/1523414"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/sugarexpletive/article/2407896"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/sugarexpletive/article/2407895"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/codex/article/2397387"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/jsanpedro/article/2295285"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/jsanpedro/article/2295267"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/arjen/article/2264160"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/bundschu/article/1088607"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/navil/article/2188649"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/kirstine/article/1734934"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/toine/article/984159"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/pprett/article/1652856"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/jelsas/article/1176899"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/birkok/article/1974581"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/zeze/article/1956290"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dsquared/article/1948006"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/ssn/article/1907031"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/codex/article/1894136"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/kah/article/1815232"/>
        <rdf:li rdf:resource="http://www.citeulike.org/group/3260/article/1776619"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/rayzhang/article/141094"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/rayzhang/article/1561946"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/rayzhang/article/1734787"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/cmmorel/article/1656435"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/kaineci/article/1561957"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/kaineci/article/1523417"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/kaineci/article/1523411"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/rcarlton/article/1477171"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/tolosoft/article/1342120"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/tolosoft/article/1341075"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/tolosoft/article/340788"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/giorgis/article/1466101"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/zeze/article/1429764"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/AlisonBabeu/article/1108820"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/vitalaswp4/article/1088603"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/pdovy/article/3064656">
    <title>Retrieval and feedback models for blog feed search</title>
    <link>http://www.citeulike.org/user/pdovy/article/3064656</link>
    <description>&lt;i&gt;(2008), pp. 347-354.&lt;/i&gt;</description>
    <dc:title>Retrieval and feedback models for blog feed search</dc:title>

    <dc:creator>Jonathan Elsas</dc:creator>
    <dc:creator>Jaime Arguello</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>Jaime Carbonell</dc:creator>
    <dc:identifier>doi:10.1145/1390334.1390394</dc:identifier>
    <dc:source>(2008), pp. 347-354.</dc:source>
    <dc:date>2008-07-31T06:07:20-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:startingPage>347</prism:startingPage>
    <prism:endingPage>354</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/abellogin/article/3032033">
    <title>The impact of history length on personalized search</title>
    <link>http://www.citeulike.org/user/abellogin/article/3032033</link>
    <description>&lt;i&gt;(2008), pp. 715-716.&lt;/i&gt;</description>
    <dc:title>The impact of history length on personalized search</dc:title>

    <dc:creator>Yangbo Zhu</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>Jaime Carbonell</dc:creator>
    <dc:identifier>doi:10.1145/1390334.1390466</dc:identifier>
    <dc:source>(2008), pp. 715-716.</dc:source>
    <dc:date>2008-07-22T08:09:23-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:startingPage>715</prism:startingPage>
    <prism:endingPage>716</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>analysis</prism:category>
    <prism:category>ir</prism:category>
    <prism:category>personalisation</prism:category>
    <prism:category>poster</prism:category>
    <prism:category>sigir</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/HugoMarcelo/article/3044182">
    <title>Specificity of T cells in synovial fluid: high frequencies of CD8(+) T cells that are specific for certain viral epitopes.</title>
    <link>http://www.citeulike.org/user/HugoMarcelo/article/3044182</link>
    <description>&lt;i&gt;Arthritis research, Vol. 2, No. 2. (2000), pp. 154-164.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;INTRODUCTION: Epstein-Barr virus (EBV) is transmitted orally, replicates in the oropharynx and establishes life-long latency in human B lymphocytes. T-cell responses to latent and lytic/replicative cycle proteins are readily detectable in peripheral blood from healthy EBV-seropositive individuals. EBV has also been detected within synovial tissue, and T-cell responses to EBV lytic proteins have been reported in synovial fluid from a patient with rheumatoid arthritis (RA). This raises the question regarding whether T cells specific for certain viruses might be present at high frequencies within synovial fluid and whether such T cells might be activated or able to secrete cytokines. If so, they might play a 'bystander' role in the pathogenesis of inflammatory joint disease. OBJECTIVES: To quantify and characterize T cells that are specific for epitopes from EBV, cytomegalovirus (CMV) and influenza in peripheral blood and synovial fluid from patients with arthritis. Methods: Peripheral blood mononuclear cells (PBMCs) and synovial fluid mononuclear cells (SFMCs) were obtained from patients with inflammatory arthritis (including those with RA, osteoarthritis, psoriatic arthritis and reactive arthritis). Samples from human leucocyte antigen (HLA)-A2-positive donors were stained with fluorescent-labelled tetramers of HLA-A2 complexed with the GLCTLVAML peptide epitope from the EBV lytic cycle protein BMLF1, the GILGFVFTL peptide epitope from the influenza A matrix protein, or the NLVPMVATV epitope from the CMV pp65 protein. Samples from HLA-B8-positive donors were stained with fluorescent-labelled tetramers of HLA-B8 complexed with the RAKFKQLL peptide epitope from the EBV lytic protein BZLF1 or the FLRGRAYGL peptide epitope from the EBV latent protein EBNA3A. All samples were costained with an antibody specific for CD8. CD4+ T cells were not analyzed. Selected samples were costained with antibodies specific for cell-surface glycoproteins, in order to determine the phenotype of the T cells within the joint and the periphery. Functional assays to detect release of IFN- or tumour necrosis factor (TNF)- were also performed on some samples. RESULTS: The first group of 15 patients included 10 patients with RA, one patient with reactive arthritis, one patient with psoriatic arthritis and three patients with osteoarthritis. Of these, 11 were HLA-A2 positive and five were HLA-B8 positive. We used HLA-peptide tetrameric complexes to analyze the frequency of EBV-specific T cells in PBMCs and SFMCs (Figs 1 and 2). Clear enrichment of CD8+ T cells specific for epitopes from the EBV lytic cycle proteins was seen within synovial fluid from almost all donors studied, including patients with psoriatic arthritis and osteoarthritis and those with RA. In donor RhA6, 9.5% of CD8+ SFMCs were specific for the HLA-A2 restricted GLCTLVAML epitope, compared with 0.5% of CD8+ PBMCs. Likewise in a donor with osteoarthritis (NR4), 15.5% of CD8+ SFMCs were specific for the HLA-B8-restricted RAKFKQLL epitope, compared with 0.4% of CD8+ PBMCs. In contrast, we did not find enrichment of T cells specific for the HLA-B8-restricted FLRGRAYGL epitope (from the latent protein EBNA3A) within SFMCs compared with PBMCs in any donors. In selected individuals we performed ELISpot assays to detect IFN- secreted by SFMCs and PBMCs after a short incubation in vitro with peptide epitopes from EBV lytic proteins. These assays confirmed enrichment of T cells specific for epitopes from EBV lytic proteins within synovial fluid and showed that subpopulations of these cells were able to secrete proinflammatory cytokines after short-term stimulation. We used a HLA-A2/GILGFVFTL tetramer to stain PBMCs and SFMCs from six HLA-A2-positive patients. The proportion of T cells specific for this influenza epitope was low (&#60;0.2%) in all donors studied, and we did not find any enrichment within SFMCs. We had access to SFMCs only from a second group of four HLA-A2-positive patients with RA. A tetramer of HLA-A2 complexed to the NLVPMVATV epitope from the CMV pp65 protein reacted with subpopulations of CD8+ SFMCs in all four donors, with frequencies of 0.2, 0.5, 2.3 and 13.9%. SFMCs from all four donors secreted TNF after short-term incubation with COS cells transfected with HLA-A2 and pp65 complementary DNA. We analyzed the phenotype of virus-specific cells within PBMCs and SFMCs in three donors. The SFMC virus-specific T cells were more highly activated than those in PBMCs, as evidenced by expression of high levels of CD69 and HLA-DR. A greater proportion of SFMCs were CD38+, CD62L low, CD45RO bright, CD45RA dim, CD57+ and CD28- when compared with PBMCs. Discussion:This work shows that T cells specific for certain epitopes from viral proteins are present at very high frequencies (up to 15.5% of CD8+ T cells) within SFMCs taken from patients with inflammatory joint disease. This enrichment does not reflect a generalized enrichment for the 'memory pool' of T cells; we did not find enrichment of T cells specific for the GILGFVFTL epitope from influenza A or for the FLRGRAYGL epitope from the EBV latent protein EBNA3A, whereas we found clear enrichment of T cells specific for the GLCTLVAML epitope from the EBV lytic protein BMLF1 and for the RAKFKQLL epitope from the EBV lytic protein BZLF1. The enrichment might reflect preferential recruitment of subpopulations of virus-specific T cells, perhaps based on expression of selectins, chemokine receptors or integrins. Alternatively, T cells specific for certain viral epitopes may be stimulated to proliferate within the joint, by viral antigens themselves or by cross-reactive self-antigens. Finally, it is theoretically possible that subpopulations of T cells within the joint are preferentially protected from apoptotic cell death. Whatever the explanation, the virus-specific T cells are present at high frequency, are activated and are able to secrete proinflammatory cytokines. They could potentially interact with synoviocytes and contribute to the maintenance of inflammation within joints in many different forms of inflammatory arthritis.</description>
    <dc:title>Specificity of T cells in synovial fluid: high frequencies of CD8(+) T cells that are specific for certain viral epitopes.</dc:title>

    <dc:creator>LC Tan</dc:creator>
    <dc:creator>AG Mowat</dc:creator>
    <dc:creator>C Fazou</dc:creator>
    <dc:creator>T Rostron</dc:creator>
    <dc:creator>H Roskell</dc:creator>
    <dc:creator>PR Dunbar</dc:creator>
    <dc:creator>C Tournay</dc:creator>
    <dc:creator>F Romagné</dc:creator>
    <dc:creator>MA Peyrat</dc:creator>
    <dc:creator>E Houssaint</dc:creator>
    <dc:creator>M Bonneville</dc:creator>
    <dc:creator>AB Rickinson</dc:creator>
    <dc:creator>AJ McMichael</dc:creator>
    <dc:creator>MF Callan</dc:creator>
    <dc:source>Arthritis research, Vol. 2, No. 2. (2000), pp. 154-164.</dc:source>
    <dc:date>2008-07-26T02:45:36-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:publicationName>Arthritis research</prism:publicationName>
    <prism:issn>1465-9905</prism:issn>
    <prism:volume>2</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>154</prism:startingPage>
    <prism:endingPage>164</prism:endingPage>
    <prism:category>cd8_t_cell</prism:category>
    <prism:category>inflammatory_arthritis</prism:category>
    <prism:category>tania_tb_paper</prism:category>
    <prism:category>virology</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/abellogin/article/3007976">
    <title>Experiments Using the Lemur Toolkit</title>
    <link>http://www.citeulike.org/user/abellogin/article/3007976</link>
    <description>&lt;i&gt;(2001)&lt;/i&gt;</description>
    <dc:title>Experiments Using the Lemur Toolkit</dc:title>

    <dc:creator>Paul Ogilvie</dc:creator>
    <dc:creator>James Callan</dc:creator>
    <dc:source>(2001)</dc:source>
    <dc:date>2008-07-16T10:07:50-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:category>definition</prism:category>
    <prism:category>ir</prism:category>
    <prism:category>lemur</prism:category>
    <prism:category>trec</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/awarlau/article/2996815">
    <title>An auditory-feedback-based neural network model of speech production that is robust to developmental changes in the size and shape of the articulatory system.</title>
    <link>http://www.citeulike.org/user/awarlau/article/2996815</link>
    <description>&lt;i&gt;Journal of speech, language, and hearing research : JSLHR, Vol. 43, No. 3. (June 2000), pp. 721-736.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The purpose of this article is to demonstrate that self-produced auditory feedback is sufficient to train a mapping between auditory target space and articulator space under conditions in which the structures of speech production are undergoing considerable developmental restructuring. One challenge for competing theories that propose invariant constriction targets is that it is unclear what teaching signal could specify constriction location and degree so that a mapping between constriction target space and articulator space can be learned. It is predicted that a model trained by auditory feedback will accomplish speech goals, in auditory target space, by continuously learning to use different articulator configurations to adapt to the changing acoustic properties of the vocal tract during development. The Maeda articulatory synthesis part of the DIVA neural network model (Guenther et al., 1998) was modified to reflect the development of the vocal tract by using measurements taken from MR images of children. After training, the model was able to maintain the 11 English vowel targets in auditory planning space, utilizing varying articulator configurations, despite morphological changes that occur during development. The vocal-tract constriction pattern (derived from the vocal-tract area function) as well as the formant values varied during the course of development in correspondence with morphological changes in the structures involved with speech production. Despite changes in the acoustical properties of the vocal tract that occur during the course of development, the model was able to demonstrate motor-equivalent speech production under lip-restriction conditions. The model accomplished this in a self-organizing manner even though there was no prior experience with lip restriction during training.</description>
    <dc:title>An auditory-feedback-based neural network model of speech production that is robust to developmental changes in the size and shape of the articulatory system.</dc:title>

    <dc:creator>DE Callan</dc:creator>
    <dc:creator>RD Kent</dc:creator>
    <dc:creator>FH Guenther</dc:creator>
    <dc:creator>HK Vorperian</dc:creator>
    <dc:source>Journal of speech, language, and hearing research : JSLHR, Vol. 43, No. 3. (June 2000), pp. 721-736.</dc:source>
    <dc:date>2008-07-12T20:23:19-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:publicationName>Journal of speech, language, and hearing research : JSLHR</prism:publicationName>
    <prism:issn>1092-4388</prism:issn>
    <prism:volume>43</prism:volume>
    <prism:number>3</prism:number>
    <prism:startingPage>721</prism:startingPage>
    <prism:endingPage>736</prism:endingPage>
    <prism:category>model</prism:category>
    <prism:category>neural-network</prism:category>
    <prism:category>perceptual-development</prism:category>
    <prism:category>percptual-motor-development</prism:category>
    <prism:category>vocal-development</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/abellogin/article/2996213">
    <title>Collaborative filtering with decoupled models for preferences and ratings</title>
    <link>http://www.citeulike.org/user/abellogin/article/2996213</link>
    <description>&lt;i&gt;(2003), pp. 309-316.&lt;/i&gt;</description>
    <dc:title>Collaborative filtering with decoupled models for preferences and ratings</dc:title>

    <dc:creator>Rong Jin</dc:creator>
    <dc:creator>Luo Si</dc:creator>
    <dc:creator>Chengxiang Zhai</dc:creator>
    <dc:creator>James Callan</dc:creator>
    <dc:identifier>doi:10.1145/956863.956922</dc:identifier>
    <dc:source>(2003), pp. 309-316.</dc:source>
    <dc:date>2008-07-12T15:30:41-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:startingPage>309</prism:startingPage>
    <prism:endingPage>316</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>collaborative-filtering</prism:category>
    <prism:category>language-models</prism:category>
    <prism:category>preference</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/ctl/article/2761664">
    <title>Meeting of the MINDS: an information retrieval research agenda</title>
    <link>http://www.citeulike.org/user/ctl/article/2761664</link>
    <description>&lt;i&gt;SIGIR Forum, Vol. 41, No. 2. (December 2007), pp. 25-34.&lt;/i&gt;</description>
    <dc:title>Meeting of the MINDS: an information retrieval research agenda</dc:title>

    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>James Allan</dc:creator>
    <dc:creator>Charles Clarke</dc:creator>
    <dc:creator>Susan Dumais</dc:creator>
    <dc:creator>David Evans</dc:creator>
    <dc:creator>Mark Sanderson</dc:creator>
    <dc:creator>Chengxiang Zhai</dc:creator>
    <dc:identifier>doi:10.1145/1328964.1328967</dc:identifier>
    <dc:source>SIGIR Forum, Vol. 41, No. 2. (December 2007), pp. 25-34.</dc:source>
    <dc:date>2008-05-06T15:12:56-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>SIGIR Forum</prism:publicationName>
    <prism:issn>0163-5840</prism:issn>
    <prism:volume>41</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>25</prism:startingPage>
    <prism:endingPage>34</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>challenges</prism:category>
    <prism:category>context</prism:category>
    <prism:category>ir</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/JoseluisGonzalez/article/867188">
    <title>We Do It, but They Don't: Multiple Categorizations and Work Team Communication</title>
    <link>http://www.citeulike.org/user/JoseluisGonzalez/article/867188</link>
    <description>&lt;i&gt;Journal of Applied Communication Research, Vol. 34, No. 4. (November 2006), pp. 331-348.&lt;/i&gt;</description>
    <dc:title>We Do It, but They Don't: Multiple Categorizations and Work Team Communication</dc:title>

    <dc:creator>Grice</dc:creator>
    <dc:creator>Tim</dc:creator>
    <dc:creator>Gallois</dc:creator>
    <dc:creator>Cynthia</dc:creator>
    <dc:creator>Jones</dc:creator>
    <dc:creator>Elizabeth</dc:creator>
    <dc:creator>Paulsen</dc:creator>
    <dc:creator>Neil</dc:creator>
    <dc:creator>Callan</dc:creator>
    <dc:creator>Victor</dc:creator>
    <dc:identifier>doi:10.1080/00909880600908591</dc:identifier>
    <dc:source>Journal of Applied Communication Research, Vol. 34, No. 4. (November 2006), pp. 331-348.</dc:source>
    <dc:date>2006-09-25T04:32:13-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Journal of Applied Communication Research</prism:publicationName>
    <prism:issn>0090-9882</prism:issn>
    <prism:volume>34</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>331</prism:startingPage>
    <prism:endingPage>348</prism:endingPage>
    <prism:publisher>Routledge, part of the Taylor &#38; Francis Group</prism:publisher>
    <prism:category>communication</prism:category>
    <prism:category>identity</prism:category>
    <prism:category>multiple</prism:category>
    <prism:category>social</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mediallo/article/2713169">
    <title>Document filtering with inference networks</title>
    <link>http://www.citeulike.org/user/mediallo/article/2713169</link>
    <description>&lt;i&gt;(1996), pp. 262-269.&lt;/i&gt;</description>
    <dc:title>Document filtering with inference networks</dc:title>

    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1145/243199.243273</dc:identifier>
    <dc:source>(1996), pp. 262-269.</dc:source>
    <dc:date>2008-04-24T14:24:00-00:00</dc:date>
    <prism:publicationYear>1996</prism:publicationYear>
    <prism:startingPage>262</prism:startingPage>
    <prism:endingPage>269</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>filtering</prism:category>
    <prism:category>inroute</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/adick/article/2698731">
    <title>Giving speech a hand: Gesture modulates activity in auditory cortex during speech perception.</title>
    <link>http://www.citeulike.org/user/adick/article/2698731</link>
    <description>&lt;i&gt;Human brain mapping (15 April 2008)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Viewing hand gestures during face-to-face communication affects speech perception and comprehension. Despite the visible role played by gesture in social interactions, relatively little is known about how the brain integrates hand gestures with co-occurring speech. Here we used functional magnetic resonance imaging (fMRI) and an ecologically valid paradigm to investigate how beat gesture-a fundamental type of hand gesture that marks speech prosody-might impact speech perception at the neural level. Subjects underwent fMRI while listening to spontaneously-produced speech accompanied by beat gesture, nonsense hand movement, or a still body; as additional control conditions, subjects also viewed beat gesture, nonsense hand movement, or a still body all presented without speech. Validating behavioral evidence that gesture affects speech perception, bilateral nonprimary auditory cortex showed greater activity when speech was accompanied by beat gesture than when speech was presented alone. Further, the left superior temporal gyrus/sulcus showed stronger activity when speech was accompanied by beat gesture than when speech was accompanied by nonsense hand movement. Finally, the right planum temporale was identified as a putative multisensory integration site for beat gesture and speech (i.e., here activity in response to speech accompanied by beat gesture was greater than the summed responses to speech alone and beat gesture alone), indicating that this area may be pivotally involved in synthesizing the rhythmic aspects of both speech and gesture. Taken together, these findings suggest a common neural substrate for processing speech and gesture, likely reflecting their joint communicative role in social interactions. Hum Brain Mapp, 2008. (c) 2008 Wiley-Liss, Inc.</description>
    <dc:title>Giving speech a hand: Gesture modulates activity in auditory cortex during speech perception.</dc:title>

    <dc:creator>Amy L Hubbard</dc:creator>
    <dc:creator>Stephen M Wilson</dc:creator>
    <dc:creator>Daniel E Callan</dc:creator>
    <dc:creator>Mirella Dapretto</dc:creator>
    <dc:identifier>doi:10.1002/hbm.20565</dc:identifier>
    <dc:source>Human brain mapping (15 April 2008)</dc:source>
    <dc:date>2008-04-22T01:41:52-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:publicationName>Human brain mapping</prism:publicationName>
    <prism:issn>1065-9471</prism:issn>
    <prism:category>jc-hbm</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dah44/article/2264181">
    <title>Parameter Estimation for a Simple Hierarchical Generative Model for XML Retrieval</title>
    <link>http://www.citeulike.org/user/dah44/article/2264181</link>
    <description>&lt;i&gt;Advances in XML Information Retrieval and Evaluation (2006), pp. 211-224.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper explores the possibility of using a modified Expectation-Maximization algorithm to estimate parameters for a simple hierarchical generative model for XML retrieval. The generative model for an XML element is estimated by linearly interpolating statistical language models estimated from the text of the element, the parent element, the document element, and its children elements. We heuristically modify EM to allow the incorporation of negative examples, then attempt to maximize the likelihood of the relevant components while minimizing the likelihood of non-relevant components found in training data. The technique for incorporation of negative examples provide an effective algorithm to estimate the parameters in the linear combination mentioned. Some experiments are presented on the CO.Thorough task that support these claims.</description>
    <dc:title>Parameter Estimation for a Simple Hierarchical Generative Model for XML Retrieval</dc:title>

    <dc:creator>Paul Ogilvie</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1007/11766278_16</dc:identifier>
    <dc:source>Advances in XML Information Retrieval and Evaluation (2006), pp. 211-224.</dc:source>
    <dc:date>2008-01-20T21:56:01-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Advances in XML Information Retrieval and Evaluation</prism:publicationName>
    <prism:startingPage>211</prism:startingPage>
    <prism:endingPage>224</prism:endingPage>
    <prism:category>language-model</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/emptyhb/article/1032936">
    <title>Precise physical models of protein-DNA interaction from high-throughput data</title>
    <link>http://www.citeulike.org/user/emptyhb/article/1032936</link>
    <description>&lt;i&gt;PNAS, Vol. 104, No. 2. (9 January 2007), pp. 501-506.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;A cell's ability to regulate gene transcription depends in large part on the energy with which transcription factors (TFs) bind their DNA regulatory sites. Obtaining accurate models of this binding energy is therefore an important goal for quantitative biology. In this article, we present a principled likelihood-based approach for inferring physical models of TF-DNA binding energy from the data produced by modern high-throughput binding assays. Central to our analysis is the ability to assess the relative likelihood of different model parameters given experimental observations. We take a unique approach to this problem and show how to compute likelihood without any explicit assumptions about the noise that inevitably corrupts such measurements. Sampling possible choices for model parameters according to this likelihood function, we can then make probabilistic predictions for the identities of binding sites and their physical binding energies. Applying this procedure to previously published data on the Saccharomyces cerevisiae TF Abf1p, we find models of TF binding whose parameters are determined with remarkable precision. Evidence for the accuracy of these models is provided by an astonishing level of phylogenetic conservation in the predicted energies of putative binding sites. Results from in vivo and in vitro experiments also provide highly consistent characterizations of Abf1p, a result that contrasts with a previous analysis of the same data. 10.1073/pnas.0609908104</description>
    <dc:title>Precise physical models of protein-DNA interaction from high-throughput data</dc:title>

    <dc:creator>Justin Kinney</dc:creator>
    <dc:creator>Gasper Tkacik</dc:creator>
    <dc:creator>Curtis Callan</dc:creator>
    <dc:identifier>doi:10.1073/pnas.0609908104</dc:identifier>
    <dc:source>PNAS, Vol. 104, No. 2. (9 January 2007), pp. 501-506.</dc:source>
    <dc:date>2007-01-10T08:58:33-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>PNAS</prism:publicationName>
    <prism:volume>104</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>501</prism:startingPage>
    <prism:endingPage>506</prism:endingPage>
    <prism:category>cis_regulatory_elements</prism:category>
    <prism:category>dna-protein_interaction</prism:category>
    <prism:category>motif_searching</prism:category>
    <prism:category>statistical_method</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/spiritblue/article/2281691">
    <title>User modeling for full-text federated search in peer-to-peer networks</title>
    <link>http://www.citeulike.org/user/spiritblue/article/2281691</link>
    <description>&lt;i&gt;(2006), pp. 332-339.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;User modeling for information retrieval has mostly been studied to improve the effectiveness of information access in centralized repositories. In this paper we explore user modeling in the context of full-text federated search in peer-to-peer networks. Our approach models a user's persistent, long-term interests based on past queries, and uses the model to improve search efficiency for future queries that represent interests similar to past queries. Our approach also enables queries representing a user's transient, ad-hoc interests to be automatically recognized so that search for these queries can rely on a relatively large search radius to avoid sacrificing effectiveness for efficiency. Experimental results demonstrate that our approach can significantly improve the efficiency of full-text federated search without degrading its accuracy. Furthermore, the proposed approach does not require a large amount of training data, and is robust to a range of parameter values.</description>
    <dc:title>User modeling for full-text federated search in peer-to-peer networks</dc:title>

    <dc:creator>Jie Lu</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1145/1148170.1148229</dc:identifier>
    <dc:source>(2006), pp. 332-339.</dc:source>
    <dc:date>2008-01-23T20:02:07-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:startingPage>332</prism:startingPage>
    <prism:endingPage>339</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mj23/article/2538730">
    <title>Structured retrieval for question answering</title>
    <link>http://www.citeulike.org/user/mj23/article/2538730</link>
    <description>&lt;i&gt;SIGIR (2007), pp. 351-358.&lt;/i&gt;</description>
    <dc:title>Structured retrieval for question answering</dc:title>

    <dc:creator>Matthew Bilotti</dc:creator>
    <dc:creator>Paul Ogilvie</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>Eric Nyberg</dc:creator>
    <dc:identifier>doi:10.1145/1277741.1277802</dc:identifier>
    <dc:source>SIGIR (2007), pp. 351-358.</dc:source>
    <dc:date>2008-03-16T08:47:52-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>SIGIR</prism:publicationName>
    <prism:startingPage>351</prism:startingPage>
    <prism:endingPage>358</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/sugarexpletive/article/1523864">
    <title>Distributed information retrieval</title>
    <link>http://www.citeulike.org/user/sugarexpletive/article/1523864</link>
    <description>&lt;i&gt;(2000)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;A multi-database model of distributed information retrieval is presented, in which people are assumed to have access to many searchable text databases. In such an environment, full-text information retrieval consists of discovering database contents, ranking databases by their expected ability to satisfy the query, searching a small number of databases, and merging results returned by different databases. This paper presents algorithms for each task. It also discusses how to reorganize...</description>
    <dc:title>Distributed information retrieval</dc:title>

    <dc:creator>J Callan</dc:creator>
    <dc:source>(2000)</dc:source>
    <dc:date>2007-07-31T05:47:29-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:category>distributed</prism:category>
    <prism:category>info</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/sugarexpletive/article/1523414">
    <title>The Effectiveness of Query Expansion for Distributed Information Retrieval</title>
    <link>http://www.citeulike.org/user/sugarexpletive/article/1523414</link>
    <description>&lt;i&gt;(2001), pp. 183-190.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Query expansion has been shown effective for both single database retrieval and for distributed information retrieval where complete collection information is available. One might expect that query expansion would then work for distributed information retrieval when complete collection information is not available. However, this does not appear to be the case. When using local context analysis for query expansion in distributed retrieval with partial information, the most significant reason...</description>
    <dc:title>The Effectiveness of Query Expansion for Distributed Information Retrieval</dc:title>

    <dc:creator>Paul Ogilvie</dc:creator>
    <dc:creator>James Callan</dc:creator>
    <dc:source>(2001), pp. 183-190.</dc:source>
    <dc:date>2007-07-31T02:21:19-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:startingPage>183</prism:startingPage>
    <prism:endingPage>190</prism:endingPage>
    <prism:category>distributed</prism:category>
    <prism:category>info</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/sugarexpletive/article/2407896">
    <title>The Effects of Query-Based Sampling on Automatic Database Selection Algorithms</title>
    <link>http://www.citeulike.org/user/sugarexpletive/article/2407896</link>
    <description>&lt;i&gt;(2000)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Database selection algorithms need to know the subject areas covered by each text database, but this metadata can be difficult to acquire in multi-party environments, such as the Internet, where each party has different interests and capabilities. Query-based sampling is a relatively new technique in which metadata is inferred by interacting with each text database and observing the outcomes. Query-based sampling has been proposed as a solution to the problem of discovering the contents of...</description>
    <dc:title>The Effects of Query-Based Sampling on Automatic Database Selection Algorithms</dc:title>

    <dc:creator>J Callan</dc:creator>
    <dc:creator>A Powell</dc:creator>
    <dc:creator>J French</dc:creator>
    <dc:creator>M Connell</dc:creator>
    <dc:source>(2000)</dc:source>
    <dc:date>2008-02-21T15:34:27-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:category>misc</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/sugarexpletive/article/2407895">
    <title>Effective and Efficient Automatic Database Selection</title>
    <link>http://www.citeulike.org/user/sugarexpletive/article/2407895</link>
    <description>&lt;i&gt;No. CS-99-08. (FebruaryFebruary, 1999)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We examine a class of database selection algorithms that require only document frequency information. The CORI algorithm is an instance of this class of algorithms. In previous work, we showed that CORI is more effective than gGlOSS when evaluated against a relevance-based standard. In this paper, we introduce a family of other algorithms in this class and examine components of these algorithms and of the CORI algorithm to begin identifying the factors responsible for their performance. We...</description>
    <dc:title>Effective and Efficient Automatic Database Selection</dc:title>

    <dc:creator>James French</dc:creator>
    <dc:creator>Allison Powell</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:source>No. CS-99-08. (FebruaryFebruary, 1999)</dc:source>
    <dc:date>2008-02-21T15:34:25-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:number>CS-99-08</prism:number>
    <prism:category>misc</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/codex/article/2397387">
    <title>Passage-level evidence in document retrieval</title>
    <link>http://www.citeulike.org/user/codex/article/2397387</link>
    <description>&lt;i&gt;(1994), pp. 302-310.&lt;/i&gt;</description>
    <dc:title>Passage-level evidence in document retrieval</dc:title>

    <dc:creator>James Callan</dc:creator>
    <dc:source>(1994), pp. 302-310.</dc:source>
    <dc:date>2008-02-19T05:57:30-00:00</dc:date>
    <prism:publicationYear>1994</prism:publicationYear>
    <prism:startingPage>302</prism:startingPage>
    <prism:endingPage>310</prism:endingPage>
    <prism:publisher>Springer-Verlag New York, Inc.</prism:publisher>
    <prism:category>ir</prism:category>
    <prism:category>passage_retrieval</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/jsanpedro/article/2295285">
    <title>Novelty and redundancy detection in adaptive filtering</title>
    <link>http://www.citeulike.org/user/jsanpedro/article/2295285</link>
    <description>&lt;i&gt;(2002), pp. 81-88.&lt;/i&gt;</description>
    <dc:title>Novelty and redundancy detection in adaptive filtering</dc:title>

    <dc:creator>Yi Zhang</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>Thomas Minka</dc:creator>
    <dc:identifier>doi:10.1145/564376.564393</dc:identifier>
    <dc:source>(2002), pp. 81-88.</dc:source>
    <dc:date>2008-01-27T19:27:51-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:startingPage>81</prism:startingPage>
    <prism:endingPage>88</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>detection</prism:category>
    <prism:category>duplicate</prism:category>
    <prism:category>filtering</prism:category>
    <prism:category>forieee_si_2008</prism:category>
    <prism:category>forsigir2008</prism:category>
    <prism:category>search</prism:category>
    <prism:category>web</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/jsanpedro/article/2295267">
    <title>Near-duplicate detection by instance-level constrained clustering</title>
    <link>http://www.citeulike.org/user/jsanpedro/article/2295267</link>
    <description>&lt;i&gt;(2006), pp. 421-428.&lt;/i&gt;</description>
    <dc:title>Near-duplicate detection by instance-level constrained clustering</dc:title>

    <dc:creator>Hui Yang</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1145/1148170.1148243</dc:identifier>
    <dc:source>(2006), pp. 421-428.</dc:source>
    <dc:date>2008-01-27T19:17:59-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:startingPage>421</prism:startingPage>
    <prism:endingPage>428</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>detection</prism:category>
    <prism:category>duplicate</prism:category>
    <prism:category>forieee_si_2008</prism:category>
    <prism:category>forsigir2008</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/arjen/article/2264160">
    <title>Hierarchical Language Models for XML Component Retrieval</title>
    <link>http://www.citeulike.org/user/arjen/article/2264160</link>
    <description>&lt;i&gt;Advances in XML Information Retrieval (2005), pp. 224-237.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Experiments using hierarchical language models for XML component retrieval are presented in this paper. The role of context is investigated through incorporation of the parent’s model. We find that context can improve the effectiveness of finding relevant components slightly. Additionally, biasing the results toward long components through the use of component priors improves exhaustivity but harms specificity, so care must be taken to find an appropriate trade-off.</description>
    <dc:title>Hierarchical Language Models for XML Component Retrieval</dc:title>

    <dc:creator>Paul Ogilvie</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1007/11424550_18</dc:identifier>
    <dc:source>Advances in XML Information Retrieval (2005), pp. 224-237.</dc:source>
    <dc:date>2008-01-20T21:51:41-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>Advances in XML Information Retrieval</prism:publicationName>
    <prism:startingPage>224</prism:startingPage>
    <prism:endingPage>237</prism:endingPage>
    <prism:category>lm-ir</prism:category>
    <prism:category>xml-ir</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/bundschu/article/1088607">
    <title>Modeling Annotated Data</title>
    <link>http://www.citeulike.org/user/bundschu/article/1088607</link>
    <description>&lt;i&gt;SIGIR Forum, No. SPEC. ISS.. (2003), pp. 127-134.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We consider the problem of modeling annotated data-data with multiple types where the instance of one type (such as a caption) serves as a description of the other type (such as an image). We describe three hierarchical probabilistic mixture models which aim to describe such data, culminating in correspondence latent Dirichlet allocation, a latent variable model that is effective at modeling the joint distribution of both types and the conditional distribution of the annotation given the primary type. We conduct experiments on the Corel database of images and captions, assessing performance in terms of held-out likelihood, automatic annotation, and text-based image retrieval. Sponsors: ACM/SIGIR</description>
    <dc:title>Modeling Annotated Data</dc:title>

    <dc:creator>DM Blei</dc:creator>
    <dc:creator>MI Jordan</dc:creator>
    <dc:creator>J Callan</dc:creator>
    <dc:creator>G Cormack</dc:creator>
    <dc:creator>C Clarke</dc:creator>
    <dc:creator>D Hawking</dc:creator>
    <dc:creator>A Smeaton</dc:creator>
    <dc:source>SIGIR Forum, No. SPEC. ISS.. (2003), pp. 127-134.</dc:source>
    <dc:date>2007-02-05T15:53:46-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>SIGIR Forum</prism:publicationName>
    <prism:number>SPEC. ISS.</prism:number>
    <prism:startingPage>127</prism:startingPage>
    <prism:endingPage>134</prism:endingPage>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/navil/article/2188649">
    <title>Query expansion using random walk models</title>
    <link>http://www.citeulike.org/user/navil/article/2188649</link>
    <description>&lt;i&gt;(2005), pp. 704-711.&lt;/i&gt;</description>
    <dc:title>Query expansion using random walk models</dc:title>

    <dc:creator>Kevyn Collins-Thompson</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:source>(2005), pp. 704-711.</dc:source>
    <dc:date>2008-01-02T16:31:14-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:startingPage>704</prism:startingPage>
    <prism:endingPage>711</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>query-expansion</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/kirstine/article/1734934">
    <title>INQUERY System Overview</title>
    <link>http://www.citeulike.org/user/kirstine/article/1734934</link>
    <description>&lt;i&gt;(1994), pp. 47-67.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;such as words, phrases, paragraphs, or manually assigned keywords) and different versions of the query (such as natural language and Boolean) can be combined in a consistent probabilistic framework. This type of &#34;data fusion&#34; has been known to be effective in the information retrieval context for a number of years, and was one of the primary motivations for developing the inference net approach. Another feature of the inference net approach is the ability to capture complex structure in the...</description>
    <dc:title>INQUERY System Overview</dc:title>

    <dc:creator>John Broglio</dc:creator>
    <dc:creator>James Callan</dc:creator>
    <dc:creator>Bruce Croft</dc:creator>
    <dc:source>(1994), pp. 47-67.</dc:source>
    <dc:date>2007-10-07T02:55:31-00:00</dc:date>
    <prism:publicationYear>1994</prism:publicationYear>
    <prism:startingPage>47</prism:startingPage>
    <prism:endingPage>67</prism:endingPage>
    <prism:publisher>Morgan Kaufmann</prism:publisher>
    <prism:category>bayesian</prism:category>
    <prism:category>inquery</prism:category>
    <prism:category>ir</prism:category>
    <prism:category>networks</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/toine/article/984159">
    <title>Passage-Level Evidence in Document Retrieval</title>
    <link>http://www.citeulike.org/user/toine/article/984159</link>
    <description>&lt;i&gt;(1994), pp. 302-310.&lt;/i&gt;</description>
    <dc:title>Passage-Level Evidence in Document Retrieval</dc:title>

    <dc:creator>James Callan</dc:creator>
    <dc:source>(1994), pp. 302-310.</dc:source>
    <dc:date>2006-12-08T06:15:17-00:00</dc:date>
    <prism:publicationYear>1994</prism:publicationYear>
    <prism:startingPage>302</prism:startingPage>
    <prism:endingPage>310</prism:endingPage>
    <prism:publisher>Springer-Verlag New York, Inc.</prism:publisher>
    <prism:category>information_retrieval</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/pprett/article/1652856">
    <title>Estimation and use of uncertainty in pseudo-relevance feedback</title>
    <link>http://www.citeulike.org/user/pprett/article/1652856</link>
    <description>&lt;i&gt;(2007), pp. 303-310.&lt;/i&gt;</description>
    <dc:title>Estimation and use of uncertainty in pseudo-relevance feedback</dc:title>

    <dc:creator>Kevyn Collins-Thompson</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1145/1277741.1277795</dc:identifier>
    <dc:source>(2007), pp. 303-310.</dc:source>
    <dc:date>2007-09-13T20:28:35-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:startingPage>303</prism:startingPage>
    <prism:endingPage>310</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>feedback</prism:category>
    <prism:category>pseudo</prism:category>
    <prism:category>relevance</prism:category>
    <prism:category>sampling</prism:category>
    <prism:category>uncertainty</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/jelsas/article/1176899">
    <title>Relevant document distribution estimation method for resource selection</title>
    <link>http://www.citeulike.org/user/jelsas/article/1176899</link>
    <description>&lt;i&gt;(2003), pp. 298-305.&lt;/i&gt;</description>
    <dc:title>Relevant document distribution estimation method for resource selection</dc:title>

    <dc:creator>Luo Si</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1145/860435.860490</dc:identifier>
    <dc:source>(2003), pp. 298-305.</dc:source>
    <dc:date>2007-03-20T03:32:37-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:startingPage>298</prism:startingPage>
    <prism:endingPage>305</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>distributed</prism:category>
    <prism:category>ir</prism:category>
    <prism:category>redde</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/birkok/article/1974581">
    <title>Implications of family-friendly policies for organizational culture: findings from two case studies</title>
    <link>http://www.citeulike.org/user/birkok/article/1974581</link>
    <description>&lt;i&gt;Work Employment Society, Vol. 21, No. 4. (1 December 2007), pp. 673-691.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Formal policies intended to enable employees to meet family commitments may be important indicators of an organization's intent, but they do not guarantee that the informal culture is supportive of employees' families or their attempts to manage occasionally conflicting priorities (Lewis, 1997; Lewis and Lewis, 1996). Two case studies were conducted to identify salient aspects of the culture of two organizations and the extent to which changes in culture result from the implementation of family-friendly policies.The wider issue of the ease with which purposive cultural change or organizational learning may be engendered to ameliorate employees' worklife balance is also considered. 10.1177/0950017007082876</description>
    <dc:title>Implications of family-friendly policies for organizational culture: findings from two case studies</dc:title>

    <dc:creator>Samantha Callan</dc:creator>
    <dc:identifier>doi:10.1177/0950017007082876</dc:identifier>
    <dc:source>Work Employment Society, Vol. 21, No. 4. (1 December 2007), pp. 673-691.</dc:source>
    <dc:date>2007-11-24T20:12:19-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Work Employment Society</prism:publicationName>
    <prism:volume>21</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>673</prism:startingPage>
    <prism:endingPage>691</prism:endingPage>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/zeze/article/1956290">
    <title>String loop corrections to beta functions</title>
    <link>http://www.citeulike.org/user/zeze/article/1956290</link>
    <description>&lt;i&gt;Nuclear Physics B, Vol. 288 (1987), pp. 525-550.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We study the problem of finding the beta functions, and the associated spacetime effective action, for interacting open and closed strings propagating in background fields. String loop divergences play a crucial role in this problem. Cancelling them against sigma model divergences gives a consistent set of loop-corrected beta functions, which can be derived from a simple generalization of the string-tree-level effective action. This suggests the existence of new string theories which are conformally invariant only after all world sheets have been summed.</description>
    <dc:title>String loop corrections to beta functions</dc:title>

    <dc:creator>CG Callan</dc:creator>
    <dc:creator>C Lovelace</dc:creator>
    <dc:creator>CR Nappi</dc:creator>
    <dc:creator>SA Yost</dc:creator>
    <dc:identifier>doi:10.1016/0550-3213(87)90227-6</dc:identifier>
    <dc:source>Nuclear Physics B, Vol. 288 (1987), pp. 525-550.</dc:source>
    <dc:date>2007-11-22T05:05:32-00:00</dc:date>
    <prism:publicationYear>1987</prism:publicationYear>
    <prism:publicationName>Nuclear Physics B</prism:publicationName>
    <prism:volume>288</prism:volume>
    <prism:startingPage>525</prism:startingPage>
    <prism:endingPage>550</prism:endingPage>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dsquared/article/1948006">
    <title>Bijections from Dyck paths to 321-avoiding permutations revisited</title>
    <link>http://www.citeulike.org/user/dsquared/article/1948006</link>
    <description>&lt;i&gt;(16 Nov 2007)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;There are (at least) three bijections from Dyck paths to 321-avoiding permutations in the literature, due to Billey-Jockusch-Stanley, Krattenthaler, and Mansour-Deng-Du. How different are they? Denoting them B,K,M respectively, we show that M = B \circ L = K \circ L' where L is the classical Kreweras-Lalanne involution on Dyck paths and L', also an involution, is a sort of derivative of L. Thus K^-1 \circ B, a measure of the difference between B and K, is the product of involutions L' \circ L and turns out to be a very curious bijection: as a permutation on Dyck n-paths it is an nth root of the &#34;reverse path&#34; involution. The proof of this fact boils down to a geometric argument involving pairs of nonintersecting lattice paths.</description>
    <dc:title>Bijections from Dyck paths to 321-avoiding permutations revisited</dc:title>

    <dc:creator>David Callan</dc:creator>
    <dc:source>(16 Nov 2007)</dc:source>
    <dc:date>2007-11-21T05:01:32-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:category>bijection</prism:category>
    <prism:category>catalan</prism:category>
    <prism:category>combinatorics</prism:category>
    <prism:category>latticepath</prism:category>
    <prism:category>patternavoidance</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/ssn/article/1907031">
    <title>Novelty and redundancy detection in adaptive filtering</title>
    <link>http://www.citeulike.org/user/ssn/article/1907031</link>
    <description>&lt;i&gt;(2002), pp. 81-88.&lt;/i&gt;</description>
    <dc:title>Novelty and redundancy detection in adaptive filtering</dc:title>

    <dc:creator>Yi Zhang</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>Thomas Minka</dc:creator>
    <dc:identifier>doi:10.1145/564376.564393</dc:identifier>
    <dc:source>(2002), pp. 81-88.</dc:source>
    <dc:date>2007-11-13T11:55:39-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:startingPage>81</prism:startingPage>
    <prism:endingPage>88</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>filtering</prism:category>
    <prism:category>information-retrieval</prism:category>
    <prism:category>prodei</prism:category>
    <prism:category>redundancy</prism:category>
    <prism:category>related</prism:category>
    <prism:category>tdt</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/codex/article/1894136">
    <title>Next steps in near-duplicate detection for eRulemaking</title>
    <link>http://www.citeulike.org/user/codex/article/1894136</link>
    <description>&lt;i&gt;(2006), pp. 239-248.&lt;/i&gt;</description>
    <dc:title>Next steps in near-duplicate detection for eRulemaking</dc:title>

    <dc:creator>Hui Yang</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>Stuart Shulman</dc:creator>
    <dc:identifier>doi:10.1145/1146598.1146663</dc:identifier>
    <dc:source>(2006), pp. 239-248.</dc:source>
    <dc:date>2007-11-10T09:31:46-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:startingPage>239</prism:startingPage>
    <prism:endingPage>248</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>near_duplicate</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/kah/article/1815232">
    <title>Combining document representations for known-item search</title>
    <link>http://www.citeulike.org/user/kah/article/1815232</link>
    <description>&lt;i&gt;(2003), pp. 143-150.&lt;/i&gt;</description>
    <dc:title>Combining document representations for known-item search</dc:title>

    <dc:creator>Paul Ogilvie</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1145/860435.860463</dc:identifier>
    <dc:source>(2003), pp. 143-150.</dc:source>
    <dc:date>2007-10-24T12:17:36-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:startingPage>143</prism:startingPage>
    <prism:endingPage>150</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/group/3260/article/1776619">
    <title>Evolutionary comparisons suggest many novel cAMP response protein binding sites in Escherichia coli.</title>
    <link>http://www.citeulike.org/group/3260/article/1776619</link>
    <description>&lt;i&gt;Proc Natl Acad Sci U S A, Vol. 101, No. 8. (24 February 2004), pp. 2404-2409.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The cAMP response protein (CRP) is a transcription factor known to regulate many genes in Escherichia coli. Computational studies of transcription factor binding to DNA are usually based on a simple matrix model of sequence-dependent binding energy. For CRP, this model predicts many binding sites that are not known to be functional. If they are indeed spurious, the underlying binding model is called into question. We use a species comparison method to assess the functionality of a population of such predicted CRP sites in E. coli. We compare them with orthologous sites in Salmonella typhimurium identified independently by CLUSTALW alignment, and find a dependence of mutation probability on position in the site. This dependence increases with predicted site binding energy. The positions where mutation is most strongly suppressed are those where mutation would have the biggest effect on predicted binding energy. This finding suggests that many of the novel sites are functional, that the matrix model correctly estimates their binding strength, and that calculated CRP binding strength is the quantity that is conserved between species. The analysis also identifies many new E. coli binding sites and genes likely to be functional for CRP.</description>
    <dc:title>Evolutionary comparisons suggest many novel cAMP response protein binding sites in Escherichia coli.</dc:title>

    <dc:creator>CT Brown</dc:creator>
    <dc:creator>CG Callan</dc:creator>
    <dc:source>Proc Natl Acad Sci U S A, Vol. 101, No. 8. (24 February 2004), pp. 2404-2409.</dc:source>
    <dc:date>2007-10-16T21:09:28-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Proc Natl Acad Sci U S A</prism:publicationName>
    <prism:issn>0027-8424</prism:issn>
    <prism:volume>101</prism:volume>
    <prism:number>8</prism:number>
    <prism:startingPage>2404</prism:startingPage>
    <prism:endingPage>2409</prism:endingPage>
    <prism:category>bacteria</prism:category>
    <prism:category>cis-regulatory</prism:category>
    <prism:category>model</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/rayzhang/article/141094">
    <title>The INQUERY Retrieval System</title>
    <link>http://www.citeulike.org/user/rayzhang/article/141094</link>
    <description>&lt;i&gt;(1992), pp. 78-83.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;As larger and more heterogeneous text databases become available, information retrieval research will depend on the development of powerful, efficient and flexible retrieval engines. In this paper, we describe a retrieval system (INQUERY) that is based on a probabilistic retrieval model and provides support for sophisticated indexing and complex query formulation. INQUERY has been used successfully with databases containing nearly 400,000 documents. 1 Introduction The increasing interest in...</description>
    <dc:title>The INQUERY Retrieval System</dc:title>

    <dc:creator>James Callan</dc:creator>
    <dc:creator>Bruce Croft</dc:creator>
    <dc:creator>Stephen Harding</dc:creator>
    <dc:source>(1992), pp. 78-83.</dc:source>
    <dc:date>2005-03-26T09:21:40-00:00</dc:date>
    <prism:publicationYear>1992</prism:publicationYear>
    <prism:startingPage>78</prism:startingPage>
    <prism:endingPage>83</prism:endingPage>
    <prism:category>distributed</prism:category>
    <prism:category>inference</prism:category>
    <prism:category>information</prism:category>
    <prism:category>network</prism:category>
    <prism:category>retrieval</prism:category>
    <prism:category>system</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/rayzhang/article/1561946">
    <title>Searching Distributed Collections with Inference Networks</title>
    <link>http://www.citeulike.org/user/rayzhang/article/1561946</link>
    <description>&lt;i&gt;(1995), pp. 21-28.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The use of information retrieval systems in networked environments raises a new set of issues that have received little attention. These issues include ranking document collections for relevance to a query, selecting the best set of collections from a ranked list, and merging the document rankings that are returned from a set of collections. This paper describes methods of addressing each issue in the inference network model, discusses their implementation in the INQUERY system, and presents...</description>
    <dc:title>Searching Distributed Collections with Inference Networks</dc:title>

    <dc:creator>JP Callan</dc:creator>
    <dc:creator>Z Lu</dc:creator>
    <dc:creator>Bruce Croft</dc:creator>
    <dc:source>(1995), pp. 21-28.</dc:source>
    <dc:date>2007-08-15T06:16:11-00:00</dc:date>
    <prism:publicationYear>1995</prism:publicationYear>
    <prism:startingPage>21</prism:startingPage>
    <prism:endingPage>28</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>distributed</prism:category>
    <prism:category>inference</prism:category>
    <prism:category>information</prism:category>
    <prism:category>network</prism:category>
    <prism:category>resource</prism:category>
    <prism:category>retrieval</prism:category>
    <prism:category>selection</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/rayzhang/article/1734787">
    <title>The SIGIR peer-to-peer information retrieval workshop</title>
    <link>http://www.citeulike.org/user/rayzhang/article/1734787</link>
    <description>&lt;i&gt;SIGIR Forum, Vol. 38, No. 2. (December 2004), pp. 37-40.&lt;/i&gt;</description>
    <dc:title>The SIGIR peer-to-peer information retrieval workshop</dc:title>

    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>Norbert Fuhr</dc:creator>
    <dc:identifier>doi:10.1145/1041394.1041402</dc:identifier>
    <dc:source>SIGIR Forum, Vol. 38, No. 2. (December 2004), pp. 37-40.</dc:source>
    <dc:date>2007-10-07T01:34:45-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>SIGIR Forum</prism:publicationName>
    <prism:issn>0163-5840</prism:issn>
    <prism:volume>38</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>37</prism:startingPage>
    <prism:endingPage>40</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>distributed</prism:category>
    <prism:category>information</prism:category>
    <prism:category>network</prism:category>
    <prism:category>peer-to-peer</prism:category>
    <prism:category>retrieval</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/cmmorel/article/1656435">
    <title>The path to new medicines</title>
    <link>http://www.citeulike.org/user/cmmorel/article/1656435</link>
    <description>&lt;i&gt;Nature, Vol. 449, No. 7159. (12 September 2007), pp. 164-165.&lt;/i&gt;</description>
    <dc:title>The path to new medicines</dc:title>

    <dc:creator>Bénédicte Callan</dc:creator>
    <dc:creator>Iain Gillespie</dc:creator>
    <dc:identifier>doi:10.1038/449164a</dc:identifier>
    <dc:source>Nature, Vol. 449, No. 7159. (12 September 2007), pp. 164-165.</dc:source>
    <dc:date>2007-09-14T14:40:00-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Nature</prism:publicationName>
    <prism:issn>0028-0836</prism:issn>
    <prism:volume>449</prism:volume>
    <prism:number>7159</prism:number>
    <prism:startingPage>164</prism:startingPage>
    <prism:endingPage>165</prism:endingPage>
    <prism:publisher>Nature Publishing Group</prism:publisher>
    <prism:category>drugs</prism:category>
    <prism:category>medicines</prism:category>
    <prism:category>neglected_diseases</prism:category>
    <prism:category>neglected_tropical_diseases</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/kaineci/article/1561957">
    <title>Reducing storage costs for federated search of text databases</title>
    <link>http://www.citeulike.org/user/kaineci/article/1561957</link>
    <description>&lt;i&gt;(2003)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In environments containing many text search engines a federated search system provides people with a single point of access. When search engines are managed by independent organizations two key problems are discovering and representing the contents of each text database. Query-based sampling is a recent technique for discovering the contents of uncooperative databases so as to create database resource descriptions that support a variety of necessary capabilities. However, when the documents...</description>
    <dc:title>Reducing storage costs for federated search of text databases</dc:title>

    <dc:creator>J Lu</dc:creator>
    <dc:creator>J Callan</dc:creator>
    <dc:source>(2003)</dc:source>
    <dc:date>2007-08-15T06:27:28-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:category>ir</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/kaineci/article/1523417">
    <title>A semi-supervised learning method to merge search engine results</title>
    <link>http://www.citeulike.org/user/kaineci/article/1523417</link>
    <description>&lt;i&gt;&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This article presents a semisupervised learning solution to the result merging problem. The key contribution is the observation that information used to create resource descriptions for resource selection can also be used to create a centralized sample database to guide the normalization of document scores returned by different databases. At retrieval time, the query is sent to the selected databases, which return database-specific document scores, and to a centralized sample database, which...</description>
    <dc:title>A semi-supervised learning method to merge search engine results</dc:title>

    <dc:creator>L Si</dc:creator>
    <dc:creator>J Callan</dc:creator>
    <dc:date>2007-07-31T02:21:48-00:00</dc:date>
    <prism:category>ir</prism:category>
    <prism:category>ml</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/kaineci/article/1523411">
    <title>Collection Selection and Results Merging with Topically Organized U.S. Patents and TREC Data</title>
    <link>http://www.citeulike.org/user/kaineci/article/1523411</link>
    <description>&lt;i&gt;(2000), pp. 282-289.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We investigate three issues in distributed information retrieval, considering both TREC data and U.S. Patents: (1) topical organization of large text collections, (2) collection ranking and selection with topically organized collections (3) results merging, particularly document score normalization, with topically organized collections. We find that it is better to organize collections topically, and that topical collections can be well ranked using either INQUERY's CORI algorithm, or the...</description>
    <dc:title>Collection Selection and Results Merging with Topically Organized U.S. Patents and TREC Data</dc:title>

    <dc:creator>Leah Larkey</dc:creator>
    <dc:creator>Margaret Connell</dc:creator>
    <dc:creator>James Callan</dc:creator>
    <dc:source>(2000), pp. 282-289.</dc:source>
    <dc:date>2007-07-31T02:18:36-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:startingPage>282</prism:startingPage>
    <prism:endingPage>289</prism:endingPage>
    <prism:category>distributed-index-partition</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/rcarlton/article/1477171">
    <title>Parents' Views on Social Work Interventions in Child Welfare Cases</title>
    <link>http://www.citeulike.org/user/rcarlton/article/1477171</link>
    <description>&lt;i&gt;Br J Soc Work, Vol. 34, No. 2. (1 March 2004), pp. 199-224.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This article reports findings from the third part of a three-part research project examining the potential for social workers to shift from a child protection to a child welfare orientation in their practice. Whilst social workers in the UK have been encouraged to make such changes, they have been hampered by concerns to manage risk. Findings reported from the earlier parts of the project, indicated that there was potential for a substantial proportion of child protection work to be redesignated as child welfare work, but that where this was achieved in practice, there was evidence of the continued influence of child protection processes as social workers sought to manage the risks inherent in child welfare cases. The study reported here sets out to ascertain the views of parents who were subject to child welfare interventions. The findings indicate that while parents feel apprehension with regard to contact with social workers, in the majority of cases successful relationships are formed. It is argued that social workers display considerable skill in monitoring potential risks whilst engaging with families and that the subtleties involved in such activity are not captured by official measures of governance which concentrate on more abstract indicators of performance. 10.1093/bjsw/bch022</description>
    <dc:title>Parents' Views on Social Work Interventions in Child Welfare Cases</dc:title>

    <dc:creator>Trevor Spratt</dc:creator>
    <dc:creator>Jackie Callan</dc:creator>
    <dc:identifier>doi:10.1093/bjsw/bch022</dc:identifier>
    <dc:source>Br J Soc Work, Vol. 34, No. 2. (1 March 2004), pp. 199-224.</dc:source>
    <dc:date>2007-07-24T15:10:02-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Br J Soc Work</prism:publicationName>
    <prism:volume>34</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>199</prism:startingPage>
    <prism:endingPage>224</prism:endingPage>
    <prism:category>childwelfare</prism:category>
    <prism:category>practice</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/tolosoft/article/1342120">
    <title>Comparing the performance of database selection algorithms</title>
    <link>http://www.citeulike.org/user/tolosoft/article/1342120</link>
    <description>&lt;i&gt;(1999), pp. 238-245.&lt;/i&gt;</description>
    <dc:title>Comparing the performance of database selection algorithms</dc:title>

    <dc:creator>James French</dc:creator>
    <dc:creator>Allison Powell</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:creator>Charles Viles</dc:creator>
    <dc:creator>Travis Emmitt</dc:creator>
    <dc:creator>Kevin Prey</dc:creator>
    <dc:creator>Yun Mou</dc:creator>
    <dc:identifier>doi:10.1145/312624.312684</dc:identifier>
    <dc:source>(1999), pp. 238-245.</dc:source>
    <dc:date>2007-05-30T07:46:29-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:startingPage>238</prism:startingPage>
    <prism:endingPage>245</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>algorithm</prism:category>
    <prism:category>database-selection</prism:category>
    <prism:category>dir</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/tolosoft/article/1341075">
    <title>Comparing the Performance of Database Selection Algorithms</title>
    <link>http://www.citeulike.org/user/tolosoft/article/1341075</link>
    <description>&lt;i&gt;(1999), pp. 238-245.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for database selection techniques. The testbed is a decomposition of the TREC/TIPSTER data into 236 subcollections. The databases from our testbed were ranked using both the gGlOSS and CORI techniques and compared to a baseline derived from TREC relevance judgements. We examined the degree to which CORI and gGlOSS approximate this ...</description>
    <dc:title>Comparing the Performance of Database Selection Algorithms</dc:title>

    <dc:creator>James French</dc:creator>
    <dc:creator>Allison Powell</dc:creator>
    <dc:creator>James Callan</dc:creator>
    <dc:creator>Charles Viles</dc:creator>
    <dc:creator>Travis Emmitt</dc:creator>
    <dc:creator>Kevin Prey</dc:creator>
    <dc:creator>Yun Mou</dc:creator>
    <dc:source>(1999), pp. 238-245.</dc:source>
    <dc:date>2007-05-29T12:27:59-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:startingPage>238</prism:startingPage>
    <prism:endingPage>245</prism:endingPage>
    <prism:category>algorithm</prism:category>
    <prism:category>database-selection</prism:category>
    <prism:category>dir</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/tolosoft/article/340788">
    <title>Modeling search engine effectiveness for federated search</title>
    <link>http://www.citeulike.org/user/tolosoft/article/340788</link>
    <description>&lt;i&gt;(2005), pp. 83-90.&lt;/i&gt;</description>
    <dc:title>Modeling search engine effectiveness for federated search</dc:title>

    <dc:creator>Luo Si</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1145/1076034.1076051</dc:identifier>
    <dc:source>(2005), pp. 83-90.</dc:source>
    <dc:date>2005-10-04T15:28:08-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:startingPage>83</prism:startingPage>
    <prism:endingPage>90</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>dir</prism:category>
    <prism:category>search-engine</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/giorgis/article/1466101">
    <title>Recent experiments with INQUERY</title>
    <link>http://www.citeulike.org/user/giorgis/article/1466101</link>
    <description>&lt;i&gt;(1995)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;this paper focuses on relevant differences to the previously published algorithms. 1 Description of Ad-Hoc Experiments</description>
    <dc:title>Recent experiments with INQUERY</dc:title>

    <dc:creator>J Allan</dc:creator>
    <dc:creator>L Ballesteros</dc:creator>
    <dc:creator>J Callan</dc:creator>
    <dc:creator>W Croft</dc:creator>
    <dc:creator>Z Lu</dc:creator>
    <dc:source>(1995)</dc:source>
    <dc:date>2007-07-18T23:52:05-00:00</dc:date>
    <prism:publicationYear>1995</prism:publicationYear>
    <prism:category>index</prism:category>
    <prism:category>text</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/zeze/article/1429764">
    <title>Exact Solution of a Boundary Conformal Field Theory</title>
    <link>http://www.citeulike.org/user/zeze/article/1429764</link>
    <description>&lt;i&gt;(25 May 2003)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We study the conformal field theory of a free massless scalar field living on the half line with interactions introduced via a periodic potential at the boundary. An SU(2) current algebra underlies this system and the interacting boundary state is given by a global SU(2) rotation of the left-moving fields in the zero-potential (Neumann) boundary state. As the potential strength varies from zero to infinity, the boundary state interpolates between the Neumann and the Dirichlet values. The full S-matrix for scattering from the boundary, with arbitrary particle production, is explicitly computed. To maintain unitarity, it is necessary to attribute a hidden discrete &#8220;soliton&#8221; degree of freedom to the boundary. The same unitarity puzzle occurs in the Kondo problem, and we anticipate a similar solution.</description>
    <dc:title>Exact Solution of a Boundary Conformal Field Theory</dc:title>

    <dc:creator>Curtis Callan</dc:creator>
    <dc:creator>Igor Klebanov</dc:creator>
    <dc:creator>Andreas Ludwig</dc:creator>
    <dc:creator>Juan Maldacena</dc:creator>
    <dc:source>(25 May 2003)</dc:source>
    <dc:date>2007-07-03T02:51:19-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/AlisonBabeu/article/1108820">
    <title>Personalisation and recommender systems in digital libraries</title>
    <link>http://www.citeulike.org/user/AlisonBabeu/article/1108820</link>
    <description>&lt;i&gt;International Journal on Digital Libraries, Vol. V5, No. 4. (2005), pp. 299-308.&lt;/i&gt;</description>
    <dc:title>Personalisation and recommender systems in digital libraries</dc:title>

    <dc:creator>Alan Smeaton</dc:creator>
    <dc:creator>Jamie Callan</dc:creator>
    <dc:identifier>doi:10.1007/s00799-004-0100-1</dc:identifier>
    <dc:source>International Journal on Digital Libraries, Vol. V5, No. 4. (2005), pp. 299-308.</dc:source>
    <dc:date>2007-02-15T20:26:40-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>International Journal on Digital Libraries</prism:publicationName>
    <prism:volume>V5</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>299</prism:startingPage>
    <prism:endingPage>308</prism:endingPage>
    <prism:category>digital_libraries</prism:category>
    <prism:category>personalization</prism:category>
    <prism:category>recommender_systems</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/vitalaswp4/article/1088603">
    <title>Automatic Image Annotation and Retrieval using Cross-Media Relevance Models</title>
    <link>http://www.citeulike.org/user/vitalaswp4/article/1088603</link>
    <description>&lt;i&gt;SIGIR Forum, No. SPEC. ISS.., pp. 119-126.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Libraries have traditionally used manual image annotation for indexing and then later retrieving their image collections. However, manual image annotation is an expensive and labor intensive procedure and hence there has been great interest in coming up with automatic ways to retrieve images based on content. Here, we propose an automatic approach to annotating and retrieving images based on a training set of images. We assume that regions in an image can be described using a small vocabulary of blobs. Blobs are generated from image features using clustering. Given a training set of images with annotations, we show that probabilistic models allow us to predict the probability of generating a word given the blobs in an image. This may be used to automatically annotate and retrieve images given a word as a query. We show that relevance models, allow us to derive these probabilities in a natural way. Experiments show that the annotation performance of this cross-media relevance model is almost six times as good (in terms of mean precision) than a model based on word-blob co-occurrence model and twice as good as a state of the art model derived from machine translation. Our approach shows the usefulness of using formal information retrieval models for the task of image annotation and retrieval. Sponsors: ACM/SIGIR</description>
    <dc:title>Automatic Image Annotation and Retrieval using Cross-Media Relevance Models</dc:title>

    <dc:creator>J Jeon</dc:creator>
    <dc:creator>V Lavrenko</dc:creator>
    <dc:creator>R Manmatha</dc:creator>
    <dc:source>SIGIR Forum, No. SPEC. ISS.., pp. 119-126.</dc:source>
    <dc:date>2007-02-05T15:51:57-00:00</dc:date>
    <prism:publicationName>SIGIR Forum</prism:publicationName>
    <prism:number>SPEC. ISS.</prism:number>
    <prism:startingPage>119</prism:startingPage>
    <prism:endingPage>126</prism:endingPage>
    <prism:category>cross-media</prism:category>
    <prism:category>image-annotation</prism:category>
    <prism:category>ir</prism:category>
    <prism:category>language-modeling</prism:category>
    <prism:category>relevance-model</prism:category>
</item>



</rdf:RDF>

