A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespa...A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespan and an LPT-LS algorithm is proposed.Non-resumable jobs are first scheduled in a machine by the longest processing time（LPT） rule,and then resumable jobs are scheduled by the list scheduling（LS） rule.And the worst-case ratios of this algorithm in three different cases in terms of the value of the total processing time of the resumable jobs（denoted as S2） are discussed.When S2 is longer than the spare time of the machine after the non-resumable jobs are assigned by the LPT rule,it is equal to 1.When S2 falls in between the spare time of the machine by the LPT rule and the optimal schedule rule,it is less than 2.When S2 is less than the spare time of the machine by the optimal schedule rule,it is less than 2.Finally,numerical examples are presented for verification.展开更多
In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimizat...In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.展开更多
In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the...In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the length of the longest path from start node to arbitrary node and from arbitrary node to end node is proposed. In view of a scheduling problem of two activities with float in the CPM scheduling, we put forward Barycenter Theory and prove this theory based on the algorithm of the length of the longest path. By this theory, we know which activity should be done firstly. At last, we show our theory by an example.展开更多
Motivated by industrial applications we study a single-machine scheduling problem in which all the jobs are mutu-ally independent and available at time zero.The machine processes the jobs sequentially and it is not id...Motivated by industrial applications we study a single-machine scheduling problem in which all the jobs are mutu-ally independent and available at time zero.The machine processes the jobs sequentially and it is not idle if there is any job to be pro-cessed.The operation of each job cannot be interrupted.The machine cannot process more than one job at a time.A setup time is needed if the machine switches from one type of job to another.The objective is to find an optimal schedule with the minimal total jobs’completion time.While the sum of jobs’processing time is always a constant,the objective is to minimize the sum of setup times.Ant colony optimization(ACO)is a meta-heuristic that has recently been applied to scheduling problem.In this paper we propose an improved ACO-Branching Ant Colony with Dynamic Perturbation(DPBAC)algorithm for the single-machine schedul-ing problem.DPBAC improves traditional ACO in following aspects:introducing Branching Method to choose starting points;im-proving state transition rules;introducing Mutation Method to shorten tours;improving pheromone updating rules and introduc-ing Conditional Dynamic Perturbation Strategy.Computational results show that DPBAC algorithm is superior to the traditional ACO algorithm.展开更多
BACKGROUND Arabic-speaking patients are underrepresented in orthopedic clinical studies,particularly in foot and ankle trauma research.The lack of validated Arabic language tools hinders their inclusion,creating a nee...BACKGROUND Arabic-speaking patients are underrepresented in orthopedic clinical studies,particularly in foot and ankle trauma research.The lack of validated Arabic language tools hinders their inclusion,creating a need for culturally and linguistically adapted instruments.The American Academy of Orthopedic Surgeons Foot and Ankle Outcomes Questionnaire(AAOS-FAOQ)is a widely used tool but has not been adapted for Arabic-speaking patients.AIM To translate,cross-culturally adapt,and validate the AAOS-FAOQ for Arabicspeaking patients with traumatic foot and ankle injuries.METHODS The cross-cultural adaptation followed established guidelines,involving forward and backward translations,expert review,and pre-testing.The final Arabic version was administered alongside the Arabic Short-Form 36(SF-36)to 100 patients for validity testing.Reliability was assessed through test-retest methods with 20 patients completing the questionnaire twice within 48 hours.Pearson correlation coefficients measured convergent and divergent validity with SF-36 subscales,while Cronbach's alpha and intraclass correlation coefficients(ICC)determined internal consistency and reliability.RESULTS Out of 100 patients,92 completed the first set of questionnaires.The Arabic AAOS-FAOQ showed strong correlations with the SF-36 subscales,particularly in physical function and bodily pain(r>0.6).Test-retest reliability was robust,with ICCs of 0.69 and 0.66 for the Global Foot and Ankle Scale and Shoe Comfort Scale,respectively.Cronbach's alpha for internal consistency ranged from 0.7 to 0.9.CONCLUSION The Arabic version of the AAOS-FAOQ demonstrated validity and reliability for use in Arabic-speaking patients with traumatic foot and ankle injuries.This adaptation will enhance the inclusion of this population in orthopedic clinical studies,improving the generalizability of research findings and patient care.展开更多
With the rapid adoption of artificial intelligence(AI)in domains such as power,transportation,and finance,the number of machine learning and deep learning models has grown exponentially.However,challenges such as dela...With the rapid adoption of artificial intelligence(AI)in domains such as power,transportation,and finance,the number of machine learning and deep learning models has grown exponentially.However,challenges such as delayed retraining,inconsistent version management,insufficient drift monitoring,and limited data security still hinder efficient and reliable model operations.To address these issues,this paper proposes the Intelligent Model Lifecycle Management Algorithm(IMLMA).The algorithm employs a dual-trigger mechanism based on both data volume thresholds and time intervals to automate retraining,and applies Bayesian optimization for adaptive hyperparameter tuning to improve performance.A multi-metric replacement strategy,incorporating MSE,MAE,and R2,ensures that new models replace existing ones only when performance improvements are guaranteed.A versioning and traceability database supports comparison and visualization,while real-time monitoring with stability analysis enables early warnings of latency and drift.Finally,hash-based integrity checks secure both model files and datasets.Experimental validation in a power metering operation scenario demonstrates that IMLMA reduces model update delays,enhances predictive accuracy and stability,and maintains low latency under high concurrency.This work provides a practical,reusable,and scalable solution for intelligent model lifecycle management,with broad applicability to complex systems such as smart grids.展开更多
Colorectal cancer(CRC)is the most frequently diagnosed malignancy of the digestive system and the second leading cause of cancer-related deaths worldwide(1).In China,CRC ranks as the second most common cancer with inc...Colorectal cancer(CRC)is the most frequently diagnosed malignancy of the digestive system and the second leading cause of cancer-related deaths worldwide(1).In China,CRC ranks as the second most common cancer with incidence and mortality rates continuing to rise(2).The Chinese Society of Clinical Oncology(CSCO)first introduced its guidelines in 2017,and since then,they have been updated annually to incorporate the latest clinical research findings,drug availability,and expert consensus(3-8).This article presents the key updates in the 2025 edition compared to the 2024 version.展开更多
目的修订中文版心理健康素养量表(Mental Health Literacy Scale,MHLS),并验证其信度与效度,以构建适用于中国人群心理健康素养的测量工具。方法采用便利抽样法,于2019年10月至2020年4月通过问卷星平台收集341名社区居民的有效数据。测...目的修订中文版心理健康素养量表(Mental Health Literacy Scale,MHLS),并验证其信度与效度,以构建适用于中国人群心理健康素养的测量工具。方法采用便利抽样法,于2019年10月至2020年4月通过问卷星平台收集341名社区居民的有效数据。测量工具包括中文版MHLS、简易应对方式问卷(Simplified Coping Style Questionnaire,SCSQ)、亚临床抑郁自助策略量表(Self Help Strategies for Subclinical Depression,SHS)、求助问卷(Help Seeking Questionnaire,HSQ),患者健康问卷抑郁量表-9项(Patient Health Questionnaire-9,PHQ-9)及广泛性焦虑自评量表-7项(Generalized Anxiety Disorder Scale-7,GAD-7)。采用探索性因子分析(exploratory factor analysis,EFA)和验证性因子分析(confirmatory factor analysis,CFA)检验量表信效度,通过Cronbach’sα和重测信度评估内部一致性及稳定性,从结构效度、聚合效度、区分效度和效标关联效度多维度验证测量学属性。结果EFA结果显示,中文版MHLS共提取5个公共因子,分别为疾病知识、信息寻求、对疾病的态度、对求助的态度以及污名化,累计解释率为43.297%。CFA表明,5因子模型拟合良好(χ^(2)/df=1.754),比较适配指数(comparative fit index,CFI)为0.903,增量适配指数(incremental fit index,IFI)为0.905,适配优度指数(goodness of fit index,GFI)为0.884,残差均方和平方根(root mean square error of pproximation,RMSEA)为0.047,残差均方根(root mean square residual,RMR)为0.053。总量表及各分量表的Cronbachα系数为0.701~0.877;重测信度为0.617~0.882(P<0.01)。MHLS总分与SCSQ中积极应对因子得分(r=0.213,P<0.01)、求助问卷得分(r=0.248,P<0.01)及抑郁自助策略得分(r=0.302,P<0.01)均呈显著正相关,表明该量表具有良好的准则相关效度。组间差异结果显示男性、低学历及未接受过心理健康知识培训群体的心理健康素养水平显著低于其他人群。结论中文版MHLS显示出良好的信度与效度,可作为评估个体心理健康素养的科学测量工具,有助于深入了解公众对心理健康的认知水平。同时建议多渠道科普提升男性、低学历人群的心理健康认知水平。展开更多
基金The National Natural Science Foundation of China (No.70971022,71271054)the Scientific Research Innovation Project for College Graduates in Jiangsu Province(No.CXLX_0157)the Scientific Research Foundation of the Education Department of Anhui Province(No.2011sk123)
文摘A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespan and an LPT-LS algorithm is proposed.Non-resumable jobs are first scheduled in a machine by the longest processing time（LPT） rule,and then resumable jobs are scheduled by the list scheduling（LS） rule.And the worst-case ratios of this algorithm in three different cases in terms of the value of the total processing time of the resumable jobs（denoted as S2） are discussed.When S2 is longer than the spare time of the machine after the non-resumable jobs are assigned by the LPT rule,it is equal to 1.When S2 falls in between the spare time of the machine by the LPT rule and the optimal schedule rule,it is less than 2.When S2 is less than the spare time of the machine by the optimal schedule rule,it is less than 2.Finally,numerical examples are presented for verification.
文摘In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.
基金Sponsored by the National Natural Science Foundation of China(Grant No.70671040)and Specialized Research Fund for the Doctoral Program of High Education(Grant No.20050079008).
文摘In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the length of the longest path from start node to arbitrary node and from arbitrary node to end node is proposed. In view of a scheduling problem of two activities with float in the CPM scheduling, we put forward Barycenter Theory and prove this theory based on the algorithm of the length of the longest path. By this theory, we know which activity should be done firstly. At last, we show our theory by an example.
基金supported by National Natural Science Foundation of CHINA(No.70540024)Re-search Foundation of Ministry of Education of China(No.104107).
文摘Motivated by industrial applications we study a single-machine scheduling problem in which all the jobs are mutu-ally independent and available at time zero.The machine processes the jobs sequentially and it is not idle if there is any job to be pro-cessed.The operation of each job cannot be interrupted.The machine cannot process more than one job at a time.A setup time is needed if the machine switches from one type of job to another.The objective is to find an optimal schedule with the minimal total jobs’completion time.While the sum of jobs’processing time is always a constant,the objective is to minimize the sum of setup times.Ant colony optimization(ACO)is a meta-heuristic that has recently been applied to scheduling problem.In this paper we propose an improved ACO-Branching Ant Colony with Dynamic Perturbation(DPBAC)algorithm for the single-machine schedul-ing problem.DPBAC improves traditional ACO in following aspects:introducing Branching Method to choose starting points;im-proving state transition rules;introducing Mutation Method to shorten tours;improving pheromone updating rules and introduc-ing Conditional Dynamic Perturbation Strategy.Computational results show that DPBAC algorithm is superior to the traditional ACO algorithm.
文摘BACKGROUND Arabic-speaking patients are underrepresented in orthopedic clinical studies,particularly in foot and ankle trauma research.The lack of validated Arabic language tools hinders their inclusion,creating a need for culturally and linguistically adapted instruments.The American Academy of Orthopedic Surgeons Foot and Ankle Outcomes Questionnaire(AAOS-FAOQ)is a widely used tool but has not been adapted for Arabic-speaking patients.AIM To translate,cross-culturally adapt,and validate the AAOS-FAOQ for Arabicspeaking patients with traumatic foot and ankle injuries.METHODS The cross-cultural adaptation followed established guidelines,involving forward and backward translations,expert review,and pre-testing.The final Arabic version was administered alongside the Arabic Short-Form 36(SF-36)to 100 patients for validity testing.Reliability was assessed through test-retest methods with 20 patients completing the questionnaire twice within 48 hours.Pearson correlation coefficients measured convergent and divergent validity with SF-36 subscales,while Cronbach's alpha and intraclass correlation coefficients(ICC)determined internal consistency and reliability.RESULTS Out of 100 patients,92 completed the first set of questionnaires.The Arabic AAOS-FAOQ showed strong correlations with the SF-36 subscales,particularly in physical function and bodily pain(r>0.6).Test-retest reliability was robust,with ICCs of 0.69 and 0.66 for the Global Foot and Ankle Scale and Shoe Comfort Scale,respectively.Cronbach's alpha for internal consistency ranged from 0.7 to 0.9.CONCLUSION The Arabic version of the AAOS-FAOQ demonstrated validity and reliability for use in Arabic-speaking patients with traumatic foot and ankle injuries.This adaptation will enhance the inclusion of this population in orthopedic clinical studies,improving the generalizability of research findings and patient care.
基金funded by Anhui NARI ZT Electric Co.,Ltd.,entitled“Research on the Shared Operation and Maintenance Service Model for Metering Equipment and Platform Development for the Modern Industrial Chain”(Grant No.524636250005).
文摘With the rapid adoption of artificial intelligence(AI)in domains such as power,transportation,and finance,the number of machine learning and deep learning models has grown exponentially.However,challenges such as delayed retraining,inconsistent version management,insufficient drift monitoring,and limited data security still hinder efficient and reliable model operations.To address these issues,this paper proposes the Intelligent Model Lifecycle Management Algorithm(IMLMA).The algorithm employs a dual-trigger mechanism based on both data volume thresholds and time intervals to automate retraining,and applies Bayesian optimization for adaptive hyperparameter tuning to improve performance.A multi-metric replacement strategy,incorporating MSE,MAE,and R2,ensures that new models replace existing ones only when performance improvements are guaranteed.A versioning and traceability database supports comparison and visualization,while real-time monitoring with stability analysis enables early warnings of latency and drift.Finally,hash-based integrity checks secure both model files and datasets.Experimental validation in a power metering operation scenario demonstrates that IMLMA reduces model update delays,enhances predictive accuracy and stability,and maintains low latency under high concurrency.This work provides a practical,reusable,and scalable solution for intelligent model lifecycle management,with broad applicability to complex systems such as smart grids.
基金supported by the National Natural Science Foundation of China(No.82373415)Beijing Xisike Clinical Oncology Research Foundation(No.Ytongshu2021/ms-0003)。
文摘Colorectal cancer(CRC)is the most frequently diagnosed malignancy of the digestive system and the second leading cause of cancer-related deaths worldwide(1).In China,CRC ranks as the second most common cancer with incidence and mortality rates continuing to rise(2).The Chinese Society of Clinical Oncology(CSCO)first introduced its guidelines in 2017,and since then,they have been updated annually to incorporate the latest clinical research findings,drug availability,and expert consensus(3-8).This article presents the key updates in the 2025 edition compared to the 2024 version.
文摘目的修订中文版心理健康素养量表(Mental Health Literacy Scale,MHLS),并验证其信度与效度,以构建适用于中国人群心理健康素养的测量工具。方法采用便利抽样法,于2019年10月至2020年4月通过问卷星平台收集341名社区居民的有效数据。测量工具包括中文版MHLS、简易应对方式问卷(Simplified Coping Style Questionnaire,SCSQ)、亚临床抑郁自助策略量表(Self Help Strategies for Subclinical Depression,SHS)、求助问卷(Help Seeking Questionnaire,HSQ),患者健康问卷抑郁量表-9项(Patient Health Questionnaire-9,PHQ-9)及广泛性焦虑自评量表-7项(Generalized Anxiety Disorder Scale-7,GAD-7)。采用探索性因子分析(exploratory factor analysis,EFA)和验证性因子分析(confirmatory factor analysis,CFA)检验量表信效度,通过Cronbach’sα和重测信度评估内部一致性及稳定性,从结构效度、聚合效度、区分效度和效标关联效度多维度验证测量学属性。结果EFA结果显示,中文版MHLS共提取5个公共因子,分别为疾病知识、信息寻求、对疾病的态度、对求助的态度以及污名化,累计解释率为43.297%。CFA表明,5因子模型拟合良好(χ^(2)/df=1.754),比较适配指数(comparative fit index,CFI)为0.903,增量适配指数(incremental fit index,IFI)为0.905,适配优度指数(goodness of fit index,GFI)为0.884,残差均方和平方根(root mean square error of pproximation,RMSEA)为0.047,残差均方根(root mean square residual,RMR)为0.053。总量表及各分量表的Cronbachα系数为0.701~0.877;重测信度为0.617~0.882(P<0.01)。MHLS总分与SCSQ中积极应对因子得分(r=0.213,P<0.01)、求助问卷得分(r=0.248,P<0.01)及抑郁自助策略得分(r=0.302,P<0.01)均呈显著正相关,表明该量表具有良好的准则相关效度。组间差异结果显示男性、低学历及未接受过心理健康知识培训群体的心理健康素养水平显著低于其他人群。结论中文版MHLS显示出良好的信度与效度,可作为评估个体心理健康素养的科学测量工具,有助于深入了解公众对心理健康的认知水平。同时建议多渠道科普提升男性、低学历人群的心理健康认知水平。
