Miracle-dz/UniFAR-FTUs huggingface dataset:
Tunable Magnetism and Insulator–Metal Transition in Bilayer Perovskites

Two-dimensional (2D) transition-metal oxide perovskites greatly expand the field of available 2D multifunctional material systems. Here, based on density functional theory calculations, we predicted the presence of ferromagnetism orders accompanying with an insulator-metal phase transition in bilayer $KNbO_{3}$ and $KTaO_{3}$ by applying strain engineering and/or external electric field. Our results will contribute to the applications of few-layer transition metal oxide perovskites in the emerging spintronics and straintronics.
Accelerate Your CNN from Three Dimensions: A Comprehensive Pruning Framework

To deploy a pre-trained deep CNN on resource-constrained mobile devices, neural network pruning is often used to cut down the model's computational cost. For example, filter-level pruning (reducing the model's width) or layer-level pruning (reducing the model's depth) can both save computations with some sacrifice of accuracy. Besides, reducing the resolution of input images can also reach the same goal. Most previous methods focus on reducing one or two of these dimensions (i.e., depth, width, and image resolution) for acceleration. However, excessive reduction of any single dimension will lead to unacceptable accuracy loss, and we have to prune these three dimensions comprehensively to yield the best result. In this paper, a simple yet effective pruning framework is proposed to comprehensively consider these three dimensions. Our framework falls into two steps: 1) Determining the optimal depth (d*), width (w*), and image resolution (r) for the model. 2) Pruning the model in terms of (d*, w*, r*). Specifically, at the first step, we formulate model acceleration as an optimization problem. It takes depth (d), width (w) and image resolution (r) as variables and the model's accuracy as the optimization objective. Although it is hard to determine the expression of the objective function, approximating it with polynomials is still feasible, during which several properties of the objective function are utilized to ease and speedup the fitting process. Then the optimal d*, w* and r* are attained by maximizing the objective function with Lagrange multiplier theorem and KKT conditions. Extensive experiments are done on several popular architectures and datasets. The results show that we have outperformd the state-of-the-art pruning methods. The code will be published soon.
Nonperturbative and higher order perturbative effects in deep inelastic 
ντ/ν¯τ
-nucleon scattering

The effect of nonperturbative and higher order perturbative corrections to all the free nucleon structure functions ($F_{iN}(x,Q^2); i=1-5$) in the DIS of $\nu_\tau/{\bar\nu}_\tau$ on nucleon is studied. The target mass correction (TMC) and higher twist (HT) effects are incorporated following the works of Kretzer et al. and Dasgupta et al., respectively. The evaluation of the nucleon structure functions has been performed by using the MMHT 2014 parameterization of the parton distribution functions (PDFs). The calculations have been performed at the next-to-leading(NLO) order. These nucleon structure functions (SF) are used to calculate the DIS cross section by further including the kinematical corrections due to $\tau$-lepton mass. Due to the inclusion of lepton mass two additional structure functions $F_{4N}(x,Q^2)$ and $F_{5N}(x,Q^2)$ become non-negligible. The results for the nucleon structure functions, differential and total scattering cross sections are presented. The various effects considered in this work are effective in the different regions of $x$ and $Q^2$, and quite important in the energy region of $E_{\nu_\tau/{\bar\nu}_\tau} < 15$ GeV. A comparative study of our results with the existing results in the literature for the cross sections is made in the energy region of interest for the DUNE, SHiP, DsTau and HyperK experiments proposed to be done in the near future.
Incremental Processing in the Age of Non-Incremental Encoders: An Empirical Assessment of Bidirectional Models for Incremental NLU

While humans process language incrementally, the best language encoders currently used in NLP do not. Both bidirectional LSTMs and Transformers assume that the sequence that is to be encoded is available in full, to be processed either forwards and backwards (BiLSTMs) or as a whole (Transformers). We investigate how they behave under incremental interfaces, when partial output must be provided based on partial input seen up to a certain time step, which may happen in interactive systems. We test five models on various NLU datasets and compare their performance using three incremental evaluation metrics. The results support the possibility of using bidirectional encoders in incremental mode while retaining most of their non-incremental quality. The "omni-directional" BERT model, which achieves better non-incremental performance, is impacted more by the incremental access. This can be alleviated by adapting the training regime (truncated training), or the testing procedure, by delaying the output until some right context is available or by incorporating hypothetical right contexts generated by a language model like GPT-2.
K-simplex2vec: a Simplicial Extension of Node2vec

We present a novel method of associating Euclidean features to simplicial complexes, providing a way to use them as input to statistical and machine learning tools. This method extends the node2vec algorithm to simplices of higher dimensions, providing insight into the structure of a simplicial complex, or into the higher-order interactions in a graph.
Cut-and-Paste Neural Rendering

Cut-and-paste methods take an object from one image and insert it into another. Doing so often results in unrealistic looking images because the inserted object's shading is inconsistent with the target scene's shading. Existing reshading methods require a geometric and physical model of the inserted object, which is then rendered using environment parameters. Accurately constructing such a model only from a single image is beyond the current understanding of computer vision. We describe an alternative procedure -- cut-and-paste neural rendering, to render the inserted fragment's shading field consistent with the target scene. We use a Deep Image Prior (DIP) as a neural renderer trained to render an image with consistent image decomposition inferences. The resulting rendering from DIP should have an albedo consistent with composite albedo; it should have a shading field that, outside the inserted fragment, is the same as the target scene's shading field; and composite surface normals are consistent with the final rendering's shading field. The result is a simple procedure that produces convincing and realistic shading. Moreover, our procedure does not require rendered images or image-decomposition from real images in the training or labeled annotations. In fact, our only use of simulated ground truth is our use of a pre-trained normal estimator. Qualitative results are strong, supported by a user study comparing against the state-of-the-art image harmonization baseline.
IF-Defense: 3D Adversarial Point Cloud Defense via Implicit Function based Restoration

Point cloud is an important 3D data representation widely used in many essential applications. Leveraging deep neural networks, recent works have shown great success in processing 3D point clouds. However, those deep neural networks are vulnerable to various 3D adversarial attacks, which can be summarized as two primary types: point perturbation that affects local point distribution, and surface distortion that causes dramatic changes in geometry. In this paper, we propose a novel 3D adversarial point cloud defense method leveraging implicit function based restoration (IF-Defense) to address both the aforementioned attacks. It is composed of two steps: 1) it predicts an implicit function that captures the clean shape through a surface recovery module, and 2) restores a clean and complete point cloud via minimizing the difference between the attacked point cloud and the predicted implicit function under geometry- and distribution- aware constraints. Our experimental results show that IF-Defense achieves the state-of-the-art defense performance against all existing adversarial attacks on PointNet, PointNet++, DGCNN and PointConv. Comparing with previous methods, IF-Defense presents 20.02% improvement in classification accuracy against salient point dropping attack and 16.29% against LG-GAN attack on PointNet.
Cue-word Driven Neural Response Generation with a Shrinking Vocabulary

