Relationship between parenting stress and behavioral and emotional problems in preschool children: A mediation effect analysis

BACKGROUND Emotional reactions,such as anxiety,irritability,and aggressive behavior,have attracted clinical attention as behavioral and emotional problems in preschool-age children.AIM To investigate the current status of family rearing,parental stress,and behavioral and emotional problems of preschool children and to analyze the mediating effect of the current status of family rearing on parental stress and behavioral/emo-tional problems.METHODS We use convenience sampling to select 258 preschool children in the physical examination center of our hospital from October 2021 to September 2023.The children and their parents were evaluated using a questionnaire survey.Pearson's correlation was used to analyze the correlation between child behavioral and emotional problems and parental stress and family rearing,and the structural equation model was constructed to test the mediating effect.RESULTS The score for behavioral/emotional problems of 258 preschool children was(27.54±3.63),the score for parental stress was(87.64±11.34),and the score for parental family rearing was(31.54±5.24).There was a positive correlation between the behavioral and emotional problems of the children and the“hostile/mandatory”parenting style;meanwhile,showed a negative correlation with the“support/participation”parenting style(all P<0.05).The intermediary effect value between the family upbringing of parents in parental stress and children's behavior problems was 29.89%.CONCLUSION Parental family upbringing has a mediating effect between parental stress and behavioral and emotional problems of children.Despite paying attention to the behavioral and emotional problems of preschool-age children,clinical medical staff should provide correct and reasonable parenting advice to their parents to promote the mental health of preschool-age children.

Laparoscopic hepatectomy using indocyanine green attenuates postoperative inflammatory response for hepatocellular carcinoma:A propensity score matching analysis

BACKGROUND Improving the intraoperative and postoperative performance of laparoscopic hepatectomy was quite a challenge for liver surgeons.AIM To determine the benefits of indocyanine green(ICG)fluorescence imaging in patients with hepatocellular carcinoma(HCC)who underwent laparoscopic hepatectomy during and after surgery.METHODS We retrospectively collected the clinicopathological data of 107 patients who successfully underwent laparoscopic hepatectomy at Zhongshan Hospital(Xiamen),Fudan University from June 2022 to June 2023.Whether using the ICG fluorescence imaging technique,we divided them into the ICG and non-ICG groups.To eliminate statistical bias,a 1:1 propensity score matching analysis was conducted.The comparison of perioperative outcomes,including inflammationrelated markers and progression-free survival,was analyzed statistically.RESULTS Intraoperatively,the ICG group exhibited lower blood loss,a shorter surgical time,lower hepatic inflow occlusion(HIO)frequency,and a shorter total HIO time.Postoperatively,the participation of ICG resulted in a shorter duration of hospitalization(6.5 vs 7.6 days,P=0.03)and postoperative inflammatory response attenuation(lower neutrophil-lymphocyte ratio on the first day after surgery and platelet-lymphocyte ratio on the third day,P<0.05).Although the differences were not significant,the levels of all inflammation-related markers were lower in the ICG group.The rates of postoperative complications and the survival analyses,including progression-free and overall survivals showed no significant difference between the groups.CONCLUSION The involvement of ICG fluorescence imaging may lead to improved perioperative outcomes,especially postoperative inflammatory response attenuation,and ultimately improve HCC patients’recovery after surgery.

Efficacy-cost analysis of endoscopic mucosal resection and cold snare polypectomy:A propensity score matching analysis

BACKGROUND Although substantial evidence supports the advantages of cold snare polypectomy(CSP)in terms of polypectomy efficacy and reduced postoperative adverse events,few studies have examined the cost differences between CSP and traditional endoscopic mucosal resection(EMR)for the treatment of intestinal polyps.AIM To compare the efficacy-cost of EMR and CSP in the treatment of intestinal polyps.METHODS A total of 100 patients with intestinal polyps were included in the retrospective data of our hospital from April 2022 to May 2023.According to the treatment methods,they were divided into EMR(n=46)group and CSP(n=54)group.The baseline data of the two groups were balanced by 1:1 propensity score matching(PSM),and the cost-effectiveness analysis was performed on the two groups after matching.The recurrence rate of the two groups of patients was followed up for 1 year,and they were divided into recurrence group and non-recurrence group according to whether they recurred.Multivariate logistic regression analysis was used to screen out the influencing factors affecting the recurrence of intestinal polyps after endoscopic resection.RESULTS Significant disparities were observed in the number of polyps and smoking background between the two groups before PSM(P<0.05).Following PSM,the number of polyps and smoking history were well balanced between the EMR and CSP groups.The direct cost incurred by the CSP group was markedly higher than that incurred by the EMR group.Concurrently,the cost-effectiveness ratio in the CSP group was substantially reduced when juxtaposed with that in the EMR group(P<0.05).Upon completion of the 1-year follow-up,the rate of recurrence after endoscopic intestinal polypectomy was 38.00%.Multivariate methods revealed that age≥60 years,male sex,number of polyps≥3,and pathological type of adenoma were risk factors for recurrence after endoscopic intestinal polypectomy(all P<0.05).CONCLUSION CSP was more cost-effective for the treatment of intestinal polyps.An age≥60 years,male sex,having a number of polyps≥3,and pathological type of adenoma are independent influencing factors for recurrence.

