a meshless method namely, discrete least square method (dlsm), is presented in the paper for the solution of free surface seepage problem. in this method computational domain is discredited by some nodes and then the set of simultaneous equations are built using moving least square (mls) shape functions and least square technique. the proposed method does not need any background mesh therefore ...

In recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. In the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. In this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (OOPLs) us...

In recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. In the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. In this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (OOPLs) us...

ant colony optimisation (aco) algorithm and adaptive refinement mechanism are used in this paper for solution of optimization problems. many of the real engineering problems are، however، of continuous nature and finding their solution by discrete ant based algorithms requires discretisation of the decision variables in which affected the convergence and performance of the algorithm. in this pa...

nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

In this paper we analyze the consistency properties of discrete adjoints of linear multistep methods. Discrete adjoints are very popular in optimization and control since they can be constructed automatically by reverse mode automatic differentiation. The consistency analysis reveals that the discrete linear multistep adjoints are, in general, inconsistent approximations of the adjoint ODE solu...

The solution of linear discrete ill-posed problems is very sensitive to perturbations in the data. Confidence intervals for solution coordinates provide insight into the sensitivity. This paper presents an efficient method for computing confidence intervals for large-scale linear discrete ill-posed problems. The method is based on approximating the matrix in these problems by a partial singular...