Open-domain response generation is the task of generating sensible and informative re-sponses to the source sentence. However, neural models tend to generate safe and mean-ingless responses. While cue-word introducing approaches encourage responses with concrete semantics and have shown tremendous potential, they still fail to explore di-verse responses during decoding. In this paper, we propose a novel but natural approach that can produce multiple cue-words during decoding, and then uses the produced cue-words to drive decoding and shrinks the decoding vocabulary. Thus the neural genera-tion model can explore the full space of responses and discover informative ones with efficiency. Experimental results show that our approach significantly outperforms several strong baseline models with much lower decoding complexity. Especially, our approach can converge to concrete semantics more efficiently during decoding.
Safe Reinforcement Learning with Natural Language Constraints

In this paper, we tackle the problem of learning control policies for tasks when provided with constraints in natural language. In contrast to instruction following, language here is used not to specify goals, but rather to describe situations that an agent must avoid during its exploration of the environment. Specifying constraints in natural language also differs from the predominant paradigm in safe reinforcement learning, where safety criteria are enforced by hand-defined cost functions. While natural language allows for easy and flexible specification of safety constraints and budget limitations, its ambiguous nature presents a challenge when mapping these specifications into representations that can be used by techniques for safe reinforcement learning. To address this, we develop a model that contains two components: (1) a constraint interpreter to encode natural language constraints into vector representations capturing spatial and temporal information on forbidden states, and (2) a policy network that uses these representations to output a policy with minimal constraint violations. Our model is end-to-end differentiable and we train it using a recently proposed algorithm for constrained policy optimization. To empirically demonstrate the effectiveness of our approach, we create a new benchmark task for autonomous navigation with crowd-sourced free-form text specifying three different types of constraints. Our method outperforms several baselines by achieving 6-7 times higher returns and 76% fewer constraint violations on average. Dataset and code to reproduce our experiments are available at this https URL.
Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH

