Searcharxiv⌕ Search

arXiv subjects

Janelle Domantay

Publications and source records attributed to Janelle Domantay.

3 recordsLinked to original sources

Autonomous atomistic-continuum coupling through uncertainty-aware active learning

We develop an uncertainty-aware surrogate modeling approach for coupling an atomistic kinetic Monte Carlo (KMC) surface-chemistry solver with a continuum multi-species fluid dynamics solver across disparate physical length and time scales. The surrogate model predicts boundary mass fluxes for six species and their uncertainties, which the continuum solver monitors to automatically trigger additional KMC simulations when new training data are needed. This enables efficient multiscale coupling and maintains a user-specified level of accuracy. We demonstrate the approach for reactive halide-perovskite vapor deposition, which involves a multi-species vapor jet impinging on a reactive substrate. The KMC solver uses a DFT-calibrated energetics model that we construct as part of this work and provides net deposition and desorption rates for six species. With a conservative uncertainty threshold, the surrogate-coupled approach reproduces cumulative mass fluxes of the directly coupled approach with errors typically within 10-20%, while capturing the non-monotonic dependence of net deposition on species partial pressure. Importantly, the results show that detailed crystal structure need not be explicitly represented to predict quantities exchanged between atomistic and continuum solvers; species-resolved mass fluxes provide a sufficiently low-dimensional representation of the atomistic response. For this accuracy target, the autonomous online-learning approach reduces the number of required atomistic simulations by two to three orders of magnitude relative to direct multiscale coupling.

physics.comp-ph↗

How Facial Features Convey Attention in Stationary Environments

Awareness detection technologies have been gaining traction in a variety of enterprises; most often used for driver fatigue detection, recent research has shifted towards using computer vision technologies to analyze user attention in environments such as online classrooms. This paper aims to extend previous research on distraction detection by analyzing which visual features contribute most to predicting awareness and fatigue. We utilized the open source facial analysis toolkit OpenFace in order to analyze visual data of subjects at varying levels of attentiveness. Then, using a Support-Vector Machine (SVM) we created several prediction models for user attention and identified Histogram of Oriented Gradients (HOG) and Action Units to be the greatest predictors of the features we tested. We also compared the performance of this SVM to deep learning approaches that utilize Convolutional and/or Recurrent neural networks (CNN's and CRNN's). Interestingly, CRNN's did not appear to perform significantly better than their CNN counterparts. While deep learning methods achieved greater prediction accuracy, SVMs utilized less resources and, using certain parameters, were able to approach the performance of deep learning methods.

cs.CV↗

The Optimization of Signed Trees

A signed graph $G$ is a graph where each edge is assigned a + (positive edge) or a - (negative edge). The signed degree of a vertex $v$ in a signed graph, denoted by $sdeg(v)$, is the number of positive edges incident to $v$ subtracted by the number of negative edges incident to $v$. Finally, we say $G$ realizes the set $D$ if: $$ D = \{sdeg(v) \text{ : } v\in V(G) \}. $$ The topic of signed degree sets and signed degree sequences has been studied from many directions. In this paper, we study properties needed for signed trees to have a given signed degree set. We start by proving that $D$ is the signed degree set of a tree if and only if $1\in D$ or $-1\in D$. Further, for every valid set $D$, we find the smallest diameter that a tree must have to realize $D$. Lastly, for valid sets $D$ with nonnegative numbers, we find the smallest order that a tree must have to realize $D$.

math.CO↗