Sharif Digital Repository

Measurements and sensing implementations impose certain cost in sensor networks. The sensor selection cost optimisation is the problem of minimising the sensing cost of monitoring a physical (or cyber-physical) system. Consider a given set of sensors tracking states of a dynamical system for estimation purposes. For each sensor assume different costs to measure different (realisable) states. The idea is to assign sensors to measure states such that the global cost is minimised. The number and selection of sensor measurements need to ensure the observability to track the dynamic state of the system with bounded estimation error. The main question we address is how to select the state... 

This paper studies a simultaneous weekly assignment and scheduling decisionmaking problem in operating theaters with elective patients. Because of limited recourses in hospitals, considering assignment and scheduling decisions simultaneously can help mangers exploit the available resources more efficiently and make the work-load uniformly distributed during the planning horizon. This procedure can significantly reduce hospital costs and increase satisfaction of patients and personnel. This paper formulates the mentioned problem as a Mixed Integer Linear Program (MILP) considering applicable assumptions like finite recovery beds and limitation of equipment. Since the problem is NP-hard, in... 

Due to unstoppable growth of social networks and the large number of users, the detection of communities have become one of the most popular and successful domain of research areas. Detecting communities is a significant aspect in analyzing networks because of its various applications such as sampling, link prediction and communications among members of social networks. There have been proposed many different algorithms for solving community detection problem containing optimization methods. In this paper we propose a novel algorithm based on extended distributed learning automata for solving this problem. Our proposed algorithm benefits from cooperation between learning automata to detect... 

This paper introduces a new hub-and-center transportation network problem for a new company competing against an operating company. The new company intends to locate p hubs and assign the center nodes to the located hubs in order to form origin–destination pairs. It desires not only to maximize the total captured flow in the market but also aims to minimize the total transportation cost. Three competition rules are established between the companies which must be abided. According to the competition rules, the new company can capture the full percentage of the traffic in each origin-destination pair if its transportation cost for each route is significantly less than of the competitor. If its... 

In this paper, we develop and analyze a novel performance metric, called interference efficiency (IE), that shows the number of transmitted bits per unit of interference energy imposed on the primary users (PUs) in an underlay cognitive radio network (CRN). Specifically, we develop a framework to maximize the IE of a CRN with multiple secondary users (SUs) while satisfying target constraints on the average interference power on PU receiver, total SUs transmit power and minimum ergodic rate for the SUs. In doing so, we formulate a multiobjective optimization problem (MOP), that aims to achieve the maximum ergodic sum rate of multiple SUs and the minimum average interference power on the... 

The placement of the Last Level Cache (LLC) banks in the GPU on-chip network can significantly affect the performance of memory-intensive workloads. In this paper, we attempt to offer a placement methodology for the LLC banks to maximize the performance of the on-chip network connecting the LLC banks to the streaming multiprocessors in GPUs. We argue that an efficient placement needs to be derived based on a novel metric that considers the latency hiding capability of the GPUs through thread level parallelism. To this end, we propose a throughput aware metric, called Effective Latency Impact (ELI). Moreover, we define an optimization problem to formulate our placement approach based on the... 

With technology scaling, crosstalk fault has become a serious problem in reliable data transfer through Network on Chip (NoC) channels. The effects of crosstalk fault depend on transition patterns appearing on the wires of NoC channels. Among these patterns, Triplet Opposite Direction (TOD) imposes the worst crosstalk effects. Crosstalk Avoidance Codes (CACs) are the overhead-efficient mechanisms to tackle TODs. The main problem of CACs is their high imposed overheads to NoC routers. To solve this problem, this paper proposes an overhead-efficient coding mechanism called Penultimate-Subtracted Fibonacci (PS-Fibo) to alleviate crosstalk faults in NoC wires. PS-Fibo coding mechanism benefits... 

In many projects, multi-skilled workforces are able to perform different tasks with different quality levels. In this paper, a real-life version of the multi-skilled resource constrained project scheduling problem is investigated, in which the reworking risk of each activity depends on the assigned level of multi-skilled workforces. The problem is formulated mathematically as a bi-objective optimization model to minimize total costs of processing the activities and to minimize reworking risks of the activities, concurrently. In order to solve the resulting problem, three cuckoo-search-based multi-objective mechanisms are developed based on non-dominance sorting genetic algorithm,... 

For a set of colored points, a region is called color-spanning if it contains at least one point of each color. In this paper, we first consider the problem of maintaining the smallest color-spanning interval for a set of n points with k colors on the real line, such that the insertion and deletion of an arbitrary point takes O(log2 n) the worst-case time. Then, we exploit the data structure to show that there is O(n log2 n) time algorithm to compute the smallest color-spanning square for a set of n points with k colors in the plane. This is a new way to improve O(nk log n) time algorithm presented by Abellanas et al. [1] when k = !(log n). We also consider the problem of computing the... 

Efficient resource allocation in OFDM-based optical networks is directly affected by definition and formulations of Routing and Spectrum Assignment (RSA) problem. In this paper, we propose new Binary Linear Programming (BLP) formulations for the RSA problem that provide more efficient resource allocation in comparison with previous formulations. Unlike the conventional formulations that mainly aim at minimizing used spectrum slots, our formulations simultaneously aim at defragmentation and minimization of the assigned spectrum slots. We show contiguity constraint of the conventional formulations may incorrectly make a feasible solution unattainable. To solve this problem, we remove the... 

