<?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 16:08:42 BST</pubDate>


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


	<link>http://www.citeulike.org/author/Bhargava</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/chinkeong/article/3134586"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/Neeperando/article/2969076"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/Steffen_Sorensen/article/3024672"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/Ubiquitousuk/article/2970414"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2859281"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/jbd4f/article/2767543"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/apulido/article/2766820"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/paulschlesinger/article/2714343"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/rrufai/article/2567716"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/Guerlet/article/2407804"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/masaakif/article/2401509"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mrkoot/article/2373217"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/Evie_Smith/article/1428541"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/Baris22/article/2214245"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/Baris22/article/1181656"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/plutonheaven/article/1898959"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/catcatdog/article/950764"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/1911395"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/IanCullen/article/898200"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/qiuyl/article/1567658"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/xingxu/article/1541308"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/burgod/article/1468588"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mrkoot/article/1428511"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/Tania/article/1218899"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/MaryDeDecker/article/1204870"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/svenot/article/783802"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/svenot/article/786247"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/uz_labu_laimi/article/1140436"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/cottrell/article/1056529"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/kengg/article/483476"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mrkoot/article/1033018"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/babyone/article/707173"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/pratap/article/761552"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mkhabbazian/article/943559"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/thomaswuebben/article/933404"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mzygmunt/article/916104"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/khpoo/article/56646"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/rv101/article/882091"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/HailunTan/article/816821"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/sapusec/article/797832"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dchughes/article/792368"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/NitinCR/article/762389"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/p2pstreaming/article/760307"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/yagibear/article/258741"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/degrange/article/584153"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/planetoid/article/407780"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/cebu/article/280168"/>

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


