Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
49works
0followers
34topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

49 published item(s)

preprint2026arXiv

StampFormer: A Physics-Guided Material-Geometry-Coupled Multimodal Model for Rapid Prediction of Physical Fields in Sheet Metal Stamping

Traditional sheet metal forming relies on time-consuming and expensive Finite Element Analysis (FEA) for design validation, a process that significantly prolongs design cycles. While surrogate models offer faster iteration, current approaches have limitations: scalar-based methods cannot capture comprehensive field-based FEA results, while existing image-based models often ignore the critical role of material properties by focusing solely on geometry. To address this gap, we develop a physics-guided deep learning framework, namely StampFormer, which simultaneously uses component geometry and material stress-strain responses to predict FEA outcomes. The StampFormer framework uses three core components to process data. A Material-Augmented Geometric Network (MAGN) first fuses geometric and material data. This information is then integrated at various levels by a Hierarchical Material Embedding Injection Unit (HMEIU) before being processed by the primary network backbone, an adapted Swin-UNet. We evaluated our model on the stamping of a crossmember panel with two simulation datasets for steel and aluminium panels, and results demonstrate that StampFormer provides high-fidelity predictions of critical physical fields - including thinning, major strain, minor strain, plastic strain, and displacement - in under a second. Compared with ground truth FEA, our model achieved an average relative error of less than 8.5% on the four 2D fields and a mean squared error of less than 1.2 mm2 for the 3D displacement field. In summary, we introduce a practical and efficient framework that integrates multimodal information, namely geometry and material properties, to provide fast and accurate predictions, enabling designers to perform real-time manufacturability assessments.

preprint2024arXiv

Advanced Unstructured Data Processing for ESG Reports: A Methodology for Structured Transformation and Enhanced Analysis

In the evolving field of corporate sustainability, analyzing unstructured Environmental, Social, and Governance (ESG) reports is a complex challenge due to their varied formats and intricate content. This study introduces an innovative methodology utilizing the "Unstructured Core Library", specifically tailored to address these challenges by transforming ESG reports into structured, analyzable formats. Our approach significantly advances the existing research by offering high-precision text cleaning, adept identification and extraction of text from images, and standardization of tables within these reports. Emphasizing its capability to handle diverse data types, including text, images, and tables, the method adeptly manages the nuances of differing page layouts and report styles across industries. This research marks a substantial contribution to the fields of industrial ecology and corporate sustainability assessment, paving the way for the application of advanced NLP technologies and large language models in the analysis of corporate governance and sustainability. Our code is available at https://github.com/linancn/TianGong-AI-Unstructure.git.

preprint2024arXiv

The Mood of the Sunlight: Visualization of the Sunlight Data for Public Art

The application of data visualization in public art attracts increasing attention. In this paper, we present the design and implementation of a visualization method for sunlight data collected over a long period of time with an industrial camera. The proposed method makes use of the saturation and value information of collected sunlight image data in Hue Saturation Value color model to show the variation of the mood of the sunlight. Specifically, we create visual patterns with a rotating planet gear, which has an intuitively consistent geometric meaning with HSV color model and the planetary motion. Due to the variation of the sunlight data over time, the generated visual pattern presents a periodic variation that corresponds to the changing mood of the sunlight. Furthermore, we also use the sunlight data to generate music as another form of data representation. Two public artworks have been created with the above visualization and auralization methods and displayed on an exhibition held at China Resources Tower, Shenzhen, China. This work is a typical practice of creating public installations with data visualization technology, giving a glimpse into the many ways science and art intersect.

preprint2022arXiv

Classifying Galaxy Morphologies with Few-Shot Learning

The taxonomy of galaxy morphology is critical in astrophysics as the morphological properties are powerful tracers of galaxy evolution. With the upcoming Large-scale Imaging Surveys, billions of galaxy images challenge astronomers to accomplish the classification task by applying traditional methods or human inspection. Consequently, machine learning, in particular supervised deep learning, has been widely employed to classify galaxy morphologies recently due to its exceptional automation, efficiency, and accuracy. However, supervised deep learning requires extensive training sets, which causes considerable workloads; also, the results are strongly dependent on the characteristics of training sets, which leads to biased outcomes potentially. In this study, we attempt Few-shot Learning to bypass the two issues. Our research adopts the dataset from Galaxy Zoo Challenge Project on Kaggle, and we divide it into five categories according to the corresponding truth table. By classifying the above dataset utilizing few-shot learning based on Siamese Networks and supervised deep learning based on AlexNet, VGG_16, and ResNet_50 trained with different volumes of training sets separately, we find that few-shot learning achieves the highest accuracy in most cases, and the most significant improvement is $21\%$ compared to AlexNet when the training sets contain 1000 images. In addition, to guarantee the accuracy is no less than 90\%, few-shot learning needs $\sim$6300 images for training, while ResNet_50 requires 13000 images. Considering the advantages stated above, foreseeably, few-shot learning is suitable for the taxonomy of galaxy morphology and even for identifying rare astrophysical objects, despite limited training sets consisting of observational data only.

preprint2022arXiv

Detection of Strongly Lensed Arcs in Galaxy Clusters with Transformers

Strong lensing in galaxy clusters probes properties of dense cores of dark matter halos in mass, studies the distant universe at flux levels and spatial resolutions otherwise unavailable, and constrains cosmological models independently. The next-generation large scale sky imaging surveys are expected to discover thousands of cluster-scale strong lenses, which would lead to unprecedented opportunities for applying cluster-scale strong lenses to solve astrophysical and cosmological problems. However, the large dataset challenges astronomers to identify and extract strong lensing signals, particularly strongly lensed arcs, because of their complexity and variety. Hence, we propose a framework to detect cluster-scale strongly lensed arcs, which contains a transformer-based detection algorithm and an image simulation algorithm. We embed prior information of strongly lensed arcs at cluster-scale into the training data through simulation and then train the detection algorithm with simulated images. We use the trained transformer to detect strongly lensed arcs from simulated and real data. Results show that our approach could achieve 99.63 % accuracy rate, 90.32 % recall rate, 85.37 % precision rate and 0.23 % false positive rate in detection of strongly lensed arcs from simulated images and could detect almost all strongly lensed arcs in real observation images. Besides, with an interpretation method, we have shown that our method could identify important information embedded in simulated data. Next step, to test the reliability and usability of our approach, we will apply it to available observations (e.g., DESI Legacy Imaging Surveys) and simulated data of upcoming large-scale sky surveys, such as the Euclid and the CSST.

preprint2022arXiv

Development of a deep learning platform for optimising sheet stamping geometries subject to manufacturing constraints

