In this paper, the sparse sensor placement problem for least-squares estimation is considered, and previous novel approach of selection algorithm extended. The maximization determinant matrix which appears in pseudo-inverse operations employed as an objective function present extended approach. procedure corresponding proved to be mathematically same that previously proposed QR method when numb...

Theoretical greedy type algorithms are studied: a Weak Greedy Algorithm, a Weak Orthogonal Greedy Algorithm, and a Weak Relaxed Greedy Algorithm. These algorithms are defined by weaker assumptions than their analogs the Pure Greedy Algorithm, an Orthogonal Greedy Algorithm, and a Relaxed Greedy Algorithm. The weaker assumptions make these new algorithms more ready for practical implementation. ...

A common situation arising in flow shops is that the job processing order must be same on each machine; this referred to as a permutation shop scheduling problem (PFSSP). Although many algorithms have been designed solve PFSSPs, machine availability typically ignored. Healthy conditions are essential for production process, which can ensure productivity and quality; thus, deteriorating effects ...

Human Resource Allocation (HRA) can be defined as the way professionals are distributed across organization’s tasks, given that each individual has his/her own set of characteristics, and task specific needs. Thus, this paper puts forward a mathematical programming model for allocating human resources considers employees’ formal qualifications experience possibility employees sharing tasks in p...

texture image analysis is one of the most important working realms of image processing in medical sciences and industry. up to present, different approaches have been proposed for segmentation of texture images. in this paper, we offered unsupervised texture image segmentation based on markov random field (mrf) model. first, we used gabor filter with different parameters’ (frequency, orientatio...