Ing. Daniel Vašata, Ph.D.

Stať ve sborníku

Katedra aplikované matematiky

In comparison to buildings, public transportation vehicles including passenger trains represent specific environments typical for cramped interior layouts with narrow aisles, limited number of exits, and various operation conditions resulting in non-standard exit paths such as direct egress to the track level. Therefore, in evacuation modelling, safety analysis of passenger trains may denote a challenging task, especially when using evacuation models originally developed for simulations of evacuation processes from buildings (such as Pathfinder). In this case, several issues can be encountered: lack of validation against relevant experimental data, missing features to simulate non-standard exit path, lack of knowledge which key parameters to adjust and how. This contribution addresses these issues while performing an egress simulation analysis of a rail car of double-deck electric unit class 471 (CityElefant) using Pathfinder. The analysis was based on a full-scale controlled evacuation experiment carried out in Prague in 2018. We introduce a technique for adjusting the Pathfinder model that simulates rail car egress to match the experimental results, and we include sensitivity analysis of key parameters influencing total evacuation time (TET). From the obtained results several conclusions can be drawn: 1. Application of the SFPE curve for a speed-density relationship had a significant impact on TET due to narrow aisles and limited space available; 2. The parameters of agent diameter and squeeze factor have to be handled together (when associating the agent diameter with the width of passenger shoulders, the value of squeeze factor must be decreased); 3. While egressing to the track level, the time delay caused by the preparation and realization of the jump must be implemented adequately to different passenger abilities; The impact of seating preferences of passengers with heterogeneous moving abilities prevails the influence of maximal speed or diameter distribution on TET.

Článek

10.1016/j.ssci.2021.105523

Katedra aplikované matematiky

Passenger trains represent a challenging environment in emergencies, with specific evacuation conditions resulting from the typical layout and interior design inherent to public transportation vehicles. This paper describes a dataset obtained in a full-scale controlled experiment emulating the emergency evacuation of a double-deck electric unit railcar carried out in Prague in 2018. 15 evacuation trials involving 91 participants were conducted under various evacuation scenarios considering different compositions of passenger crowd, exit widths, and exit types (egress to a high platform, to an open rail line using stairs, and a 750 mm jump without any supporting equipment). The study’s main goals were to collect experimental data on the movement conditions in the railcar and to study the impact of various boundary conditions on evacuation process and total evacuation time. Movement characteristics (exit flows, speeds) and human behaviour (pre-movement activities, exiting behaviours) were also analysed. The data obtained was used to validate and adjust a Pathfinder model to capture important aspects of evacuation from the railcar. Furthermore, a series of simulations using this model was performed to provide sensitivity analysis of the influence of crowd composition, exit width, and exit type on total evacuation time. As a key finding, we can conclude that for the case of a standard exit path (platform or stairs) the width of the main exit had the greatest impact on total evacuation time, however, crowd composition played the prevailing role in evacuation scenarios involving a jump.

Stať ve sborníku

10.1109/IJCNN55064.2022.9892364

Katedra aplikované matematiky

Designing faster optimization algorithms is of ever-growing interest. In recent years, learning to learn methods that learn how to optimize demonstrated very encouraging results. Current approaches usually do not effectively include the dynamics of the optimization process during training. They either omit it entirely or only implicitly assume the dynamics of an isolated parameter. In this paper, we show how to utilize the dynamic mode decomposition method for extracting informative features about optimization dynamics. By employing those features, we show that our learned optimizer generalizes much better to unseen optimization problems in short. The improved generalization is illustrated on multiple tasks where training the optimizer on one neural network generalizes to different architectures and distinct datasets.

Stať ve sborníku

10.1007/978-3-030-86340-1_46

Katedra aplikované matematiky

Image inpainting is one of the important tasks in computer vision which focuses on the reconstruction of missing regions in an image. The aim of this paper is to introduce an image inpainting model based on Wasserstein Generative Adversarial Imputation Network. The generator network of the model uses building blocks of convolutional layers with different dilation rates, together with skip connections that help the model reproduce fine details of the output. This combination yields a universal imputation model that is able to handle various scenarios of missingness with sufficient quality. To show this experimentally, the model is simultaneously trained to deal with three scenarios given by missing pixels at random, missing various smaller square regions, and one missing square placed in the center of the image. It turns out that our model achieves high-quality inpainting results on all scenarios. Performance is evaluated using peak signal-to-noise ratio and structural similarity index on two real-world benchmark datasets, CelebA faces and Paris StreetView. The results of our model are compared to biharmonic imputation and to some of the other state-of-the-art image inpainting methods.

Stať ve sborníku

Katedra aplikované matematiky

The MetaDL Challenge 2020 focused on image classification tasks in few-shot settings. This paper describes second best submission in the competition. Our meta learning approach modifies the distribution of classes in a latent space produced by a backbone network for each class in order to better follow the Gaussian distribution. After this operation which we call Latent Space Transform algorithm, centers of classes are further aligned in an iterative fashion of the Expectation Maximisation algorithm to utilize information in unlabeled data that are often provided on top of few labelled instances. For this task, we utilize optimal transport mapping using the Sinkhorn algorithm. Our experiments show that this approach outperforms previous works as well as other variants of the algorithm, using K-Nearest Neighbour algorithm, Gaussian Mixture Models, etc.

