Stanford Technology Ventures Program

Displaying 1-40 of 100 results

  • White Papers // Mar 2014

    Programming Protocol-Independent Packet Processors

    P4 is a high-level language for programming protocol-independent packet processors. P4 works in conjunction with SDN control protocols like OpenFlow. In its current form, OpenFlow explicitly specifies protocol headers on which it operates. This set has grown from 12 to 41 fields in a few years, increasing the complexity of...

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2014

    Hybrid Strategies for Finding the Max with the Crowd

    The authors study the problem of soliciting human crowd workers to find the maximum element in a set of objects, where each object has some unknown intrinsic quality measure. Previous approaches focus on collecting either ratings or pair-wise comparisons of items from the crowd, but little study has been done...

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2014

    Phishing Detection Using Neural Network

    In this paper, the authors apply multilayer feed-forward neural networks to phishing email detection and evaluate the effectiveness of this approach. The authors design the feature set, process the phishing dataset, and implement the Neural Network (NN) systems. They then use cross validation to evaluate the performance of NNs with...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2014

    Quasar: Resource-Efficient and QoS-Aware Cluster Management

    Cloud computing promises flexibility and high performance for users and high cost-efficiency for operators. Nevertheless, most cloud facilities operate at very low utilization, hurting both cost effectiveness and future scalability. The authors present quasar, a cluster management system that increases resource utilization while providing consistently high application performance. Quasar employs...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2014

    Dynamic Management of TurboMode in Modern Multi-core Chips

    Dynamic overclocking of CPUs, or TurboMode, is a feature recently introduced on all x86 multi-core chips. It leverages thermal and power headroom from idle execution resources to overclock active cores to increase performance. TurboMode can accelerate CPU-bound applications at the cost of additional power consumption. Nevertheless, naive use of TurboMode...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2014

    A Single Chip Multiprocessor Integrated with DRAM

    The authors evaluate the performance of a single chip multiprocessor integrated with DRAM. They compare the performance of this architecture with that of a more conventional chip which only has on-chip SRAM. The DRAM-based architecture with four processors performs an average of 52% faster than the SRAM-based architecture on floating...

    Provided By Stanford Technology Ventures Program

  • White Papers // Dec 2013

    Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation

    An obfuscator is a machine that takes as input a program, and produces a second program with identical functionality that in some sense hides how the original program works. An important notion of obfuscation called indistinguishability Obfuscation (iO) was proposed by a researcher. Indistinguishability obfuscation asks that obfuscations of any...

    Provided By Stanford Technology Ventures Program

  • White Papers // Sep 2013

    Ensuring High-Quality Randomness in Cryptographic Key Generation

    The security of any cryptosystem relies on the secrecy of the systems secret keys. Yet, recent experimental work demonstrates that tens of thousands of devices on the Internet use RSA and DSA secrets drawn from a small pool of candidate values. As a result, an adversary can derive the devices...

    Provided By Stanford Technology Ventures Program

  • White Papers // Aug 2013

    iBench: Quantifying Interference for Datacenter Applications

    Interference between co-scheduled applications is one of the major reasons that cause modern Data Centers (DCs) to operate at low utilization. DC operators traditionally sidestep interference either by disallowing colocation altogether and providing isolated server instances, or by requiring the users to express resource reservations, which are often exaggerated to...

    Provided By Stanford Technology Ventures Program

  • White Papers // Aug 2013

    Query Processing over Crowdsourced Data

    The authors are building Deco, a comprehensive system for answering declarative queries posed over stored relational data together with data gathered from the crowd. In this paper they present Deco's query processor, building on Deco's data model and query language presented earlier. In general, it has been observed that query...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jul 2013

    ECOS: An SOCP Solver for Embedded Systems

    In this paper, the authors describe the Embedded COnic Solver (ECOS), an interior-point solver for Second-Order Cone Programming (SOCP) designed specifically for embedded applications. ECOS is written in low footprint, single-threaded, library-free ANSI-C and so runs on most embedded platforms. The main interior-point algorithm is a standard primal-dual mehrotra predictor-corrector...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jun 2013

    QoS-Aware Admission Control in Heterogeneous Datacenters

    Large-scale Data Centers (DCs) host tens of thousands of diverse applications each day. Apart from determining where to schedule workloads, the cluster manager should also decide when to constrain application admission to prevent system oversubscription. At the same time datacenter users care not only for fast execution time but for...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jun 2013

    Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption

    The authors put forward a new notion, function privacy, in identity-based encryption and, more generally, in functional encryption. Intuitively, their notion asks that decryption keys reveal essentially no information on their corresponding identities, beyond the absolute minimum necessary. This is motivated by the need for providing predicate privacy in public-key...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jun 2013

    Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World

    The authors initiate the study of quantum-secure digital signatures and quantum chosen ciphertext security. In the case of signatures, they enhance the standard chosen message query model by allowing the adversary to issue quantum chosen message queries: given a superposition of messages, the adversary receives a superposition of signatures on...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2013

    Copysets: Reducing the Frequency of Data Loss in Cloud Storage

    Random replication is widely used in data center storage systems to prevent data loss. However, random replication is almost guaranteed to lose data in the common scenario of simultaneous node failures due to cluster-wide power outages. Due to the high fixed cost of each incident of data loss, many data...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2013

    Deep Learning with COTS HPC Systems

    Scaling up deep learning algorithms has been shown to lead to increased performance in benchmark tasks and to enable discovery of complex high-level features. Recent, efforts to train extremely large networks (with over 1 billion parameters) have relied on cloudlike computing infrastructure and thousands of CPU cores. In this paper,...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2013

    GPS: A Graph Processing System

    GPS (for Graph Processing System) is a complete open-source system the authors developed for scalable, fault-tolerant, and easy-to-program execution of algorithms on extremely large graphs. This paper serves the dual role of describing the GPS system, and presenting techniques and experimental results for graph partitioning in distributed graph-processing systems like...

    Provided By Stanford Technology Ventures Program

  • White Papers // Apr 2013

    Energy Efficiency in TDMA-Based Next-Generation Passive Optical Access Networks

    Next-generation Passive Optical Network (PON) has been considered in the past few years as a cost-effective broadband access technology. With the ever-increasing power saving concern, energy efficiency has been an important issue in its operations. In this paper, the authors propose a novel sleep time sizing and scheduling framework for...

    Provided By Stanford Technology Ventures Program

  • White Papers // Mar 2013

    EyeQ: Practical Network Performance Isolation at the Edge

    The datacenter network is shared among untrusted tenants in a public cloud, and hundreds of services in a private cloud. Today the authors lack fine-grained control over network bandwidth partitioning across tenants. In this paper they present EyeQ, a simple and practical system that provides tenants with bandwidth guarantees as...

    Provided By Stanford Technology Ventures Program

  • White Papers // Mar 2013

    Enhanced Concurrency Control with Transactional NACKs

    Transactional Memory (TM) is a promising technique that simplifies parallel programming by supporting atomic and isolated execution of code sections. To provide robust performance and fairness guarantees, however, TM must dynamically adjust the degree of concurrency among transactions. To design an efficient concurrency controller for TM, critical system information, such...

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2013

    Beyond Convex Relaxation: A Polynomial - Time Non - Convex Optimization Approach to Network Localization

    The successful deployment and operation of location-aware networks, which have recently found many applications, depends crucially on the accurate localization of the nodes. Currently, a powerful approach to localization is that of convex relaxation. In a typical application of this approach, the localization problem is first formulated as a rank...

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2013

    Temporal Load Balancing With Service Delay Guarantees for Data Center Energy Cost Optimization

    Cloud computing services are becoming integral part of people's daily life. These services are supported by infrastructure known as Internet Data Center (IDC). As demand for cloud computing services soars, energy consumed by IDCs is skyrocketing. Both academia and industry have paid great attention to energy management of IDCs. This...

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2013

    A Detailed and Flexible Cycle-Accurate Network-on-Chip Simulator

    Network-on-Chips (NoCs) are becoming integral parts of modern microprocessors as the number of cores and modules integrated on a single chip continues to increase. Research and development of future NoC technology relies on accurate modeling and simulations to evaluate the performance impact and analyze the cost of novel NoC architectures....

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2013

    An Event View Specification Approach for Supporting Service Process Collaboration

    Designing and implementing an interoperable and flexible service process collaboration strategy is one of key issues for Business To Business integrations. To better support service process collaboration, an event view model is proposed, which is composed of a set of event types and their dependency relationships. It provides a general...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Resource Efficient Computing for Warehouse-scale Datacenters

    An increasing amount of information technology services and data are now hosted in the cloud, primarily due to the cost and scalability benefits for both the end-users and the operators of the warehouse-scale DataCenters (DCs) that host cloud services. Hence, it is vital to continuously improve the capabilities and efficiency...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Paragon: QoS-Aware Scheduling for Heterogeneous Datacenters

    Large-scale Data Centers (DCs) host tens of thousands of diverse applications each day. However, interference between colocated workloads and the difficulty to match applications to one of the many hardware platforms available can degrade performance, violating the Quality of Service (QoS) guarantees that many cloud workloads require. While previous work...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Bringing Virtualization to the X86 Architecture with the Original VMware Workstation

    This paper describes the historical context, technical challenges, and main implementation techniques used by VMware Workstation to bring virtualization to the x86 architecture in 1999. Although Virtual Machine Monitors (VMMs) had been around for decades, they were traditionally designed as part of monolithic, single-vendor architectures with explicit support for virtualization....

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations

    Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they require, as a fallback, a planar sub-graph whose identification, in all existing methods, depends on exact node positions. In practice, however, location...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Video Streaming Over Wireless Networks

    Video streaming over wireless networks is compelling for many applications, ranging from home entertainment to surveillance to search-and-rescue operations. Interesting technical challenges arise when the unpredictable nature of the wireless radio channel meets the requirements of high data rate and low latency for video transport. This tutorial provides an overview...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Iterative Decoding for MIMO Channels via Modified Sphere Decoding

    In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multi-antenna systems employing space-time codes, however, it is not clear what is the best way to obtain the soft information required of the iterative scheme with low...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    A Survey of Two Signature Aggregation Techniques

    The authors surveyed two techniques for signature aggregation. Both methods provide the ability to compress multiple signatures by distinct signers on distinct messages into a single signature. The first method, based on bilinear maps, provides general aggregation, where anyone can combine signatures into an aggregate at any time, without the...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    The Design and Implementation of Datagram TLS

    A number of applications have emerged over recent years that use datagram transport. These applications include real time video conferencing, Internet telephony, and online games such as Quake and StarCraft. These applications are all delay sensitive and use unreliable datagram transport. Applications that are based on reliable transport can be...

    Provided By Stanford Technology Ventures Program

  • White Papers // Dec 2012

    An Overview of the Deco System: Data Model and Query Language; Query Processing and Optimization

    Deco is a comprehensive system for answering declarative queries posed over stored relational data together with data obtained on-demand from the crowd. In this overview paper, the authors describe deco's data model, query language, and system prototype, summarizing material from earlier papers. Deco's data model was designed to be general,...

    Provided By Stanford Technology Ventures Program

  • White Papers // Nov 2012

    Beyond Full Duplex Wireless

    Recent work has shown the possibility of implementing full-duplex wireless radios using commodity hardware. The authors discuss the possibility of extending full-duplex designs to support Multiple Input, Multiple Output (MIMO) systems. They explore how such a design could lead to a rethinking of wireless networks. They discuss various applications of...

    Provided By Stanford Technology Ventures Program

  • White Papers // Nov 2012

    Playout-Buffer Aware Hand-Off Control for Wireless Video Streaming

    Wireless hand-off control typically considers only connectivity strength from the mobile terminal to alternative access points. In wireless video streaming, however, where video freezing must be avoided at the mobile terminal, the play-out buffer level should also be considered by hand-off control. In this paper, the authors first develop a...

    Provided By Stanford Technology Ventures Program

  • White Papers // Nov 2012

    Reduced Dimension Policy Iteration for Wireless Network Control Via Multiscale Analysis

    A novel framework for the analysis and optimization of wireless networks operations is proposed. The temporal evolution of the state of the network is modeled as the trajectory of the state of a Finite State Machine (FSM). The state space of the FSM and the statistics of state transition are...

    Provided By Stanford Technology Ventures Program

  • White Papers // Nov 2012

    Rethinking DRAM Power Modes for Energy Proportionality

    The authors re-think DRAM power modes by modeling and characterizing inter-arrival times for memory requests to determine the properties an ideal power mode should have. This analysis indicates that even the most responsive of today's power modes are rarely used. Up to 88% of memory is spent idling in an...

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2012

    How to Construct Quantum Random Functions

    In the presence of a quantum adversary, there are two possible definitions of security for a pseudorandom function; standard-security, which allows the adversary to be quantum, but requires queries to the function to be classical and quantum-security, which allows the adversary to query the function on a quantum superposition of...

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2012

    Quantum-Secure Message Authentication Codes

    The authors construct the first Message Authentication Codes (MACs) that are existentially unforgeable against a quantum chosen message attack. These chosen message attacks model a quantum adversary's ability to obtain the MAC on a superposition of messages of its choice. They begin by showing that a quantum secure PRF is...

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2012

    Energy Efficient Cooperation for Two-Hop Relay Networks

    The authors analyze the impact of cooperation on the energy efficiency of two-hop relay transmissions. While cooperation has been demonstrated to improve spectral efficiency, the benefits in terms of energy consumption are not well characterized. They show that cooperation is not always beneficial in this context, since the energy required...

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2012

    Design and Implementation of Real-Time Software Radio for Anti-Interference GPS/WAAS Sensors

    Adaptive antenna array processing is widely known to provide significant anti-interference capabilities within a Global Navigation Satellite Systems (GNSS) receiver. A main challenge in the quest for such receiver architecture has always been the computational/processing requirements. Even more demanding would be to try and incorporate the flexibility of the Software-Defined...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2012

    Dynamic Cooperation Link Selection for Network MIMO Systems With Limited Backhaul Capacity

    Base-Station (BS) cooperation in wireless cellular networks offers a promising approach for interference mitigation. However, the implementation of practical network Multi-Input Multi-Output (MIMO) system also faces the challenge of high capacity cost for sharing the user data over the backhaul connections. This paper considers a downlink multi-cell Orthogonal Frequency-Division Multiple-Access...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2012

    Blind Null-Space Learning for Spatial Coexistence in MIMO Cognitive Radios

    This paper proposes a blind technique for MIMO cognitive radio Secondary Users (SU) to transmit in the same band simultaneously with a Primary User (PU) under a maximum interference constraint. In the proposed technique, the SU is able to meet the interference constraint of the PU without explicitly estimating the...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2012

    Power Budgeted Packet Scheduling for Wireless Multimedia

    In this paper, the authors profile a particular tradeoff between power budget and video quality that emerges in the transmission of multimedia packets over a wireless channel. These packets are due to arrive to a receiver at a particular time, so they consider a finite horizon problem over which multimedia...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2012

    Optimizing Cellular Network Architectures to Minimize Energy Consumption

    The energy consumption of different cellular network architectures are analyzed. In particular, a comparison of the transmit energy consumption between a single large cell with multiple co-located antennas, multiple micro-cells with a single antenna at each cell, and a large cell with a distributed antenna system are presented. The influence...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2012

    Exploiting Spatial Degrees of Freedom in MIMO Cognitive Radio Systems

    The authors propose a learning technique for MIMO secondary users (SU) to spatially coexist with Primary Users (PU). By learning the null space of the interference channel to the PU, the SU can utilize idle degrees of freedom that otherwise would be unused by the PU. This learning process does...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2012

    Nonlinear Cooperative Dynamics in Distributed Power Control for Wireless Networks

    Power-Controlled Multiple Access (PCMA) is a class of distributed algorithms for Transmitter Power Control (TPC) in wireless networks. In this paper, the authors develop and evaluate a continuous analog (fluid model) of the discrete version of PCMA in order to clearly demonstrate PCMA's capability to, without centralized coordination, induce a...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2012

    Maximizing MLC NAND Lifetime and Reliability in the Presence of Write Noise

    The aggressive scaling of the NAND flash technology has led to write noise becoming the dominant source of disturbance in the currently shipping sub-30 nm MLC NAND memories. Write noise can be mitigated by reducing the magnitude of the voltage levels programmed into the cells, which additionally translates to longer...

    Provided By Stanford Technology Ventures Program

  • White Papers // Mar 2012

    Outage Probability of Amplify-and-Forward Cooperation With Full Duplex Relay

    The authors study the outage performance of an Amplify-and-Forward (AF) cooperation with Full Duplex Relaying (FDR). When there exists a non-negligible direct link or Residual Self Interference (RSI), full duplex relaying turns the effective channel into a frequency selective channel. Assuming Minimum Mean Squared Error Decision Feedback Equalization (MMSE-DFE) at...

    Provided By Stanford Technology Ventures Program

  • White Papers // Dec 2010

    Temporal Classification of Events in Cricket Videos

    Video search today uses the metadata surrounding the video, ignoring its semantic content. Over the years, a lot of research has gone into indexing and browsing of sports video content. In this paper, the authors present a novel approach for classification of events in cricket videos and thus, summarize its...

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2012

    Convex Optimization for Precoder Design in MIMO Interference Networks

    Optimal pre-coder design for weighted sum-rate maximization in multiple-input multiple-output interference networks is studied. For this well known non-convex optimization problem, convex approximations based on interference alignment are developed, for both single-beam and multi-beam cases. Pre-coder design methods that consist of two phases, an interference alignment phase and a post-alignment...

    Provided By Stanford Technology Ventures Program

  • White Papers // Nov 2012

    Playout-Buffer Aware Hand-Off Control for Wireless Video Streaming

    Wireless hand-off control typically considers only connectivity strength from the mobile terminal to alternative access points. In wireless video streaming, however, where video freezing must be avoided at the mobile terminal, the play-out buffer level should also be considered by hand-off control. In this paper, the authors first develop a...

    Provided By Stanford Technology Ventures Program

  • White Papers // Nov 2012

    Reduced Dimension Policy Iteration for Wireless Network Control Via Multiscale Analysis

    A novel framework for the analysis and optimization of wireless networks operations is proposed. The temporal evolution of the state of the network is modeled as the trajectory of the state of a Finite State Machine (FSM). The state space of the FSM and the statistics of state transition are...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations

    Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they require, as a fallback, a planar sub-graph whose identification, in all existing methods, depends on exact node positions. In practice, however, location...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Video Streaming Over Wireless Networks

    Video streaming over wireless networks is compelling for many applications, ranging from home entertainment to surveillance to search-and-rescue operations. Interesting technical challenges arise when the unpredictable nature of the wireless radio channel meets the requirements of high data rate and low latency for video transport. This tutorial provides an overview...

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2009

    A Low-Complexity Planar Antenna Array for Wireless Communication Applications: Performance Analysis and Beamforming

    Source localization and beamforming are very important in a variety of wireless communication applications such as mobile Wireless Sensor Networks, Intelligent Transportation Systems (ITS), Wireless Local Area Networks (WLANs), and distributed sensor networks. In recent years, there exists a significant interest in the development of advanced arrays with planar arrays...

    Provided By Stanford Technology Ventures Program

  • White Papers // Apr 2013

    Energy Efficiency in TDMA-Based Next-Generation Passive Optical Access Networks

    Next-generation Passive Optical Network (PON) has been considered in the past few years as a cost-effective broadband access technology. With the ever-increasing power saving concern, energy efficiency has been an important issue in its operations. In this paper, the authors propose a novel sleep time sizing and scheduling framework for...

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2013

    Beyond Convex Relaxation: A Polynomial - Time Non - Convex Optimization Approach to Network Localization

    The successful deployment and operation of location-aware networks, which have recently found many applications, depends crucially on the accurate localization of the nodes. Currently, a powerful approach to localization is that of convex relaxation. In a typical application of this approach, the localization problem is first formulated as a rank...

    Provided By Stanford Technology Ventures Program

  • White Papers // Dec 2009

    Universal Rigidity: Towards Accurate and Efficient Localization of Wireless Networks

    A fundamental problem in wireless ad-hoc and sensor networks is that of determining the positions of nodes. Often, such a problem is complicated by the presence of nodes whose positions cannot be uniquely determined. Most existing work uses the notion of global rigidity from rigidity theory to address the non-uniqueness...

    Provided By Stanford Technology Ventures Program

  • White Papers // Mar 2011

    Two Models for Inferring Network Structure from Cascades

    In many real-world scenarios, the underlying network over which the diffusions and propagations spread is unobserved, i.e. the edges of the network are invisible. In such cases, the authors can only infer the network structure from underlying observations. The goal of this paper is to find a model that generates...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Resource Efficient Computing for Warehouse-scale Datacenters

    An increasing amount of information technology services and data are now hosted in the cloud, primarily due to the cost and scalability benefits for both the end-users and the operators of the warehouse-scale DataCenters (DCs) that host cloud services. Hence, it is vital to continuously improve the capabilities and efficiency...

    Provided By Stanford Technology Ventures Program

  • White Papers // Apr 2011

    Diffusing the Cloud: Cloud Computing and Implications for Public Policy

    Cloud Computing is rapidly emerging as the new information technology platform. It is, however, much more than simply a new set of technologies and business models. Cloud Computing is transforming how consumers, companies, and governments store information, how they process that information, and how they utilize computing power. It can...

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2013

    Temporal Load Balancing With Service Delay Guarantees for Data Center Energy Cost Optimization

    Cloud computing services are becoming integral part of people's daily life. These services are supported by infrastructure known as Internet Data Center (IDC). As demand for cloud computing services soars, energy consumed by IDCs is skyrocketing. Both academia and industry have paid great attention to energy management of IDCs. This...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2012

    A Strong Converse for Joint Source-Channel Coding

    The authors consider a discrete memory-less joint source-channel setting. In this setting, if a source sequence is reconstructed with distortion below some threshold, they declare a success event. They prove that for any joint source-channel scheme, if this threshold lowers (better) than the optimum average distortion, then the success probability...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jun 2009

    Capacity Region of the Finite-State Multiple-Access Channel with and Without Feedback

    The capacity region of the Finite-State Multiple-Access Channel (FS-MAC) with feedback that may be an arbitrary time invariant function of the channel output samples is considered. The authors characterize both an inner and an outer bound for this region, using Massey's directed information. These bounds are shown to coincide, and...

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2012

    Energy Efficient Cooperation for Two-Hop Relay Networks

    The authors analyze the impact of cooperation on the energy efficiency of two-hop relay transmissions. While cooperation has been demonstrated to improve spectral efficiency, the benefits in terms of energy consumption are not well characterized. They show that cooperation is not always beneficial in this context, since the energy required...

    Provided By Stanford Technology Ventures Program

  • White Papers // Feb 2009

    Using a Market Economy to Provision Compute Resources Across Planet-wide Clusters

    The authors present a practical, market-based solution to the resource provisioning problem in a set of heterogeneous resource clusters. They focus on provisioning rather than immediate scheduling decisions to allow users to change long-term job specifications based on market feedback. Users enter bids to purchase quotas, or bundles of resources...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Iterative Decoding for MIMO Channels via Modified Sphere Decoding

    In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multi-antenna systems employing space-time codes, however, it is not clear what is the best way to obtain the soft information required of the iterative scheme with low...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jan 2013

    Bringing Virtualization to the X86 Architecture with the Original VMware Workstation

    This paper describes the historical context, technical challenges, and main implementation techniques used by VMware Workstation to bring virtualization to the x86 architecture in 1999. Although Virtual Machine Monitors (VMMs) had been around for decades, they were traditionally designed as part of monolithic, single-vendor architectures with explicit support for virtualization....

    Provided By Stanford Technology Ventures Program

  • White Papers // Aug 2012

    The Economics of Long-Term Digital Storage

    Paper as the medium for the world's memory has one great advantage; it survives benign neglect well. Bits, on the other hand, need continual care, and thus a continual flow of money. A Blue Ribbon panel described economic sustainability as the major issue facing long-term digital preservation. This is despite...

    Provided By Stanford Technology Ventures Program

  • White Papers // Sep 2012

    Dune: Safe User-level Access to Privileged CPU Features

    Dune is a system that provides applications with direct but safe access to hardware features such as ring protection, page tables, and tagged TLBs, while preserving the existing OS interfaces for processes. Dune uses the virtualization hardware in modern processors to provide a process, rather than a machine abstraction. It...

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2012

    Quantum-Secure Message Authentication Codes

    The authors construct the first Message Authentication Codes (MACs) that are existentially unforgeable against a quantum chosen message attack. These chosen message attacks model a quantum adversary's ability to obtain the MAC on a superposition of messages of its choice. They begin by showing that a quantum secure PRF is...

    Provided By Stanford Technology Ventures Program

  • White Papers // Sep 2012

    Privacy Auctions for Recommender Systems

    The authors study a market for private data in which a data analyst publicly releases a statistic over a database of private information. Individuals that own the data incur a cost for their loss of privacy proportional to the differential privacy guarantee given by the analyst at the time of...

    Provided By Stanford Technology Ventures Program

  • White Papers // Aug 2012

    When Homomorphism Becomes a Liability

    The authors show that an encryption scheme cannot have a simple decryption function and be homomorphic at the same time, even with added noise. Specifically, if a scheme can homomorphically evaluate the majority function, then its decryption cannot be weakly-learnable (in particular, linear), even if large decryption error is allowed....

    Provided By Stanford Technology Ventures Program

  • White Papers // Oct 2012

    How to Construct Quantum Random Functions

    In the presence of a quantum adversary, there are two possible definitions of security for a pseudorandom function; standard-security, which allows the adversary to be quantum, but requires queries to the function to be classical and quantum-security, which allows the adversary to query the function on a quantum superposition of...

    Provided By Stanford Technology Ventures Program

  • White Papers // Nov 2012

    Beyond Full Duplex Wireless

    Recent work has shown the possibility of implementing full-duplex wireless radios using commodity hardware. The authors discuss the possibility of extending full-duplex designs to support Multiple Input, Multiple Output (MIMO) systems. They explore how such a design could lead to a rethinking of wireless networks. They discuss various applications of...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jul 2009

    Jacktrip/soundwire Meets Server Farm

    Even though bidirectional, high-quality and low-latency audio systems for network performance are available, the complexity involved in setting up remote sessions needs better tools and methods to asses and tune network parameters. The authors present an implementation of a system to intuitively evaluate the Quality of Service (QoS) on best...

    Provided By Stanford Technology Ventures Program

  • White Papers // May 2009

    Jacktrip: Under the Hood of an Engine for Network Audio

    The design of a platform for bi-directional musical performance using modern WAN networks poses several challenges that are different from related applications, e.g., synchronous LAN studio systems or uni-directional WAN streaming. The need to minimize as much as possible audio latency and also maximize audio quality requires specific strategies which...

    Provided By Stanford Technology Ventures Program

  • White Papers // Jul 2013

    ECOS: An SOCP Solver for Embedded Systems

    In this paper, the authors describe the Embedded COnic Solver (ECOS), an interior-point solver for Second-Order Cone Programming (SOCP) designed specifically for embedded applications. ECOS is written in low footprint, single-threaded, library-free ANSI-C and so runs on most embedded platforms. The main interior-point algorithm is a standard primal-dual mehrotra predictor-corrector...

    Provided By Stanford Technology Ventures Program

  • White Papers // Apr 2012

    Evading Censorship with Browser-Based Proxies

    While internet access to certain sites is blocked in some parts of the world, these restrictions are often circumvented using proxies outside the censored region. Often these proxies are blocked as soon as they are discovered. In this paper the authors propose a browser-based proxy creation system that generates a...

    Provided By Stanford Technology Ventures Program