Sharif Digital Repository

Cloud manufacturing is an emerging service-oriented manufacturing paradigm that integrates and manages distributed manufacturing resources through which complex manufacturing demands with a high degree of customization can be fulfilled. The process of service selection optimization and scheduling (SSOS) is an important issue for practical implementation of cloud manufacturing. In this paper, we propose new mixed-integer programming (MIP) models for solving the SSOS problem with basic composition structures (i.e., sequential, parallel, loop, and selective). Through incorporation of the proposed MIP models, the SSOS with a mixed composition structure can be tackled. As transportation is... 

In this paper, we propose a new peer-to-peer (P2P) video streaming protocol which presents an implementation of network coding with a new caching mechanism. It employs a push-pull mechanism for sending the video chunks between peers. More specifically, this push-pull mechanism gives priority to the video chunks according to their video layers. The video base layer is transmitted through a pushing mechanism while the enhancement layers employ a pulling mechanism. Moreover, in the network coding algorithm of this protocol, we introduce a caching mechanism to improve the network's performance as well as the video streaming quality. The comprehensive simulations show that the proposed protocol... 

Elliptic localization is a range-based positioning technique exploiting multiple transmitter-receiver pairs, each of which provides separate bistatic range (BR) measurements. In this paper, a novel computationally efficient solution for locating a single target from BR measurements in distributed MIMO radar systems is proposed. Due to nonconvex nature of the associated maximum likelihood (ML) estimation problem, its globally optimal solution is difficult to obtain. We first reformulate the ML estimation as a nonconvex constrained weighted least squares problem. Owing to special structure of the resulting problem, it is recast as a convex problem, whose exact solution can be obtained in... 

On-chip interconnections play an important role in multi/many-processor systems-on-chip (MPSoCs). In order to achieve efficient optimization, each specific application must utilize a specific architecture, and consequently a specific interconnection network. For design space exploration and finding the best NoC solution for each specific application, a fast and flexible NoC simulator is necessary, especially for large design spaces. In this paper, we present an FPGA-based NoC co-simulator, which is able to be configured via software. In our proposed NoC simulator, entitled DuCNoC, we implement a Dual-Clock router micro-architecture, which demonstrates 75x-350x speed-up against BOOKSIM.... 

Nonlinear filtering techniques are used to fuse the Global Positioning System (GPS) with Inertial Navigation System (INS) to provide a robust and reliable navigation system with a performance superior to that of either INS or GPS alone. Prominent nonlinear estimators in this field are Kalman Filters (KF) and Particle Filters (PF). The main objective of this research is the comparative study of the well-established filtering methods of EKF, UKF, and PF based on EKF and UKF in an INS-GPS integrated navigation system. Different features of INS-GPS integrated navigation methods in the state estimation, bias estimation, and bias/scale factor estimation are investigated using these four filtering... 

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be... 

At a first glance, transmitting update information to a geographic region in the virtual space seems to be an attractive primitive in Massively Multiplayer Online Gaming (MMOG) applications where players are constantly moving and need to send updates to their neighbors who are in the same region of the virtual space. The system would become more scalable if entities did not need to keep track of each other or send messages directly to one another. Rather, an entity could just send a message to a specific region in the virtual space (its area of effect), as opposed to sending packets to specific IP addresses, significantly reducing tracking and routing overhead. Fundamentally speaking, update... 

Reliability is one of the main concerns in the design of network on chips due to the use of deep-sub micron technologies in fabrication of such products. This paper proposes a fault-tolerant routing algorithm called XYX which is based on sending redundant packets through the paths with lower traffic loads. The XYX routing algorithm makes a redundant copy of each packet at the source node and exploits two different routing algorithms to route the original and the redundant packets. Since two copies of each packet reach the destination node, the erroneous packet is detected and replaced with the correct one. Due to the use of paths with lower traffic rates for sending redundant packets and... 

Due to special constraints in peer-to-peer (P2P) networks (such as bandwidth limitation) and because of their highly dynamic characteristics, a single node cannot provide a reliable multimedia stream to the receivers. Several multi-sender algorithms are proposed to reliably deliver a media stream to the receiver through the intrinsically unreliable P2P networks. Based on upload bandwidths and availability of peers as well as the bandwidths of the links connecting the senders and the receiver, PROMISE selects a set of active senders to maximize the expected bit-rate delivered to the receiver. By careful investigation of PROMISE, in this paper, we present why and how it deviates from finding... 

To enhance performance, common processors feature relaxed memory models that reorder instructions. However, the correctness of concurrent programs is often dependent on the preservation of the program order of certain instructions. Thus, the instruction set architectures offer memory fences. Using fences is a subtle task with performance and correctness implications: using too few can compromise correctness and using too many can hinder performance. Thus, fence insertion algorithms that given the required program orders can automatically find the optimum fencing can enhance the ease of programming, reliability, and performance of concurrent programs. In this paper, we consider the class of... 

