arXiv subjects

Jian Cao

Publications and source records attributed to Jian Cao.

At least 109 records · Page 6Linked to original sources

arXiv2021

MetaFEM: A Generic FEM Solver By Meta-expressions

Current multi-physics Finite Element Method (FEM) solvers are complex systems in terms of both their mathematical complexity and lines of code. This paper proposes a skeleton generic FEM solver, named MetaFEM, in total about 5,000 lines of Julia code, which translates generic input Partial Differential Equation (PDE) weak forms into corresponding GPU-accelerated simulations with a grammar similar to FEniCS or FreeFEM. Two novel approaches differentiate MetaFEM from the common solvers: (1) the FEM kernel is based on an original theory/algorithm which explicitly processes meta-expressions, as the name suggests, and (2) the symbolic engine is a rule-based Computer Algebra System (CAS), i.e., the equations are rewritten/derived according to a set of rewriting rules instead of going through completely fixed routines, supporting easy customization by developers. Example cases in thermal conduction, linear elasticity and incompressible flow are presented to demonstrate utility.

math.NA↗

arXiv2021

Data driven analysis of thermal simulations, microstructure and mechanical properties of Inconel 718 thin walls deposited by metal additive manufacturing

The extreme and repeated temperature variation during additive manufacturing of metal parts has a large effect on the resulting material microstructure and properties. The ability to accurately predict this temperature field in detail, and relate it quantitatively to structure and properties, is a key step in predicting part performance and optimizing process design. In this work, a finite element simulation of the Directed Energy Deposition (DED) process is used to predict the space- and time-dependent temperature field during the multi-layer build process for Inconel 718 walls. The thermal model is validated using the dynamic infrared (IR) images captured in situ during the DED builds, showing good agreement with experimental measurements. The relationship between predicted cooling rate, microstructural features, and mechanical properties is examined, and cooling rate alone is found to be insufficient in giving quantitative property predictions. Because machine learning offers an efficient way to identify important features from series data, we apply a 1D convolutional neural network (CNN) data-driven framework to automatically extract the dominant predictive features from simulated temperature history. The relationship between the CNN-extracted features and the mechanical properties is studied. To interpret how CNN performs in intermediate layers, we visualize the extracted features produced on each convolutional layer by a trained CNN. Our results show that the results predicted by the CNN agree well with experimental measurements and give insights into physical mechanisms of microstructure evolution and mechanical properties.

physics.app-ph↗

arXiv2021

A free lunch from ViT:Adaptive Attention Multi-scale Fusion Transformer for Fine-grained Visual Recognition

Learning subtle representation about object parts plays a vital role in fine-grained visual recognition (FGVR) field. The vision transformer (ViT) achieves promising results on computer vision due to its attention mechanism. Nonetheless, with the fixed size of patches in ViT, the class token in deep layer focuses on the global receptive field and cannot generate multi-granularity features for FGVR. To capture region attention without box annotations and compensate for ViT shortcomings in FGVR, we propose a novel method named Adaptive attention multi-scale Fusion Transformer (AFTrans). The Selective Attention Collection Module (SACM) in our approach leverages attention weights in ViT and filters them adaptively to correspond with the relative importance of input patches. The multiple scales (global and local) pipeline is supervised by our weights sharing encoder and can be easily trained end-to-end. Comprehensive experiments demonstrate that AFTrans can achieve SOTA performance on three published fine-grained benchmarks: CUB-200-2011, Stanford Dogs and iNat2017.

cs.CV↗

arXiv2021

AdaPruner: Adaptive Channel Pruning and Effective Weights Inheritance

Channel pruning is one of the major compression approaches for deep neural networks. While previous pruning methods have mostly focused on identifying unimportant channels, channel pruning is considered as a special case of neural architecture search in recent years. However, existing methods are either complicated or prone to sub-optimal pruning. In this paper, we propose a pruning framework that adaptively determines the number of each layer's channels as well as the wights inheritance criteria for sub-network. Firstly, evaluate the importance of each block in the network based on the mean of the scaling parameters of the BN layers. Secondly, use the bisection method to quickly find the compact sub-network satisfying the budget. Finally, adaptively and efficiently choose the weight inheritance criterion that fits the current architecture and fine-tune the pruned network to recover performance. AdaPruner allows to obtain pruned network quickly, accurately and efficiently, taking into account both the structure and initialization weights. We prune the currently popular CNN models (VGG, ResNet, MobileNetV2) on different image classification datasets, and the experimental results demonstrate the effectiveness of our proposed method. On ImageNet, we reduce 32.8% FLOPs of MobileNetV2 with only 0.62% decrease for top-1 accuracy, which exceeds all previous state-of-the-art channel pruning methods. The code will be released.

