Miracle-dz/UniFAR-FTUs huggingface dataset:
Rates of multivariate normal approximation for statistics in geometric probability

We employ stabilization methods and second order Poincar\'e inequalities to establish rates of multivariate normal convergence for a large class of vectors $(H_s^{(1)},. ,H_s^{(m)})$, $s \geq 1$, of statistics of marked Poisson processes on $\mathbb{R}^d$, $d \geq 2$, as the intensity parameter $s$ tends to infinity. Our results are applicable whenever the constituent functionals $H_s^{(i)}$, $i\in\{1,. ,m\}$, are expressible as sums of exponentially stabilizing score functions satisfying a moment condition. The rates are for the $d_2$-, $d_3$-, and $d_{convex}$-distances. When we compare with a centered Gaussian random vector, whose covariance matrix is given by the asymptotic covariances, the rates are in general unimprovable and are governed by the rate of convergence of $s^{-1} {\rm Cov}( H_s^{(i)}, H_s^{(j)})$, $i,j\in\{1,. ,m\}$, to the limiting covariance, shown to be of order $s^{-1/d}$. We use the general results to deduce rates of multivariate normal convergence for statistics arising in random graphs and topological data analysis as well as for multivariate statistics used to test equality of distributions. Some of our results hold for stabilizing functionals of Poisson input on suitable metric spaces.
Dev2PQ: Planar Quadrilateral Strip Remeshing of Developable Surfaces

We introduce an algorithm to remesh triangle meshes representing developable surfaces to planar quad dominant meshes. The output of our algorithm consists of planar quadrilateral (PQ) strips that are aligned to principal curvature directions and closely approximate the curved parts of the input developable, and planar polygons representing the flat parts of the input that connect the PQ strips. Developable PQ-strip meshes are useful in many areas of shape modeling, thanks to the simplicity of fabrication from flat sheet material. Unfortunately, they are difficult to model due to their restrictive combinatorics. Other representations of developable surfaces, such as arbitrary triangle or quad meshes, are more suitable for interactive freeform modeling but generally have non-planar faces or are not aligned to principal curvatures. Our method leverages the modeling flexibility of non-ruling-based representations of developable surfaces while still obtaining developable, curvature-aligned PQ-strip meshes. Our algorithm optimizes for a scalar function on the input mesh, such that its isolines are extrinsically straight and align well to the locally estimated ruling directions. The condition that guarantees straight isolines is non-linear of high order and numerically difficult to enforce in a straightforward manner. We devise an alternating optimization method that makes our problem tractable and practical to compute. Our method works automatically on any developable input, including multiple patches and curved folds, without explicit domain decomposition. We demonstrate the effectiveness of our approach on a variety of developable surfaces and show how our remeshing can be used alongside handle-based interactive freeform modeling of developable shapes.
Query Rewriting via Cycle-Consistent Translation for E-Commerce Search

Nowadays e-commerce search has become an integral part of many people’s shopping routines. One critical challenge in today’s e-commerce search is the semantic matching problem where the relevant items may not contain the exact terms in the user query. In this paper, we propose a novel deep neural network based approach to query rewriting, in order to tackle this problem. Specifically, we formulate query rewriting into a cyclic machine translation problem to leverage abundant click log data. Then we introduce a novel cyclic consistent training algorithm in conjunction with state-of-the-art machine translation models to achieve the optimal performance in terms of query rewriting accuracy. In order to make it practical in industrial scenarios, we optimize the syntax tree construction to reduce computational cost and online serving latency. Offline experiments show that the proposed method is able to rewrite hard user queries into more standard queries that are more appropriate for the inverted index to retrieve. Comparing with human curated rule-based method, the proposed model significantly improves query rewriting diversity while maintaining good relevancy. Online A/B experiments show that it improves core e-commerce business metrics significantly. Since the summer of 2020, the proposed model has been launched into our search engine production, serving hundreds of millions of users.
BERT-based Acronym Disambiguation with Multiple Training Strategies

Acronym disambiguation (AD) task aims to find the correct expansions of an ambiguous ancronym in a given sentence. Although it is convenient to use acronyms, sometimes they could be difficult to understand. Identifying the appropriate expansions of an acronym is a practical task in natural language processing. Since few works have been done for AD in scientific field, we propose a binary classification model incorporating BERT and several training strategies including dynamic negative sample selection, task adaptive pretraining, adversarial training and pseudo labeling in this paper. Experiments on SciAD show the effectiveness of our proposed model and our score ranks 1st in SDU@AAAI-21 shared task 2: Acronym Disambiguation.
Controlling relaxation dynamics of excitonic states in monolayer transition metal dichalcogenides WS2 through interface engineering

