Searcharxiv⌕ Search

arXiv subjects

Hong Wang

Publications and source records attributed to Hong Wang.

At least 217 records · Page 12Linked to original sources

Geometric Reductions, Dynamics and Controls for Hamiltonian System with Symmetry

This is a survey article, from the viewpoint of the completeness of the Marsden- Weinstein reduction, to introduce briefly some recent developments of the symmetric reductions and Hamilton-Jacobi theory of the regular controlled Hamiltonian systems, the nonholonomic controlled Hamiltonian systems and the controlled magnetic Hamiltonian systems. These research reveal the deeply internal relationships of the geometrical structures of phase spaces, the nonholonomic constraint, the dynamical vector fields and the controls of these systems.

math.SG↗

Limitations of Language Models in Arithmetic and Symbolic Induction

Recent work has shown that large pretrained Language Models (LMs) can not only perform remarkably well on a range of Natural Language Processing (NLP) tasks but also start improving on reasoning tasks such as arithmetic induction, symbolic manipulation, and commonsense reasoning with increasing size of models. However, it is still unclear what the underlying capabilities of these LMs are. Surprisingly, we find that these models have limitations on certain basic symbolic manipulation tasks such as copy, reverse, and addition. When the total number of symbols or repeating symbols increases, the model performance drops quickly. We investigate the potential causes behind this phenomenon and examine a set of possible methods, including explicit positional markers, fine-grained computation steps, and LMs with callable programs. Experimental results show that none of these techniques can solve the simplest addition induction problem completely. In the end, we introduce LMs with tutor, which demonstrates every single step of teaching. LMs with tutor is able to deliver 100% accuracy in situations of OOD and repeating symbols, shedding new insights on the boundary of large LMs in induction.

cs.CL↗

Galaxy Deblending using Residual Dense Neural networks

We present a new neural network approach for deblending galaxy images in astronomical data using Residual Dense Neural network (RDN) architecture. We train the network on synthetic galaxy images similar to the typical arrangements of field galaxies with a finite point spread function (PSF) and realistic noise levels. The main novelty of our approach is the usage of two distinct neural networks: i) a deblending network which isolates a single galaxy postage stamp from the composite and, ii) a classifier network which counts the remaining number of galaxies. The deblending proceeds by iteratively peeling one galaxy at a time from the composite until the image contains no further objects as determined by the classifier, or by other stopping criteria. By looking at the consistency in the outputs of the two networks, we can assess the quality of the deblending. We characterize the flux and shape reconstructions in different quality bins and compare our deblender with the industry standard, SExtractor. We also discuss possible future extensions for the project with variable PSFs and noise levels.

astro-ph.GA↗

Context-Consistent Semantic Image Editing with Style-Preserved Modulation

Semantic image editing utilizes local semantic label maps to generate the desired content in the edited region. A recent work borrows SPADE block to achieve semantic image editing. However, it cannot produce pleasing results due to style discrepancy between the edited region and surrounding pixels. We attribute this to the fact that SPADE only uses an image-independent local semantic layout but ignores the image-specific styles included in the known pixels. To address this issue, we propose a style-preserved modulation (SPM) comprising two modulations processes: The first modulation incorporates the contextual style and semantic layout, and then generates two fused modulation parameters. The second modulation employs the fused parameters to modulate feature maps. By using such two modulations, SPM can inject the given semantic layout while preserving the image-specific context style. Moreover, we design a progressive architecture for generating the edited content in a coarse-to-fine manner. The proposed method can obtain context-consistent results and significantly alleviate the unpleasant boundary between the generated regions and the known pixels.

cs.CV↗

Enhancing thermoelectric properties of isotope graphene nanoribbons via machine learning guided manipulation of disordered antidots and interfaces

Structural manipulation at the nanoscale breaks the intrinsic correlations among different energy carrier transport properties, achieving high thermoelectric performance. However, the coupled multifunctional (phonon and electron) transport in the design of nanomaterials makes the optimization of thermoelectric properties challenging. Machine learning brings convenience to the design of nanostructures with large degree of freedom. Herein, we conducted comprehensive thermoelectric optimization of isotopic armchair graphene nanoribbons (AGNRs) with antidots and interfaces by combining Green's function approach with machine learning algorithms. The optimal AGNR with ZT of 0.894 by manipulating antidots was obtained at the interfaces of the aperiodic isotope superlattices, which is 5.69 times larger than that of the pristine structure. The proposed optimal structure via machine learning provides physical insights that the carbon-13 atoms tend to form a continuous interface barrier perpendicular to the carrier transport direction to suppress the propagation of phonons through isotope AGNRs. The antidot effect is more effective than isotope substitution in improving the thermoelectric properties of AGNRs. The proposed approach coupling energy carrier transport property analysis with machine learning algorithms offers highly efficient guidance on enhancing the thermoelectric properties of low-dimensional nanomaterials, as well as to explore and gain non-intuitive physical insights.

