that have observed interesting events in the network. A highly efficient data-centric routing mechanism will offer significant power cost reductions [17], and improve network longevity. Moreover, because of the large amount of system and data redundancy possible, data becomes disassociated from specific

on industry context. More specif-ically, our empirical analysis suggests that strong ties in a highly interconnected strategic alliance network negatively impact firm performance. This network configuration is especially suboptimal for firms in the semiconductor industry. Furthermore, strong and weak ties

. In this paper, we propose an independent and novel ap-proach to image coding, based on a fractal theory of iterated transformations. The main characteristics of this approach are that i) it relies on the assumption that image redundancy can be efficiently exploited through self-transformability on a block

using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge

This paper speculates that technology trends pose new challenges for fault tolerance in microprocessors. Specifically, severely reduced design tolerances implied by gigaherz clock rates may result in frequent and arbitrary transient faults. We suggest that existing fault-tolerant techniques

the probability of preservation. The model proposed herein leads to quantitative predictions that are consistent with observations on the frequency of long-term duplicate gene preservation and with observations that indicate that a common fate of the members of duplicate-gene pairs is the partitioning of tissue-specific

the sparsity of the equations and their specific structure. The XSL attack uses only relations true with probability 1, and thus the security does not have to grow exponentially in the number of rounds. XSL has a parameter P, and from our estimations is seems that P should be a constant or grow very slowly

ABSTRACT RB is a programming language for specifying redundancy in various dimensions. Avizienis's notation T I HIS, for Time I Hardware I Software, describes the different types of redundancy possible in a computation: repetition (nT I HIS), redundant hardware (T I nH I S), and program

realizability of causes in terms of specificity of facts, and employ this in an interpretation of what goes on in cases of apparently redundant causation. 1. CAUSES, PARTICULARS, AND FACTS I think that what exactly the causal relation relates is a very hard question. A common intuition is that, since causation

, namely s(H) =d. We then derive general bounds on the stopping redundancy of linear codes. We also examine several simple ways of constructing codes from other codes, and study the effect of these constructions on the stopping redundancy. Specifically, for the family of binary Reed-Muller codes (of all