Group decision making process for supplier selection with VIKOR under fuzzy environment

During recent years, how to determine suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of supplier selection is a complex multi-criteria problem including both quantitative and qualitative factors which may be in conflict and may also be uncertain. The VIKOR method was developed to solve multiple criteria decision making (MCDM) problems with conflicting and non-commensurable (different units) criteria, assuming that compromising is acceptable for conflict resolution, the decision maker wants a solution that is the closest to the ideal, and the alternatives are evaluated according to all established criteria. In this paper, linguistic values are used to assess the ratings and weights for these factors. These linguistic ratings can be expressed in trapezoidal or triangular fuzzy numbers. Then, a hierarchy MCDM model based on fuzzy sets theory and VIKOR method is proposed to deal with the supplier selection problems in the supply chain system. A numerical example is proposed to illustrate an application of the proposed model.     

Guidance and nonlinear control system for autonomous flight of minirotorcraft unmanned aerial vehicles

Small unmanned aerial vehicles (UAVs) are becoming popular among researchers and vital platforms for several autonomous mission systems. In this paper, we present the design and development of a miniature autonomous rotorcraft weighing less than 700 g and capable of waypoint navigation, trajectory tracking, visual navigation, precise hovering, and automatic takeoff and landing. In an effort to make advanced autonomous behaviors available to mini‐ and microrotorcraft, an embedded and inexpensive autopilot was developed. To compensate for the weaknesses of the low‐cost equipment, we put our efforts into designing a reliable model‐based nonlinear controller that uses an inner‐loop outer‐loop control scheme. The developed flight controller considers the system's nonlinearities, guarantees the stability of the closed‐loop system, and results in a practical controller that is easy to implement and to tune. In addition to controller design and stability analysis, the paper provides information about the overall control architecture and the UAV system integration, including guidance laws, navigation algorithms, control system implementation, and autopilot hardware. The guidance, navigation, and control (GN&C) algorithms were implemented on a miniature quadrotor UAV that has undergone an extensive program of flight tests, resulting in various flight behaviors under autonomous control from takeoff to landing. Experimental results that demonstrate the operation of the GN&C algorithms and the capabilities of our autonomous micro air vehicle are presented. © 2009 Wiley Periodicals, Inc.     

A hybrid capacitive pressure and temperature sensor fabricated by adhesive bonding technique for harsh environment of kraft pulp digesters

We have developed a compensated capacitive pressure and temperature sensor for kraft pulp digesters (pH 13.5, temperatures 25–175°C reaching a local maximum of 180°C and pressures up to 2 MPa). The gauge capacitive pressure sensor was fabricated by bonding silicon and Pyrex chips using a high temperature, low viscosity UV (ultraviolent) adhesive as the gap-controlling layer and heat curing adhesive as the bonding agent. A simple chip bonding technique, involving insertion of the adhesive into the gap between two chips was developed. A platinum thin-film wire was patterned on top of a silicon chip to form a resistance temperature detector (RTD) with a nominal resistance of 1,500 Ω. A silicon dioxide layer and a thin layer of Parylene were deposited to passivate the pressure sensor diaphragm and the sensors were embedded into epoxy for protection against the caustic environment in kraft digesters. The sensors were tested up to 2 MPa and 170°C in an environment chamber. The maximum thermal error of ±1% (absolute value of ±20 kPa) full scale output (FSO) and an average sensitivity of 0.554 fF/kPa were measured. Parylene-coated silicon chips were tested for a full kraft pulping cycle with no signs of corrosion.     

Genetic-based minimum classification error mapping for accurate identifying Peer-to-Peer applications in the internet traffic

In this paper, we propose a hybrid approach using genetic algorithm and neural networks to classify Peer-to-Peer (P2P) traffic in IP networks. We first compute the minimum classification error (MCE) matrix using genetic algorithm. The MCE matrix is then used during the pre-processing step to map the original dataset into a new space. The mapped data set is then fed to three different classifiers: distance-based, K-Nearest Neighbors, and neural networks classifiers. We measure three different indexes, namely mutual information, Dunn, and SD to evaluate the extent of separation of the data points before and after mapping is performed. The experimental results demonstrate that with the proposed mapping scheme we achieve, on average, 8% higher accuracy in classification of the P2P traffic compare to the previous solutions. Moreover, the genetic-based MCE matrix increases the classification accuracy more than what the basic MCE does.     

The discrete collocation method for Fredholm–Hammerstein integral equations based on moving least squares method

The purpose of this paper is to investigate the discrete collocation method based on moving least squares (MLS) approximation for Fredholm–Hammerstein integral equations. The scheme utilizes the shape functions of the MLS approximation constructed on scattered points as a basis in the discrete collocation method. The proposed method is meshless, since it does not require any background mesh or domain elements. Error analysis of this method is also investigated. Some numerical examples are provided to illustrate the accuracy and computational efficiency of the method.     

A fast and noise resilient cluster-based anomaly detection

