Speech emotion recognition(SER)uses acoustic analysis to find features for emotion recognition and examines variations in voice that are caused by emotions.The number of features acquired with acoustic analysis is ext...Speech emotion recognition(SER)uses acoustic analysis to find features for emotion recognition and examines variations in voice that are caused by emotions.The number of features acquired with acoustic analysis is extremely high,so we introduce a hybrid filter-wrapper feature selection algorithm based on an improved equilibrium optimizer for constructing an emotion recognition system.The proposed algorithm implements multi-objective emotion recognition with the minimum number of selected features and maximum accuracy.First,we use the information gain and Fisher Score to sort the features extracted from signals.Then,we employ a multi-objective ranking method to evaluate these features and assign different importance to them.Features with high rankings have a large probability of being selected.Finally,we propose a repair strategy to address the problem of duplicate solutions in multi-objective feature selection,which can improve the diversity of solutions and avoid falling into local traps.Using random forest and K-nearest neighbor classifiers,four English speech emotion datasets are employed to test the proposed algorithm(MBEO)as well as other multi-objective emotion identification techniques.The results illustrate that it performs well in inverted generational distance,hypervolume,Pareto solutions,and execution time,and MBEO is appropriate for high-dimensional English SER.展开更多
The objective of reliability-based design optimization(RBDO)is to minimize the optimization objective while satisfying the corresponding reliability requirements.However,the nested loop characteristic reduces the effi...The objective of reliability-based design optimization(RBDO)is to minimize the optimization objective while satisfying the corresponding reliability requirements.However,the nested loop characteristic reduces the efficiency of RBDO algorithm,which hinders their application to high-dimensional engineering problems.To address these issues,this paper proposes an efficient decoupled RBDO method combining high dimensional model representation(HDMR)and the weight-point estimation method(WPEM).First,we decouple the RBDO model using HDMR and WPEM.Second,Lagrange interpolation is used to approximate a univariate function.Finally,based on the results of the first two steps,the original nested loop reliability optimization model is completely transformed into a deterministic design optimization model that can be solved by a series of mature constrained optimization methods without any additional calculations.Two numerical examples of a planar 10-bar structure and an aviation hydraulic piping system with 28 design variables are analyzed to illustrate the performance and practicability of the proposed method.展开更多
The estimation of covariance matrices is very important in many fields, such as statistics. In real applications, data are frequently influenced by high dimensions and noise. However, most relevant studies are based o...The estimation of covariance matrices is very important in many fields, such as statistics. In real applications, data are frequently influenced by high dimensions and noise. However, most relevant studies are based on complete data. This paper studies the optimal estimation of high-dimensional covariance matrices based on missing and noisy sample under the norm. First, the model with sub-Gaussian additive noise is presented. The generalized sample covariance is then modified to define a hard thresholding estimator , and the minimax upper bound is derived. After that, the minimax lower bound is derived, and it is concluded that the estimator presented in this article is rate-optimal. Finally, numerical simulation analysis is performed. The result shows that for missing samples with sub-Gaussian noise, if the true covariance matrix is sparse, the hard thresholding estimator outperforms the traditional estimate method.展开更多
As a crucial data preprocessing method in data mining,feature selection(FS)can be regarded as a bi-objective optimization problem that aims to maximize classification accuracy and minimize the number of selected featu...As a crucial data preprocessing method in data mining,feature selection(FS)can be regarded as a bi-objective optimization problem that aims to maximize classification accuracy and minimize the number of selected features.Evolutionary computing(EC)is promising for FS owing to its powerful search capability.However,in traditional EC-based methods,feature subsets are represented via a length-fixed individual encoding.It is ineffective for high-dimensional data,because it results in a huge search space and prohibitive training time.This work proposes a length-adaptive non-dominated sorting genetic algorithm(LA-NSGA)with a length-variable individual encoding and a length-adaptive evolution mechanism for bi-objective highdimensional FS.In LA-NSGA,an initialization method based on correlation and redundancy is devised to initialize individuals of diverse lengths,and a Pareto dominance-based length change operator is introduced to guide individuals to explore in promising search space adaptively.Moreover,a dominance-based local search method is employed for further improvement.The experimental results based on 12 high-dimensional gene datasets show that the Pareto front of feature subsets produced by LA-NSGA is superior to those of existing algorithms.展开更多
In this paper,an Observation Points Classifier Ensemble(OPCE)algorithm is proposed to deal with High-Dimensional Imbalanced Classification(HDIC)problems based on data processed using the Multi-Dimensional Scaling(MDS)...In this paper,an Observation Points Classifier Ensemble(OPCE)algorithm is proposed to deal with High-Dimensional Imbalanced Classification(HDIC)problems based on data processed using the Multi-Dimensional Scaling(MDS)feature extraction technique.First,dimensionality of the original imbalanced data is reduced using MDS so that distances between any two different samples are preserved as well as possible.Second,a novel OPCE algorithm is applied to classify imbalanced samples by placing optimised observation points in a low-dimensional data space.Third,optimization of the observation point mappings is carried out to obtain a reliable assessment of the unknown samples.Exhaustive experiments have been conducted to evaluate the feasibility,rationality,and effectiveness of the proposed OPCE algorithm using seven benchmark HDIC data sets.Experimental results show that(1)the OPCE algorithm can be trained faster on low-dimensional imbalanced data than on high-dimensional data;(2)the OPCE algorithm can correctly identify samples as the number of optimised observation points is increased;and(3)statistical analysis reveals that OPCE yields better HDIC performances on the selected data sets in comparison with eight other HDIC algorithms.This demonstrates that OPCE is a viable algorithm to deal with HDIC problems.展开更多
k-means is a popular clustering algorithm because of its simplicity and scalability to handle large datasets.However,one of its setbacks is the challenge of identifying the correct k-hyperparameter value.Tuning this v...k-means is a popular clustering algorithm because of its simplicity and scalability to handle large datasets.However,one of its setbacks is the challenge of identifying the correct k-hyperparameter value.Tuning this value correctly is critical for building effective k-means models.The use of the traditional elbow method to help identify this value has a long-standing literature.However,when using this method with certain datasets,smooth curves may appear,making it challenging to identify the k-value due to its unclear nature.On the other hand,various internal validation indexes,which are proposed as a solution to this issue,may be inconsistent.Although various techniques for solving smooth elbow challenges exist,k-hyperparameter tuning in high-dimensional spaces still remains intractable and an open research issue.In this paper,we have first reviewed the existing techniques for solving smooth elbow challenges.The identified research gaps are then utilized in the development of the new technique.The new technique,referred to as the ensemble-based technique of a self-adapting autoencoder and internal validation indexes,is then validated in high-dimensional space clustering.The optimal k-value,tuned by this technique using a voting scheme,is a trade-off between the number of clusters visualized in the autoencoder’s latent space,k-value from the ensemble internal validation index score and one that generates a value of 0 or close to 0 on the derivative f″′(k)(1+f′(k)^(2))−3 f″(k)^(2)f″((k)2f′(k),at the elbow.Experimental results based on the Cochran’s Q test,ANOVA,and McNemar’s score indicate a relatively good performance of the newly developed technique in k-hyperparameter tuning.展开更多
In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an ext...In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an extended fuzzy approach,often known as neutrosophic logic.Our rigorous proposed model has led to the creation of an advanced technique for computing the triangular single-valued neutrosophic number.This innovative approach evaluates the inherent uncertainty in project durations of the planning phase,which enhances the potential significance of the decision-making process in the project.Our proposed method,for the first time in the neutrosophic set literature,not only solves existing problems but also introduces a new set of problems not yet explored in previous research.A comparative study using Python programming was conducted to examine the effectiveness of responsive and adaptive planning,as well as their differences from other existing models such as the classical critical path problem and the fuzzy critical path problem.The study highlights the use of neutrosophic logic in handling complex projects by illustrating an innovative dynamic programming framework that is robust and flexible,according to the derived results,and sets the stage for future discussions on its scalability and application across different industries.展开更多
Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as ...Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.展开更多
In the past decade,notable progress has been achieved in the development of the generalized finite difference method(GFDM).The underlying principle of GFDM involves dividing the domain into multiple sub-domains.Within...In the past decade,notable progress has been achieved in the development of the generalized finite difference method(GFDM).The underlying principle of GFDM involves dividing the domain into multiple sub-domains.Within each sub-domain,explicit formulas for the necessary partial derivatives of the partial differential equations(PDEs)can be obtained through the application of Taylor series expansion and moving-least square approximation methods.Consequently,the method generates a sparse coefficient matrix,exhibiting a banded structure,making it highly advantageous for large-scale engineering computations.In this study,we present the application of the GFDM to numerically solve inverse Cauchy problems in two-and three-dimensional piezoelectric structures.Through our preliminary numerical experiments,we demonstrate that the proposed GFDMapproach shows great promise for accurately simulating coupled electroelastic equations in inverse problems,even with 3%errors added to the input data.展开更多
This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solve...This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.展开更多
To solve the Laplacian problems,we adopt a meshless method with the multiquadric radial basis function(MQRBF)as a basis whose center is distributed inside a circle with a fictitious radius.A maximal projection techniq...To solve the Laplacian problems,we adopt a meshless method with the multiquadric radial basis function(MQRBF)as a basis whose center is distributed inside a circle with a fictitious radius.A maximal projection technique is developed to identify the optimal shape factor and fictitious radius by minimizing a merit function.A sample function is interpolated by theMQ-RBF to provide a trial coefficient vector to compute the merit function.We can quickly determine the optimal values of the parameters within a preferred rage using the golden section search algorithm.The novel method provides the optimal values of parameters and,hence,an optimal MQ-RBF;the performance of the method is validated in numerical examples.Moreover,nonharmonic problems are transformed to the Poisson equation endowed with a homogeneous boundary condition;this can overcome the problem of these problems being ill-posed.The optimal MQ-RBF is extremely accurate.We further propose a novel optimal polynomial method to solve the nonharmonic problems,which achieves high precision up to an order of 10^(−11).展开更多
A class of Sturm-Liouville problems with discontinuity is studied in this paper.The oscillation properties of eigenfunctions for Sturm-Liouville problems with interface conditions are obtained.The main method used in ...A class of Sturm-Liouville problems with discontinuity is studied in this paper.The oscillation properties of eigenfunctions for Sturm-Liouville problems with interface conditions are obtained.The main method used in this paper is based on Prufer transformation,which is different from the classical ones.Moreover,we give two examples to verify our main results.展开更多
Objective: To study the problematic use of video games among secondary school students in the city of Parakou in 2023. Methods: Descriptive cross-sectional study conducted in the commune of Parakou from December 2022 ...Objective: To study the problematic use of video games among secondary school students in the city of Parakou in 2023. Methods: Descriptive cross-sectional study conducted in the commune of Parakou from December 2022 to July 2023. The study population consisted of students regularly enrolled in public and private secondary schools in the city of Parakou for the 2022-2023 academic year. A two-stage non-proportional stratified sampling technique combined with simple random sampling was adopted. The Problem Video Game Playing (PVP) scale was used to assess problem gambling in the study population, while anxiety and depression were assessed using the Hospital Anxiety and Depression Scale (HADS). Results: A total of 1030 students were included. The mean age of the pupils surveyed was 15.06 ± 2.68 years, with extremes of 10 and 28 years. The [13 - 18] age group was the most represented, with a proportion of 59.6% (614) in the general population. Females predominated, at 52.8% (544), with a sex ratio of 0.89. The prevalence of problematic video game use was 24.9%, measured using the Video Game Playing scale. Associated factors were male gender (p = 0.005), pocket money under 10,000 cfa (p = 0.001) and between 20,000 - 90,000 cfa (p = 0.030), addictive family behavior (p < 0.001), monogamous family (p = 0.023), good relationship with father (p = 0.020), organization of video game competitions (p = 0.001) and definite anxiety (p Conclusion: Substance-free addiction is struggling to attract the attention it deserves, as it did in its infancy everywhere else. This study complements existing data and serves as a reminder of the need to focus on this group of addictions, whose problematic use of video games remains the most frequent due to its accessibility and social tolerance. Preventive action combined with curative measures remains the most effective means of combating the problem at national level.展开更多
BACKGROUND Parental behaviors are key in shaping children’s psychological and behavioral development,crucial for early identification and prevention of mental health issues,reducing psychological trauma in childhood....BACKGROUND Parental behaviors are key in shaping children’s psychological and behavioral development,crucial for early identification and prevention of mental health issues,reducing psychological trauma in childhood.AIM To investigate the relationship between parenting behaviors and behavioral and emotional issues in preschool children.METHODS From October 2017 to May 2018,7 kindergartens in Ma’anshan City were selected to conduct a parent self-filled questionnaire-Health Development Survey of Preschool Children.Children’s Strength and Difficulties Questionnaire(Parent Version)was applied to measures the children’s behavioral and emotional performance.Parenting behavior was evaluated using the Parental Behavior Inventory.Binomial logistic regression model was used to analyze the association between the detection rate of preschool children’s behavior and emotional problems and their parenting behaviors.RESULTS High level of parental support/participation was negatively correlated with conduct problems,abnormal hyperactivity,abnormal total difficulty scores and abnormal prosocial behavior problems.High level of maternal support/participation was negatively correlated with abnormal emotional symptoms and abnormal peer interaction in children.High level of parental hostility/coercion was positively correlated with abnormal emotional symptoms,abnormal conduct problems,abnormal hyperactivity,abnormal peer interaction,and abnormal total difficulty scores in children(all P<0.05).Moreover,paternal parenting behaviors had similarly effects on behavior and emotional problems of preschool children compared with maternal parenting behaviors(all P>0.05),after calculating ratio of odds ratio values.CONCLUSION Our study found that parenting behaviors are associated with behavioral and emotional issues in preschool children.Overall,the more supportive or involved the parents are,the fewer behavioral and emotional problems the children experience;conversely,the more hostile or controlling the parents are,the more behavioral and emotional problems the children face.Moreover,the impact of fathers’parenting behaviors on preschool children’s behavior and emotions is no less significant than that of mothers’parenting behaviors.展开更多
We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and c...We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and comprehensive workflow that utilizes the quantum approximate optimization algorithm(QAOA).It facilitates the automatic conversion of the original problem into a quadratic unconstrained binary optimization(QUBO)model and its corresponding Ising model,which can be subsequently transformed into a weight graph.The core of Qcover relies on a graph decomposition-based classical algorithm,which efficiently derives the optimal parameters for the shallow QAOA circuit.Quafu-Qcover incorporates a dedicated compiler capable of translating QAOA circuits into physical quantum circuits that can be executed on Quafu cloud quantum computers.Compared to a general-purpose compiler,our compiler demonstrates the ability to generate shorter circuit depths,while also exhibiting superior speed performance.Additionally,the Qcover compiler has the capability to dynamically create a library of qubits coupling substructures in real-time,utilizing the most recent calibration data from the superconducting quantum devices.This ensures that computational tasks can be assigned to connected physical qubits with the highest fidelity.The Quafu-Qcover allows us to retrieve quantum computing sampling results using a task ID at any time,enabling asynchronous processing.Moreover,it incorporates modules for results preprocessing and visualization,facilitating an intuitive display of solutions for combinatorial optimization problems.We hope that Quafu-Qcover can serve as an instructive illustration for how to explore application problems on the Quafu cloud quantum computers.展开更多
The boundary value problem plays a crucial role in the analytical investigation of continuum dynamics. In this paper, an analytical method based on the Dirac operator to solve the nonlinear and non-homogeneous boundar...The boundary value problem plays a crucial role in the analytical investigation of continuum dynamics. In this paper, an analytical method based on the Dirac operator to solve the nonlinear and non-homogeneous boundary value problem of rectangular plates is proposed. The key concept behind this method is to transform the nonlinear or non-homogeneous part on the boundary into a lateral force within the governing function by the Dirac operator, which linearizes and homogenizes the original boundary, allowing one to employ the modal superposition method for obtaining solutions to reconstructive governing equations. Once projected into the modal space, the harmonic balance method(HBM) is utilized to solve coupled ordinary differential equations(ODEs)of truncated systems with nonlinearity. To validate the convergence and accuracy of the proposed Dirac method, the results of typical examples, involving nonlinearly restricted boundaries, moment excitation, and displacement excitation, are compared with those of the differential quadrature element method(DQEM). The results demonstrate that when dealing with nonlinear boundaries, the Dirac method exhibits more excellent accuracy and convergence compared with the DQEM. However, when facing displacement excitation, there exist some discrepancies between the proposed approach and simulations;nevertheless, the proposed method still accurately predicts resonant frequencies while being uniquely capable of handling nonuniform displacement excitations. Overall, this methodology offers a convenient way for addressing nonlinear and non-homogenous plate boundaries.展开更多
Drone logistics is a novel method of distribution that will become prevalent.The advantageous location of the logistics hub enables quicker customer deliveries and lower fuel consumption,resulting in cost savings for ...Drone logistics is a novel method of distribution that will become prevalent.The advantageous location of the logistics hub enables quicker customer deliveries and lower fuel consumption,resulting in cost savings for the company’s transportation operations.Logistics firms must discern the ideal location for establishing a logistics hub,which is challenging due to the simplicity of existing models and the intricate delivery factors.To simulate the drone logistics environment,this study presents a new mathematical model.The model not only retains the aspects of the current models,but also considers the degree of transportation difficulty from the logistics hub to the village,the capacity of drones for transportation,and the distribution of logistics hub locations.Moreover,this paper proposes an improved particle swarm optimization(PSO)algorithm which is a diversity-based hybrid PSO(DHPSO)algorithm to solve this model.In DHPSO,the Gaussian random walk can enhance global search in the model space,while the bubble-net attacking strategy can speed convergence.Besides,Archimedes spiral strategy is employed to overcome the local optima trap in the model and improve the exploitation of the algorithm.DHPSO maintains a balance between exploration and exploitation while better defining the distribution of logistics hub locations Numerical experiments show that the newly proposed model always achieves better locations than the current model.Comparing DHPSO with other state-of-the-art intelligent algorithms,the efficiency of the scheme can be improved by 42.58%.This means that logistics companies can reduce distribution costs and consumers can enjoy a more enjoyable shopping experience by using DHPSO’s location selection.All the results show the location of the drone logistics hub is solved by DHPSO effectively.展开更多
For unachievable tracking problems, where the system output cannot precisely track a given reference, achieving the best possible approximation for the reference trajectory becomes the objective. This study aims to in...For unachievable tracking problems, where the system output cannot precisely track a given reference, achieving the best possible approximation for the reference trajectory becomes the objective. This study aims to investigate solutions using the Ptype learning control scheme. Initially, we demonstrate the necessity of gradient information for achieving the best approximation.Subsequently, we propose an input-output-driven learning gain design to handle the imprecise gradients of a class of uncertain systems. However, it is discovered that the desired performance may not be attainable when faced with incomplete information.To address this issue, an extended iterative learning control scheme is introduced. In this scheme, the tracking errors are modified through output data sampling, which incorporates lowmemory footprints and offers flexibility in learning gain design.The input sequence is shown to converge towards the desired input, resulting in an output that is closest to the given reference in the least square sense. Numerical simulations are provided to validate the theoretical findings.展开更多
Clifford analysis is an important branch of modern analysis;it has a very important theoretical significance and application value,and its conclusions can be applied to the Maxwell equation,Yang-Mill field theory,quan...Clifford analysis is an important branch of modern analysis;it has a very important theoretical significance and application value,and its conclusions can be applied to the Maxwell equation,Yang-Mill field theory,quantum mechanics and value problems.In this paper,we first give the definition of a quasi-Cauchy type integral in complex Clifford analysis,and get the Plemelj formula for it.Second,we discuss the H?lder continuity for the Cauchy-type integral operators with values in a complex Clifford algebra.Finally,we prove the existence of solutions for a class of linear boundary value problems and give the integral representation for the solution.展开更多
Transient heat conduction problems widely exist in engineering.In previous work on the peridynamic differential operator(PDDO)method for solving such problems,both time and spatial derivatives were discretized using t...Transient heat conduction problems widely exist in engineering.In previous work on the peridynamic differential operator(PDDO)method for solving such problems,both time and spatial derivatives were discretized using the PDDO method,resulting in increased complexity and programming difficulty.In this work,the forward difference formula,the backward difference formula,and the centered difference formula are used to discretize the time derivative,while the PDDO method is used to discretize the spatial derivative.Three new schemes for solving transient heat conduction equations have been developed,namely,the forward-in-time and PDDO in space(FT-PDDO)scheme,the backward-in-time and PDDO in space(BT-PDDO)scheme,and the central-in-time and PDDO in space(CT-PDDO)scheme.The stability and convergence of these schemes are analyzed using the Fourier method and Taylor’s theorem.Results show that the FT-PDDO scheme is conditionally stable,whereas the BT-PDDO and CT-PDDO schemes are unconditionally stable.The stability conditions for the FT-PDDO scheme are less stringent than those of the explicit finite element method and explicit finite difference method.The convergence rate in space for these three methods is two.These constructed schemes are applied to solve one-dimensional and two-dimensional transient heat conduction problems.The accuracy and validity of the schemes are verified by comparison with analytical solutions.展开更多
文摘Speech emotion recognition(SER)uses acoustic analysis to find features for emotion recognition and examines variations in voice that are caused by emotions.The number of features acquired with acoustic analysis is extremely high,so we introduce a hybrid filter-wrapper feature selection algorithm based on an improved equilibrium optimizer for constructing an emotion recognition system.The proposed algorithm implements multi-objective emotion recognition with the minimum number of selected features and maximum accuracy.First,we use the information gain and Fisher Score to sort the features extracted from signals.Then,we employ a multi-objective ranking method to evaluate these features and assign different importance to them.Features with high rankings have a large probability of being selected.Finally,we propose a repair strategy to address the problem of duplicate solutions in multi-objective feature selection,which can improve the diversity of solutions and avoid falling into local traps.Using random forest and K-nearest neighbor classifiers,four English speech emotion datasets are employed to test the proposed algorithm(MBEO)as well as other multi-objective emotion identification techniques.The results illustrate that it performs well in inverted generational distance,hypervolume,Pareto solutions,and execution time,and MBEO is appropriate for high-dimensional English SER.
基金supported by the Innovation Fund Project of the Gansu Education Department(Grant No.2021B-099).
文摘The objective of reliability-based design optimization(RBDO)is to minimize the optimization objective while satisfying the corresponding reliability requirements.However,the nested loop characteristic reduces the efficiency of RBDO algorithm,which hinders their application to high-dimensional engineering problems.To address these issues,this paper proposes an efficient decoupled RBDO method combining high dimensional model representation(HDMR)and the weight-point estimation method(WPEM).First,we decouple the RBDO model using HDMR and WPEM.Second,Lagrange interpolation is used to approximate a univariate function.Finally,based on the results of the first two steps,the original nested loop reliability optimization model is completely transformed into a deterministic design optimization model that can be solved by a series of mature constrained optimization methods without any additional calculations.Two numerical examples of a planar 10-bar structure and an aviation hydraulic piping system with 28 design variables are analyzed to illustrate the performance and practicability of the proposed method.
文摘The estimation of covariance matrices is very important in many fields, such as statistics. In real applications, data are frequently influenced by high dimensions and noise. However, most relevant studies are based on complete data. This paper studies the optimal estimation of high-dimensional covariance matrices based on missing and noisy sample under the norm. First, the model with sub-Gaussian additive noise is presented. The generalized sample covariance is then modified to define a hard thresholding estimator , and the minimax upper bound is derived. After that, the minimax lower bound is derived, and it is concluded that the estimator presented in this article is rate-optimal. Finally, numerical simulation analysis is performed. The result shows that for missing samples with sub-Gaussian noise, if the true covariance matrix is sparse, the hard thresholding estimator outperforms the traditional estimate method.
基金supported in part by the National Natural Science Foundation of China(62172065,62072060)。
文摘As a crucial data preprocessing method in data mining,feature selection(FS)can be regarded as a bi-objective optimization problem that aims to maximize classification accuracy and minimize the number of selected features.Evolutionary computing(EC)is promising for FS owing to its powerful search capability.However,in traditional EC-based methods,feature subsets are represented via a length-fixed individual encoding.It is ineffective for high-dimensional data,because it results in a huge search space and prohibitive training time.This work proposes a length-adaptive non-dominated sorting genetic algorithm(LA-NSGA)with a length-variable individual encoding and a length-adaptive evolution mechanism for bi-objective highdimensional FS.In LA-NSGA,an initialization method based on correlation and redundancy is devised to initialize individuals of diverse lengths,and a Pareto dominance-based length change operator is introduced to guide individuals to explore in promising search space adaptively.Moreover,a dominance-based local search method is employed for further improvement.The experimental results based on 12 high-dimensional gene datasets show that the Pareto front of feature subsets produced by LA-NSGA is superior to those of existing algorithms.
基金National Natural Science Foundation of China,Grant/Award Number:61972261Basic Research Foundations of Shenzhen,Grant/Award Numbers:JCYJ20210324093609026,JCYJ20200813091134001。
文摘In this paper,an Observation Points Classifier Ensemble(OPCE)algorithm is proposed to deal with High-Dimensional Imbalanced Classification(HDIC)problems based on data processed using the Multi-Dimensional Scaling(MDS)feature extraction technique.First,dimensionality of the original imbalanced data is reduced using MDS so that distances between any two different samples are preserved as well as possible.Second,a novel OPCE algorithm is applied to classify imbalanced samples by placing optimised observation points in a low-dimensional data space.Third,optimization of the observation point mappings is carried out to obtain a reliable assessment of the unknown samples.Exhaustive experiments have been conducted to evaluate the feasibility,rationality,and effectiveness of the proposed OPCE algorithm using seven benchmark HDIC data sets.Experimental results show that(1)the OPCE algorithm can be trained faster on low-dimensional imbalanced data than on high-dimensional data;(2)the OPCE algorithm can correctly identify samples as the number of optimised observation points is increased;and(3)statistical analysis reveals that OPCE yields better HDIC performances on the selected data sets in comparison with eight other HDIC algorithms.This demonstrates that OPCE is a viable algorithm to deal with HDIC problems.
文摘k-means is a popular clustering algorithm because of its simplicity and scalability to handle large datasets.However,one of its setbacks is the challenge of identifying the correct k-hyperparameter value.Tuning this value correctly is critical for building effective k-means models.The use of the traditional elbow method to help identify this value has a long-standing literature.However,when using this method with certain datasets,smooth curves may appear,making it challenging to identify the k-value due to its unclear nature.On the other hand,various internal validation indexes,which are proposed as a solution to this issue,may be inconsistent.Although various techniques for solving smooth elbow challenges exist,k-hyperparameter tuning in high-dimensional spaces still remains intractable and an open research issue.In this paper,we have first reviewed the existing techniques for solving smooth elbow challenges.The identified research gaps are then utilized in the development of the new technique.The new technique,referred to as the ensemble-based technique of a self-adapting autoencoder and internal validation indexes,is then validated in high-dimensional space clustering.The optimal k-value,tuned by this technique using a voting scheme,is a trade-off between the number of clusters visualized in the autoencoder’s latent space,k-value from the ensemble internal validation index score and one that generates a value of 0 or close to 0 on the derivative f″′(k)(1+f′(k)^(2))−3 f″(k)^(2)f″((k)2f′(k),at the elbow.Experimental results based on the Cochran’s Q test,ANOVA,and McNemar’s score indicate a relatively good performance of the newly developed technique in k-hyperparameter tuning.
文摘In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an extended fuzzy approach,often known as neutrosophic logic.Our rigorous proposed model has led to the creation of an advanced technique for computing the triangular single-valued neutrosophic number.This innovative approach evaluates the inherent uncertainty in project durations of the planning phase,which enhances the potential significance of the decision-making process in the project.Our proposed method,for the first time in the neutrosophic set literature,not only solves existing problems but also introduces a new set of problems not yet explored in previous research.A comparative study using Python programming was conducted to examine the effectiveness of responsive and adaptive planning,as well as their differences from other existing models such as the classical critical path problem and the fuzzy critical path problem.The study highlights the use of neutrosophic logic in handling complex projects by illustrating an innovative dynamic programming framework that is robust and flexible,according to the derived results,and sets the stage for future discussions on its scalability and application across different industries.
文摘Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.
基金the Natural Science Foundation of Shandong Province of China(Grant No.ZR2022YQ06)the Development Plan of Youth Innovation Team in Colleges and Universities of Shandong Province(Grant No.2022KJ140)the Key Laboratory ofRoad Construction Technology and Equipment(Chang’an University,No.300102253502).
文摘In the past decade,notable progress has been achieved in the development of the generalized finite difference method(GFDM).The underlying principle of GFDM involves dividing the domain into multiple sub-domains.Within each sub-domain,explicit formulas for the necessary partial derivatives of the partial differential equations(PDEs)can be obtained through the application of Taylor series expansion and moving-least square approximation methods.Consequently,the method generates a sparse coefficient matrix,exhibiting a banded structure,making it highly advantageous for large-scale engineering computations.In this study,we present the application of the GFDM to numerically solve inverse Cauchy problems in two-and three-dimensional piezoelectric structures.Through our preliminary numerical experiments,we demonstrate that the proposed GFDMapproach shows great promise for accurately simulating coupled electroelastic equations in inverse problems,even with 3%errors added to the input data.
基金the National Science and Tech-nology Council,Taiwan for their financial support(Grant Number NSTC 111-2221-E-019-048).
文摘This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.
基金supported by the the National Science and Technology Council(Grant Number:NSTC 112-2221-E239-022).
文摘To solve the Laplacian problems,we adopt a meshless method with the multiquadric radial basis function(MQRBF)as a basis whose center is distributed inside a circle with a fictitious radius.A maximal projection technique is developed to identify the optimal shape factor and fictitious radius by minimizing a merit function.A sample function is interpolated by theMQ-RBF to provide a trial coefficient vector to compute the merit function.We can quickly determine the optimal values of the parameters within a preferred rage using the golden section search algorithm.The novel method provides the optimal values of parameters and,hence,an optimal MQ-RBF;the performance of the method is validated in numerical examples.Moreover,nonharmonic problems are transformed to the Poisson equation endowed with a homogeneous boundary condition;this can overcome the problem of these problems being ill-posed.The optimal MQ-RBF is extremely accurate.We further propose a novel optimal polynomial method to solve the nonharmonic problems,which achieves high precision up to an order of 10^(−11).
基金Supported by the Natural Science Foundation of Shandong Province(ZR2023MA023,ZR2021MA047)Guangdong Provincial Featured Innovation Projects of High School(2023KTSCX067).
文摘A class of Sturm-Liouville problems with discontinuity is studied in this paper.The oscillation properties of eigenfunctions for Sturm-Liouville problems with interface conditions are obtained.The main method used in this paper is based on Prufer transformation,which is different from the classical ones.Moreover,we give two examples to verify our main results.
文摘Objective: To study the problematic use of video games among secondary school students in the city of Parakou in 2023. Methods: Descriptive cross-sectional study conducted in the commune of Parakou from December 2022 to July 2023. The study population consisted of students regularly enrolled in public and private secondary schools in the city of Parakou for the 2022-2023 academic year. A two-stage non-proportional stratified sampling technique combined with simple random sampling was adopted. The Problem Video Game Playing (PVP) scale was used to assess problem gambling in the study population, while anxiety and depression were assessed using the Hospital Anxiety and Depression Scale (HADS). Results: A total of 1030 students were included. The mean age of the pupils surveyed was 15.06 ± 2.68 years, with extremes of 10 and 28 years. The [13 - 18] age group was the most represented, with a proportion of 59.6% (614) in the general population. Females predominated, at 52.8% (544), with a sex ratio of 0.89. The prevalence of problematic video game use was 24.9%, measured using the Video Game Playing scale. Associated factors were male gender (p = 0.005), pocket money under 10,000 cfa (p = 0.001) and between 20,000 - 90,000 cfa (p = 0.030), addictive family behavior (p < 0.001), monogamous family (p = 0.023), good relationship with father (p = 0.020), organization of video game competitions (p = 0.001) and definite anxiety (p Conclusion: Substance-free addiction is struggling to attract the attention it deserves, as it did in its infancy everywhere else. This study complements existing data and serves as a reminder of the need to focus on this group of addictions, whose problematic use of video games remains the most frequent due to its accessibility and social tolerance. Preventive action combined with curative measures remains the most effective means of combating the problem at national level.
基金Supported by the National Natural Science Foundation of China,No.81330068.
文摘BACKGROUND Parental behaviors are key in shaping children’s psychological and behavioral development,crucial for early identification and prevention of mental health issues,reducing psychological trauma in childhood.AIM To investigate the relationship between parenting behaviors and behavioral and emotional issues in preschool children.METHODS From October 2017 to May 2018,7 kindergartens in Ma’anshan City were selected to conduct a parent self-filled questionnaire-Health Development Survey of Preschool Children.Children’s Strength and Difficulties Questionnaire(Parent Version)was applied to measures the children’s behavioral and emotional performance.Parenting behavior was evaluated using the Parental Behavior Inventory.Binomial logistic regression model was used to analyze the association between the detection rate of preschool children’s behavior and emotional problems and their parenting behaviors.RESULTS High level of parental support/participation was negatively correlated with conduct problems,abnormal hyperactivity,abnormal total difficulty scores and abnormal prosocial behavior problems.High level of maternal support/participation was negatively correlated with abnormal emotional symptoms and abnormal peer interaction in children.High level of parental hostility/coercion was positively correlated with abnormal emotional symptoms,abnormal conduct problems,abnormal hyperactivity,abnormal peer interaction,and abnormal total difficulty scores in children(all P<0.05).Moreover,paternal parenting behaviors had similarly effects on behavior and emotional problems of preschool children compared with maternal parenting behaviors(all P>0.05),after calculating ratio of odds ratio values.CONCLUSION Our study found that parenting behaviors are associated with behavioral and emotional issues in preschool children.Overall,the more supportive or involved the parents are,the fewer behavioral and emotional problems the children experience;conversely,the more hostile or controlling the parents are,the more behavioral and emotional problems the children face.Moreover,the impact of fathers’parenting behaviors on preschool children’s behavior and emotions is no less significant than that of mothers’parenting behaviors.
基金supported by the National Natural Science Foundation of China(Grant No.92365206)the support of the China Postdoctoral Science Foundation(Certificate Number:2023M740272)+1 种基金supported by the National Natural Science Foundation of China(Grant No.12247168)China Postdoctoral Science Foundation(Certificate Number:2022TQ0036)。
文摘We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and comprehensive workflow that utilizes the quantum approximate optimization algorithm(QAOA).It facilitates the automatic conversion of the original problem into a quadratic unconstrained binary optimization(QUBO)model and its corresponding Ising model,which can be subsequently transformed into a weight graph.The core of Qcover relies on a graph decomposition-based classical algorithm,which efficiently derives the optimal parameters for the shallow QAOA circuit.Quafu-Qcover incorporates a dedicated compiler capable of translating QAOA circuits into physical quantum circuits that can be executed on Quafu cloud quantum computers.Compared to a general-purpose compiler,our compiler demonstrates the ability to generate shorter circuit depths,while also exhibiting superior speed performance.Additionally,the Qcover compiler has the capability to dynamically create a library of qubits coupling substructures in real-time,utilizing the most recent calibration data from the superconducting quantum devices.This ensures that computational tasks can be assigned to connected physical qubits with the highest fidelity.The Quafu-Qcover allows us to retrieve quantum computing sampling results using a task ID at any time,enabling asynchronous processing.Moreover,it incorporates modules for results preprocessing and visualization,facilitating an intuitive display of solutions for combinatorial optimization problems.We hope that Quafu-Qcover can serve as an instructive illustration for how to explore application problems on the Quafu cloud quantum computers.
基金Project supported by the National Natural Science Foundation of China (No. 12002195)the National Science Fund for Distinguished Young Scholars (No. 12025204)the Program of Shanghai Municipal Education Commission (No. 2019-01-07-00-09-E00018)。
文摘The boundary value problem plays a crucial role in the analytical investigation of continuum dynamics. In this paper, an analytical method based on the Dirac operator to solve the nonlinear and non-homogeneous boundary value problem of rectangular plates is proposed. The key concept behind this method is to transform the nonlinear or non-homogeneous part on the boundary into a lateral force within the governing function by the Dirac operator, which linearizes and homogenizes the original boundary, allowing one to employ the modal superposition method for obtaining solutions to reconstructive governing equations. Once projected into the modal space, the harmonic balance method(HBM) is utilized to solve coupled ordinary differential equations(ODEs)of truncated systems with nonlinearity. To validate the convergence and accuracy of the proposed Dirac method, the results of typical examples, involving nonlinearly restricted boundaries, moment excitation, and displacement excitation, are compared with those of the differential quadrature element method(DQEM). The results demonstrate that when dealing with nonlinear boundaries, the Dirac method exhibits more excellent accuracy and convergence compared with the DQEM. However, when facing displacement excitation, there exist some discrepancies between the proposed approach and simulations;nevertheless, the proposed method still accurately predicts resonant frequencies while being uniquely capable of handling nonuniform displacement excitations. Overall, this methodology offers a convenient way for addressing nonlinear and non-homogenous plate boundaries.
基金supported by the NationalNatural Science Foundation of China(No.61866023).
文摘Drone logistics is a novel method of distribution that will become prevalent.The advantageous location of the logistics hub enables quicker customer deliveries and lower fuel consumption,resulting in cost savings for the company’s transportation operations.Logistics firms must discern the ideal location for establishing a logistics hub,which is challenging due to the simplicity of existing models and the intricate delivery factors.To simulate the drone logistics environment,this study presents a new mathematical model.The model not only retains the aspects of the current models,but also considers the degree of transportation difficulty from the logistics hub to the village,the capacity of drones for transportation,and the distribution of logistics hub locations.Moreover,this paper proposes an improved particle swarm optimization(PSO)algorithm which is a diversity-based hybrid PSO(DHPSO)algorithm to solve this model.In DHPSO,the Gaussian random walk can enhance global search in the model space,while the bubble-net attacking strategy can speed convergence.Besides,Archimedes spiral strategy is employed to overcome the local optima trap in the model and improve the exploitation of the algorithm.DHPSO maintains a balance between exploration and exploitation while better defining the distribution of logistics hub locations Numerical experiments show that the newly proposed model always achieves better locations than the current model.Comparing DHPSO with other state-of-the-art intelligent algorithms,the efficiency of the scheme can be improved by 42.58%.This means that logistics companies can reduce distribution costs and consumers can enjoy a more enjoyable shopping experience by using DHPSO’s location selection.All the results show the location of the drone logistics hub is solved by DHPSO effectively.
基金supported by the National Natural Science Foundation of China (62173333, 12271522)Beijing Natural Science Foundation (Z210002)the Research Fund of Renmin University of China (2021030187)。
文摘For unachievable tracking problems, where the system output cannot precisely track a given reference, achieving the best possible approximation for the reference trajectory becomes the objective. This study aims to investigate solutions using the Ptype learning control scheme. Initially, we demonstrate the necessity of gradient information for achieving the best approximation.Subsequently, we propose an input-output-driven learning gain design to handle the imprecise gradients of a class of uncertain systems. However, it is discovered that the desired performance may not be attainable when faced with incomplete information.To address this issue, an extended iterative learning control scheme is introduced. In this scheme, the tracking errors are modified through output data sampling, which incorporates lowmemory footprints and offers flexibility in learning gain design.The input sequence is shown to converge towards the desired input, resulting in an output that is closest to the given reference in the least square sense. Numerical simulations are provided to validate the theoretical findings.
基金supported by the NSF of Hebei Province(A2022208007)the NSF of China(11571089,11871191)the NSF of Henan Province(222300420397)。
文摘Clifford analysis is an important branch of modern analysis;it has a very important theoretical significance and application value,and its conclusions can be applied to the Maxwell equation,Yang-Mill field theory,quantum mechanics and value problems.In this paper,we first give the definition of a quasi-Cauchy type integral in complex Clifford analysis,and get the Plemelj formula for it.Second,we discuss the H?lder continuity for the Cauchy-type integral operators with values in a complex Clifford algebra.Finally,we prove the existence of solutions for a class of linear boundary value problems and give the integral representation for the solution.
基金This work was financially supported by the Key Science and Technology Project of Longmen Laboratory(No.LMYLKT-001)Innovation and Entrepreneurship Training Program for College Students of Henan Province(No.202310464050)。
文摘Transient heat conduction problems widely exist in engineering.In previous work on the peridynamic differential operator(PDDO)method for solving such problems,both time and spatial derivatives were discretized using the PDDO method,resulting in increased complexity and programming difficulty.In this work,the forward difference formula,the backward difference formula,and the centered difference formula are used to discretize the time derivative,while the PDDO method is used to discretize the spatial derivative.Three new schemes for solving transient heat conduction equations have been developed,namely,the forward-in-time and PDDO in space(FT-PDDO)scheme,the backward-in-time and PDDO in space(BT-PDDO)scheme,and the central-in-time and PDDO in space(CT-PDDO)scheme.The stability and convergence of these schemes are analyzed using the Fourier method and Taylor’s theorem.Results show that the FT-PDDO scheme is conditionally stable,whereas the BT-PDDO and CT-PDDO schemes are unconditionally stable.The stability conditions for the FT-PDDO scheme are less stringent than those of the explicit finite element method and explicit finite difference method.The convergence rate in space for these three methods is two.These constructed schemes are applied to solve one-dimensional and two-dimensional transient heat conduction problems.The accuracy and validity of the schemes are verified by comparison with analytical solutions.