QoS-based cooperative algorithm for integral multi-commodity flow problem

This paper treats with integral multi-commodity flow through a network. To enhance the Quality of Service (QoS) for channels, it is necessary to minimize delay and congestion. Decreasing the end-to-end delay and consumption of bandwidth across channels are dependent and may be considered in very complex mathematical equations. To capture with this problem, a multi-commodity flow model is introduced whose targets are minimizing delay and congestion in one model. The flow through the network such as packets, also needs to get integral values. A model covering these concepts, is NP-hard while it is very important to find transmission strategies in real-time. For this aim, we extend a cooperative algorithm including traditional mathematical programming such as path enumeration and a meta-heuristic algorithm such as genetic algorithm. To find integral solution satisfying demands of nodes, we generalize a hybrid genetic algorithm to assign the integral commodities where they are needed. In this hybrid algorithm, we use feasible encoding and try to keep feasibility of chromosomes over iterations. By considering some random networks, we show that the proposed algorithm yields reasonable results in a few number of iterations. Also, because this algorithm can be applied in a wide range of objective functions in terms of delay and congestion, it is possible to find some routs for each commodity with high QoS. Due to these outcomes, the presented model and algorithm can be utilized in a variety of application in computer networks and transportation systems to decrease the congestion and increase the usage of channels.     

Processing Optimal Sequenced Route Queries Using Voronoi Diagrams

The Optimal Sequenced Route (OSR) query strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a specific sequence imposed on the types of the locations. In this paper, we propose a pre-computation approach to OSR query in both vector and metric spaces. We exploit the geometric properties of the solution space and theoretically prove its relation to additively weighted Voronoi diagrams. Our approach recursively accesses these diagrams to incrementally build the OSR. Introducing the analogous diagrams for the space of road networks, we show that our approach is also efficiently applicable to this metric space. Our experimental results verify that our pre-computation approach outperforms the previous index-based approaches in terms of query response time. This research has been funded in part by NSF grants EEC-9529152 (IMSC ERC), IIS-0238560 (PECASE), IIS-0324955 (ITR), IIS-0534761, and unrestricted cash gifts from Google and Microsoft. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the NSF.

---

A Wavelet-ANFIS Hybrid Model for Groundwater Level Forecasting for Different Prediction Periods

Artificial neural network (ANN) and Adaptive Neuro-Fuzzy Inference System (ANFIS) have an extensive range of applications in water resources management. Wavelet transformation as a preprocessing approach can improve the ability of a forecasting model by capturing useful information on various resolution levels. The objective of this research is to compare several data-driven models for forecasting groundwater level for different prediction periods. In this study, a number of model structures for Artificial Neural Network (ANN), Adaptive Neuro-Fuzzy Inference System (ANFIS), Wavelet-ANN and Wavelet-ANFIS models have been compared to evaluate their performances to forecast groundwater level with 1, 2, 3 and 4 months ahead under two case studies in two sub-basins. It was demonstrated that wavelet transform can improve accuracy of groundwater level forecasting. It has been also shown that the forecasts made by Wavelet-ANFIS models are more accurate than those by ANN, ANFIS and Wavelet-ANN models. This study confirms that the optimum number of neurons in the hidden layer cannot be always determined by using a specific formula but trial-and-error method. The decomposition level in wavelet transform should be determined according to the periodicity and seasonality of data series. The prediction of these models is more accurate for 1 and 2 months ahead (for example RMSE?=?0.12, E?=?0.93 and R ²?=?0.99 for wavelet-ANFIS model for 1 month ahead) than for 3 and 4 months ahead (for example RMSE?=?2.07, E?=?0.63 and R ²?=?0.91 for wavelet-ANFIS model for 4 months ahead).     

Ranking alternatives in a preferential voting system using fuzzy concepts and data envelopment analysis

In this paper, a new method for aggregating the opinions of experts in a preferential voting system is proposed. The method, which uses fuzzy concept in handling crisp data, is computationally efficient and is able to completely rank the alternatives. Through this method, the number of votes for certain rank position that each alternative receives are first grouped together to form fuzzy numbers. The nearest point to a fuzzy number concept is then used to introduce an artificial ideal alternative. Data envelopment analysis is next used to find the efficiency scores of the alternatives in a pair-wise comparison with the artificial ideal alternative. Alternatives are rank based on these efficiency scores. If the alternatives are not completely ranked, a weight restriction method also based on fuzzy concept is used on the un-discriminated alternatives until they are completely ranked. Two examples are given for illustration of the method.     