The latest sheet stamping processes enable efficient manufacturing of complex shape structural components that have high stiffness to weight ratios, but these processes can introduce defects. To assist component design for stamping processes, this paper presents a novel deep-learning-based platform for optimising 3D component geometries. The platform adopts a non-parametric modelling approach that is capable of optimising arbitrary geometries from multiple geometric parameterisation schema. This approach features the interaction of two neural networks: 1) a geometry generator and 2) a manufacturing performance evaluator. The generator predicts continuous 3D signed distance fields (SDFs) for geometries of different classes, and each SDF is conditioned on a latent vector. The zero-level-set of each SDF implicitly represents a generated geometry. Novel training strategies for the generator are introduced and include a new loss function which is tailored for sheet stamping applications. These strategies enable the differentiable generation of high quality, large scale component geometries with tight local features for the first time. The evaluator maps a 2D projection of these generated geometries to their post-stamping physical (e.g., strain) distributions. Manufacturing constraints are imposed based on these distributions and are used to formulate a novel objective function for optimisation. A new gradient-based optimisation technique is employed to iteratively update the latent vectors, and therefore geometries, to minimise this objective function and thus meet the manufacturing constraints. Case studies based on optimising box geometries subject to a sheet thinning constraint for a hot stamping process are presented and discussed. The results show that expressive geometric changes are achievable, and that these changes are driven by stamping performance.

preprint2022arXiv

Displacement calibration of optical tweezers with absolute gravitational acceleration

In recent years, levitated particles of optical traps in vacuum have shown enormous potential in precision sensor development and searching for new physics. The accuracy of the calibration relating the detected signal to absolute displacement of the trapped particle is a critical factor for absolute measurement performance. In this paper, we suggest and experimentally demonstrate a novel calibration method for optical tweezers based on free-falling particles in vacuum, where the gravitational acceleration is introduced as an absolute reference. Our work provides a calibration protocol with great certainty and traceability, which is significant in improving the accuracy of precision sensing based on optically levitated particles.

preprint2022arXiv

Distributed Deep Learning Inference Acceleration using Seamless Collaboration in Edge Computing

This paper studies inference acceleration using distributed convolutional neural networks (CNNs) in collaborative edge computing. To ensure inference accuracy in inference task partitioning, we consider the receptive-field when performing segment-based partitioning. To maximize the parallelization between the communication and computing processes, thereby minimizing the total inference time of an inference task, we design a novel task collaboration scheme in which the overlapping zone of the sub-tasks on secondary edge servers (ESs) is executed on the host ES, named as HALP. We further extend HALP to the scenario of multiple tasks. Experimental results show that HALP can accelerate CNN inference in VGG-16 by 1.7-2.0x for a single task and 1.7-1.8x for 4 tasks per batch on GTX 1080TI and JETSON AGX Xavier, which outperforms the state-of-the-art work MoDNN. Moreover, we evaluate the service reliability under time-variant channel, which shows that HALP is an effective solution to ensure high service reliability with strict service deadline.

preprint2022arXiv

Identifying outliers in astronomical images with unsupervised machine learning

Astronomical outliers, such as unusual, rare or unknown types of astronomical objects or phenomena, constantly lead to the discovery of genuinely unforeseen knowledge in astronomy. More unpredictable outliers will be uncovered in principle with the increment of the coverage and quality of upcoming survey data. However, it is a severe challenge to mine rare and unexpected targets from enormous data with human inspection due to a significant workload. Supervised learning is also unsuitable for this purpose since designing proper training sets for unanticipated signals is unworkable. Motivated by these challenges, we adopt unsupervised machine learning approaches to identify outliers in the data of galaxy images to explore the paths for detecting astronomical outliers. For comparison, we construct three methods, which are built upon the k-nearest neighbors (KNN), Convolutional Auto-Encoder (CAE)+ KNN, and CAE + KNN + Attention Mechanism (attCAE KNN) separately. Testing sets are created based on the Galaxy Zoo image data published online to evaluate the performance of the above methods. Results show that attCAE KNN achieves the best recall (78%), which is 53% higher than the classical KNN method and 22% higher than CAE+KNN. The efficiency of attCAE KNN (10 minutes) is also superior to KNN (4 hours) and equal to CAE+KNN(10 minutes) for accomplishing the same task. Thus, we believe it is feasible to detect astronomical outliers in the data of galaxy images in an unsupervised manner. Next, we will apply attCAE KNN to available survey datasets to assess its applicability and reliability.

preprint2022arXiv

Illumination-Invariant Active Camera Relocalization for Fine-Grained Change Detection in the Wild

Active camera relocalization (ACR) is a new problem in computer vision that significantly reduces the false alarm caused by image distortions due to camera pose misalignment in fine-grained change detection (FGCD). Despite the fruitful achievements that ACR can support, it still remains a challenging problem caused by the unstable results of relative pose estimation, especially for outdoor scenes, where the lighting condition is out of control, i.e., the twice observations may have highly varied illuminations. This paper studies an illumination-invariant active camera relocalization method, it improves both in relative pose estimation and scale estimation. We use plane segments as an intermediate representation to facilitate feature matching, thus further boosting pose estimation robustness and reliability under lighting variances. Moreover, we construct a linear system to obtain the absolute scale in each ACR iteration by minimizing the image warping error, thus, significantly reduce the time consume of ACR process, it is nearly $1.6$ times faster than the state-of-the-art ACR strategy. Our work greatly expands the feasibility of real-world fine-grained change monitoring tasks for cultural heritages. Extensive experiments tests and real-world applications verify the effectiveness and robustness of the proposed pose estimation method using for ACR tasks.

preprint2022arXiv

Improved proof-by-contraction method and relative homologous entropy inequalities

The celebrated holographic entanglement entropy triggered investigations on the connections between quantum information theory and quantum gravity. An important achievement is that we have gained more insights into the quantum states. It allows us to diagnose whether a given quantum state is a holographic state, a state whose bulk dual admits semiclassical geometrical description. The effective tool of this kind of diagnosis is holographic entropy cone (HEC), an entropy space bounded by holographic entropy inequalities allowed by the theory. To fix the HEC and to prove a given holographic entropy inequality, a proof-by-contraction technique has been developed. This method heavily depends on a contraction map $f$, which is very difficult to construct especially for more-region ($n\geq 4$) cases. In this work, we develop a general and effective rule to rule out most of the cases such that $f$ can be obtained in a relatively simple way. In addition, we extend the whole framework to relative homologous entropy, a generalization of holographic entanglement entropy that is suitable for characterizing the entanglement of mixed states.

preprint2022arXiv

Mass Testing and Characterization of 20-inch PMTs for JUNO

Main goal of the JUNO experiment is to determine the neutrino mass ordering using a 20kt liquid-scintillator detector. Its key feature is an excellent energy resolution of at least 3 % at 1 MeV, for which its instruments need to meet a certain quality and thus have to be fully characterized. More than 20,000 20-inch PMTs have been received and assessed by JUNO after a detailed testing program which began in 2017 and elapsed for about four years. Based on this mass characterization and a set of specific requirements, a good quality of all accepted PMTs could be ascertained. This paper presents the performed testing procedure with the designed testing systems as well as the statistical characteristics of all 20-inch PMTs intended to be used in the JUNO experiment, covering more than fifteen performance parameters including the photocathode uniformity. This constitutes the largest sample of 20-inch PMTs ever produced and studied in detail to date, i.e. 15,000 of the newly developed 20-inch MCP-PMTs from Northern Night Vision Technology Co. (NNVT) and 5,000 of dynode PMTs from Hamamatsu Photonics K. K.(HPK).

