Liangchen Li

ORCID: 0000-0003-2234-0244
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Theory Research
  • Economic theories and models
  • Climate Change Policy and Economics
  • Limits and Structures in Graph Theory
  • Market Dynamics and Volatility
  • Energy, Environment, and Transportation Policies
  • Interconnection Networks and Systems
  • 3D Shape Modeling and Analysis
  • Capital Investment and Risk Analysis
  • Complexity and Algorithms in Graphs
  • Stochastic processes and financial applications
  • graph theory and CDMA systems
  • Graph Labeling and Dimension Problems
  • Coding theory and cryptography
  • Quantum-Dot Cellular Automata
  • Quantum Computing Algorithms and Architecture
  • Computational Geometry and Mesh Generation
  • Computer Graphics and Visualization Techniques
  • Multi-Criteria Decision Making
  • Biological and pharmacological studies of plants
  • Environmental and Agricultural Sciences
  • Epoxy Resin Curing Processes
  • Electric Power System Optimization
  • 3D Surveying and Cultural Heritage
  • AI-based Problem Solving and Planning

University of Science and Technology of China
2024

Hudson Institute
2024

Zhengzhou University
2008-2024

Luoyang Normal University
2014-2024

Nanjing Tech University
2024

University of California, Santa Barbara
2016-2021

Northwestern Polytechnical University
2021

Zhejiang University
2020

Central China Normal University
2010-2014

South China University of Technology
2014

We propose ``Shape from Semantics'', which is able to create 3D models whose geometry and appearance match given semantics when observed different views. Traditional X'' tasks usually use visual input (e.g., RGB images or depth maps) reconstruct geometry, imposing strict constraints that limit creative explorations. As applications, works like Shadow Art Wire often struggle grasp the embedded of their design through direct observation rely heavily on specific setups for proper display. To...

10.48550/arxiv.2502.00360 preprint EN arXiv (Cornell University) 2025-02-01

The proposed mechanism of the light-driven microbial desulphurization by CdS– H. neapolitanus biohybrid system.

10.1039/d3gc04789j article EN Green Chemistry 2024-01-01

Abstract A triangle‐path in a graph is sequence of distinct triangles such that for any with , and if . connected triangularly two nonparallel edges there For ordinary graphs, Fan et al. characterize all graphs admit nowhere‐zero 3‐flows or 4‐flows. Corollaries this result include the integer flow some families as locally due to Lai types products Imrich In paper, Fan's further extended signed graphs. We proved flow‐admissible admits 4‐flow only it not wheel associated specific signature....

10.1002/jgt.23076 article EN publisher-specific-oa Journal of Graph Theory 2024-02-08

10.1109/cvpr52733.2024.02021 article CA 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2024-06-16

In this paper, we construct two classes of asymmetric quantum codes by using constacyclic codes. The first class is the with parameters [[q 2 + 1, q 1 - 2(t k 1), (2k 2)/(2t 2)]] where an odd prime power, t, are integers [Formula: see text], which a generalization [J. Chen, J. Li and Lin, Int. Theor. Phys. 53 (2014) 72, Theorem 2] in sense that do not assume ≡1 ( mod 4). second one ≥ 5 0 ≤ t 1. constructed optimal their covered available literature.

10.1142/s0217984914501267 article EN Modern Physics Letters B 2014-06-17

Named entity recognition (NER) from visual documents, such as invoices, receipts or business cards, is a critical task for document understanding. Most classical approaches use sequence-based model (typically BiLSTM-CRF framework) without considering structure. Recent work on graph-based using graph convolutional networks to encode and textual features have achieved promising performance the task. However, few attempts take geometry information of text segments (text in bounding box)...

10.18653/v1/2020.textgraphs-1.3 article EN cc-by 2020-01-01

10.1007/s10773-015-2557-7 article EN International Journal of Theoretical Physics 2015-02-15