Stať ve sborníku

10.1007/978-3-030-50423-6_17

Katedra aplikované matematiky

Missing data is one of the most common preprocessing problems. In this paper, we experimentally research the use of generative and non-generative models for feature reconstruction. Variational Autoencoder with Arbitrary Conditioning (VAEAC) and Generative Adversarial Imputation Network (GAIN) were researched as representatives of generative models, while the denoising autoencoder (DAE) represented non-generative models. Performance of the models is compared to traditional methods k-nearest neighbors (k-NN) and Multiple Imputation by Chained Equations (MICE). Moreover, we introduce WGAIN as the Wasserstein modification of GAIN, which turns out to be the best imputation model when the degree of missingness is less than or equal to 30%. Experiments were performed on real-world and artificial datasets with continuous features where different percentages of features, varying from 10% to 50%, were missing. Evaluation of algorithms was done by measuring the accuracy of the classification model previously trained on the uncorrupted dataset. The results show that GAIN and especially WGAIN are the best imputers regardless of the conditions. In general, they outperform or are comparative to MICE, k-NN, DAE, and VAEAC.

Stať ve sborníku

Katedra aplikované matematiky

One task that is often discussed in a computer vision is the mapping of an image from one domain to a corresponding image in another domain known as image-to-image translation. Currently there are several approaches solving this task. In this paper, we present an enhancement of the UNIT framework that aids in removing its main drawbacks. More specifically, we introduce an additional adversarial discriminator on the latent representation used instead of VAE, which enforces the latent space distributions of both domains to be similar. On MNIST and USPS domain adaptation tasks, this approach greatly outperforms competing approaches.

Stať ve sborníku

10.1007/978-3-030-22744-9_16

Katedra aplikované matematiky

In real-world applications, we can encounter situations when a well-trained model has to be used to predict from a damaged dataset. The damage caused by missing or corrupted values can be either on the level of individual instances or on the level of entire features. Both situations have a negative impact on the usability of the model on such a dataset. This paper focuses on the scenario where entire features are missing which can be understood as a specific case of transfer learning. Our aim is to experimentally research the influence of various imputation methods on the performance of several classification models. The imputation impact is researched on a combination of traditional methods such as k-NN, linear regression, and MICE compared to modern imputation methods such as multi-layer perceptron (MLP) and gradient boosted trees (XGBT). For linear regression, MLP, and XGBT we also propose two approaches to using them for multiple features imputation. The experiments were performed on both real world and artificial datasets with continuous features where different numbers of features, varying from one feature to 50%, were missing. The results show that MICE and linear regression are generally good imputers regardless of the conditions. On the other hand, the performance of MLP and XGBT is strongly dataset dependent. Their performance is the best in some cases, but more often they perform worse than MICE or linear regression.

Článek

10.1088/1751-8121/aa6328

Katedra aplikované matematiky

We demonstrate a one-dimensional magnetic system can exhibit a Cantortype spectrum using an example of a chain graph with δ coupling at the vertices exposed to a magnetic field perpendicular to the graph plane and varying along the chain. If the field grows linearly with an irrational slope, measured in terms of the flux through the loops of the chain, we demonstrate the character of the spectrum relating it to the almost Mathieu operator.

Článek

10.1002/mana.201500219

Katedra aplikované matematiky

The centroid of a subset of math formula with positive volume is a well-known characteristic. An interesting task is to generalize its definition to at least some sets of zero volume. In the presented paper we propose two possible ways how to do that. The first is based on the Hausdorff measure of an appropriate dimension. The second is given by the limit of centroids of ε-neighbourhoods of the particular set when ε goes to 0. For both generalizations we discuss their existence and basic properties. Then we focus on sufficient conditions of existence of the second generalization and on conditions when both generalizations coincide. It turns out that they can be formulated with the help of the Minkowski content, rectifiability, and self-similarity. Since the centroid is often used in stochastic geometry as a centre function for certain particle processes, we present properties that are needed for both generalizations to be valid centre functions. Finally, we also show their continuity on compact convex m-sets with respect to the Hausdorff metric topology.

Článek

10.1017/apr.2016.72

Katedra aplikované matematiky

This paper deals with long-range dependence of random measures on ℝd. By examples, it is demonstrated that one must be careful in order to define it consistently. Therefore, we define long-range dependence by a rather specific second-order condition and provide an equivalent formulation involving the asymptotic behaviour of the Bartlett spectrum near the origin. Then it is shown that the defining condition may be formulated less strictly when the additional isotropy assumption holds. Finally, we present an example of a long-range dependent random measure based on the 0-level excursion set of a Gaussian random field for which the corresponding spectral density and its asymptotics are explicitly derived.