preprint2022arXiv

Neural Program Synthesis with Query

Aiming to find a program satisfying the user intent given input-output examples, program synthesis has attracted increasing interest in the area of machine learning. Despite the promising performance of existing methods, most of their success comes from the privileged information of well-designed input-output examples. However, providing such input-output examples is unrealistic because it requires the users to have the ability to describe the underlying program with a few input-output examples under the training distribution. In this work, we propose a query-based framework that trains a query neural network to generate informative input-output examples automatically and interactively from a large query space. The quality of the query depends on the amount of the mutual information between the query and the corresponding program, which can guide the optimization of the query framework. To estimate the mutual information more accurately, we introduce the functional space (F-space) which models the relevance between the input-output examples and the programs in a differentiable way. We evaluate the effectiveness and generalization of the proposed query-based framework on the Karel task and the list processing task. Experimental results show that the query-based framework can generate informative input-output examples which achieve and even outperform well-designed input-output examples.

preprint2022arXiv

On the dual relation in the Hawking--Page phase transition of the black holes in a cavity

The Hawking--Page phase transitions of the $d$-dimensional Schwarzschild and charged black holes are explored in a cavity. The phase transition temperature $T_{\rm HP}$, the minimum black hole temperature $T_0$, and the Gibbs free energy $G$ are systematically calculated. A dual relation for the Schwarzschild black holes in the anti-de Sitter space, $T_{\rm HP}(d)=T_0(d+1)$, is found to be also approximately valid in the cavity case to a high precision, and this relation can be further generalized to the charged black holes in a suitable form. Our work reveals the universal properties of the black holes in different extended phase spaces and motivates further studies on their thermodynamic behaviors that are sensitive to specific boundary conditions, like the terminal points in the $G$--$T$ curves.

preprint2022arXiv

On value distribution of certain delay-differential polynomials

Given an entire function $f$ of finite order $ρ$, let $L(z,f)=\sum_{j=0}^{m}b_{j}(z)f^{(k_{j})}(z+c_{j})$ be a linear delay-differential polynomial of $f$ with small coefficients in the sense of $O(r^{λ+\varepsilon})+S(r,f)$, $λ<ρ$. Provided $α$, $β$ be similar small functions, we consider the zero distribution of $L(z,f)-αf^{n}-β$ for $n\geq 3$ and $n=2$, respectively. Our results are improvements and complements of Chen(Abstract Appl. Anal., 2011, 2011: ID239853, 1--9), and Laine (J. Math. Anal. Appl. 2019, 469(2): 808--826.), etc.

preprint2022arXiv

Restarted randomized surrounding methods for solving large linear equations

A class of restarted randomized surrounding methods are presented to accelerate the surrounding algorithms by restarted techniques for solving the linear equations. Theoretical analysis prove that the proposed method converges under the randomized row selection rule and the expectation convergence rate is also addressed. Numerical experiments further demonstrate that the proposed algorithms are efficient and outperform the existing method for over-determined and under-determined linear equation, as well as in the application of image processing.

preprint2022arXiv

Robust Action Governor for Uncertain Piecewise Affine Systems with Non-convex Constraints and Safe Reinforcement Learning

The action governor is an add-on scheme to a nominal control loop that monitors and adjusts the control actions to enforce safety specifications expressed as pointwise-in-time state and control constraints. In this paper, we introduce the Robust Action Governor (RAG) for systems the dynamics of which can be represented using discrete-time Piecewise Affine (PWA) models with both parametric and additive uncertainties and subject to non-convex constraints. We develop the theoretical properties and computational approaches for the RAG. After that, we introduce the use of the RAG for realizing safe Reinforcement Learning (RL), i.e., ensuring all-time constraint satisfaction during online RL exploration-and-exploitation process. This development enables safe real-time evolution of the control policy and adaptation to changes in the operating environment and system parameters (due to aging, damage, etc.). We illustrate the effectiveness of the RAG in constraint enforcement and safe RL using the RAG by considering their applications to a soft-landing problem of a mass-spring-damper system.

preprint2022arXiv

Survey on Evolutionary Deep Learning: Principles, Algorithms, Applications and Open Issues

Over recent years, there has been a rapid development of deep learning (DL) in both industry and academia fields. However, finding the optimal hyperparameters of a DL model often needs high computational cost and human expertise. To mitigate the above issue, evolutionary computation (EC) as a powerful heuristic search approach has shown significant merits in the automated design of DL models, so-called evolutionary deep learning (EDL). This paper aims to analyze EDL from the perspective of automated machine learning (AutoML). Specifically, we firstly illuminate EDL from machine learning and EC and regard EDL as an optimization problem. According to the DL pipeline, we systematically introduce EDL methods ranging from feature engineering, model generation, to model deployment with a new taxonomy (i.e., what and how to evolve/optimize), and focus on the discussions of solution representation and search paradigm in handling the optimization problem by EC. Finally, key applications, open issues and potentially promising lines of future research are suggested. This survey has reviewed recent developments of EDL and offers insightful guidelines for the development of EDL.

preprint2022arXiv

The Quasar Candidates Catalogs of DESI Legacy Imaging Survey Data Release 9

Quasars can be used to measure baryon acoustic oscillations at high redshift, which are considered as direct tracers of the most distant large-scale structures in the Universe. It is fundamental to select quasars from observations before implementing the above research. This work focuses on creating a catalog of quasar candidates based on photometric data to provide primary priors for further object classification with spectroscopic data in the future, such as The Dark Energy Spectroscopic Instrument (DESI) Survey. We adopt a machine learning algorithm (Random Forest, RF) for quasar identification. The training set includes $651,073$ positives and $1,227,172$ negatives, in which the photometric information are from DESI Legacy Imaging Surveys (DESI-LIS) \& Wide-field Infrared Survey Explore (WISE), and the labels are from a database of spectroscopically confirmed quasars based on Sloan Digital Sky Survey (SDSS) and the Set of Identifications \& Measurements and Bibliography for Astronomical Data (SIMBAD). The trained RF model is applied to point-like sources in DESI-LIS Data Release 9. To quantify the classifier&#39;s performance, we also inject a testing set into the to-be-applied data. Eventually, we obtained $1,953,932$ Grade-A quasar candidates and $22,486, 884$ Grade-B quasar candidates out of $425,540,269$ sources ($\sim 5.7\%$). The catalog covers $\sim 99\%$ of quasars in the to-be-applied data by evaluating the completeness of the classification on the testing set. The statistical properties of the candidates agree with that given by the method of color-cut selection. Our catalog can intensely decrease the workload for confirming quasars with the upcoming DESI data by eliminating enormous non-quasars but remaining high completeness. All data in this paper is publicly available online.

preprint2021arXiv

Auto-identification of unphysical source reconstructions in strong gravitational lens modelling