cond-mat.mes-hall↗

Predicting Kidney Transplant Survival using Multiple Feature Representations for HLAs

Kidney transplantation can significantly enhance living standards for people suffering from end-stage renal disease. A significant factor that affects graft survival time (the time until the transplant fails and the patient requires another transplant) for kidney transplantation is the compatibility of the Human Leukocyte Antigens (HLAs) between the donor and recipient. In this paper, we propose 4 new biologically-relevant feature representations for incorporating HLA information into machine learning-based survival analysis algorithms. We evaluate our proposed HLA feature representations on a database of over 100,000 transplants and find that they improve prediction accuracy by about 1%, modest at the patient level but potentially significant at a societal level. Accurate prediction of survival times can improve transplant survival outcomes, enabling better allocation of donors to recipients and reducing the number of re-transplants due to graft failure with poorly matched donors.

cs.LG↗

Hamilton-Jacobi Equations of Controlled Magnetic Hamiltonian System with Nonholonomic Constraint

In order to describe the impact of different geometric structures and constraints for the dynamics of a regular controlled Hamiltonian system, in this paper, we first define a kind of controlled magnetic Hamiltonian (CMH) system, and give a good expression of the dynamical vector field of the CMH system, such that we can describe the magnetic vanishing condition and the CMH-equivalence, and derive precisely the geometric constraint conditions of the magnetic symplectic form for the dynamical vector field of the CMH system, which are called the Type I and Type II of Hamilton-Jacobi equation. Secondly, we prove that the CMH-equivalence for the CMH systems leaves the solutions of corresponding to Hamilton-Jacobi equations invariant, if the associated magnetic Hamiltonian systems are equivalent. Thirdly, we consider the CMH system with nonholonomic constraint, and derive a distributional CMH system, which is determined by a non-degenerate distributional two-form induced from the magnetic symplectic form. Then we drive precisely two types of Hamilton-Jacobi equation for the distributional CMH system. Moreover, we generalize the above results for the nonholonomic reducible CMH system with symmetry, and prove two types of Hamilton-Jacobi theorems for the nonholonomic reduced distributional CMH system. These research works reveal the deeply internal relationships of the magnetic symplectic forms, the nonholonomic constraints, the dynamical vector fields and controls of the CMH systems.

math.SG↗

Adaptive Convolutional Dictionary Network for CT Metal Artifact Reduction

