University of California

Displaying 241-280 of 542 results

  • White Papers // Jan 2011

    Spectrum Opportunity Detection: How Good Is Listen-Before-Talk?

    The authors consider spectrum opportunity detection in cognitive radio networks for spectrum overlay. They highlight the differences between detecting primary signals and detecting spectrum opportunities. They show that besides noise and fading, the geographic distribution and traffic pattern of primary users have significant impact on the performance of spectrum opportunity...

    Provided By University of California

  • White Papers // Jan 2011

    A Self-Healing and Optimizing Routing Technique for Ad Hoc Networks

    On demand routing protocols provide scalable and cost-effective solutions for packet routing in wireless ad hoc networks. The paths generated by these protocols may deviate far from the optimal because of the lack of knowledge about the global topology and the mobility of nodes. Routing optimality affects network performance, especially...

    Provided By University of California

  • White Papers // Jan 2011

    Paravirtualization for HPC Systems

    In this work, the authors investigate the efficacy of using paravirtualizing software for performance-critical HPC kernels and applications. They present a comprehensive performance evaluation of Xen, a low-overhead, Linux-based, virtual machine monitor, for paravirtualization of HPC cluster systems at LLNL. They investigate subsystem and overall performance using a wide range...

    Provided By University of California

  • White Papers // Jan 2011

    Application-Specific Garbage Collection

    Prior work, including the own, shows that application performance in garbage collected languages is highly dependent upon the application behavior and on underlying resource availability. The authors show that given a wide range of diverse Garbage Collection (GC) algorithms, no single system performs best across programs and heap sizes. They...

    Provided By University of California

  • White Papers // Jan 2011

    HPS: Hybrid Profiling Support

    Key to understanding and optimizing complex applications, is the ability to dynamically monitor executing programs with low overhead and high accuracy. Toward this end, the authors present HPS, a Hybrid Profiling Support system. HPS employs a hardware/software approach to program sampling that transparently, efficiently, and dynamically samples an executing instruction...

    Provided By University of California

  • White Papers // Jan 2011

    Efficient and General On-Stack Replacement for Aggressive Program Specialization

    Efficient invalidation and dynamic replacement of executing code - On-Stack Replacement (OSR), is necessary to facilitate effective, aggressive, specialization of object-oriented programs that are dynamically loaded, incrementally compiled, and garbage collected. Extant OSR mechanisms restrict the performance potential of program specialization since their implementations are special-purpose and restrict compiler optimization....

    Provided By University of California

  • White Papers // Jan 2011

    Using Adaptive Optimization Techniques to Teach Mobile Java Computing

    Dynamic, adaptive optimization is quickly becoming vital to the future of high-performance, mobile computing using Java. These compilation environments have the potential to enable ubiquitous computing on resources that together represent greater computing power than that which can be extracted from existing supercomputers. As a result, the authors believe that...

    Provided By University of California

  • White Papers // Jan 2011

    SARA: Combining Stack Allocation and Register Allocation

    Commonly-used memory units enable a processor to load and store multiple registers in one instruction. The authors showed in 2003 how to extend gcc with a Stack-Location-Allocation (SLA) phase that reduces memory traffic by rearranging the stack and replacing some load/store instructions with load/store-multiple instructions. While speeding up the target...

    Provided By University of California

  • White Papers // Jan 2011

    Looking for Diamonds in the Desert - Extending Automatic Protocol Generation to Three-Party Authentication and Key Agreement Protocols

    The current process of designing a security protocol is usually ad-hoc and involves little formalism and mechanical assistance. Such a design process is not only slow but also error-prone. Evidence shows that even when security protocols are designed with care and examined intensely,they can still be fundamentally flawed. A classic...

    Provided By University of California

  • White Papers // Jan 2011

    Timing Analysis of Keystrokes and Timing Attacks on SSH

    SSH is designed to provide a secure channel between two hosts. Despite the encryption and authentication mechanisms it uses, SSH has two weakness: First, the transmitted packets are padded only to an eight-byte boundary (if a block cipher is in use), which reveals the approximate size of the original data....

    Provided By University of California

  • White Papers // Jan 2011

    On the Throughput Capacity of Random Wireless Networks

    The authors consider the problem of how throughput in a wireless network with randomly located nodes scales as the number of users n grows. Their results rely on percolation theory arguments. When the node density is too high the network is fully connected but generates excessive interference. In the low...

    Provided By University of California

  • White Papers // Jan 2011

    Joint Design of Scheduling and Routing Based on Connected Coverage for Optimal Sensor Network Lifetime

    The authors consider information retrieval in a wireless sensor network deployed to monitor a spatially corrected random led. The measured data are sent to an access point through multi-hop transmissions. They address the joint design of sensor scheduling and information routing in each data collection to optimize a performance measure:...

    Provided By University of California

  • White Papers // Jan 2011

    Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks

    The authors consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. They address sensor scheduling in each data collection under the performance measure of network lifetime. They formulate this problem as an energy constrained coverage problem and proposal a scheduling algorithm based on...

    Provided By University of California

  • White Papers // Jan 2011

    Detecting MAC Layer Back-Off Timer Violations in Mobile Ad Hoc Networks

    In IEEE 802.11 based ad hoc networks, by simply manipulating the back-off timers and/or wait times prior to transmission, malicious nodes can cause a drastically reduced allocation of bandwidth to well-behaved nodes. This can result in causing bandwidth starvation and hence, a denial of service to legitimate nodes. The authors...

    Provided By University of California

  • White Papers // Jan 2011

    Toward a Definition of and Linguistic Support for Partial Quiescence

    The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provide global quiescence detection as a built-in feature so that programmers do not need to write special synchronization code to detect quiescence. This paper introduces Partial Quiescence (PQ), which...

    Provided By University of California

  • White Papers // Dec 2010

    Variable-Length Coding With Noiseless Feedback and Finite Messages

    This paper considers the problem of zero-rate (fixed number of messages) variable-length coding over a memoryless noisy channel with noiseless feedback. This problem is considered from a control theoretic point of view and is modeled as a special case of active sequential hypothesis testing. Techniques from dynamic programming are applied...

    Provided By University of California

  • White Papers // Dec 2010

    Solution Processed Silver Sulfide Thin Films for Filament Memory Applications

    Filament Memories based on resistive switching have been attracting attention in recent years as a potential replacement for flash memory in CMOS technology and as a potential candidate memory for low-cost, large-area electronics. These memories operate at low voltages with fast switching speeds. These devices are based on ionic conduction...

    Provided By University of California

  • White Papers // Dec 2010

    Optimizing Irregular Data Accesses for Cluster and Multi-Core Architectures

    Applications with irregular accesses to shared state are one of the most challenging computational patterns in parallel computing. Accesses can involve both read or write operations, with writes having the additional complexity of requiring some form of synchronization. Irregular accesses perform poorly in local cached-based memory systems and across networks...

    Provided By University of California

  • White Papers // Dec 2010

    Robust Communication in Vehicular Ad Hoc Networks

    The development of intelligent transportation systems is one of the most important strategies for making roads safer and more efficient. The key technology underpinning all such systems, from cooperative safety systems to electronic tolling, is wireless communications. Vehicles must be able to communicate with each other, and with fixed infrastructure,...

    Provided By University of California

  • White Papers // Dec 2010

    The SCADS Director: Scaling a Distributed Storage System Under Stringent Performance Requirements

    Elasticity of cloud computing environments provides an economic incentive for automatic resource allocation of stateful systems running in the cloud. However, these systems have to meet strict performance Service-Level Objectives (SLOs) expressed using upper percentiles of request latency, such as the 99th. Such latency measurements are very noisy, which complicates...

    Provided By University of California

  • White Papers // Dec 2010

    A Meta-Notation for Data Visualization

    The authors describe a meta-notation devised to express the major structural characteristics in widely-used data visualizations. The meta-notation consists of unary and binary operators that can be combined to represent a visualization. Capturing structural features of a visualization, the meta-notation can be applied to match or compare two visualizations at...

    Provided By University of California

  • White Papers // Dec 2010

    Nonadaptive Mastermind Algorithms for String and Vector Databases, With Case Studies

    In this paper, the authors study sparsity-exploiting Mastermind algorithms for attacking the privacy of an entire database of character strings or vectors, such as DNA strings, movie ratings, or social network friendship data. Based on reductions to non-adaptive group testing, the methods are able to take advantage of minimal amounts...

    Provided By University of California

  • White Papers // Dec 2010

    SUDOKU: Secure and Usable Deployment of Keys on Wireless Sensors

    Initial deployment of secrets plays a crucial role in any security design, but especially in hardware constrained wireless sensor networks. Many key management schemes assume either manually pre-installed shared secrets or keys authenticated with the aid of out-of-band channels. While manually installing secret keys affects the practicability of the key...

    Provided By University of California

  • White Papers // Dec 2010

    Variability-Aware Duty Cycle Scheduling in Long Running Embedded Sensing Systems

    Instance and temperature-dependent leakage power variability is already a significant issue in contemporary embedded processors, and one which is expected to increase in importance with scaling of semiconductor technology. The authors measure and characterize this leakage power variability in current microprocessors, and show that variability aware duty cycle scheduling produces...

    Provided By University of California

  • White Papers // Dec 2010

    Diesel: Applying Privilege Separation to Database Access

    Database-backed applications typically grant complete database access to every part of the application. In this scenario, a flaw in one module can expose data that the module never uses for legitimate purposes. Drawing parallels to traditional privilege separation, the authors argue that database data should be subject to limitations such...

    Provided By University of California

  • White Papers // Dec 2010

    Good Neighbor: Secure Pairing of Nearby Wireless Devices by Multiple Antennas

    The proliferation of personal wireless devices requires secure connection between them. While it is easy to securely pair electronic devices by wires, it is very challenging to pair them wirelessly when they have no prior association. The authors propose Good Neighbor, a novel scheme that securely pairs nearby wireless devices...

    Provided By University of California

  • White Papers // Dec 2010

    GeoServ: A Distributed Urban Sensing Platform

    Urban sensing where mobile users continuously gather, process, and share location-sensitive sensor data (e.g., street images, road condition, traffic flow) is emerging as a new network paradigm of sensor information sharing in urban environments. The key enablers are the smartphones (e.g., iPhones and Android phones) equipped with onboard sensors (e.g.,...

    Provided By University of California

  • White Papers // Dec 2010

    Path-Based Inductive Synthesis for Program Inversion

    In this paper, the authors investigate the problem of semi-automated inversion of imperative programs, which has the potential to make it much easier and less error prone to write programs that naturally pair as inverses, such as insert/delete operations, compressors/ decompressors, and so on. Viewing inversion as a sub-problem of...

    Provided By University of California

  • White Papers // Dec 2010

    Trade Booms, Trade Busts And Trade Costs

    What has driven trade booms and trade busts in the past and present? The authors derive a micro-founded measure of trade frictions from leading trade theories and use it to gauge the importance of bilateral trade costs in determining international trade flows. The authors construct a new balanced sample of...

    Provided By University of California

  • White Papers // Dec 2010

    Accelerating Dynamic Time Warping Subsequence Search With GPUs and FPGAs

    Many time series data mining problems require subsequence similarity search as a subroutine. Dozens of similarity/distance measures have been proposed in the last decade and there is increasing evidence that Dynamic Time Warping (DTW) is the best measure across a wide range of domains. Given DTW's usefulness and ubiquity, there...

    Provided By University of California

  • White Papers // Nov 2010

    Toward Automated Detection of Logic Vulnerabilities in Web Applications

    Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, there has also been an increase in the number and complexity of vulnerabilities. Current techniques to identify security problems in web applications...

    Provided By University of California

  • White Papers // Nov 2010

    Should Users Be Entitled to Run the Applications of Their Choice on Wireless Networks?

    The authors examine whether wireless ISPs should be able to legally limit the applications used on wireless devices. The analysis is based on wireless network architecture and communications law. They review how wired and wireless networks differ in traffic management, and conclude that wireless networks require stronger traffic management than...

    Provided By University of California

  • White Papers // Nov 2010

    Distributed High Accuracy Peer-to-Peer Localization in Mobile Multipath Environments

    In this paper the authors consider the problem of high accuracy localization of mobile nodes in a multipath-rich environment where sub-meter accuracies are required. They employ a peer to peer framework where the vehicles/nodes can get pairwise multipath-degraded ranging estimates in local neighborhoods together with a fixed number of anchor...

    Provided By University of California

  • White Papers // Nov 2010

    Correlated Resource Models of Internet End Hosts

    Understanding and modelling resources of Internet end hosts is essential for the design of desktop software and Internet-distributed applications. In this paper the authors develop a correlated resource model of Internet end hosts based on real trace data taken from the SETI@home project. This data covers a 5-year period with...

    Provided By University of California

  • White Papers // Nov 2010

    Online Ciphers From Tweakable Blockciphers

    Informally, a cryptographic transform is said to be online if it can be computed by an algorithm that reads in the (unknown number of) input bits - in order, one at a time - as it writes out the corresponding output bits - again in order, one at a time...

    Provided By University of California

  • White Papers // Nov 2010

    Regular Prices And sales

    The authors study the properties of a profit-maximizing monopolist's optimal price distribution when selling to a loss-averse consumer; where (following K?szegi and Rabin (2006)) they assume that the consumer's reference point is her recent rational expectations about the purchase. If it is close to costless for the consumer to observe...

    Provided By University of California

  • White Papers // Nov 2010

    On the Capacity of Non-Coherent Network Coding

    The authors consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized network coding operations on the source packets. They propose a channel model for the non-coherent network coding introduced by Koetter and Kschischang, that captures the...

    Provided By University of California

  • White Papers // Nov 2010

    Semantic Data Placement for Power Management in Archival Storage

    Power is the greatest lifetime cost in an archival system, and, as decreasing costs make disks more attractive than tapes, spinning disks account for the majority of power drawn. To reduce this cost, the authors propose reducing the number of times disks have to spin up by grouping together files...

    Provided By University of California

  • White Papers // Nov 2010

    The Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited

    The authors consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is formalized by the notion of indifferentiability of Maurer et al. (TCC 2004). This is the natural extension to the public setting of...

    Provided By University of California

  • White Papers // Nov 2010

    Password-Protected Secret Sharing

    A user of computing technology, let's call her Alice, needs to store her valuable and private data, including texts, images, passwords, or cryptographic keys, on her personal device. Alice's device, however, can fall prey to viruses, spyware, Trojan horses, and other type of malware, exposing Alice's data and breaching her...

    Provided By University of California

  • White Papers // Feb 2010

    Rain: A Workload Generation Toolkit for Cloud Computing Applications

    Existing workload generation tools are not flexible enough to generate workloads that vary in three key dimensions relevant for making resource allocation decisions for Cloud Computing applications - variations in the amount of load, variations in the mix of operations performed by clients (e.g. changes in reads vs. writes or...

    Provided By University of California

  • Case Studies // Jan 2010

    Code-Red: A Case Study on the Spread and Victims of an Internet Worm

    On July 18, 2001, Code-Red (CRv2) worm took less than 14 hours to infect more than 359,000 internet connected computers, resulting in damage worth more than $2.6 billion. The case study tries to study the causes, impact and the safeguards against such attacks. Under this paper, a step by step...

    Provided By University of California

  • White Papers // Oct 2009

    Applying NOX to the Datacenter

    It is evident today that internet datacenters have brought about a revolution in computing power and have attained supremacy in handling data-intensive computational tasks. Being the challenging field that it is, a number of studies and new network designs are being explored and deployed by researchers to find out if...

    Provided By University of California

  • White Papers // Apr 2010

    Using "Recycled Predictions" for Computing Marginal Effects

    A conventional way to estimate the marginal effect of a risk factor is to omit the risk factor (e.g., gender, treatment) from the multivariate model and then use the omitted risk factor as class/group variable to compare observed and predicted outcomes. This can have an undesirable impact on the model...

    Provided By University of California

  • White Papers // Mar 2010

    Financial Analysis Using SAS PROCS

    Financial services industry is interested in analyzing vast financial data including price trends from stock exchanges around the world. SAS analytical and graphical tools are extremely useful to enable statistical analysis of various financial data including stock price information. Time Series statistical method is a valuable approach for analysis of...

    Provided By University of California

  • White Papers // Jan 2010

    Towards a More Functional and Secure Network Infrastructure

    This paper proposes an overlay network infrastructure that provides better protection against DoS attacks as well as more functionality than today's Internet. The solution is based on three simple principles:enabling end-hosts to communicate without revealing their IP address, giving end-hosts control to defend against Denial-of-Service (DoS) attacks at the overlay...

    Provided By University of California

  • White Papers // Jan 2010

    Query-Driven Visualization of Large Data Sets

    This paper presents a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is constrained to the subset of data deemed interesting by the user. In many scientific data analysis applications, interesting data can be defined by compound Boolean range...

    Provided By University of California

  • White Papers // Jan 2010

    Backup Path Allocation Based on a Correlated Link Failure Probability Model in Overlay Networks

    Communication reliability is a desired property in computer networks. One key technology to increase the reliability of a communication path is to provision a disjoint backup path. One of the main challenges in implementing this technique is that two paths that are disjoint at the IP or overlay layer may...

    Provided By University of California

  • White Papers // Jul 2009

    Challenges for Securing Cyber Physical Systems

    Cyber-Physical Systems (CPS) has been at the core of critical infrastructures and industrial control systems for many decades, and yet, there have been few confirmed cases of computer-based attacks. The authors discuss three key challenges for securing cyberphysical systems: understanding the threats, and possible consequences of attacks, identifying the unique...

    Provided By University of California

  • White Papers // Jul 2010

    Code Generation for Embedded Java With Ptolemy

    Code generation from models is the ultimate goal of model-based design. For real-time systems the generated code must be analyzable for the worst-case execution time (WCET). This paper evaluates Java code generation from Ptolemy II for embedded real-time Java. The target system is the time-predictable Java processor JOP. The quality...

    Provided By University of California

  • White Papers // Jan 2010

    Network Sensitivity to Intradomain Routing Changes

    The Internet's routing architecture was designed to have a clean separation between the intradomain and interdomain routing protocols. However, the appropriate division of labor between these two tiers becomes unclear when an Autonomous System (AS) has interdomain routes to a destination through multiple border routers a situation that is extremely...

    Provided By University of California

  • White Papers // Jun 2010

    A Novel SLA Framework for Time-Differentiated Resilience in Optical Mesh Networks

    Telecom customers may have specific time periods during which they require extra resilience. However, these time-differentiated resilience requirements are not effectively addressed by current SLA frameworks. To satisfy these high priority periods, a generic SLA framework typically provides upgraded protection over the entire service duration, which is unnecessary and expensive....

    Provided By University of California

  • White Papers // Sep 2009

    Scheduling Heterogeneous Wireless Systems for Efficient Spectrum Access

    The spectrum scarcity problem emerged in recent years, due to unbalanced utilization of RF (Radio Frequency) bands in the current state of wireless spectrum allocations. Different from cognitive radio approaches which are opportunistic and non-collaborative in general, spectrum access scheduling proactively structures and interleaves the channel access pattern of heterogeneous...

    Provided By University of California

  • White Papers // Jul 2010

    New Advances in Self-Policing Cloud Computing

    Cloud computing is a style of computing in which dynamically scalable and often virtualized resources e.g., CPU, memory, storage, and network bandwidth are provided as a service over the Internet. This model is considered affordable for cloud users as they avoid the significant financial overheads associated with deploying, maintaining, and...

    Provided By University of California

  • White Papers // Mar 2012

    Broadcast-Efficient Secure Multiparty Computation

    Secure MultiParty Computation (MPC) is perhaps the most popular paradigm in the area of cryptographic protocols. It allows several mutually untrustworthy parties to jointly compute a function of their private inputs, without revealing to each other information about those inputs. In the case of unconditional (information-theoretic) security, protocols are known...

    Provided By University of California

  • White Papers // Nov 2009

    A Multistate Multipath Provisioning Scheme for Differentiated Failures in Telecom Mesh Networks

    Telecommunication networks spanning large areas are subject to various failures, such as natural disasters, operation errors, and malicious attacks. Disaster Failures (DF) are defined as failures which can lead to a large-area malfunction of a network, and which can significantly degrade the performance of backbone telecom mesh networks. A survivable...

    Provided By University of California

  • White Papers // Nov 2009

    Survivable Multipath Traffic Grooming in Telecom Mesh Networks With Inverse Multiplexing

    The authors investigate the survivable traffic grooming problem with inverse multiplexing in next-generation SONET/SDH networks employing Wavelength-Division Multiplexing (WDM). With support of Virtual Concatenation (VCAT), a connection of any bandwidth can be provisioned as several sub-connections (i.e., inverse-multiplexed) over diverse paths. How to efficiently protect and groom these low-speed sub-connections...

    Provided By University of California

  • White Papers // Jan 2012

    Routing Mechanisms for Mobile Ad Hoc Networks Based on the Energy Drain Rate

    Untethered nodes in mobile ad-hoc networks strongly depend on the efficient use of their batteries. In this paper, the authors propose a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions. This metric is combined with the value of the remaining battery capacity...

    Provided By University of California

  • White Papers // Apr 2012

    Intrusion Detection in Resource-Constrained Cyber Networks: A Restless Multi-Armed Bandit Approach

    The authors consider a large-scale cyber network with N components. Each component is either in a healthy state (0) or an abnormal state (1). Due to intrusions, the state of each component transits from 0 to 1 over time according to an arbitrary stochastic process. The objective is to design...

    Provided By University of California

  • White Papers // Nov 2011

    Learning in a Changing World: Restless Multi-Armed Bandit With Unknown Dynamics

    The authors consider the Restless Multi-Armed Bandit (RMAB) problem with unknown dynamics in which a player chooses one out of N arms to play at each time. The reward state of each arm transits according to an unknown Markovian rule when it is played and evolves according to an arbitrary...

    Provided By University of California

  • White Papers // Mar 2012

    Context-Aware Sensor Data Dissemination for Mobile Users in Remote Areas

    Many mobile sensing applications consider users reporting and accessing sensing data through the Internet. However, WiFi and 3G connectivities are not always available in remote areas. Existing data dissemination schemes for opportunistic networks are not sufficient for sensing applications as sensing context has not been explored. In this paper, the...

    Provided By University of California

  • White Papers // Apr 2011

    OppSense: Information Sharing for Mobile Phones in Sensing Field With Data Repositories

    With the popularity and advancements of smart phones, mobile users can interact with the sensing facilities and exchange information with other wireless devices in the environment by short range communications. Opportunistic exchange has recently been suggested in similar contexts; yet the authors show strong evidence that, in their application, opportunistic...

    Provided By University of California

  • White Papers // Jan 2012

    The Selective Intermediate Nodes Scheme for Ad Hoc On-Demand Routing Protocols

    The on-demand routing schemes in mobile ad hoc networks are appealing because of the lower routing overhead, compared with traditional proactive schemes. The on-demand routing protocols introduce routing overhead only in the presence of data packets that need routes. However, the control overhead of on-demand routing schemes increases with node...

    Provided By University of California

  • White Papers // Dec 2010

    Good Neighbor: Secure Pairing of Nearby Wireless Devices by Multiple Antennas

    The proliferation of personal wireless devices requires secure connection between them. While it is easy to securely pair electronic devices by wires, it is very challenging to pair them wirelessly when they have no prior association. The authors propose Good Neighbor, a novel scheme that securely pairs nearby wireless devices...

    Provided By University of California

  • White Papers // May 2011

    Heterogeneity-Aware Resource Allocation and Scheduling in the Cloud

    Data analytics are key applications running in the cloud computing environment. To improve performance and cost-effectiveness of a data analytics cluster in the cloud, the data analytics system should account for heterogeneity of the environment and workloads. In addition, it also needs to provide fairness among jobs when multiple jobs...

    Provided By University of California

  • White Papers // Jan 2010

    Energy Efficient Throughput Optimization in Multi-Hop Wireless Networks

    Throughput, fairness, and energy consumption are often conflictly objectives in multi-hop wireless networks. In this paper, the authors propose the notion of lexicographical maxmin energy efficiency throughput fairness that achieves throughput fairness per unit energy. Compared with maxmin throughput fairness and maxmin time fairness, the proposed scheme allocates more bandwidth...

    Provided By University of California

  • White Papers // May 2011

    The Effects Of Monetary Policy "News" And "Surprises"

    There is substantial agreement in the monetary policy literature over the effects of exogenous monetary policy shocks. The shocks that are investigated, however, almost exclusively represent unanticipated changes in policy, which surprise the private sector and which are typically found to have a delayed and sluggish effect on output. In...

    Provided By University of California

  • White Papers // Apr 2011

    Financial Crises, Credit Booms, And External Imbalances: 140 Years Of Lessons

    Do external imbalances increase the risk of financial crises? In this paper, the authors study the experience of 14 developed countries over 140 years (1870{2008). They exploit their long-run dataset in a number of different ways. First, they apply new statistical tools to describe the temporal and spatial patterns of...

    Provided By University of California

  • White Papers // Sep 2009

    Verifying Ptolemy II Discrete-Event Models Using Real-Time Maude

    This paper shows how Ptolemy II Discrete-Event (DE) models can be formally analyzed using Real-Time Maude. The authors formalize in Real-Time Maude the semantics of a subset of hierarchical Ptolemy II DE models, and explain how the code generation infrastructure of Ptolemy II has been used to automatically synthesize a...

    Provided By University of California

  • White Papers // May 2010

    The Emperor's New APIs: On the (In)Secure Usage of New Client-Side Primitives

    Several new browser primitives have been proposed to meet the demands of application interactivity while enabling security. To investigate whether applications consistently use these primitives safely in practice, the authors study the real-world usage of two client-side primitives, namely postMessage and HTML5's client-side database storage. They examine new purely client-side...

    Provided By University of California

  • White Papers // May 2010

    Secure Cooperative Sharing of JavaScript, Browser, and Physical Resources

    For better application-level controls on mashups, they advocate extending the Single Origin Policy and associated primitives to support a cooperative model that allows applications to express explicit sharing policies over browser, Javascript, and physical resources. First, the authors introduce an isolation model for content loading that is more complete than...

    Provided By University of California

  • White Papers // May 2011

    Analyzing the Crossdomain Policies of Flash Applications

    Adobe Flash is a rich Internet application platform. Flash applications are often deployed to the Web; The Flash Player plugin is installed on a large fraction of all Web connected PCs. Flash provides a mechanism by which sites can opt in to more expressive information sharing regimes than the same-origin...

    Provided By University of California

  • White Papers // May 2011

    Fingerprinting Information in JavaScript Implementations

    To date, many attempts have been made to fingerprint users on the web. These fingerprints allow browsing sessions to be linked together and possibly even tied to a user's identity. They can be used constructively by sites to supplement traditional means of user authentication such as passwords; and they can...

    Provided By University of California

  • White Papers // Mar 2009

    Online Learning in Autonomic Multi-Hop Wireless Networks for Transmitting Mission-Critical Applications

    In this paper, the authors study how to optimize the transmission decisions of nodes aimed at supporting mission-critical applications, such as surveillance, security monitoring, and military operations, etc. They focus on a network scenario where multiple source nodes transmit simultaneously mission-critical data through relay nodes to one or multiple destinations...

    Provided By University of California

  • White Papers // Jan 2012

    Diffusion Filters as a Flexible Architecture for Event Notification in Wireless Sensor Networks

    Wireless sensor networks represent an increasingly important example of distributed event systems. Unlike Internet-based distributed event systems, sensor networks are very bandwidth constrained and use sensor nodes that are often dedicated to the network and controlled by a single organization. Bandwidth constraints require, and administrative homogeneity allows, sensor networks to...

    Provided By University of California

  • White Papers // Sep 2011

    Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity

    In the wiretap channel setting, one aims to get information-theoretic privacy of communicated data based only on the assumption that the channel from sender to adversary is noisier than the one from sender to receiver. The secrecy capacity is the optimal (highest possible) rate of a secure scheme, and the...

    Provided By University of California

  • White Papers // Apr 2010

    A Cryptographic Treatment of the Wiretap Channel

    The wiretap channel is a setting where one aims to provide information-theoretic privacy of communicated data based solely on the assumption that the channel from sender to adversary is "Noisier" than the channel from sender to receiver. It has been the subject of decades of work in the Information and...

    Provided By University of California

  • White Papers // Apr 2012

    On the Performance of Certain Private Set Intersection Protocols

    Private Set Intersection (PSI) is a useful cryptographic primitive that allows two parties (client and server) to interact based on their respective (private) input sets, in such a way that client obtains nothing other than the set intersection, while server learns nothing beyond client set size. This paper considers one...

    Provided By University of California

  • White Papers // Mar 2012

    Efficient and Optimally Secure Key-Length Extension for Block Ciphers Via Randomized Cascading

    The authors consider the question of efficiently extending the key length of block ciphers. To date, the approach providing highest security is triple encryption (used e.g., in Triple-DES), which was proved to have roughly k + minfn=2; k=2g bits of security when instantiated with ideal block ciphers with key length...

    Provided By University of California

  • White Papers // Jan 2011

    Rubik's for Cryptographers

    Hard mathematical problems are at the core of security arguments in cryptography. In this paper, the authors study mathematical generalizations of the famous Rubik's cube puzzle, namely the factorization, representation and balance problems in non-Abelian groups. These problems arise naturally when describing the security of Cayley hash functions, a class...

    Provided By University of California