With the advent of next-generation surveys and the expectation of discovering huge numbers of strong gravitational lens systems, much effort is being invested into developing automated procedures for handling the data. The several orders of magnitude increase in the number of strong galaxy-galaxy lens systems is an insurmountable challenge for traditional modelling techniques. Whilst machine learning techniques have dramatically improved the efficiency of lens modelling, parametric modelling of the lens mass profile remains an important tool for dealing with complex lensing systems. In particular, source reconstruction methods are necessary to cope with the irregular structure of high-redshift sources. In this paper, we consider a Convolutional Neural Network (CNN) that analyses the outputs of semi-analytic methods which parametrically model the lens mass and linearly reconstruct the source surface brightness distribution. We show the unphysical source reconstructions that arise as a result of incorrectly initialised lens models can be effectively caught by our CNN. Furthermore, the CNN predictions can be used to automatically re-initialise the parametric lens model, avoiding unphysical source reconstructions. The CNN, trained on reconstructions of lensed Sérsic sources, accurately classifies source reconstructions of the same type with a precision $P > 0.99$ and recall $R > 0.99$. The same CNN, without re-training, achieves $P=0.89$ and $R=0.89$ when classifying source reconstructions of more complex lensed HUDF sources. Using the CNN predictions to re-initialise the lens modelling procedure, we achieve a 69 per cent decrease in the occurrence of unphysical source reconstructions. This combined CNN and parametric modelling approach can greatly improve the automation of lens modelling.

preprint2021arXiv

Beating humans in a penny-matching game by leveraging cognitive hierarchy theory and Bayesian learning

It is a long-standing goal of artificial intelligence (AI) to be superior to human beings in decision making. Games are suitable for testing AI capabilities of making good decisions in non-numerical tasks. In this paper, we develop a new AI algorithm to play the penny-matching game considered in Shannon&#39;s &#34;mind-reading machine&#34; (1953) against human players. In particular, we exploit cognitive hierarchy theory and Bayesian learning techniques to continually evolve a model for predicting human player decisions, and let the AI player make decisions according to the model predictions to pursue the best chance of winning. Experimental results show that our AI algorithm beats 27 out of 30 volunteer human players.

preprint2021arXiv

Coordinated Receding-Horizon Control of Battery Electric Vehicle Speed and Gearshift Using Relaxed Mixed Integer Nonlinear Programming

In this paper, we propose an approach to coordinated receding-horizon control of vehicle speed and transmission gearshift for automated battery electric vehicles (BEVs) to achieve improved energy efficiency. The introduction of multi-speed transmissions in BEVs creates an opportunity to manipulate the operating point of electric motors under given vehicle speed and acceleration command, thus providing the potential to further improve the energy efficiency. However, co-optimization of vehicle speed and transmission gearshift leads to a mixed integer nonlinear program (MINLP), solving which can be computationally very challenging. In this paper, we propose a novel continuous relaxation technique to treat such MINLPs that makes it possible to compute solutions with conventional nonlinear programming solvers. After analyzing its theoretical properties, we use it to solve the optimization problem involved in coordinated receding-horizon control of BEV speed and gearshift. Through simulation studies, we show that co-optimizing vehicle speed and transmission gearshift can achieve considerably greater energy efficiency than optimizing them sequentially, and the proposed relaxation technique can reduce the online computational cost to a level that is comparable to the time available for real-time implementation.

preprint2021arXiv

Damage accumulation during high temperature fatigue of Ti/SiC$_f$ metal matrix composites under different stress amplitudes

The damage mechanisms and load redistribution of high strength TC17 titanium alloy/unidirectional SiC fibre composite (fibre diameter = 100 $μ$m) under high temperature (350 °C) fatigue cycling have been investigated in situ using synchrotron X-ray computed tomography (CT) and X-ray diffraction (XRD) for high cycle fatigue (HCF) under different stress amplitudes. The three-dimensional morphology of the crack and fibre fractures has been mapped by CT. During stable growth, matrix cracking dominates with the crack deflecting (by 50-100 $μ$m in height) when bypassing bridging fibres. A small number of bridging fibres have fractured close to the matrix crack plane especially under relatively high stress amplitude cycling. Loading to the peak stress led to rapid crack growth accompanied by a burst of fibre fractures. Many of the fibre fractures occurred 50-300 $μ$m from the matrix crack plane during rapid growth, in contrast to that in the stable growth stage, leading to extensive fibre pull-out on the fracture surface. The changes in fibre loading, interfacial stress, and the extent of fibre-matrix debonding in the vicinity of the crack have been mapped for the fatigue cycle and after the rapid growth by high spatial resolution XRD. The fibre/matrix interfacial sliding extends up to 600 $μ$m (in the stable growth zone) or 700 $μ$m (in the rapid growth zone) either side of the crack plane. The direction of interfacial shear stress reverses with the loading cycle, with the maximum frictional sliding stress reaching ~55 MPa in both the stable growth and rapid growth regimes.

preprint2021arXiv

Hawking--Page phase transitions in four-dimensional Einstein--Gauss--Bonnet gravity

The Hawking-Page (HP) phase transitions of the anti-de Sitter black holes in the extended phase space are studied in a novel four-dimensional Einstein-Gauss-Bonnet (4EGB) gravity, which is proposed by rescaling the Gauss--Bonnet (GB) coupling constant $α\toα/(d-4)$ in $d$ dimensions and redefining the four-dimensional gravity in the limit $d \to 4$. The GB term shows nontrivial contributions to both black hole mass and entropy simultaneously, and decreases the HP phase transition temperature $T_{\rm HP}$. Moreover, the HP phase transitions can happen only within a range of pressure in the 4EGB gravity. For the charged black holes, $T_{\rm HP}$ also decreases with the electric potential in the grand canonical ensemble. A general discussion of the HP phase transitions in the Einstein, GB, and 4EGB gravities is also presented.

preprint2021arXiv

JUNO Physics and Detector

The Jiangmen Underground Neutrino Observatory (JUNO) is a 20 kton LS detector at 700-m underground. An excellent energy resolution and a large fiducial volume offer exciting opportunities for addressing many important topics in neutrino and astro-particle physics. With 6 years of data, the neutrino mass ordering can be determined at 3-4 sigma and three oscillation parameters can be measured to a precision of 0.6% or better by detecting reactor antineutrinos. With 10 years of data, DSNB could be observed at 3-sigma; a lower limit of the proton lifetime of 8.34e33 years (90% C.L.) can be set by searching for p->nu_bar K^+; detection of solar neutrinos would shed new light on the solar metallicity problem and examine the vacuum-matter transition region. A core-collapse supernova at 10 kpc would lead to ~5000 IBD and ~2000 (300) all-flavor neutrino-proton (electron) scattering events. Geo-neutrinos can be detected with a rate of ~400 events/year. We also summarize the final design of the JUNO detector and the key R&D achievements. All 20-inch PMTs have been tested. The average photon detection efficiency is 28.9% for the 15,000 MCP PMTs and 28.1% for the 5,000 dynode PMTs, higher than the JUNO requirement of 27%. Together with the >20 m attenuation length of LS, we expect a yield of 1345 p.e. per MeV and an effective energy resolution of 3.02%/\sqrt{E (MeV)}$ in simulations. The underwater electronics is designed to have a loss rate <0.5% in 6 years. With degassing membranes and a micro-bubble system, the radon concentration in the 35-kton water pool could be lowered to <10 mBq/m^3. Acrylic panels of radiopurity <0.5 ppt U/Th are produced. The 20-kton LS will be purified onsite. Singles in the fiducial volume can be controlled to ~10 Hz. The JUNO experiment also features a double calorimeter system with 25,600 3-inch PMTs, a LS testing facility OSIRIS, and a near detector TAO.

