Sharif Digital Repository

In this paper, we develop a metaheuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require a single constrained renewable resource. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements; as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. To tackle this problem, we use a genetic algorithm in which a new method based... 

Spatial multi-programming is one of the most efficient multi-programming methods on Graphics Processing Units (GPUs). This multi-programming scheme generates variety in resource requirements of stream multiprocessors (SMs) and creates opportunities for sharing unused portions of each SM resource with other SMs. Although this approach drastically improves GPU performance, in some cases it leads to performance degradation due to the shortage of allocated resource to each program. Considering shared-memory as one of the main bottlenecks of thread-level parallelism (TLP), in this paper, we propose an adaptive shared-memory sharing architecture, called ASHA. ASHA enhances spatial... 

This paper deals with the resource-constrained project scheduling problem with flexible work profiles. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero. In many real-life projects, however, it often occurs that only one renewable bottleneck resource is available and that activities do not have, a fixed prespecified duration and associated resource requirement, but a total work content, which essentially indicates how much work has to be performed on them. Based on this work content, all feasible work profiles have to be specified for the activities, each characterized by a, fixed duration and a resource... 

We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using path relinking methodology as... 

User and device biometrics are proven to be a reliable source for authentication, especially for the Internet-of-Things (IoT) applications. One of the methods to employ biometric data in authentication are fuzzy extractors (FE) that can extract cryptographically secure and reproducible keys from noisy biometric sources with some entropy loss. It has been shown that one can reliably build an FE based on the learning parity with noise (LPN) problem with higher error-tolerance than previous FE schemes. However, the only available LPN-based FE implementation suffers from extreme resource demands that are not practical for IoT devices. This article proposes a lightweight hardware/software (HW/SW)... 

In order to develop a more realistic resource-constrained project-scheduling model that is applicable to real-world projects, in this paper, the resource investment problem with discounted cash flows and generalized precedence relations is investigated under inflation factor such that a bonus-penalty structure at the deadline of the project is imposed to force the project not to be finished beyond the deadline. The goal is to find activity schedules and resource requirement levels that maximize the net present value of the project cash flows. The problem is first mathematically modeled. Then, a genetic algorithm (GA) is designed using a new three-stage process that utilizes design of...