<item rdf:about="http://www.citeulike.org/user/chinkeong/article/3134586">
    <title>Cross-Layer Rate and Power Adaptation Strategies for IR-HARQ Systems over Fading Channels with Memory: A SMDP-Based Approach</title>
    <link>http://www.citeulike.org/user/chinkeong/article/3134586</link>
    <description>&lt;i&gt;Communications, IEEE Transactions on, Vol. 56, No. 8. (2008), pp. 1352-1365.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Incremental-redundancy hybrid automatic repeatrequest (IR-HARQ) schemes are proposed in several wireless standards for increased throughput-efficiency and greater reliability. We investigate transmit power and modulation order adaptation strategies for the IR-HARQ schemes over correlated Rayleigh fading channels using semi-Markov decision processbased model. In order to jointly analyze physical layer and link layer, transmitter model incorporates a finite-size buffer that receives randomly varying traffic from a higher layer application. It is assumed that channel variations can be modeled with a firstorder Markov chain. We show that the optimal transmission power and rate adaptation laws under buffering delay and packet overflow constraints can be obtained using the framework of semi-Markov decision process. We discuss three different adaptation models for the IR-HARQ schemes and compare their performances with the non-adaptive scheme. It is shown that unique optimal policy exists for each case and it can be computed using linear programming approach. This optimal policy is then applied for realistic channel fading and incoming traffic samples to evaluate its performance for both hard-decision and softdecision decoding. Simulation results in general point out that substantial power savings can be achieved using adaptation and also if the transmission-delay requirements are relaxed.</description>
    <dc:title>Cross-Layer Rate and Power Adaptation Strategies for IR-HARQ Systems over Fading Channels with Memory: A SMDP-Based Approach</dc:title>

    <dc:creator>AK Karmokar</dc:creator>
    <dc:creator>DV Djonin</dc:creator>
    <dc:creator>VK Bhargava</dc:creator>
    <dc:identifier>doi:10.1109/TCOMM.2008.060106</dc:identifier>
    <dc:source>Communications, IEEE Transactions on, Vol. 56, No. 8. (2008), pp. 1352-1365.</dc:source>
    <dc:date>2008-08-19T00:14:58-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:publicationName>Communications, IEEE Transactions on</prism:publicationName>
    <prism:volume>56</prism:volume>
    <prism:number>8</prism:number>
    <prism:startingPage>1352</prism:startingPage>
    <prism:endingPage>1365</prism:endingPage>
    <prism:category>control_communications</prism:category>
    <prism:category>cross_layer</prism:category>
    <prism:category>dynamic</prism:category>
    <prism:category>fsmc</prism:category>
    <prism:category>programming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/Neeperando/article/2969076">
    <title>Comparative proteogenomics: Combining mass spectrometry and comparative genomics to analyze multiple genomes</title>
    <link>http://www.citeulike.org/user/Neeperando/article/2969076</link>
    <description>&lt;i&gt;Genome Res., Vol. 18, No. 7. (1 July 2008), pp. 1133-1142.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Recent proliferation of low-cost DNA sequencing techniques will soon lead to an explosive growth in the number of sequenced genomes and will turn manual annotations into a luxury. Mass spectrometry recently emerged as a valuable technique for proteogenomic annotations that improves on the state-of-the-art in predicting genes and other features. However, previous proteogenomic approaches were limited to a single genome and did not take advantage of analyzing mass spectrometry data from multiple genomes at once. We show that such a comparative proteogenomics approach (like comparative genomics) allows one to address the problems that remained beyond the reach of the traditional &#34;single proteome&#34; approach in mass spectrometry. In particular, we show how comparative proteogenomics addresses the notoriously difficult problem of &#34;one-hit-wonders&#34; in proteomics, improves on the existing gene prediction tools in genomics, and allows identification of rare post-translational modifications. We therefore argue that complementing DNA sequencing projects by comparative proteogenomics projects can be a viable approach to improve both genomic and proteomic annotations. 10.1101/gr.074344.107</description>
    <dc:title>Comparative proteogenomics: Combining mass spectrometry and comparative genomics to analyze multiple genomes</dc:title>

    <dc:creator>Nitin Gupta</dc:creator>
    <dc:creator>Jamal Benhamida</dc:creator>
    <dc:creator>Vipul Bhargava</dc:creator>
    <dc:creator>Daniel Goodman</dc:creator>
    <dc:creator>Elisabeth Kain</dc:creator>
    <dc:creator>Ian Kerman</dc:creator>
    <dc:creator>Ngan Nguyen</dc:creator>
    <dc:creator>Noah Ollikainen</dc:creator>
    <dc:creator>Jesse Rodriguez</dc:creator>
    <dc:creator>Jian Wang</dc:creator>
    <dc:creator>Mary Lipton</dc:creator>
    <dc:creator>Margaret Romine</dc:creator>
    <dc:creator>Vineet Bafna</dc:creator>
    <dc:creator>Richard Smith</dc:creator>
    <dc:creator>Pavel Pevzner</dc:creator>
    <dc:identifier>doi:10.1101/gr.074344.107</dc:identifier>
    <dc:source>Genome Res., Vol. 18, No. 7. (1 July 2008), pp. 1133-1142.</dc:source>
    <dc:date>2008-07-07T09:52:16-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:publicationName>Genome Res.</prism:publicationName>
    <prism:volume>18</prism:volume>
    <prism:number>7</prism:number>
    <prism:startingPage>1133</prism:startingPage>
    <prism:endingPage>1142</prism:endingPage>
    <prism:category>comparative</prism:category>
    <prism:category>genomics</prism:category>
    <prism:category>mass-spectrometry</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/Steffen_Sorensen/article/3024672">
    <title>State of the art smart spaces: application models and software infrastructure</title>
    <link>http://www.citeulike.org/user/Steffen_Sorensen/article/3024672</link>
    <description>&lt;i&gt;Ubiquity, Vol. 7, No. 37. (2006), pp. 2-9.&lt;/i&gt;</description>
    <dc:title>State of the art smart spaces: application models and software infrastructure</dc:title>

    <dc:creator>Ramesh Singh</dc:creator>
    <dc:creator>Preeti Bhargava</dc:creator>
    <dc:creator>Samta Kain</dc:creator>
    <dc:identifier>doi:10.1145/1167867.1167869</dc:identifier>
    <dc:source>Ubiquity, Vol. 7, No. 37. (2006), pp. 2-9.</dc:source>
    <dc:date>2008-07-21T15:14:06-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Ubiquity</prism:publicationName>
    <prism:volume>7</prism:volume>
    <prism:number>37</prism:number>
    <prism:startingPage>2</prism:startingPage>
    <prism:endingPage>9</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/Ubiquitousuk/article/2970414">
    <title>Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms</title>
    <link>http://www.citeulike.org/user/Ubiquitousuk/article/2970414</link>
    <description>&lt;i&gt;INFORMS J. on Computing, Vol. 19, No. 1. (January 2007), pp. 137-148.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The practice of sponsored search advertising---where advertisers pay a fee to appear alongside particular Web search results---is now one of the largest and fastest growing source of revenue for Web search engines. We model and compare several mechanisms for allocating sponsored slots, including stylized versions of those used by Overture and Google, the two biggest brokers of sponsored search. The performance of these mechanisms depends on the degree of correlation between providers' willingness to pay and their relevance to the search term. Ranking providers based on the product of relevance and bid price performs well and is robust across varying degrees of correlation. Ranking purely based on bid price fares nearly as well when bids and relevance are positively correlated (the expected regime), and is further enhanced by adding an editorial filter. Regardless of the allocation mechanism, sponsored search revenues are lower when users' attention decays quickly at lower ranks, emphasizing the need to develop better user interfaces and control features. The search engine can address initial inscience of relevance scores by modifying rank allocations over time as it observes clickthroughs at each rank. We propose a rank-revision strategy that weights clicks on lower ranked items more than clicks on higher ranked items. This method is shown to converge to the optimal (maximum revenue) ordering faster and more consistently than other methods.</description>
    <dc:title>Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms</dc:title>

    <dc:creator>Juan Feng</dc:creator>
    <dc:creator>Hemant Bhargava</dc:creator>
    <dc:creator>David Pennock</dc:creator>
    <dc:identifier>doi:10.1287/ijoc.1050.0135</dc:identifier>
    <dc:source>INFORMS J. on Computing, Vol. 19, No. 1. (January 2007), pp. 137-148.</dc:source>
    <dc:date>2008-07-07T15:37:12-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>INFORMS J. on Computing</prism:publicationName>
    <prism:issn>1526-5528</prism:issn>
    <prism:volume>19</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>137</prism:startingPage>
    <prism:endingPage>148</prism:endingPage>
    <prism:publisher>INFORMS</prism:publisher>
    <prism:category>advertising</prism:category>
    <prism:category>auctions</prism:category>
    <prism:category>internet_auctions</prism:category>
    <prism:category>paper_02_search_engine_competition</prism:category>
    <prism:category>search_engines</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2859281">
    <title>On timing offset estimation for OFDM systems</title>
    <link>http://www.citeulike.org/user/dcastro/article/2859281</link>
    <description>&lt;i&gt;Communications Letters, IEEE, Vol. 4, No. 7. (2000), pp. 242-244.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Two timing offset estimation methods for orthogonal frequency division multiplexing (OFDM) systems as modifications to Schmidl and Cox's method (see IEEE Trans. Commun., vol.45, p.1613-21, 1997) are presented. The performances of the timing offset estimators in additive white Gaussian noise channel and intersymbol interference channel are compared in terms of estimator variance obtained by simulation. Both proposed methods have significantly smaller estimator variance in both channel conditions</description>
    <dc:title>On timing offset estimation for OFDM systems</dc:title>

    <dc:creator>H Minn</dc:creator>
    <dc:creator>M Zeng</dc:creator>
    <dc:creator>VK Bhargava</dc:creator>
    <dc:identifier>doi:10.1109/4234.852929</dc:identifier>
    <dc:source>Communications Letters, IEEE, Vol. 4, No. 7. (2000), pp. 242-244.</dc:source>
    <dc:date>2008-06-03T14:50:55-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:publicationName>Communications Letters, IEEE</prism:publicationName>
    <prism:volume>4</prism:volume>
    <prism:number>7</prism:number>
    <prism:startingPage>242</prism:startingPage>
    <prism:endingPage>244</prism:endingPage>
    <prism:category>error</prism:category>
    <prism:category>ofdm</prism:category>
    <prism:category>offset</prism:category>
    <prism:category>synchronization</prism:category>
    <prism:category>time</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/jbd4f/article/2767543">
    <title>ISI-free pulses for high-data-rate ultra-wideband wireless systems</title>
    <link>http://www.citeulike.org/user/jbd4f/article/2767543</link>
    <description>&lt;i&gt;Electrical and Computer Engineering, Canadian Journal of, Vol. 32, No. 4. (2007), pp. 187-192.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Modified intersymbol interference (ISI)¿free pulses and ISI-free band-limited polynomial pulses for ultra-wideband (UWB) communication systems are proposed to provide the possibility of very high data rates not achievable by conventional pulses and the pulse design algorithms available in the literature. The power spectrum of the proposed pulses fits the Federal Communications Commission (FCC) spectral mask for very high data rates that have quantized values with various levels. Using this scheme and a particular choice of design variables, it is possible to design orthogonal pulses that could be used for multi-user data communication after they are truncated for the same time interval. Several possible improvements for these proposed pulses are considered for certain practical cases.</description>
    <dc:title>ISI-free pulses for high-data-rate ultra-wideband wireless systems</dc:title>

    <dc:creator>Z Hasan</dc:creator>
    <dc:creator>U Phuyal</dc:creator>
    <dc:creator>V Yadav</dc:creator>
    <dc:creator>AK Chaturvedi</dc:creator>
    <dc:creator>VK Bhargava</dc:creator>
    <dc:identifier>doi:10.1109/CJECE.2007.4407664</dc:identifier>
    <dc:source>Electrical and Computer Engineering, Canadian Journal of, Vol. 32, No. 4. (2007), pp. 187-192.</dc:source>
    <dc:date>2008-05-07T22:28:13-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Electrical and Computer Engineering, Canadian Journal of</prism:publicationName>
    <prism:volume>32</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>187</prism:startingPage>
    <prism:endingPage>192</prism:endingPage>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/apulido/article/2766820">
    <title>Adsorption of NO on Cu Exchanged Zeolites, an FTIR Study: Effects of Cu Levels, NO Pressure, and Catalyst Pretreatment</title>
    <link>http://www.citeulike.org/user/apulido/article/2766820</link>
    <description>&lt;i&gt;Journal of Catalysis, Vol. 158, No. 1. (January 1996), pp. 301-310.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Three different copper zeolite systems (Cu-ZSM5, Cu-UHSY, and Cu-mordenite) have been prepared with different copper loadings from low to over exchange levels. The surface chemistry of three systems has been studied using IR spectra of adsorbed NO. Most of the copper in Cu-ZSM5 was in the form of Cu(I). Cu(II) species were predominant in Cu-mordenite. For Cu-UHSY the number of Cu(I) species increased as the level of copper loading increased. The catalytic activity for NO decomposition appeared to depend on a Cu(I)-Cu(II) redox cycle which resulted in the formation of an ON-Cu2+-NO-2complex, previously postulated as the critical intermediate in the reaction. Both oxidation and regeneration of the Cu(I) sites in Cu-ZSM5 occurred readily. In Cu-UHSY oxidation was low, suggesting that Cu(I) species were more stable. Cu(II) was the prominent copper species in Cu-mordenite, and regeneration of the Cu(I) sites was difficult. Stability, oxidation, and regeneration of Cu(I) sites play a major role in NO decomposition. In over-exchanged Cu-ZSM5, the Cu(I) sites were more stable, and the rate of oxidation was high. Furthermore a large number of reduced sites were readily regenerated from the Cu(II), thus making it the most effective catalyst for the decomposition of NO.</description>
    <dc:title>Adsorption of NO on Cu Exchanged Zeolites, an FTIR Study: Effects of Cu Levels, NO Pressure, and Catalyst Pretreatment</dc:title>

    <dc:creator>T Cheung</dc:creator>
    <dc:creator>SK Bhargava</dc:creator>
    <dc:creator>M Hobday</dc:creator>
    <dc:creator>K Foger</dc:creator>
    <dc:identifier>doi:10.1006/jcat.1996.0029</dc:identifier>
    <dc:source>Journal of Catalysis, Vol. 158, No. 1. (January 1996), pp. 301-310.</dc:source>
    <dc:date>2008-05-07T15:32:27-00:00</dc:date>
    <prism:publicationYear>1996</prism:publicationYear>
    <prism:publicationName>Journal of Catalysis</prism:publicationName>
    <prism:volume>158</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>301</prism:startingPage>
    <prism:endingPage>310</prism:endingPage>
    <prism:category>nox_dinitrosyl</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/paulschlesinger/article/2714343">
    <title>Membrane Binding, Structure, and Localization of Cecropin-Mellitin Hybrid Peptides: A Site-Directed Spin-Labeling Study</title>
    <link>http://www.citeulike.org/user/paulschlesinger/article/2714343</link>
    <description>&lt;i&gt;Biophys. J., Vol. 86, No. 1. (1 January 2004), pp. 329-336.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The interaction of antimicrobial peptides with membranes is a key factor in determining their biological activity. In this study we have synthesized a series of minimized cecropin-mellitin hybrid peptides each containing a single cysteine residue, modified the cysteine with the sulfhydryl-specific methanethiosulfonate spin-label, and used electron paramagnetic resonance spectroscopy to measure membrane-binding affinities and determine the orientation and localization of peptides bound to membranes that mimic the bacterial cytoplasmic membrane. All of the peptides were unstructured in aqueous solution but underwent a significant conformational change upon membrane binding that diminished the rotational mobility of the attached spin-label. Apparent partition coefficients were similar for five of the six constructs examined, indicating that location of the spin-label had little effect on peptide binding as long as the attachment site was in the relatively hydrophobic C-terminal domain. Depth measurements based on accessibility of the spin-labeled sites to oxygen and nickel ethylenediaminediacetate indicated that at high lipid/peptide ratios these peptides form a singlealpha -helix, with the helical axis aligned parallel to the bilayer surface and immersed [~]5 A below the membrane-aqueous interface. Such a localization would provide exposure of charged/polar residues on the hydrophilic face of the amphipathic helix to the aqueous phase, and allow the nonpolar residues along the opposite face of the helix to remain immersed in the hydrophobic phase of the bilayer. These results are discussed with respect to the mechanism of membrane disruption by antimicrobial peptides.</description>
    <dc:title>Membrane Binding, Structure, and Localization of Cecropin-Mellitin Hybrid Peptides: A Site-Directed Spin-Labeling Study</dc:title>

    <dc:creator>Kalpana Bhargava</dc:creator>
    <dc:creator>Jimmy Feix</dc:creator>
    <dc:source>Biophys. J., Vol. 86, No. 1. (1 January 2004), pp. 329-336.</dc:source>
    <dc:date>2008-04-24T20:45:58-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Biophys. J.</prism:publicationName>
    <prism:volume>86</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>329</prism:startingPage>
    <prism:endingPage>336</prism:endingPage>
    <prism:category>binding</prism:category>
    <prism:category>cecropin</prism:category>
    <prism:category>label</prism:category>
    <prism:category>melittin</prism:category>
    <prism:category>membrane</prism:category>
    <prism:category>spin</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/rrufai/article/2567716">
    <title>On generating an integrated DSS from a mathematical model specification</title>
    <link>http://www.citeulike.org/user/rrufai/article/2567716</link>
    <description>&lt;i&gt;System Sciences, 1996., Proceedings of the Twenty-Ninth Hawaii International Conference on ,, Vol. 2 (1996), pp. 396-406 vol.2.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Executable mathematical modeling languages (EMLs), designed to facilitate model representation and execution, are traditionally weak in data modeling and management, which often constitutes a majority of the effort in a modeling project. We describe a systematic approach for developing an integrated decision support system given an EML model. This approach is first demonstrated using a model for flight scheduling, integrating a formal data model, represented in a database management system, and a mathematical model, represented in an EML (GAMS). Next, we present a generalized procedure that, for any mathematical model represented in GAMS, produces a data model and a primitive user interface for the mathematical model. Benefits of this approach include explicit data modeling, improved representation and manipulation of model inputs and outputs, greater integrity of input data, and easier interpretation and multiple views of model outputs</description>
    <dc:title>On generating an integrated DSS from a mathematical model specification</dc:title>

    <dc:creator>HK Bhargava</dc:creator>
    <dc:creator>MS Downs</dc:creator>
    <dc:identifier>doi:10.1109/HICSS.1996.495424</dc:identifier>
    <dc:source>System Sciences, 1996., Proceedings of the Twenty-Ninth Hawaii International Conference on ,, Vol. 2 (1996), pp. 396-406 vol.2.</dc:source>
    <dc:date>2008-03-20T17:30:13-00:00</dc:date>
    <prism:publicationYear>1996</prism:publicationYear>
    <prism:publicationName>System Sciences, 1996., Proceedings of the Twenty-Ninth Hawaii International Conference on ,</prism:publicationName>
    <prism:volume>2</prism:volume>
    <prism:startingPage>396</prism:startingPage>
    <prism:endingPage>406 vol.2</prism:endingPage>
    <prism:category>mathematicalmodeling</prism:category>
    <prism:category>mathematicalprogramming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/Guerlet/article/2407804">
    <title>Identification of an intersubunit cross-link between substituted cysteine residues located in the putative ATP binding site of the P2X1 receptor.</title>
    <link>http://www.citeulike.org/user/Guerlet/article/2407804</link>
    <description>&lt;i&gt;J Neurosci, Vol. 27, No. 6. (7 February 2007), pp. 1456-1466.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;P2X receptors are ATP-gated nonselective cation channels. Functional receptors are assembled as homotrimers or heterotrimers of seven cloned subunits. Each subunit contains two transmembrane domains linked by a large extracellular loop that is required for agonist binding. So far, there is no direct evidence indicating whether the agonist binding site is formed within one subunit or at the interface of two neighboring subunits. Here we used a disulfide cross-linking approach to identify pairs of residues that are in close proximity within the ATP binding site of the P2X1 homotrimer. Eight amino acid residues that have previously been shown to be essential for high ATP potency (K68, K70, F185, K190, F291, R292, R305, and K309) were substituted by cysteine residues, and the respective mutant subunits were pairwise expressed in Xenopus laevis oocytes. Nonreducing SDS-PAGE analysis of the purified receptors revealed a spontaneous and specific dimer formation between the K68C and F291C mutants. An almost complete cross-link into trimers was achieved with the K68C/F291C double mutant, consistent with the formation of intersubunit disulfide bridges. In support of this interpretation, two-electrode voltage-clamp analysis of the K68C/F291C mutations introduced into a nondesensitizing P2X(2-1) chimera showed only small ATP-activated currents that, however, increased approximately 60-fold after extracellular application of the reducing agent dithiothreitol. In addition, we show that a K68C/K309C double mutant is nonfunctional and can be functionally rescued by coexpression with nonmutated subunits. Our data are consistent with loops from neighboring P2X subunits forming the ATP-binding site in P2X receptors.</description>
    <dc:title>Identification of an intersubunit cross-link between substituted cysteine residues located in the putative ATP binding site of the P2X1 receptor.</dc:title>

    <dc:creator>B Marquez-Klaka</dc:creator>
    <dc:creator>J Rettinger</dc:creator>
    <dc:creator>Y Bhargava</dc:creator>
    <dc:creator>T Eisele</dc:creator>
    <dc:creator>A Nicke</dc:creator>
    <dc:identifier>doi:10.1523/JNEUROSCI.3105-06.2007</dc:identifier>
    <dc:source>J Neurosci, Vol. 27, No. 6. (7 February 2007), pp. 1456-1466.</dc:source>
    <dc:date>2008-02-21T15:22:07-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>J Neurosci</prism:publicationName>
    <prism:issn>1529-2401</prism:issn>
    <prism:volume>27</prism:volume>
    <prism:number>6</prism:number>
    <prism:startingPage>1456</prism:startingPage>
    <prism:endingPage>1466</prism:endingPage>
    <prism:category>cross-linking</prism:category>
    <prism:category>p2x</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/masaakif/article/2401509">
    <title>On the Design of Perceptual MPEG-Video Encryption Algorithms</title>
    <link>http://www.citeulike.org/user/masaakif/article/2401509</link>
    <description>&lt;i&gt;IEEE Transactions on Circuits and Systems for Video Technology, Vol. 17, No. 2. (February 2007), pp. 214-223.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In this paper, some existing perceptual encryption algorithms of MPEG videos are reviewed and some problems, especially security defects of two recently proposed MPEG-video perceptual encryption schemes, are pointed out. Then, a simpler and more effective design is suggested, which selectively encrypts fixed-length codewords in MPEG-video bit streams under the control of three perceptibility factors. The proposed design is actually an encryption configuration that can work with any stream cipher or block cipher. Compared with the previously-proposed schemes, the new design provides more useful features, such as strict size-preservation, on-the-fly encryption and multiple perceptibility, which make it possible to support more applications with different requirements. In addition, four different measures are suggested to provide better security against known/chosen-plaintext attacks</description>
    <dc:title>On the Design of Perceptual MPEG-Video Encryption Algorithms</dc:title>

    <dc:creator>Shujun Li</dc:creator>
    <dc:creator>Guanrong Chen</dc:creator>
    <dc:creator>Albert Cheung</dc:creator>
    <dc:creator>Bharat Bhargava</dc:creator>
    <dc:creator>Kwok-Tung Lo</dc:creator>
    <dc:identifier>doi:10.1109/TCSVT.2006.888840</dc:identifier>
    <dc:source>IEEE Transactions on Circuits and Systems for Video Technology, Vol. 17, No. 2. (February 2007), pp. 214-223.</dc:source>
    <dc:date>2008-02-20T05:16:05-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>IEEE Transactions on Circuits and Systems for Video Technology</prism:publicationName>
    <prism:volume>17</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>214</prism:startingPage>
    <prism:endingPage>223</prism:endingPage>
    <prism:category>algorithms</prism:category>
    <prism:category>attack</prism:category>
    <prism:category>attacks</prism:category>
    <prism:category>bit</prism:category>
    <prism:category>codeword</prism:category>
    <prism:category>codewords</prism:category>
    <prism:category>coding</prism:category>
    <prism:category>cryptanalysis</prism:category>
    <prism:category>cryptography</prism:category>
    <prism:category>encryption</prism:category>
    <prism:category>fixed-length</prism:category>
    <prism:category>flc</prism:category>
    <prism:category>knownchosen-plaintext</prism:category>
    <prism:category>mpeg</prism:category>
    <prism:category>mpeg-video</prism:category>
    <prism:category>multiple</prism:category>
    <prism:category>on-the-fly</prism:category>
    <prism:category>perceptibility</prism:category>
    <prism:category>perception</prism:category>
    <prism:category>perceptual</prism:category>
    <prism:category>plain-text</prism:category>
    <prism:category>streams</prism:category>
    <prism:category>video</prism:category>
    <prism:category>visual</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mrkoot/article/2373217">
    <title>Probabilistic anonymity</title>
    <link>http://www.citeulike.org/user/mrkoot/article/2373217</link>
    <description>&lt;i&gt;(2005), pp. 171-185.&lt;/i&gt;</description>
    <dc:title>Probabilistic anonymity</dc:title>

    <dc:creator>Mohit Bhargava</dc:creator>
    <dc:creator>Catuscia Palamidessi</dc:creator>
    <dc:identifier>doi:10.1007/11539452_16</dc:identifier>
    <dc:source>(2005), pp. 171-185.</dc:source>
    <dc:date>2008-02-14T10:07:57-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:startingPage>171</prism:startingPage>
    <prism:endingPage>185</prism:endingPage>
    <prism:publisher>Springer-Verlag</prism:publisher>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/Evie_Smith/article/1428541">
    <title>Authorization based on evidence and trust</title>
    <link>http://www.citeulike.org/user/Evie_Smith/article/1428541</link>
    <description>&lt;i&gt;(2002)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Developing authorization mechanisms for secure information access by a large community of users in an open environment is challenging. Current research efforts grant privilege to a user based on his/her properties that are demonstrated by digital credentials (evidences). Holding credentials does not necessarily certify that the user is trustworthy. We use trust to characterize the possibility that a user will not carry out harmful actions. Authorization based on trust as well as evidence makes...</description>
    <dc:title>Authorization based on evidence and trust</dc:title>

    <dc:creator>B Bhargava</dc:creator>
    <dc:creator>Y Zhong</dc:creator>
    <dc:source>(2002)</dc:source>
    <dc:date>2007-07-02T11:32:17-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:category>authorization</prism:category>
    <prism:category>evidence_based</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/Baris22/article/2214245">
    <title>On Demand Media Streaming Over the Internet</title>
    <link>http://www.citeulike.org/user/Baris22/article/2214245</link>
    <description>&lt;i&gt;(2002)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We propose a new model for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The proposed P2P model can support a large number of clients with a low overall system cost. The P2P model allows for peers to share some of their resources with the system and in return, they get some incentives or rewards. We describe how to realize (or deploy) the proposed model. In addition, we present a new dispersion algorithm (for disseminating the media files into the system) and a...</description>
    <dc:title>On Demand Media Streaming Over the Internet</dc:title>

    <dc:creator>M Hefeeda</dc:creator>
    <dc:creator>B Bhargava</dc:creator>
    <dc:creator>D Yau</dc:creator>
    <dc:source>(2002)</dc:source>
    <dc:date>2008-01-10T12:06:18-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:category>internet</prism:category>
    <prism:category>media</prism:category>
    <prism:category>streaming</prism:category>
    <prism:category>vod</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/Baris22/article/1181656">
    <title>Gnustream: A P2P Media Streaming System Prototype</title>
    <link>http://www.citeulike.org/user/Baris22/article/1181656</link>
    <description>&lt;i&gt;(2003)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We present the design and prototype of GnuStream, a peerto -peer (P2P) and receiver-driven media streaming system.</description>
    <dc:title>Gnustream: A P2P Media Streaming System Prototype</dc:title>

    <dc:creator>Xuxian Jiang</dc:creator>
    <dc:creator>Yu Dong</dc:creator>
    <dc:creator>Dongyan Xu</dc:creator>
    <dc:creator>Bharat Bhargava</dc:creator>
    <dc:source>(2003)</dc:source>
    <dc:date>2007-03-23T13:20:43-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:category>gnu</prism:category>
    <prism:category>media</prism:category>
    <prism:category>p2p</prism:category>
    <prism:category>stream</prism:category>
    <prism:category>streaming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/plutonheaven/article/1898959">
    <title>A robust timing and frequency synchronization for OFDM systems</title>
    <link>http://www.citeulike.org/user/plutonheaven/article/1898959</link>
    <description>&lt;i&gt;Wireless Communications, IEEE Transactions on, Vol. 2, No. 4. (2003), pp. 822-839.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;A robust symbol-timing and carrier-frequency synchronization scheme applicable to orthogonal frequency-division-multiplexing systems is presented. The proposed method is based on a training symbol specifically designed to have a steep rolloff timing metric. The proposed timing metric also provides a robust sync detection capability. Both time domain training and frequency domain (FD) training are investigated. For FD training, maintaining a low peak-to-average power ratio of the training symbol was taken into consideration. The channel estimation scheme based on the designed training symbol was also incorporated in the system in order to give both fine-timing and frequency-offset estimates. For fine frequency estimation, two approaches are presented. The first one is based on the suppression of the interference introduced in the frequency estimation process by the training symbol pattern in the context of multipath dispersive channels. The second one is based on the maximum likelihood principle and does not suffer from any interference. A new performance measure is introduced for timing estimation, which is based on the plot of signal to timing-error-induced average interference power ratio against the timing estimate shift. A simple approach for finding the optimal setting of the timing estimator is presented. Finally, the sync detection, timing estimation, frequency estimation, and bit-error-rate performance of the proposed method are presented in a multipath Rayleigh fading channel.</description>
    <dc:title>A robust timing and frequency synchronization for OFDM systems</dc:title>

    <dc:creator>Hlaing Minn</dc:creator>
    <dc:creator>VK Bhargava</dc:creator>
    <dc:creator>KB Letaief</dc:creator>
    <dc:identifier>doi:10.1109/TWC.2003.814346</dc:identifier>
    <dc:source>Wireless Communications, IEEE Transactions on, Vol. 2, No. 4. (2003), pp. 822-839.</dc:source>
    <dc:date>2007-11-11T15:35:58-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>Wireless Communications, IEEE Transactions on</prism:publicationName>
    <prism:volume>2</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>822</prism:startingPage>
    <prism:endingPage>839</prism:endingPage>
    <prism:category>2003</prism:category>
    <prism:category>favorite</prism:category>
    <prism:category>ofdm</prism:category>
    <prism:category>read</prism:category>
    <prism:category>synchronisation</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/catcatdog/article/950764">
    <title>Visualization of wormholes in sensor networks</title>
    <link>http://www.citeulike.org/user/catcatdog/article/950764</link>
    <description>&lt;i&gt;(2004), pp. 51-60.&lt;/i&gt;</description>
    <dc:title>Visualization of wormholes in sensor networks</dc:title>

    <dc:creator>Weichao Wang</dc:creator>
    <dc:creator>Bharat Bhargava</dc:creator>
    <dc:identifier>doi:10.1145/1023646.1023657</dc:identifier>
    <dc:source>(2004), pp. 51-60.</dc:source>
    <dc:date>2006-11-18T05:33:45-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:startingPage>51</prism:startingPage>
    <prism:endingPage>60</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>attack</prism:category>
    <prism:category>wormhole</prism:category>
    <prism:category>wsn</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/1911395">
    <title>On the Application of Importance Sampling to BER Estimation in the Simulation of Digital Communication Systems</title>
    <link>http://www.citeulike.org/user/dcastro/article/1911395</link>
    <description>&lt;i&gt;Communications, IEEE Transactions on [legacy, pre - 1988], Vol. 35, No. 11. (1987), pp. 1231-1233.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Importance sampling (IS) is a useful technique for reducing the number of Monte Carlo trials in BER estimation. Two important aspects of recent research work in this area are to find more applications of IS BER estimation and to seek a good bias scheme in the implementation of the estimator. This correspondence presents a general and rigorous mathematical description of these aspects of this problem which, we hope, will be useful for further research. We also present a general result on how to choose a good bias scheme which may provide some insight into the problem.</description>
    <dc:title>On the Application of Importance Sampling to BER Estimation in the Simulation of Digital Communication Systems</dc:title>

    <dc:creator>Qiang Wang</dc:creator>
    <dc:creator>V Bhargava</dc:creator>
    <dc:source>Communications, IEEE Transactions on [legacy, pre - 1988], Vol. 35, No. 11. (1987), pp. 1231-1233.</dc:source>
    <dc:date>2007-11-13T23:43:51-00:00</dc:date>
    <prism:publicationYear>1987</prism:publicationYear>
    <prism:publicationName>Communications, IEEE Transactions on [legacy, pre - 1988]</prism:publicationName>
    <prism:volume>35</prism:volume>
    <prism:number>11</prism:number>
    <prism:startingPage>1231</prism:startingPage>
    <prism:endingPage>1233</prism:endingPage>
    <prism:category>importance</prism:category>
    <prism:category>sampling</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/IanCullen/article/898200">
    <title>Optical Properties of Substitutional H- and Li-Atom Impurities in Solid Argon and Neon</title>
    <link>http://www.citeulike.org/user/IanCullen/article/898200</link>
    <description>&lt;i&gt;Physical Review B, Vol. 1, No. 1. (1 January 1970), 1.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;A tight-binding formalism is presented for the calculation of the excitation energies and oscillator strengths for low-lying excitations; and of the ground-state polarizabilities; of substitutional impurities in rare-gas solids. The formalism is applied to hydrogen- and lithium-atom impurities in solid neon and in solid argon at 0Â°K; and numerical results are presented.</description>
    <dc:title>Optical Properties of Substitutional H- and Li-Atom Impurities in Solid Argon and Neon</dc:title>

    <dc:creator>Raj Bhargava</dc:creator>
    <dc:creator>DL Dexter</dc:creator>
    <dc:identifier>doi:10.1103/PhysRevB.1.1</dc:identifier>
    <dc:source>Physical Review B, Vol. 1, No. 1. (1 January 1970), 1.</dc:source>
    <dc:date>2006-10-15T12:27:52-00:00</dc:date>
    <prism:publicationYear>1970</prism:publicationYear>
    <prism:publicationName>Physical Review B</prism:publicationName>
    <prism:volume>1</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>1</prism:startingPage>
    <prism:publisher>American Physical Society</prism:publisher>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/qiuyl/article/1567658">
    <title>Progress in Web-based decision support technologies</title>
    <link>http://www.citeulike.org/user/qiuyl/article/1567658</link>
    <description>&lt;i&gt;Decision Support Systems, Vol. 43, No. 4. (August 2007), pp. 1083-1095.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;World Wide Web technologies have transformed the design, development, implementation and deployment of decision support systems. This article reviews and summarizes recent technology developments, current usage of Web-based DSS, and trends in the deployment of such systems. Many firms use the Web as a medium to convey information about DSS products or to distribute DSS software. The use of Web-based computation to provide product demonstrations or to deploy DSS applications for remote access remains less common. The academic literature on Web-based DSS is largely focused on applications and implementations, and only a few articles examine architectural issues or provide design guidelines based on empirical evidence.</description>
    <dc:title>Progress in Web-based decision support technologies</dc:title>

    <dc:creator>Hemant Bhargava</dc:creator>
    <dc:creator>Daniel Power</dc:creator>
    <dc:creator>Daewon Sun</dc:creator>
    <dc:identifier>doi:10.1016/j.dss.2005.07.002</dc:identifier>
    <dc:source>Decision Support Systems, Vol. 43, No. 4. (August 2007), pp. 1083-1095.</dc:source>
    <dc:date>2007-08-15T20:22:27-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Decision Support Systems</prism:publicationName>
    <prism:volume>43</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>1083</prism:startingPage>
    <prism:endingPage>1095</prism:endingPage>
    <prism:category>decision</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/xingxu/article/1541308">
    <title>Proteomics and electron microscopic characterization of the unusual mitochondrial ribosome-related 45S complex in Leishmania tarentolae</title>
    <link>http://www.citeulike.org/user/xingxu/article/1541308</link>
    <description>&lt;i&gt;Molecular and Biochemical Parasitology, Vol. 152, No. 2. (April 2007), pp. 203-212.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;A novel type of ribonucleoprotein (RNP) complex has been described from the kinetoplast-mitochondria of Leishmania tarentolae. The complex, termed the 45S SSU*, contains the 9S small subunit rRNA but does not contain the 12S large subunit rRNA. This complex is the most stable and abundant mitochondrial RNP complex present in Leishmania. As shown by tandem mass spectrometry, the complex contains at least 39 polypeptides with a combined molecular mass of almost 2.1 MDa. These components include several homologs of small subunit ribosomal proteins (S5, S6, S8, S9, S11, S15, S16, S17, S18, MRPS29); however, most of the polypeptides present are unique. Only a few of them show recognizable motifs, such as protein-protein (coiled-coil, Rhodanese) or protein-RNA (pentatricopeptide repeat) interaction domains. A cryo-electron microscopy examination of the 45S SSU* fraction reveals that 27% of particles represent SSU homodimers arranged in a head-to-tail orientation, while the majority of particles are clearly different and show an asymmetric bilobed morphology. Multiple classes of two-dimensional averages were derived for the asymmetrical particles, probably reflecting random orientations of the particles and difficulties in correlating these views with the known projections of ribosomal complexes. One class of the two-dimensional averages shows a SSU moiety attached to a protein mass or masses in a monosome-like appearance. The combined mass spectrometry and electron microscopy data thus indicate that the majority 45S SSU* particles represents a heterodimeric complex in which the SSU of the Leishmania mitochondrial ribosome is associated with an additional protein mass. The biological role of these particles is not known.</description>
    <dc:title>Proteomics and electron microscopic characterization of the unusual mitochondrial ribosome-related 45S complex in Leishmania tarentolae</dc:title>

    <dc:creator>Dmitri Maslov</dc:creator>
    <dc:creator>Linda Spremulli</dc:creator>
    <dc:creator>Manjuli Sharma</dc:creator>
    <dc:creator>Kalpana Bhargava</dc:creator>
    <dc:creator>Domenick Grasso</dc:creator>
    <dc:creator>Arnold Falick</dc:creator>
    <dc:creator>Rajendra Agrawal</dc:creator>
    <dc:creator>Carol Parker</dc:creator>
    <dc:creator>Larry Simpson</dc:creator>
    <dc:identifier>doi:10.1016/j.molbiopara.2007.01.012</dc:identifier>
    <dc:source>Molecular and Biochemical Parasitology, Vol. 152, No. 2. (April 2007), pp. 203-212.</dc:source>
    <dc:date>2007-08-07T16:09:54-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:publicationName>Molecular and Biochemical Parasitology</prism:publicationName>
    <prism:volume>152</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>203</prism:startingPage>
    <prism:endingPage>212</prism:endingPage>
    <prism:category>kinetoplastid</prism:category>
    <prism:category>leishmania</prism:category>
    <prism:category>parasitology</prism:category>
    <prism:category>personal-interest</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/burgod/article/1468588">
    <title>Defending against wormhole attacks in mobile ad hoc networks: Research Articles</title>
    <link>http://www.citeulike.org/user/burgod/article/1468588</link>
    <description>&lt;i&gt;Wirel. Commun. Mob. Comput., Vol. 6, No. 4. (June 2006), pp. 483-503.&lt;/i&gt;</description>
    <dc:title>Defending against wormhole attacks in mobile ad hoc networks: Research Articles</dc:title>

    <dc:creator>Weichao Wang</dc:creator>
    <dc:creator>Bharat Bhargava</dc:creator>
    <dc:creator>Yi Lu</dc:creator>
    <dc:creator>Xiaoxin Wu</dc:creator>
    <dc:identifier>doi:10.1002/wcm.v6:4</dc:identifier>
    <dc:source>Wirel. Commun. Mob. Comput., Vol. 6, No. 4. (June 2006), pp. 483-503.</dc:source>
    <dc:date>2007-07-20T10:18:50-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Wirel. Commun. Mob. Comput.</prism:publicationName>
    <prism:issn>1530-8669</prism:issn>
    <prism:volume>6</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>483</prism:startingPage>
    <prism:endingPage>503</prism:endingPage>
    <prism:publisher>John Wiley and Sons Ltd.</prism:publisher>
    <prism:category>adhoc</prism:category>
    <prism:category>routing-attack</prism:category>
    <prism:category>wormhole</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mrkoot/article/1428511">
    <title>Trust-based privacy preservation for peer-to-peer data sharing</title>
    <link>http://www.citeulike.org/user/mrkoot/article/1428511</link>
    <description>&lt;i&gt;Systems, Man and Cybernetics, Part A, IEEE Transactions on, Vol. 36, No. 3. (2006), pp. 498-502.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Privacy preservation in a peer-to-peer (P2P) system tries to hide the association between the identity of a participant and the data that it is interested in. This paper proposes a trust-based privacy-preservation method for P2P data sharing. It adopts the trust relation between a peer and its collaborators (buddies). The buddy works as a proxy to send the request and acquire the data. This provides a shield under which the identity of the requester and the accessed data cannot be linked. A privacy measuring method is presented to evaluate the proposed mechanism. Dynamic trust assessment and the enhancement to supplier's privacy are discussed.</description>
    <dc:title>Trust-based privacy preservation for peer-to-peer data sharing</dc:title>

    <dc:creator>Yi Lu</dc:creator>
    <dc:creator>Weichao Wang</dc:creator>
    <dc:creator>B Bhargava</dc:creator>
    <dc:creator>Dongyan Xu</dc:creator>
    <dc:identifier>doi:10.1109/TSMCA.2006.871795</dc:identifier>
    <dc:source>Systems, Man and Cybernetics, Part A, IEEE Transactions on, Vol. 36, No. 3. (2006), pp. 498-502.</dc:source>
    <dc:date>2007-07-02T11:15:50-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Systems, Man and Cybernetics, Part A, IEEE Transactions on</prism:publicationName>
    <prism:volume>36</prism:volume>
    <prism:number>3</prism:number>
    <prism:startingPage>498</prism:startingPage>
    <prism:endingPage>502</prism:endingPage>
    <prism:category>p2p</prism:category>
    <prism:category>privacy</prism:category>
    <prism:category>trust</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/Tania/article/1218899">
    <title>Peer-to-peer file-sharing over mobile ad hoc networks</title>
    <link>http://www.citeulike.org/user/Tania/article/1218899</link>
    <description>&lt;i&gt;Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second IEEE Annual Conference on (2004), pp. 104-108.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Current peer-to-peer file-sharing systems mostly work on wired networks. Mobile ad hoc network is characterized as multihop wireless communications between mobile devices. Five routing approaches with different complexity are proposed to enable peer-to-peer file-sharing over mobile ad hoc networks. The complexity of the proposed approaches is evaluated and compared. It is concluded that the cross-layer protocols perform better than simply overlaying peer-to-peer searching protocol on mobile ad hoc networks.</description>
    <dc:title>Peer-to-peer file-sharing over mobile ad hoc networks</dc:title>

    <dc:creator>G Ding</dc:creator>
    <dc:creator>Bharat Bhargava</dc:creator>
    <dc:source>Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second IEEE Annual Conference on (2004), pp. 104-108.</dc:source>
    <dc:date>2007-04-10T08:51:31-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second IEEE Annual Conference on</prism:publicationName>
    <prism:startingPage>104</prism:startingPage>
    <prism:endingPage>108</prism:endingPage>
    <prism:category>purpura</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/MaryDeDecker/article/1204870">
    <title>Effect of hospitalist consultation on treatment of osteoporosis in hip fracture patients.</title>
    <link>http://www.citeulike.org/user/MaryDeDecker/article/1204870</link>
    <description>&lt;i&gt;Osteoporos Int, Vol. 14, No. 8. (August 2003), pp. 665-671.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The objective of this study was to determine if hospitalist consultation during admission for hip fracture results in improved treatment for osteoporosis. This was a retrospective chart review, carried out in a university-based academic hospital. Administrative discharge data was used to identify patients discharged between 1 September 1999 and 1 September 2001, discharged with the diagnosis of hip fracture. Eighty-two patient charts were reviewed after exclusion for traumatic and pathologic fractures. Treatment for osteoporosis consisted of medications recommended by the National Osteoporosis Foundation (NOF), including calcium (+/-vitamin D), estrogen, raloxifene, calcitonin, alendronate and risedronate. Osteoporosis treatment improvement was defined as the addition of a medication for osteoporosis that strengthened treatment. Twenty-nine percent of patients in our study received treatment for osteoporosis at the time of discharge from the hospitalization for hip fracture. While 20% received calcium, only 7% received a bisphosphonate. Twelve percent received improvement in osteoporosis treatment from admission to discharge. Those that received hospitalist consultation did not have a significant improvement in osteoporosis treatment (P=0.314), but had significantly more co-morbid illnesses and were significantly older than those receiving no consultation (P&#60;0.05). Identification of osteoporosis as a medical problem was significantly associated with osteoporosis treatment (P&#60;0.05). Potential barriers to hospitalist consultation's effect on osteoporosis treatment included patient age and co-morbidities. Further research is needed to identify and overcome barriers to effective osteoporosis treatment in patients with fractures.</description>
    <dc:title>Effect of hospitalist consultation on treatment of osteoporosis in hip fracture patients.</dc:title>

    <dc:creator>CM Jachna</dc:creator>
    <dc:creator>J Whittle</dc:creator>
    <dc:creator>B Lukert</dc:creator>
    <dc:creator>L Graves</dc:creator>
    <dc:creator>T Bhargava</dc:creator>
    <dc:identifier>doi:10.1007/s00198-003-1413-4</dc:identifier>
    <dc:source>Osteoporos Int, Vol. 14, No. 8. (August 2003), pp. 665-671.</dc:source>
    <dc:date>2007-04-03T17:39:02-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>Osteoporos Int</prism:publicationName>
    <prism:issn>0937-941X</prism:issn>
    <prism:volume>14</prism:volume>
    <prism:number>8</prism:number>
    <prism:startingPage>665</prism:startingPage>
    <prism:endingPage>671</prism:endingPage>
    <prism:category>fracture</prism:category>
    <prism:category>hip</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/svenot/article/783802">
    <title>GnuStream: a P2P media streaming system prototype</title>
    <link>http://www.citeulike.org/user/svenot/article/783802</link>
    <description>&lt;i&gt;Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on, Vol. 2 (2003), pp. II-325-8 vol.2.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We present the design and prototype of GnuStream, a peer- to-peer (P2P) and receiver-driven media streaming system. GnuStream is built on top of Gnutella, and it integrates dynamic peer location and streaming capacity aggregation. Each GnuStream streaming session is controlled by the receiver peer and involves a dynamic set of peer senders instead of one fixed sender. The receiver aggregates streaming bandwidth from the multiple senders, achieving load distribution and fast reaction to sender capacity and on/off-line status changes. The effectiveness of GnuStream is demonstrated by our experiments with its prototype, which serves as the basis for real-world development and evaluation of resilient P2P media streaming services.</description>
    <dc:title>GnuStream: a P2P media streaming system prototype</dc:title>

    <dc:creator>Xuxian Jiang</dc:creator>
    <dc:creator>Yu Dong</dc:creator>
    <dc:creator>Dongyan Xu</dc:creator>
    <dc:creator>B Bhargava</dc:creator>
    <dc:source>Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on, Vol. 2 (2003), pp. II-325-8 vol.2.</dc:source>
    <dc:date>2006-08-03T02:30:54-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>Multimedia and Expo, 2003. ICME '03. Proceedings. 2003 International Conference on</prism:publicationName>
    <prism:volume>2</prism:volume>
    <prism:startingPage>II</prism:startingPage>
    <prism:endingPage>325-8 vol.2</prism:endingPage>
    <prism:category>p2p_streaming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/svenot/article/786247">
    <title>On peer-to-peer media streaming</title>
    <link>http://www.citeulike.org/user/svenot/article/786247</link>
    <description>&lt;i&gt;Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on (2002), pp. 363-371.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In this paper, we study a peer-to-peer media streaming system with the following characteristics: (1) its streaming capacity grows dynamically; (2) peers do not exhibit server-like behavior; (3) peers are heterogeneous in their bandwidth contribution; and (4) each streaming session may involve multiple supplying peers. Based on these characteristics, we investigate two problems: (1) how to assign media data to multiple supplying peers in one streaming session and (2) how to quickly amplify the system's total streaming capacity. Our solution to the first problem is an optimal media data assignment algorithm OTS/sub p2p/, which results in minimum buffering delay in the consequent streaming session. Our solution to the second problem is a distributed differentiated admission control protocol DAC/sub p2p/. By differentiating between requesting peers with different outbound bandwidth, DAC/sub p2p/ achieves fast system capacity amplification; benefits all requesting peers in admission rate, waiting time, and buffering delay; and creates an incentive for peers to offer their truly available out-bound bandwidth.</description>
    <dc:title>On peer-to-peer media streaming</dc:title>

    <dc:creator>Dongyan Xu</dc:creator>
    <dc:creator>M Hefeeda</dc:creator>
    <dc:creator>S Hambrusch</dc:creator>
    <dc:creator>B Bhargava</dc:creator>
    <dc:source>Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on (2002), pp. 363-371.</dc:source>
    <dc:date>2006-08-04T14:56:51-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on</prism:publicationName>
    <prism:startingPage>363</prism:startingPage>
    <prism:endingPage>371</prism:endingPage>
    <prism:category>p2p_streaming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/uz_labu_laimi/article/1140436">
    <title>Transcription and translation in bovine spermatozoa.</title>
    <link>http://www.citeulike.org/user/uz_labu_laimi/article/1140436</link>
    <description>&lt;i&gt;Nat New Biol, Vol. 240, No. 100. (29 November 1972), pp. 139-143.&lt;/i&gt;</description>
    <dc:title>Transcription and translation in bovine spermatozoa.</dc:title>

    <dc:creator>E Premkumar</dc:creator>
    <dc:creator>PM Bhargava</dc:creator>
    <dc:source>Nat New Biol, Vol. 240, No. 100. (29 November 1972), pp. 139-143.</dc:source>
    <dc:date>2007-03-05T03:44:02-00:00</dc:date>
    <prism:publicationYear>1972</prism:publicationYear>
    <prism:publicationName>Nat New Biol</prism:publicationName>
    <prism:issn>0090-0028</prism:issn>
    <prism:volume>240</prism:volume>
    <prism:number>100</prism:number>
    <prism:startingPage>139</prism:startingPage>
    <prism:endingPage>143</prism:endingPage>
    <prism:category>bovine</prism:category>
    <prism:category>spermatozoa</prism:category>
    <prism:category>transcription</prism:category>
    <prism:category>translation</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/cottrell/article/1056529">
    <title>Hybrid simulations of stochastic reaction-diffusion processes for modeling intracellular signaling pathways</title>
    <link>http://www.citeulike.org/user/cottrell/article/1056529</link>
    <description>&lt;i&gt;Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), Vol. 74, No. 5. (2006)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In the intracellular environment, signaling takes place in a nonideal environment that is spatially heterogeneous and that is noisy, with the noise arising from the low copy numbers of the signaling molecules involved. In this paper, we model intracellular signaling pathways as stochastic reaction-diffusion processes and adapt techniques commonly used by physicists to solve for the spatiotemporal evolution of the signaling pathways. We then apply it to study two problems of relevance to the modeling of intracellular signaling pathways. First, we show that, in the limit of small protein diffusion which is typically the case for proteins in the cytosol crowded by other macromolecules, the extent of diffusion control, in the transient regime, on reactions is greater than previous predictions. Second, we show that the presence of scaffold proteins can modify the phosphorylation activity of a mitogen-activated protein kinase cascade, and explain how this activity is modulated by the scaffold protein concentration.</description>
    <dc:title>Hybrid simulations of stochastic reaction-diffusion processes for modeling intracellular signaling pathways</dc:title>

    <dc:creator>KH Chiam</dc:creator>
    <dc:creator>Chee Tan</dc:creator>
    <dc:creator>Vipul Bhargava</dc:creator>
    <dc:creator>Gunaretnam Rajagopal</dc:creator>
    <dc:identifier>doi:10.1103/PhysRevE.74.051910</dc:identifier>
    <dc:source>Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), Vol. 74, No. 5. (2006)</dc:source>
    <dc:date>2007-01-20T22:17:01-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Physical Review E (Statistical, Nonlinear, and Soft Matter Physics)</prism:publicationName>
    <prism:volume>74</prism:volume>
    <prism:number>5</prism:number>
    <prism:publisher>APS</prism:publisher>
    <prism:category>hybrid</prism:category>
    <prism:category>reaction-diffusion</prism:category>
    <prism:category>simulation</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/kengg/article/483476">
    <title>Signal Transduction and Transcriptional Regulation of Plant Defence Responses</title>
    <link>http://www.citeulike.org/user/kengg/article/483476</link>
    <description>&lt;i&gt;Journal of Phytopathology, Vol. 154, No. 2. (February 2006), pp. 65-74.&lt;/i&gt;</description>
    <dc:title>Signal Transduction and Transcriptional Regulation of Plant Defence Responses</dc:title>

    <dc:creator>BL Jalali</dc:creator>
    <dc:creator>S Bhargava</dc:creator>
    <dc:creator>A Kamble</dc:creator>
    <dc:identifier>doi:10.1111/j.1439-0434.2006.01073.x</dc:identifier>
    <dc:source>Journal of Phytopathology, Vol. 154, No. 2. (February 2006), pp. 65-74.</dc:source>
    <dc:date>2006-01-28T09:59:14-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Journal of Phytopathology</prism:publicationName>
    <prism:issn>0931-1785</prism:issn>
    <prism:volume>154</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>65</prism:startingPage>
    <prism:endingPage>74</prism:endingPage>
    <prism:publisher>Blackwell Publishing</prism:publisher>
    <prism:category>arabidopsis</prism:category>
    <prism:category>disease</prism:category>
    <prism:category>tfs</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mrkoot/article/1033018">
    <title>Pagoda: a dynamic overlay network for routing, data management, and multicasting</title>
    <link>http://www.citeulike.org/user/mrkoot/article/1033018</link>
    <description>&lt;i&gt;(2004), pp. 170-179.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for these systems. While a large collection of scalable peer-to-peer overlay networks has been proposed in recent years, many fundamental questions have remained open. Some of these are: * Is it possible to design deterministic peer-to-peer overlay networks with properties comparable to randomized peer-to-peer systems? * How can peers of non-uniform bandwidth be organized in an overlay network? We propose a dynamic overlay network called Pagoda that provides solutions to both of these problems. The Pagoda network has a constant degree, a logarithmic diameter, and a 1/logarithmic expansion, and therefore matches the properties of the best randomized overlay networks known so far. However, in contrast to these networks, the Pagoda is deterministic and therefore guarantees these properties. The Pagoda can be used to organize both nodes with uniform bandwidth and nodes with non-uniform bandwidth. For nodes with uniform bandwidth, any node insertion or deletion can be executed with logarithmic work, and for nodes with non-uniform bandwidth, any node insertion and deletion can be executed with polylogarithmic work. Moreover, the Pagoda overlay network can route arbitrary multicast problems with a congestion that is within a logarithmic factor of what a best possible overlay network of logarithmic degree for that particular multicast problem can achieve, even though the Pagoda is a constant degree network. This holds even for nodes of arbitrary non-uniform bandwidths. We also show that the Pagoda network can be used for efficient data management.</description>
    <dc:title>Pagoda: a dynamic overlay network for routing, data management, and multicasting</dc:title>

    <dc:creator>Ankur Bhargava</dc:creator>
    <dc:creator>Kishore Kothapalli</dc:creator>
    <dc:creator>Chris Riley</dc:creator>
    <dc:creator>Christian Scheideler</dc:creator>
    <dc:creator>Mark Thober</dc:creator>
    <dc:identifier>doi:10.1145/1007912.1007938</dc:identifier>
    <dc:source>(2004), pp. 170-179.</dc:source>
    <dc:date>2007-01-10T10:26:15-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:startingPage>170</prism:startingPage>
    <prism:endingPage>179</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/babyone/article/707173">
    <title>PROMISE: peer-to-peer media streaming using CollectCast</title>
    <link>http://www.citeulike.org/user/babyone/article/707173</link>
    <description>&lt;i&gt;(2003), pp. 45-54.&lt;/i&gt;</description>
    <dc:title>PROMISE: peer-to-peer media streaming using CollectCast</dc:title>

    <dc:creator>Mohamed Hefeeda</dc:creator>
    <dc:creator>Ahsan Habib</dc:creator>
    <dc:creator>Boyan Botev</dc:creator>
    <dc:creator>Dongyan Xu</dc:creator>
    <dc:creator>Bharat Bhargava</dc:creator>
    <dc:identifier>doi:10.1145/957013.957022&#60;</dc:identifier>
    <dc:source>(2003), pp. 45-54.</dc:source>
    <dc:date>2006-06-22T10:37:08-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:startingPage>45</prism:startingPage>
    <prism:endingPage>54</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>p2p</prism:category>
    <prism:category>streaming</prism:category>
    <prism:category>topology-aware</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/pratap/article/761552">
    <title>Ramanujan---for lowbrows</title>
    <link>http://www.citeulike.org/user/pratap/article/761552</link>
    <description>&lt;i&gt;Amer. Math. Monthly, Vol. 100, No. 7. (1993), pp. 644-656.&lt;/i&gt;</description>
    <dc:title>Ramanujan---for lowbrows</dc:title>

    <dc:creator>Bruce Berndt</dc:creator>
    <dc:creator>S Bhargava</dc:creator>
    <dc:source>Amer. Math. Monthly, Vol. 100, No. 7. (1993), pp. 644-656.</dc:source>
    <dc:date>2006-07-16T23:01:58-00:00</dc:date>
    <prism:publicationYear>1993</prism:publicationYear>
    <prism:publicationName>Amer. Math. Monthly</prism:publicationName>
    <prism:volume>100</prism:volume>
    <prism:number>7</prism:number>
    <prism:startingPage>644</prism:startingPage>
    <prism:endingPage>656</prism:endingPage>
    <prism:category>history</prism:category>
    <prism:category>mathematics</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mkhabbazian/article/943559">
    <title>A new minimal average weight representation for left-to-right point multiplication methods</title>
    <link>http://www.citeulike.org/user/mkhabbazian/article/943559</link>
    <description>&lt;i&gt;Computers, IEEE Transactions on, Vol. 54, No. 11. (2005), pp. 1454-1459.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper introduces a new radix-2 representation with the same average weight as the width-w nonadjacent form (w-NAF). In both w-NAF and the proposed representations, each nonzero digit is an odd integer with absolute value less than M. However, for w-NAF, M is of the form 2/sup w-1/, while, for the proposed representation, it can be any positive integer. Therefore, using the proposed integer representation, we can use the available memory efficiently, which is attractive for devices with limited memory. Another advantage of the proposed representation over-w-NAF is that it can be obtained by scanning the bits from left-to-right. This property is also useful for memory-constrained devices because it can reduce both the time and space complexity of fast point multiplication techniques.</description>
    <dc:title>A new minimal average weight representation for left-to-right point multiplication methods</dc:title>

    <dc:creator>M Khabbazian</dc:creator>
    <dc:creator>TA Gulliver</dc:creator>
    <dc:creator>VK Bhargava</dc:creator>
    <dc:source>Computers, IEEE Transactions on, Vol. 54, No. 11. (2005), pp. 1454-1459.</dc:source>
    <dc:date>2006-11-14T23:30:13-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>Computers, IEEE Transactions on</prism:publicationName>
    <prism:volume>54</prism:volume>
    <prism:number>11</prism:number>
    <prism:startingPage>1454</prism:startingPage>
    <prism:endingPage>1459</prism:endingPage>
    <prism:category>cryptography</prism:category>
    <prism:category>my_publication</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/thomaswuebben/article/933404">
    <title>Characterization of the &#34;native&#34; surface thin film on pure polycrystalline iron: A high resolution XPS and TEM study</title>
    <link>http://www.citeulike.org/user/thomaswuebben/article/933404</link>
    <description>&lt;i&gt;Applied Surface Science, Vol. In Press, Corrected Proof&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The characterization of the &#34;native&#34; surface thin film on pure polycrystalline iron has been studied by high resolution X-ray photoelectron (XP) spectroscopy of Fe 2p and O 1s regions. The film was allowed to form by exposing the sample to atmosphere at ambient conditions for a period of 1 h. The systematic approach used here includes the determination of curve fitting parameters from external standards and their use in fitting the raw data for the surface thin film. The quantitative high resolution XPS analysis involved an angle resolved study of the surface to determine the chemical composition and thickness of this native film. The film was found to be a mixture of Fe3O4 and Fe(OH)2 with a thickness of 1.2 +/- 0.3 nm. This conclusion is consistent with thermodynamics as indicated by the Pourbaix diagram for the Fe-H2O system and the phase diagram for the Fe-oxygen system. A detailed TEM study of the native surface film also supports this conclusion.</description>
    <dc:title>Characterization of the &#34;native&#34; surface thin film on pure polycrystalline iron: A high resolution XPS and TEM study</dc:title>

    <dc:creator>G Bhargava</dc:creator>
    <dc:creator>I Gouzman</dc:creator>
    <dc:creator>CM Chun</dc:creator>
    <dc:creator>TA Ramanarayanan</dc:creator>
    <dc:creator>SL Bernasek</dc:creator>
    <dc:identifier>doi:10.1016/j.apsusc.2006.09.047</dc:identifier>
    <dc:source>Applied Surface Science, Vol. In Press, Corrected Proof</dc:source>
    <dc:date>2006-11-06T14:25:32-00:00</dc:date>
    <prism:publicationName>Applied Surface Science</prism:publicationName>
    <prism:volume>In Press, Corrected Proof</prism:volume>
    <prism:category>eisen</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mzygmunt/article/916104">
    <title>KQML as an Agent Communication Language</title>
    <link>http://www.citeulike.org/user/mzygmunt/article/916104</link>
    <description>&lt;i&gt;(1994), pp. 456-463.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This document and other information on the KRSS group is available as</description>
    <dc:title>KQML as an Agent Communication Language</dc:title>

    <dc:creator>T Finin</dc:creator>
    <dc:creator>R Fritzson</dc:creator>
    <dc:creator>D Mckay</dc:creator>
    <dc:creator>R Mcentire</dc:creator>
    <dc:source>(1994), pp. 456-463.</dc:source>
    <dc:date>2006-10-29T10:01:21-00:00</dc:date>
    <prism:publicationYear>1994</prism:publicationYear>
    <prism:startingPage>456</prism:startingPage>
    <prism:endingPage>463</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>agent</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/khpoo/article/56646">
    <title>A hybrid architecture for cost-effective on-demand media streaming</title>
    <link>http://www.citeulike.org/user/khpoo/article/56646</link>
    <description>&lt;i&gt;Computer Networks, Vol. 44, No. 3. (20 February 2004), pp. 353-382.&lt;/i&gt;</description>
    <dc:title>A hybrid architecture for cost-effective on-demand media streaming</dc:title>

    <dc:creator>MM Hefeeda</dc:creator>
    <dc:creator>BK Bhargava</dc:creator>
    <dc:creator>DKY Yau</dc:creator>
    <dc:identifier>doi:10.1016/j.comnet.2003.10.002 </dc:identifier>
    <dc:source>Computer Networks, Vol. 44, No. 3. (20 February 2004), pp. 353-382.</dc:source>
    <dc:date>2004-12-28T18:02:28-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Computer Networks</prism:publicationName>
    <prism:issn>1389-1286</prism:issn>
    <prism:volume>44</prism:volume>
    <prism:number>3</prism:number>
    <prism:startingPage>353</prism:startingPage>
    <prism:endingPage>382</prism:endingPage>
    <prism:publisher>Elsevier Science</prism:publisher>
    <prism:category>architecture</prism:category>
    <prism:category>hybrid</prism:category>
    <prism:category>media</prism:category>
    <prism:category>streaming</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/rv101/article/882091">
    <title>Phased-array intracardiac echocardiography monitoring during pulmonary vein isolation in patients with atrial fibrillation: impact on outcome and complications.</title>
    <link>http://www.citeulike.org/user/rv101/article/882091</link>
    <description>&lt;i&gt;Circulation, Vol. 107, No. 21. (3 June 2003), pp. 2710-2716.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;BACKGROUND: The objective of this study was to assess the impact of intracardiac echocardiography (ICE) on the long-term success and complications in patients undergoing pulmonary vein isolation (PVI) for treatment of atrial fibrillation (AF). METHODS AND RESULTS: Three hundred fifteen patients underwent PVI for treatment of AF. Each patient underwent ostial isolation of all PVs using a cooled-tip ablation catheter. PVI was performed using circular mapping (CM) alone (group 1, 56 patients), CM and ICE (group 2, 107 patients), and CM and ICE with titration of radiofrequency energy based on visualization of microbubbles by ICE (group 3, 152 patients). After a mean follow-up time of 417+/-145 days, 19.6% (11 of 56), 16.8% (18 of 107), and 9.8% (15 of 152) of patients in groups 1, 2, and 3 experienced recurrence of AF, respectively. Moreover, whereas no group 3 patient experienced severe (&#62;70%) PV stenosis, severe PV stenosis was documented in 3 (3.5%) of 56 patients in group 1 and in 2 (1.8%) of 107 patients in group 2 (P&#60;0.05). No embolic events were detected in group 3 patients. CONCLUSIONS: Intracardiac echocardiography improves the outcome of cooled-tip PVI. Power adjustment guided by direct visualization of microbubble formation reduces the risk of PV stenosis and improves long-term cure.</description>
    <dc:title>Phased-array intracardiac echocardiography monitoring during pulmonary vein isolation in patients with atrial fibrillation: impact on outcome and complications.</dc:title>

    <dc:creator>NF Marrouche</dc:creator>
    <dc:creator>DO Martin</dc:creator>
    <dc:creator>O Wazni</dc:creator>
    <dc:creator>AM Gillinov</dc:creator>
    <dc:creator>A Klein</dc:creator>
    <dc:creator>M Bhargava</dc:creator>
    <dc:creator>E Saad</dc:creator>
    <dc:creator>D Bash</dc:creator>
    <dc:creator>H Yamada</dc:creator>
    <dc:creator>W Jaber</dc:creator>
    <dc:creator>R Schweikert</dc:creator>
    <dc:creator>P Tchou</dc:creator>
    <dc:creator>A Abdul-Karim</dc:creator>
    <dc:creator>W Saliba</dc:creator>
    <dc:creator>A Natale</dc:creator>
    <dc:identifier>doi:10.1161/01.CIR.0000070541.83326.15</dc:identifier>
    <dc:source>Circulation, Vol. 107, No. 21. (3 June 2003), pp. 2710-2716.</dc:source>
    <dc:date>2006-10-02T21:10:20-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>Circulation</prism:publicationName>
    <prism:issn>1524-4539</prism:issn>
    <prism:volume>107</prism:volume>
    <prism:number>21</prism:number>
    <prism:startingPage>2710</prism:startingPage>
    <prism:endingPage>2716</prism:endingPage>
    <prism:category>ultrasound</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/HailunTan/article/816821">
    <title>On security study of two distance vector routing protocols for mobile ad hoc networks</title>
    <link>http://www.citeulike.org/user/HailunTan/article/816821</link>
    <description>&lt;i&gt;Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on (2003), pp. 179-186.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper compares the security properties of ad hoc on-demand distance vector (AODV) and destination sequence distance vector (DSDV) protocols, especially the difference caused by on-demand and proactive route queries. The on-demand route query enables the malicious host to conduct real time attacks on AODV. The communication overhead of attacks on DSDV is independent of the attack methods and the width of attack targets. A single false route propagates slower in AODV than in DSDV. The detection of false destination sequence in AODV heavily depends on the mobility of hosts. False distance vector and false destination sequence attacks are studied by simulation. The delivery ratio, communication overhead, and the propagation of false routes are measured by varying the traffic load and the maximum speed of host movement. The anomalous patterns of sequence numbers detected by destination hosts can be applied to detect the false destination sequence attacks.</description>
    <dc:title>On security study of two distance vector routing protocols for mobile ad hoc networks</dc:title>

    <dc:creator>Weichao Wang</dc:creator>
    <dc:creator>Yi Lu</dc:creator>
    <dc:creator>B Bhargava</dc:creator>
    <dc:source>Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on (2003), pp. 179-186.</dc:source>
    <dc:date>2006-08-25T15:36:59-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on</prism:publicationName>
    <prism:startingPage>179</prism:startingPage>
    <prism:endingPage>186</prism:endingPage>
    <prism:category>adhoc</prism:category>
    <prism:category>security</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/sapusec/article/797832">
    <title>Reliable broadcast in ZigBee networks</title>
    <link>http://www.citeulike.org/user/sapusec/article/797832</link>
    <description>&lt;i&gt;Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005. 2005 Second Annual IEEE Communications Society Conference on (2005), pp. 510-520.&lt;/i&gt;</description>
    <dc:title>Reliable broadcast in ZigBee networks</dc:title>

    <dc:creator>Gang Ding</dc:creator>
    <dc:creator>Z Sahinoglu</dc:creator>
    <dc:creator>B Bhargava</dc:creator>
    <dc:creator>P Orlik</dc:creator>
    <dc:creator>Jinyun Zhang</dc:creator>
    <dc:source>Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005. 2005 Second Annual IEEE Communications Society Conference on (2005), pp. 510-520.</dc:source>
    <dc:date>2006-08-11T21:08:22-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005. 2005 Second Annual IEEE Communications Society Conference on</prism:publicationName>
    <prism:startingPage>510</prism:startingPage>
    <prism:endingPage>520</prism:endingPage>
    <prism:category>no-tag</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dchughes/article/792368">
    <title>Histones in functional diversification. Core histone variants.</title>
    <link>http://www.citeulike.org/user/dchughes/article/792368</link>
    <description>&lt;i&gt;FEBS J, Vol. 272, No. 20. (October 2005), pp. 5149-5168.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Recent research suggests that minor changes in the primary sequence of the conserved histones may become major determinants for the chromatin structure regulating gene expression and other DNA-related processes. An analysis of the involvement of different core histone variants in different nuclear processes and the structure of different variant nucleosome cores shows that this may indeed be so. Histone variants may also be involved in demarcating functional regions of the chromatin. We discuss in this review why two of the four core histones show higher variation. A comparison of the status of variants in yeast with those from higher eukaryotes suggests that histone variants have evolved in synchrony with functional requirement of the cell.</description>
    <dc:title>Histones in functional diversification. Core histone variants.</dc:title>

    <dc:creator>RH Pusarla</dc:creator>
    <dc:creator>P Bhargava</dc:creator>
    <dc:identifier>doi:10.1111/j.1742-4658.2005.04930.x</dc:identifier>
    <dc:source>FEBS J, Vol. 272, No. 20. (October 2005), pp. 5149-5168.</dc:source>
    <dc:date>2006-08-10T11:49:33-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>FEBS J</prism:publicationName>
    <prism:issn>1742-464X</prism:issn>
    <prism:volume>272</prism:volume>
    <prism:number>20</prism:number>
    <prism:startingPage>5149</prism:startingPage>
    <prism:endingPage>5168</prism:endingPage>
    <prism:category>chromatin</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/NitinCR/article/762389">
    <title>Ramanujan---for lowbrows</title>
    <link>http://www.citeulike.org/user/NitinCR/article/762389</link>
    <description>&lt;i&gt;American Mathematical Monthly, Vol. 100, No. 7. (<i>ash 1993), pp. 644-656.</i>&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;this paper is written for lowbrows. Only elementary algebra is needed to prove the lion's share of theorems reported here. Most are found in the unorganized portion of Ramanujan's second notebook, his third notebook, and problems that he posed for readers of the Journal of the Indian Mathematical Society. The results we describe fall under the headings of elementary algebra, equal sums of powers, and elementary number theory.</description>
    <dc:title>Ramanujan---for lowbrows</dc:title>

    <dc:creator>Bruce Berndt</dc:creator>
    <dc:creator>S Bhargava</dc:creator>
    <dc:source>American Mathematical Monthly, Vol. 100, No. 7. (<i>ash 1993), pp. 644-656.</i></dc:source>
    <dc:date>2006-07-17T19:25:59-00:00</dc:date>
    <prism:publicationYear>1993</prism:publicationYear>
    <prism:publicationName>American Mathematical Monthly</prism:publicationName>
    <prism:volume>100</prism:volume>
    <prism:number>7</prism:number>
    <prism:startingPage>644</prism:startingPage>
    <prism:endingPage>656</prism:endingPage>
    <prism:category>ramanujan</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/p2pstreaming/article/760307">
    <title>PROMISE: peer-to-peer media streaming using CollectCast</title>
    <link>http://www.citeulike.org/user/p2pstreaming/article/760307</link>
    <description>&lt;i&gt;(2003), pp. 45-54.&lt;/i&gt;</description>
    <dc:title>PROMISE: peer-to-peer media streaming using CollectCast</dc:title>

    <dc:creator>Mohamed Hefeeda</dc:creator>
    <dc:creator>Ahsan Habib</dc:creator>
    <dc:creator>Boyan Botev</dc:creator>
    <dc:creator>Dongyan Xu</dc:creator>
    <dc:creator>Bharat Bhargava</dc:creator>
    <dc:identifier>doi:10.1145/957013.957022</dc:identifier>
    <dc:source>(2003), pp. 45-54.</dc:source>
    <dc:date>2006-07-15T18:26:16-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:startingPage>45</prism:startingPage>
    <prism:endingPage>54</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>media</prism:category>
    <prism:category>peer</prism:category>
    <prism:category>to</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/yagibear/article/258741">
    <title>Monitoring and controlling QoS network domains</title>
    <link>http://www.citeulike.org/user/yagibear/article/258741</link>
    <description>&lt;i&gt;Int. J. Netw. Manag., Vol. 15, No. 1. (January 2005), pp. 11-29.&lt;/i&gt;</description>
    <dc:title>Monitoring and controlling QoS network domains</dc:title>

    <dc:creator>Ahsan Habib</dc:creator>
    <dc:creator>Sonia Fahmy</dc:creator>
    <dc:creator>Bharat Bhargava</dc:creator>
    <dc:identifier>doi:10.1002/nem.541</dc:identifier>
    <dc:source>Int. J. Netw. Manag., Vol. 15, No. 1. (January 2005), pp. 11-29.</dc:source>
    <dc:date>2005-07-18T01:43:16-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>Int. J. Netw. Manag.</prism:publicationName>
    <prism:issn>1099-1190</prism:issn>
    <prism:volume>15</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>11</prism:startingPage>
    <prism:endingPage>29</prism:endingPage>
    <prism:publisher>John Wiley &#38; Sons, Inc.</prism:publisher>
    <prism:category>network-misbehaviour</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/degrange/article/584153">
    <title>Early observations on lung function studies in symptomatic &#34;gas&#34; exposed population of Bhopal.</title>
    <link>http://www.citeulike.org/user/degrange/article/584153</link>
    <description>&lt;i&gt;Indian J Med Res, Vol. 86 Suppl (1987), pp. 1-10.&lt;/i&gt;</description>
    <dc:title>Early observations on lung function studies in symptomatic &#34;gas&#34; exposed population of Bhopal.</dc:title>

    <dc:creator>DK Bhargava</dc:creator>
    <dc:creator>A Verma</dc:creator>
    <dc:creator>G Batni</dc:creator>
    <dc:creator>NP Misra</dc:creator>
    <dc:creator>UC Tiwari</dc:creator>
    <dc:creator>VK Vijayan</dc:creator>
    <dc:creator>SK Jain</dc:creator>
    <dc:source>Indian J Med Res, Vol. 86 Suppl (1987), pp. 1-10.</dc:source>
    <dc:date>2006-04-12T14:44:09-00:00</dc:date>
    <prism:publicationYear>1987</prism:publicationYear>
    <prism:publicationName>Indian J Med Res</prism:publicationName>
    <prism:issn>0971-5916</prism:issn>
    <prism:volume>86 Suppl</prism:volume>
    <prism:startingPage>1</prism:startingPage>
    <prism:endingPage>10</prism:endingPage>
    <prism:category>bhopal</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/planetoid/article/407780">
    <title>KQML as an Agent Communication Language</title>
    <link>http://www.citeulike.org/user/planetoid/article/407780</link>
    <description>&lt;i&gt;(1994), pp. 456-463.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper describes the design of and experimentation with the Knowledge Query and Manipulation Language (KQML), a new language and protocol for exchanging information and knowledge. This work is part of a larger effort, the ARPA Knowledge Sharing Effort which is aimed at developing techniques and methodology for building large-scale knowledge bases which are sharable and reusable. KQML is both a message format and a message-handling protocol to support run-time knowledge sharing among agents. ...</description>
    <dc:title>KQML as an Agent Communication Language</dc:title>

    <dc:creator>T Finin</dc:creator>
    <dc:creator>R Fritzson</dc:creator>
    <dc:creator>D Mckay</dc:creator>
    <dc:creator>R Mcentire</dc:creator>
    <dc:source>(1994), pp. 456-463.</dc:source>
    <dc:date>2005-11-24T19:37:05-00:00</dc:date>
    <prism:publicationYear>1994</prism:publicationYear>
    <prism:startingPage>456</prism:startingPage>
    <prism:endingPage>463</prism:endingPage>
    <prism:publisher>ACM Press</prism:publisher>
    <prism:category>ontology</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/cebu/article/280168">
    <title>Study of distance vector routing protocols for mobile ad hoc networks</title>
    <link>http://www.citeulike.org/user/cebu/article/280168</link>
    <description>&lt;i&gt;Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on (2003), pp. 187-194.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We investigate the performance issues of destination-sequenced distance vector (DSDV) and ad-hoc on-demand distance vector (AODV) routing protocols for mobile ad hoc networks. Four performance metrics are measured by varying the maximum speed of mobile hosts, the number of connections, and the network size. The correlation between network topology change and mobility is investigated by using linear regression analysis. The simulation results indicate that AODV outperforms DSDV in less stressful situations, while DSDV is more scalable with respect to the network size. It is observed that network congestion is the dominant reason for packet drop for both protocols. We propose a new routing protocol, congestion-aware distance vector (CADV), to address the congestion issues. CADV outperforms AODV in delivery ratio by about 5%, while introduces less protocol load. The result demonstrates that integrating congestion avoidance mechanisms with proactive routing protocols is a promising way to improve performance.</description>
    <dc:title>Study of distance vector routing protocols for mobile ad hoc networks</dc:title>

    <dc:creator>Yi Lu</dc:creator>
    <dc:creator>Weichao Wang</dc:creator>
    <dc:creator>Yuhui Zhong</dc:creator>
    <dc:creator>B Bhargava</dc:creator>
    <dc:source>Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on (2003), pp. 187-194.</dc:source>
    <dc:date>2005-08-12T12:43:48-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:publicationName>Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on</prism:publicationName>
    <prism:startingPage>187</prism:startingPage>
    <prism:endingPage>194</prism:endingPage>
    <prism:category>no-tag</prism:category>
</item>



</rdf:RDF>

