Source author record

Yanjie Li

Yanjie Li appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

12works
7topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

12 published item(s)

preprint2026arXiv

CatalyticMLLM: A Graph-Text Multimodal Large Language Model for Catalytic Materials

Property prediction and inverse structural design of catalytic materials are typically modeled as two independent tasks: the former predicts target properties from given structures, whereas the latter generates candidate structures according to desired properties. Although the decoupled paradigm facilitates the implementation of a ``generation--evaluation--screening'' workflow, the inconsistency between the generative model and the property prediction model in terms of representation spaces and training objectives can readily introduce data distribution shifts and evaluator bias, thereby limiting the stability of closed-loop optimization. In this work, we propose QE-Catalytic-V2, a unified graph--text multimodal large language model for catalytic materials, which integrates property prediction and inverse design within the same model and shared representation space. Under this unified framework, QE-Catalytic-V2 can not only perform reliable property prediction by leveraging three-dimensional structures and textual information, but also generate and screen physically feasible CIF candidates conditioned on target properties, thereby forming a closed-loop optimization workflow of ``inverse design--prediction--screening--redesign.'' Experimental results demonstrate that this unified paradigm outperforms decoupled baselines on both catalytic relaxed-energy prediction and inverse design tasks, validating the effectiveness of jointly modeling property prediction and structure generation within a single multimodal model.

preprint2026arXiv

GESR: A Genetic Programming-Based Symbolic Regression Method with Gene Editing

Mathematical formulas serve as a language through which humans communicate with nature. Discovering mathematical laws from scientific data to describe natural phenomena has been a long-standing pursuit of humanity for centuries. In the field of artificial intelligence, this challenge is known as the symbolic regression problem. Among existing symbolic regression approaches, Genetic Programming (GP) based on evolutionary algorithms remains one of the most classical and widely adopted methods. GP simulates the evolutionary process across generations through genetic mutation and crossover. However, mutations and crossovers in GP are entirely random. While this randomness effectively mimics natural evolution, it inevitably produces both beneficial and detrimental variations. If there existed a metaphorical `God` capable of foreseeing which genetic mutations or crossovers would yield superior outcomes and performing targeted gene editing accordingly, the efficiency of evolution could be substantially improved. Motivated by this idea, we propose in this paper a symbolic regression approach based on gene editing, termed GESR. In GESR, we trained two "hands of God" (two BERT models). Among them, the first leverages the BERT's masked language modeling capability to guide the mutation of genes (expression symbols). The other BERT model guides the crossover of individual genes by predicting the crossover point. Experimental results demonstrate that GESR significantly improves computational efficiency compared with traditional GP algorithms and achieves strong overall performance across multiple symbolic regression tasks.

preprint2024arXiv

Linear subspaces of the intersection of two quadrics via Kuznetsov component

Let $Q_i(i=1,2)$ be $2g$ dimensional quadrics in $\mathbb{P}^{2g+1}$ and let $Y$ be the smooth intersection $Q_1\cap Q_2$. We associate the linear subspace in $Y$ with vector bundles on the hyperelliptic curve $C$ of genus $g$ by the left adjoint functor of $Φ:D^b(C)\rightarrow D^b(Y)$. As an application, we give a different proof of the classification of line bundles and stable bundles of rank $2$ on hyperelliptic curves given by Desale and Ramanan. When $g=3$, we show that the projection functor induces a closed embedding $α:Y\rightarrow SU^s_C(4,h)$ into the moduli space of stable bundles on $C$ of rank $4$ of fixed determinant.

preprint2022arXiv

SimCC: a Simple Coordinate Classification Perspective for Human Pose Estimation

The 2D heatmap-based approaches have dominated Human Pose Estimation (HPE) for years due to high performance. However, the long-standing quantization error problem in the 2D heatmap-based methods leads to several well-known drawbacks: 1) The performance for the low-resolution inputs is limited; 2) To improve the feature map resolution for higher localization precision, multiple costly upsampling layers are required; 3) Extra post-processing is adopted to reduce the quantization error. To address these issues, we aim to explore a brand new scheme, called \textit{SimCC}, which reformulates HPE as two classification tasks for horizontal and vertical coordinates. The proposed SimCC uniformly divides each pixel into several bins, thus achieving \emph{sub-pixel} localization precision and low quantization error. Benefiting from that, SimCC can omit additional refinement post-processing and exclude upsampling layers under certain settings, resulting in a more simple and effective pipeline for HPE. Extensive experiments conducted over COCO, CrowdPose, and MPII datasets show that SimCC outperforms heatmap-based counterparts, especially in low-resolution settings by a large margin.

