Sharif Digital Repository

Recently, Grid infrastructures have provided wide integrated use of resources. DotGrid intends to introduce required Grid services and toolkits that are implemented as a layer wrapped over the existing operating systems. Our DotGrid has been developed based on Microsoft .NET in Windows and MONO .NET in Linux and UNIX. Using DotGrid APIs, Grid middlewares and applications can be implemented easily. We evaluated our DotGrid capabilities by implementing some applications including a grid-based distributed cryptographic engine and also a typical computational problem. © 2006 IEEE  

This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. The SkipTree supports range queries as well as single point queries which are routed in O(log n) hops. SkipTree is fully decentralized with each node being connected to O(logn) other nodes. The memory usage for maintaining the links at each node is O(log n log log n) on average and O(log2 n) in the worst case. Load balance is also guaranteed to be within a constant factor. © Springer-Verlag Berlin Heidelberg 2005  

In cloud computing, services play key roles. Services are well defined and autonomous components. Nowadays, the demand of using Fuzzy inference as a service is increasing in the domain of complex and critical systems. In such systems, along with the development of the software, the cost of detecting and fixing software defects increases. Therefore, using formal methods, which provide clear, concise, and mathematical interpretation of the system, is crucial for the design of these Fuzzy systems. To obtain this goal, we introduce the Fuzzy Inference Cloud Service (FICS) and propose a novel discipline for formal modeling of the FICS. The FICS provides the service of Fuzzy inference to the... 

It is of fundamental importance to find algorithms obtaining optimal performance for learning of statistical models in distributed and communication limited systems. Aiming at characterizing the optimal strategies, we consider learning of Gaussian Processes (GP) in distributed systems as a pivotal example. We first address a very basic problem: how many bits are required to estimate the inner-products of some Gaussian vectors across distributed machines? Using information theoretic bounds, we obtain an optimal solution for the problem which is based on vector quantization. Two suboptimal and more practical schemes are also presented as substitutes for the vector quantization scheme. In... 

There are a vast number of cloud service providers, which offer virtual machines (VMs) with different configurations. From the companies perspective, an appropriate selection of VMs is an important issue, as the proper service selection leads to improved productivity, higher efficiency, and lower cost. An effective service selection cannot be done without a systematic approach due to the modularity of requests, the conflicts between requirements, and the impact of network parameters. In this paper, we introduce an innovative framework, called PCA, to solve service selection problem in the hybrid environment of peer-assisted, public, and private clouds. PCA detects the conflicts between the... 

In this paper, we argue that in many basic algorithms for machine learning, including support vector machine (SVM) for classification, principal component analysis (PCA) for dimensionality reduction, and regression for dependency estimation, we need the inner products of the data samples, rather than the data samples themselves.Motivated by the above observation, we introduce the problem of private inner product retrieval for distributed machine learning, where we have a system including a database of some files, duplicated across some non-colluding servers. A user intends to retrieve a subset of specific size of the set of the inner product of every pair of data items in the database with...