scholarly journals Fast and Robust Diagnostic Technique for the Detection of High Leverage Points

2020 ◽  
Vol 28 (4) ◽  
Author(s):  
Habshah Midi ◽  
Jayanthi Arasan ◽  
Hassan Uraibi ◽  
Hasan Talib Hendi
Keyword(s):  
Computing Time ◽  
Diagnostic Technique ◽  
Real Data ◽  
The Other ◽  
Minimum Volume ◽  
Index Set ◽  
Leverage Points ◽  
Diagnostic Measure ◽  
Generalized Potential ◽  
Minimum Volume Ellipsoid

High Leverage Points (HLPs) are outlying observations in the X -directions. It is very imperative to detect HLPs because the computed values of various estimates are affected by their presence. It is now evident that Diagnostic Robust Generalized Potential which is based on the Minimum Volume Ellipsoid (DRGP(MVE)) is capable of detecting multiple HLPs. However, it takes very long computational running times. Another diagnostic measure which is based on Index Set Equality denoted as DRGP(ISE) is put forward with the main aim of reducing its running time. Nonetheless, it is computationally not stable and still suffers from masking and swamping effects. Hence, in this paper, we propose another version of diagnostic measure which is based on Reweighted Fast Consistent and High Breakdown (RFCH) estimators. We call this measure Diagnostic Robust Generalized Potential based on √n RFCH and it is denoted by DRGP(RFCH). The results of simulation study and real data indicate that our proposed method outperformed the other two methods in term of having the least computing time, highest percentage of correct detection of HLPs and smallest percentage of swamping and masking effects compared to the DRGP(MVE) and DRGP (ISE).

scholarly journals Prediction of Fuel Poverty Potential Risk Index Using Six Regression Algorithms: A Case-Study of Chilean Social Dwellings

2021 ◽  
Vol 13 (5) ◽  
pp. 2426
Author(s):  
David Bienvenido-Huertas ◽  
Jesús A. Pulido-Arcas ◽  
Carlos Rubio-Bellido ◽  
Alexis Pérez-Fargallo
Keyword(s):  
Low Income ◽  
Potential Risk ◽  
Energy Use ◽  
Risk Index ◽  
Computing Time ◽  
Simulated Data ◽  
Real Data ◽  
Support Vector ◽  
Energy Poverty ◽  
Regression Algorithms

In recent times, studies about the accuracy of algorithms to predict different aspects of energy use in the building sector have flourished, being energy poverty one of the issues that has received considerable critical attention. Previous studies in this field have characterized it using different indicators, but they have failed to develop instruments to predict the risk of low-income households falling into energy poverty. This research explores the way in which six regression algorithms can accurately forecast the risk of energy poverty by means of the fuel poverty potential risk index. Using data from the national survey of socioeconomic conditions of Chilean households and generating data for different typologies of social dwellings (e.g., form ratio or roof surface area), this study simulated 38,880 cases and compared the accuracy of six algorithms. Multilayer perceptron, M5P and support vector regression delivered the best accuracy, with correlation coefficients over 99.5%. In terms of computing time, M5P outperforms the rest. Although these results suggest that energy poverty can be accurately predicted using simulated data, it remains necessary to test the algorithms against real data. These results can be useful in devising policies to tackle energy poverty in advance.

scholarly journals Theory and Applications of the Unit Gamma/Gompertz Distribution

Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1850
Author(s):  
Rashad A. R. Bantan ◽  
Farrukh Jamal ◽  
Christophe Chesneau ◽  
Mohammed Elgarhy
Keyword(s):  
Stochastic Ordering ◽  
Real Data ◽  
Rate Function ◽  
The Other ◽  
Likelihood Method ◽  
Model Parameters ◽  
Data Sets ◽  
Gompertz Distribution ◽  
Probability And Statistics ◽  
Analytical Behavior

Unit distributions are commonly used in probability and statistics to describe useful quantities with values between 0 and 1, such as proportions, probabilities, and percentages. Some unit distributions are defined in a natural analytical manner, and the others are derived through the transformation of an existing distribution defined in a greater domain. In this article, we introduce the unit gamma/Gompertz distribution, founded on the inverse-exponential scheme and the gamma/Gompertz distribution. The gamma/Gompertz distribution is known to be a very flexible three-parameter lifetime distribution, and we aim to transpose this flexibility to the unit interval. First, we check this aspect with the analytical behavior of the primary functions. It is shown that the probability density function can be increasing, decreasing, “increasing-decreasing” and “decreasing-increasing”, with pliant asymmetric properties. On the other hand, the hazard rate function has monotonically increasing, decreasing, or constant shapes. We complete the theoretical part with some propositions on stochastic ordering, moments, quantiles, and the reliability coefficient. Practically, to estimate the model parameters from unit data, the maximum likelihood method is used. We present some simulation results to evaluate this method. Two applications using real data sets, one on trade shares and the other on flood levels, demonstrate the importance of the new model when compared to other unit models.

