Secure computation of a random access machine (RAM) program typically entails that it be first converted into a circuit. This conversion is unimaginable in the context of big-data applications where the size of the circuit can be exponential in the running time of the original RAM program. Realizing these constructions, without relinquishing the efficiency of RAM programs, often poses considera...

In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, we consider allocating index info...

--------------------------------------------------------------Abstract-----------------------------------------------------------The replica algorithms are built based on the topology of the data grid. The real representation of grid is general graph. So we propose an algorithm called Replica Placement in Graph Topology Grid (RPGTG) to place replicas on graph based data grids. In this paper, we...

Modern mobile networks, such as GPRS and UMTS, support wireless data applications. One successful example is the ever popular i-Mode in Japan. Wireless data services (wireless Internet) become more important as more and more customers of handheld devices enjoy the convenience of the ubiquitous computing. To improve the effective wireless data access, the time-to-live (TTL) management for data e...

There is widespread agreement that Cloud computing has proven cost cutting and agility benefits. However, security and regulatory compliance issues are continuing to challenge the wide acceptance of such technology both from social and commercial stakeholders. An important factor behind this is the fact that Clouds, and in particular public Clouds, are usually deployed and used within broad geo...

Efficient top-k query processing in highly distributed environments is a valuable but challenging research topic. This paper focuses on the problem over vertically partitioned data and aims to propose more efficient algorithms.. The effort is put on limiting the data transferred and communication round trips among nodes to reduce the communication cost of the query processing. Two novel algorit...

background and objectives: arteriovenous fistula is a popular vascular access method for surgical treatmentof hemodialysis patients. the method, however, is associated with a high rate of early failure varying in the range of 20-60%. predicting early arteriovenous fistula failure and its risk factors can help reduce its incidence, its hospitalization rate, and associated costs. in this study, w...

There are several known ways of storing stack data structure – as a linked list (called list from now on in this paper), an array which size is dynamically increased on demand (called vector), or a doubleended queue (called deque). C++ Standard [1] suggests a deque as a standard container to use as a back-end for a stack's internal storage. C++ deque implementations should rely on memory paging...

We present an approach for a generic, multi-dimensional run-time data structure suitable for high-performance scientific computing in C++. Our concept for associating meta-information with the data structure as well as different underlying datatypes is depicted. High-performance, multi-dimensional data access is realized by utilizing a heterogenous compile-time container generation function. Th...