cs.CV↗

arXiv2021

Distilling Neuron Spike with High Temperature in Reinforcement Learning Agents

Spiking neural network (SNN), compared with depth neural network (DNN), has faster processing speed, lower energy consumption and more biological interpretability, which is expected to approach Strong AI. Reinforcement learning is similar to learning in biology. It is of great significance to study the combination of SNN and RL. We propose the reinforcement learning method of spike distillation network (SDN) with STBP. This method uses distillation to effectively avoid the weakness of STBP, which can achieve SOTA performance in classification, and can obtain a smaller, faster convergence and lower power consumption SNN reinforcement learning model. Experiments show that our method can converge faster than traditional SNN reinforcement learning and DNN reinforcement learning methods, about 1000 epochs faster, and obtain SNN 200 times smaller than DNN. We also deploy SDN to the PKU nc64c chip, which proves that SDN has lower power consumption than DNN, and the power consumption of SDN is more than 600 times lower than DNN on large-scale devices. SDN provides a new way of SNN reinforcement learning, and can achieve SOTA performance, which proves the possibility of further development of SNN reinforcement learning.

cs.NE↗

arXiv2021

Additive manufacturing process design with differentiable simulations

We present a novel computational paradigm for process design in manufacturing processes that incorporates simulation responses to optimize manufacturing process parameters in high-dimensional temporal and spatial design spaces. We developed a differentiable finite element analysis framework using automatic differentiation which allows accurate optimization of challenging process parameters such as time-series laser power. We demonstrate the capability of our proposed method through three illustrative case studies in additive manufacturing for: (i) material and process parameter inference using partial observable data, (ii) controlling time-series thermal behavior, and (iii) stabilizing melt pool depth. This research opens new avenues for high-dimensional manufacturing design using solid mechanics simulation tools such as finite element methods. Our codes are made publicly available for the research community at https://github.com/mojtabamozaffar/differentiable-simulation-am.

cs.CE↗

arXiv2021

Atomic-scale imaging of CH3NH3PbI3 structure and its decomposition pathway

Understanding the atomic structure and structural instability of organic-inorganic hybrid perovskites is the key to appreciate their remarkable photoelectric properties and failure mechanism. Here, using low-dose imaging technique by direct-detection electron-counting camera in transmission electron microscope, we investigate the atomic structure and decomposition pathway of CH3NH3PbI3 (MAPbI3) at the atomic scale. We successfully image the atomic structure of perovskite in real space under ultra-low electron dose condition, and observe a two-step decomposition process, i.e. initial loss of MA followed by the collapse of perovskite structure into 6H-PbI2 with their critical threshold dose also determined. Interestingly, an intermediate phase (MA0.5PbI3) with locally ordered vacancies can robustly exist before perovskite collapses, enlightening strategies for prevention and recovery of perovskite structure during degradation. Associated with structure evolution, the bandgap gradually increases from ~1.6 eV to ~2.1 eV, and it is found that both C-N and N-H bonds can be destroyed under irradiation, releasing NH3 and leaving hydrocarbons. These findings enhance our understanding of the photoelectric properties and failure mechanism of MAPbI3, providing potential strategy into material optimization.

physics.app-ph↗

arXiv2021

TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and Providers

At present, most research on the fairness of recommender systems is conducted either from the perspective of customers or from the perspective of product (or service) providers. However, such a practice ignores the fact that when fairness is guaranteed to one side, the fairness and rights of the other side are likely to reduce. In this paper, we consider recommendation scenarios from the perspective of two sides (customers and providers). From the perspective of providers, we consider the fairness of the providers' exposure in recommender system. For customers, we consider the fairness of the reduced quality of recommendation results due to the introduction of fairness measures. We theoretically analyzed the relationship between recommendation quality, customers fairness, and provider fairness, and design a two-sided fairness-aware recommendation model (TFROM) for both customers and providers. Specifically, we design two versions of TFROM for offline and online recommendation. The effectiveness of the model is verified on three real-world data sets. The experimental results show that TFROM provides better two-sided fairness while still maintaining a higher level of personalization than the baseline algorithms.