In this paper, we seek a natural problem and a natural distribution of instances such that any $O(n^{c-\epsilon})$-time algorithm fails to solve most instances drawn from the distribution, while the problem admits an $n^{c+o(1)}$-time algorithm that correctly solves all instances. Specifically, we consider the $K_{a,b}$ counting problem in a random bipartite graph, where $K_{a,b}$ is a complete bipartite graph for constants $a$ and $b$. We proved that the $K_{a,b}$ counting problem admits an $n^{a+o(1)}$-time algorithm if $a\geq 8$, while any $n^{a-\epsilon}$-time algorithm fails to solve it even on random bipartite graph for any constant $\epsilon>0$ under the Strong Exponential Time Hypotheis. Then, we amplify the hardness of this problem using the direct product theorem and Yao's XOR lemma by presenting a general framework of hardness amplification in the setting of fine-grained complexity.
VMSMO: Learning to Generate Multimodal Summary for Video-based News Articles

A popular multimedia news format nowadays is providing users with a lively video and a corresponding news article, which is employed by influential news media including CNN, BBC, and social media including Twitter and Weibo. In such a case, automatically choosing a proper cover frame of the video and generating an appropriate textual summary of the article can help editors save time, and readers make the decision more effectively. Hence, in this paper, we propose the task of Video-based Multimodal Summarization with Multimodal Output (VMSMO) to tackle such a problem. The main challenge in this task is to jointly model the temporal dependency of video with semantic meaning of article. To this end, we propose a Dual-Interaction-based Multimodal Summarizer (DIMS), consisting of a dual interaction module and multimodal generator. In the dual interaction module, we propose a conditional self-attention mechanism that captures local semantic information within video and a global-attention mechanism that handles the semantic relationship between news text and video from a high level. Extensive experiments conducted on a large-scale real-world VMSMO dataset show that DIMS achieves the state-of-the-art performance in terms of both automatic metrics and human evaluations.
Thermoelectricity of Tin Selenide Monolayers Across a Structural Phase Transition

SnSe monolayers experience a temperature induced two-dimensional Pnm2$_1 \to$ P4/nmm structural transformation precipitated by the softening of vibrational modes. The standard theoretical treatment of thermoelectricity---which relies on a zero temperature phonon dispersion and on a zero temperature electronic structure---is incapable of describing thermoelectric phenomena induced by structural transformations. Relying on structural data obtained from {\em ab initio} molecular dynamics calculations that is utilized in a non-standard way to inform of electronic and vibrational transport coefficients, the present work establishes a general route to understand thermoelectricity across phase transitions. Similar to recent experimental observations pointing to an overestimated thermoelectric figure of merit $ZT$ past the transition temperature, our work indicates a smaller $ZT$ when compared to its value predicted by the standard paradigm. Its decrease is related to the dramatic changes in the electrical conductivity and lattice thermal conductivity as the structural transformation ensues. Though exemplified on a SnSe monolayer, the method does not have any built-in assumptions concerning dimensionality, and thus applicable to arbitrary thermoelectric materials in one, two, and three dimensions.
Digestive Enzyme Activities and the Contents of the Amino Acid during the Embryonic Development of Macrobrachium nipponense(Chinese)

Amino acids composition and activities of four digestive enzymes including pepsin,tryptase,amylase,cellulase were determined in the eggs of freshwater prawn,Macrobrachium nipponense.These eggs were sampled from different embryonic development stages.The results indicated that digestive enzymes activities and amino acids correlated closely with the stages of embryonic development.Activities of pepsin,tryptase and amylase were relatively high during the whole embryonic development stages.Activities of pepsin,tryptase and amylase were high in early and late developmental stages,but relatively low during middle stages.Cellulose activity was low and showed no obvious change during different embryonic development stages.During protozoea stage,activities of pepsin,tryptase and amylase increased obviously.The content of dissolvable protein and amino acid had a decreased trend.It had relevance to the activities of related enzymes.However,content of the dissolvable protein and amino acid during gastrula stage were higher than that of during blastula stage.Among all the amino acids determined,content of Glu was the highest,the highest essential amino acid(EAA) content was Leu.There was little difference between the ratios of content of single EAA to total EAA during different stages of embryonic development of M.nipponense.
Telerobotic Operation of Intensive Care Unit Ventilators

