Approximation by Stancu–Chlodowsky polynomials

In this paper, we investigate convergence and approximation properties of a Chlodowsky type generalization of Stancu polynomials (we called Stancu–Chlodowsky polynomials).The rates of convergence of this generalization are obtained by means of modulus of continuity and by using the $K$-functional of Peetre. We also present and prove theorems on weighted approximation and the order of approximation of continuous functions by these operators on all positive semi-axis.     

Designing a sustainable supply chain using an integrated analytic network process and goal programming approach in quality function deployment

Sustainable supply chain management (SSCM) provides economic, social end environmental requirements in material and service flows occurring between suppliers, manufacturers and customers. SSCM structure is considered as a prerequisite for a sustainable success. Thus designing an effective SCM structure provides competitive advantages for the companies. In order to achieve an effective design of this structure, it is possible to apply quality function deployment (QFD) approach which is successfully applied as an effective product and system development tool. This study presents a decision framework where analytic network process (ANP) integrated QFD and zero-one goal programming (ZOGP) models are used in order to determine the design requirements which are more effective in achieving a sustainable supply chain (SSC). The first phase of the QFD is the house of quality (HOQ) which transforms customer requirements into product design requirements. In this study, after determining the sustainability requirements named customer requirements (CRs) and design requirements (DRs) of a SSC, ANP is employed to determine the importance levels in the HOQ considering the interrelationships among the DRs and CRs. Furthermore ZOGP approach is used to take into account different objectives of the problem. The proposed method is applied through a case study and obtained results are discussed.     

Rule extraction from artificial neural networks to discover causes of quality defects in fabric production

In this paper, a novel classification rule extraction algorithm which has been recently proposed by authors is employed to determine the causes of quality defects in a fabric production facility in terms of predetermined parameters like machine type, warp type etc. The proposed rule extraction algorithm works on the trained artificial neural networks in order to discover the hidden information which is available in the form of connection weights in them. The proposed algorithm is mainly based on a swarm intelligence metaheuristic which is known as Touring Ant Colony Optimization (TACO). The algorithm has a hierarchical structure with two levels. In the first level, a multilayer perceptron type neural network is trained and its weights are extracted. After obtaining the weights, in the second level, the TACO-based algorithm is applied to extract classification rules. The main purpose of the present work is to determine and analyze the most effective parameters on the quality defects in fabric production. The parameters and their levels which give the best quality results are tried to be discovered and evaluated by making use of the proposed algorithm. It is also aimed to compare the accuracy of proposed algorithm with several other rule-based algorithms in order to present its competitiveness.     

Use of center of gravity with the common vector approach in isolated word recognition

In this paper, the subspace based classifier, common vector approach (CVA), with the center of gravity (COG) method is used for isolated word recognition. Since the CVA classifier is sensitive to shifts through the time axis, endpoint detection becomes extremely important for the recognition of isolated words. The COG method eliminates the need for endpoint detection. The effects of the COG method and a classical endpoint detection algorithm on the recognition rates of isolated words are investigated. The experimental results show that the COG method yields slightly higher recognition rates than the endpoint detection method in the TI-digit database when CVA is used.     

An automatic diabetes diagnosis system based on LDA-Wavelet Support Vector Machine Classifier

In this paper, an automatic diagnosis system for diabetes on Linear Discriminant Analysis (LDA) and Morlet Wavelet Support Vector Machine Classifier: LDA–MWSVM is introduced. The structure of this automatic system based on LDA-MWSVM for the diagnosis of diabetes is composed of three stages: The feature extraction and feature reduction stage by using the Linear Discriminant Analysis (LDA) method and the classification stage by using Morlet Wavelet Support Vector Machine (MWSVM) classifier stage. The Linear Discriminant Analysis (LDA) is used to separate features variables between healthy and patient (diabetes) data in the first stage. The healthy and patient (diabetes) features obtained in the first stage are given to inputs of the MWSVM classifier in the second stage. Finally, in the third stage, the correct diagnosis performance of this automatic system based on LDA–MWSVM for the diagnosis of diabetes is calculated by using sensitivity and specificity analysis, classification accuracy, and confusion matrix, respectively. The classification accuracy of this system was obtained at about 89.74%.     

