Modeling unaccounted-for gas among residential natural gas consumers using a comprehensive fuzzy cognitive map

Residential natural gas consumption depends on several factors. Available tools and methods to identify, categorize, and validate effective factors have some limitations, making consumption modeling more complex. Once a comprehensive model of effective consumption factors is developed for residential gas consumers, it can predict consumption. In addition, such a model could be used to verify the accuracy of measuring devices in order to reduce unaccounted for gas (UFG). The key factors affecting residential gas consumption were identified based on previous studies and their mutual effects were analyzed using a fuzzy cognitive mapping (FCM) method. The most significant factors and their effects on natural gas consumption in the residential sector were determined. In this study, for the first time, the expected consumption for each consumer was estimated using a consumption index. Generally, if the estimated consumption is significantly different from the amount recorded by the meter, it could suggest a potential source of UFG. The proposed method was applied to the data collected from the residential gas consumers of a small region in Iran (Dasht-e Arjan region, Fars province), and the results demonstrate the effectiveness of the proposed method.     

基于学科竞赛的中医药类院校程序设计课程教学模式的探索

高素质人才培养是我国可持续发展战略、科教兴国战略以及人才强国战略等多项发展战略的一项基础性工程。本文针对中医药类院校程序设计类课程实践教学模式单一等教学实际，以“学科竞赛”为平台，“赛教结合”为理念，以《C语言程序设计》为例，从现存问题、赛教结合模式的引入、建立实施及其评价机制4个方面展开阐述，旨在提高学生学习积极性和能力。     

Theoretical framework for formulating MIP scheduling models with multiple and non-uniform discrete-time grids

We present a framework for the formulation of MIP scheduling models based on multiple and nonuniform discrete time grids. In a previous work we showed that it is possible to use different (possibly non-uniform) time grids for each task, unit, and material. Here, we generalize these ideas to account for general resources, and a range of processing characteristics such as limited intermediate storage and changeovers. Each resource has its own grid based on resource consumption and availability allowing resource constraints to be modeled more accurately without increasing the number of binary variables. We develop algorithms to define the unit-, task-, material-, and resource-specific grids directly from problem data. Importantly, we prove that the multi-grid formulation is able to find a schedule with the same optimal objective as the discrete-time single-grid model with an arbitrarily fine grid. The proposed framework leads to the formulation of models with reduced number of binary variables and constraints, which are able to find good solutions faster than existing models.     

基于Stateflow电力机车变流器控制设计与实现

某出口型号交流电力机车牵引控制系统要求变流器控制逻辑具备接触器控制、牵引系统数据交互、变流器故障保护、变流器启动自检等功能。针对以上功能,基于MATLAB中的Simulink/Stateflow可视化编程工具进行牵引控制模型的搭建,遵循模块化编程理念,采用较少的程序代码编写实现复杂的逻辑控制模型,生成逻辑清晰的控制功能流程图,进行半实物仿真测试,增强控制模型的可靠性。通过该变流器产品型式试验检验,验证变流器控制逻辑的功能可以满足控制系统的需求。     

Exactly satisfying initial conditions neural network models for numerical treatment of first Painlevé equation

In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.     

Simultaneous synthesis of a heat exchanger network with multiple utilities using utility substages

Heat exchanger network synthesis (HENS) has progressed by using mathematical programming-based simultaneous methodology. Although various considerations such as non-isothermal mixing and bypass streams are applied to consider real world alternatives in modeling phase, many challenges are faced because of its properties within non-convex mixed-integer nonlinear programming (MINLP). We propose a modified superstructure, which contains a utility substage for use in considering multiple utilities in a simultaneous MINLP model. To improve model size and convergence, fixed utility locations according to temperature and series connections between utilities are suggested. The numbers of constraints, discrete, and continuous variables show that overall model size decreases compared with previous research. Thus, it is possible to expand the feasible search area for reaching the nearest global solution. The model's effectiveness and applications are exemplified by several literature problems, where it is used to deduce a network superior to that of any other reported methodology.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

Comparative evaluation of different statistical tools for the prediction of uniaxial compressive strength of rocks

In this study, uniaxial compressive strength (UCS), unit weight (UW), Brazilian tensile strength (BTS), Schmidt hardness (SHH), Shore hardness (SSH), point load index (Is₅₀) and P-wave velocity (V_p) properties were determined. To predict the UCS, simple regression (SRA), multiple regression (MRA), artificial neural network (ANN), adaptive neuro-fuzzy inference system (ANFIS) and genetic expression programming (GEP) have been utilized. The obtained UCS values were compared with the actual UCS values with the help of various graphs. Datasets were modeled using different methods and compared with each other. In the study where the performance indice PI_at was used to determine the best performing method, MRA method is the most successful method with a small difference. It is concluded that the mean PI_at equal to 2.46 for testing dataset suggests the superiority of the MRA, while these values are 2.44, 2.33, and 2.22 for GEP, ANFIS, and ANN techniques, respectively. The results pointed out that the MRA can be used for predicting UCS of rocks with higher capacity in comparison with others. According to the performance index assessment, the weakest model among the nine model is P7, while the most successful models are P2, P9, and P8, respectively.     

A practical assessment of risk-averse approaches in production lot-sizing problems

ABSTRACT

This paper presents an empirical assessment of four state-of-the-art risk-averse approaches to deal with the capacitated lot-sizing problem under stochastic demand. We analyse two mean-risk models based on the semideviation and on the conditional value-at-risk risk measures, and alternate first and second-order stochastic dominance approaches. The extensive computational experiments based on different instances characteristics and on a case-study suggest that CVaR exhibits a good trade-off between risk and performance, followed by the semideviation and first-order stochastic dominance approach. For all approaches, enforcing risk-aversion helps to reduce the cost-standard deviation substantially, which is usually accomplished via increasing production rates. Overall, we can say that very risk-averse decision-makers would be willing to pay an increased price to have a much less risky solution given by CVaR. In less risk-averse settings, though, semideviation and first-order stochastic dominance can be appealing alternatives to provide significantly more stable production planning costs with a marginal increase of the expected costs.     

Genetic algorithm and self organizing map based fuzzy hybrid intelligent method for color image segmentation

The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods.