scispace - formally typeset
Search or ask a question
Author

Hao Xiang Cheng

Bio: Hao Xiang Cheng is an academic researcher from Tongji University. The author has contributed to research in topics: Biocompatibility & Medicine. The author has an hindex of 1, co-authored 1 publications receiving 120 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: An improved particle swarm optimization (IPSO) was proposed in this paper to solve the problem that the linearly decreasing inertia weight (LDIW) of particle Swarm optimization algorithm cannot adapt to the complex and nonlinear optimization process.
Abstract: An improved particle swarm optimization (IPSO) was proposed in this paper to solve the problem that the linearly decreasing inertia weight (LDIW) of particle swarm optimization algorithm cannot adapt to the complex and nonlinear optimization process The strategy of nonlinear decreasing inertia weight based on the concave function was used in this algorithm The aggregation degree factor of the swarm was introduced in this new algorithm And in each iteration process, the weight is changed dynamically based on the current aggregation degree factor and the iteration times, which provides the algorithm with dynamic adaptability The experiments on the three classical functions show that the convergence speed of IPSO is significantly superior to LDIWPSO, and the convergence accuracy is increased

121 citations

Journal ArticleDOI
TL;DR: In this article , gelatin methacryloyl (GelMA) microgels were loaded with vancomycin (Van) using a microfluidic emulsion method and then encapsulated in hydrogel with lysostaphin (Ls) to produce a co-delivery system with bactericidal and biofilm dispersion properties.

8 citations

Journal ArticleDOI
TL;DR: A degradable coating that provides sustained antibacterial activity, promotes immune reconstitution, and simultaneously achieves solid bone integration is synthesized, highlighting its promising translational potential in preventing implant infection.

3 citations

22 Feb 2023
TL;DR: In this paper , the flexoelectric effect, arising from the strain gradient along the films normal, induces a rhombohedral distortion in the otherwise Pca21 orthorhombic structure.
Abstract: Doped HfO2 thin films exhibit robust ferroelectric properties even for nanometric thicknesses, are compatible with current Si technology and thus have great potential for the revival of integrated ferroelectrics. Phase control and reliability are core issues for their applications. Here we show that, in (111)-oriented 5%La:HfO2 (HLO) epitaxial thin films deposited on (La0.3Sr0.7)(Al0.65Ta0.35)O3 substrates, the flexoelectric effect, arising from the strain gradient along the films normal, induces a rhombohedral distortion in the otherwise Pca21 orthorhombic structure. Density functional calculations reveal that the distorted structure is indeed more stable than the pure Pca21 structure, when applying an electric field mimicking the flexoelectric field. This rhombohedral distortion greatly improves the fatigue endurance of HLO thin films by further stabilizing the metastable ferroelectric phase against the transition to the thermodynamically stable non-polar monoclinic phase during repetitive cycling. Our results demonstrate that the flexoelectric effect, though negligibly weak in bulk, is crucial to optimize the structure and properties of doped HfO2 thin films with nanometric thicknesses for integrated ferroelectric applications.
Journal ArticleDOI
TL;DR: In this paper , a polyvinyl alcohol/chitosan (PVA/CS) wound dressing was fabricated using electrostatic spinning, which is a simple and efficient method for fabricating membrane materials.

Cited by
More filters
Journal ArticleDOI
TL;DR: A family of improved variants of the DE/target-to-best/1/bin scheme, which utilizes the concept of the neighborhood of each population member, and is shown to be statistically significantly better than or at least comparable to several existing DE variants as well as a few other significant evolutionary computing techniques over a test suite of 24 benchmark functions.
Abstract: Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. It has reportedly outperformed a few evolutionary algorithms (EAs) and other search heuristics like the particle swarm optimization (PSO) when tested over both benchmark and real-world problems. DE, however, is not completely free from the problems of slow and/or premature convergence. This paper describes a family of improved variants of the DE/target-to-best/1/bin scheme, which utilizes the concept of the neighborhood of each population member. The idea of small neighborhoods, defined over the index-graph of parameter vectors, draws inspiration from the community of the PSO algorithms. The proposed schemes balance the exploration and exploitation abilities of DE without imposing serious additional burdens in terms of function evaluations. They are shown to be statistically significantly better than or at least comparable to several existing DE variants as well as a few other significant evolutionary computing techniques over a test suite of 24 benchmark functions. The paper also investigates the applications of the new DE variants to two real-life problems concerning parameter estimation for frequency modulated sound waves and spread spectrum radar poly-phase code design.

