Sharif Digital Repository

In recent years, determining the common information privately and efficiently between two mutually mistrusting parties have become an important issue in social networks. Many Private set intersection (PSI) protocols have been introduced to address this issue. By applying these protocols, two parties can compute the intersection between their sets without disclosing any information about components that are not in the intersection. Due to the broad range of computational resources that the cloud can provide for its users, determining the set intersection by cloud may decrease the computational cost of the users. The proposed protocol by Abadi et al. is one of the introduced protocols in this... 

Functional relationship between supplier and buyer in an open market place leads to investigate the role of both quantifiable and non-quantifiable parameters in coordination mechanism with the aim of achieving higher performance in supply chain activities. Here, we develop a supply chain model and a new agent to analyze and simulate the players' behavior in the network. A cooperative game theory framework is utilized between buyer and supplier in order to increase the supply chain performance. The study is supported by presenting SC Net Optimizer as a tool for implementing the proposed coordination mechanism and evaluates the performance of the chain by simulation using stochastic Petri nets... 

Today, organizations try to decline academically expenses using humans and resources in addition to rising managers and operators' satisfaction. Meantime, a very important step in the process of decision is the assignment of human resources, particularly in connection with research and development (R&D) projects in which the system is highly dependent on the capabilities of human resources. In this study, we tried all the assumptions that come true in the real world, considered a model for applied R&D projects to reduce costs and increase the efficiency of projects. Therefore, an integrated multiproject scheduling and multiskill human resource assignment model under uncertainty has developed... 

We consider the design of an optimal natural-gas network. Our proposed network contains two echelons, Town Broad Stations (TBSs), and consumers (demand zones). Here, our aim is a two-stage cost minimization. We first determine locations of the TBS so that the location-allocation cost is minimized. Then, we show how to distribute the flow of gas among the TBS minimizing the flow cost by using Minimum Spanning Tree (MST). A case study in Mazandaran Gas Company in Iran is made to assess the validity and effectiveness of our proposed model  

The theory of network coordination presents an effective approach to improve the business processes within supply networks. The automation of the negotiation process among buyers and suppliers has become an important policy in the transactional networks. This leads to assessing the roles of both quantifiable and non-quantifiable parameters in coordination mechanisms with the aim of achieving higher performance. Here, we develop an e-based supply chain multi-agent model for the design of mass-customized on-line services. The model addresses the bullwhip effect in multi-stage supply chain and also clarifies the evaluation of inventory policies in various supply and demand uncertainties. To... 

A new mixed-integer nonlinear programming model is presented for the time-dependent vehicle routing problem with time windows and intelligent travel times. The aim is to minimize fixed and variable costs, with the assumption that the travel time between any two nodes depends on traffic conditions and is considered to be a function of vehicle departure time. Depending on working hours, the route between any two nodes has a unique traffic parameter. We consider each working day to be divided into several equal and large intervals, termed as a time interval of traffic. Here, allowing for long distances between some of the nodes, travel time may take more than one time interval of traffic,... 

The arrival of the mobile phone and its rapid and widespread growth may well be seen as one of the most significant developments in the fields of communication and information technology over the past two decades. The aim of this study is to compare two hybrid multi-criteria decision-making (MCDM) approaches to evaluate the mobile phone options with respect to user’s preferences. Firstly, we identify the most desirable features influencing the choice of a mobile phone. This is realised through a survey conducted among the target group, the experiences of the telecommunication sector experts and the studies in the literature. Secondly, two MCDM methods are used in the evaluation procedure.... 

In this paper, a novel hard-output detection algorithm for the complex multiple-input multiple-output (MIMO) detectors is proposed, which results in a significant throughput enhancement, a near-ML performance, and an SNR-independent fixed-throughput. Moreover, a high-throughput VLSI implementation is proposed, which is based on a novel method of the node generation and sorting scheme. The proposed design achieves the throughput of 10Gbps in a 0.13 μ CMOS process, which is the highest throughput reported in the literature for both the real and the complex domains. Synthesis results in 90nm CMOS also show that the proposed scheme can achieve the throughput of up to 15Gbps. Moreover, the FPGA... 

A novel detection algorithm with an efficient VLSI architecture featuring efficient operation over infinite complex lattices is proposed. The proposed design results in the highest throughput, the lowest latency, and the lowest energy compared to the complex-domain VLSI implementations to date. The main innovations are a novel complex-domain means of expanding/visiting the intermediate nodes of the search tree on demand, rather than exhaustively, as well as a new distributed sorting scheme to keep track of the best candidates at each search phase. Its support of unbounded infinite lattice decoding distinguishes the present method from previous K-Best strategies and also allows its complexity... 