Purpose Traditional case-adaptation methods have poor accuracy, low efficiency and limited applicability, which cannot meet the needs of knowledge users. To address shortcomings existing research in industry, this paper proposes a optimization algorithm to support effective application tacit resources. Design/methodology/approach The attribute simplification based on forward search strategy neighborhood decision information system is implemented realize vertical dimensionality reduction case...

10.1108/jamr-08-2023-0210 article EN Journal of Advances in Management Research 2024-02-26

Let G be a 3-edge-connected graph on n vertices. It is proved in this paper that if the number of independent set no more than 2, then either can Z3-contracted to one graphs {K1;K4} or Fig. 1.

10.48550/arxiv.1411.6401 preprint EN other-oa arXiv (Cornell University) 2014-01-01

Adversarial Training (AT) has become arguably the state-of-the-art algorithm for extracting robust features. However, researchers recently notice that AT suffers from severe overfitting problems, particularly after learning rate (LR) decay. In this paper, we explain phenomenon by viewing adversarial training as a dynamic minimax game between model trainer and attacker. Specifically, analyze how LR decay breaks balance empowering with stronger memorization ability, show such imbalance induces...

10.48550/arxiv.2310.19360 preprint EN cc-by arXiv (Cornell University) 2023-01-01

Since being proposed, Neural Radiance Fields (NeRF) have achieved great success in related tasks, mainly adopting the hierarchical volume sampling (HVS) strategy for rendering. However, HVS of NeRF approximates distributions using piecewise constant functions, which provides a relatively rough estimation. Based on observation that well-trained weight function $w(t)$ and $L_0$ distance between points surface very high similarity, we propose $L_0$-Sampler by incorporating model into to guide...

10.48550/arxiv.2311.07044 preprint EN other-oa arXiv (Cornell University) 2023-01-01

Abstract We study a new kind of nonzero-sum stochastic differential game with mixed impulse/switching controls, motivated by strategic competition in commodity markets. A representative upstream firm produces that is used downstream to produce final consumption good. Both firms can influence the price commodity. By shutting down or increasing generation capacities, influences impulses. switching (or not) substitute, drift process. resulting impulse-regime between two firms, focusing on...

10.1007/s13235-021-00381-4 article EN cc-by Dynamic Games and Applications 2021-03-22

10.1016/j.disc.2017.03.009 article EN publisher-specific-oa Discrete Mathematics 2017-04-21

10.1016/j.ejc.2022.103627 article EN publisher-specific-oa European Journal of Combinatorics 2022-10-17

As an effective way of knowledge sharing, recommendation can alleviate the overload problem and promote value-added knowledge. To solve difficulty in determining number users' nearest-neighbors deviation rating prediction, which caused by data sparsity collaborative filtering algorithm systems, improved method based on Random Forest - Spectral Clustering SVD++-UCF is proposed. Firstly, SVD++ applied to fill sparse matrix, determines range clusters for spectral clustering predicted scores...

10.2139/ssrn.4124528 article EN SSRN Electronic Journal 2022-01-01

We consider competitive capacity investment for a duopoly of two distinct producers. The producers are exposed to stochastically fluctuating costs and interact through aggregate supply. Capacity expansion is irreversible modeled in terms timing strategies characterized threshold rules. Because the impact changing on asymmetric, we led nonzero-sum game describing transitions among discrete stages. Working continuous-time diffusion framework, characterize analyze resulting Nash equilibrium...

10.2139/ssrn.2904911 article EN SSRN Electronic Journal 2016-01-01

Purpose This study aims to deal with the case adaptation problem associated continuous data by providing a non-zero base solution for knowledge users in solving given situation. Design/methodology/approach Firstly, neighbourhood transformation of initial and view similarity between existing cases will be examined. Multiple perspective or above predefined threshold used as adaption cases. Secondly, on decision rule set space, deterministic model corresponding distance lower approximate...

10.1108/k-01-2023-0049 article EN Kybernetes 2023-06-07
Coming Soon ...