Transition metal dichalcogenides (TMDs) are known to support complex excitonic states. Revealing the differences in relaxation dynamics among different excitonic species and elucidating the transition dynamics between them may provide important guidelines for designing novel excitonic devices. Combining photoluminescence and reflectance contrast measurements with ultrafast pump-probe spectroscopy at cryogenic temperatures, we herein study the relaxation dynamics of neutral and charged excitons in a back-gate-controlled monolayer device. Pump-probe results reveal quite different relaxation dynamics of excitonic states under different interfacial conditions: while neutral excitons have a much longer lifetime than trions in monolayer WS2, the opposite is true in the WS2/hexagonal boron nitride (h-BN) heterostructure. It is found that the insertion of the h-BN layer between the TMD monolayer and the substrate has a great influence on the lifetimes of different excitonic states. The h-BN flakes can not only screen the effects of impurities and defects at the interface but also help establish a non-radiative transition from neutral excitons to trions to be the dominant relaxation pathway, at cryogenic temperature. Our findings highlight the important role that the interface may play in governing the transient properties of carriers in 2D semiconductors and may also have implications for designing light-emitting and photo-detecting devices based on TMDs.
The Mathematics Behind Spectral Clustering And The Equivalence To PCA

Spectral clustering is a popular algorithm that clusters points using the eigenvalues and eigenvectors of Laplacian matrices derived from the data. For years, spectral clustering has been working mysteriously. This paper explains spectral clustering by dividing it into two categories based on whether the graph Laplacian is fully connected or not. For a fully connected graph, this paper demonstrates the dimension reduction part by offering an objective function: the covariance between the original data points' similarities and the mapped data points' similarities. For a multi-connected graph, this paper proves that with a proper $k$, the first $k$ eigenvectors are the indicators of the connected components. This paper also proves there is an equivalence between spectral embedding and PCA.
Distributed Augmented Lagrangian Method for Link-Based Resource Sharing Problems of Multiagent Systems

A multiagent optimization problem motivated by the management of energy systems is discussed. The associated cost function is separable and convex although not necessarily strongly convex and there exist edge-based coupling equality constraints. In this regard, we propose a distributed algorithm based on solving the dual of the augmented problem. Furthermore, we consider that the communication network might be time-varying and the algorithm might be carried out asynchronously. The time-varying nature and the asynchronicity are modeled as random processes. Then, we show the convergence and the convergence rate of the proposed algorithm under the aforementioned conditions.
A low-degree strictly conservative finite element method for incompressible flows

In this paper, a new $P_{2}-P_{1}$ finite element pair is proposed for incompressible fluid. For this pair, the discrete inf-sup condition and the discrete Korn's inequality hold on general triangulations. It yields exactly divergence-free velocity approximations when applied to models of incompressible flows. The robust capacity of the pair for incompressible flows are verified theoretically and numerically.
A Brief Survey of Current Software Engineering Practices in Continuous Integration and Automated Accessibility Testing

It's long been accepted that continuous integration (CI) in software engineering increases the code quality of enterprise projects when adhered to by it's practitioners. But is any of that effort to increase code quality and velocity directed towards improving software accessibility accommodations? What are the potential benefits quoted in literature? Does it fit with the modern agile way that teams operate in most enterprises? This paper attempts to map the current scene of the software engineering effort spent on improving accessibility via continuous integration and it's hurdles to adoption as quoted by researchers. We also try to explore steps that agile teams may take to train members on how to implement accessibility testing and introduce key diagrams to visualize processes to implement CI based accessibility testing procedures in the software development lifecycle.
Pareto-Frontier-aware Neural Architecture Generation for Diverse Budgets

Designing feasible and effective architectures under diverse computation budgets incurred by different applications/devices is essential for deploying deep models in practice. Existing methods often perform an independent architecture search for each target budget, which is very inefficient yet unnecessary. Moreover, the repeated independent search manner would inevitably ignore the common knowledge among different search processes and hamper the search performance. To address these issues, we seek to train a general architecture generator that automatically produces effective architectures for an arbitrary budget merely via model inference. To this end, we propose a Pareto-Frontier-aware Neural Architecture Generator (NAG) which takes an arbitrary budget as input and produces the Pareto optimal architecture for the target budget. We train NAG by learning the Pareto frontier (i.e., the set of Pareto optimal architectures) over model performance and computational cost (e.g., latency). Extensive experiments on three platforms (i.e., mobile, CPU, and GPU) show the superiority of the proposed method over existing NAS methods.
Parallel Stochastic Mirror Descent for MDPs