scholarly journals Fast Split Bregman Based Deconvolution Algorithm for Airborne Radar Imaging

2020 ◽  
Vol 12 (11) ◽  
pp. 1747 ◽  
Author(s):  
Yin Zhang ◽  
Qiping Zhang ◽  
Yongchao Zhang ◽  
Jifang Pei ◽  
Yulin Huang ◽  
...  
Keyword(s):  
Real Time ◽  
Computing Time ◽  
Real Data ◽  
Radar Imaging ◽  
Matrix Inversion ◽  
Airborne Radar ◽  
Split Bregman ◽  
Regularization Problem ◽  
Azimuth Resolution ◽  
Split Bregman Algorithm

Deconvolution methods can be used to improve the azimuth resolution in airborne radar imaging. Due to the sparsity of targets in airborne radar imaging, an L 1 regularization problem usually needs to be solved. Recently, the Split Bregman algorithm (SBA) has been widely used to solve L 1 regularization problems. However, due to the high computational complexity of matrix inversion, the efficiency of the traditional SBA is low, which seriously restricts its real-time performance in airborne radar imaging. To overcome this disadvantage, a fast split Bregman algorithm (FSBA) is proposed in this paper to achieve real-time imaging with an airborne radar. Firstly, under the regularization framework, the problem of azimuth resolution improvement can be converted into an L 1 regularization problem. Then, the L 1 regularization problem can be solved with the proposed FSBA. By utilizing the low displacement rank features of Toeplitz matrix, the proposed FSBA is able to realize fast matrix inversion by using a Gohberg–Semencul (GS) representation. Through simulated and real data processing experiments, we prove that the proposed FSBA significantly improves the resolution, compared with the Wiener filtering (WF), truncated singular value decomposition (TSVD), Tikhonov regularization (REGU), Richardson–Lucy (RL), iterative adaptive approach (IAA) algorithms. The computational advantage of FSBA increases with the increase of echo dimension. Its computational efficiency is 51 times and 77 times of the traditional SBA, respectively, for echoes with dimensions of 218 × 400 and 400 × 400 , optimizing both the image quality and computing time. In addition, for a specific hardware platform, the proposed FSBA can process echo of greater dimensions than traditional SBA. Furthermore, the proposed FSBA causes little performance degradation, when compared with the traditional SBA.

Hands Stencils in El Castillo Cave (Puente Viesgo, Cantabria, Spain). An Interdisciplinary Study

2021 ◽  
pp. 1-21
Author(s):  
Sergio Ripoll ◽  
Vicente Bayarri ◽  
Francisco J. Muñoz ◽  
Ricardo Ortega ◽  
Elena Castillo ◽  
...  
Keyword(s):  
High Resolution ◽  
Real Data ◽  
Digital Processing ◽  
The Other ◽  
Major Step ◽  
The People ◽  
High Resolution Images ◽  
Real Picture ◽  
Interdisciplinary Study ◽  
Very High

Our Palaeolithic ancestors did not make good representations of themselves on the rocky surfaces of caves and barring certain exceptions – such as the case of La Marche (found on small slabs of stone or plaquettes) or the Cueva de Ambrosio – the few known examples can only be referred to as anthropomorphs. As such, only hand stencils give us a real picture of the people who came before us. Hand stencils and imprints provide us with a large amount of information that allows us to approach not only their physical appearance but also to infer less tangible details, such as the preferential use of one hand over the other (i.e., handedness). Both new and/or mature technologies as well as digital processing of images, computers with the ability to process very high resolution images, and a more extensive knowledge of the Palaeolithic figures all help us to analyse thoroughly the hands in El Castillo cave. The interdisciplinary study presented here contributes many novel developments based on real data, representing a major step forward in knowledge about our predecessors.

scholarly journals Antioptimization of earthquake exitation and response

1998 ◽  
Vol 4 (1) ◽  
pp. 1-19 ◽  
Author(s):  
G. Zuccaro ◽  
I. Elishakoff ◽  
A. Baratta
Keyword(s):  
Historical Data ◽  
Dimensional Space ◽  
Stochastic Approach ◽  
Viable Alternative ◽  
Maximum Response ◽  
Minimum Volume ◽  
Earthquake Excitation ◽  
Novel Approach ◽  
Space Modeling ◽  
Minimum Volume Ellipsoid