preprint2021arXiv

Kinematics and star formation toward W33: a central hub as a hub--filament system

We performed a large-scale mapping observation toward the W33 complex and its surroundings, covering an area of $1.3^\circ \times 1.0^\circ$ , in $^{12}$CO (1-0), $^{13}$CO (1-0), and C$^{18}$O (1-0) lines from the Purple Mountain Observatory (PMO). We found a new hub--filament system ranging from 30 to 38.5 \kms located at the W33 complex. Three supercritical filaments are directly converging into the central hub W33. Velocity gradients are detected along the filaments and the accretion rates are in order of $\rm 10^{-3}\,M_\odot\, yr^{-1}$. The central hub W33 has a total mass of $\rm\sim 1.8\times10^5\,M_\odot$, accounting for $\sim 60\%$ of the mass of the hub--filament system. This indicates that the central hub is the mass reservoir of the hub-filament system. Furthermore, 49 ATLASGAL clumps are associated with the hub--filament system. We find $57\%$ of the clumps to be situated in the central hub W33 and clustered at the intersections between the filaments and the W33 complex. Moreover, the distribution of Class I young stellar objects (YSOs) forms a structure resembling the hub--filament system and peaks at where the clumps group; it seems to suggest that the mechanisms of clump formation and star formation in this region are correlated. Gas flows along the filaments are likely to feed the materials into the intersections and lead to the clustering and formation of the clumps in the hub--filament system W33. The star formation in the intersections between the filaments and the W33 complex might be triggered by the motion of gas converging into the intersections.

preprint2021arXiv

Optimization of graded filleted lattice structures subject to yield and buckling constraints

To reduce the stress concentration and ensure the structural safety for lattice structure designs, in this paper, a new optimization framework is developed for the optimal design of graded lattice structures, innovatively integrating fillet designs as well as yield and elastic buckling constraints. Both strut and fillet radii are defined as design variables. Homogenization method is employed to characterize the effective elastic constants and yield stresses of the lattice metamaterials. Metamaterial models are developed to represent the relationships between the metamaterial effective properties and lattice geometric variables. A yield constraint, based on the modified Hills yield criterion, is developed as a function of relative strut radii and fillet parameters. An elastic buckling constraint, based on the Euler buckling formula and the Johnson formula, is developed as a function of relative strut radii. Both yield and buckling constraints are integrated into an optimization problem formulation; a new optimization framework is proposed and a case study of minimizing the compliance of a Messerschmitt-Bolkow-Blohm beam is conducted. The yield and buckling constraints guarantee the safety of the optimized beams composed of BCC and PC lattices. Reductions in compliance and stress concentration are achieved by the optimized MBB beams.

preprint2021arXiv

Some results on transcendental entire solutions of certain nonlinear differential-difference equations

In this paper, we study the transcendental entire solutions for the nonlinear differential-difference equations of the forms: $f^{2}(z)+\widetildeω f(z)f&#39;(z)+q(z)e^{Q(z)}f(z+c)=u(z)e^{v(z)}$, and $f^{n}(z)+ωf^{n-1}(z)f&#39;(z)+q(z)e^{Q(z)}f(z+c)=p_{1}e^{λ_{1} z}+p_{2}e^{λ_{2} z}, \quad n\geq 3,$ where $ω$ is a constant, $\widetildeω, c, λ_{1}, λ_{2}, p_{1}, p_{2}$ are non-zero constants, $q, Q, u, v$ are polynomials such that $Q,v$ are not constants and $q,u\not\equiv0$. Our results are improvements and complements of some previous results.

preprint2021arXiv

The LSST DESC DC2 Simulated Sky Survey

We describe the simulated sky survey underlying the second data challenge (DC2) carried out in preparation for analysis of the Vera C. Rubin Observatory Legacy Survey of Space and Time (LSST) by the LSST Dark Energy Science Collaboration (LSST DESC). Significant connections across multiple science domains will be a hallmark of LSST; the DC2 program represents a unique modeling effort that stresses this interconnectivity in a way that has not been attempted before. This effort encompasses a full end-to-end approach: starting from a large N-body simulation, through setting up LSST-like observations including realistic cadences, through image simulations, and finally processing with Rubin&#39;s LSST Science Pipelines. This last step ensures that we generate data products resembling those to be delivered by the Rubin Observatory as closely as is currently possible. The simulated DC2 sky survey covers six optical bands in a wide-fast-deep (WFD) area of approximately 300 deg^2 as well as a deep drilling field (DDF) of approximately 1 deg^2. We simulate 5 years of the planned 10-year survey. The DC2 sky survey has multiple purposes. First, the LSST DESC working groups can use the dataset to develop a range of DESC analysis pipelines to prepare for the advent of actual data. Second, it serves as a realistic testbed for the image processing software under development for LSST by the Rubin Observatory. In particular, simulated data provide a controlled way to investigate certain image-level systematic effects. Finally, the DC2 sky survey enables the exploration of new scientific ideas in both static and time-domain cosmology.

preprint2020arXiv

A Game Theoretic Approach for Parking Spot Search with Limited Parking Lot Information

We propose a game theoretic approach to address the problem of searching for available parking spots in a parking lot and picking the ``optimal&#39;&#39; one to park. The approach exploits limited information provided by the parking lot, i.e., its layout and the current number of cars in it. Considering the fact that such information is or can be easily made available for many structured parking lots, the proposed approach can be applicable without requiring major updates to existing parking facilities. For large parking lots, a sampling-based strategy is integrated with the proposed approach to overcome the associated computational challenge. The proposed approach is compared against a state-of-the-art heuristic-based parking spot search strategy in the literature through simulation studies and demonstrates its advantage in terms of achieving lower cost function values.

preprint2020arXiv

A Neural Architecture Search based Framework for Liquid State Machine Design

