There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on...There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on the analysis of FSPT and under the support of TOC (theory of constraint). A flow shop is at first decomposed into two subsystems named PULL and PUSH by means of bottleneck. Then the subsystem is decomposed into single machine scheduling problems,so the original NP-HARD problem can be transferred into a serial of single machine optimization problems finally. This method reduces the computational complexity, and has been used in a real project successfully.展开更多
In the“shared manufacturing”environment,based on fairness,shared manufacturing platforms often require manufacturing service enterprises to arrange production according to the principle of“order first,finish first...In the“shared manufacturing”environment,based on fairness,shared manufacturing platforms often require manufacturing service enterprises to arrange production according to the principle of“order first,finish first”which leads to a series of scheduling problems with fixed processing sequences.In this paper,two two-machine hybrid flow-shop problems with fixed processing sequences are studied.Each job has two tasks.The first task is flexible,which can be processed on either of the two machines,and the second task must be processed on the second machine after the first task is completed.We consider two objective functions:to minimize the makespan and tominimize the total weighted completion time.First,we show the problem for any one of the two objectives is ordinary NP-hard by polynomial-time Turing Reduction.Then,using the Continuous ProcessingModule(CPM),we design a dynamic programming algorithm for each case and calculate the time complexity of each algorithm.Finally,numerical experiments are used to analyze the effect of dynamic programming algorithms in practical operations.Comparative experiments show that these dynamic programming algorithms have comprehensive advantages over the branch and bound algorithm(a classical exact algorithm)and the discrete harmony search algorithm(a high-performance heuristic algorithm).展开更多
During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive...During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.展开更多
Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta...Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.展开更多
Aiming at the hybrid flow-shop （HFS） scheduling that is a complex NP-hard combinatorial problem with wide engineering background, an effective algorithm based on differential evolution （DE） is proposed. By using a...Aiming at the hybrid flow-shop （HFS） scheduling that is a complex NP-hard combinatorial problem with wide engineering background, an effective algorithm based on differential evolution （DE） is proposed. By using a special encoding scheme and combining DE based evolutionary search and local search, the exploration and exploitation abilities are enhanced and well balanced for solving the HFS problems. Simulation results based on some typical problems and comparisons with some existing genetic algorithms demonstrate the proposed algorithm is effective, efficient and robust for solving the HFS problems.展开更多
This paper considers a hybrid two-stage flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage. The processing time of job Jj on any of m identical parall...This paper considers a hybrid two-stage flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage. The processing time of job Jj on any of m identical parallel machines is aj≡a （j∈N）, and the processing time of job Jj is bj（j∈N） on a batch processorM. We take makespan （Cmax） as our minimization objective. In this paper, for the problem of FSMP-BI （m identical parallel machines on the first stage and a batch processor on the second stage）, based on the algorithm given by Sung and Choung for the problem of 1 ｜ri, BI｜Cmax under the constraint of the given processing sequence, we develop an optimal dynamic programming Algorithm H1 for it in max {O（nlogn）, O（nB）} time. A max {O（nlogn） , O（nB）}time symmetric Algorithm H2 is given then for the problem of BI-FSMP （a batch processor on the first stage and m identical parallel machines on the second stage）.展开更多
A new bottleneck-based heuristic for large-scale flow-shop scheduling problems with a bottleneck is proposed,which is simpler but more tailored than the shifting bottleneck(SB)procedure.In this algorithm,a schedule fo...A new bottleneck-based heuristic for large-scale flow-shop scheduling problems with a bottleneck is proposed,which is simpler but more tailored than the shifting bottleneck(SB)procedure.In this algorithm,a schedule for the bottleneck machine is first constructed optimally and then the non-bottleneck machines are scheduled around the bottleneck schedule by some effective dispatching rules.Computational results show that the modified bottleneck-based procedure can achieve a tradeoff between solution quality and computational time comparing with SB procedure for medium-size problems.Furthermore it can obtain a good solution in quite short time for large-scale scheduling problems.展开更多
Background:Parenting exerts a profound influence on children’s mental health and behavioral development.Despite the high prevalence of children’s emotional and behavioral problems(CEBP)in China,evidence-based parent...Background:Parenting exerts a profound influence on children’s mental health and behavioral development.Despite the high prevalence of children’s emotional and behavioral problems(CEBP)in China,evidence-based parenting interventions remain scarcely investigated as preventive public health strategies.This pilot study evaluated a school-based intervention for preventing CEBP.Methods:We employed a quasi-experimental design with propensity score matching(PSM)to select 28 families(intervention:n=13;control:n=15)from two matched urban primary schools.Quantitative data from seven validated scales were analyzed using t-tests and ANCOVA.Qualitative insights were derived from 10 semi-structured interviews via thematic analysis.Results:Compared to the control group,the intervention group demonstrated significantly greater improvements in CEBP(p=0.020,Cohen’s d=0.92),parental adjustment(p=0.031,Cohen’s d=0.80),parenting confidence(p=0.003,Cohen’s d=1.04),and parentchild relationships(p=0.001,Cohen’s d=1.46).Non-significant effects were observed for parenting style,parental relationship,and parenting conflict(p>0.05).Qualitative analysis corroborated these findings and further identified contributing factors for non-significant outcomes,including challengeswithmeasurement adaptability and inconsistent co-parenting practices.Conclusions:This pilot study suggests that an authoritative parenting style may be effective and culturally adaptable in China.Positive parenting interventions appear to mitigate CEBP by reducing risk factors and enhancing protective factors.However,improving parental relationships and parenting conflict may require targeted strategies.Given the pilot nature of this PSM-matched study(n=28),the findings should be interpreted as exploratory and used primarily for intervention refinement.展开更多
Let Pr denote an almost-prime with at most r prime factors,counted according to multiplicity.In this paper,it is proved that,for every sufficiently large even integer N,the equation N=x^(2)+p_(2)^(2)+p_(3)^(3)+p_(4)^(...Let Pr denote an almost-prime with at most r prime factors,counted according to multiplicity.In this paper,it is proved that,for every sufficiently large even integer N,the equation N=x^(2)+p_(2)^(2)+p_(3)^(3)+p_(4)^(3)+p_(5)^(5)+_6^(5)is solvable with being an almost-prime P_(6) and the other variables primes.This result constitutes an enhancement upon the previous result of Hooley[Recent Progress in Analytic Number Theory,Vol.1(Durham,1979),London:Academic Press,1981,127-191].展开更多
Let d(n;r_(1),q_(1),r_(2),q_(2))be the number of factorization n=n_(1)n_(2)satisfying n_i≡r_i(mod q_i)(i=1,2)andΔ(x;r_(1),q_(1),r_(2),q_(2))be the error term of the summatory function of d(n;r_(1),q_(1),r_(2),q_(2))...Let d(n;r_(1),q_(1),r_(2),q_(2))be the number of factorization n=n_(1)n_(2)satisfying n_i≡r_i(mod q_i)(i=1,2)andΔ(x;r_(1),q_(1),r_(2),q_(2))be the error term of the summatory function of d(n;r_(1),q_(1),r_(2),q_(2)).Suppose x≥(q_(1)q_(2))^(1+ε),1≤r_i≤q_i,and(r_i,q_i)=1(i=1,2).This paper studies the power moments and sign changes ofΔ(x;r_(1),q_(1),r_(2),q_(2)).We prove that for sufficiently large constant C,Δ(q_(1)q_(2)x:r_(1),q_(1),r_(2),q_(2))changes sign in the interval[T,T+C√T]for any large T.Meanwhile,we show that for small constants c and c,there exist infinitely many subintervals of length c√log^(-7)T in[T,2T]where±Δ(q_(1)q_(2)x:r_(1),q_(1),r_(2),q_(2))>cx^(1/4)always holds.展开更多
Automatically answer math word problems is a challenging task in artificial intelligence.Previous solvers constructed mathematical expressions in sequence or binary tree.However,these approaches may suffer from the fo...Automatically answer math word problems is a challenging task in artificial intelligence.Previous solvers constructed mathematical expressions in sequence or binary tree.However,these approaches may suffer from the following issues:Models relying on such structures exhibit fixed-order reasoning(e.g.,left-to-right),limiting flexibility and increasing error susceptibility;prior models rely on autoregressive reasoning in a single pass,accumulating minor errors(e.g.,incorrect math symbols)during generation,resulting in reduced accuracy.To address the above issues,we emulate the human“check and modify”process in reasoning and propose a unified M-tree self-correction solver(UTSCSolver)by iterative inference with self-correction mechanism.First,we use an iterative,non-autoregressive process for generating mathematical expressions,free from fixed generation orders to handle complex and diverse problems.Additionally,we design a self-correction mechanism based on alternating execution between a generator and a discriminator.This module iteratively detects and rectifies errors in generated expressions,leveraging previous iteration information for subsequent generation guidance.Experimental results show that our UTSC-Solver outperforms traditional models in accuracy on two popular datasets,while it improves the interpretability of mathematical reasoning.展开更多
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 statu...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.展开更多
This case study explores the efficacy of school-based intervention to address psychosocial challenges faced by an 11-year-old adolescent. The case study aimed to decrease the agression and acting out behavior as resul...This case study explores the efficacy of school-based intervention to address psychosocial challenges faced by an 11-year-old adolescent. The case study aimed to decrease the agression and acting out behavior as result of being victimized at school by the peers. The aim was to assess and manage the child’s aggressive behavior and academic underperformance which played a significant role in the child’s low self-esteem and emotional regulation. A comprehensive assessment was conducted to rule out the difficulties and a multi-faceted intervention strategy was utilized including anger management and structured activity scheduling that helped that child to improve his academic performance as well as to learn to manage his emotional expression. Throughout 16 sessions, the intervention targeted key behavioural indicators such as emotional expression, and aggression;post-assessment results demonstrated a 22% improvement in the child’s behavioral and academic challenges. The findings suggest that a multi-faceted therapeutic approach can be effective in addressing complex issues of aggression and academic underperformance in children, highlighting the importance of integrated psychological and educational interventions.展开更多
Constraint satisfaction problems(CSPs)are a class of problems that are ubiquitous in science and engineering.They feature a collection of constraints specified over subsets of variables.A CSP can be solved either dire...Constraint satisfaction problems(CSPs)are a class of problems that are ubiquitous in science and engineering.They feature a collection of constraints specified over subsets of variables.A CSP can be solved either directly or by reducing it to other problems.This paper introduces the Julia ecosystem for solving and analyzing CSPs with a focus on the programming practices.We introduce some important CSPs and show how these problems are reduced to each other.We also show how to transform CSPs into tensor networks,how to optimize the tensor network contraction orders,and how to extract the solution space properties by contracting the tensor networks with generic element types.Examples are given,which include computing the entropy constant,analyzing the overlap gap property,and the reduction between CSPs.展开更多
This paper focuses on the direct and inverse problems for a third-order self-adjoint differential operator with non-local potential and anti-periodic boundary conditions.Firstly,we obtain the expressions for the chara...This paper focuses on the direct and inverse problems for a third-order self-adjoint differential operator with non-local potential and anti-periodic boundary conditions.Firstly,we obtain the expressions for the characteristic function and resolvent of this third-order differential operator.Secondly,by using the expression for the resolvent of the operator,we prove that the spectrum for this operator consists of simple eigenvalues and a finite number of eigenvalues with multiplicity 2.Finally,we solve the inverse problem for this operator,which states that the non-local potential function can be reconstructed from four spectra.Specially,we prove the Ambarzumyan theorem and indicate that odd or even potential functions can be reconstructed by three spectra.展开更多
In this paper,we use the Riemann-Hilbert(RH)method to investigate the Cauchy problem of the reverse space-time nonlocal Hirota equation with step-like initial data:q(z,0)=o(1)as z→-∞and q(z,0)=δ+o(1)as z→∞,where...In this paper,we use the Riemann-Hilbert(RH)method to investigate the Cauchy problem of the reverse space-time nonlocal Hirota equation with step-like initial data:q(z,0)=o(1)as z→-∞and q(z,0)=δ+o(1)as z→∞,whereδis an arbitrary positive constant.We show that the solution of the Cauchy problem can be determined by the solution of the corresponding matrix RH problem established on the plane of complex spectral parameterλ.As an example,we construct an exact solution of the reverse space-time nonlocal Hirota equation in a special case via this RH problem.展开更多
As one of the world's three major food crops and an important economic and oil crop,soybean plays a crucial role in ensuring food safety.In recent years,there are many problems in soybean cultivation,production an...As one of the world's three major food crops and an important economic and oil crop,soybean plays a crucial role in ensuring food safety.In recent years,there are many problems in soybean cultivation,production and processing.In view of this situation,this paper comprehensively expounded and decomposed the cultivation situation,existing problems,specific countermeasures and conclusions,so as to re-recognize them.This study provides reference materials for the sustainable and healthy development of the soybean industry.展开更多
1.The price of a desk is 10 times the price of a chair.The desk costs 288 yuan more than the chair.How much does one desk and one chair cost?2.A and B start from two different places and walk toward each other.After 4...1.The price of a desk is 10 times the price of a chair.The desk costs 288 yuan more than the chair.How much does one desk and one chair cost?2.A and B start from two different places and walk toward each other.After 4 hours,they meet at a point that is 4 kilometres away from the midpoint between their starting points.A walks faster than B.How many more kilometres per hour does A walk than B?展开更多
A family of neural networks is proposed to solve linear complementarity problems(LCP).The neural networks are constructed from the novel equivalent model of LCP,which is reformulated by utilizing the modulus and smoot...A family of neural networks is proposed to solve linear complementarity problems(LCP).The neural networks are constructed from the novel equivalent model of LCP,which is reformulated by utilizing the modulus and smoothing technologies.Some important properties of the proposed novel equivalent model are summarized.In addition,the stability properties of the proposed steepest descent-based neural networks for LCP are analyzed.In order to illustrate the theoretical results,we provide some numerical simulations and compare the proposed neural networks with existing neural networks based on the NCP-functions.Numerical results indicate that the performance of the proposed neural networks is effective and robust.展开更多
The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex b...The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex body.The Orlicz Minkowski problem for loga-rithmic capacity includes the Minkowski problem for logarithmic capacity and the Lp Minkowski problem for logarithmic capacity as special cases.The discrete case has been solved by the researchers.In this paper,we solve the Orlicz Minkowski problem for logarithmic capacity with respect to general Borel measures by applying an approximation scheme.展开更多
基金Supported by National Natural Science Foundation of P. R. China (60274013)
文摘There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on the analysis of FSPT and under the support of TOC (theory of constraint). A flow shop is at first decomposed into two subsystems named PULL and PUSH by means of bottleneck. Then the subsystem is decomposed into single machine scheduling problems,so the original NP-HARD problem can be transferred into a serial of single machine optimization problems finally. This method reduces the computational complexity, and has been used in a real project successfully.
基金This work was partially supported by the Zhejiang Provincial Philosophy and Social Science Program of China(Grant No.19NDJC093YB)the National Social Science Foundation of China(Grant No.19BGL001)+1 种基金the Natural Science Foundation of Zhejiang Province of China(Grant No.LY19A010002)the Natural Science Foundation of Ningbo of China(The design of algorithms and cost-sharing rules for scheduling problems in shared manufacturing,Acceptance No.20211JCGY010241).
文摘In the“shared manufacturing”environment,based on fairness,shared manufacturing platforms often require manufacturing service enterprises to arrange production according to the principle of“order first,finish first”which leads to a series of scheduling problems with fixed processing sequences.In this paper,two two-machine hybrid flow-shop problems with fixed processing sequences are studied.Each job has two tasks.The first task is flexible,which can be processed on either of the two machines,and the second task must be processed on the second machine after the first task is completed.We consider two objective functions:to minimize the makespan and tominimize the total weighted completion time.First,we show the problem for any one of the two objectives is ordinary NP-hard by polynomial-time Turing Reduction.Then,using the Continuous ProcessingModule(CPM),we design a dynamic programming algorithm for each case and calculate the time complexity of each algorithm.Finally,numerical experiments are used to analyze the effect of dynamic programming algorithms in practical operations.Comparative experiments show that these dynamic programming algorithms have comprehensive advantages over the branch and bound algorithm(a classical exact algorithm)and the discrete harmony search algorithm(a high-performance heuristic algorithm).
基金supported by the National Natural Sci‐ence Foundation of China(Grant No.62306325)。
文摘During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.
基金funded by National Natural Science Foundation of China(Nos.12402142,11832013 and 11572134)Natural Science Foundation of Hubei Province(No.2024AFB235)+1 种基金Hubei Provincial Department of Education Science and Technology Research Project(No.Q20221714)the Opening Foundation of Hubei Key Laboratory of Digital Textile Equipment(Nos.DTL2023019 and DTL2022012).
文摘Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.
基金supported by the National Natural Science Fundation of China (60774082 70871065+2 种基金 60834004)the Program for New Century Excellent Talents in University (NCET-10-0505)the Doctoral Program Foundation of Institutions of Higher Education of China(20100002110014)
文摘Aiming at the hybrid flow-shop （HFS） scheduling that is a complex NP-hard combinatorial problem with wide engineering background, an effective algorithm based on differential evolution （DE） is proposed. By using a special encoding scheme and combining DE based evolutionary search and local search, the exploration and exploitation abilities are enhanced and well balanced for solving the HFS problems. Simulation results based on some typical problems and comparisons with some existing genetic algorithms demonstrate the proposed algorithm is effective, efficient and robust for solving the HFS problems.
基金Sponsored by the Innovation Foundation of Shanghai University(Grant No.A.10-0101-07 -406)NNSF of China(Grant No.60874039)
文摘This paper considers a hybrid two-stage flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage. The processing time of job Jj on any of m identical parallel machines is aj≡a （j∈N）, and the processing time of job Jj is bj（j∈N） on a batch processorM. We take makespan （Cmax） as our minimization objective. In this paper, for the problem of FSMP-BI （m identical parallel machines on the first stage and a batch processor on the second stage）, based on the algorithm given by Sung and Choung for the problem of 1 ｜ri, BI｜Cmax under the constraint of the given processing sequence, we develop an optimal dynamic programming Algorithm H1 for it in max {O（nlogn）, O（nB）} time. A max {O（nlogn） , O（nB）}time symmetric Algorithm H2 is given then for the problem of BI-FSMP （a batch processor on the first stage and m identical parallel machines on the second stage）.
基金This project is supported by National Natural Science Foundation of China(No.60274013,No.60474002)Shanghai City Development Found for Science and Technology,China(No.04DZ11008)
文摘A new bottleneck-based heuristic for large-scale flow-shop scheduling problems with a bottleneck is proposed,which is simpler but more tailored than the shifting bottleneck(SB)procedure.In this algorithm,a schedule for the bottleneck machine is first constructed optimally and then the non-bottleneck machines are scheduled around the bottleneck schedule by some effective dispatching rules.Computational results show that the modified bottleneck-based procedure can achieve a tradeoff between solution quality and computational time comparing with SB procedure for medium-size problems.Furthermore it can obtain a good solution in quite short time for large-scale scheduling problems.
基金supported by the National Social Science Fund of China[18BSH146].
文摘Background:Parenting exerts a profound influence on children’s mental health and behavioral development.Despite the high prevalence of children’s emotional and behavioral problems(CEBP)in China,evidence-based parenting interventions remain scarcely investigated as preventive public health strategies.This pilot study evaluated a school-based intervention for preventing CEBP.Methods:We employed a quasi-experimental design with propensity score matching(PSM)to select 28 families(intervention:n=13;control:n=15)from two matched urban primary schools.Quantitative data from seven validated scales were analyzed using t-tests and ANCOVA.Qualitative insights were derived from 10 semi-structured interviews via thematic analysis.Results:Compared to the control group,the intervention group demonstrated significantly greater improvements in CEBP(p=0.020,Cohen’s d=0.92),parental adjustment(p=0.031,Cohen’s d=0.80),parenting confidence(p=0.003,Cohen’s d=1.04),and parentchild relationships(p=0.001,Cohen’s d=1.46).Non-significant effects were observed for parenting style,parental relationship,and parenting conflict(p>0.05).Qualitative analysis corroborated these findings and further identified contributing factors for non-significant outcomes,including challengeswithmeasurement adaptability and inconsistent co-parenting practices.Conclusions:This pilot study suggests that an authoritative parenting style may be effective and culturally adaptable in China.Positive parenting interventions appear to mitigate CEBP by reducing risk factors and enhancing protective factors.However,improving parental relationships and parenting conflict may require targeted strategies.Given the pilot nature of this PSM-matched study(n=28),the findings should be interpreted as exploratory and used primarily for intervention refinement.
基金Supported by NSFC (Nos.12471009,12301006,12001047,11901566)Beijing Natural Science Foundation (No.1242003)National Training Program of Innovation and Entrepreneurship for Undergraduates(No.202307011)。
文摘Let Pr denote an almost-prime with at most r prime factors,counted according to multiplicity.In this paper,it is proved that,for every sufficiently large even integer N,the equation N=x^(2)+p_(2)^(2)+p_(3)^(3)+p_(4)^(3)+p_(5)^(5)+_6^(5)is solvable with being an almost-prime P_(6) and the other variables primes.This result constitutes an enhancement upon the previous result of Hooley[Recent Progress in Analytic Number Theory,Vol.1(Durham,1979),London:Academic Press,1981,127-191].
基金supported by the Talent Fund of Beijing Jiaotong University(No.2020RC012)NSFC(No.11871295),supported by NSFC(No.11971476),supported by NSFC(No.12071421)。
文摘Let d(n;r_(1),q_(1),r_(2),q_(2))be the number of factorization n=n_(1)n_(2)satisfying n_i≡r_i(mod q_i)(i=1,2)andΔ(x;r_(1),q_(1),r_(2),q_(2))be the error term of the summatory function of d(n;r_(1),q_(1),r_(2),q_(2)).Suppose x≥(q_(1)q_(2))^(1+ε),1≤r_i≤q_i,and(r_i,q_i)=1(i=1,2).This paper studies the power moments and sign changes ofΔ(x;r_(1),q_(1),r_(2),q_(2)).We prove that for sufficiently large constant C,Δ(q_(1)q_(2)x:r_(1),q_(1),r_(2),q_(2))changes sign in the interval[T,T+C√T]for any large T.Meanwhile,we show that for small constants c and c,there exist infinitely many subintervals of length c√log^(-7)T in[T,2T]where±Δ(q_(1)q_(2)x:r_(1),q_(1),r_(2),q_(2))>cx^(1/4)always holds.
基金supported by the National Natural Science Foundation of China(62106244)the Fundamental Research Funds for the Central Universities(WK2150110021)the University Synergy Innovation Program of Anhui Province(GXXT-2022-042).
文摘Automatically answer math word problems is a challenging task in artificial intelligence.Previous solvers constructed mathematical expressions in sequence or binary tree.However,these approaches may suffer from the following issues:Models relying on such structures exhibit fixed-order reasoning(e.g.,left-to-right),limiting flexibility and increasing error susceptibility;prior models rely on autoregressive reasoning in a single pass,accumulating minor errors(e.g.,incorrect math symbols)during generation,resulting in reduced accuracy.To address the above issues,we emulate the human“check and modify”process in reasoning and propose a unified M-tree self-correction solver(UTSCSolver)by iterative inference with self-correction mechanism.First,we use an iterative,non-autoregressive process for generating mathematical expressions,free from fixed generation orders to handle complex and diverse problems.Additionally,we design a self-correction mechanism based on alternating execution between a generator and a discriminator.This module iteratively detects and rectifies errors in generated expressions,leveraging previous iteration information for subsequent generation guidance.Experimental results show that our UTSC-Solver outperforms traditional models in accuracy on two popular datasets,while it improves the interpretability of mathematical reasoning.
基金Supported by the Shijiazhuang Science and Technology Research and Development Program,No.221460383.
文摘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.
文摘This case study explores the efficacy of school-based intervention to address psychosocial challenges faced by an 11-year-old adolescent. The case study aimed to decrease the agression and acting out behavior as result of being victimized at school by the peers. The aim was to assess and manage the child’s aggressive behavior and academic underperformance which played a significant role in the child’s low self-esteem and emotional regulation. A comprehensive assessment was conducted to rule out the difficulties and a multi-faceted intervention strategy was utilized including anger management and structured activity scheduling that helped that child to improve his academic performance as well as to learn to manage his emotional expression. Throughout 16 sessions, the intervention targeted key behavioural indicators such as emotional expression, and aggression;post-assessment results demonstrated a 22% improvement in the child’s behavioral and academic challenges. The findings suggest that a multi-faceted therapeutic approach can be effective in addressing complex issues of aggression and academic underperformance in children, highlighting the importance of integrated psychological and educational interventions.
基金funded by the National Key R&D Program of China(Grant No.2024YFE0102500)the National Natural Science Foundation of China(Grant No.12404568)+1 种基金the Guangzhou Municipal Science and Technology Project(Grant No.2023A03J00904)the Quantum Science Center of Guangdong-Hong Kong-Macao Greater Bay Area,China and the Undergraduate Research Project from HKUST(Guangzhou).
文摘Constraint satisfaction problems(CSPs)are a class of problems that are ubiquitous in science and engineering.They feature a collection of constraints specified over subsets of variables.A CSP can be solved either directly or by reducing it to other problems.This paper introduces the Julia ecosystem for solving and analyzing CSPs with a focus on the programming practices.We introduce some important CSPs and show how these problems are reduced to each other.We also show how to transform CSPs into tensor networks,how to optimize the tensor network contraction orders,and how to extract the solution space properties by contracting the tensor networks with generic element types.Examples are given,which include computing the entropy constant,analyzing the overlap gap property,and the reduction between CSPs.
基金supported by the Tianjin Municipal Science and Technology Program of China(No.23JCZDJC00070)。
文摘This paper focuses on the direct and inverse problems for a third-order self-adjoint differential operator with non-local potential and anti-periodic boundary conditions.Firstly,we obtain the expressions for the characteristic function and resolvent of this third-order differential operator.Secondly,by using the expression for the resolvent of the operator,we prove that the spectrum for this operator consists of simple eigenvalues and a finite number of eigenvalues with multiplicity 2.Finally,we solve the inverse problem for this operator,which states that the non-local potential function can be reconstructed from four spectra.Specially,we prove the Ambarzumyan theorem and indicate that odd or even potential functions can be reconstructed by three spectra.
基金supported by the National Natural Science Foundation of China under Grant No.12147115the Discipline(Subject)Leader Cultivation Project of Universities in Anhui Province under Grant Nos.DTR2023052 and DTR2024046+2 种基金the Natural Science Research Project of Universities in Anhui Province under Grant No.2024AH040202the Young Top Notch Talents and Young Scholars of High End Talent Introduction and Cultivation Action Project in Anhui Provincethe Scientific Research Foundation Funded Project of Chuzhou University under Grant Nos.2022qd022 and 2022qd038。
文摘In this paper,we use the Riemann-Hilbert(RH)method to investigate the Cauchy problem of the reverse space-time nonlocal Hirota equation with step-like initial data:q(z,0)=o(1)as z→-∞and q(z,0)=δ+o(1)as z→∞,whereδis an arbitrary positive constant.We show that the solution of the Cauchy problem can be determined by the solution of the corresponding matrix RH problem established on the plane of complex spectral parameterλ.As an example,we construct an exact solution of the reverse space-time nonlocal Hirota equation in a special case via this RH problem.
基金Supported by Special Fund for National Modern Agricultural Industry Technology System Construction(CARS-04-CES16).
文摘As one of the world's three major food crops and an important economic and oil crop,soybean plays a crucial role in ensuring food safety.In recent years,there are many problems in soybean cultivation,production and processing.In view of this situation,this paper comprehensively expounded and decomposed the cultivation situation,existing problems,specific countermeasures and conclusions,so as to re-recognize them.This study provides reference materials for the sustainable and healthy development of the soybean industry.
文摘1.The price of a desk is 10 times the price of a chair.The desk costs 288 yuan more than the chair.How much does one desk and one chair cost?2.A and B start from two different places and walk toward each other.After 4 hours,they meet at a point that is 4 kilometres away from the midpoint between their starting points.A walks faster than B.How many more kilometres per hour does A walk than B?
基金Supported by the National Natural Science Foundation of China(12371378,41725017,11901098).
文摘A family of neural networks is proposed to solve linear complementarity problems(LCP).The neural networks are constructed from the novel equivalent model of LCP,which is reformulated by utilizing the modulus and smoothing technologies.Some important properties of the proposed novel equivalent model are summarized.In addition,the stability properties of the proposed steepest descent-based neural networks for LCP are analyzed.In order to illustrate the theoretical results,we provide some numerical simulations and compare the proposed neural networks with existing neural networks based on the NCP-functions.Numerical results indicate that the performance of the proposed neural networks is effective and robust.
基金Supported by Postgraduate Scientific Research Innovation Project of Hunan Province(CX20231033)Science and Technology Research Project of Jiangxi Provincial Education Department(GJJ210815)+2 种基金Jiangxi Provincial Natural Science Foundation(20232BAB201005)the National Natural Science Founda-tion of China(12461010,12161043)the Scientific Research Fund of Hunan Provincial Education Department(24A0338)。
文摘The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex body.The Orlicz Minkowski problem for loga-rithmic capacity includes the Minkowski problem for logarithmic capacity and the Lp Minkowski problem for logarithmic capacity as special cases.The discrete case has been solved by the researchers.In this paper,we solve the Orlicz Minkowski problem for logarithmic capacity with respect to general Borel measures by applying an approximation scheme.
