<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:s="http://www.techrepublic.com/search" xmlns:dc="http://purl.org/dc/elements/1.1/"  xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
    <title><![CDATA[Research Library - White Papers, Webcasts and Case Studies - TechRepublic ]]></title>
    <link><![CDATA[http://www.techrepublic.com/research-library]]></link>
    <atom:link rel="hub" type="application/rss+xml" href="http://pubsubhubbub.appspot.com/" />
    <atom:link rel="self" type="application/rss+xml" href="http://www.techrepublic.com/research-library/open+university+of+israel?mode=rss" />

    <description><![CDATA[]]></description>
    <s:counts start="" returned="" found="" />
    <language>en-us</language>
    <lastBuildDate>2013-05-25T06:57:46-07:00</lastBuildDate>
            <item>
        <title><![CDATA[FairE9: Fair File Distribution Over Mesh-Only Peer-to-Peer]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/faire9-fair-file-distribution-over-mesh-only-peer-to-peer/32887719]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Peer-To-Peer (P2P) networks are in the spotlight due to the wide-spreading file-sharing applications. Many file-distributing algorithms have been suggested and implemented. The various solutions...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/faire9-fair-file-distribution-over-mesh-only-peer-to-peer/32887719]]></guid>
        <pubDate>Wed, 24 Apr 2013 23:20:47 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Coding Against Delayed Adversaries]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/coding-against-delayed-adversaries/32557798]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[In this paper, the authors consider the communication of information in the presence of a delayed adversarial jammer. In the setting under study, a sender wishes to communicate a message to a...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/coding-against-delayed-adversaries/32557798]]></guid>
        <pubDate>Sat, 27 Oct 2012 00:07:35 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Improved Upper Bounds on the Capacity of Binary Channels With Causal Adversaries]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/improved-upper-bounds-on-the-capacity-of-binary-channels-with-causal-adversaries/32557792]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[In this paper, the authors consider the communication of information in the presence of a causal adversarial jammer. The adversarial jammer can view the transmitted bits xi one at a time, and can...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/improved-upper-bounds-on-the-capacity-of-binary-channels-with-causal-adversaries/32557792]]></guid>
        <pubDate>Sat, 27 Oct 2012 00:01:24 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Distributed Primal-Dual Approximation Algorithms for Network Design Problems]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/distributed-primal-dual-approximation-algorithms-for-network-design-problems/3791917]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Distributed approximation algorithms aim to establish a trade off between optimality of a distributed algorithm solution for the communication complexity - number of communication rounds and...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/distributed-primal-dual-approximation-algorithms-for-network-design-problems/3791917]]></guid>
        <pubDate>Tue, 03 Jan 2012 06:59:24 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Inapproximability of Survivable Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/inapproximability-of-survivable-networks/3791913]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. The authors give a novel approximation ratio...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/inapproximability-of-survivable-networks/3791913]]></guid>
        <pubDate>Tue, 03 Jan 2012 06:57:21 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Mining the Successful Binary Combinations: Methodology and a Simple Case Study]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/mining-the-successful-binary-combinations-methodology-and-a-simple-case-study/2923645]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding success/failure factors...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/mining-the-successful-binary-combinations-methodology-and-a-simple-case-study/2923645]]></guid>
        <pubDate>Tue, 07 Jun 2011 08:16:09 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[MODELTALK: A Framework for Developing Domain Specific Executable Models]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/modeltalk-a-framework-for-developing-domain-specific-executable-models/2875811]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Developing and maintaining complex, large-scale, product line of highly customized software systems is difficult and costly. Part of the difficulty is due to the need to communicate business...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/modeltalk-a-framework-for-developing-domain-specific-executable-models/2875811]]></guid>
        <pubDate>Wed, 27 Apr 2011 10:41:26 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[A Comparative Case Study of Code Reuse With Language Oriented Programming]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/a-comparative-case-study-of-code-reuse-with-language-oriented-programming/2860247]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[There is a gap between the ability to reuse high-level concepts in software design and the ability to reuse the code implementing them. Language Oriented Programming (LOP) is a software...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/a-comparative-case-study-of-code-reuse-with-language-oriented-programming/2860247]]></guid>
        <pubDate>Fri, 15 Apr 2011 07:55:19 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Usability Issues in Mobile-Wireless Information Systems]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/usability-issues-in-mobile-wireless-information-systems/1195195]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Usability is one of the characteristics that compose the multi-dimension concept of information systems' quality. Technology improvements enable the building of information systems to be used &quot;Any...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/usability-issues-in-mobile-wireless-information-systems/1195195]]></guid>
        <pubDate>Thu, 26 Nov 2009 00:26:19 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
    </channel>
</rss>