Liquid State Machine (LSM), also known as the recurrent version of Spiking Neural Networks (SNN), has attracted great research interests thanks to its high computational power, biological plausibility from the brain, simple structure and low training complexity. By exploring the design space in network architectures and parameters, recent works have demonstrated great potential for improving the accuracy of LSM model with low complexity. However, these works are based on manually-defined network architectures or predefined parameters. Considering the diversity and uniqueness of brain structure, the design of LSM model should be explored in the largest search space possible. In this paper, we propose a Neural Architecture Search (NAS) based framework to explore both architecture and parameter design space for automatic dataset-oriented LSM model. To handle the exponentially-increased design space, we adopt a three-step search for LSM, including multi-liquid architecture search, variation on the number of neurons and parameters search such as percentage connectivity and excitatory neuron ratio within each liquid. Besides, we propose to use Simulated Annealing (SA) algorithm to implement the three-step heuristic search. Three datasets, including image dataset of MNIST and NMNIST and speech dataset of FSDD, are used to test the effectiveness of our proposed framework. Simulation results show that our proposed framework can produce the dataset-oriented optimal LSM models with high accuracy and low complexity. The best classification accuracy on the three datasets is 93.2%, 92.5% and 84% respectively with only 1000 spiking neurons, and the network connections can be averagely reduced by 61.4% compared with a single LSM. Moreover, we find that the total quantity of neurons in optimal LSM models on three datasets can be further reduced by 20% with only about 0.5% accuracy loss.

preprint2020arXiv

Action Governor for Discrete-Time Linear Systems with Non-Convex Constraints

This paper introduces an add-on, supervisory scheme, referred to as Action Governor (AG), for discrete-time linear systems to enforce exclusion-zone avoidance requirements. It does so by monitoring, and minimally modifying when necessary, the nominal control signal to a constraint-admissible one. The AG operates based on set-theoretic techniques and online optimization. This paper establishes its theoretical foundation, discusses its computational realization, and uses two simulation examples to illustrate its effectiveness.

preprint2020arXiv

Domain Priori Knowledge based Integrated Solution Design for Internet of Services

Various types of services, such as web APIs, IoT services, O2O services, and many others, have flooded on the Internet. Interconnections among these services have resulted in a new phenomenon called &#34;Internet of Services&#34; (IoS). By IoS,people don&#39;t need to request multiple services by themselves to fulfill their daily requirements, but it is an IoS platform that is responsible for constructing integrated solutions for them. Since user requirements (URs) are usually coarse-grained and transboundary, IoS platforms have to integrate services from multiple domains to fulfill the requirements. Considering there are too many available services in IoS, a big challenge is how to look for a tradeoff between the construction efficiency and the precision of final solutions. For this challenge, we introduce a framework and a platform for transboundary user requirement oriented solution design in IoS. The main idea is to make use of domain priori knowledge derived from the commonness and similarities among massive historical URs and among historical integrated service solutions(ISSs). Priori knowledge is classified into three types: requirement patterns (RPs), service patterns (SPs), and probabilistic matching matrix (PMM) between RPs and SPs. A UR is modeled in the form of an intention tree (ITree) along with a set of constraints on intention nodes, and then optimal RPs are selected to cover the I-Tree as much as possible. By taking advantage of the PMM, a set of SPs are filtered out and composed together to form the final ISS. Finally, the design of a platform supporting the above process is introduced.

preprint2020arXiv

End-to-End Learnable Geometric Vision by Backpropagating PnP Optimization

Deep networks excel in learning patterns from large amounts of data. On the other hand, many geometric vision tasks are specified as optimization problems. To seamlessly combine deep learning and geometric vision, it is vital to perform learning and geometric optimization end-to-end. Towards this aim, we present BPnP, a novel network module that backpropagates gradients through a Perspective-n-Points (PnP) solver to guide parameter updates of a neural network. Based on implicit differentiation, we show that the gradients of a &#34;self-contained&#34; PnP solver can be derived accurately and efficiently, as if the optimizer block were a differentiable function. We validate BPnP by incorporating it in a deep model that can learn camera intrinsics, camera extrinsics (poses) and 3D structure from training datasets. Further, we develop an end-to-end trainable pipeline for object pose estimation, which achieves greater accuracy by combining feature-based heatmap losses with 2D-3D reprojection errors. Since our approach can be extended to other optimization problems, our work helps to pave the way to perform learnable geometric vision in a principled manner. Our PyTorch implementation of BPnP is available on http://github.com/BoChenYS/BPnP.

preprint2020arXiv

Estimation of genomic characteristics by analyzing k-mer frequency in de novo genome projects