A novel ultra high-throughput detection algorithm with an efficient VLSI architecture for high-order MIMO detectors in the complex constellations is proposed. The main contributions include a new method for the node generation in complex-domain, pipelinable sorters, and a simple combinational circuit instead of the conventional multipliers, which makes the proposed architecture multiplication-free. The proposed design achieves an SNR-independent throughput of 13.3 Gbps at the clock frequency of 556 MHz in a 0.13 μm CMOS technology with a near ML performance. The implemented design consumes 90 pJ per detected bit with the initial latency of 0.3 μs. Also, the synthesis results in a 90 nm CMOS... 

Creativity is a promoting factor in organizations. Having employees in structured and organized configurations in a creative manner, helps in improving the productivity. We investigate different structural aspects of teams' network organization and the creativity within a knowledge development program (KDP). The proposed methodology being equipped with a heuristic clustering technique, classifies the employees with respect to creativity parameters and configures a creativity matrix. Applying the creativity matrix, clustering is performed via mathematical programming. For large problems, a genetic algorithm (GA) is developed to solve the mathematical model. We also employ the Taguchi method... 

A new approach for tracking targets in TWS systems is introduced which is based on Hough transform. The main idea is to take target's velocity and course of motion as the main tracking quantities and calculate other kinematic parameters of the target from these two main parameters. The main criteria for associating targets to tracks in Data Association (DA) step is co linearity of targets with the history of track and Hough transform is the main tool in this step. Computer simulation results are presented to compare the performance of the suggested algorithm with the conventional tracking systems  

The problem of estimating pulse repetition interval (PRI) of an interleaved pulse train which consist of several independent radar signals, is the main issue of signal processing in electronic support systems. PRI Transform algorithm is one of the well known and effective methods of PRI detection which is capable of detecting several close jittered signals and surpassing subharmonics, but have some drawbacks especially because of small PRI dynamic range and heavy computations. In this paper a modified PRI transform is introduced which manage wide range of PRIs simultaneously, and speed up the algorithm by significantly reducing the computations. Moreover an efficient threshold is set for... 

Let D be an F-central division algebra of index n. Here we present a criterion for the triviality of the group G(D) = D*/Nrd D/F(D*)D′ and thus generalizing various related results published recently. To be more precise, it is shown that G(D) = 1 if and only if SK 1(D) = 1 and F *2 = F *2n. Using this, we investigate the role of some particular subgroups of D* in the algebraic structure of D. In this direction, it is proved that a division algebra D of prime index is a symbol algebra if and only if D* contains a non-abelian nilpotent subgroup. More applications of this criterion including the computation of G(D) and the structure of maximal subgroups of D* are also investigated  

Given a divisible finite field extension K/F, the structure of Br(F), the Brauer group of F, is investigated. It is shown that, if F is indivisible, then Br(F) ≅ ℤ 2, which generalizes the Frobenius Theorem. As a consequence, when F is indivisible, the class of all finite dimensional non-commutative F-central division algebras D having radicable multiplicative groups D* is determined. In fact, it is proved that the following statements are equivalent: (1) D is radicable, (2) D contains a divisible subfield K/F, and (3) D is the ordinary quaternion division algebra and F(√-1) is divisible  

one of the main problems of radar identification in electronic warfare support system is analysis of pulse repetition interval (PRI) modulation. In this paper a robust method of recognizing the PRI modulation type of radar signals is proposed to improve robustness of previous recognition methods as well as to reduce the complexity. Simulation results show that the proposed method achieves much better error recognition rate in case of missing and spurious pulses than other methods such as autocorrelation based techniques and the Noone method  

We present a competitive algorithm to minimize a locally Lipschitz function constrained with locally Lipschitz constraints. The approach is to use an ℓ1 nonsmooth penalty function. The method generates second order descent directions to minimize the ℓ1 penalty function. We introduce a new criterion to decide upon acceptability of a Goldstein subdifferential approximation. We show that the new criterion leads to an improvement of the Goldstein subdifferential approximation, as introduced by Mahdavi-Amiri and Yousefpour. Also, making use of our proposed line search strategy, the method always moves on differentiable points. Furthermore, the method has an adaptive behaviour in the sense that,... 

We present a competitive algorithm to minimize a locally Lipschitz function constrained with locally Lipschitz constraints. The approach is to use an ℓ1 nonsmooth penalty function. The method generates second order descent directions to minimize the ℓ1 penalty function. We introduce a new criterion to decide upon acceptability of a Goldstein subdifferential approximation. We show that the new criterion leads to an improvement of the Goldstein subdifferential approximation, as introduced by Mahdavi-Amiri and Yousefpour. Also, making use of our proposed line search strategy, the method always moves on differentiable points. Furthermore, the method has an adaptive behaviour in the sense that,... 

In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In the pursuit-evasion problem, a polygonal region is given and a robot called a pursuer tries to find some mobile targets called evaders. The goal of this problem is to design a motion strategy for the pursuer such that it can detect all the evaders. In this paper, we consider a new variant of the pursuit-evasion problem in which the robots (pursuers) each moves back and forth along an orthogonal line segment inside a simple orthogonal polygon P. We assume that P includes unpredictable, moving evaders that have bounded speed. We propose the...