In this paper, we propose CodedSketch, as a distributed straggler-resistant scheme to compute an approximation of the multiplication of two massive matrices. The objective is to reduce the recovery threshold, defined as the total number of worker nodes that the master node needs to wait for to be able to recover the final result. To exploit the fact that only an approximated result is required, in reducing the recovery threshold, some sorts of pre-compression are required. However, compression inherently involves some randomness that would lose the structure of the matrices. On the other hand, considering the structure of the matrices is crucial to reduce the recovery threshold. In... 

We present a constant-time randomized distributed algorithms in the congested clique model that computes an O(α)-vertex-coloring, with high probability. Here, α denotes the arboricity of the graph, which is, roughly speaking, the edge-density of the densest subgraph. Congested clique is a well-studied model of synchronous message passing for distributed computing with all-to-all communication: per round each node can send one O(log n)-bit message algorithm to each other node. Our O(1)-round algorithm settles the randomized round complexity of the O(α)-coloring problem. We also explain that a similar method can provide a constant-time randomized algorithm for decomposing the graph into O(α)... 

Background: Long reads provide valuable information regarding the sequence composition of genomes. Long reads are usually very noisy which renders their alignments on the reference genome a daunting task. It may take days to process datasets enough to sequence a human genome on a single node. Hence, it is of primary importance to have an aligner which can operate on distributed clusters of computers with high performance in accuracy and speed. Results: In this paper, we presented IMOS, an aligner for mapping noisy long reads to the reference genome. It can be used on a single node as well as on distributed nodes. In its single-node mode, IMOS is an Improved version of Meta-aligner (IM)... 

The electric power industry is the main part of Science development, and today, with the advent of technology, the demand for electric power has been expanded. On the other hand, smart grids are developing heavily. One of the notable features of these networks is the presence of a plug-in hybrid electric vehicle (PHEV). The addition of these cars to the network has its own advantages and disadvantages. One of the most important issues in smart grids is network management and control of critical system parameters. In this paper the effect of these cars on the grid is investigated. These vehicles impose an increase in production capacity in the uncontrolled charge mode. They also have the... 

The electric power industry is the main part of Science development, and today, with the advent of technology, the demand for electric power has been expanded. On the other hand, smart grids are developing heavily. One of the notable features of these networks is the presence of a plug-in hybrid electric vehicle (PHEV). The addition of these cars to the network has its own advantages and disadvantages. One of the most important issues in smart grids is network management and control of critical system parameters. In this paper the effect of these cars on the grid is investigated. These vehicles impose an increase in production capacity in the uncontrolled charge mode. They also have the... 

In this paper, a distributed model predictive control is proposed to control Lipschitz nonlinear systems. The cooperative distributed scheme is considered where a global infinite horizon objective function is optimized for each subsystem, exploiting the state and input information of other subsystems. Thus, each control law is obtained separately as a state feedback of all system's states by solving a set of linear matrix inequalities. Due to convexity of the design, convergence properties at each iteration are established. Additionally, the proposed algorithm is modified to optimize only one control input at a time, which leads to a further reduction in the computation load. Finally, two... 

These days, considering the importance of reliability in industries, utilities’ role for preparing high levels of reliability becomes more important. This can be done by adding numbers of switches and Tie switches which impose high expenses to system. These expenditures should be provided by customers. Level of reliability in different points of network is different. So customers which pay more, receive higher level of reliability. If a customer raises its payment, utility change the location of switches in order to raise level of reliability of that customer. all customers change their payment and then utility fixes the switches at a point that all customers reach their favorable... 

We consider the problem of massive matrix multiplication, which underlies many data analytic applications, in a large-scale distributed system comprising a group of worker nodes. We target the stragglers' delay performance bottleneck, which is due to the unpredictable latency in waiting for slowest nodes (or stragglers) to finish their tasks. We propose a novel coding strategy, named entangled polynomial code, for designing the intermediate computations at the worker nodes in order to minimize the recovery threshold (i.e., the number of workers that we need to wait for in order to compute the final output). We demonstrate the optimality of entangled polynomial code in several cases, and show... 

Peer-to-peer networks have gained a tremendous popularity in sharing huge volumes of data. Success of such networks highly depends on the performance of their search algorithm. We propose a semantic based search algorithm for unstructured peer-to-peer networks. In the proposed method we establish ontology based indexes for outgoing links of each node, which are utilized in routing the query through the network. In contrast to available approaches, we maintain limited size indexes and also consider number of documents accessible via each link and the distance between source and destination nodes, to improve the accuracy and efficiency of our algorithm. Our design is scalable and adaptable, to... 

This article proposes a new architecture for distributed data management and update massage exchange in massively multiuser virtual environments. The key points in the design of such environments are scalability and QoS-aware message delivery. Therefore it requires robust distributed algorithms in a dynamic peer-to-peer system with frequent node arrivals and departures. Our proposed approach is mainly based on distributed hash tables (DHTs) in order to achieve a decentralized system where any participating node can efficiently retrieve the updates associated with a given object. Therefore, the responsibility of maintaining the mapping from names to values is distributed among the nodes in a...