Stanford University

Displaying 1-40 of 666 results

  • 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 // 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 // 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 // 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 // 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 // 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 // Mar 2012

    Identity-Based Encryption Is Secure in the Quantum Random Oracle Model

    The authors give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first unconditional proof of security for any scheme in this model. Their techniques are quite general and they use them to obtain (unconditional) security proofs for two random...

    Provided By Stanford University

  • White Papers // Mar 2012

    Improved Security for Linearly Homomorphic Signatures: A Generic Framework

    The authors propose a general framework that converts (ordinary) signature schemes having certain properties into linearly homomorphic signature schemes, i.e., schemes that allow authentication of linear functions on signed data. The security of the homomorphic scheme follows from the same computational assumption as is used to prove security of the...

    Provided By Stanford University

  • White Papers // Feb 2012

    Header Space Analysis: Static Checking for Networks

    Today's networks typically carry or deploy dozens of protocols and mechanisms simultaneously such as MPLS, NAT, ACLs and route redistribution. Even when individual protocols function correctly, failures can arise from the complex interactions of their aggregate, requiring network administrators to be masters of detail. The authors' goal is to automatically...

    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 // Jan 2012

    Initial Thoughts on Custom Network Processing Via Waypoint Services

    Network operators want additional functionality from the networks they manage. The current approach to add functionality is to deploy middleboxes. Unfortunately middle-boxes raise concerns regarding robustness, correctness, and efficiency due to their need to be deployed at chokepoints. This paper provides some initial thoughts for solving the middlebox problem in...

    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

    Network Congestion Avoidance Through Speculative Reservation

    Congestion caused by hot-spot traffic can significantly degrade the performance of a computer network. In this paper, the authors present the Speculative Reservation Protocol (SRP), a new network congestion control mechanism that relieves the effect of hot-spot traffic in high bandwidth, low latency, lossless computer networks. Compared to existing congestion...

    Provided By Stanford University

  • White Papers // Jan 2012

    A Methodology for Mapping Multiple Use-Cases Onto Networks on Chips

    A communication-centric design approach, Networks on Chips (NoCs), has emerged as the design paradigm for designing a scalable communication infrastructure for future Systems on Chips (SoCs). As technology advances, the number of applications or use-cases integrated on a single chip increases rapidly. The different use-cases of the SoC have different...

    Provided By Stanford University

  • White Papers // Jan 2012

    Mapping and Configuration Methods for Multi-Use-Case Networks on Chips

    To provide a scalable communication infrastructure for Systems on Chips (SoCs), Networks on Chips (NoCs), a communication centric design paradigm is needed. To be cost effective, SoCs are often programmable and integrate several different applications or use-cases on to the same chip. For the SoC platform to support the different...

    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 // 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 // Jan 2012

    Service Differentiation in the Internet to Support Multimedia Traffic

    The current best-effort infrastructure in the Internet lacks key characteristics in terms of delay, jitter, and loss, which are required for multimedia applications (voice, video, and data). Recently, significant progress has been made toward specifying the service differentiation to be provided in the Internet for supporting multimedia applications. In this...

    Provided By Stanford University

  • White Papers // Oct 2011

    Efficient Parallel Graph Exploration on Multi-Core CPU and GPU

    Graphs are a fundamental data representation that have been used extensively in various domains. In graph-based applications, a systematic exploration of the graph such as a Breadth-First Search (BFS) often serves as a key component in the processing of their massive data sets. In this paper, the authors present a...

    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 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 // 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 // Sep 2011

    Micro-Interactions With NFC-Enabled Mobile Phones

    This paper coins the term micro-interactions to refer to the class of small exchanges between devices that occur almost instantaneously. For example, a mobile payment using Near-Field Communication (NFC) is a micro-interaction. The arrival of NFC on smart phones makes possible a wide array of applications using micro-interactions, from sharing...

    Provided By Stanford University

  • White Papers // Aug 2011

    Buffer Sizing in 802.11 Wireless Mesh Networks

    The authors analyze the problem of buffer sizing for TCP flows in 802.11-based Wireless Mesh Networks. Their objective is to maintain high network utilization while providing low queueing delays. The problem is complicated by the time-varying capacity of the wireless channel as well as the random access mechanism of 802.11...

    Provided By Stanford University

  • White Papers // Aug 2011

    Dynamic Fine-Grain Scheduling of Pipeline Parallelism

    Scheduling pipeline-parallel programs, defined as a graph of stages that communicate explicitly through queues, is challenging. When the application is regular and the underlying architecture can guarantee predictable execution times, several techniques exist to compute highly optimized static schedules. However, these schedules do not admit run-time load balancing, so variability...

    Provided By Stanford University

  • White Papers // Aug 2011

    Black-Box Randomized Reductions in Algorithmic Mechanism Design

    The authors give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multi-parameter problems. Specifically, they prove that every welfare-maximization problem that admits an FPTAS and can be encoded as a packing problem also admits a truthful-in-expectation randomized mechanism that is an...

    Provided By Stanford University

  • White Papers // Aug 2011

    On the Role of Mobility for Multi-Message Gossip

    In wireless ad hoc or social networks, a variety of scenarios require agents to share their individual information or resources with each other for mutual benefit. A partial list includes file sharing and rumor spreading, distributed computation and parameter estimation, and scheduling and control. Due to the huge centralization overhead...

    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 // 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 // Jun 2011

    Targeted Malleability: Homomorphic Encryption for Restricted Computations

    The authors put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios they would like to restrict the homomorphic computations one can perform on encrypted data. They introduced a precise framework, generalizing the foundational notion of non-malleability introduced by Dolev, Dwork, and Naor (SICOMP '00),...

    Provided By Stanford University

  • White Papers // Jun 2011

    Parallelizing Machine Learning - Functionally

    Implementing machine learning algorithms for large data, such as the Web graph and social networks, is challenging. Even though much research has focused on making sequential algorithms more scalable, their running times continue to be prohibitively long. Meanwhile, parallelization remains a formidable challenge for this class of problems, despite frameworks...

    Provided By Stanford University

  • Webcasts // May 2011

    Innovate For America

    The presenter focuses on advancing technology and innovation to unlock national economic growth and prosperity. In this webcast, the presenter challenges students and entrepreneurs to take action now to bring innovation to the healthcare, education and government sectors.

    Provided By Stanford University

  • White Papers // May 2011

    Performance Implications of Age-Based Allocation in On-Chip-Networks

    Age-based priority is a common mechanism used to improve the fairness and Quality-of-Service (QoS) characteristics of interconnection networks. Packet age can provide remote network state information that enables routers to service packets in a globally optimal fashion. In the Network-on-Chip (NoC) setting, age-based allocation is implemented by assigning priorities to...

    Provided By Stanford University

  • Webcasts // May 2011

    The Value Of True Partnerships

    The presenters are serial entrepreneurs who believe in the fundamental power of partnerships. Empowered by working in close collaboration for years, these co-founders have started multiple companies including Patagon, Lemon Bank and Bling Nation. In this webcast, the presenters describe the value of over-communication, the decision process in making a...

    Provided By Stanford University

  • Webcasts // May 2011

    From Stanford To Startup

    In this webcast, the presenters challenge many of the myths surrounding startups and the lives of entrepreneurs. Both the presenters share their first-hand experiences of the entrepreneurial process, including identifying good problems to solve and the value in building simple solutions and minimum viable products.

    Provided By Stanford University

  • White Papers // May 2011

    The Case for Prefetching and Prevalidating TLS Server Certificates

    A key bottleneck in a full TLS handshake is the need to fetch and validate the server certificate before a secure connection can be established. The authors propose a mechanism by which a browser can pre-fetch and pre-validate server certificates so that by the time the user clicks on an...

    Provided By Stanford University

  • Webcasts // May 2011

    Reach Your Escape Velocity

    In this webcast, the presenter discusses how companies can build the escape velocity necessary to move beyond the successes and failures of the past. The presenter argues that when companies focus too much on performance, they miss out on building the power to become the industry leaders that other companies...

    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 // Oct 2009

    FlowVisor: A Network Virtualization Layer

    This paper presents a new approach to switch virtualization in which the same hardware forwarding plane can be shared among multiple logical networks, each with distinct forwarding logic. This paper uses this switch-level virtualization to build a research platform which allows multiple network experiments to run side-by-side with production traffic...

    Provided By Stanford University

  • White Papers // Jan 2010

    Characterizing And Predicting Which Bugs Get Fixed: An Empirical Study Of Microsoft Windows

    The authors performed an empirical study to characterize factors that affect which bugs get fixed in Windows Vista and Windows 7, focusing on factors related to bug report edits and relationships between people involved in handling the bug. The authors found that bugs reported by people with better reputations were...

    Provided By Stanford University

  • White Papers // Sep 2009

    Lossless Handover With N-Casting Between WiFi-WiMAX on OpenRoads

    The authors envisioned a future mobile wireless Internet with many radios, and many networks (in POMI). By that, they mean many radios will be found in a future mobile device. It is now common for a handheld to have WiFi, bluetooth, GSM and/or 3G radios, with WiMAX and LTE in...

    Provided By Stanford University

  • Webcasts // Jan 2011

    Private Versus Public Company Tradeoffs: Building Credibility

    Dominic Orr, CEO of Aruba Networks, describes the tradeoffs for an entrepreneurial company between being private or public. Orr argues that being public offers a significant benefit for an entrepreneurial company because it confers credibility and legitimacy which can aid the startup in selling to larger organizations. Of course, these...

    Provided By Stanford University

  • Webcasts // Jan 2011

    Entrepreneurship And Free, Prosperous Society

    Jack Leslie, Chairman of Weber Shandwick, discusses the lessons he learned regarding emerging economies and entrepreneurship. First, Leslie argues that the creation of freedom and prosperity comes from a nation's internal entrepreneurial spirit, not imposed from above or abroad. Second, Leslie suggests that an entrepreneurial society is at the foundation...

    Provided By Stanford University

  • Webcasts // Jan 2011

    The Story Of Global Fund For Women

    Kavita Ramdas, President and CEO of the Global Fund for Women talks about the organization as a classic Silicon Valley story taking birth in a kitchen in 1987. The organization provides seed and strengthening capital for social entrepreneurs who are working for change.

    Provided By Stanford University

  • Webcasts // Jan 2011

    Local Vs. International Philanthropy

    Global Fund for Women CEO Kavita Ramdas talks about financial contributions for the greater good both locally and internationally - and that here in the US one gives a very small percentage of their income to remedy the world's concerns. Ramdas cites the gap that exists between how much people...

    Provided By Stanford University

  • Webcasts // Jan 2011

    The Global Future

    When asked what the future of technology and venture capital will look like, Doerr frames it as career advice for his daughters: learn Mandarin and earn a degree in a biotechnology related field.

    Provided By Stanford University

  • Webcasts // Jan 2011

    Role Of VC In Valuation

    Things aren't ever as good or as bad as we think. Today (2002) is one of the best environments to be an investor. The last three or four years were not a lot of fun - if Khosla went to someone to build a reasonable business, the response he would...

    Provided By Stanford University

  • Webcasts // Jan 2011

    Introduction: Mobius Venture Capital

    Heidi Roizen, managing director for Mobius Venture Capital, explains that Mobius Venture Capital has $1.5 B under management in current fund, $1 B in prior fund, and 100 active portfolio companies. There are ten VCs at Mobius who invest mostly in software, communication, wireless, next generation and web services, she...

    Provided By Stanford University

  • Webcasts // Jan 2011

    Work With The Right VC

    Amidst all of the bad stories circulating about venture capital funding, Randy insists that there are many VCs who are truly interested in the success of a company and will treat entrepreneurs fairly and with respect.

    Provided By Stanford University

  • White Papers // Aug 2010

    Beyond Testing: Empirical Models Of Insurance Markets

    The authors describe recent advances in the empirical analysis of insurance markets. This new research proposes ways to estimate individual demand for insurance and the relationship between prices and insurer costs in the presence of adverse and advantageous selection. The authors discuss how these models permit the measurement of welfare...

    Provided By Stanford University

  • White Papers // Dec 2010

    A Machine Learning Approach For Future Career Planning

    For college students, when facing various career options upon graduation, it could be overwhelming to choose a job that better fits with his/her future career goals. Also, for current employees, it could be unclear that whether changing a job or pursuing advanced study will help to reach his/her ambition. This...

    Provided By Stanford University

  • White Papers // Apr 2010

    Career Resources & Services For The Mechanical Engineering Department

    It is estimated that there are more than 200,000 mechanical engineers employed in the United States and twice that worldwide. The employers of these engineers are academia, the government and private industry - with industry employing more than half. Whatever path you choose, you will find that mechanical engineers are...

    Provided By Stanford University

  • White Papers // Jan 2011

    Disco: Running Commodity Operating Systems on Scalable Multiprocessors

    In this paper the authors examine the problem of extending modern operating systems to run efficiently on large-scale shared memory multiprocessors without a large implementation effort. The approach brings back an idea popular in the 1970s, virtual machine monitors. They use virtual machines to run multiple commodity operating systems on...

    Provided By Stanford University

  • White Papers // Jan 2011

    Sailing the Information Ocean With Awareness of Currents: Discovery and Application of Source Dependence

    The Web has enabled the availability of a huge amount of useful information, but has also eased the ability to spread false information and rumors across multiple sources, making it hard to distinguish between what is true and what is not. Recent examples include the premature Steve Jobs obituary, the...

    Provided By Stanford University

  • White Papers // Jan 2011

    CMC: A Pragmatic Approach to Model Checking Real Code

    Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of execution. Model checking is an effective way to find such subtle errors. It takes a simplified description of the code...

    Provided By Stanford University

  • White Papers // Dec 2009

    Learning 3D Point Cloud Histograms

    In this paper the authors show how using histograms based on the angular relationships between a subset of point normals in a 3D point Cloud can be used in a machine learning algorithm in order to recognize different classes of objects given by the 3D point clouds. This approach extends...

    Provided By Stanford University

  • White Papers // May 2010

    Language Virtualization for Heterogeneous Parallel Computing

    As heterogeneous parallel systems become dominant, application developers are being forced to turn to an incompatible mix of low level programming models (e.g. OpenMP, MPI, CUDA, OpenCL). However, these models do little to shield developers from the difficult problems of parallelization, data decomposition and machine-specific details. Ordinary programmers are having...

    Provided By Stanford University

  • White Papers // Sep 2008

    Market Reaction To The Adoption Of IFRS In Europe

    This paper examines the European stock market reaction to sixteen events associated with the adoption of International Financial Reporting Standards (IFRS) in Europe. European IFRS adoption represented a major milestone towards financial reporting convergence yet spurred controversy reaching the highest levels of government. The authors find a more positive reaction...

    Provided By Stanford University

  • White Papers // Jan 2011

    Public Key Encryption With Keyword Search

    The authors study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice's public key. An email gateway wants to test whether the email contains the keyword "Urgent" so that it could route the...

    Provided By Stanford University

  • White Papers // Jun 2010

    Top 10 Elements Of Technology Entrepreneurship For High-Growth Innovation

    Technology entrepreneurship is a style of business leadership based on the process of identifying high-potential, technology-intensive business opportunities, gathering resources such as talent and cash, and managing rapid growth using principled, real-time decision-making skills. An attractive business opportunity consists of a great value proposition, technically feasible products, strong intellectual property,...

    Provided By Stanford University

  • White Papers // Jan 2010

    Distributed Wireless Network Utility Maximization

    The authors propose a distributed method of solution for the RRPWNUM problem to optimize the rate-reliability tradeoff in wireless networks with randomly time-varying channels. Distributed implementation of the proposed algorithm is based on the primal-dual decomposition of the problem and uses stochastic gradients to solve both the primal and dual...

    Provided By Stanford University

  • White Papers // Sep 2008

    A Bayesian Network Approach to Control of Networked Markov Decision Processes

    The authors consider the problem of finding an optimal feedback controller for a networked Markov decision process. Specifically, they consider a network of interconnected subsystems, where each subsystem evolves as a Markov Decision Process (MDP). A subsystem is connected to its neighbors via links over which signals are delayed. They...

    Provided By Stanford University

  • White Papers // Oct 2009

    The Factor K: Inferring Protocol Performance Using Inter-Link Reception Correlation

    This paper explores metrics that capture to what degree packet reception on different links is correlated. It shows that a widely used metric is a bad measure and presents normalized cross correlation index as a new metric. The authors call this new metric K (kappa). Measuring K sheds light on...

    Provided By Stanford University

  • White Papers // Jan 2011

    Pinpoint: Problem Determination in Large, Dynamic Internet Services

    Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today's large, distributed, and dynamic application environments such as e-commerce systems. In this paper, the authors present a dynamic analysis methodology that automates problem determination in these environments by coarse-grained tagging of numerous real...

    Provided By Stanford University

  • White Papers // Jan 2011

    SiRiUS: Securing Remote Untrusted Storage

    This paper presents SiRiUS, a secure file system designed to be layered over insecure network and P2P file systems such as NFS, CIFS, OceanStore, and Yahoo! Briefcase. SiRiUS assumes the network storage is untrusted and provides its own read-write cryptographic access control for file level sharing. Key management and revocation...

    Provided By Stanford University

  • White Papers // May 2009

    Cross-Layer Energy and Delay Optimization in Small-Scale Sensor Networks

    The general joint design of the physical, MAC, and routing layers to minimize network energy consumption is complex and hard to solve. Heuristics to compute approximate solutions and high-complexity algorithms to compute exact solutions have been previously proposed. This paper focuses on synchronous small-scale networks with interference-free link scheduling and...

    Provided By Stanford University

  • White Papers // Nov 2009

    XCS: Cross Channel Scripting and Its Impact on Web Applications

    The authors study the security of embedded web servers used in consumer electronic devices, such as security cameras and photo frames, and for IT infrastructure, such as wireless access points and lights-out management systems. All the devices the authors examine turn out to be vulnerable to a variety of web...

    Provided By Stanford University

  • White Papers // Aug 2008

    A Black Swan In The Money Market

    The recent financial crisis saw a dramatic and persistent jump in interest rate spreads between overnight federal funds and longer-term interbank loans. The Fed took several actions to reduce these spreads, including the creation of the Term Auction Facility (TAF). The effectiveness of these policies depends on the cause of...

    Provided By Stanford University

  • White Papers // Jan 2011

    Media-Aware Multi-User Rate Allocation Over Wireless Mesh Network

    When multiple video streams are transmitted in a wireless mesh network, each stream needs to adapt its rate to the time-varying traffic in the network. The authors propose a media-aware rate allocation algorithm that adjusts the video rate based on both video content and network congestion. This is combined with...

    Provided By Stanford University

  • White Papers // Feb 2010

    Tree Histogram Coding for Mobile Image Matching

    For mobile image matching applications, a mobile device captures a query image, extracts descriptive features, and transmits these features wirelessly to a server. The server recognizes the query image by comparing the extracted features to its database and returns information associated with the recognition result. For slow links, query feature...

    Provided By Stanford University

  • White Papers // Mar 2009

    Dynamic Resource Modeling for Heterogeneous Wireless Networks

    High variability of access resources in heterogenous wireless networks and limited computing power and battery life of mobile computing devices such as smartphones call for novel approaches to satisfy the quality-of-service requirements of emerging wireless services and applications. Towards this end, the authors first investigate a Markov-based stochastic scheme for...

    Provided By Stanford University

  • White Papers // Jul 2010

    Building Book Inventories Using Smartphones

    Manual generation of a book inventory is time-consuming and tedious, while deployment of barcode and radio-frequency identification (RFID) management systems is costly and affordable only to large institutions. In this paper, the authors design and implement a mobile book recognition system for conveniently generating an inventory of books by snapping...

    Provided By Stanford University

  • White Papers // Jul 2010

    Low-Cost Asset Tracking Using Location-Aware Camera Phones

    Maintaining an accurate and up-to-date inventory of one's assets is a labor-intensive, tedious, and costly operation. To ease this difficult but important task, the authors design and implement a mobile asset tracking system for automatically generating an inventory by snapping photos of the assets with a smartphone. Since smartphones are...

    Provided By Stanford University

  • White Papers // Aug 2008

    PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment

    Increasing use of computers and networks in business, government, recreation, and almost all aspects of daily life has led to a proliferation of sensitive data about people and organizations. Without proper precautions, these sensitive data can be misused, misinterpreted, or mismanaged. The PORTIA project aims to develop a comprehensive, end-to-end...

    Provided By Stanford University

  • White Papers // Jun 2010

    The Case for Ubiquitous Transport-Level Encryption

    Today, Internet traffic is encrypted only when deemed necessary. Yet modern CPUs could feasibly encrypt most traffic. Moreover, the cost of doing so will only drop over time. TCP-Crypt is a TCP extension designed to make end-to-end encryption of TCP traffic the default, not the exception. To facilitate adoption TCP-Crypt...

    Provided By Stanford University

  • White Papers // Jan 2010

    InvisiType: Object-Oriented Security Policies

    Many modern software platforms today, including browsers, middleware server architectures, cell phone operating systems, web application engines, support third-party software extensions. This paper proposes InvisiType, an object-oriented approach that enables platform developers to efficiently enforce fine-grained safety checks on third-party extensions without requiring their cooperation. This allows people to harness...

    Provided By Stanford University

  • White Papers // Feb 2009

    Automatic Dimension Inference and Checking for Object-Oriented Programs

    This paper introduces UniFi, a tool that attempts to automatically detect dimension errors in Java programs. UniFi infers dimensional relationships across primitive type and string variables in a program, using an inter-procedural, context-sensitive analysis. It then monitors these dimensional relationships as the program evolves, flagging inconsistencies that may be errors....

    Provided By Stanford University

  • White Papers // Aug 2010

    Political Economy Of The Financial Crises In Japan & The United States

    Currently, the United States is suffering from a financial crisis. Japan also struggled with a financial crisis from the late 1990's to the early 2000's. What implications can be drawn from these crisis experiences of the two largest economies in the world? This paper examines, from the viewpoint of political...

    Provided By Stanford University