The regularity problem of heat conduction equation corresponding to modeling of solidification based on the latent heat evolution approach is considered in the present study. It is shown that the corresponding PDE is actually semi-smooth, an issue that has not been taken into account explicitly in the related literature. A general smoothing (regularization) strategy is introduced to solve this problem. More specifically, the smoothed version of the effective heat capacity method is presented in this work. The presented approach is applied to model the quasi steady-state heat transfer problem in the continuous casting process. Numerical experiments demonstrate the success of the presented... 

Installation of a significant number of distributed generators (DGs), besides the application of non-sinusoidal loads such as; Plug-in Hybrid Electric Vehicles (PHEVs), in the emerging smart distribution networks and the industrial plants have posed a major challenge to the existing methods of optimal transformer sizing (OTS). The harmonic currents generated in these new environments not only substantially increase the transformer load losses, but also cause abnormal winding temperature rise and hence transformer excessive loss of life. Therefore, the harmonic contents of the loads currents should be accounted in choosing the appropriate size of distribution transformers. To address this... 

In this research, the no-wait flowshop sequence dependent group scheduling problem with minimisation of total completion time, noted as Fm|nwt, fmls, Splk|∑Cj is approached. A mixed integer linear mathematical model is proposed for the research problem. Due to the NP-hard nature of the proposed problem, several metaheuristic algorithms based on particle swarm optimisation and variable neighbourhood search with different neighbourhood search structures are proposed to heuristically solve the problem. Also, an efficient heuristic algorithm is proposed to generate the initial feasible solutions for the proposed algorithms. The performances of the proposed algorithms are compared with each other... 

In the touring polygons problem (TPP), for a given sequence (s= P0, P1, ⋯, Pk, t = Pk+1) of polygons in the plane, where s and t are two points, the goal is to find a shortest path that starts from s, visits each of the polygons in order and ends at t. In the constrained version of TPP, there is another sequence (F0, ⋯, Fk) of polygons called fences, and the portion of the path from Pi to Pi+1 must lie inside the fence Fi. TPP is NP-hard for disjoint non-convex polygons, while TPP and constrained TPP are polynomially solvable when the polygons are convex and the fences are simple polygons. In this work, we present the first polynomial time algorithm for solving constrained TPP when the... 

In the proposed study, a Hybrid Model Predictive Controller is introduced for cruise control of an automobile model. The presented model consists of the engine, the gearbox, and the transmission dynamics, where the aerodynamics force and elastic friction between the tires and road are taken into account. Through Piecewise Linearization of nonlinearities in the system; (torque)-(throttle)-(angular velocity) of engine and (aerodynamic drag force)-(automobile velocity), a comprehensive piecewise linear model for the system is obtained. Then combined with the switch and shift between engaged gears in gearbox, the Piecewise Affine (PWA) model for the vehicle dynamics is acquired. As far as the... 

The facility location problem and its related financial issues have a significant impact on the configuration of a supply chain structure (SCS). Although affording the setup cost of facilities requires a huge financial investment, a meticulous planning to recoup it has been neglected by an overwhelming majority of previous studies. To fill this gap, an economical investment plan of facilities is determined by striking a trade-off between the contribution of the stockholders’ capital and the loan arrangement. In the context of a multiperiod three-echelon SCS, the model also determines the optimum location of plants and the best supply and distribution patterns. The model maximizes the fill... 

The pipe-spool fabrication process is a critical operational section in the piping projects that usually used to accelerate and discipline the installation process, especially, when we have a particular deadline for the project. For this reason, the fast and optimal scheduling of the fabrication activities with considering the real conditions and using manual or traditional methods is a significant problem for the decision-makers. In this paper, we use a novel linear programming model to schedule the spool fabrication activities based on the flexible job shop scheduling problem (FJSP). Because FJSP is a challengeable NP-hard problem, we solve the proposed mathematical model with a heuristic... 

3D Network-on-Chips (3D NoCs) have higher scalability, higher throughput, and lower power consumption over 2D NoCs. However, the reliability of data transfer in 3D NoCs is seriously threatened by thermal problems. This is due to poor heat dissipation, inappropriate traffic distribution, and cooling restriction for layers away of the chip heat-sink in 3D NoCs. To solve this problem, this paper proposes an efficient deadlock-free and traffic-And thermal-Aware routing algorithm, called Floating XY-YX. The main idea behind Floating XY-YX routing algorithm is twofold: 1) to use XY and YX routing algorithms in consecutive layers in dessicate form, and 2) to evenly load the traffic, which is... 

In this research, a new metaheuristic optimization algorithm, inspired by biological nervous systems and artificial neural networks (ANNs) is proposed for solving complex optimization problems. The proposed method, named as neural network algorithm (NNA), is developed based on the unique structure of ANNs. The NNA benefits from complicated structure of the ANNs and its operators in order to generate new candidate solutions. In terms of convergence proof, the relationship between improvised exploitation and each parameter under asymmetric interval is derived and an iterative convergence of NNA is proved theoretically. In this paper, the NNA with its interconnected computing unit is examined... 

The Newsboy problem has always been an important issue in inventory management. The multi-product newsboy problem with random yield and budget constraint named as the Gardener Problem is one of the novels and popular extensions of the newsboy problem. Different from the existing studies, this paper presents a multi-product gardener problem with reservation policy. Moreover, a discount rate is offered to those customers who are willing to make reservations. In addition to the demand from the original customers, extra demand is included in the model due to the motivation received by the discount rate. A solution algorithm namely the multi-product gardener problem with reservation policy...