cs.AI↗

arXiv2021

A Lossless Intra Reference Block Recompression Scheme for Bandwidth Reduction in HEVC-IBC

The reference frame memory accesses in inter prediction result in high DRAM bandwidth requirement and power consumption. This problem is more intensive by the adoption of intra block copy (IBC), a new coding tool in the screen content coding (SCC) extension to High Efficiency Video Coding (HEVC). In this paper, we propose a lossless recompression scheme that compresses the reference blocks in intra prediction, i.e., intra block copy, before storing them into DRAM to alleviate this problem. The proposal performs pixel-wise texture analysis with an edge-based adaptive prediction method yet no signaling for direction in bitstreams, thus achieves a high gain for compression. Experimental results demonstrate that the proposed scheme shows a 72% data reduction rate on average, which solves the memory bandwidth problem.

eess.IV↗

arXiv2021

Dynamic Social Media Monitoring for Fast-Evolving Online Discussions

Tracking and collecting fast-evolving online discussions provides vast data for studying social media usage and its role in people's public lives. However, collecting social media data using a static set of keywords fails to satisfy the growing need to monitor dynamic conversations and to study fast-changing topics. We propose a dynamic keyword search method to maximize the coverage of relevant information in fast-evolving online discussions. The method uses word embedding models to represent the semantic relations between keywords and predictive models to forecast the future time series. We also implement a visual user interface to aid in the decision-making process in each round of keyword updates. This allows for both human-assisted tracking and fully-automated data collection. In simulations using historical #MeToo data in 2017, our human-assisted tracking method outperforms the traditional static baseline method significantly, with 37.1% higher F-1 score than traditional static monitors in tracking the top trending keywords. We conduct a contemporary case study to cover dynamic conversations about the recent Presidential Inauguration and to test the dynamic data collection system. Our case studies reflect the effectiveness of our process and also points to the potential challenges in future deployment.

cs.SI↗

arXiv2021

A note on fractional Askey--Wilson integrals

In this paper, we generalize fractional $q$-integrals by the method of $q$-difference equation. In addition, we deduce fractional Askey--Wilson integral, reversal type fractional Askey--Wilson integral and Ramanujan type fractional Askey--Wilson integral.

math.CA↗

arXiv2020

An Once-for-All Budgeted Pruning Framework for ConvNets Considering Input Resolution

We propose an efficient once-for-all budgeted pruning framework (OFARPruning) to find many compact network structures close to winner tickets in the early training stage considering the effect of input resolution during the pruning process. In structure searching stage, we utilize cosine similarity to measure the similarity of the pruning mask to get high-quality network structures with low energy and time consumption. After structure searching stage, our proposed method randomly sample the compact structures with different pruning rates and input resolution to achieve joint optimization. Ultimately, we can obtain a cohort of compact networks adaptive to various resolution to meet dynamic FLOPs constraints on different edge devices with only once training. The experiments based on image classification and object detection show that OFARPruning has a higher accuracy than the once-for-all compression methods such as US-Net and MutualNet (1-2% better with less FLOPs), and achieve the same even higher accuracy as the conventional pruning methods (72.6% vs. 70.5% on MobileNetv2 under 170 MFLOPs) with much higher efficiency.

cs.CV↗

arXiv2020

FAST: A Fairness Assured Service Recommendation Strategy Considering Service Capacity Constraint

An excessive number of customers often leads to a degradation in service quality. However, the capacity constraints of services are ignored by recommender systems, which may lead to unsatisfactory recommendation. This problem can be solved by limiting the number of users who receive the recommendation for a service, but this may be viewed as unfair. In this paper, we propose a novel metric Top-N Fairness to measure the individual fairness of multi-round recommendations of services with capacity constraints. By considering the fact that users are often only affected by top-ranked items in a recommendation, Top-N Fairness only considers a sub-list consisting of top N services. Based on the metric, we design FAST, a Fairness Assured service recommendation STrategy. FAST adjusts the original recommendation list to provide users with recommendation results that guarantee the long-term fairness of multi-round recommendations. We prove the convergence property of the variance of Top-N Fairness of FAST theoretically. FAST is tested on the Yelp dataset and synthetic datasets. The experimental results show that FAST achieves better recommendation fairness while still maintaining high recommendation quality.

cs.IR↗

arXiv2020

