Sharif Digital Repository

A linear arrangement φ of an undirected graph G = (V, E) with |V| = n nodes is a bijective function φ:V → {0, ..., n - 1}. The cost function is cost(G,φ)=∑uv∈E|(φ(u)-φ(v))| and opt(G) = min∀φcost(G, φ). The problem of finding opt(G) is called minimum linear arrangement (MINLA). The Minimum Linear Arrangement is an NP-hard problem in general. But there are some classes of graphs optimally solvable in polynomial time. In this paper, we show that the label of each node equals to the reverse of binary representation of its id in the optimal arrangement. Then, we design an O(n) algorithm to solve the minimum linear arrangement problem of Chord graphs  

The current study examines different arrangements of vortex tubes (VTs) to get higher performances for cooling and heating. The effects of thermo-physical parameters such as inlet feed temperature and inlet/outlet vortex tube pressure on generated temperature gradient are investigated. To estimate the cold outlet temperatures, the available equations in the literature are verified against our experimental data. Moreover, we propose a new equation to estimate the hot outlet temperature based on the upper limit of hot temperature (ULHT) and the lower limit of cold temperature (LLCT), verified with experimental data as well. Further, several arrangements are simulated to obtain the minimum cold... 

In this paper, we consider the problem of sensor placement for passive source localization under conditions where there are multiple sources and noise measurement is distance dependent. To this end, first we derive the Cramer-Rao bound for the angle of arrival (AOA) based source localization for distance-dependent noise model and existence of multiple sources. Then, the optimal arrangement of sensors to achieve this bound is obtained  

An efficient method for optimal allocation of wavelengths in a hybrid dense-wavelength-division-multiplexing system, carrying both quantum and classical data, is proposed. The transmission of quantum bits alongside intense classical signals on the same fiber faces major challenges arising from the background noise generated by classical channels. Raman scattering, in particular, is shown to have detrimental effects on the performance of quantum key distribution systems. Here, by using a nearly optimal wavelength allocation technique, we minimize the Raman induced background noise on quantum channels, hence maximize the achievable secret key generation rate for quantum channels. It turns out...