Combining deep reinforcement learning with heuristics to solve the traveling salesman problem

Recent studies employing deep learning to solve the traveling salesman problem(TSP)have mainly focused on learning construction heuristics.Such methods can improve TSP solutions,but still depend on additional programs.However,methods that focus on learning improvement heuristics to iteratively refine solutions remain insufficient.Traditional improvement heuristics are guided by a manually designed search strategy and may only achieve limited improvements.This paper proposes a novel framework for learning improvement heuristics,which automatically discovers better improvement policies for heuristics to iteratively solve the TSP.Our framework first designs a new architecture based on a transformer model to make the policy network parameterized,which introduces an action-dropout layer to prevent action selection from overfitting.It then proposes a deep reinforcement learning approach integrating a simulated annealing mechanism(named RL-SA)to learn the pairwise selected policy,aiming to improve the 2-opt algorithm's performance.The RL-SA leverages the whale optimization algorithm to generate initial solutions for better sampling efficiency and uses the Gaussian perturbation strategy to tackle the sparse reward problem of reinforcement learning.The experiment results show that the proposed approach is significantly superior to the state-of-the-art learning-based methods,and further reduces the gap between learning-based methods and highly optimized solvers in the benchmark datasets.Moreover,our pre-trained model M can be applied to guide the SA algorithm(named M-SA(ours)),which performs better than existing deep models in small-,medium-,and large-scale TSPLIB datasets.Additionally,the M-SA(ours)achieves excellent generalization performance in a real-world dataset on global liner shipping routes,with the optimization percentages in distance reduction ranging from3.52%to 17.99%.

A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage and Retrieval System of E-commerce

E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.

Analytical Structure Matching and Very Precise Approach to the Coulombic Quantum Three—Body Problem

A powerful approach to solve the Coulombic quantum three-body problem is proposed. The approach is exponentially convergent and more efficient than the hyperspherical coordinate method and the correlation-function hyperspherical harmonic method. This approach is numerically competitive with the variational methods, such as that using the Hylleraas-type basis functions. Numerical comparisons are made to demonstrate the efficiency of this approach, by calculating the nonrelativistic and infinite-nuclear-mass limit of the ground state energy of the helium atom. The exponential convergency of this approach is due to the full matching between the analytical structure of the basis functions that are used in this paper and the true wavefunction. This full matching was not reached by most other methods. For example, the variational method using the Hylleraas-type basis does not reflects the logarithmic singularity of the true wavefunction at the origin as predicted by Bartlett and Fock. Two important approaches are proposed in this work to reach this full matching: the coordinate transformation method and the asymptotic series method. Besides these, this work makes use of the least square method to substitute complicated numerical integrations in solving the Schr?dinger equation without much loss of accuracy, which is routinely used by people to fit a theoretical curve with discrete experimental data, but here is used to simplify the computation.

STUDY OF MATCHING PROBLEM IN DUAL ENERGY SUBSTRACTION

After discussing the principle of dual energy substraction,this paper dealswith the matching problem in dual energy substraction in detail.In order to obtain bettermatching feature of images,the probability enhancement is used to process the originalimages.Several matching methods are presented,among these methods,the segment chos-en matching is specially useful for applications.Several experimental results are presented.

Association of preschool children behavior and emotional problems with the parenting behavior of both parents

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.

Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-core based environment. Experimental outcomes reveal that the overall performance of the mentioned string matching algorithm has been improved, and the improvement in the execution time which has been obtained is considerable enough to recommend the multi-core environment as the suitable platform for parallelizing the Quick Search string matching algorithm.

Quafu-Qcover:Explore combinatorial optimization problems on cloud-based quantum computers

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.

Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time

The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.

Road Traffic Monitoring from Aerial Images Using Template Matching and Invariant Features

Road traffic monitoring is an imperative topic widely discussed among researchers.Systems used to monitor traffic frequently rely on cameras mounted on bridges or roadsides.However,aerial images provide the flexibility to use mobile platforms to detect the location and motion of the vehicle over a larger area.To this end,different models have shown the ability to recognize and track vehicles.However,these methods are not mature enough to produce accurate results in complex road scenes.Therefore,this paper presents an algorithm that combines state-of-the-art techniques for identifying and tracking vehicles in conjunction with image bursts.The extracted frames were converted to grayscale,followed by the application of a georeferencing algorithm to embed coordinate information into the images.The masking technique eliminated irrelevant data and reduced the computational cost of the overall monitoring system.Next,Sobel edge detection combined with Canny edge detection and Hough line transform has been applied for noise reduction.After preprocessing,the blob detection algorithm helped detect the vehicles.Vehicles of varying sizes have been detected by implementing a dynamic thresholding scheme.Detection was done on the first image of every burst.Then,to track vehicles,the model of each vehicle was made to find its matches in the succeeding images using the template matching algorithm.To further improve the tracking accuracy by incorporating motion information,Scale Invariant Feature Transform(SIFT)features have been used to find the best possible match among multiple matches.An accuracy rate of 87%for detection and 80%accuracy for tracking in the A1 Motorway Netherland dataset has been achieved.For the Vehicle Aerial Imaging from Drone(VAID)dataset,an accuracy rate of 86%for detection and 78%accuracy for tracking has been achieved.