We consider the problem of learning the optimal policy for inﬁnite-horizon Markov decision processes (MDPs). For this purpose, some variant of Stochastic Mirror Descent is proposed for convex programming problems with Lipschitz-continuous functionals. An important detail is the ability to use inexact values of functional constraints. We analyze this algorithm in a general case and obtain an estimate of the convergence rate that does not accumulate errors during the operation of the method. Using this algorithm, we get the ﬁrst parallel algorithm for average-reward MDPs with a generative model. One of the main features of the presented method is low communication costs in a distributed centralized setting.
Modelling the Pressure Strain Correlation in turbulent flows using Deep Neural Networks

The pressure strain correlation plays a critical role in the Reynolds stress transport modelling. Accurate modelling of the pressure strain correlation leads to proper prediction of turbulence stresses and subsequently the other terms of engineering interest. However, classical pressure strain correlation models are often unreliable for complex turbulent flows. Machine learning based models have shown promise in turbulence modeling but their application has been largely restricted to eddy viscosity based models. In this article, we outline a rationale for the preferential application of machine learning and turbulence data to develop models at the level of Reynolds stress modeling. As the illustration We develop data driven models for the pressure strain correlation for turbulent channel flow using neural networks. The input features of the neural networks are chosen using physics based rationale. The networks are trained with the high resolution DNS data of turbulent channel flow at different friction Reynolds numbers. The testing of the models are performed for unknown flow statistics at other friction Reynolds numbers and also for turbulent plane Couette flows. Based on the results presented in this article, the proposed machine learning framework exhibits considerable promise and may be utilized for the development of accurate Reynolds stress models for flow prediction.
A Difference-of-Convex Cutting Plane Algorithm for Mixed-Binary Linear Program

In this paper, we propose a cutting plane algorithm based on DC (Difference-of-Convex) programming and DC cut for globally solving Mixed-Binary Linear Program (MBLP). We first use a classical DC programming formulation via the exact penalization to formulate MBLP as a DC program, which can be solved by DCA algorithm. Then, we focus on the construction of DC cuts, which serves either as a local cut (namely type-I DC cut) at feasible local minimizer of MBLP, or as a global cut (namely type-II DC cut) at infeasible local minimizer of MBLP if some particular assumptions are verified. Otherwise, the constructibility of DC cut is still unclear, and we propose to use classical global cuts (such as the Lift-and-Project cut) instead. Combining DC cut and classical global cuts, a cutting plane algorithm, namely DCCUT, is established for globally solving MBLP. The convergence theorem of DCCUT is proved. Restarting DCA in DCCUT helps to quickly update the upper bound solution and to introduce more DC cuts for lower bound improvement. A variant of DCCUT by introducing more classical global cuts in each iteration is proposed, and parallel versions of DCCUT and its variant are also designed which use the power of multiple processors for better performance. Numerical simulations of DCCUT type algorithms comparing with the classical cutting plane algorithm using Lift-and-Project cuts are reported. Tests on some specific samples and the MIPLIB 2017 benchmark dataset demonstrate the benefits of DC cut and good performance of DCCUT algorithms.
Phase-field modeling of selective laser brazing of diamond grits

Diamond grit is widely used in cutting, grinding, and polishing tools for its superior mechanical properties and performance in machining hard materials. Selective laser brazing (SLB) of diamond grits is a new additive manufacturing technique that has great potential to fabricate the next generation of high-performance diamond tools. However, fundamental understanding and quantitative analysis for the design and tuning of the SLB process and the resulting bonding efficiency are not yet established as the process is complicated by heating, fusion, wetting, solidification, grit migration, bonding, reaction, and the interplay between these effects. We present a thermodynamically consistent phase-field theoretical model for the prediction of melting and wetting of SLB on diamond grits using a powder-based additive manufacturing technique. The melting dynamics is driven by laser heating in a chamber filled with argon gas and is coupled with the motion of multiple three-phase contact lines. The relevant wetting dynamics, interfacial morphology, and temperature distribution are computationally resolved in a simplified 2D configuration.
A Differential Testing Approach for Evaluating Abstract Syntax Tree Mapping Algorithms