preprint2019arXiv

Discrete Element Method Model of Elastic Fiber Uniaxial Compression

A flexible fiber model based on the discrete element method (DEM) is presented and validated for the simulation of uniaxial compression of flexible fibers in a cylindrical container. It is found that the contact force models in the DEM simulations have a significant impact on compressive forces exerted on the fiber bed. Only when the geometry-dependent normal contact force model and the static friction model are employed, the simulation results are in good agreement with experimental results. Systematic simulation studies show that the compressive force initially increases and eventually saturates with an increase in the fiber-fiber friction coefficient, and the fiber-fiber contact forces follow a similar trend. The compressive force and lateral shear-to-normal stress ratio increase linearly with increasing fiber-wall friction coefficient. In uniaxial compression of frictional fibers, more static friction contacts occur than dynamic friction contacts with static friction becoming more predominant as the fiber-fiber friction coefficient increases.

preprint2019arXiv

Yielding and hardening of flexible fiber packings during triaxial compression

This paper examines the mechanical response of flexible fiber packings subject to triaxial compression. Short fibers yield in a manner similar to typical granular materials in which the deviatoric stress remains nearly constant with increasing strain after reaching a peak value. Interestingly, long fibers exhibit a hardening behavior, where the stress increases rapidly with increasing strain at large strains and the packing density continuously increases. Phase diagrams for classifying the bulk mechanical response as yielding, hardening, or a transition regime are generated as a function of the fiber aspect ratio, fiber-fiber friction coefficient, and confining pressure. Large fiber aspect ratio, large fiber-fiber friction coefficient, and large confining pressure promote hardening behavior. The hardening packings can support much larger loads than the yielding packings contributing to the stability and consolidation of the granular structure, but larger internal axial forces occur within fibers.

preprint2016arXiv

An algorithm to increase the residues of wrapped-phase in spatial domain

In phase unwrapping, the locations and densities of residues are indicative of the severity of the unwrapping problem. The residues are used to detect and evade inconsistent phase areas. Gdeisat et al. proposed an algorithm to increase the number of residues in a wrapped-phase map to improve the results of phase unwrapping. But this method will take much time to make the Fourier transform, inverse Fourier transform, select and shift the spectral components, and there is no theoretical analysis on why the frequency shift can increase the number of residues. In view of the above problems, we proposed an algorithm to increase the number of residues in a wrapped-phase map, which only uses a simple multiply operation in spatial domain to realize frequency shift by taking advantage of the frequency shift property of Fourier transform. Besides that, we discuss the relationship between the number of residues and frequency shift. Finally, the experimental evaluation is conducted to prove the validity of the proposed method. Experimental results demonstrated that the proposed method can speed up more than 50%.

preprint2016arXiv

Comment on "Dual-wavelength in-line phase-shifting interferometry based on two dc-term-suppressed intensities with a special phase shift for quantitative phase extraction"

We comment on the recent Letter by Xu and Wang et al. [Opt. Lett. 41, 2430 (2016)] in which an approach of quantitative phase extraction in dual-wavelength in-line phase-shifting interferometry (DWILPSI) was proposed. It is noted that a special phase shift is used, which more or less embarrasses its practical operation. We wish to show that the same result can also be reached by combining the generalized phase-shifting algorithm and the least-square algorithm, in which the phase shift can be chosen randomly. In addition to maintaining high accuracy and rapid processing speed of the DWILPSI method, the proposed method greatly facilitates its application in actual measurement.

preprint2016arXiv

Enhanced high dynamic range 3D shape measurement based on generalized phase-shifting algorithm