Layer Pruning via Fusible Residual Convolutional Block for Deep Neural Networks

In order to deploy deep convolutional neural networks (CNNs) on resource-limited devices, many model pruning methods for filters and weights have been developed, while only a few to layer pruning. However, compared with filter pruning and weight pruning, the compact model obtained by layer pruning has less inference time and run-time memory usage when the same FLOPs and number of parameters are pruned because of less data moving in memory. In this paper, we propose a simple layer pruning method using fusible residual convolutional block (ResConv), which is implemented by inserting shortcut connection with a trainable information control parameter into a single convolutional layer. Using ResConv structures in training can improve network accuracy and train deep plain networks, and adds no additional computation during inference process because ResConv is fused to be an ordinary convolutional layer after training. For layer pruning, we convert convolutional layers of network into ResConv with a layer scaling factor. In the training process, the L1 regularization is adopted to make the scaling factors sparse, so that unimportant layers are automatically identified and then removed, resulting in a model of layer reduction. Our pruning method achieves excellent performance of compression and acceleration over the state-of-the-arts on different datasets, and needs no retraining in the case of low pruning rate. For example, with ResNet-110, we achieve a 65.5%-FLOPs reduction by removing 55.5% of the parameters, with only a small loss of 0.13% in top-1 accuracy on CIFAR-10.

cs.CV↗

arXiv2020

Exploiting Low Rank Covariance Structures for Computing High-Dimensional Normal and Student-$t$ Probabilities

We present a preconditioned Monte Carlo method for computing high-dimensional multivariate normal and Student-$t$ probabilities arising in spatial statistics. The approach combines a tile-low-rank representation of covariance matrices with a block-reordering scheme for efficient Quasi-Monte Carlo simulation. The tile-low-rank representation decomposes the high-dimensional problem into many diagonal-block-size problems and low-rank connections. The block-reordering scheme reorders between and within the diagonal blocks to reduce the impact of integration variables from right to left, thus improving the Monte Carlo convergence rate. Simulations up to dimension $65{,}536$ suggest that the new method can improve the run time by an order of magnitude compared with the non-reordered tile-low-rank Quasi-Monte Carlo method and two orders of magnitude compared with the dense Quasi-Monte Carlo method. Our method also forms a strong substitute for the approximate conditioning methods as a more robust estimation with error guarantees. An application study to wind stochastic generators is provided to illustrate that the new computational method makes the maximum likelihood estimation feasible for high-dimensional skew-normal random fields.

stat.CO↗

arXiv2020

Reliable and Efficient Long-Term Social Media Monitoring

Social media data is now widely used by many academic researchers. However, long-term social media data collection projects, which most typically involve collecting data from public-use APIs, often encounter issues when relying on local-area network servers (LANs) to collect high-volume streaming social media data over long periods of time. In this technical report, we present a cloud-based data collection, pre-processing, and archiving infrastructure, and argue that this system mitigates or resolves the problems most typically encountered when running social media data collection projects on LANs at minimal cloud-computing costs. We show how this approach works in different cloud computing architectures, and how to adapt the method to collect streaming data from other social media platforms.

cs.CY↗

arXiv2020

A note on generalized $q$-difference equations for general Al-Salam--Carlitz polynomials

In this paper, we deduce the generalized $q$-difference equations for general Al-Salam--Carlitz polynomials and generalize Arjika's recently results [$q$-difference equation for homogeneous $q$-difference operators and their applications, J. Differ. Equ. Appl. {\bf 26}, 987--999 (2020)]. In addition, we obtain transformational identities by the method of $q$-difference equation. Moreover, we deduce $U(n+1)$ type generating functions and Ramanujan's integrals involving general Al-Salam--Carlitz polynomials by $q$-difference equation.

math.CO↗

arXiv2020

A Note on Generalized $q$-Difference Equations and Their Applications Involving $q$-Hypergeometric Functions

In this paper, we use two $q$-operators $\mathbb{T}(a,b,c,d,e,yD_x)$ and $\mathbb{E}(a,b,c,d,e,yθ_x)$ to derive two potentially useful generalizations of the $q$-binomial theorem, a set of two extensions of the $q$-Chu-Vandermonde summation formula and two new generalizations of the Andrews-Askey integral by means of the $q$-difference equations. We also briefly describe relevant connections of various special cases and consequences of our main results with a number of known results.

math.CO↗