171 research outputs found
Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information Per Bit
The multiterminal secret key agreement problem by public discussion is
formulated with an additional source compression step where, prior to the
public discussion phase, users independently compress their private sources to
filter out strongly correlated components for generating a common secret key.
The objective is to maximize the achievable key rate as a function of the joint
entropy of the compressed sources. Since the maximum achievable key rate
captures the total amount of information mutual to the compressed sources, an
optimal compression scheme essentially maximizes the multivariate mutual
information per bit of randomness of the private sources, and can therefore be
viewed more generally as a dimension reduction technique. Single-letter lower
and upper bounds on the maximum achievable key rate are derived for the general
source model, and an explicit polynomial-time computable formula is obtained
for the pairwise independent network model. In particular, the converse results
and the upper bounds are obtained from those of the related secret key
agreement problem with rate-limited discussion. A precise duality is shown for
the two-user case with one-way discussion, and such duality is extended to
obtain the desired converse results in the multi-user case. In addition to
posing new challenges in information processing and dimension reduction, the
compressed secret key agreement problem helps shed new light on resolving the
difficult problem of secret key agreement with rate-limited discussion, by
offering a more structured achieving scheme and some simpler conjectures to
prove
Secret Key Agreement under Discussion Rate Constraints
For the multiterminal secret key agreement problem, new single-letter lower
bounds are obtained on the public discussion rate required to achieve any given
secret key rate below the secrecy capacity. The results apply to general source
model without helpers or wiretapper's side information but can be strengthened
for hypergraphical sources. In particular, for the pairwise independent
network, the results give rise to a complete characterization of the maximum
secret key rate achievable under a constraint on the total discussion rate
On the Optimality of Secret Key Agreement via Omniscience
For the multiterminal secret key agreement problem under a private source
model, it is known that the maximum key rate, i.e., the secrecy capacity, can
be achieved through communication for omniscience, but the omniscience strategy
can be strictly suboptimal in terms of minimizing the public discussion rate.
While a single-letter characterization is not known for the minimum discussion
rate needed for achieving the secrecy capacity, we derive single-letter lower
and upper bounds that yield some simple conditions for omniscience to be
discussion-rate optimal. These conditions turn out to be enough to deduce the
optimality of omniscience for a large class of sources including the
hypergraphical sources. Through conjectures and examples, we explore other
source models to which our methods do not easily extend
Provenance in Collaborative Data Sharing
This dissertation focuses on recording, maintaining and exploiting provenance information in Collaborative Data Sharing Systems (CDSS). These are systems that support data sharing across loosely-coupled, heterogeneous collections of relational databases related by declarative schema mappings. A fundamental challenge in a CDSS is to support the capability of update exchange --- which publishes a participant\u27s updates and then translates others\u27 updates to the participant\u27s local schema and imports them --- while tolerating disagreement between them and recording the provenance of exchanged data, i.e., information about the sources and mappings involved in their propagation. This provenance information can be useful during update exchange, e.g., to evaluate provenance-based trust policies. It can also be exploited after update exchange, to answer a variety of user queries, about the quality, uncertainty or authority of the data, for applications such as trust assessment, ranking for keyword search over databases, or query answering in probabilistic databases.
To address these challenges, in this dissertation we develop a novel model of provenance graphs that is informative enough to satisfy the needs of CDSS users and captures the semantics of query answering on various forms of annotated relations. We extend techniques from data integration, data exchange, incremental view maintenance and view update to define the formal semantics of unidirectional and bidirectional update exchange. We develop algorithms to perform update exchange incrementally while maintaining provenance information. We present strategies for implementing our techniques over an RDBMS and experimentally demonstrate their viability in the Orchestra prototype system. We define ProQL, a query language for provenance graphs that can be used by CDSS users to combine data querying with provenance testing as well as to compute annotations for their data, based on their provenance, that are useful for a variety of applications. Finally, we develop a prototype implementation ProQL over an RDBMS and indexing techniques to speed up provenance querying, evaluate experimentally the performance of provenance querying and the benefits of our indexing techniques
A Review of ISO New England's Proposed Market Rules
This report reviews the proposed rules for restructured wholesale electricity markets in New England. We review the market rules, both individually and collectively, and identify potential problems that might limit the efficiency of these markets. We examine alternatives and identify the key tradeoffs among alternative designs. We believe that the wholesale electricity market in New England can begin on December 1, 1998. However, improvements are needed for long-run success. We have identified four major recommendations: 1. Switch to a multi-settlement system. 2. Introduce demand-side bidding. 3. Adopt location-based transmission congestion pricing, especially for the import/export interfaces. 4. Fix the pricing of the ten minute spinning reserves.Auctions; Multiple Object Auctions; Electricity Auctions
Cortex, countercurrent context, and dimensional integration of lifetime memory
The correlation between relative neocortex size and longevity in mammals encourages a search for a cortical function specifically related to the life-span. A candidate in the domain of permanent and cumulative memory storage is proposed and explored in relation to basic aspects of cortical organization. The pattern of cortico-cortical connectivity between functionally specialized areas and the laminar organization of that connectivity converges on a globally coherent representational space in which contextual embedding of information emerges as an obligatory feature of cortical function. This brings a powerful mode of inductive knowledge within reach of mammalian adaptations, a mode which combines item specificity with classificatory generality. Its neural implementation is proposed to depend on an obligatory interaction between the oppositely directed feedforward and feedback currents of cortical activity, in countercurrent fashion. Direct interaction of the two streams along their cortex-wide local interface supports a scheme of "contextual capture" for information storage responsible for the lifelong cumulative growth of a uniquely cortical form of memory termed "personal history." This approach to cortical function helps elucidate key features of cortical organization as well as cognitive aspects of mammalian life history strategies
Recommended from our members
MIMO channel capacity and configuration selection for switched parasitic antennas
MIMO systems offer a significant enhancement of data rate and channel capacity compared to traditional systems. But correlation degrades the system performance and puts a practical limit on the number of antennas that can be squeezed into portable wireless devices. Switched Parasitic Antennas (SPAs) is a possible solution especially where it is difficult to obtain enough signal decorrelation with conventional means. The covariance matrix represents the correlation present in the propagation channel and has significant impact on the MIMO channel capacity. The results of this work demonstrate a significant improvement in the MIMO channel capacity by using SPA with the knowledge of the covariance matrix for all pattern configurations. By employing the ‘Water-Pouring Algorithm’ (WPA) to modify the covariance matrix, the channel capacity is significantly improved as compared to traditional systems which just spread power equally among all the transmit antennas. A Condition Number (CN) is also proposed as a selection metric, to select the optimal pattern configuration for SPAs. CN is a channel quality indicator which represents the Eigen Value Spread (EVS) of the covariance matrix
- …