Stores clustering using a data mining approach for distributing automotive spare-parts to reduce transportation costs

Clustering of retail stores in a distribution network with specific geographical limits plays an important and effective role in distribution and transportation costs reduction. In this paper, the relevant data and information for an established automotive spare-parts distribution and after-sales services company (ISACO) for a 3-year period have been analyzed. With respect to the diversity and lot size of the available information such as stores location, order, goods, transportation vehicles and road and traffic information, three effecting factors with specific weights have been defined for the similarity function: 1. Euclidean distance, 2. Lot size 3. Order concurrency. Based on these three factors, the similarity function has been examined through 5 steps using the Association Rules principles, where the clustering of the stores is performed using k-means algorithm and similar stores are allocated to the clusters. These steps include: 1. Similarity function based on the Euclidean distances, 2. Similarity function based on the order concurrency, 3. Similarity function based on the combination of the order concurrency and lot size, 4. Similarity function based on the combination of these three factors and 5. Improved similarity function. The above mentioned clustering operation for each 5 cases addressed in data mining have been carried out using R software and the improved combinational function has been chosen as the optimal clustering function. Then, trend of each retail store have been analyzed using the improved combinational function and along with determining the priority of the depot center establishment for every cluster, the appropriate distribution policies have been formulated for every cluster. The obtained results of this study indicate a significant cost reduction (32%) in automotive spare-parts distribution and transportation costs.     

Robust matrix 𝒟U‐stability analysis

In this paper, the problem of robust matrix root‐clustering is addressed. The studied matrices are subject to both polytopic and unstructured uncertainties. An original point is the large choice of clustering regions enabled by the proposed approach since these regions can be unions of possibly disjoint and non‐symmetric subregions of the complex plane. The precise purpose is, considering a specified polytope, to determine the greatest robustness bound on the unstructured uncertainty such that robust matrix root‐clustering is ensured. To reduce conservatism in the derivation of the bound, the reasoning relies on a framework based upon parameter‐dependent Lyapunov functions. The bound value is computed by solving an ?? ?? ? problem. Copyright © 2003 John Wiley & Sons, Ltd.     

Design of Second Order Sliding Mode and Sliding Mode Algorithms: A Practical Insight to DC-DC Buck Converter

This paper presents a simple and systematic approach to design second order sliding mode controller for buck converters. The second order sliding mode control (SOSMC) based on twisting algorithm has been implemented to control buck switch mode converter. The idea behind this strategy is to suppress chattering and maintain robustness and finite time convergence properties of the output voltage error to the equilibrium point under the load variations and parametric uncertainties. In addition, the influence of the twisting algorithm on the performance of closed-loop system is investigated and compared with other algorithms of first order sliding mode control such as adaptive sliding mode control (ASMC), nonsingular terminal sliding mode control (NTSMC).In comparative evaluation, the transient response of the output voltage with the step change in the load and the start-up response of the output voltage with the step change in the input voltage of buck converter were compared. Experimental results were obtained from a hardware setup constructed in laboratory. Finally, for all of the surveyed control methods, the theoretical considerations, numerical simulations, and experimental measurements from a laboratory prototype are compared for different operating points. It is shown that the proposed twisting method presents an improvement in steady state error and settling time of output voltage during load changes.      

Magnetic Mixed Hemimicelles Solid-Phase Extraction of Three Food Colorants from Real Samples

Introducing a specific clean extraction procedure with a minimal matrices effect for food colorant determination is still a challengeable topic and highly recommended. Mixed hemimicelle solid-phase extraction method, based on cetyltrimethylammonium bromide-coated Fe₃O₄/SiO₂ nanoparticles as a novel, simple, and fast preconcentration method, was applied for preconcentration and fast isolation of three synthetic food colorants in foodstuff matrices prior to HPLC-UV-vis determination. The influence of different parameters on extraction efficiency such as surfactant amount, sample pH, time of extraction, desorption condition, and nanoparticles concentration was optimized. Under the optimized conditions, a preconcentration factor of 100 was achieved by extracting 10 mL sample. The limit of detection for the three synthetic food colorants including Tartrazine, Sunset yellow FCF, and Quinoline yellow is 2.50, 1.25, and 2.12 μg/L, respectively. The proposed method was applicable for extraction and preconcentration of three food colorants in various food samples with the food dye contents in the range of 13–105 μg/L.