University of Idaho

Displaying 1-40 of 93 results

  • White Papers // Apr 2014

    Network-on-Chip Firewall: Countering Defective and Malicious System-on-Chip Hardware

    Mobile devices are in roles where the integrity and confidentiality of their apps and data are of paramount importance. They usually contain a System-on-Chip (SoC), which integrates microprocessors and peripheral Intellectual Property (IP) connected by a Network-on-Chip (NoC). Malicious IP or software could compromise critical data. Some types of attacks...

    Provided By University of Idaho

  • White Papers // Mar 2014

    Dynamic Searchable Encryption via Blind Storage

    Dynamic searchable symmetric encryption allows a client to store a dynamic collection of encrypted documents with a server, and later quickly carry out keyword searches on these encrypted documents, while revealing minimal information to the server. In this paper, the authors present a new dynamic SSE scheme that is simpler...

    Provided By University of Idaho

  • White Papers // Jan 2014

    DMA-Aware Memory Energy Management

    As increasingly larger memories are used to bridge the widening gap between processor and disk speeds, main memory energy consumption is becoming increasingly dominant. Even though much prior research has been conducted on memory energy management, no study has focused on data servers, where main memory is predominantly accessed by...

    Provided By University of Idaho

  • White Papers // Aug 2013

    Reconciling Security Protection and Monitoring Requirements in Advanced Metering Infrastructures

    Making Advanced Metering Infrastructures (AMIs) resilient to availability and privacy compromises is an important aspect of grid reliability and consumer trust. Lessons learned from traditional cyber systems indicate that achieving resiliency requires the joint deployment of strong protective measures on the one hand, and monitoring and response mechanisms on the...

    Provided By University of Idaho

  • White Papers // Jun 2013

    SVNE: Survivable Virtual Network Embedding Algorithms for Network Virtualization

    Network virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous Virtual Networks (VN) to coexist on a shared Infrastructure Provider (InP) network. A major challenge in this respect is the VN embedding problem that deals with the efficient mapping of virtual resources on...

    Provided By University of Idaho

  • White Papers // Apr 2013

    Diagnosing Data Center Behavior Flow by Flow

    Multi-tenant data centers are complex environments, running thousands of applications that compete for the same infrastructure resources and whose behavior is guided by (sometimes) divergent configurations. Small workload changes or simple operator tasks may yield unpredictable results and lead to expensive failures and performance degradation. In this paper, the authors...

    Provided By University of Idaho

  • White Papers // Apr 2013

    Content-Based Scheduling of Virtual Machines (VMs) in the Cloud

    Organizations of all sizes are shifting their IT infrastructures to the cloud because of its cost efficiency and convenience. Because of the on-demand nature of the Infrastructure as a Service (IaaS) clouds, hundreds of thousands of Virtual Machines (VMs) may be deployed and terminated in a single large cloud data...

    Provided By University of Idaho

  • White Papers // Feb 2013

    On the Interference Channel With Causal Cognition

    This paper considers the causal cognitive interference channel that consists of two full-duplex transmitter-receiver pairs sharing the same channel, where one transmitter can causally learn the message of the other transmitter through a noisy link. This channel models unilateral source cooperation. The work focuses on the generalized degrees-of-freedom of the...

    Provided By University of Idaho

  • White Papers // Feb 2013

    Gaussian Half-Duplex Relay Channels: Generalized Degrees of Freedom and Constant Gap Result

    This paper considers the Gaussian relay channel where the relay node operates in half-duplex mode. The exact capacity of the linear deterministic approximation of the Gaussian channel at high SNR is derived first. This result is then used to inspire an achievable scheme valid for any SNR in the original...

    Provided By University of Idaho

  • White Papers // Feb 2013

    Peak-to-Average Power Ratio of Good Codes for Gaussian Channel

    Consider a problem of forward error-correction for the Additive White Gaussian Noise (AWGN) channel. For finite block-length codes the back-off from the channel capacity is inversely proportional to the square root of the block-length. In this paper it is shown that codes achieving this tradeoff must necessarily have Peak-to-Average Power...

    Provided By University of Idaho

  • White Papers // Jan 2013

    HPC-Aware VM Placement in Infrastructure Clouds

    Cloud offerings are increasingly serving workloads with a large variability in terms of compute, storage and networking resources. Computing requirements (all the way to High Performance Computing or HPC), criticality, communication intensity, memory requirements, and scale can vary widely. Virtual Machine (VM) placement and consolidation for effective utilization of a...

    Provided By University of Idaho

  • White Papers // Jan 2013

    SCDA: SLA-Aware Cloud Datacenter Architecture for Efficient Content Storage and Retrieval

    With the fast growth of (online) content and the need for high quality content services, cloud data centers are increasingly becoming the preferred places to store data and retrieve it from. With a highly variable network traffic and limited resources, efficient server selection and data transfer rate allocation mechanisms become...

    Provided By University of Idaho

  • White Papers // Jan 2013

    Strategic Innovation through Business Intelligence

    The authors show how Porter's five forces that shape competitive strategies can be linked directly to long term profitability of industries, as measured by the return on invested capital. As the five forces framework has become a staple approach to strategic analysis, playing a key role in both business practices...

    Provided By University of Idaho

  • White Papers // Dec 2012

    Real-Time Peer-to-Peer Streaming Over Multiple Random Hamiltonian Cycles

    The authors are motivated by the problem of designing a simple distributed algorithm for peer-to-peer streaming applications that can achieve high throughput and low delay, while allowing the neighbor set maintained by each peer to be small. While previous works have mostly used tree structures, their algorithm constructs multiple random...

    Provided By University of Idaho

  • White Papers // Dec 2012

    Testing the AgreementMaker System in the Anatomy Task of OAEI 2012

    The AgreementMaker system was the leading system in the anatomy task of the Ontology Alignment Evaluation Initiative (OAEI) competition in 2011. While AgreementMaker did not compete in OAEI 2012, here the authors report on its performance in the 2012 anatomy task, using the same con-figurations of AgreementMaker submitted to OAEI...

    Provided By University of Idaho

  • White Papers // Nov 2012

    A Parallel Network Simulation and Virtual-Time-Based Network Emulation Testbed

    To analyze large-scale systems with high fidelity, it is necessary for a network testbed to offer both realistic emulation (to represent software execution) and effective simulation (to model background computation and communication). The authors present a network testbed that integrates a light-weighted emulation system OpenVZ (modified earlier to operate in...

    Provided By University of Idaho

  • White Papers // Oct 2012

    Why Naive Ensembles Do Not Work in Cloud Computing

    Cloud computing systems that use are designed to scale to large numbers of loosely coupled commodity computers (or nodes) are growing more common. In this paper, the authors consider several different ways that tree-based classifiers can be used on cloud computing systems. The simplest way is simply to compute one...

    Provided By University of Idaho

  • White Papers // Oct 2012

    Location Dependent Optimal Relay Selection in Mobile Cooperative Environment

    The proposed optimization algorithm employs distributed turbo product coding technique with hard and soft decoding. It is shown that the link quality depends on the location of the relay which in turn affects overall system Bit Error Rate (BER) performance. The simulation model creates several scenarios for location of intermediate...

    Provided By University of Idaho

  • White Papers // Aug 2012

    A Probabilistic Model for Estimating Realvalued Truth from Conflicting Sources

    One important task in data integration is to identify truth from noisy and conflicting data records collected from multiple sources, i.e., the truth finding problem. Previously, several methods have been proposed to solve this problem by simultaneously learning the quality of sources and the truth. However, all those methods are...

    Provided By University of Idaho

  • White Papers // Aug 2012

    A Survey on Enterprise Databases in Cloud Computing

    Cloud computing has been one of the hot topics among researchers due to its capabilities like dynamic scaling, peta-scale distributed computing, novel ways of fault tolerance, shared resources among multiple customers, etc. Due to these advantages, cloud computing opens up new opportunities in database system design to utilize the underlying...

    Provided By University of Idaho

  • White Papers // Jun 2012

    Assisted Common Information with an Application to Secure Two-Party Sampling

    Secure multi-party computation is a central problem in modern cryptography. An important sub-class of this problem of the following form: Alice and Bob desire to produce sample(s) of a pair of jointly distributed random variables. Each party must learn nothing more about the other party's output than what its own...

    Provided By University of Idaho

  • White Papers // May 2012

    Degrees of Freedom (DoF) of Locally Connected Interference Channels With Coordinated Multi-Point (CoMP) Transmission

    As a result of developments in the infrastructure of cellular networks, there has been a recent growing interest in the potential of cooperative transmission techniques where, through a backhaul link, messages can be available at more than one transmitter, i.e., Coordinated Multi-Point (CoMP) transmission. This new development has a proven...

    Provided By University of Idaho

  • White Papers // May 2012

    Learning Minimal Latent Directed Information Trees

    The authors propose a framework for learning the structure of a minimal latent tree with an associated discrepancy measure. Specifically, they apply this algorithm to recover the minimal latent directed information tree on a mixture of set of observed and unobserved random processes. Directed information trees are a new type...

    Provided By University of Idaho

  • White Papers // Apr 2012

    Jellyfish: Networking Data Centers Randomly

    Industry experience indicates that the ability to incrementally expand data centers is essential. However, existing high-bandwidth network designs have rigid structure that interferes with incremental expansion. The authors present Jellyfish, a high-capacity network interconnect which, by adopting a random graph topology, yields itself naturally to incremental expansion. Somewhat surprisingly, Jellyfish...

    Provided By University of Idaho

  • White Papers // Mar 2012

    Effective Failure Prediction in Hadoop Clusters

    As cloud computing clusters continue to grow, maintaining the health of these clusters becomes increasingly challenging. It has been studied how the authors can efficiently monitor the status of machines in these clusters and how they can detect problems or predict them before they occur. While some existing research has...

    Provided By University of Idaho

  • White Papers // Mar 2012

    SWM: Simplified Wu-Manber for GPU-Based Deep Packet Inspection

    Graphics Processing Units (GPU) has potential to speed up Deep Packet Inspection (DPI) by processing many packets in parallel. However, popular methods of DPI such as deterministic finite automata are limited because they are single stride. Alternatively, the complexity of multiple stride methods is not appropriate for the SIMD operation...

    Provided By University of Idaho

  • White Papers // Mar 2012

    Towards a Cloud Friendly Adaptive Parallel Runtime for HPC Applications

    Cloud computing is increasingly being explored as a cost effective alternative and addition to supercomputers for some High Performance Computing (HPC) applications. However, poor interconnect performance; commodity operating systems, dynamic environment and interference by other virtual machines are some of the factors which prevent efficient execution of HPC applications in...

    Provided By University of Idaho

  • White Papers // Feb 2012

    Competition in Femtocell Networks: Strategic Access Policies in the Uplink

    In emerging small cell wireless, each Femtocell Access Point (FAP) can either service its home subscribers exclusively (i.e., closed access) or open its access to accommodate a number of macrocell users so as to reduce cross-tier interference. In this paper, the authors propose a game-theoretic framework that enables the FAPs...

    Provided By University of Idaho

  • White Papers // Feb 2012

    Peer-to-Peer Streaming Over Dynamic Random Hamilton Cycles

    The authors are motivated by the problem of designing a simple distributed algorithm for peer-to-peer streaming applications that can achieve high throughput and low delay, while allowing the neighbor set maintained by each peer to be small. While previous works have mostly used tree structures, their algorithm constructs multiple random...

    Provided By University of Idaho

  • White Papers // Jan 2012

    Slick Packets

    Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifies its path, this precludes fast local re-routing within the network. The authors propose SlickPackets, a novel solution that allows packets to slip around...

    Provided By University of Idaho

  • White Papers // Jan 2012

    Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding

    The authors examine the issue of separation and code design for network data transmission environments. They demonstrate that source-channel separation holds for several canonical network channel models when the whole network operates over a common finite field. Their approach uses linear codes. This simple, unifying framework allows them to re-establish...

    Provided By University of Idaho

  • White Papers // Dec 2011

    Optimal Noise-Adding Mechanism in Differential Privacy

    The authors derive a class of optimal noise probability distributions for noise-adding mechanisms for single real-valued query function to preserve differential privacy under a utility-maximization/cost-minimization framework. The class of optimal noise probability distributions has staircase-shaped probability density functions which are symmetric, monotonically decreasing and periodically decaying. In particular, they derive...

    Provided By University of Idaho

  • White Papers // Sep 2011

    Specification-Based Intrusion Detection for Advanced Metering Infrastructures

    It is critical to develop an effective way to monitor Advanced Metering Infrastructures (AMI). To ensure the security and reliability of a modernized power grid, the current deployment of millions of smart meters requires the development of innovative situational awareness solutions to prevent compromised devices from impacting the stability of...

    Provided By University of Idaho

  • White Papers // Sep 2011

    A Virtual Time System for Virtualization-Based Network Emulations and Simulations

    Simulation and emulation are commonly used to study the behavior of communication networks, owing to the cost and complexity of exploring new ideas on actual networks. Emulations executing real code have high functional fidelity, but may not have high temporal fidelity because virtual machines usually use their host's clock. To...

    Provided By University of Idaho

  • White Papers // Sep 2011

    Scheduling Periodic Real-Time Tasks With Heterogeneous Reward Requirements

    The authors study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. They consider situations where tasks generate jobs that can be provided arbitrary service times before their deadlines, and obtain rewards based on the service times received by the jobs of the task. They show...

    Provided By University of Idaho

  • White Papers // Sep 2011

    Improving Feasibility of Fixed Priority Tasks Using Non-Preemptive Regions

    Preemptive schedulers have been widely adopted in single processor real-time systems to avoid the blocking associated with the non-preemptive execution of lower priority tasks and achieve a high processor utilization. However, under fixed priority assignments, there are cases in which limiting preemptions can improve schedulability with respect to a fully...

    Provided By University of Idaho

  • White Papers // Sep 2011

    Weighted Locality-Sensitive Scheduling for Mitigating Noise on Multi-Core Clusters

    Recent studies have shown that Operating System (OS) interference, popularly called OS noise can be a significant problem as the authors scale to a large number of processors. One solution for mitigating noise is to turn off certain OS services on the machine. However, this is typically infeasible because full-scale...

    Provided By University of Idaho

  • White Papers // Sep 2011

    Fast Clustering Using MapReduce

    Clustering data is a fundamental problem in a variety of areas of computer science and related fields. Machine learning, data mining, pattern recognition, networking, and bioinformatics use clustering for data analysis. Clustering problems have numerous applications and are becoming more challenging as the size of the data increases. In this...

    Provided By University of Idaho

  • White Papers // Sep 2011

    X-Vine: Secure and Pseudonymous Routing Using Social Networks

    Distributed hash tables suffer from several security and privacy vulnerabilities, including the problem of Sybil attacks. Existing social network-based solutions to mitigate the Sybil attacks in DHT routing have a high state requirement and do not provide an adequate level of privacy. For instance, such techniques require a user to...

    Provided By University of Idaho

  • White Papers // Aug 2011

    Optimality of Periodwise Static Priority Policies in Real-Time Communications

    The authors consider the problem of real-time communication with delay constraints. In earlier work it has been shown that a certain weighted-debt policy is feasibility-optimal in the sense that if any scheduling policy can satisfy the throughput-with-deadline requirements of all the clients, then the weighted-debt policy can do so. This...

    Provided By University of Idaho

  • White Papers // Sep 2011

    Scheduling Periodic Real-Time Tasks With Heterogeneous Reward Requirements

    The authors study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. They consider situations where tasks generate jobs that can be provided arbitrary service times before their deadlines, and obtain rewards based on the service times received by the jobs of the task. They show...

    Provided By University of Idaho

  • White Papers // Mar 2011

    A Survey of Recent Results on Real-Time Wireless Networking

    Over the past two years there has emerged a new approach to solve the problem of delivering required throughputs of packets that meet hard deadlines over heterogeneous unreliable channels. These recent results provide a contract for flows with throughput as well as delay constraints. These contracts have two desirable properties:...

    Provided By University of Idaho

  • White Papers // Jul 2008

    ERP: An Efficient and Reliable Protocol for Emergency Message Dissemination in Vehicular Ad Hoc Networks

    Many safety-related applications in vehicular ad hoc networks require fast and reliable emergency message dissemination through multi-hop broadcast. However, the conventional broadcast mechanism is neither efficient nor reliable because it results in serious contention and collisions, which is usually referred to as the broadcast storm problem. In this paper, the...

    Provided By University of Idaho

  • White Papers // Jan 2013

    SCDA: SLA-Aware Cloud Datacenter Architecture for Efficient Content Storage and Retrieval

    With the fast growth of (online) content and the need for high quality content services, cloud data centers are increasingly becoming the preferred places to store data and retrieve it from. With a highly variable network traffic and limited resources, efficient server selection and data transfer rate allocation mechanisms become...

    Provided By University of Idaho

  • White Papers // May 2012

    Learning Minimal Latent Directed Information Trees

    The authors propose a framework for learning the structure of a minimal latent tree with an associated discrepancy measure. Specifically, they apply this algorithm to recover the minimal latent directed information tree on a mixture of set of observed and unobserved random processes. Directed information trees are a new type...

    Provided By University of Idaho

  • White Papers // Apr 2009

    Joint Source - Channel Coding for Transmitting Correlated Sources over Broadcast Networks

    The authors consider a set of S independent encoders that must transmit a set of correlated sources through a network of noisy, independent, broadcast channels to T receivers, with no interference at the receivers. For the general problem of sending correlated sources through broadcast networks, it is known that the...

    Provided By University of Idaho

  • White Papers // May 2011

    Finite Block-Length Achievable Rates for Queuing Timing Channels

    While most communication systems convey information by controlling the amplitudes of signals at each time instant, information can also be sent by controlling the timing at which events occur. The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity...

    Provided By University of Idaho

  • White Papers // May 2011

    Equivalence between Minimal Generative Model Graphs and Directed Information Graphs

    The authors propose a new type of probabilistic graphical model, based on directed information, to represent the causal dynamics between processes in a stochastic system. They show the practical significance of such graphs by proving their equivalence to generative model graphs which succinctly summarize interdependencies for causal dynamical systems under...

    Provided By University of Idaho

  • White Papers // Jun 2011

    Equivalence between Reliable Feedback Communication and Nonlinear Filter Stability

    This paper further demonstrates interplay between information theory and control theory, at the level of achievability of message-point communication schemes. The authors establish a relationship between reliable feedback communication and the stability of the nonlinear filter. With this, they show that a newly developed feedback communication encoder - the posterior...

    Provided By University of Idaho

  • White Papers // Sep 2010

    A Stochastic Control Approach to Coding with Feedback over Degraded Broadcast Channels

    In this paper the authors attempt to further demonstrate connections between information theory and control, in a networked setting. Specifically, they consider the communication problem of broadcasting to multiple receivers, when one receiver has a degraded observation of the other's, and causal feedback about channel outputs is provided by both...

    Provided By University of Idaho

  • White Papers // Jul 2010

    Approximating Discrete Probability Distributions with Causal Dependence Trees

    Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations was measured in terms of KL distance. They demonstrated that the minimum divergence approximation was the tree with maximum sum of mutual informations, and specified a low-complexity minimum-weight spanning...

    Provided By University of Idaho

  • White Papers // Jul 2010

    Directed Information and the NRL Network Pump

    The NRL Network Pump R, or Pump, is a standard for mitigating covert channels that arise in a Multi-Level Secure (MLS) system when a High User (HU) sends acknowledgements to a Low User (LU). The issue here is that HU can encode information in the "Timings" of the acknowledgements. The...

    Provided By University of Idaho

  • White Papers // May 2010

    On Reversible Markov Chains and Maximization of Directed Information

    In this paper, the authors consider a dynamical system, whose state is an input to a memory-less channel. The state of the dynamical system is affected by its past, an exogenous input, and causal feedback from the channel's output. They consider maximizing the directed information between the input signal and...

    Provided By University of Idaho

  • White Papers // Apr 2010

    Mutual Information Saddle Points in Channels of Exponential Family Type

    This paper extends the authors' prior work on "E-type" (Exponential family type) channels. The channels considered here have transition kernels induced by an exponential family with a two-component sufficient statistic composed of an input-output distortion function and an output cost function. They demonstrate the existence of a mutual information saddle...

    Provided By University of Idaho

  • White Papers // May 2010

    Source Coding with Feedforward Using the Posterior Matching Scheme

    This paper considers the problem of source coding with feed-forward, where an encoder compresses an i.i.d. source into a message, and the decoder takes this message, along with causal noiseless side information, to construct an estimate of the source. The posterior matching scheme is an optimal feedback communication scheme for...

    Provided By University of Idaho

  • White Papers // Aug 2009

    A Stochastic Control Viewpoint on 'Posterior Matching'-Style Feedback Communication Schemes

    This paper re-visits Shayevitz & Feder's recent 'Posterior Matching Scheme', a deterministic, recursive, capacity achieving feedback encoding scheme for memory-less channels. The authors here consider the feedback encoder design problem from a stochastic control perspective. The state of the system is the posterior distribution of the message given current outputs...

    Provided By University of Idaho

  • White Papers // Apr 2009

    A Simple Memoryless Proof of the Capacity of the Exponential Server Timing Channel

    This paper provides a conceptually simple, memoryless-style proof to the capacity of the Anantharam and Verdu's Exponential Server Timing Channel (ESTC). The approach is inspired by Rubin's approach for characterizing the rate-distortion of a Poisson process with structured distortion measures. This approach obviates the need for using the information density...

    Provided By University of Idaho

  • White Papers // Mar 2012

    Effective Failure Prediction in Hadoop Clusters

    As cloud computing clusters continue to grow, maintaining the health of these clusters becomes increasingly challenging. It has been studied how the authors can efficiently monitor the status of machines in these clusters and how they can detect problems or predict them before they occur. While some existing research has...

    Provided By University of Idaho

  • White Papers // Jan 2013

    HPC-Aware VM Placement in Infrastructure Clouds

    Cloud offerings are increasingly serving workloads with a large variability in terms of compute, storage and networking resources. Computing requirements (all the way to High Performance Computing or HPC), criticality, communication intensity, memory requirements, and scale can vary widely. Virtual Machine (VM) placement and consolidation for effective utilization of a...

    Provided By University of Idaho

  • White Papers // Apr 2013

    Content-Based Scheduling of Virtual Machines (VMs) in the Cloud

    Organizations of all sizes are shifting their IT infrastructures to the cloud because of its cost efficiency and convenience. Because of the on-demand nature of the Infrastructure as a Service (IaaS) clouds, hundreds of thousands of Virtual Machines (VMs) may be deployed and terminated in a single large cloud data...

    Provided By University of Idaho

  • White Papers // Feb 2012

    Competition in Femtocell Networks: Strategic Access Policies in the Uplink

    In emerging small cell wireless, each Femtocell Access Point (FAP) can either service its home subscribers exclusively (i.e., closed access) or open its access to accommodate a number of macrocell users so as to reduce cross-tier interference. In this paper, the authors propose a game-theoretic framework that enables the FAPs...

    Provided By University of Idaho

  • White Papers // Sep 2011

    Specification-Based Intrusion Detection for Advanced Metering Infrastructures

    It is critical to develop an effective way to monitor Advanced Metering Infrastructures (AMI). To ensure the security and reliability of a modernized power grid, the current deployment of millions of smart meters requires the development of innovative situational awareness solutions to prevent compromised devices from impacting the stability of...

    Provided By University of Idaho

  • White Papers // Jan 2011

    Testing Container Classes: Random or Systematic?

    Container classes such as lists, sets, or maps are elementary data structures common to many programming languages. Since they are a part of standard libraries, they are important to test, which led to research on advanced testing techniques targeting such containers and research on comparing testing techniques using such containers....

    Provided By University of Idaho

  • White Papers // May 2012

    Degrees of Freedom (DoF) of Locally Connected Interference Channels With Coordinated Multi-Point (CoMP) Transmission

    As a result of developments in the infrastructure of cellular networks, there has been a recent growing interest in the potential of cooperative transmission techniques where, through a backhaul link, messages can be available at more than one transmitter, i.e., Coordinated Multi-Point (CoMP) transmission. This new development has a proven...

    Provided By University of Idaho

  • White Papers // Jan 2012

    Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding

    The authors examine the issue of separation and code design for network data transmission environments. They demonstrate that source-channel separation holds for several canonical network channel models when the whole network operates over a common finite field. Their approach uses linear codes. This simple, unifying framework allows them to re-establish...

    Provided By University of Idaho

  • White Papers // Sep 2011

    X-Vine: Secure and Pseudonymous Routing Using Social Networks

    Distributed hash tables suffer from several security and privacy vulnerabilities, including the problem of Sybil attacks. Existing social network-based solutions to mitigate the Sybil attacks in DHT routing have a high state requirement and do not provide an adequate level of privacy. For instance, such techniques require a user to...

    Provided By University of Idaho

  • White Papers // Dec 2012

    Testing the AgreementMaker System in the Anatomy Task of OAEI 2012

    The AgreementMaker system was the leading system in the anatomy task of the Ontology Alignment Evaluation Initiative (OAEI) competition in 2011. While AgreementMaker did not compete in OAEI 2012, here the authors report on its performance in the 2012 anatomy task, using the same con-figurations of AgreementMaker submitted to OAEI...

    Provided By University of Idaho

  • White Papers // Dec 2011

    Optimal Noise-Adding Mechanism in Differential Privacy

    The authors derive a class of optimal noise probability distributions for noise-adding mechanisms for single real-valued query function to preserve differential privacy under a utility-maximization/cost-minimization framework. The class of optimal noise probability distributions has staircase-shaped probability density functions which are symmetric, monotonically decreasing and periodically decaying. In particular, they derive...

    Provided By University of Idaho

  • White Papers // Jun 2012

    Assisted Common Information with an Application to Secure Two-Party Sampling

    Secure multi-party computation is a central problem in modern cryptography. An important sub-class of this problem of the following form: Alice and Bob desire to produce sample(s) of a pair of jointly distributed random variables. Each party must learn nothing more about the other party's output than what its own...

    Provided By University of Idaho

  • White Papers // Sep 2011

    A Virtual Time System for Virtualization-Based Network Emulations and Simulations

    Simulation and emulation are commonly used to study the behavior of communication networks, owing to the cost and complexity of exploring new ideas on actual networks. Emulations executing real code have high functional fidelity, but may not have high temporal fidelity because virtual machines usually use their host's clock. To...

    Provided By University of Idaho

  • White Papers // May 2009

    Autonomous Self-Migrating Virtual Machines

    A computer system typically consists of multiple layers of abstraction, starting with hardware at the lowest layer, and operating systems and high-level applications at higher layers. A virtual machine monitor (VMM) is a layer in a computer system that manages the resources in the layer below while presenting an abstraction...

    Provided By University of Idaho

  • White Papers // Apr 2013

    Diagnosing Data Center Behavior Flow by Flow

    Multi-tenant data centers are complex environments, running thousands of applications that compete for the same infrastructure resources and whose behavior is guided by (sometimes) divergent configurations. Small workload changes or simple operator tasks may yield unpredictable results and lead to expensive failures and performance degradation. In this paper, the authors...

    Provided By University of Idaho

  • White Papers // Jul 2006

    What Drives Strategic Behavior? a Framework to Explain and Predict SMEs' Transition to Sustainable Production Systems

    The strategic choices of small and medium enterprises in the agribusiness sector are fraught with large cost and revenue uncertainties. The transition to a new production system implies that SMEs must re-allocate resources and develop new strategies to achieve market goals. The authors highlight the agricultural, marketing and management literature...

    Provided By University of Idaho

  • White Papers // Oct 2012

    Why Naive Ensembles Do Not Work in Cloud Computing

    Cloud computing systems that use are designed to scale to large numbers of loosely coupled commodity computers (or nodes) are growing more common. In this paper, the authors consider several different ways that tree-based classifiers can be used on cloud computing systems. The simplest way is simply to compute one...

    Provided By University of Idaho

  • White Papers // Jan 2013

    Strategic Innovation through Business Intelligence

    The authors show how Porter's five forces that shape competitive strategies can be linked directly to long term profitability of industries, as measured by the return on invested capital. As the five forces framework has become a staple approach to strategic analysis, playing a key role in both business practices...

    Provided By University of Idaho

  • White Papers // Oct 2008

    Please Permit Me: Stateless Delegated Authorization in Mashups

    Mashups have emerged as a web 2.0 phenomenon, connecting disjoint applications together to provide unified services. However, scalable access control for mashups is difficult. To enable a mashup to gather data from legacy applications and services, users must give the mashup their login names and passwords for those services. This...

    Provided By University of Idaho

  • White Papers // Oct 2008

    Analyzing NASPInet Data Flows

    One of the missions of the North American SynchroPhasor Initiative (NASPI) is to create a robust, widely available and secure synchronized data measurement infrastructure, dubbed NASPInet that will improve reliability of the power grid. Phasor Measurement Unit (PMU), a GPS clock synchronized measurement device capable of measuring the current and...

    Provided By University of Idaho

  • White Papers // Jul 2010

    Micro-Architecture Support for Integrity Measurement on Dynamic Instruction Trace

    Trusted computing allows attesting remote system's trustworthiness based on the software stack whose integrity has been measured. However, attacker can corrupt system as well as measurement operation. As a result, nearly all integrity measurement mechanism suffers from the fact that what is measured may not be same as what is...

    Provided By University of Idaho

  • White Papers // May 2010

    A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security

    It is well-known that most cryptographic tasks do not have Universally Composable (UC) secure protocols, if no trusted setup is available in the framework. On the other hand, if a task like fair coin-tossing is available as a trusted setup, then all cryptographic tasks have UC secure protocols. What other...

    Provided By University of Idaho

  • White Papers // Aug 2011

    Hybrid Noncoherent Network Coding

    The authors describe a novel extension of subspace codes for non-coherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. They show that when symbol erasures occur in a significantly large number of different basis vectors transmitted through the...

    Provided By University of Idaho