Stanford University

Displaying 41-80 of 578 results

  • Webcasts // Apr 2011

    Developing Products That Save Lives

    In this webcast, the presenter leads scientists discovering medicines that will significantly impact the lives of patients. In this webcast, the presenter describes the challenges of his industry, and outlines the required steps for developing products in a heavily regulated environment. The presenter also shares some personal learning curves faced...

    Provided By Stanford University

  • Webcasts // Apr 2011

    How To Build Instant Connections

    In this webcast, the presenter explores subtle drivers that can help you spark immediate work, life, and romantic connections. Based on insights from the presenter's latest book, Click: The Magic of Instant Connections, the presenter teaches leaders and aspiring entrepreneurs how to make every chance meeting count, using examples from...

    Provided By Stanford University

  • White Papers // Apr 2011

    Software or Hardware: The Future of Green Enterprise Computing

    Over the last few years, interest in "Green computing" has motivated research into energy-saving techniques for enterprise systems, from network proxies and virtual machine migration to the return of thin clients. This paper tries to answer a possibly contentious question: would the authors be better served by the embarrassingly simple...

    Provided By Stanford University

  • Webcasts // Apr 2011

    A New Vision For Capital Markets

    In this webcast, the presenter thinks his online marketplace for trading alternative assets can play an important role in creating a new model for capital markets. In this webcast, the presenter explains his personal path into entrepreneurship and describes the current growth of his firm, which has drawn attention for...

    Provided By Stanford University

  • White Papers // Apr 2011

    PCube: Improving Power Efficiency in Data Center Networks

    To alleviate the growing concern of energy waste in networked devices, the authors present PCube, a server-centric data center structure that conserves energy by varying bandwidth availability based on traffic demand. PCube not only supports a low-power mode for existing data centers offering full bisection bandwidth without hardware modification or...

    Provided By Stanford University

  • White Papers // Apr 2011

    Coding the Beams: Improving Beamforming Training in MmWave Communication System

    The mmWave communication system is operating at a regime with high number of antennas and very limited number of RF analog chains. Large number of antennas are used to extend the communication range for recovering the high path loss while fewer RF analog chains are designed to reduce transmit and...

    Provided By Stanford University

  • Webcasts // Apr 2011

    Effective Models For Sustainable Growth

    In this webcast, the presenter shares her organization's commitment to creating programs to support sustainable development. The presenter articulates the importance of developing innovative financing and business models to address ecosystem services and resource management issues. The presenter also describes the entrepreneurial initiatives her organization has built to sustain partnerships...

    Provided By Stanford University

  • White Papers // Apr 2011

    CDE: Using System Call Interposition to Automatically Create Portable Software Packages

    It can be painfully difficult to take software that runs on one person's machine and get it to run on another machine. Online forums and mailing lists are filled with discussions of users' troubles with compiling, installing, and configuring software and their myriad of dependencies. To eliminate this dependency problem,...

    Provided By Stanford University

  • White Papers // Mar 2011

    Efficient Selective Identity-Based Encryption Without Random Oracles

    The authors construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time...

    Provided By Stanford University

  • White Papers // Mar 2011

    Fast Crash Recovery in RAMCloud

    RAMCloud is a DRAM-based storage system that provides inexpensive durability and availability by recovering quickly after crashes, rather than storing replicas in DRAM. RAMCloud scatters backup data across hundreds or thousands of disks, and it harnesses hundreds of servers in parallel to reconstruct lost data. The system uses a log-structured...

    Provided By Stanford University

  • White Papers // Mar 2011

    Diffusing the Fog: Cloud Computing and Implications for Public Policy

    Cloud Computing is rapidly emerging as the new platform for computing. It is, however, much more than simply a new set of technologies and business models. Cloud Computing has the potential to transform how consumers, companies, and governments store information, how they process that information, and how they utilize computing...

    Provided By Stanford University

  • White Papers // Mar 2011

    Information Theoretic Limits On Learning Stochastic Differential Equations

    Consider the problem of learning the drift coefficient of a stochastic differential equation from a sample path. In this paper, the authors assume that the drift is parametrized by a high-dimensional vector. They address the question of how long the system needs to be observed in order to learn this...

    Provided By Stanford University

  • White Papers // Mar 2011

    Automated Analysis of Security-Critical JavaScript APIs

    JavaScript is widely used to provide client-side functionality in Web applications. To provide services ranging from maps to advertisements, Web applications may incorporate untrusted JavaScript code from third parties. The trusted portion of each application may then expose an API to untrusted code, interposing a reference monitor that mediates access...

    Provided By Stanford University

  • Webcasts // Mar 2011

    Creating Enchantment

    The presenter shares the secrets to being enchanting and developing influence through the "Pillars of enchantment." In this webcast, the presenter examines the deep value in being likable, creating trust, and taking empowering action. The presenter also shares keys to telling a great story, overcoming resistance, and enchanting your boss...

    Provided By Stanford University

  • White Papers // Mar 2011

    Risk, Institutions And Growth: Why England And Not China?

    The authors analyze the role of risk-sharing institutions in transitions to modern economies. Transitions require individual-level risk-taking in pursuing productivity-enhancing activities including using and developing new knowledge. Individual-level, idiosyncratic risk implies that distinct risk-sharing institutions - even those providing the same level of insurance - can lead to different growth...

    Provided By Stanford University

  • White Papers // Feb 2011

    Computing on Authenticated Data

    In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, the authors present a framework for computing on authenticated data via the notion of slightly homomorphic signatures, or P-homomorphic signatures. With such signatures, it is possible for a third party to derive a signature on the...

    Provided By Stanford University

  • Webcasts // Feb 2011

    A Devotion To New Ideas

    The presenter thrives on turning innovative ideas into pioneering companies. The presenter serves as founder and CEO of Idealab, which started over 75 companies since 1996. In this webcast, the presenter shares how Idealab continues to bring incredible ideas to market, and his personal insights on starting and running successful...

    Provided By Stanford University

  • White Papers // Feb 2011

    Enterprise Coordination on the Internet

    Enterprises are now connected internally and externally to other Enterprises via the Internet in ways that are increasingly difficult to manage, especially as these interconnections become more dynamic. Current methods of coordinating the effects of change as they propagate through these networks of connections are not likely to scale. What...

    Provided By Stanford University

  • Webcasts // Feb 2011

    Live For The Future And Survive Success

    In this webcast, the presenter guides the company's continuing efforts to successfully deliver innovative medical technologies to market. In this webcast, the presenter shares entrepreneurial lessons learned throughout his career, and discusses the importance of setting objectives and executing tactical plans. The presenter also touches upon the value of thorough...

    Provided By Stanford University

  • White Papers // Feb 2011

    Accurate Modeling and Generation of Storage I/O for Datacenter Workloads

    Tools that confidently recreate I/O workloads have become a critical requirement in designing efficient storage systems for DataCenters (DCs), since potential inefficiencies get aggregated over several thousand servers. Designing performance, power and cost optimized systems require a deep understanding of target workloads, and mechanisms to effectively model different design choices....

    Provided By Stanford University

  • White Papers // Feb 2011

    Interference Networks With Point-to-Point Codes

    The paper establishes the capacity region of the Gaussian interference channel with many transmitter receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable rate regions when treating interference as noise, using successive interference cancellation decoding, and using joint...

    Provided By Stanford University

  • White Papers // Feb 2011

    Cooperative Wireless Multicell OFDMA Network With Backhaul Capacity Constraints

    This paper considers the downlink of a wireless multicell Orthogonal Frequency Division Multiple-Access (OFDMA) system where neighboring Base-Stations (BSs) can jointly encode and transmit data signals to their users using Zero-Forcing (ZF) precoding in each frequency tone, but only limited backhaul capacity is available for each BS to share its...

    Provided By Stanford University

  • White Papers // Feb 2011

    Resource-Efficient Wireless Monitoring Based on Mobile Agent Migration

    Wireless sensor networks are increasingly adopted in many engineering applications such as environmental and structural monitoring. Having proven to be low-cost, easy to install and accurate, wireless sensor networks serve as a powerful alternative to traditional tethered monitoring systems. However, due to the limited resources of a wireless sensor node,...

    Provided By Stanford University

  • Webcasts // Feb 2011

    The Power Of Curiosity And Inspiration

    In this webcast, the presenter is an entrepreneur driven by an innate curiosity to create amazing products and services. In this insightful lecture, the presenter describes his early background and inspirations, the current focuses the presenter keeps as a CEO, and the presenter's desire to create memorable experiences and solve...

    Provided By Stanford University

  • White Papers // Feb 2011

    Generating Probability Distributions Using Multivalued Stochastic Relay Circuits

    The problem of random number generation dates back to von Neumann's work in 1951. Since then, many algorithms have been developed for generating unbiased bits from complex correlated sources as well as for generating arbitrary distributions from unbiased bits. An equally interesting, but less studied aspect is the structural component...

    Provided By Stanford University

  • Webcasts // Feb 2011

    Relentless Pursuit Of Innovation

    In this webcast, the presenter shares insights from her career in biotechnology and academia on leading teams, managing risks against rewards, and innovative product development. The presenter also shares her belief as to why entrepreneurs must remain relentless when it comes to pursuing their goals.

    Provided By Stanford University

  • White Papers // Feb 2011

    NS2 & Networking Using Desktop Virtualization: An Application of Virtual Box

    Information technology has dominated almost all the areas of human life now. Education is not exception in this. How to utilize the technology for imparting the education effectively and efficiently is more important rather than just using the technology. Often users must access applications in Operating System (OS) environments other...

    Provided By Stanford University

  • White Papers // Feb 2011

    Using Spectrum Auctions to Enhance Competition in Wireless Services

    Well-designed spectrum auctions can play an important role in fostering a competitive wireless industry. Of even greater importance is the quantity of spectrum made available for wireless services. Spectrum is an essential input. The more spectrum allocated to wireless services, the more competition can be sustained. Other regulatory policies including...

    Provided By Stanford University

  • Webcasts // Jan 2011

    Following Your Startup Vision

    In this webcast, the presenter is an innovator who believes that successful entrepreneurs are the ones who follow through on their original vision. Drawing upon his deep background as a successful serial entrepreneur, the presenter shares his entrepreneurial experiences and discusses many of the competitive and strategic issues facing his...

    Provided By Stanford University

  • Webcasts // Jan 2011

    Delivering Innovation For The Enterprise

    The presenter is an entrepreneur who seeks to reinvent how enterprise businesses share content across their organizations. In 2005, the presenter saw the need for affordable storage on the Internet, and co-founded Box.net out of his college dorm room. In this high-energy lecture, the presenter shares the successes and challenges...

    Provided By Stanford University

  • White Papers // Jan 2011

    Managing Information Leakage

    The authors explore the problem of managing information leakage by connecting two hitherto disconnected topics: Entity Resolution (ER) and Data Privacy (DP). As more of their sensitive data gets exposed to a variety of merchants, health care providers, employers, social sites and so on, there is a higher chance that...

    Provided By Stanford University

  • White Papers // Jan 2011

    Provenance for Generalized Map and Reduce Workflows

    The authors consider a class of workflows, which they call Generalized Map and Reduce Workflows (GMRWs), where input data sets are processed by an acyclic graph of map and reduce functions to produce output results. The authors show how data provenance (also sometimes called lineage) can be captured for map...

    Provided By Stanford University

  • Webcasts // Jan 2011

    Social Entrepreneurship Changing Education

    In this webcast, the presenter is driven to end educational inequity across the nation. In this webcast, the presenter shares her entrepreneurial story of starting Teach For America straight out of college, and articulates the sense of urgency that she and her organization still feel for producing fundamental changes to...

    Provided By Stanford University

  • White Papers // Jan 2011

    Answering Queries Using Humans, Algorithms and Databases

    For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is either ad-hoc or is never used, the authors describe the design of the first declarative language involving human-computable functions, standard relational operators, as well as...

    Provided By Stanford University

  • White Papers // Jan 2011

    MPLS With a Simple OPEN Control Plane

    The authors propose a new approach to MPLS that uses the standard MPLS data plane and an OpenFlow based simpler and extensible control plane. They demonstrate this approach using a prototype system for MPLS Traffic Engineering. MPLS has evolved over 15 years as a solution for ISPs. It is primarily...

    Provided By Stanford University

  • White Papers // Jan 2011

    Functional Encryption: Definitions and Challenges

    The authors initiate the formal study of functional encryption by giving precise definitions of the concept and its security. Roughly speaking, functional encryption supports restricted secret keys that enable a key holder to learn a specific function of encrypted data, but learn nothing else about the data. For example, given...

    Provided By Stanford University

  • White Papers // Jan 2011

    Monitoring Stream Properties for Continuous Query Processing

    The authors' query processor can be thought of as two separate components: a Query Execution component and a Property Monitoring component. Properties used by the Query Execution component, such as stream characteristics and plan operator behavior, are monitored by the Property Monitoring component. Of course, monitoring of operator behavior would...

    Provided By Stanford University

  • White Papers // Jan 2011

    Vision Paper: Enabling Privacy for the Paranoids

    P3P is a set of standards that allow corporations to declare their privacy policies. Hippocratic Databases have been proposed to implement such policies within a corporation's datastore. From an end-user individual's point of view, both of these rest on an uncomfortable philosophy of trusting corporations to protect his/her privacy. Recent...

    Provided By Stanford University

  • White Papers // Jan 2011

    Two Can Keep a Secret: A Distributed Architecture for Secure Database Services

    Recent trends towards database outsourcing, as well as concerns and laws governing data privacy, have led to great interest in enabling secure database services. Previous approaches to enabling such a service have been based on data encryption, causing a large overhead in query processing. The authors propose a new, distributed...

    Provided By Stanford University

  • White Papers // Jan 2011

    One Torus to Rule Them All: Multidimensional Queries in P2P Systems

    Peer-to-peer systems enable access to data spread over an extremely large number of machines. Most P2P systems support only simple lookup queries. However, many new applications, such as P2P photo sharing and massively multi-player games, would benefit greatly from support for multi-dimensional range queries. The authors show how such queries...

    Provided By Stanford University

  • White Papers // Jan 2010

    Experimental Characterization and Modeling of Outdoor-to-Indoor and Indoor-to-Indoor Distributed Channels

    The authors propose and parameterize an empirical model of the outdoor-to-indoor and indoor-to-indoor distributed (cooperative) radio channel, using experimental data in the 2.4 GHz band. In addition to the well-known physical effects of path loss, shadowing, and fading, they include several new aspects in their model that are specific to...

    Provided By Stanford University

  • White Papers // Jan 2012

    SCD: A Scalable Coherence Directory With Flexible Sharer Set Encoding

    Large-scale CMPs with hundreds of cores require a directory-based protocol to maintain cache coherence. However, previously proposed coherence directories are hard to scale beyond tens of cores, requiring either excessive area or energy, complex hierarchical protocols, or inexact representations of sharer sets that increase coherence traffic and degrade performance. The...

    Provided By Stanford University

  • White Papers // Jan 2012

    The Role of SNR in Achieving MIMO Rates in Cooperative Systems

    The authors compare the rate of a multiple-antenna relay channel to the capacity of multiple-antenna systems to characterize the cooperative capacity in different SNR regions. While it is known that in the asymptotic regime, at a high SNR or with a large number of cooperating nodes, cooperative systems lack full...

    Provided By Stanford University

  • White Papers // Jan 2012

    Architectural Support for the Stream Execution Model on General-Purpose Processors

    There has recently been much interest in stream processing, both in industry (e.g., Cell, NVIDIA G80, ATI R580) and academia (e.g., Stanford Merrimac, MIT RAW), with stream programs becoming increasingly popular for both media and more general-purpose computing. Although a special style of programming called stream programming is needed to...

    Provided By Stanford University

  • White Papers // Apr 2011

    Coding the Beams: Improving Beamforming Training in MmWave Communication System

    The mmWave communication system is operating at a regime with high number of antennas and very limited number of RF analog chains. Large number of antennas are used to extend the communication range for recovering the high path loss while fewer RF analog chains are designed to reduce transmit and...

    Provided By Stanford University

  • White Papers // Jul 2010

    Cell Association and Interference Coordination in Heterogeneous LTE-A Cellular Networks

    Embedding pico/femto base-stations and relay nodes in a macro-cellular network is a promising method for achieving substantial gains in coverage and capacity compared to macro-only networks. These new types of base-stations can operate on the same wireless channel as the macro-cellular network, providing higher spatial reuse via cell splitting. However,...

    Provided By Stanford University

  • White Papers // Nov 2010

    Cross-Layer Energy Minimization in TDMA-Based Sensor Networks

    The authors consider sensor networks where energy is a limited resource so that energy consumption must be minimized while satisfying given throughput requirements. Moreover, energy consumption must take into account both the transmission energy and the circuit processing energy for short-range communications. In this context, they analyze the energy-efficient joint...

    Provided By Stanford University

  • White Papers // Nov 2010

    Mixed Integer-Linear Programming for Link Scheduling in Interference-Limited Networks

    The authors consider the problem of link scheduling in wireless networks with interference. The problem of computing a link schedule to minimize the power consumption with the constraint that each link supports a given average data rate is formulated as an optimization problem. A simple analytical solution is obtained for...

    Provided By Stanford University

  • White Papers // Jul 2011

    Uplink Resource Allocation for Frequency Selective Channels and Fractional Power Control in LTE

    The authors consider the allocation of spectral and power resources every subframe (1 ms) on the uplink of the Long Term Evolution (LTE) wideband Orthogonal Frequency Division Multiple Access (OFDMA) cellular network. System bandwidth is divided into multiple sub-bands. The fractional power control to manage interference is allowed to be...

    Provided By Stanford University

  • White Papers // Mar 2012

    Optimal Cooperative Control of Dynamically Decoupled Systems

    The authors consider optimal cooperative control problems where multiple dynamically decoupled players cooperate to optimize a coupled objective under limited communication between each player. They present the explicit optimal control in terms of the solutions to a series of Riccati equations, therefore it can be computed in a distributed manner...

    Provided By Stanford University

  • White Papers // Apr 2012

    Synthesis for Optimal Two-Player Decentralized Control Over TCP Erasure Channels With State Feedback

    Recent advances in communication networks and VLSI have made it possible to provide services remotely. In fact, an increasing number of current services and future deployments, such as distributed database management, grid computing, and the smart grid, are now being built over the cloud, making it inevitable that the control,...

    Provided By Stanford University

  • White Papers // Apr 2012

    Coding Strategies for a Class of Decentralized Control Problems With Limited Communication

    The authors propose a large class of decentralized control problems with non-classical information structure for which a coding strategy is optimal. This class is a generalized version of the hats problem with statistically dependent hat colors where implicit communication via action is allowed. They propose a sufficient condition on the...

    Provided By Stanford University

  • White Papers // Oct 2011

    An Explicit Solution for Optimal Two-Player Decentralized Control Over TCP Erasure Channels With State Feedback

    The authors develop an optimal controller synthesis algorithm for decentralized control problems where control actions are transmitted through TCP-like erasure channels. They consider a simple two-player interconnected linear system and Bernoulli distributed erasure channels. They recast the problem to a centralized Partially Observed Markov Decision Process (POMDP) under the fictitious...

    Provided By Stanford University

  • White Papers // Apr 2011

    A Dynamic Programming Algorithm for Decentralized Markov Decision Processes With a Broadcast Structure

    The authors give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov Decision Processes (MDPs). They consider problems with a broadcast information structure that consists of a central node that only has access to its own state but can affect several outer nodes, while each outer...

    Provided By Stanford University

  • White Papers // Sep 2010

    Adaptive Modulation in Wireless Networks With Smoothed Flow Utility

    The authors investigate flow rate optimization on a wireless link with randomly varying channel gain using techniques from adaptive modulation and network utility maximization. They consider the problem of choosing the data flow rate to optimally trade off average transmit power and the average utility of the smoothed data flow...

    Provided By Stanford University

  • White Papers // Sep 2010

    Residential Demand Response Using Reinforcement Learning

    The authors present a novel energy management system for residential demand response. The algorithm, named CAES, reduces residential energy costs and smooths energy usage. CAES is an online learning application that implicitly estimates the impact of future energy prices and of consumer decisions on long term costs and schedules residential...

    Provided By Stanford University

  • White Papers // Sep 2010

    Optimal Cross-Layer Wireless Control Policies Using TD Learning

    The authors present an on-line cross-layer control technique to characterize and approximate optimal policies for wireless networks. Their approach combines network utility maximization and adaptive modulation over an infinite discrete-time horizon using a class of performance measures they call time smoothed utility functions. They model the system as an average-cost...

    Provided By Stanford University

  • White Papers // Feb 2010

    Optimal Power Line Communications Control Policies Using Stochastic Optimization

    The authors present a general stochastic optimization framework for periodic systems and apply it to PLC networks with Linear and Time Varying (LPTV) channels. Their method of solution operates online and does not assume prior knowledge about the distribution of channel states, but rather samples the LPTV channel to learn...

    Provided By Stanford University

  • White Papers // Feb 2010

    Optimizing Adaptive Modulation in Wireless Networks Via Multi-Period Network Utility Maximization

    The authors present a cross-layer technique to find and characterize optimal control policies for wireless networks operating at different time scales at the upper layer and physical layer. The technique can also be directly applied to networks carrying traffic with different time dependencies such as data or video. Their approach...

    Provided By Stanford University

  • White Papers // Feb 2010

    Stochastic Optimization for Variable Rate Applications With Time-Varying Statistics

    A scheme to provide Quality of Service for buffered variable rate applications is presented that is largely indiscriminate to channel distributions, indeed will track changing statistics, and is effectively spectrum optimal. The solution is based on the framework of Full Recourse Optimization with Expected Constraints where the optimal solution is...

    Provided By Stanford University

  • White Papers // Dec 2008

    Cross-Layer Design With Adaptive Modulation: Delay, Rate, and Energy Tradeoffs

    The authors present a cross-layer framework for optimizing the performance of wireless networks as measured by applications or upper layer protocols. The approach combines adaptive modulation with Network Utility Maximization. They extend the approach to find optimal source rates and transmitter power and rate policies without explicit knowledge of the...

    Provided By Stanford University

  • White Papers // Sep 2010

    Improving the Diversity-Multiplexing Tradeoff With Repetition-Coded Relaying in Wireless Downlink

    Repetition-coded relaying using half-duplex relays offers an easy way of achieving cooperative diversity that works well with apparently any source transmission schemes, but at the same time presents a potentially serious problem of inefficient spectrum utilization. Poor Diversity-Multiplexing Tradeoff (DMT) is often reported. This paper investigates efficient ways of using...

    Provided By Stanford University

  • White Papers // Feb 2012

    Less is More: Trading a Little Bandwidth for Ultra-Low Latency in the Data Center

    Traditional measures of network goodness - goodput, quality of service, fairness - are expressed in terms of bandwidth. Network latency has rarely been a primary concern because delivering the highest level of bandwidth essentially entails driving up latency - at the mean and, especially, at the tail. Recently, however, there...

    Provided By Stanford University

  • White Papers // May 2012

    EyeQ: Practical Network Performance Isolation for the Multi-Tenant Cloud

    The shared multi-tenant nature of the cloud has raised serious concerns about its security and performance for high valued services. Of many shared resources like CPU, memory, etc., the network is pivotal for distributed applications. Benign, or perhaps malicious traffic interference between tenants can cause significant performance degradation that hurts...

    Provided By Stanford University

  • White Papers // Jan 2011

    MPLS With a Simple OPEN Control Plane

    The authors propose a new approach to MPLS that uses the standard MPLS data plane and an OpenFlow based simpler and extensible control plane. They demonstrate this approach using a prototype system for MPLS Traffic Engineering. MPLS has evolved over 15 years as a solution for ISPs. It is primarily...

    Provided By Stanford University

  • White Papers // Jan 2012

    Minimum Expected Distortion in Gaussian Layered Broadcast Coding With Successive Refinement

    A transmitter without Channel State Information (CSI) wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refining the description in the previous one. The receiver decodes the layers that are supported by the channel realization and...

    Provided By Stanford University

  • White Papers // Sep 2011

    Decoupling Datacenter Studies From Access to Large-Scale Applications: A Modeling Approach for Storage Workloads

    The cost and power impact of suboptimal storage configurations is significant in DataCenters (DCs) as inefficiencies are aggregated over several thousand servers and represent considerable losses in capital and operating costs. Designing performance, power and cost-optimized systems requires a deep understanding of target workloads, and mechanisms to effectively model different...

    Provided By Stanford University

  • White Papers // Jul 2011

    Time and Cost-Efficient Modeling and Generation of Large-Scale TPCC/TPCE/TPCH Workloads

    Large-scale TPC workloads are critical for the evaluation of datacenter-scale storage systems. However, these workloads have not been previously characterized, in-depth, and modeled in a DC environment. In this paper, the authors categorize the TPC workloads into storage threads that have unique features and characterize the storage activity of TPCC,...

    Provided By Stanford University

  • White Papers // Mar 2010

    State of the Art: Automated Black-Box Web Application Vulnerability Testing

    Black-box web application vulnerability scanners are automated tools that probe web applications for security vulnerabilities. In order to assess the current state of the art, the authors obtained access to eight leading tools and carried out a study of: the class of vulnerabilities tested by these scanners, their effectiveness against...

    Provided By Stanford University

  • White Papers // May 2012

    Channel Capacity Under General Nonuniform Sampling

    This paper develops the fundamental capacity limits of a sampled analog channel under a sub-Nyquist sampling rate constraint. In particular, the authors derive the capacity of sampled analog channels over a general class of time-preserving sampling methods including irregular non-uniform sampling. Their results indicate that the optimal sampling structures extract...

    Provided By Stanford University

  • White Papers // Mar 2012

    Achievable Error Exponents in the Gaussian Channel With Rate-Limited Feedback

    The authors investigate the achievable error probability in communication over an AWGN discrete time memoryless channel with noiseless delay-less rate-limited feedback. For the case where the feedback rate RFB is lower than the data rate R transmitted over the forward channel, they show that the decay of the probability of...

    Provided By Stanford University

  • White Papers // Oct 2011

    Reduced-Dimension Multiuser Detection

    The authors present a Reduced-Dimension MultiUser Detector (RD-MUD) structure that significantly decreases the number of required correlation branches at the receiver front-end, while still achieving performance similar to that of the conventional Matched-Filter (MF) bank. RD-MUD exploits the fact that the number of active users is typically small relative to...

    Provided By Stanford University

  • White Papers // Oct 2009

    Networked Markov Decision Processes With Delays

    The authors consider a networked control system, where each subsystem evolves as a Markov Decision Process (MDP). Each subsystem is coupled to its neighbors via communication links over which the signals are delayed, but are otherwise transmitted noise-free. A centralized controller receives delayed state information from each subsystem. The control...

    Provided By Stanford University

  • White Papers // Apr 2012

    Shannon Meets Nyquist: Capacity Limits of Sampled Analog Channels

    The authors explore two fundamental questions at the intersection of sampling theory and information theory: how is channel capacity affected by sampling below the channel's Nyquist rate, and what sub-Nyquist sampling strategy should be employed to maximize capacity. In particular, they first derive the capacity of sampled analog channels for...

    Provided By Stanford University

  • White Papers // Sep 2009

    Cycle-Accurate Simulation of Energy Consumption in Embedded Systems

    This paper presents a methodology for cycle-accurate simulation of energy dissipation in embedded systems. The ARM Ltd instruction-level cycle-accurate simulator is extended with energy models for the processor the L2 cache, the memory the interconnect and the DC-DC converter. A SmartBadge which can be seen as an embedded system consisting...

    Provided By Stanford University

  • White Papers // Sep 2009

    Event-Driven Power Management of Portable Systems

    The policy optimization problem for dynamic power management has received considerable attention in the recent past. The authors formulate policy optimization as a constrained optimization problem on continuous-time Semi-Markov Decision Processes (SMDP). SMDPs generalize the stochastic optimization approach based on discrete-time Markov Decision Processes (DTMDP) presented in the earlier work...

    Provided By Stanford University

  • White Papers // Sep 2009

    Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing

    The authors conducted an extensive computational experiment, lasting multiple CPU-years, to optimally select parameters for two important classes of algorithms for finding sparse solutions of underdetermined systems of linear equations. They make the optimally tuned implementations available; they run 'Out of the box' with no user tuning: It is not...

    Provided By Stanford University

  • White Papers // Mar 2011

    Fast Crash Recovery in RAMCloud

    RAMCloud is a DRAM-based storage system that provides inexpensive durability and availability by recovering quickly after crashes, rather than storing replicas in DRAM. RAMCloud scatters backup data across hundreds or thousands of disks, and it harnesses hundreds of servers in parallel to reconstruct lost data. The system uses a log-structured...

    Provided By Stanford University

  • White Papers // Jun 2010

    Managing State for Ajax-Driven Web Components

    Ajax-driven Web applications require state to be maintained across a series of server requests related to a single Web page. This conflicts with the stateless approach used in most Web servers and makes it difficult to create modular components that use Ajax. The authors implemented and evaluated two approaches to...

    Provided By Stanford University

  • White Papers // Dec 2009

    The Case for RAMClouds: Scalable High-Performance Storage Entirely in DRAM

    Disk-oriented approaches to online storage are becoming increasingly problematic: they do not scale gracefully to meet the needs of large-scale Web applications, and improvements in disk capacity have far outstripped improvements in access latency and bandwidth. This paper argues for a new approach to datacenter storage called RAMCloud, where information...

    Provided By Stanford University