Peer-to-peer (P2P) computing is currently attracting enormous attention. P2P systems have emerged as a popular way to share huge volumes of data. In such systems each peer is a database management system in itself, ex-posing its own schema. A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. In such settings, the ...

background: in this study we evaluated the prognostic impact of metastatic lymph node ratio (mlr) in patients with gastric cancer undergoing curative surgical resection. methods: a total of 121 patients with gastric adenocarcinoma undergoing curative r0 surgical resection in our institutions between 2003 and 2010 were included in this study.  mlr was classified into 3 groups as follows: mlr0; 0...

Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of internet traffic. P2P systems have emerged as a popular way to share huge volumes of data. Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of P2P systems called schemabased. In such systems each peer is a database management system in itself, e...

This paper presents SHiMmer, a wireless platform for active sensing that combines localized processing with energy harvesting to provide long-lived structural health monitoring. The life-cycle of the node is extended to 20 years by the use of super-capacitors for energy storage. During this period the node is expected to work completely maintenance-free. The node is capable of harvesting up to ...

Wireless Personal Area Networks (WPANs) are an emerging technology for future short range indoor and outdoor multimedia and data centric applications. In this paper our work in modeling and performance assessment of the operation of the 802.15.4 MAC layer, we have identified a number of issues that enhanced the performance of WPAN when compared to 802.11 Standards. The bridging function automat...

We implement a modified Floyd-Warshall algorithm to solve the all-to-all shortest paths problem in O(n3 logn) time using MPI. Through the use of non-blocking round-robin message passing and other memory optimizations, we show super-linear speedup for a 4000 node graph problem, achieving a 23x speedup for 8 threads. In contrast, our reference OpenMP implementation achieved a 5x speedup for the s...

The present paper discusses real parallel computations. On the basis of a selected group of dynamic programming algorithms, a number of factors affecting the efficiency of parallel computations such as, e.g., the way of distributing tasks, the interconnection structure between particular elements of the parallel system or the way of organizing of interprocessor communication are analyzed. Compu...

The super node algorithm performs model order reduction based on physical principles. Although the algorithm provides us with compact models, its stability and passivity have not thoroughly been studied yet. The loss of passivity is a serious problem because simulations of the reduced network may encounter artificial behavior which render the simulations useless. In this paper we explain why th...