This paper is devoted to the performance analysis of detectors proposed in companion [1] where a comprehensive design framework presented for adaptive detection subspace signals. The addresses four variations on detection: may be known or only by its dimension; consecutive visits unconstrained they constrained prior probability distribution. In this paper, Monte Carlo simulations are used compa...

This paper presents a bi-objective MIP model for the flexible flow shop scheduling  problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...

Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...

We describe the application of data mining algorithms to research problems in astronomy. We posit that data mining has always been fundamental to astronomical research, since data mining is the basis of evidencebased discovery, including classification, clustering, and novelty discovery. These algorithms represent a major set of computational tools for discovery in large databases, which will b...

steel structures are usually built with some defects. according to the standard building codes, the central axes of the bracing members should go through the beam-column joints, however, in most of the braced steel structures, bracing members are unintentionally connected eccentrically. this paper presents a numerical investigation on performance analysis of cbfs (concentrically braced frames) ...

here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎the algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎it is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎numerical examples and a simulation study are used to...

the main purpose of this paper is to consider adomian's decomposition method in non-linear volterra integro-differential equations. the advantages of this method, compared with the recent numerical techniques (in particular the implicitly linear collocation methods) , and the convergence of adomian's method applied to such nonlinear integro-differential equations are discussed. finall...

‎in this paper, we formulate the fourth order sturm-liouville problem (fslp) as a lie group matrix differential equation. by solving this ma- trix differential equation by lie group magnus expansion, we compute the eigenvalues of the fslp. the magnus expansion is an infinite series of multiple integrals of lie brackets. the approximation is, in fact, the truncation of magnus expansion and a gauss...