Single machine scheduling with unequal release date using neuro-dominance rule

A neuro-dominance rule (NDR) for single machine total weighted tardiness problem with unequal release date is presented by the author. To obtain the NDR, backpropagation artificial neural network (BPANN) has been trained using 10,000 data and also tested using 10,000 another data. Inputs of the trained BPANN are starting date of the first job (t), processing times (p_i and p_j), due dates (d_i and d_j), weights of the jobs (w_i and w_j) and r_i and r_j release dates of the jobs. Output of the BPANN is a decision of which job should precede. Training set and test set have been obtained using Adjusted Pairwise Interchange method. The proposed NDR provides a sufficient condition for local optimality. It has been proved that if any sequence violates the NDR then violating jobs are switched according to the total weighted tardiness criterion. The proposed NDR is compared to a number of competing heuristics (ATC, COVERT, EDD, SPT, LPT, WDD, WSPT, WPD, CR, FCFS) and meta heuristics (simulated annealing and genetic algorithms) for a set of randomly generated problems. The problem sizes have been taken as 50, 70, 100. NDR is applied 270,000 randomly generated problems. Computational results indicate that the NDR dominates the heuristics and meta heuristics in all runs. Therefore, the NDR can improve the upper and lower bounding schemes.     

Mobility-Aware RSVP: A framework for improving the performance of multimedia services over wireless IP-based mobile networks

This paper proposes the Mobility-Aware Resource Reservation Protocol (MARSVP) in which mobility and QoS signaling are performed as a single functional block. The key concept of MARSVP is to convey mobility-specific information (binding updates and their associated acknowledgments) by using newly defined RSVP objects embedded in existing RSVP messages. An appealing feature of MARSVP is that it adheres to the current RSVP standard (RFC 2205) and thus requires minimal changes to end nodes without affecting any of the conventional RSVP routers in between. The proposed mechanism is evaluated using a simulation model for application-level performance and an analytical model for network-level signaling cost. Simulation results indicate a 27.9% improvement in QoS interruption when using Mobile IPv6 (MIPv6), 12.5% when using Hierarchical Mobile IPv6 (HMIPv6), and no improvement when using Fast Handovers for MIPv6 (FMIPv6). On the network-level, signaling cost savings of 9.4% and 11.9% are achieved for MIPv6 and HMIPv6, respectively, while FMIPv6 achieves savings of 17.9% when using Voice-over-IP traffic and 26.7% for Video-over-IP traffic. The results of the conducted studies indicate MARSVP’s superiority to conventional RSVP when deployed over wireless networks.     

The modeling of mode choices of intercity freight transportation with the artificial neural networks and adaptive neuro-fuzzy inference system

Mode choice modeling is probably the most important element of transportation planning. It affects the general efficiency of travel and the allocation of resources. The development of mode choice models has recently witnessed significant advances in many fields, such as passenger and freight transport. A large number of mathematical models have been used to model the traveler’s choice of mode and destination and the shipper’s choice of mode, shipment size and supply market, among others. Such models are not only becoming almost intractable but also data intensive, difficult to calibrate and update, and intransferable. These models cover a wide range of mathematical complexity and accuracy. This paper describes a new approach to mode choice of intercity freight transport modeling using artificial neural networks (ANNs) and adaptive neuro-fuzzy inference system (ANFIS) models. The new approach combines the learning ability of artificial neural networks and the transparent nature of fuzzy logic. The approach is found to be highly adaptive and efficient in investigating non-linear relationships among different variables. The adaptive neuro-fuzzy inference system model is tested on the freight transport market in Turkey, Germany, France and Austria by using information on the freight flows and their attributes. The ANNs and ANFIS models are more successful in the representation of the non-linear behavior of mode choice of intercity freight transport compared to the classical models.