Background: With the fast development of next generation sequencing technologies, increasing numbers of genomes are being de novo sequenced and assembled. However, most are in fragmental and incomplete draft status, and thus it is often difficult to know the accurate genome size and repeat content. Furthermore, many genomes are highly repetitive or heterozygous, posing problems to current assemblers utilizing short reads. Therefore, it is necessary to develop efficient assembly-independent methods for accurate estimation of these genomic characteristics. Results: Here we present a framework for modeling the distribution of k-mer frequency from sequencing data and estimating the genomic characteristics such as genome size, repeat structure and heterozygous rate. By introducing novel techniques of k-mer individuals, float precision estimation, and proper treatment of sequencing error and coverage bias, the estimation accuracy of our method is significantly improved over existing methods. We also studied how the various genomic and sequencing characteristics affect the estimation accuracy using simulated sequencing data, and discussed the limitations on applying our method to real sequencing data. Conclusion: Based on this research, we show that the k-mer frequency analysis can be used as a general and assembly-independent method for estimating genomic characteristics, which can improve our understanding of a species genome, help design the sequencing strategy of genome projects, and guide the development of assembly algorithms. The programs developed in this research are written using C/C++, and freely accessible at Github URL (https://github.com/fanagislab/GCE) or BGI ftp ( ftp://ftp.genomics.org.cn/pub/gce).

preprint2020arXiv

Feasibility and physics potential of detecting $^8$B solar neutrinos at JUNO

The Jiangmen Underground Neutrino Observatory~(JUNO) features a 20~kt multi-purpose underground liquid scintillator sphere as its main detector. Some of JUNO&#39;s features make it an excellent experiment for $^8$B solar neutrino measurements, such as its low-energy threshold, its high energy resolution compared to water Cherenkov detectors, and its much large target mass compared to previous liquid scintillator detectors. In this paper we present a comprehensive assessment of JUNO&#39;s potential for detecting $^8$B solar neutrinos via the neutrino-electron elastic scattering process. A reduced 2~MeV threshold on the recoil electron energy is found to be achievable assuming the intrinsic radioactive background $^{238}$U and $^{232}$Th in the liquid scintillator can be controlled to 10$^{-17}$~g/g. With ten years of data taking, about 60,000 signal and 30,000 background events are expected. This large sample will enable an examination of the distortion of the recoil electron spectrum that is dominated by the neutrino flavor transformation in the dense solar matter, which will shed new light on the tension between the measured electron spectra and the predictions of the standard three-flavor neutrino oscillation framework. If $Δm^{2}_{21}=4.8\times10^{-5}~(7.5\times10^{-5})$~eV$^{2}$, JUNO can provide evidence of neutrino oscillation in the Earth at the about 3$σ$~(2$σ$) level by measuring the non-zero signal rate variation with respect to the solar zenith angle. Moveover, JUNO can simultaneously measure $Δm^2_{21}$ using $^8$B solar neutrinos to a precision of 20\% or better depending on the central value and to sub-percent precision using reactor antineutrinos. A comparison of these two measurements from the same detector will help elucidate the current tension between the value of $Δm^2_{21}$ reported by solar neutrino experiments and the KamLAND experiment.

preprint2020arXiv

Game-theoretic Modeling of Traffic in Unsignalized Intersection Network for Autonomous Vehicle Control Verification and Validation

For a foreseeable future, autonomous vehicles (AVs) will operate in traffic together with human-driven vehicles. Their planning and control systems need extensive testing, including early-stage testing in simulations where the interactions among autonomous/human-driven vehicles are represented. Motivated by the need for such simulation tools, we propose a game-theoretic approach to modeling vehicle interactions, in particular, for urban traffic environments with unsignalized intersections. We develop traffic models with heterogeneous (in terms of their driving styles) and interactive vehicles based on our proposed approach, and use them for virtual testing, evaluation, and calibration of AV control systems. For illustration, we consider two AV control approaches, analyze their characteristics and performance based on the simulation results with our developed traffic models, and optimize the parameters of one of them.

preprint2020arXiv

Gluing of multiple Alexandrov spaces

In this paper we discuss the sufficient and necessary conditions for multiple Alexandrov spaces being glued to an Alexandrov space. We propose a Gluing Conjecture, which says that the finite gluing of Alexandrov spaces is an Alexandrov space, if and only if the gluing is by path isometry along the boundaries and the tangent cones are glued to Alexandrov spaces. This generalizes Petrunin&#39;s Gluing Theorem. Under the assumptions of the Gluing Conjecture, we classify the $2$-point gluing over $(n-1,ε)$-regular points as local separable gluing and the gluing near un-glued $(n-1,ε)$-regular points as local involutional gluing. We also prove that the Gluing Conjecture is true if the complement of $(n-1,ε)$-regular points is discrete in the glued boundary. In particular, this implies the general Gluing Conjecture as well as a new Gluing Theorem in dimension 2.

preprint2020arXiv

Identifying Strong Lenses with Unsupervised Machine Learning using Convolutional Autoencoder

In this paper we develop a new unsupervised machine learning technique comprised of a feature extractor, a convolutional autoencoder (CAE), and a clustering algorithm consisting of a Bayesian Gaussian mixture model (BGM). We apply this technique to visual band space-based simulated imaging data from the Euclid Space Telescope using data from the Strong Gravitational Lenses Finding Challenge. Our technique promisingly captures a variety of lensing features such as Einstein rings with different radii, distorted arc structures, etc, without using predefined labels. After the clustering process, we obtain several classification clusters separated by different visual features which are seen in the images. Our method successfully picks up $\sim$63\ percent of lensing images from all lenses in the training set. With the assumed probability proposed in this study, this technique reaches an accuracy of $77.25\pm 0.48$\% in binary classification using the training set. Additionally, our unsupervised clustering process can be used as the preliminary classification for future surveys of lenses to efficiently select targets and to speed up the labelling process. As the starting point of the astronomical application using this technique, we not only explore the application to gravitationally lensed systems, but also discuss the limitations and potential future uses of this technique.

preprint2020arXiv

Maximizing Cumulative User Engagement in Sequential Recommendation: An Online Optimization Perspective

To maximize cumulative user engagement (e.g. cumulative clicks) in sequential recommendation, it is often needed to tradeoff two potentially conflicting objectives, that is, pursuing higher immediate user engagement (e.g., click-through rate) and encouraging user browsing (i.e., more items exposured). Existing works often study these two tasks separately, thus tend to result in sub-optimal results. In this paper, we study this problem from an online optimization perspective, and propose a flexible and practical framework to explicitly tradeoff longer user browsing length and high immediate user engagement. Specifically, by considering items as actions, user&#39;s requests as states and user leaving as an absorbing state, we formulate each user&#39;s behavior as a personalized Markov decision process (MDP), and the problem of maximizing cumulative user engagement is reduced to a stochastic shortest path (SSP) problem. Meanwhile, with immediate user engagement and quit probability estimation, it is shown that the SSP problem can be efficiently solved via dynamic programming. Experiments on real-world datasets demonstrate the effectiveness of the proposed approach. Moreover, this approach is deployed at a large E-commerce platform, achieved over 7% improvement of cumulative clicks.

preprint2020arXiv

Off-road Autonomous Vehicles Traversability Analysis and Trajectory Planning Based on Deep Inverse Reinforcement Learning

Terrain traversability analysis is a fundamental issue to achieve the autonomy of a robot at off-road environments. Geometry-based and appearance-based methods have been studied in decades, while behavior-based methods exploiting learning from demonstration (LfD) are new trends. Behavior-based methods learn cost functions that guide trajectory planning in compliance with experts&#39; demonstrations, which can be more scalable to various scenes and driving behaviors. This research proposes a method of off-road traversability analysis and trajectory planning using Deep Maximum Entropy Inverse Reinforcement Learning. To incorporate vehicle&#39;s kinematics while solving the problem of exponential increase of state-space complexity, two convolutional neural networks, i.e., RL ConvNet and Svf ConvNet, are developed to encode kinematics into convolution kernels and achieve efficient forward reinforcement learning. We conduct experiments in off-road environments. Scene maps are generated using 3D LiDAR data, and expert demonstrations are either the vehicle&#39;s real driving trajectories at the scene or synthesized ones to represent specific behaviors such as crossing negative obstacles. Different cost functions of traversability analysis are learned and tested at various scenes of capability in guiding the trajectory planning of different behaviors. We also demonstrate the performance and computation efficiency of the proposed method.

preprint2020arXiv

On algebraic differential equations concerning the Riemann-zeta function and the Euler-gamma function

In this paper, we prove that $ζ$ is not a solution of any non-trivial algebraic differential equation whose coefficients are polynomials in $Γ, Γ^{(n)}, Γ^{(l)}$ over the ring of polynomials in $\mathbb{C}$, $l>n\geq 1$ are positive integers. We extended the result that $ζ$ does not satisfy any non-trivial algebraic differential equation whose coefficients are polynomials in $Γ, Γ&#39;, Γ&#39;&#39;$ over the field of complex numbers, which is proved by Li and Ye[7].

preprint2020arXiv

Optimising Automatic Morphological Classification of Galaxies with Machine Learning and Deep Learning using Dark Energy Survey Imaging

There are several supervised machine learning methods used for the application of automated morphological classification of galaxies; however, there has not yet been a clear comparison of these different methods using imaging data, or a investigation for maximising their effectiveness. We carry out a comparison between several common machine learning methods for galaxy classification (Convolutional Neural Network (CNN), K-nearest neighbour, Logistic Regression, Support Vector Machine, Random Forest, and Neural Networks) by using Dark Energy Survey (DES) data combined with visual classifications from the Galaxy Zoo 1 project (GZ1). Our goal is to determine the optimal machine learning methods when using imaging data for galaxy classification. We show that CNN is the most successful method of these ten methods in our study. Using a sample of $\sim$2,800 galaxies with visual classification from GZ1, we reach an accuracy of $\sim$0.99 for the morphological classification of Ellipticals and Spirals. The further investigation of the galaxies that have a different ML and visual classification but with high predicted probabilities in our CNN usually reveals an the incorrect classification provided by GZ1. We further find the galaxies having a low probability of being either spirals or ellipticals are visually Lenticulars (S0), demonstrating that supervised learning is able to rediscover that this class of galaxy is distinct from both Es and Spirals. We confirm that $\sim$2.5\% galaxies are misclassified by GZ1 in our study. After correcting these galaxies&#39; labels, we improve our CNN performance to an average accuracy of over 0.99 (accuracy of 0.994 is our best result).

preprint2020arXiv

ReADS: A Rectified Attentional Double Supervised Network for Scene Text Recognition

In recent years, scene text recognition is always regarded as a sequence-to-sequence problem. Connectionist Temporal Classification (CTC) and Attentional sequence recognition (Attn) are two very prevailing approaches to tackle this problem while they may fail in some scenarios respectively. CTC concentrates more on every individual character but is weak in text semantic dependency modeling. Attn based methods have better context semantic modeling ability while tends to overfit on limited training data. In this paper, we elaborately design a Rectified Attentional Double Supervised Network (ReADS) for general scene text recognition. To overcome the weakness of CTC and Attn, both of them are applied in our method but with different modules in two supervised branches which can make a complementary to each other. Moreover, effective spatial and channel attention mechanisms are introduced to eliminate background noise and extract valid foreground information. Finally, a simple rectified network is implemented to rectify irregular text. The ReADS can be trained end-to-end and only word-level annotations are required. Extensive experiments on various benchmarks verify the effectiveness of ReADS which achieves state-of-the-art performance.

preprint2020arXiv

TAO Conceptual Design Report: A Precision Measurement of the Reactor Antineutrino Spectrum with Sub-percent Energy Resolution

The Taishan Antineutrino Observatory (TAO, also known as JUNO-TAO) is a satellite experiment of the Jiangmen Underground Neutrino Observatory (JUNO). A ton-level liquid scintillator detector will be placed at about 30 m from a core of the Taishan Nuclear Power Plant. The reactor antineutrino spectrum will be measured with sub-percent energy resolution, to provide a reference spectrum for future reactor neutrino experiments, and to provide a benchmark measurement to test nuclear databases. A spherical acrylic vessel containing 2.8 ton gadolinium-doped liquid scintillator will be viewed by 10 m^2 Silicon Photomultipliers (SiPMs) of >50% photon detection efficiency with almost full coverage. The photoelectron yield is about 4500 per MeV, an order higher than any existing large-scale liquid scintillator detectors. The detector operates at -50 degree C to lower the dark noise of SiPMs to an acceptable level. The detector will measure about 2000 reactor antineutrinos per day, and is designed to be well shielded from cosmogenic backgrounds and ambient radioactivities to have about 10% background-to-signal ratio. The experiment is expected to start operation in 2022.

preprint2020arXiv

The Hawking-Page phase transitions in the extended phase space in the Gauss-Bonnet gravity

In this paper, the Hawking-Page phase transitions between the black holes and thermal anti-de Sitter (AdS) space are studied with the Gauss-Bonnet term in the extended phase space, in which the varying cosmological constant plays the role of an effective thermodynamic pressure. The Gauss-Bonnet term exhibits its effects via introducing the corrections to the black hole entropy and Gibbs free energy. The global phase structures, especially the phase transition temperature $T_{\rm HP}$ and the Gibbs free energy $G$, are systematically investigated, first for the Schwarzschild-AdS black holes and then for the charged and rotating AdS black holes in the grand canonical ensembles, with both analytical and numerical methods. It is found that there are terminal points in the coexistence lines, and $T_{\rm HP}$ decreases at large electric potentials and angular velocities and also decreases with the Gauss-Bonnet coupling constant $α$.

preprint2020arXiv

Three results on transcendental meromorphic solutions of certain nonlinear differential equations

In this paper, we study the transcendental meromorphic solutions for the nonlinear differential equations: $f^{n}+P(f)=R(z)e^{α(z)}$ and $f^{n}+P_{*}(f)=p_{1}(z)e^{α_{1}(z)}+p_{2}(z)e^{α_{2}(z)}$ in the complex plane, where $P(f)$ and $P_{*}(f)$ are differential polynomials in $f$ of degree $n-1$ with coefficients being small functions and rational functions respectively, $R$ is a non-vanishing small function of $f$, $α$ is a nonconstant entire function, $p_{1}, p_{2}$ are non-vanishing rational functions, and $α_{1}, α_{2}$ are nonconstant polynomials. Particularly, we consider the solutions of the second equation when $p_{1}, p_{2}$ are nonzero constants, and $°α_{1}=°α_{2}=1$. Our results are improvements and complements of Liao (Complex Var. Elliptic Equ. 2015, 60(6): 748--756), and Rong-Xu (Mathematics 2019, 7, 539), etc., which partially answer a question proposed by Li (J. Math. Anal. Appl. 2011, 375: 310--319).

preprint2019arXiv

CosmoDC2: A Synthetic Sky Catalog for Dark Energy Science with LSST

This paper introduces cosmoDC2, a large synthetic galaxy catalog designed to support precision dark energy science with the Large Synoptic Survey Telescope (LSST). CosmoDC2 is the starting point for the second data challenge (DC2) carried out by the LSST Dark Energy Science Collaboration (LSST DESC). The catalog is based on a trillion-particle, 4.225 Gpc^3 box cosmological N-body simulation, the `Outer Rim&#39; run. It covers 440 deg^2 of sky area to a redshift of z=3 and is complete to a magnitude depth of 28 in the r-band. Each galaxy is characterized by a multitude of properties including stellar mass, morphology, spectral energy distributions, broadband filter magnitudes, host halo information and weak lensing shear. The size and complexity of cosmoDC2 requires an efficient catalog generation methodology; our approach is based on a new hybrid technique that combines data-driven empirical approaches with semi-analytic galaxy modeling. A wide range of observation-based validation tests has been implemented to ensure that cosmoDC2 enables the science goals of the planned LSST DESC DC2 analyses. This paper also represents the official release of the cosmoDC2 data set, including an efficient reader that facilitates interaction with the data.

preprint2014arXiv

Top Rank Optimization in Linear Time

Bipartite ranking aims to learn a real-valued ranking function that orders positive instances before negative instances. Recent efforts of bipartite ranking are focused on optimizing ranking accuracy at the top of the ranked list. Most existing approaches are either to optimize task specific metrics or to extend the ranking loss by emphasizing more on the error associated with the top ranked instances, leading to a high computational cost that is super-linear in the number of training instances. We propose a highly efficient approach, titled TopPush, for optimizing accuracy at the top that has computational complexity linear in the number of training instances. We present a novel analysis that bounds the generalization error for the top ranked instances for the proposed approach. Empirical study shows that the proposed approach is highly competitive to the state-of-the-art approaches and is 10-100 times faster.