- Higher Education and Teaching Methods
- Metaheuristic Optimization Algorithms Research
- Robotic Path Planning Algorithms
- Advanced Multi-Objective Optimization Algorithms
- Evolutionary Algorithms and Applications
- Reinforcement Learning in Robotics
- Control and Dynamics of Mobile Robots
- Educational Technology and Assessment
- Robotics and Sensor-Based Localization
- Education and Work Dynamics
- Advanced Algorithms and Applications
- Adaptive Dynamic Programming Control
- Innovative Educational Techniques
- Ideological and Political Education
- Multi-Criteria Decision Making
- Network Security and Intrusion Detection
- Optimization and Search Problems
- Guidance and Control Systems
- Service-Oriented Architecture and Web Services
- Mobile Agent-Based Network Management
- Advanced Control Systems Optimization
- Autonomous Vehicle Technology and Safety
- Distributed Control Multi-Agent Systems
- Distributed Sensor Networks and Detection Algorithms
- China's Ethnic Minorities and Relations
Donghua University
2025
Central China Normal University
2006-2025
Southwest University
2007-2025
Zhejiang University
2025
Czech Academy of Sciences, Institute of Biotechnology
2025
Jiangxi University of Finance and Economics
2015-2024
Harbin Institute of Technology
2024
Sichuan Normal University
2024
Craft Group (China)
2024
Chongqing University
2024
To detect the smallest delay faults at a fault site, longest path(s) through it must be tested full speed. Existing test generation tools are inefficient in automatically identifying testable paths due to high computational complexity. In this work methodology for scan-based synchronous sequential circuits is presented, under two at-speed strategies used industry. The compared and efficiency evaluated on ISCAS89 benchmark industrial designs. Experiments show that testing transition can done...
Key classes have become excellent starting points for developers to understand unknown software systems. Up now, a variety of approaches been proposed mine key in project. Many them are based on network representation (namely, networks) the projects. However, networks they used usually un-weighted and un-directed, which is not consistent with reality real project where coupling actually has direction strength. Worse still, number class candidates returned by existing very large. Thus, it...
As data sets grow in size and complexity, it is becoming more difficult to pull useful features from them using hand-crafted feature extractors. For this reason, deep learning (DL) frameworks are now widely popular. The Holy Grail of DL one the most mysterious challenges all modern ML develop a fundamental understanding optimization generalization. While numerous techniques have been introduced literature navigate exploration highly non-convex landscape, many survey papers reviewing...
Abstract The long-term separation of industry, academia and research in most colleges universities has hindered the establishment interactive digital media economic system, so there is an urgent need to find a suitable method guide carry out innovative teaching industry-teaching integration. This paper analyzes existing literature, summarizes key influencing factors industry-academia integration universities, obtains system universities. fuzzy set-DEMATEL was used analyze influence degree...
Abstract Chromatin dynamics are essential for regulating DNA processes in response to environmental stimuli. Although ISWI-family enzymes known remodel chromatin by sliding nucleosomes budding yeast, their functional roles and outputs eukaryotes remain largely unknown. In this study, we investigated accessibility the phytopathogenic fungus Fusarium graminearum treated with without putrescine, a compound that rapidly induces biosynthesis of mycotoxin deoxynivalenol (DON). Putrescine globally...
Human-computer collaboration is an effective way to learn programming courses. However, most existing human-computer collaborative learning supported by traditional computers with a relatively low level of personalized interaction, which greatly limits the efficiency students’ and development computational thinking. To address above issues, this study introduces generative AI into proposes dialogue-negotiated method based on AI. The focuses problems-solving process constructs multiple agents...
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> In this paper, we present two near-optimal methods to determine the real-time collision-free path for a mobile vehicle moving in dynamically changing environment. The proposed designs are based on polynomial parameterization of feasible trajectories by explicitly taking into account boundary conditions, kinematic constraints, and collision-avoidance criteria. problems finding optimal solutions...
The widespread use of Internet provides a good environment for e-commerce. Study on e-commerce network characteristics always focuses the Taobao. So far, researches based Taobao are related to credit rating system, marketing strategy, analysis seller and so on. purpose all these studies is analyze online transactions in In this paper, we from perspective graph theory. Our contributions lie two aspects as following: (1) crawl share-platform using Scrapy architecture. After analyzing format...
This paper considers the problem of deploying a robot from specification given as temporal logic statement about some properties satisfied by regions large, partitioned environment. We assume that has noisy sensors and actuators model its motion through environment Markov decision process (MDP). The control becomes finding policy which maximizes probability satisfying task on MDP. For large environment, obtaining transition probabilities for each state–action pair, well solving necessary...
Population initialization, as an important step in population-based stochastic algorithm, can affect the convergence speed and quality of solutions. Generally, random initialization is used to generate initial population when lacking priori information. This paper presents a new method by applying space transformation search (STS) strategy population. Experimental results on 8 well-known benchmark problems show that based STS outperforms traditional opposition-based initialization.
The interval-valued intuitionistic fuzzy sets (IVIFSs), based on the (IFSs), combine classical decision method and its research application is attracting attention. After a comparative analysis, it becomes clear that multiple methods with IVIFSs’ information have been applied to many practical issues. In this paper, we extended EDAS Cumulative Prospect Theory (CPT) considering experts (DEs)’ psychological factors under IVIFSs. Taking uncertain character of IVIFSs preference into...
The sparrow search algorithm (SSA) is a metaheuristic developed based on the foraging and anti-predatory behavior of populations. Compared with other algorithms, SSA also suffers from poor population diversity, has weak global comprehensive ability, easily falls into local optimality. To address problems whereby tends to fall optimum diversity decreases in later stage search, an improved (PGL-SSA) piecewise chaotic mapping, Gaussian difference variation, linear differential decreasing...
The path delay fault model is the most realistic for faults. Testing all paths in a circuit achieves 100% coverage according to traditional metrics. These metrics result unrealistically low if only subset of tested, and real test quality not reflected. For example, any practical c6288 close 0 because this has an exponential number paths. In paper, statistical metric presented. Then several existing sets (path selection methods) evaluated terms local global faults using metric, comparison...
Population initialization is a crucial task in population-based optimization methods, which can affect the convergence speed and also quality of final solutions. Generally, if no priori information about solutions available, initial population often selected randomly using random numbers. This paper presents new method by applying concept adaptive randomness (AR) to distribute individuals as spaced out possible over search space. To verify performance AR, comprehensive set 34 benchmark...
Actor-critic algorithms solve dynamic decision making problems by optimizing a performance metric of interest over user-specified parametric class policies. They employ combination an actor, policy improvement steps, and critic, computing directions. Many existing use steepest ascent method to improve the policy, which is known suffer from slow convergence for ill-conditioned problems. In this paper, we first develop estimate (Hessian) matrix containing second derivatives with respect...