Some picture fuzzy Bonferroni mean operators with their application to multicriteria decision making

In this paper, we extend the Bonferroni mean (BM) operator with the picture fuzzy numbers (PFNs) to propose novel picture fuzzy aggregation operators and demonstrate their application to multicriteria decision making (MCDM). On the basis of the algebraic operational rules of PFNs and BM, we introduce some aggregation operators: the picture fuzzy Bonferroni mean, the picture fuzzy normalized weighted Bonferroni mean, and the picture fuzzy ordered weighted Bonferroni mean. Then, a new picture fuzzy MCDM method is proposed with the help of the proposed operators. Lastly, a practical application of proposed model is given to verify the developed model and related results of the proposed model is compared with the results of the existing models to indicate its applicability.     

A new metaheuristic for optimization: Optics inspired optimization (OIO)

Due to the law of reflection, a concave reflecting surface/mirror causes the incident light rays to converge and a convex surface/mirror causes the light rays to reflect away so that they all appear to be diverging. These converging and diverging behaviors cause that the curved mirrors show different image types depending on the distance between the object and the mirror. We model such optical phenomena metaphorically into the searching process of numerical optimization by a new algorithm called optics inspired optimization (OIO). OIO treats the surface of the numerical function to be optimized as a reflecting surface in which each peak is assumed to reflect as a convex mirror and each valley to reflect as a concave one. Each individual is assumed to be an artificial object (or light point) that its artificially glittered ray is reflected back by the function surface, given that the surface is convex or concave, and the artificial image is formed (a candidate solution is generated within the search domain) based on the mirror equations adopted from physics of optics. Besides OIO, we introduce different variants of it, called ROIO (Rotation based OIO), and COIO (Convex combination based OIO) algorithms and conduct an extensive computational effort to find out the merit of the new algorithms. Our comparisons on benchmark test functions and a real world engineering design application (i.e., optimization of a centrifuge pump) demonstrate that the new algorithms are efficient and compete better than or similar to most of state of the art optimization algorithms with the advantage of accepting few input parameters.     

Optimal resilient power grid operation during the course of a progressing wildfire

We study a two-stage stochastic and nonlinear optimization model for operating a power grid exposed to a natural disaster. Although this approach can be generalized to any natural hazard of continuous (and not instantaneous) nature, our focus is on wildfires. We assume that an approaching wildfire impacts the power grid by reducing the transmission capacity of its overhead lines. At the time when proactive decisions have to be taken, the severity of the wildfire is not known. This introduces uncertainty. In this paper, we extend previous work by more realistically capturing this uncertainty and by strengthening the mathematical programming formulation through standard reformulation techniques. With these reformulation techniques, the resulting two-stage, convex mixed-integer quadratically constrained programming formulation can be efficiently solved using commercial quadratic programming solvers as demonstrated on a case study on a modified version of the IEEE 123-bus test system with 100 scenarios. We also quantify the uncertainties through a second case study using the following three standard metrics of two-stage stochastic optimization: the expected value of perfect information, the expected result of using the expected value solution and the value of the stochastic solution.     

Chest X-ray enhancement to interpret pneumonia malformation based on fuzzy soft set and Dempster–Shafer theory of evidence

Image enhancement algorithms are commonly used to increase the contrast and visual quality of low-dose x-ray images. This paper proposes an automated enhancement method using soft fuzzy sets with a new decision-making scheme based on Dempster-Shafer theory of evidence for the visual interpretation of pneumonia malformation in low-dose x-ray images, called as XEFSDS. The XEFSDS model first generates an original source x-ray image into a complementary image, then each original and complement image is applied to the characterized image object and background areas of fuzzy space. The S-function is utilized to define fuzzy soft sets for the classification of gray level ambiguity in both images, and hence a decision criterion via Dempster-Shafer approach and fuzzy interval has been adapted to discriminate uncertainties on the pixel intensity and the spatial information. Modified membership grade operations have been performed on each object/background area, and Werner’s AND/OR operator (an aggregation operator) has been utilized to build a new membership function from two modified membership functions. Finally, an enhanced image is obtained from the new membership function via defuzzification. Experiments on different pneumonia X-ray images demonstrate that the XEFSDS scheme produces better results than the existing methods. To show the advantages of the XEFSDS scheme, we have executed a segmentation based examination on enhanced image for the detection of pneumonia malformation as well as abnormal lobe (lobar pneumonia) or bronchopneumonia.     

Regulator problem for uncertain linear discrete-time systems with constrained control

A necessary and sufficient condition to test the robustness of a regulator of uncertain linear systems with constrained control is given. The candidate regulator for this test is that stabilizing nominal systems. An illustrative example is also given.     

Fuzzy Weirstrass theorem and convex fuzzy mappings

The convexity and continuity of fuzzy mappings are defined through a linear ordering and a metric on the set of fuzzy numbers. The local-global minimum property of real-valued convex functions is extended to convex fuzzy mappings. It is proved that a strict local minimizer of a quasiconvex fuzzy mapping is also a strict global minimizer. Characterizations for convex fuzzy mappings and quasiconvex fuzzy mappings are given. In addition, the Weirstrass theorem is extended from real-valued functions to fuzzy mappings.     

基于Vague集的鱼雷研制阶段年度投资分配模型

鱼雷的研制费用在鱼雷整个寿命周期费用中所占比系不大，但研制阶段决定了鱼雷寿命周期费用的绝大部分，闪此对鱼雷研制费用的研究可供鱼雷武器管理和决策者作经费计划综合平衡时参考。文章基于Vague集，提出了Vague集模糊熵的构造方法，进而提出了运用Vague集模糊熵进行鱼雷研制阶段年度投资强度分配的新模型。实例表明，该方法具有实用价值。     

A new stereological principle for test lines in three-dimensional space

A new principle is presented to generate isotropic uniform random (IUR) test lines hitting a geometric structure in three-dimensional space (3D). The principle therefore concerns the estimation of surface area, volume, membrane thickness, etc., of arbitrary structures with piecewise smooth boundary. The principle states that a point-sampled test line on an isotropic plane through a fixed point in 3D is effectively an invariant test line in 3D. Particular attention is devoted to the stereology of particles, where an alternative to the surfactor method is obtained to estimate surface area. An interesting case arises when the particle is convex. The methods are illustrated with synthetic examples.     

Nonlinear model predictive control with polytopic invariant sets

Ellipsoidal invariant sets have been widely used as target sets in model predictive control (MPC). These sets can be computed by constructing appropriate linear difference inclusions together with additional constraints to ensure that the ellipsoid lies within a given inclusion polytope. The choice of inclusion polytope has a significant effect on the size of the target ellipsoid, but the optimal inclusion polytope cannot in general be computed systematically. This paper shows that use of polytopic invariant sets overcomes this difficulty, allowing larger stabilizable sets without loss of performance. In the interests of online efficiency, consideration is focused on interpolation-based MPC.