1,086 citations

Journal ArticleDOI
TL;DR: An enhanced and generalized PNN (EPNN) is presented using local decision circles (LDCs) to overcome the aforementioned shortcoming of PNN and improve its robustness to noise in the data.
Abstract: In recent years the Probabilistic Neural Network (PPN) has been used in a large number of applications due to its simplicity and efficiency. PNN assigns the test data to the class with maximum likelihood compared with other classes. Likelihood of the test data to each training data is computed in the pattern layer through a kernel density estimation using a simple Bayesian rule. The kernel is usually a standard probability distribution function such as a Gaussian function. A spread parameter is used as a global parameter which determines the width of the kernel. The Bayesian rule in the pattern layer estimates the conditional probability of each class given an input vector without considering any probable local densities or heterogeneity in the training data. In this paper, an enhanced and generalized PNN (EPNN) is presented using local decision circles (LDCs) to overcome the aforementioned shortcoming and improve its robustness to noise in the data. Local decision circles enable EPNN to incorporate local information and non-homogeneity existing in the training population. The circle has a radius which limits the contribution of the local decision. In the conventional PNN the spread parameter can be optimized for maximum classification accuracy. In the proposed EPNN two parameters, the spread parameter and the radius of local decision circles, are optimized to maximize the performance of the model. Accuracy and robustness of EPNN are compared with PNN using three different benchmark classification problems, iris data, diabetic data, and breast cancer data, and five different ratios of training data to testing data: 90:10, 80:20, 70:30, 60:40, and 50:50. EPNN provided the most accurate results consistently for all ratios. Robustness of PNN and EPNN is investigated using different values of signal to noise ratio (SNR). Accuracy of EPNN is consistently higher than accuracy of PNN at different levels of SNR and for all ratios of training data to testing data.

314 citations

Journal ArticleDOI
TL;DR: This paper introduces an upgraded artificial bee colony (UABC) algorithm for constrained optimization problems that enhances fine-tuning characteristics of the modification rate parameter and employs modified scout bee phase of the ABC algorithm.
Abstract: Artificial bee colony (ABC) algorithm developed by Karaboga is a nature inspired metaheuristic based on honey bee foraging behavior. It was successfully applied to continuous unconstrained optimization problems and later it was extended to constrained design problems as well. This paper introduces an upgraded artificial bee colony (UABC) algorithm for constrained optimization problems. Our UABC algorithm enhances fine-tuning characteristics of the modification rate parameter and employs modified scout bee phase of the ABC algorithm. This upgraded algorithm has been implemented and tested on standard engineering benchmark problems and the performance was compared to the performance of the latest Akay and Karaboga's ABC algorithm. Our numerical results show that the proposed UABC algorithm produces better or equal best and average solutions in less evaluations in all cases.

124 citations

Journal ArticleDOI
TL;DR: A particle swarm optimization (PSO) based algorithm is developed to solve problems defined by bi-level pricing models and can achieve a profit increase for buyers or vendors if they are treated as the leaders under some situations, compared with the existing methods.
Abstract: With rapid technological innovation and strong competition in hi-tech industries such as computer and communication organizations, the upstream component price and the downstream product cost usually decline significantly with time. As a result, an effective pricing supply chain model is very important. This paper first establishes two bi-level pricing models for pricing problems with the buyer and the vendor in a supply chain designated as the leader and the follower, respectively. A particle swarm optimization (PSO) based algorithm is developed to solve problems defined by these bi-level pricing models. Experiments illustrate that this PSO based algorithm can achieve a profit increase for buyers or vendors if they are treated as the leaders under some situations, compared with the existing methods.

121 citations

Journal ArticleDOI
TL;DR: An example-based learning PSO (ELPSO) is proposed to overcome shortcomings of the canonical PSO by keeping a balance between swarm diversity and convergence speed and outperforms all the tested PSO algorithms in terms of both solution quality and convergence time.

101 citations