Since the first reports of a novel coronavirus (SARS-CoV-2) in December 2019, over 33 million people have been infected worldwide and approximately 1 million people worldwide have died from the disease caused by this virus, COVID-19. In the United States alone, there have been approximately 7 million cases and over 200,000 deaths. This outbreak has placed an enormous strain on healthcare systems and workers. Severe cases require hospital care, and 8.5% of patients require mechanical ventilation in an intensive care unit (ICU). One major challenge is the necessity for clinical care personnel to don and doff cumbersome personal protective equipment (PPE) in order to enter an ICU unit to make simple adjustments to ventilator settings. Although future ventilators and other ICU equipment may be controllable remotely through computer networks, the enormous installed base of existing ventilators do not have this capability. This paper reports the development of a simple, low cost telerobotic system that permits adjustment of ventilator settings from outside the ICU. The system consists of a small Cartesian robot capable of operating a ventilator touch screen with camera vision control via a wirelessly connected tablet master device located outside the room. Engineering system tests demonstrated that the open-loop mechanical repeatability of the device was 7.5 mm, and that the average positioning error of the robotic finger under visual servoing control was 5.94 mm. Successful usability tests in a simulated ICU environment were carried out and are reported. In addition to enabling a significant reduction in PPE consumption, the prototype system has been shown in a preliminary evaluation to significantly reduce the total time required for a respiratory therapist to perform typical setting adjustments on a commercial ventilator, including donning and doffing PPE, from 271 to 109 s.
A Kind of Mini-barcode Primer for Gecko and its Adulterant

To design mini-barcode primers for amplifying gecko and its adulterants.By aligning COI sequences with primer design computer software,we gained two pair primers(mini-barcode F2,mini-barcode R2;mini-barcode F3,mini-barcode R3),and then amplified 61 samples from gecko and its adulterant with three pair primers,including these two pair primers and currently generally used primer.The results showed that the primers(mini-barcode F2,mini-barcode R2) had 100% PCR amplification success rate,the primers(mini-barcode F3,mini-barcode R3) gained 90% PCR amplification success rate,but currently universal primer performed disappointment,we got about 500 bp fragment in PCR amplification with this primers.This fragment is not target fragment.So the currently used primer is not applicable for amplifying gecko and its adulterants,the primers we designed is effective for amplifying gecko and its adulterants.
A Tensor Compiler for Unified Machine Learning Prediction Serving

Machine Learning (ML) adoption in the enterprise requires simpler and more efficient software infrastructure---the bespoke solutions typical in large web companies are simply untenable. Model scoring, the process of obtaining predictions from a trained model over new data, is a primary contributor to infrastructure complexity and cost as models are trained once but used many times. In this paper we propose HUMMINGBIRD, a novel approach to model scoring, which compiles featurization operators and traditional ML models (e.g., decision trees) into a small set of tensor operations. This approach inherently reduces infrastructure complexity and directly leverages existing investments in Neural Network compilers and runtimes to generate efficient computations for both CPU and hardware accelerators. Our performance results are intriguing: despite replacing imperative computations (e.g., tree traversals) with tensor computation abstractions, HUMMINGBIRD is competitive and often outperforms hand-crafted kernels on micro-benchmarks on both CPU and GPU, while enabling seamless end-to-end acceleration of ML pipelines. We have released HUMMINGBIRD as open source.
CC-Loss: Channel Correlation Loss for Image Classification

The loss function is a key component in deep learning models. A commonly used loss function for classification is the cross entropy loss, which is a simple yet effective application of information theory for classification problems. Based on this loss, many other loss functions have been proposed, e.g., by adding intra-class and inter-class constraints to enhance the discriminative ability of the learned features. However, these loss functions fail to consider the connections between the feature distribution and the model structure. Aiming at addressing this problem, we propose a channel correlation loss (CC-Loss) that is able to constrain the specific relations between classes and channels as well as maintain the intra-class and the inter-class separability. CC-Loss uses a channel attention module to generate channel attention of features for each sample in the training stage. Next, an Euclidean distance matrix is calculated to make the channel attention vectors associated with the same class become identical and to increase the difference between different classes. Finally, we obtain a feature embedding with good intra-class compactness and inter-class separability. Experimental results show that two different backbone models trained with the proposed CC-Loss outperform the state-of-the-art loss functions on three image classification datasets.
Local Search for Policy Iteration in Continuous Control

We present an algorithm for local, regularized, policy improvement in reinforcement learning (RL) that allows us to formulate model-based and model-free variants in a single framework. Our algorithm can be interpreted as a natural extension of work on KL-regularized RL and introduces a form of tree search for continuous action spaces. We demonstrate that additional computation spent on model-based policy improvement during learning can improve data efficiency, and confirm that model-based policy improvement during action selection can also be beneficial. Quantitatively, our algorithm improves data efficiency on several continuous control benchmarks (when a model is learned in parallel), and it provides significant improvements in wall-clock time in high-dimensional domains (when a ground truth model is available). The unified framework also helps us to better understand the space of model-based and model-free algorithms. In particular, we demonstrate that some benefits attributed to model-based RL can be obtained without a model, simply by utilizing more computation.