Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...

the imperialist competitive algorithm (ica) that was recently introduced has shown its good performance in optimization problems. this algorithm is inspired by competition mechanism among imperialists and colonies, in contrast to evolutionary algorithms. this paper presents optimization of bead geometry in welding process using of ica. therefore, two case studies from literature are presented t...

transmission network expansion planning (tnep) is an important component of power system planning. itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. different methods have been proposed for the solution of the static transmissionnetwork expansion planning (stnep) problem till now. but in all of them, stnep pr...

This abstract briefly describes a segmentation algorithm developed for the ISIC [1] 2017 Skin Lesion Detection Competition hosted at [2]. The objective of the competition is to perform a segmentation (in the form of a binary mask image) of skin lesions in dermoscopic images as close as possible to a segmentation performed by trained clinicians, which is taken as ground truth. This project only ...

in this context, a novel structure has been proposed for simple differential evolutionary (de) algorithm to solve optimal recloser placement. for this, an operator is added to de algorithm to adapt concept of the problem. other contribution of this work is formulating a novel objective function. the proposed objective function has been formulated to improve four reliability indices which consis...

This paper presents the effective control of the formation and competition of cellular patterns. Simulation and theoretical analyses are carried out for pattern formation in a confined circular domain. The Cahn–Hilliard equation is solved with the zero-flux boundary condition to describe the phase separation of binary mixtures. A wavelet-based discrete singular convolution algorithm is employed...

The protein folding problem is a fundamental problem in computational molecular biology and biochemical physics which led us to understand the function of a given sequence.The problem is NP-hard and the standard computational approach are not suitable to obtain the enough accurate structure in the huge conformation space. Simplied models such as hydrophobicpolar (HP) model have become one of th...

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...