Clustering, while systematically applied in anomaly detection, has a direct impact on the accuracy of the detection methods. Existing cluster-based anomaly detection methods are mainly based on spherical shape clustering. In this paper, we focus on arbitrary shape clustering methods to increase the accuracy of the anomaly detection. However, since the main drawback of arbitrary shape clustering is its high memory complexity, we propose to summarize clusters first. For this, we design an algorithm, called Summarization based on Gaussian Mixture Model (SGMM), to summarize clusters and represent them as Gaussian Mixture Models (GMMs). After GMMs are constructed, incoming new samples are presented to the GMMs, and their membership values are calculated, based on which the new samples are labeled as “normal” or “anomaly.” Additionally, to address the issue of noise in the data, instead of labeling samples individually, they are clustered first, and then each cluster is labeled collectively. For this, we present a new approach, called Collective Probabilistic Anomaly Detection (CPAD), in which, the distance of the incoming new samples and the existing SGMMs is calculated, and then the new cluster is labeled the same as of the closest cluster. To measure the distance of two GMM-based clusters, we propose a modified version of the Kullback–Libner measure. We run several experiments to evaluate the performances of the proposed SGMM and CPAD methods and compare them against some of the well-known algorithms including ABACUS, local outlier factor (LOF), and one-class support vector machine (SVM). The performance of SGMM is compared with ABACUS using Dunn and DB metrics, and the results indicate that the SGMM performs superior in terms of summarizing clusters. Moreover, the proposed CPAD method is compared with the LOF and one-class SVM considering the performance criteria of (a) false alarm rate, (b) detection rate, and (c) memory efficiency. The experimental results show that the CPAD method is noise resilient, memory efficient, and its accuracy is higher than the other methods.     

Classifying the Geometric Dilution of Precision of GPS satellites utilizing Bayesian decision theory

The errors resulting from satellite configuration geometry can be determined by Geometric Dilution of Precision (GDOP). Considering optimal satellite subset selection, lower GDOP value usually causes better accuracy in GPS positioning. However, GDOP computation based on complicated transformation and inversion of measurement matrices is a time consuming procedure. This paper deals with classification of GPS GDOP utilizing Parzen estimation based Bayesian decision theory. The conditional probability of each class is estimated by Parzen algorithm. Then based on Bayesian decision theory, the class with maximum posterior probability is selected. The experiments on measured dataset demonstrate that the proposed algorithm lead, in mean classification improvement, to 4.08% in comparison with Support Vector Machine (SVM) and 9.83% in comparison with K-Nearest Neighbour (KNN) classifier. Extra work on feature extraction has been performed based on Principle Component Analysis (PCA). The results demonstrate that the feature extraction approach has best performance respect to all classifiers.     

A new fuzzy decision-making procedure applied to emergency electric power distribution scheduling

In this paper a new fuzzy decision-making procedure is developed. Two levels of weightings, called upper and lower weights, are proposed to calculate the fuzzy weightings of different criteria. The preference table is introduced to calculate the upper and lower weights. Also a new method is developed to determine the expected preference values of different alternatives. These values are used for generating the priority list of alternatives. The procedure is applied for providing an emergency electric power distribution, scheduling time table. The IEEE 14-bus standard system and a 14-bus system with four power plants are considered as case studies. Using fuzzy decision-making procedure, the regions with more priorities are more connected to the distribution net, while the maximum consumption criterion is also reasonably respected.     

Dynamic Control of Walking Cycle with Initiation Process for Humanoid Robot

This paper focuses on numerical method to solve the dynamic equilibrium of a humanoid robot during the walking cycle with the gait initiation process. It is based on a multi-chain strategy and a dynamic control/command architecture previously developed by Gorce. The strategy is based on correction of the trunk center of mass acceleration and force distribution of the forces exerced by the limbs on the trunk. This latter is performed by mean of a Linear Programming (LP) method. We study the gait initiation process when a subject, initially in quiet erect stance posture, performs a walking cycle. In this paper, we propose to adjust the method for the multiphases (from double support to single support) and multicriteria features of the studied movement. This is done by adapting some specific constraints and criteria in order to ensure the global stability of the humanoid robot along the task execution. For that, we use a Real-Time Criteria and Constraints Adaptation method. Simulation results are presented to demonstrate criteria and constraints influences on the dynamic stability.     

A novel image encryption/decryption scheme based on chaotic neural networks

This paper presents a novel image encryption/decryption algorithm based on chaotic neural network (CNN). The employed CNN is comprised of two 3-neuron layers called chaotic neuron layer (CNL) and permutation neuron layer (PNL). The values of three RGB (Red, Green and Blue) color components of image constitute inputs of the CNN and three encoded streams are the network outputs. CNL is a chaotic layer where, three well-known chaotic systems i.e. Chua, Lorenz and Lü systems participate in generating weights and biases matrices of this layer corresponding to each pixel RGB features. Besides, a chaotic tent map is employed as the activation function of this layer, and makes the relationship between the plain image and cipher image nonlinear. The output of CNL, i.e. the diffused information, is the input of PNL, where three-dimensional permutation is applied to the diffused information. The overall process is repeated several times to make the encryption process more robust and complex. A 160-bit-long authentication code has been used to generate the initial conditions and the parameters of the CNL and PNL. Some security analysis are given to demonstrate that the key space of the new algorithm is large enough to make brute-force attacks infeasible and simulations have been carried out with detailed numerical analysis, demonstrating the high security of the new image encryption scheme.