arXiv subjects

J. Wiart

Publications and source records attributed to J. Wiart.

5 recordsLinked to original sources

arXiv2024

Modeling the Spatial Distributions of Macro Base Stations with Homogeneous Density: Theory and Application to Real Networks

Stochastic geometry is a highly studied field in telecommunications as in many other scientific fields. In the last ten years in particular, theoretical knowledge has evolved a lot, whether for the calculation of metrics to characterize interference, coverage, energy or spectral efficiency, or exposure to electromagnetic fields. Many spatial point process models have been developed but are often left aside because of their unfamiliarity, their lack of tractability in favor of the Poisson point process or the regular lattice, easier to use. This article is intended to be a short guide presenting a complete and simple methodology to follow to infer a real stationary macro antenna network using tractable spatial models. The focus is mainly on repulsive point processes and in particular on determinantal point processes which are among the most tractable repulsive point processes. This methodology is applied on Belgian and French cell towers. The results show that for all stationary distributions in France and Belgium, the best inference model is the $\beta$-Ginibre point process.

stat.AP↗

arXiv2022

A Gaussian process based approach for validation of multi-variable measurement systems: application to SAR measurement systems

Resource-efficient and robust validation of systems designed to measure a multi-dimensional parameter space is an unsolved problem as it would require millions of test permutations for comprehensive validation coverage. In the paper, an efficient and comprehensive validation approach based on a Gaussian Process (GP) model of the test system has been developed that can operate system-agnostically, avoids calibration to a fixed set of known validation benchmarks, and supports large configuration spaces. The approach consists of three steps that can be performed independently by different parties: 1) GP model creation, 2) model confirmation, and 3) targeted search for critical cases. It has been applied to two systems that measure specific absorption rate (SAR) for compliance testing of wireless devices and apply different SAR measurement methods: a probe-scanning system (per IEC/IEEE 62209-1528), and a static sensor-array system (per IEC 62209-3). The results demonstrate that the approach is practical, feasible, suitable for proving effective equivalence, and can be applied to any measurement method and implementation. The presented method is sufficiently general to be of value not only for SAR system validation, but also in a wide variety of applications that require critical, independent, and efficient validation.

stat.AP↗

arXiv2021

On the distribution of scrambled $(0,m,s)$-nets over unanchored boxes

We introduce a new quality measure to assess randomized low-discrepancy point sets of finite size $n$. This new quality measure, which we call "pairwise sampling dependence index", is based on the concept of negative dependence. A negative value for this index implies that the corresponding point set integrates the indicator function of any unanchored box with smaller variance than the Monte Carlo method. We show that scrambled $(0,m,s)-$nets have a negative pairwise sampling dependence index. We also illustrate through an example that randomizing via a digital shift instead of scrambling may yield a positive pairwise sampling dependence index.

math.ST↗

arXiv2019

Surrogate modeling based on resampled polynomial chaos expansions

In surrogate modeling, polynomial chaos expansion (PCE) is popularly utilized to represent the random model responses, which are computationally expensive and usually obtained by deterministic numerical modeling approaches including finite element and finite-difference time-domain methods. Recently, efforts have been made on improving the prediction performance of the PCE-based model and building efficiency by only selecting the influential basis polynomials (e.g., via the approach of least angle regression). This paper proposes an approach, named as resampled PCE (rPCE), to further optimize the selection by making use of the knowledge that the true model is fixed despite the statistical uncertainty inherent to sampling in the training. By simulating data variation via resampling ($k$-fold division utilized here) and collecting the selected polynomials with respect to all resamples, polynomials are ranked mainly according to the selection frequency. The resampling scheme (the value of $k$ here) matters much and various configurations are considered and compared. The proposed resampled PCE is implemented with two popular selection techniques, namely least angle regression and orthogonal matching pursuit, and a combination thereof. The performance of the proposed algorithm is demonstrated on two analytical examples, a benchmark problem in structural mechanics, as well as a realistic case study in computational dosimetry.

stat.CO↗

arXiv2015

Polynomial-Chaos-based Kriging

Computer simulation has become the standard tool in many engineering fields for designing and optimizing systems, as well as for assessing their reliability. To cope with demanding analysis such as optimization and reliability, surrogate models (a.k.a meta-models) have been increasingly investigated in the last decade. Polynomial Chaos Expansions (PCE) and Kriging are two popular non-intrusive meta-modelling techniques. PCE surrogates the computational model with a series of orthonormal polynomials in the input variables where polynomials are chosen in coherency with the probability distributions of those input variables. On the other hand, Kriging assumes that the computer model behaves as a realization of a Gaussian random process whose parameters are estimated from the available computer runs, i.e. input vectors and response values. These two techniques have been developed more or less in parallel so far with little interaction between the researchers in the two fields. In this paper, PC-Kriging is derived as a new non-intrusive meta-modeling approach combining PCE and Kriging. A sparse set of orthonormal polynomials (PCE) approximates the global behavior of the computational model whereas Kriging manages the local variability of the model output. An adaptive algorithm similar to the least angle regression algorithm determines the optimal sparse set of polynomials. PC-Kriging is validated on various benchmark analytical functions which are easy to sample for reference results. From the numerical investigations it is concluded that PC-Kriging performs better than or at least as good as the two distinct meta-modeling techniques. A larger gain in accuracy is obtained when the experimental design has a limited size, which is an asset when dealing with demanding computational models.

stat.CO↗