Chunxiuzi Liu

ORCID: 0009-0004-9925-965X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Genetics, Aging, and Longevity in Model Organisms
  • Machine Learning in Bioinformatics
  • Photoreceptor and optogenetics research
  • Metaheuristic Optimization Algorithms Research
  • Circadian rhythm and melatonin
  • Reinforcement Learning in Robotics
  • Neural Networks and Applications
  • Adaptive Dynamic Programming Control
  • Genomics and Phylogenetic Studies
  • Fractal and DNA sequence analysis
  • Advanced Multi-Objective Optimization Algorithms
  • Hydrogen's biological and therapeutic effects
  • Origins and Evolution of Life
  • Adaptive Control of Nonlinear Systems
  • Adversarial Robustness in Machine Learning
  • Physiological and biochemical adaptations
  • Algorithms and Data Compression
  • Expert finding and Q&A systems
  • Mobile Crowdsensing and Crowdsourcing
  • Machine Learning and Data Classification
  • Digital Media Forensic Detection
  • Metabolism and Genetic Disorders
  • MicroRNA in disease regulation
  • Design Education and Practice
  • Mitochondrial Function and Pathology

Beijing Normal University
2023-2025

University of Jinan
2017-2022

Beijing Chao-Yang Hospital
2010

Capital Medical University
2010

Genetic information often exhibits hierarchical and nested relationships, achieved through the reuse of repetitive subsequences such as duplicons transposable elements, a concept termed “evolutionary tinkering” by François Jacob. Current bioinformatics tools struggle to capture these, particularly nested, relationships. To address this, we utilized ladderpath, an approach within broader category algorithmic theory, introducing two key measures: order rate <a:math...

10.1103/physrevresearch.6.023215 article EN cc-by Physical Review Research 2024-05-28

Brute force random search, effective in exploring solution spaces, often becomes inefficient or infeasible real-world scenarios with vast spaces. A more method, akin to natural evolution, involves recombining existing modules into new ones, a concept known as “evolution tinkering” introduced by François Jacob. Understanding these mechanisms is crucial for comprehending evolution and designing evolution-inspired algorithms. This study employs genetic algorithms (GAs) quantitatively explore...

10.1063/5.0244484 article EN cc-by-nc-nd AIP Advances 2025-02-01

Neural network architecture determines its functional output. However, the detailed mechanisms are not well characterized. In this study, we focused on neural architectures of male and hermaphrodite C. elegans association with sexually dimorphic behaviors. We applied graph theory computational neuroscience methods to systematically discern features these two networks. Our findings revealed that a small percentage sexual-specific neurons exerted dominance throughout entire net-work,...

10.7554/elife.102309.1 preprint EN 2025-02-27

Neural network architecture determines its functional output. However, the detailed mechanisms are not well characterized. In this study, we focused on neural architectures of male and hermaphrodite C. elegans association with sexually dimorphic behaviors. We applied graph theory computational neuroscience methods to systematically discern features these two networks. Our findings revealed that a small percentage sexual-specific neurons exerted dominance throughout entire net-work,...

10.7554/elife.102309 preprint EN 2025-02-27

Abstract Genetic information often exhibits hierarchical and nested relationships, achieved through the reuse of repetitive subsequences such as duplicons transposable elements, a concept termed ``evolutionary tinkering'' by Fran\c{c}ois Jacob. Current bioinformatics tools struggle to capture these, particularly nested, relationships. To address this, we utilized Ladderpath, new approach within broader category Algorithmic Information Theory, introducing two key measures: order-rate $\eta$...

10.21203/rs.3.rs-3440555/v2 preprint EN cc-by Research Square (Research Square) 2024-01-29

Classical benchmark problems utilize multiple transformation techniques to increase optimization difficulty, e.g., shift for anti centering effect and rotation dimension sensitivity. Despite testing the invariance, however, such operations do not really change landscape's "shape", but rather than "view point". For instance, after rotated, ill conditional are turned around in terms of orientation still keep proportional components, which, some extent, does create much obstacle optimization....

10.1109/smc42975.2020.9283291 article EN 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2020-10-11

Abstract Background : In bioinformatics, tools like multiple sequence alignment and entropy methods probe information evolutionary relationships between species. Although powerful, they might miss crucial hierarchical formed by the reuse of repetitive subsequences duplicons transposable elements. Such are governed ''evolutionary tinkering'', as described François Jacob. The newly developed Ladderpath theory provides a quantitative framework to describe these relationships. Results Based on...

10.21203/rs.3.rs-3440555/v1 preprint EN cc-by Research Square (Research Square) 2023-10-16

