Robust optimal operation of continuous catalytic reforming process under feedstock uncertainty

The continuous catalytic regenerative (CCR) reforming process is one of the most significant sources of hydrogen production in the petroleum refining process. However, the fluctuations in feedstock composition and flow rate could significantly affect both product distribution and energy consumption. In this study, a robust deviation criterion based multi-objective optimization approach is proposed to perform the optimal operation of CCR reformer under feedstock uncertainty, with simultaneous maximization of product yields and minimization of energy consumption. Minimax approach is adopted to handle these uncertain objectives, and the Latin hypercube sampling method is then used to calculate these robust deviation criteria. Multi-objective surrogate-based optimization methods are next introduced to effectively solve the robust operational problem with high computational cost. The level diagram method is finally utilized to assist in multi-criteria decision-making. Two robust operational optimization problems with different objectives are solved to demonstrate the effectiveness of the proposed method for robust optimal operation of the CCR reforming process under feedstock uncertainty.     

Efficient Flexible M-Tree Bulk Loading Using FastMap and Space-Filling Curves

Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve, thereby significantly improving the index construction and search performance. Our second algorithm is an extension of the first, and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance. Through the use of various synthetic and real-world datasets, the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.     

A robust model-free controller for a three-phase grid-connected photovoltaic system based on ultra-local model

In this paper, a robust model-free controller for a grid-connected photovoltaic (PV) system is designed. The system consists of a PV generator connected to a three-phase grid by a DC/AC converter. The control objectives of the overall system are to extract maximum power from the PV source, to control reactive power exchange and to improve the quality of the current injected into the grid. The model-free control technique is based on the use of an ultra-local model instead of the dynamic model of the overall system. The local model is continuously updated based on a numerical differentiator using only the input–output behavior of the controlled system. The model-free controller consists of a classical feedback controller and a compensator for the effects of internal parameter changes and external disturbances. Simulation results illustrate the efficiency of the controller for grid-connected PV systems.     

Context-free grammars to detect straight segments and a novel polygonal approximation method

A new method for the polygonal approximation is presented. The method is based on the search for break points through a context-free grammar, that accepts digital straight segments with loss of information, as well as the decrease in the error committed employing the comparison of a tolerable error. We present an application of our method to different sets of objects widely used, as well as a comparison of our results with the best results reported in the literature, proving that our method achieves better values of error criteria. Besides, a new way to find polygonal approximations, with context-free grammars to recognize digital straight segments without loss of pixels, it is also addressed.     

Flexible Distribution-Based Regression Models for Count Data: Application to Medical Diagnosis

Abstract

Data mining techniques have been successfully utilized in different applications of significant fields, including medical research. With the wealth of data available within the health-care systems, there is a lack of practical analysis tools to discover hidden relationships and trends in data. The complexity of medical data that is unfavorable for most models is a considerable challenge in prediction. The ability of a model to perform accurately and efficiently in disease diagnosis is extremely significant. Thus, the model must be selected to fit the data better, such that the learning from previous data is most efficient, and the diagnosis of the disease is highly accurate. This work is motivated by the limited number of regression analysis tools for multivariate counts in the literature. We propose two regression models for count data based on flexible distributions, namely, the multinomial Beta-Liouville and multinomial scaled Dirichlet, and evaluated the proposed models in the problem of disease diagnosis. The performance is evaluated based on the accuracy of the prediction which depends on the nature and complexity of the dataset. Our results show the efficiency of the two proposed regression models where the prediction performance of both models is competitive to other previously used regression models for count data and to the best results in the literature.     

Output feedback controller for polytopic systems exploiting the direct searching of the design space

This paper deals with the problem of designing a robust static output feedback controller for polytopic systems. The current research that tackled this problem is mainly based on LMI method, which is conservative by nature. In this paper, a novel approach is proposed, which considers the design space of the controller parameters and iteratively partitions the space to small simplexes. Then, by assessing the stability in each simplex, the solution space for design parameters is directly determined. It has been theoretically proved that, if there exists a feasible solution in the design space, the algorithm can find it. To validate the result of the proposed approach, comparative simulation examples are given to illustrate the performance of the design methodology as compared to those of previous approaches.     

Revisiting rock classification to estimate rock mass properties

This paper presents the results of ongoing research carried out by the author exploring methods to provide a more robust estimate of rock mass properties specifically for use in tunnel design. Data from various large-scale rock mass failures are introduced, including coal pillars. The damage-initiation,spalling-limit approach is compared to the coal pillar database. New comparisons of estimating the geological strength index(GSI) and relationships to estimate the Hoeke Brown failure criterion parameters, mb, s and a, are presented.     

多先验融合的图像显著性目标检测算法

为了更加准确地检测出图像中的显著性目标，提出了多先验融合的显著性目标检测算法。针对传统中心先验对偏离图像中心的显著性目标会出现检测失效的情况，提出在多颜色空间下求显著性目标的最小凸包交集来确定目标的大致位置，以凸包区域中心计算中心先验。同时通过融合策略将凸包区域中心先验、颜色对比先验和背景先验融合并集成到特征矩阵中。最后通过低秩矩阵恢复模型生成结果显著图。在公开数据集MSRA1000和ESSCD上的仿真实验结果表明，MPLRR能够得到清晰高亮的显著性目标视觉效果图，同时F，AUC，MAE等评价指标也比现有的许多方法有明显提升。     

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.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.