ON DE FINETTI'S OPTIMAL IMPULSE DIVIDEND CONTROL PROBLEM UNDER CHAPTER 11 BANKRUPTCY

Motivated by recent advances made in the study of dividend control and risk management problems involving the U.S.bankruptcy code,in this paper we follow[44]to revisit the De Finetti dividend control problem under the reorganization process and the regulator's intervention documented in U.S.Chapter 11 bankruptcy.We do this by further accommodating the fixed transaction costs on dividends to imitate the real-world procedure of dividend payments.Incorporating the fixed transaction costs transforms the targeting optimal dividend problem into an impulse control problem rather than a singular control problem,and hence computations and proofs that are distinct from[44]are needed.To account for the financial stress that is due to the more subtle concept of Chapter 11 bankruptcy,the surplus process after dividends is driven by a piece-wise spectrally negative Lévy process with endogenous regime switching.Some explicit expressions of the expected net present values under a double barrier dividend strategy,new to the literature,are established in terms of scale functions.With the help of these expressions,we are able to characterize the optimal strategy among the set of admissible double barrier dividend strategies.When the tail of the Lévy measure is log-convex,this optimal double barrier dividend strategy is then verified as the optimal dividend strategy,solving our optimal impulse control problem.

Unconditionally stable Crank-Nicolson algorithm with enhanced absorption for rotationally symmetric multi-scale problems in anisotropic magnetized plasma

Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is proposed for rotationally symmetric multi-scale problems in anisotropic magnetized plasma.Within the CNDG algorithm,an alternative scheme for the simulation of anisotropic plasma is proposed in body-of-revolution domains.Convolutional perfectly matched layer(CPML)formulation is proposed to efficiently solve the open region problems.Numerical example is carried out for the illustration of effectiveness including the efficiency,resources,and absorption.Through the results,it can be concluded that the proposed scheme shows considerable performance during the simulation.

Enhancing Critical Path Problem in Neutrosophic Environment Using Python

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.

A Comparative Study of Metaheuristic Optimization Algorithms for Solving Real-World Engineering Design Problems

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.

An Effective Meshless Approach for Inverse Cauchy Problems in 2D and 3D Electroelastic Piezoelectric Structures

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.

A Portfolio Selection Method Based on Pattern Matching with Dual Information of Direction and Distance

Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of similarity sets, and proposes a Portfolio Selection Method based on Pattern Matching with Dual Information of Direction and Distance (PMDI). By studying different combination methods of indicators such as Euclidean distance, Chebyshev distance, and correlation coefficient, important information such as direction and distance in stock historical price information is extracted, thereby filtering out the similarity set required for pattern matching based investment portfolio selection algorithms. A large number of experiments conducted on two datasets of real stock markets have shown that PMDI outperforms other algorithms in balancing income and risk. Therefore, it is suitable for the financial environment in the real world.

Efficient Inverse Analysis for Solving a Coupled Conduction,Convection and Radiation Problem Involving Non⁃gray Participating Media

The presence of non-gray radiative properties in a reheating furnace’s medium that absorbs,emits,and involves non-gray creates more complex radiative heat transfer problems.Furthermore,it adds difficulty to solving the coupled conduction,convection,and radiation problem,leading to suboptimal efficiency that fails to meet real-time control demands.To overcome this difficulty,comparable gray radiative properties of non-gray media are proposed and estimated by solving an inverse problem.However,the required iteration numbers by using a least-squares method are too many and resulted in a very low inverse efficiency.It is necessary to present an efficient method for the equivalence.The Levenberg-Marquardt algorithm is utilized to solve the inverse problem of coupled heat transfer,and the gray-equivalent radiative characteristics are successfully recovered.It is our intention that the issue of low inverse efficiency,which has been observed when the least-squares method is employed,will be resolved.To enhance the performance of the Levenberg-Marquardt algorithm,a modification is implemented for determining the damping factor.Detailed investigations are also conducted to evaluate its accuracy,stability of convergence,efficiency,and robustness of the algorithm.Subsequently,a comparison is made between the results achieved using each method.

Alternative Methods of Regular and Singular Perturbation Problems

Making exact approximations to solve equations distinguishes applied mathematicians from pure mathematicians, physicists, and engineers. Perturbation problems, both regular and singular, are pervasive in diverse fields of applied mathematics and engineering. This research paper provides a comprehensive overview of algebraic methods for solving perturbation problems, featuring a comparative analysis of their strengths and limitations. Serving as a valuable resource for researchers and practitioners, it offers insights and guidance for tackling perturbation problems in various disciplines, facilitating the advancement of applied mathematics and engineering.