Abstract syntax tree (AST) mapping algorithms are widely used to analyze changes in source code. Despite the foundational role of AST mapping algorithms, little effort has been made to evaluate the accuracy of AST mapping algorithms, i.e., the extent to which an algorithm captures the evolution of code. We observe that a program element often has only one best-mapped program element. Based on this observation, we propose a hierarchical approach to automatically compare the similarity of mapped statements and tokens by different algorithms. By performing the comparison, we determine if each of the compared algorithms generates inaccurate mappings for a statement or its tokens. We invite 12 external experts to determine if three commonly used AST mapping algorithms generate accurate mappings for a statement and its tokens for 200 statements. Based on the experts' feedback, we observe that our approach achieves a precision of 0.98–1.00 and a recall of 0.65–0.75. Furthermore, we conduct a large-scale study with a dataset of ten Java projects containing a total of 263,165 file revisions. Our approach determines that GumTree, MTDiff and IJM generate inaccurate mappings for 20%–29%, 25%–36% and 21%–30% of the file revisions, respectively. Our experimental results show that state-of-the-art AST mapping algorithms still need improvements.
Condition Sensing for Electricity Infrastructure in Disasters by Mining Public Topics from Social Media

Timely and reliable sensing of infrastructure conditions is critical in disaster management for planning effective infrastructure restorations. Social media, a near real-time information source, has been widely used in disasters for forming timely situational awareness. Yet, using social media to sense electricity infrastructure conditions has not been explored. This study aims to address the research gap through mining public topics from social media. To achieve this purpose, we proposed a systematic and customized approach wherein (1) electricity-related social media data is extracted by the classifier developed based on Bidirectional Encoder Representations from Transformers (BERT); and (2) public topics are modeled with unigrams, bigrams, and trigrams to incorporate the formulaic expressions of infrastructure conditions in social media. Electricity infrastructures in Florida impacted by Hurricane Irma are studied for illustration and demonstration. Results show that the proposed approach is capable of sensing the temporal evolutions and geographic differences of electricity infrastructure conditions.
CHAMP: Characterizing Undesired App Behaviors from User Comments Based on Market Policies

Millions of mobile apps have been available through various app markets. Although most app markets have enforced a number of automated or even manual mechanisms to vet each app before it is released to the market, thousands of low-quality apps still exist in different markets, some of which violate the explicitly specified market policies. In order to identify these violations accurately and timely, we resort to user comments, which can form an immediate feedback for app market maintainers, to identify undesired behaviors that violate market policies, including security-related user concerns. Specifically, we present the first large-scale study to detect and characterize the correlations between user comments and market policies. First, we propose CHAMP, an approach that adopts text mining and natural language processing (NLP) techniques to extract semantic rules through a semi-automated process, and classifies comments into 26 pre-defined types of undesired behaviors that violate market policies. Our evaluation on real-world user comments shows that it achieves both high precision and recall (>0.9) in classifying comments for undesired behaviors. Then, we curate a large-scale comment dataset (over 3 million user comments) from apps in Google Play and 8 popular alternative Android app markets, and apply CHAMP to understand the characteristics of undesired behavior comments in the wild. The results confirm our speculation that user comments can be used to pinpoint suspicious apps that violate policies declared by app markets. The study also reveals that policy violations are widespread in many app markets despite their extensive vetting efforts. CHAMP can be a whistle blower that assigns policy-violation scores and identifies most informative comments for apps.
Li2Sr[MnN]2
: A magnetically ordered metallic nitride

F. Hirschberger, T. J. Ballé, C. Haas, W. Scherer, A. A. Tsirlin, Yu. Prots, P. Höhn, and A. Jesche EP VI, Center for Electronic Correlations and Magnetism, Institute of Physics, University of Augsburg, D-86135 Augsburg, Germany CPM, Institute of Physics, University of Augsburg, D-86135 Augsburg, Germany Max-Planck-Institut für Chemische Physik fester Stoffe, Nöthnitzer Str. 40, D-01187 Dresden, Germany (Dated: March 2, 2021)
Optimal vaccination strategies for COVID-19 based on dynamical social networks with real-time updating

Vaccination strategy is crucial in fighting against the COVID-19 pandemic. Since the supply is limited, contact network-based interventions can be most powerful to set an optimal strategy by identifying high-risk individuals or communities. However, due to the high dimension, only partial and noisy network information can be available in practice, especially for dynamical systems where the contact networks are highly time-variant. Furthermore, numerous mutations of SARS-CoV-2 impact considerably the current infectious probability, requiring real-time network updating algorithms. In this study, we propose a sequential network updating approach based on data assimilation techniques to combine different sources of temporal information. We then prioritise the individuals with high-degree or high-centrality, obtained from the assimilated networks, for vaccination. The assimilation-based approach is compared with the standard method (based on partially observed networks) and a random selection strategy in terms of vaccination effectiveness in a SIR model. The numerical comparison is first carried out using real-world face-to-face dynamical networks collected in a high school, following by sequential multi-layer networks, generated relying on the Barabasi-Albert model emulating the department of Computing at Imperial College London in the UK as an example.