Roughly speaking, there is one main model of pattern recognition support vector machine, with several variants of lower popularity. On the contrary, among the different multi-class support vector machines which can be found in literature, none is clearly favoured. On the one hand, they exhibit distinct statistical properties. On the other hand, multiple comparative studies between multi-class s...

breast cancer is a malignant tumor and the most common cancer among american women that starts from cells of the breast. the growth of the size of data exceeds the ability of humans to analyze the data. so we need some intelligent machines that can analyze datasets intelligently for us. we propose a multi nominal logit model to evaluate correlation between risk factors of breast tumor. our mode...

Bioinformatics techniques to protein secondary structure (PSS) prediction are mostly single-stage approaches in the sense that they predict secondary structures of proteins by taking into account only the contextual information in amino acid sequences. In this paper, we propose two-stage Multi-class Support Vector Machine (MSVM) approach where a MSVM predictor is introduced to the output of the...

In this paper, a decomposition method for evaluating the performance of continuous flow lines with machines characterized by general Markovian fluid models and finite capacity buffers is proposed. This study uses the exact solution of general two-stage Markovian fluid models as a building block. Decomposition equations are provided to propagate the effect of partial and complete blocking and st...

this paper is based on a combination of the principal component analysis (pca), eigenface and support vector machines. using n-fold method and with respect to the value of n, any person’s face images are divided into two sections. as a result, vectors of training features and test features are obtain ed. classification precision and accuracy was examined with three different types of kernel and...

This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...

This paper considers job shop scheduling problem followed by an assembly stage and Lot Streaming (LS). It is supposed here that a number of products have been ordered to be produced. Each product is assembled with a set of several parts. The production system includes two stages. The first stage is a job shop to produce parts. Each machine can process only one part at the same time. The second ...

An algorithm for constructing a shortest binary kstage machine generating a given binary sequence is presented. This algorithm can be considered as an extension of BerlekampMassey algorithm to the non-linear case.