877,774 research outputs found
Computing the Unique Information
Given a pair of predictor variables and a response variable, how much
information do the predictors have about the response, and how is this
information distributed between unique, redundant, and synergistic components?
Recent work has proposed to quantify the unique component of the decomposition
as the minimum value of the conditional mutual information over a constrained
set of information channels. We present an efficient iterative divergence
minimization algorithm to solve this optimization problem with convergence
guarantees and evaluate its performance against other techniques.Comment: To appear in 2018 IEEE International Symposium on Information Theory
(ISIT); 18 pages; 4 figures, 1 Table; Github link to source code:
https://github.com/infodeco/computeU
Node Labels in Local Decision
The role of unique node identifiers in network computing is well understood
as far as symmetry breaking is concerned. However, the unique identifiers also
leak information about the computing environment - in particular, they provide
some nodes with information related to the size of the network. It was recently
proved that in the context of local decision, there are some decision problems
such that (1) they cannot be solved without unique identifiers, and (2) unique
node identifiers leak a sufficient amount of information such that the problem
becomes solvable (PODC 2013).
In this work we give study what is the minimal amount of information that we
need to leak from the environment to the nodes in order to solve local decision
problems. Our key results are related to scalar oracles that, for any given
, provide a multiset of labels; then the adversary assigns the
labels to the nodes in the network. This is a direct generalisation of the
usual assumption of unique node identifiers. We give a complete
characterisation of the weakest oracle that leaks at least as much information
as the unique identifiers.
Our main result is the following dichotomy: we classify scalar oracles as
large and small, depending on their asymptotic behaviour, and show that (1) any
large oracle is at least as powerful as the unique identifiers in the context
of local decision problems, while (2) for any small oracle there are local
decision problems that still benefit from unique identifiers.Comment: Conference version to appear in the proceedings of SIROCCO 201
Optimal Control of Wireless Computing Networks
Augmented information (AgI) services allow users to consume information that
results from the execution of a chain of service functions that process source
information to create real-time augmented value. Applications include real-time
analysis of remote sensing data, real-time computer vision, personalized video
streaming, and augmented reality, among others. We consider the problem of
optimal distribution of AgI services over a wireless computing network, in
which nodes are equipped with both communication and computing resources. We
characterize the wireless computing network capacity region and design a joint
flow scheduling and resource allocation algorithm that stabilizes the
underlying queuing system while achieving a network cost arbitrarily close to
the minimum, with a tradeoff in network delay. Our solution captures the unique
chaining and flow scaling aspects of AgI services, while exploiting the use of
the broadcast approach coding scheme over the wireless channel.Comment: 30 pages, journa
METHOD AND SYSTEM FOR CONTROLLED INFORMATION DISCLOSURE BASED ON USER CONTEXT USING PRINCIPLES OF JUST-IN-TIME AND JUST-ENOUGH-ACCESS
The present disclosure discloses a system and method to controlled information disclosure based on user context using principles of Just-In-Time and Just-Enough-Access, during package transportation. The system includes a unique identifier generator module for receiving transportation information, associated with a package, and generates a machine-readable unique identifier. The generated unique identifier is stored in a database and placed on the package. Upon receiving the package at the shipper sites, the unique identifier on the package is scanned using a scanning device with a GPS module and the information is provided to a computing unit, for computing and retrieving information about the next location. Finally, after scanning the unique identifier, at a final location at the time of delivery, the computing unit may invalidate the unique identifier, to prevent unnecessary information reveal about the recipient/sender. Thus, the security problems that arise due to unauthorised information access are eliminated
Resource provisioning in Science Clouds: Requirements and challenges
Cloud computing has permeated into the information technology industry in the
last few years, and it is emerging nowadays in scientific environments. Science
user communities are demanding a broad range of computing power to satisfy the
needs of high-performance applications, such as local clusters,
high-performance computing systems, and computing grids. Different workloads
are needed from different computational models, and the cloud is already
considered as a promising paradigm. The scheduling and allocation of resources
is always a challenging matter in any form of computation and clouds are not an
exception. Science applications have unique features that differentiate their
workloads, hence, their requirements have to be taken into consideration to be
fulfilled when building a Science Cloud. This paper will discuss what are the
main scheduling and resource allocation challenges for any Infrastructure as a
Service provider supporting scientific applications
Functional requirements document for the Earth Observing System Data and Information System (EOSDIS) Scientific Computing Facilities (SCF) of the NASA/MSFC Earth Science and Applications Division, 1992
Five scientists at MSFC/ESAD have EOS SCF investigator status. Each SCF has unique tasks which require the establishment of a computing facility dedicated to accomplishing those tasks. A SCF Working Group was established at ESAD with the charter of defining the computing requirements of the individual SCFs and recommending options for meeting these requirements. The primary goal of the working group was to determine which computing needs can be satisfied using either shared resources or separate but compatible resources, and which needs require unique individual resources. The requirements investigated included CPU-intensive vector and scalar processing, visualization, data storage, connectivity, and I/O peripherals. A review of computer industry directions and a market survey of computing hardware provided information regarding important industry standards and candidate computing platforms. It was determined that the total SCF computing requirements might be most effectively met using a hierarchy consisting of shared and individual resources. This hierarchy is composed of five major system types: (1) a supercomputer class vector processor; (2) a high-end scalar multiprocessor workstation; (3) a file server; (4) a few medium- to high-end visualization workstations; and (5) several low- to medium-range personal graphics workstations. Specific recommendations for meeting the needs of each of these types are presented
Mobile connections : curator's statement.
The Mobile Connections exhibition at the Futuresonic 2004 festival explored how mobile and locative media reconfigure social, cultural and information space. It looked beyond computing in its current form, towards the social and cultural possibilities opened by a new generation of networked, location-aware media. It sought an art of mobile communications: asking, are there any forms of expression that are intrinsic or unique to mobile and locative media
- …