Inspired by the great success of deep neural networks, learning-based methods have gained promising performances for metal artifact reduction (MAR) in computed tomography (CT) images. However, most of the existing approaches put less emphasis on modelling and embedding the intrinsic prior knowledge underlying this specific MAR task into their network designs. Against this issue, we propose an adaptive convolutional dictionary network (ACDNet), which leverages both model-based and learning-based methods. Specifically, we explore the prior structures of metal artifacts, e.g., non-local repetitive streaking patterns, and encode them as an explicit weighted convolutional dictionary model. Then, a simple-yet-effective algorithm is carefully designed to solve the model. By unfolding every iterative substep of the proposed algorithm into a network module, we explicitly embed the prior structure into a deep network, \emph{i.e.,} a clear interpretability for the MAR task. Furthermore, our ACDNet can automatically learn the prior for artifact-free CT images via training data and adaptively adjust the representation kernels for each input CT image based on its content. Hence, our method inherits the clear interpretability of model-based methods and maintains the powerful representation ability of learning-based methods. Comprehensive experiments executed on synthetic and clinical datasets show the superiority of our ACDNet in terms of effectiveness and model generalization. {\color{blue}{\textit{Code is available at {\url{https://github.com/hongwang01/ACDNet}.}}}}

eess.IV↗

Hamilton-Jacobi Equations of Nonholonomic Magnetic Hamiltonian Systems

In order to describe the impact of different geometric structures and constraints for the dynamics of a Hamiltonian system, in this paper, for a magnetic Hamiltonian system defined by a magnetic symplectic form, we first drive precisely the geometric constraint conditions of magnetic symplectic form for the magnetic Hamiltonian vector field.which are called the Type I and Type II of Hamilton-Jacobi equation. Secondly, for the magnetic Hamiltonian system with nonholonomic constraint, we first define a distributional magnetic Hamiltonian system, then derive its two types of Hamilton-Jacobi equation. Moreover, we generalize the above results to nonholonomic reducible magnetic Hamiltonian system with symmetry. We define a nonholonomic reduced distributional magnetic Hamiltonian system, and prove two types of Hamilton-Jacobi theorem. These research work reveal the deeply internal relationships of the magnetic symplectic structure, nonholonomic constraint, the distributional two-form, and the dynamical vector field of the nonholonomic magnetic Hamiltonian system.

math.SG↗

Toward the smooth mesh climbing of a miniature robot using bioinspired soft and expandable claws

While most micro-robots face difficulty traveling on rugged and uneven terrain, beetles can walk smoothly on the complex substrate without slipping or getting stuck on the surface due to their stiffness-variable tarsi and expandable hooks on the tip of tarsi. In this study, we found that beetles actively bent and expanded their claws regularly to crawl freely on mesh surfaces. Inspired by the crawling mechanism of the beetles, we designed an 8-cm miniature climbing robot equipping artificial claws to open and bend in the same cyclic manner as natural beetles. The robot can climb freely with a controllable gait on the mesh surface, steep incline of the angle of 60°, and even transition surface. To our best knowledge, this is the first micro-scale robot that can climb both the mesh surface and cliffy incline.

cs.RO↗

Searching for Variable Stars in the Open Cluster NGC 2355 and Its Surrounding Region

We have investigated the variable stars in the field surrounding NGC 2355 based on the time-series photometric observation data. More than 3000 CCD frames were obtained in the V band spread over 13 nights with the Nanshan One-meter Wide-field Telescope. We have detected 88 variable stars, containing 72 new variable stars and 16 known variable stars. By analyzing these light curves, we classified the variable stars as follows: 26 eclipsing binaries, 52 pulsating stars, 4 rotating variables, and 6 unclear type variable stars for which their periods are much longer than the time baseline chosen. Employing Gaia DR2 parallax, kinematics, and photometry, the cluster membership of these variable stars were also analyzed for NGC 2355. In addition to the 11 variable members reported by Cantat-Gaudin et al. (2018), we identify 4 more variable member candidates located at the outer region of NGC 2355 and showed homogeneity in space positions and kinematic properties with the cluster members. The main physical parameters of NGC 2355 estimated from the two-color and color-magnitude diagrams are log(age/yr) = 8.9, E(B - V) = 0.24 mag, and [Fe/H] = - 0.07 dex.

astro-ph.SR↗

A Holistic Robust Motion Controller Framework for Autonomous Platooning

Safety is the foremost concern for autonomous platooning. The vehicle-to-vehicle (V2V) communication delay and the sudden appearance of obstacles will trigger the safety of the intended functionality (SOTIF) issues for autonomous platooning. This research proposes a holistic robust motion controller framework (MCF) for an intelligent and connected vehicle platoon system. The MCF utilizes a hierarchical structure to resolve the longitudinal string stability and the lateral control problem under the complex driving environment and time-varying communication delay. Firstly, the H-infinity feedback controller is developed to ensure the robustness of the platoon under time-varying communication delay in the upper-level coordination layer (UCL). The output from UCL will be delivered to the lower-level motion-planning layer (LML) as reference signals. Secondly, the model predictive control (MPC) algorithm is implemented in the LML to achieve multi-objective control, which comprehensively considers the reference signals, the artificial potential field, and multiple vehicle dynamics constraints. Furthermore, three critical scenarios are co-simulated for case studies, including platooning under time-varying communication delay, merging, and obstacle avoidance scenarios. The simulation results indicate that, compared with single-structure MPC, the proposed MCF can offer a better suppression on position error propagation, and get improvements on maximum position error in the three scenarios by $19.2\%$, $59.8\%$, and $15.3\%$, respectively. Last, the practicability and effectiveness of the proposed MCF are verified via hardware-in-the-loop experiment. The average conducting time of the proposed method on Speedgoat real-time target machine is 1.1 milliseconds, which meets the real-time requirements.

eess.SY↗

A robotic leg inspired from an insect leg

While most insect-inspired robots come with a simple tarsus such as a hemispherical foot tip, insect legs have complex tarsal structures and claws, which enable them to walk on complex terrain. Their sharp claws can smoothly attach and detach on plant surfaces by actuating a single muscle. Thus, installing insect-inspired tarsus on legged robots would improve their locomotion on complex terrain. This paper shows that the tendon-driven ball-socket structure provides the tarsus both flexibility and rigidity, which is necessary for the beetle to walk on a complex substrate such as a mesh surface. Disabling the tarsus' rigidity by removing the socket and elastic membrane of a tarsal joint, the claws could not attach to the mesh securely. Meanwhile, the beetle struggled to draw the claws out of the substrate when we turned the tarsus rigid by tubing. We then developed a cable-driven bio-inspired tarsus structure to validate the function of the tarsus as well as to show its potential application in the legged robot. With the tarsus, the robotic leg was able to attach and retract smoothly from the mesh substrate when performing a walking cycle.

cs.RO↗

Nonholonomic Controlled Hamiltonian System: Symmetric Reduction and Hamilton-Jacobi Equations

In order to describe the impact of nonholonomic constraints for the dynamics of a regular controlled Hamiltonian (RCH) system, in this paper, for an RCH system with nonholonomic constraint, we first derive its distributional RCH system, by analyzing carefully the structure of dynamical vector field of the nonholonomic RCH system. Secondly, we derive precisely the geometric constraint conditions of the induced distributional two-form for the dynamical vector field of the distributional RCH system, which are called the Type I and Type II of Hamilton-Jacobi equations. Thirdly, we generalize the above results for the nonholonomic reducible RCH system with symmetry, and prove two types of Hamilton-Jacobi theorems for the nonholonomic reduced distributional RCH system. Moreover, we consider the nonholonomic reducible RCH system with momentum map, by combining with the regular point and regular orbit reduction theory and the analysis of dynamics of RCH system, we give the geometric formulations of the nonholonomic regular point reduced and orbit reduced distributional RCH systems, and prove two types of Hamilton-Jacobi theorems for these reduced distributional RCH systems. These researches reveal the deeply internal relationships of the nonholonomic constraints, the induced (resp. reduced) distributional two-forms, the dynamical vector fields and controls of the nonholonomic RCH system and its (reduced) distributional RCH systems.

math.SG↗

Designing thermal radiation metamaterials via hybrid adversarial autoencoder and Bayesian optimization

Designing thermal radiation metamaterials is challenging especially for problems with high degrees of freedom and complex objective. In this letter, we have developed a hybrid materials informatics approach which combines the adversarial autoencoder and Bayesian optimization to design narrowband thermal emitters at different target wavelengths. With only several hundreds of training data sets, new structures with optimal properties can be quickly figured out in a compressed 2-dimensional latent space. This enables the optimal design by calculating far less than 0.001\% of the total candidate structures, which greatly decreases the design period and cost. The proposed design framework can be easily extended to other thermal radiation metamaterials design with higher dimensional features.

cs.LG↗

Analysis and Petrov-Galerkin numerical approximation for variable coefficient two-sided fractional diffusion, advection, reaction equations

In this paper we investigate the variable coefficient two-sided fractional diffusion, advection, reaction equations on a bounded interval. It is known that the fractional diffusion operator may lose coercivity due to the variable coefficient, which makes both the mathematical and numerical analysis challenging. To resolve this issue, we design appropriate test and trial functions to prove the inf-sup condition of the variable coefficient fractional diffusion, advection, reaction operators in suitable function spaces. Based on this property, we prove the well-posedness and regularity of the solutions, as well as analyze the Petrov-Galerkin approximation scheme for the proposed model. Numerical experiments are presented to substantiate the theoretical findings and to compare the behaviors of different models.

math.NA↗

Low-light Image Enhancement by Retinex Based Algorithm Unrolling and Adjustment

Motivated by their recent advances, deep learning techniques have been widely applied to low-light image enhancement (LIE) problem. Among which, Retinex theory based ones, mostly following a decomposition-adjustment pipeline, have taken an important place due to its physical interpretation and promising performance. However, current investigations on Retinex based deep learning are still not sufficient, ignoring many useful experiences from traditional methods. Besides, the adjustment step is either performed with simple image processing techniques, or by complicated networks, both of which are unsatisfactory in practice. To address these issues, we propose a new deep learning framework for the LIE problem. The proposed framework contains a decomposition network inspired by algorithm unrolling, and adjustment networks considering both global brightness and local brightness sensitivity. By virtue of algorithm unrolling, both implicit priors learned from data and explicit priors borrowed from traditional methods can be embedded in the network, facilitate to better decomposition. Meanwhile, the consideration of global and local brightness can guide designing simple yet effective network modules for adjustment. Besides, to avoid manually parameter tuning, we also propose a self-supervised fine-tuning strategy, which can always guarantee a promising performance. Experiments on a series of typical LIE datasets demonstrated the effectiveness of the proposed method, both quantitatively and visually, as compared with existing methods.

cs.CV↗

Efficient Algorithms and Implementation of a Semiparametric Joint Model for Longitudinal and Competing Risks Data: With Applications to Massive Biobank Data

Semiparametric joint models of longitudinal and competing risks data are computationally costly and their current implementations do not scale well to massive biobank data. This paper identifies and addresses some key computational barriers in a semiparametric joint model for longitudinal and competing risks survival data. By developing and implementing customized linear scan algorithms, we reduce the computational complexities from $O(n^2)$ or $O(n^3)$ to $O(n)$ in various components including numerical integration, risk set calculation, and standard error estimation, where $n$ is the number of subjects. Using both simulated and real world biobank data, we demonstrate that these linear scan algorithms generate drastic speed-up of up to hundreds of thousands fold when $n>10^4$, sometimes reducing the run-time from days to minutes. We have developed an R-package, FastJM, based on the proposed algorithms for joint modeling of longitudinal and time-to-event data with and without competing risks, and made it publicly available on the Comprehensive R Archive Network (CRAN).

stat.ME↗