<title>Abstract</title> Brute force random search, effective in exploring solution spaces, often becomes inefficient or infeasible real-world scenarios with vast spaces. A more method, akin to natural evolution, involves recombining existing modules into new ones, a concept known as “evolution tinkering” introduced by François Jacob. Understanding these mechanisms is crucial for comprehending evolution and designing evolution-inspired algorithms. This study employs genetic algorithms (GAs)...

10.21203/rs.3.rs-4353512/v1 preprint EN cc-by Research Square (Research Square) 2024-06-03

This study introduces an artificial neural network (ANN) for image classification task, inspired by the aversive olfactory learning circuits of nematode Caenorhabditis elegans (C. elegans). Despite remarkable performance ANNs in a variety tasks, they face challenges such as excessive parameterization, high training costs and limited generalization capabilities. C. elegans, with its simple nervous system comprising only 302 neurons, serves paradigm neurobiological research is capable complex...

10.48550/arxiv.2409.07466 preprint EN arXiv (Cornell University) 2024-08-27

Abstract Neural network architecture determines its functional output. However, the detailed mechanisms are not well characterized. In this study, we focused on neural architectures of male and hermaphrodite C. elegans association with sexually dimorphic behaviors. We applied graph theory computational neuroscience methods to systematically discern features these two networks. Our findings revealed that a small percentage sexual-specific neurons exerted dominance throughout entire net-work,...

10.1101/2024.12.13.628461 preprint EN bioRxiv (Cold Spring Harbor Laboratory) 2024-12-17

With the arrival of era "we media", Community Question Answering(CQA) websites become a special media" platforms gradually. In this type platforms, it has evolved as an interesting problem discover most authoritative answer provider in different fields because number providers is key influential factor successful CQA system. Recently, there are some methods mining users who focus on quality answers provided. However, contents vary lot and will complex if they include images or videos, which...

10.1109/iccss.2017.8091430 article EN 2020 7th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS) 2017-07-01

This study introduces an artificial neural network (ANN) for image classification task, inspired by the aversive olfactory learning circuit in Caenorhabditis elegans (C. elegans). Although networks (ANNs) have demonstrated remarkable performance various tasks, they still encounter challenges including excessive parameterization, high training costs and limited generalization capabilities, etc. C. elegans, boasting a simple nervous system consisting of merely 302 neurons, is capable...

10.1002/advs.202410637 article EN cc-by Advanced Science 2024-12-16

Particle swarm optimization (PSO) in recent years has been widely applied to solve various real world problems. However, for ill conditioned problems with largely different sensitivity the objective function, classical PSO cannot search optimal solution efficiently due best position-guided strategy that wastes lots of source searching undesirable areas. Therefore, this paper proposes a novel velocity reinforced mechanism (VR) solving m-conditional Two implementations mechanism, particle and...

10.1109/cec48606.2020.9185557 article EN 2022 IEEE Congress on Evolutionary Computation (CEC) 2020-07-01

This manuscript is engaged in the intricacies of optimizing control conundrums inherent to enigmatic, unknown discrete-time linear systems, underscored by an intractable discounted infinite-horizon value function. To forge a data-driven conductor, we unveil algebraic Riccati equation (D-ARE) and cast analytical gaze upon on-policy reinforcement learning (RL) algorithm. From this springboard, erect two computational scaffoldsnamely, model-based model-free off-policy RL algorithmsto surmount...

10.1109/docs60977.2023.10294994 article EN 2023-09-22

Abstract Creating a man‐made life in the laboratory is one of science’s most intriguing yet challenging problems. Advances synthetic biology and related theories, particularly those to origin life, have laid groundwork for further exploration understanding this field artificial or life. But there remains wealth quantitative mathematical models tools that be applied area. In paper, we review two main approaches often employed life: top‐down approach reduces complexity extant existing living...

10.1002/qub2.22 article EN Quantitative Biology 2023-11-27

The discrepancies between the mathematical model of control systems and real dynamical seriously affect performance controller. This paper considers <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$H$</tex> <inf xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf> problem for unknown discrete-time linear with time-varying uncertainties. A robust controller is designed using on-policy off-policy reinforcement learning (RL) methods. Interestingly,...

10.1109/csis-iac60628.2023.10363864 article EN 2023-10-20

Classical benchmark problems utilize multiple transformation techniques to increase optimization difficulty, e.g., shift for anti centering effect and rotation dimension sensitivity. Despite testing the invariance, however, such operations do not really change landscape's "shape", but rather than "view point". For instance, after rotated, ill conditional are turned around in terms of orientation still keep proportional components, which, some extent, does create much obstacle optimization....

10.48550/arxiv.2004.10042 preprint EN cc-by arXiv (Cornell University) 2020-01-01
Coming Soon ...