<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:s="http://www.techrepublic.com/search" xmlns:tr="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[stanford university on TechRepublic ]]></title>
    <link><![CDATA[http://www.techrepublic.com/topics/stanford+university?]]></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/topics/stanford+university?mode=rss" />

    <description><![CDATA[]]></description>
    <s:counts start="" returned="20" found="46100" />
    <language>en-us</language>
    <lastBuildDate>2013-05-18T15:42:59-07:00</lastBuildDate>
        <item>
        <title><![CDATA[Physical-Layer Multicasting by Stochastic Transmit Beamforming and Alamouti Space-Time Coding]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/physical-layer-multicasting-by-stochastic-transmit-beamforming-and-alamouti-space-time-coding/32893257]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Consider transceiver designs in a multiuser Multi-Input Single-Output (MISO) downlink channel, where the users are to receive the same data stream simultaneously. This problem, known as physical-layer multicasting, has drawn much interest. Presently, a popularized approach is transmit beamforming, in which the beamforming optimization is handled by a rank-one approximation method called...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/physical-layer-multicasting-by-stochastic-transmit-beamforming-and-alamouti-space-time-coding/32893257]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-05-09T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[A sunny migration for Met Office]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/a-sunny-migration-for-met-office/32892413]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The UK&rsquo;s national weather service saves &amp;#163;45,000 and weeks of time in Windows 7 migration, thanks to ChangeBASE. The Met Office was embarking on a universal migration to Windows 7 from XP, and needed to ensure that its 1,000 applications would be compatible with the new platform. A manual approach to test the applications was deemed too time consuming and too costly, with insufficient...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/a-sunny-migration-for-met-office/32892413]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-05-08T07:00:00Z</pubDate>
                        <category domain="http://www.techrepublic.com/topics/microsoft+office"><![CDATA[Microsoft Office]]></category>
                <category domain="http://www.techrepublic.com/topics/microsoft+windows+7"><![CDATA[Microsoft Windows 7]]></category>
                <category domain="http://www.techrepublic.com/topics/migration"><![CDATA[Migration]]></category>
                <category domain="http://www.techrepublic.com/topics/quest+software+inc."><![CDATA[Quest Software Inc.]]></category>
                                
            </item>
        <item>
        <title><![CDATA[On Decoding the Kth Strongest User in Poisson Networks With Arbitrary Fading Distribution]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/on-decoding-the-kth-strongest-user-in-poisson-networks-with-arbitrary-fading-distribution/32893119]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Consider a d-dimensional network whose transmitters form a non-uniform Poisson point process and whose links are subject to arbitrary fading. Assuming interference from the k-1 strongest users is canceled, the authors derive the probability of decoding the k-th strongest user in closed-form. As a special case, when k=1, this probability is the standard coverage probability. This analytical...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/on-decoding-the-kth-strongest-user-in-poisson-networks-with-arbitrary-fading-distribution/32893119]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-28T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[The Aggregate Throughput in Random Wireless Networks With Successive Interference Cancellation]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/the-aggregate-throughput-in-random-wireless-networks-with-successive-interference-cancellation/32893121]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The feasibility of Successive Interference Cancellation (SIC) depends on the received power ordering from different users, which, in turn, depends on the fading distribution, path loss function and network geometry. Using a framework based on stochastic geometry, this paper studies the aggregate throughput in d-dimensional random wireless networks with SIC capability. The authors consider...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/the-aggregate-throughput-in-random-wireless-networks-with-successive-interference-cancellation/32893121]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-27T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Joint Channel/Network Coding for Star Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/joint-channelnetwork-coding-for-star-networks/32893123]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Channel coding alone is not sufficient to reliably transmit a message of finite length from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure correcting schemes on a higher layer, such as a Time-Division Multiple Access (TDMA) system paired with Automatic Repeat reQuest (ARQ) or Random Linear Network...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/joint-channelnetwork-coding-for-star-networks/32893123]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-26T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[First-Passage Time and Large-Deviation Analysis for Erasure Channels With Memory]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/first-passage-time-and-large-deviation-analysis-for-erasure-channels-with-memory/32890027]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[This paper considers the performance of digital communication systems transmitting messages over finite-state erasure channels with memory. Information bits are protected from channel erasures using error-correcting codes; successful receptions of code-words are acknowledged at the source through instantaneous feedback. The primary focus of this research is on delay-sensitive applications,...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/first-passage-time-and-large-deviation-analysis-for-erasure-channels-with-memory/32890027]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-25T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Transmission Sequence Design and Allocation for Wide Area Ad Hoc Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/transmission-sequence-design-and-allocation-for-wide-area-ad-hoc-networks/32889185]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[In this paper, the authors examine the question of designing and allocating transmission sequences to users in a mobile ad hoc network that has no spatial boundary. A basic tenet of the transmission sequence approach for addressing the media access control problem is that under normal operation conditions, there is no feedback based re-transmissions. This obviously is a major departure from...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/transmission-sequence-design-and-allocation-for-wide-area-ad-hoc-networks/32889185]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-24T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Towards a Networks-of-Networks Framework for Cyber Security]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/towards-a-networks-of-networks-framework-for-cyber-security/32890981]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Networks-of-Networks (NoN) is a graph-theoretic model of interdependent networks that have distinct dynamics at each network (layer). By adding special edges to represent relationships between nodes in different layers, NoN provides a unified mechanism to study interdependent systems intertwined in a complex relationship. While NoN based models have been proposed for cyber-physical systems, In...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/towards-a-networks-of-networks-framework-for-cyber-security/32890981]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-24T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[An Auction Mechanism for Resource Allocation in Mobile Cloud Computing Systems]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/an-auction-mechanism-for-resource-allocation-in-mobile-cloud-computing-systems/32889181]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[A mobile cloud computing system is composed of heterogeneous services and resources to be allocated by the cloud service provider to mobile cloud users. On one hand, some of these resources are substitutable (e.g., users can use storage from different places) that they have similar functions to the users. On the other hand, some resources are complementary that the user will need them as a...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/an-auction-mechanism-for-resource-allocation-in-mobile-cloud-computing-systems/32889181]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-23T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[A Case for Societal Digital Security Culture]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/a-case-for-societal-digital-security-culture/32890933]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Information and communication technology systems, such as remote health care monitoring and smart mobility applications, have become indispensable parts of the users' lives. Security vulnerabilities in these systems could cause financial losses, privacy/safety compromises, and operational interruptions. This paper demonstrates through examples, that technical security solutions for these...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/a-case-for-societal-digital-security-culture/32890933]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-23T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Application-Driven TCP Recovery and Non-Stop BGP]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/application-driven-tcp-recovery-and-non-stop-bgp/32892221]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Some network protocols tie application state to underlying TCP connections, leading to unacceptable service outages when an endpoint loses TCP state during fail-over or migration. For example, BGP ties forwarding tables to its control plane connections so that the failure of a BGP endpoint can lead to widespread routing disruption, even if it recovers all of its state but what was encapsulated...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/application-driven-tcp-recovery-and-non-stop-bgp/32892221]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-22T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Exclusion and Guard Zones in DS-CDMA Ad Hoc Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/exclusion-and-guard-zones-in-ds-cdma-ad-hoc-networks/32889225]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The central issue in Direct-Sequence Code-Division Multiple-Access (DS-CDMA) ad hoc networks is the prevention of a near-far problem. This paper considers two types of guard zones that may be used to control the near-far problem: a fundamental exclusion zone and an additional CSMA guard zone that may be established by the Carrier-Sense Multiple-Access (CSMA) protocol. In the exclusion zone, no...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/exclusion-and-guard-zones-in-ds-cdma-ad-hoc-networks/32889225]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-19T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Classification of Sporting Activities Using Smartphone Accelerometers]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/classification-of-sporting-activities-using-smartphone-accelerometers/32890567]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[In this paper, the authors present a framework that allows for the automatic identification of sporting activities using commonly available Smartphone's. They extract discriminative informational features from Smartphone accelerometers using the Discrete Wavelet Transform (DWT). Despite the poor quality of their accelerometers, Smartphone were used as capture devices due to their prevalence in...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/classification-of-sporting-activities-using-smartphone-accelerometers/32890567]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-19T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[On Modeling Geometric Joint Sink Mobility with Delay-Tolerant Cluster-Less Wireless Sensor Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/on-modeling-geometric-joint-sink-mobility-with-delay-tolerant-cluster-less-wireless-sensor-networks/32890965]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Moving Sink (MS) in Wireless Sensor Networks (WSNs) has appeared as a blessing because it collects data directly from the nodes where the concept of relay nodes is becomes obsolete. There are, however, a few challenges to be taken care of, like data delay tolerance and trajectory of MS which is NP-hard. In their proposed scheme, the authors divide the square field in small squares. Middle...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/on-modeling-geometric-joint-sink-mobility-with-delay-tolerant-cluster-less-wireless-sensor-networks/32890965]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-19T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Accelerating Mobile-Cloud Computing: A Survey]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/accelerating-mobile-cloud-computing-a-survey/32890995]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[With the recent advances in cloud computing and the capabilities of mobile devices, the state-of-the-art of mobile computing is at an inflection point, where compute-intensive applications can now run on today's mobile devices with limited computational capabilities. This is achieved by using the communications capabilities of mobile devices to establish high-speed connections to vast...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/accelerating-mobile-cloud-computing-a-survey/32890995]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-17T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[University of Melbourne Excited by Oracle Exalogic 2.0]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/university-of-melbourne-excited-by-oracle-exalogic-20/32885995]]></link>
        <s:doctype><![CDATA[Videos]]></s:doctype>
        <description><![CDATA[This video is a case study where the University of Melbourne looks to Oracle Exalogic 2.0 for virtualization, software metering, and multi-tenancy features.]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/university-of-melbourne-excited-by-oracle-exalogic-20/32885995]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-16T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[CloudHKA: A Cryptographic Approach for Hierarchical Access Control in Cloud Computing]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/cloudhka-a-cryptographic-approach-for-hierarchical-access-control-in-cloud-computing/32892193]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Cloud services are blooming recently. They provide a convenient way for data accessing, sharing, and processing. A key ingredient for successful cloud services is to control data access while considering the specific features of cloud services. The specific features include great quantity of outsourced data, large number of users, honest-but-curious cloud servers, frequently changed user set,...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/cloudhka-a-cryptographic-approach-for-hierarchical-access-control-in-cloud-computing/32892193]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-15T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Reallocation and Allocation of Virtual Machines in Cloud Computing]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/reallocation-and-allocation-of-virtual-machines-in-cloud-computing/32886599]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Cloud computing has given the new face to the distributed field. Two main issues are discussed in this paper, &quot;The process of finding the efficient virtual machine by using the concept of load balancing algorithm&quot;. &quot;Reallocation of the Virtual Machines&quot; i.e., migration of the Virtual Machines when cloud provider is not available with the required Virtual Machines. The authors have discussed...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/reallocation-and-allocation-of-virtual-machines-in-cloud-computing/32886599]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-13T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[A New Trusted and Secured E-commerce Architeture for Cloud Computing]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/a-new-trusted-and-secured-e-commerce-architeture-for-cloud-computing/32890961]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[Cloud computing platform gives people the opportunity for sharing resources, services and information among the people of the whole world. In private cloud system, information is shared among the persons who are in that cloud. Presently, different types of internet based systems are running in Cloud Computing environment. E-commerce is one of them. Present models are not secured enough for...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/a-new-trusted-and-secured-e-commerce-architeture-for-cloud-computing/32890961]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-12T07:00:00Z</pubDate>
                                        
            </item>
        <item>
        <title><![CDATA[Delay Scaling in Poisson Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/delay-scaling-in-poisson-networks/32893125]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The local delay, defined as the mean time it takes a node to connect to its nearest neighbor, is a fundamental performance metric in a wireless network. For a network with Poisson distributed nodes, the authors find its scaling behavior (as a function of the rate of transmission) for different types of nearest-neighbor and the two extreme cases of mobility (infinite mobility and no mobility)....]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/delay-scaling-in-poisson-networks/32893125]]></guid>
        <dc:creator><![CDATA[]]></dc:creator>
        <pubDate>2013-04-12T07:00:00Z</pubDate>
                                        
            </item>
    </channel>
</rss>
