In-network data aggregation is essential for wireless sensor networks where resources (e.g., bandwidth, energy) are limited. In a previously proposed data dissemination scheme, data is opportunistically aggregated at the intermediate nodes on a low-latency tree which may not necessarily be energy

(chocolate cake) associated with more intense positive affect but less favorable cognitions, com-pared to a second (fruit salad) associated with less favorable affect but more favorable cognitions. Findings from the two experiments suggest that if process-ing resources are limited, spontaneously evoked

volume and high price volatility. Our model has an explicit solution, which allows for several comparative statics exercises. Our analysis shows that while Tobin’s tax can substantially reduce speculative trading when transaction costs are small, it has only a limited impact on the size of the bubble

The database research community prides itself on scalable technologies. Yet database systems traditionally do not excel on one important scalability dimension: the degree of distribution. This limitation has hampered the impact of database technologies on massively distributed systems like

Abstract not found

platform and led the National Broadcasting Company (NBC) to alter its on-air plans for mar-keting its fall 2000 prime-time schedule while the event was proceeding. This study assessed the impact of the prime-time promos carried in the 2000 Games on post-Olympics program ratings. A comparison

Abstract not found

Abstract—The expected low reliability of the silicon substrate at upcoming technology nodes presents a key challenge for digital system designers. Networks-on-chip (NoCs) are especially concerning because they are often the only communication infrastructure for the chips in which they are deployed. Recently, routing reconfiguration solutions have been proposed to address this problem. However, they come at a high silicon cost, and often require suspending the normal network activity while executing a centralized, resource-hungry reconfiguration algo-rithm. This paper proposes a novel, fast and minimalistic routing reconfiguration algorithm, called BLINC. BLINC utilizes pre-computed routing metadata to quickly evaluate localized detours upon each fault manifestation. We showcase the efficacy of our algorithm by deploying it in a novel NoC fault detection and reconfiguration solution, where BLINC enables uninterrupted NoC operation during aggressive online testing. If a fault seems likely to occur, we circumvent it in advance with the aid of our BLINC reconfiguration algorithm. Experimental results show an 80 % reduction in the average number of routers affected by a reconfiguration event, compared to state-of-the-art techniques. BLINC enables negligible performance degradation in our detection and reconfiguration solution, while solutions based on current techniques suffer a 17-fold latency increase. I.

Abstract not found

The quality of available network connections can often have a large impact on the performance of distributed applications. For example, document transfer applications such as FTP, Gopher and the World Wide Web suffer increased response times as a result of network congestion. For these applications