The paper presents a novel approach to predict the response of earthquake-excited structures. The earthquake excitation is expanded in terms of series of deterministic functions. The coefficients of the series are represented as a point inN-dimensional space. Each available ccelerogram at a certain site is then represented as a point in the above space, modeling the available fragmentary historical data. The minimum volume ellipsoid, containing all points, is constructed. The ellipsoidal models of uncertainty, pertinent to earthquake excitation, are developed. The maximum response of a structure, subjected to the earthquake excitation, within ellipsoidal modeling of the latter, is determined. This procedure of determining least favorable response was termed in the literature (Elishakoff, 1991) as an antioptimization. It appears that under inherent uncertainty of earthquake excitation, antioptimization analysis is a viable alternative to stochastic approach.

scholarly journals Comparison of synchronous and asynchronous parallelization of extreme surrogate-assisted multi-objective evolutionary algorithm

2020 ◽  
Author(s):  
Tomohiro Harada ◽  
Misaki Kaidan ◽  
Ruck Thawonmas
Keyword(s):  
Machine Learning ◽  
Evolutionary Algorithm ◽  
Optimization Problems ◽  
Computing Time ◽  
The Other ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Evaluation Time ◽  
Surrogate Function

Abstract This paper investigates the integration of a surrogate-assisted multi-objective evolutionary algorithm (MOEA) and a parallel computation scheme to reduce the computing time until obtaining the optimal solutions in evolutionary algorithms (EAs). A surrogate-assisted MOEA solves multi-objective optimization problems while estimating the evaluation of solutions with a surrogate function. A surrogate function is produced by a machine learning model. This paper uses an extreme learning surrogate-assisted MOEA/D (ELMOEA/D), which utilizes one of the well-known MOEA algorithms, MOEA/D, and a machine learning technique, extreme learning machine (ELM). A parallelization of MOEA, on the other hand, evaluates solutions in parallel on multiple computing nodes to accelerate the optimization process. We consider a synchronous and an asynchronous parallel MOEA as a master-slave parallelization scheme for ELMOEA/D. We carry out an experiment with multi-objective optimization problems to compare the synchronous parallel ELMOEA/D with the asynchronous parallel ELMOEA/D. In the experiment, we simulate two settings of the evaluation time of solutions. One determines the evaluation time of solutions by the normal distribution with different variances. On the other hand, another evaluation time correlates to the objective function value. We compare the quality of solutions obtained by the parallel ELMOEA/D variants within a particular computing time. The experimental results show that the parallelization of ELMOEA/D significantly reduces the computational time. In addition, the integration of ELMOEA/D with the asynchronous parallelization scheme obtains higher quality of solutions quicker than the synchronous parallel ELMOEA/D.

scholarly journals The Arithmetic Tutte polynomial of two matrices associated to Trees

2018 ◽  
Vol 6 (1) ◽  
pp. 310-322
Author(s):  
R. B. Bapat ◽  
Sivaramakrishnan Sivasubramanian
Keyword(s):  
Analogous Result ◽  
Polynomial Matrix ◽  
Tutte Polynomial ◽  
Distance Matrix ◽  
Minimum Volume ◽  
Maximum Volume ◽  
Recent Interest ◽  
Minimum Volume Ellipsoid ◽  
Tutte Polynomials ◽  
Exponential Distance

Abstract Arithmetic matroids arising from a list A of integral vectors in Zn are of recent interest and the arithmetic Tutte polynomial MA(x, y) of A is a fundamental invariant with deep connections to several areas. In this work, we consider two lists of vectors coming from the rows of matrices associated to a tree T. Let T = (V, E) be a tree with |V| = n and let LT be the q-analogue of its Laplacian L in the variable q. Assign q = r for r ∈ ℤ with r/= 0, ±1 and treat the n rows of LT after this assignment as a list containing elements of ℤn. We give a formula for the arithmetic Tutte polynomial MLT (x, y) of this list and show that it depends only on n, r and is independent of the structure of T. An analogous result holds for another polynomial matrix associated to T: EDT, the n × n exponential distance matrix of T. More generally, we give formulae for the multivariate arithmetic Tutte polynomials associated to the list of row vectors of these two matriceswhich shows that even the multivariate arithmetic Tutte polynomial is independent of the tree T. As a corollary, we get the Ehrhart polynomials of the following zonotopes: - ZEDT obtained from the rows of EDT and - ZLT obtained from the rows of LT. Further, we explicitly find the maximum volume ellipsoid contained in the zonotopes ZEDT, ZLT and show that the volume of these ellipsoids are again tree independent for fixed n, q. A similar result holds for the minimum volume ellipsoid containing these zonotopes.

Sign in / Sign up

Export Citation Format

Share Document