It is a challenge for Phase Measurement Profilometry (PMP) to measure objects with a large range of reflectivity variation across the surface. Saturated or dark pixels in the deformed fringe patterns captured by the camera will lead to phase fluctuations and errors. Jiang et al. proposed a high dynamic range real-time 3D shape measurement method without changing camera exposures. Three inverted phase-shifted fringe patterns are used to complement three regular phase-shifted fringe patterns for phase retrieval when any of the regular fringe patterns are saturated. But Jiang's method still has some drawbacks: (1) The phases in saturated pixels are respectively estimated by different formulas for different cases. It is shortage of an universal formula; (2) it cannot be extended to four-step phase-shifting algorithm because inverted fringe patterns are the repetition of regular fringe patterns; (3) only three unsaturated intensity values at every pixel of fringe patterns are chosen for phase demodulation, lying idle the other unsaturated ones. We proposed a method for enhanced high dynamic range 3D shape measurement based on generalized phase-shifting algorithm, which combines the complementary technique of inverted and regular fringe patterns with generalized phase-shifting algorithm. Firstly, two sets of complementary phase-shifted fringe patterns, namely regular and inverted fringe patterns are projected and collected. Then all unsaturated intensity values at the same camera pixel from two sets of fringe patterns are selected, and employed to retrieve the phase by generalized phase-shifting algorithm. Finally, simulations and experiments are conducted to prove the validity of the proposed method. The results are analyzed and compared with Jiang's method, which demonstrate that the proposed method not only expands the scope of Jiang's method, but also improves the measurement accuracy.

preprint2016arXiv

Improved method for phase wraps reduction in profilometry

In order to completely eliminate, or greatly reduce the number of phase wraps in 2D wrapped phase map, Gdeisat et al. proposed an algorithm, which uses shifting the spectrum towards the origin. But the spectrum can be shifted only by an integer number, meaning that the phase wraps reduction is often not optimal. In addition, Gdeisat's method will take much time to make the Fourier transform, inverse Fourier transform, select and shift the spectral components. In view of the above problems, we proposed an improved method for phase wraps elimination or reduction. First, the wrapped phase map is padded with zeros, the carrier frequency of the projected fringe is determined by high resolution, which can be used as the moving distance of the spectrum. And then realize frequency shift in spatial domain. So it not only can enable the spectrum to be shifted by a rational number when the carrier frequency is not an integer number, but also reduce the execution time. Finally, the experimental results demonstrated that the proposed method is feasible.

preprint2016arXiv

One shot profilometry using iterative two-step temporal phase-unwrapping

This paper reviews two techniques that have been recently published for 3D profilometry and proposes one shot profilometry using iterative two-step temporal phase-unwrapping by combining the composite fringe projection and the iterative two-step temporal phase unwrapping algorithm. In temporal phase unwrapping, many images with different frequency fringe pattern are needed to project which would take much time. In order to solve this problem, Ochoa proposed a phase unwrapping algorithm based on phase partitions using a composite fringe, which only needs projecting one composite fringe pattern with four kinds of frequency information to complete the process of 3D profilometry. However, we found that the fringe order determined through the construction of phase partitions tended to be imprecise. Recently, we proposed an iterative two-step temporal phase unwrapping algorithm, which can achieve high sensitivity and high precision shape measurement. But it needs multiple frames of fringe images which would take much time. In order to take into account both the speed and accuracy of 3D shape measurement, we get a new, and more accurate unwrapping method based on composite fringe pattern by combining these two techniques. This method not only retains the speed advantage of Ochoa's algorithm, but also greatly improves its measurement accuracy. Finally, the experimental evaluation is conducted to prove the validity of the proposed method, and the experimental results show that this method is feasible.

preprint2010arXiv

The Schrödinger-Virasoro type Lie bialgebra: a twisted case

In this paper we investigate Lie bialgebra structures on a twisted Schrödinger-Virasoro type algebra $\LL$. All Lie bialgebra structures on $\LL$ are triangular coboundary, which is different from the relative result on the original Schrödinger-Virasoro type Lie algebra. In particular, we find for this Lie algebra that there are more hidden inner derivations from itself to $\LL\otimes\LL$ and we develop one method to search them.