Critical Path Profiling is a technique that provides guidance to help programmers try to improve the running time of their program. However, Critical Path Profiling provides only an upper bound estimate of the improvement possible in a parallel program execution. In this paper, we present a new metric, called Slack , to complement Critical Path and provide additional information to parallel pro...

The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

The permutation flowshop scheduling problem is a widely studied combinatorial optimization with several real-world applications. In this paper we address green variant of the controllable processing times and two objective functions: one related to service level factory (makespan) another total cost or energy/carbon consumption. For propose novel Critical-Path based Iterated Local Search. This ...

The method for finding fuzzy optimal solution of fully fuzzy critical path (FFCP) problems i.e., critical path problems in which all the parameters are represented by fuzzy numbers, is at best scant; possibly non-existent. In this paper, a method is proposed to find the fuzzy optimal solution of FFCP problems, together with a new representation of triangular fuzzy numbers. This paper will show ...

In this paper, we address the problem of defending against entry-exit linking attacks in Tor, a popular anonymous communication system. We formalize the problem as a repeated non-cooperative game between the defender and the adversary (i.e., controller of the compromised Tor nodes to carry out entryexit linking attacks). Given the current path selection algorithm of Tor, we derive an optimal at...

T In this paper, we propose an approach based on hardware-software partitioning to minimize logic area of a SOPC circuit "System on a Programmable Chip". This approach minimizes the SOPC area while satisfying a time constraint. To minimize this area, we propose an algorithm to determine the critical path with the largest number of hardware tasks in a given data flow graph. Once these hardware t...

In this paper, we present Nyx, the first system to both effectively mitigate modern Distributed Denial of Service (DDoS) attacks regardless of the amount of traffic under adversarial control and function without outside cooperation or an Internet redesign. Nyx approaches the problem of DDoS mitigation as a routing problem rather than a filtering problem. This conceptual shift allows Nyx to avoi...

A systematic procedure for locating resistive bridges is presented. Critical path tracing is used to identify a set of “suspect” bridges whose presence could explain all of the observed faulty behavior of the circuit for the original test set. The set of suspects is then reduced by adaptively applying additional tests derived from the failing vector pairs in the original test set. Unlike other ...

This thesis discusses the problem of path selection for video streaming over 4G mobile networks; its final goal is to devise path selection strategies and test them with a pre-existing network simulator. The objective of path selection algorithms is to optimize both the use of network resources and the Quality of Experience of end users, quantified by various objective metrics. We will propose ...

background & aim: black seed or black cumin (nigella sativa l.) belongs the family ranunculaceae. black seed is one of these species, which is naturally distributed in different parts of the country. it is extensively cultivated in various regions of iran.  experimental: the experiment was achieved using randomized complete block design with three replications in the research field of islam...