In this paper, a single-machine scheduling model with a given common due date and simple linear processing times was considered. The objective is the total weighted tardiness penalty and earliness award. Some polynomi...In this paper, a single-machine scheduling model with a given common due date and simple linear processing times was considered. The objective is the total weighted tardiness penalty and earliness award. Some polynomial time solvable cases for this problem are given. A dynamic programming algorithm was provided and a branch and bound algorithm for general case of the problem was provided based on a rapid method for estimating the lower bound.展开更多
In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total we...In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.展开更多
Discharging patients directly to home from the intensive care unit(ICU)is becoming a new trend.This review examines the feasibility,benefits,challenges,and considerations of directly discharging ICU patients.By analyz...Discharging patients directly to home from the intensive care unit(ICU)is becoming a new trend.This review examines the feasibility,benefits,challenges,and considerations of directly discharging ICU patients.By analyzing available evidence and healthcare professionals'experiences,the review explores the potential impacts on patient outcomes and healthcare systems.The practice of direct discharge from the ICU presents both opportunities and complexities.While it can potentially reduce costs,enhance patient comfort,and mitigate complications linked to extended hospitalization,it necessitates meticulous patient selection and robust post-discharge support mechanisms.Implementing this strategy successfully mandates the availability of home-based care services and a careful assessment of the patient's readiness for the transition.Through critical evaluation of existing literature,this review underscores the significance of tailored patient selection criteria and comprehensive post-discharge support systems to ensure patient safety and optimal recovery.The insights provided contribute evidence-based recommendations for refining the direct discharge approach,fostering improved patient outcomes,heightened satisfaction,and streamlined healthcare processes.Ultimately,the review seeks to balance patientcentered care and effective resource utilization within ICU discharge strategies.展开更多
时间序列早期分类(ETSC)有两个矛盾的目标:早期性和准确率。分类早期性的实现,总是以牺牲它的准确率为代价。现有基于优化的多变量时间序列(MTS)早期分类方法,虽然在成本函数中考虑了错误分类成本和延迟决策成本,却忽视了MTS数据集样本...时间序列早期分类(ETSC)有两个矛盾的目标:早期性和准确率。分类早期性的实现,总是以牺牲它的准确率为代价。现有基于优化的多变量时间序列(MTS)早期分类方法,虽然在成本函数中考虑了错误分类成本和延迟决策成本,却忽视了MTS数据集样本之间的局部结构对分类性能的影响。针对这个问题,提出一种基于正交局部保持映射(OLPP)和成本优化的MTS早期分类模型(OLPPMOAE)。首先,使用OLPP将MTS样本前缀映射到低维空间,保持原数据集的局部结构;其次,在低维空间训练一组高斯过程(GP)分类器,生成训练集每个时刻的类概率;最后,使用粒子群优化(PSO)算法从这些类概率中学习停止规则中的最优参数。在6个MTS数据集上的实验结果表明,在早期性基本持平的情况下,OLPPMOAE的准确率显著高于基于成本的R1_C_(lr)(stopping Rule and Cost function with regularization term l_(1)and l_(2))模型,平均准确率能够提升11.33%~15.35%,调和均值(HM)能够提升4.71%~9.01%。因此,所提模型能够以较高的准确率尽早地分类MTS。展开更多
BACKGROUND Acute necrotizing pancreatitis is a severe and life-threatening condition.It poses a considerable challenge for clinicians due to its complex nature and the high risk of complications.Several minimally inva...BACKGROUND Acute necrotizing pancreatitis is a severe and life-threatening condition.It poses a considerable challenge for clinicians due to its complex nature and the high risk of complications.Several minimally invasive and open necrosectomy procedures have been developed.Despite advancements in treatment modalities,the optimal timing to perform necrosectomy lacks consensus.AIM To evaluate the impact of necrosectomy timing on patients with pancreatic necrosis in the United States.METHODS A national retrospective cohort study was conducted using the 2016-2019 Nationwide Readmissions Database.Patients with non-elective admissions for pancreatic necrosis were identified.The participants were divided into two groups based on the necrosectomy timing:The early group received intervention within 48 hours,whereas the delayed group underwent the procedure after 48 hours.The various intervention techniques included endoscopic,percutaneous,or surgical necrosectomy.The major outcomes of interest were 30-day readmission rates,healthcare utilization,and inpatient mortality.RESULTS A total of 1309 patients with pancreatic necrosis were included.After propensity score matching,349 cases treated with early necrosectomy were matched to 375 controls who received delayed intervention.The early cohort had a 30-day readmission rate of 8.6% compared to 4.8%in the delayed cohort(P=0.040).Early necrosectomy had lower rates of mechanical ventilation(2.9%vs 10.9%,P<0.001),septic shock(8%vs 19.5%,P<0.001),and in-hospital mortality(1.1%vs 4.3%,P=0.01).Patients in the early intervention group incurred lower healthcare costs,with median total charges of $52202 compared to$147418 in the delayed group.Participants in the early cohort also had a relatively shorter median length of stay(6 vs 16 days,P<0.001).The timing of necrosectomy did not significantly influence the risk of 30-day readmission,with a hazard ratio of 0.56(95%confidence interval:0.31-1.02,P=0.06).CONCLUSION Our findings show that early necrosectomy is associated with better clinical outcomes and lower healthcare costs.Delayed intervention does not significantly alter the risk of 30-day readmission.展开更多
Considering the imprecise nature of the data in real-world problems, the earliness/tardiness （E/T） fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fu...Considering the imprecise nature of the data in real-world problems, the earliness/tardiness （E/T） fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by employing the method of maximizing the membership function of middle value. Moreover, an effective scatter search based particle swarm optimization （SSPSO） algorithm is proposed to minimize the sum of total earliness and tardiness penalties. The proposed SSPSO algorithm incorporates the scatter search （SS） algorithm into the frame of particle swarm optimization （PSO） algorithm and gives full play to their characteristics of fast convergence and high diversity. Besides, a differential evolution （DE） scheme is used to generate solutions in the SS. In addition, the dynamic update strategy and critical conditions are adopted to improve the performance of SSPSO. The simulation results indicate the superiority of SSPSO in terms of effectiveness and efficiency.展开更多
To describe the earliness/tardiness production planning problems in the JIT environment, a nonlinear semi\|infinite programming model was proposed in \. Due to a nonconvex objective function and many infinite constrai...To describe the earliness/tardiness production planning problems in the JIT environment, a nonlinear semi\|infinite programming model was proposed in \. Due to a nonconvex objective function and many infinite constraints, the model is difficult to be solved by traditional methods. In this paper, simulated annealing method combined with a heuristic is developed. Numerical results shows that the present approach is very efficient. Theoretically, the developed method is an attempt to solve a continuous domain problem by using simulated annealing.展开更多
Simple GNSS navigation receivers, developed for the mass market, can be used for positioning with sub centimeter accuracy in a wireless sensor network if the read-out of the carrier phase data is possible and all data...Simple GNSS navigation receivers, developed for the mass market, can be used for positioning with sub centimeter accuracy in a wireless sensor network if the read-out of the carrier phase data is possible and all data is permanently broadcast to a central computer for near real time processing of the respective base lines. Experiences gained in two research projects related to landslide monitoring are depicted in terms of quality and reliability of the results by the developed approach. As far as possible a modular system set up with commercial off-the-shelf components, e.g., standard WLAN fur commtmication, solar batteries with solar panels for autarkic power supply and in cooperation of existing proofed program tools is chosen. The challenge of the still ongoing development is to have a flexible and robust GNSS based sensor network available - concerned not only for landslide monitoring in future.展开更多
基金supported by the National Natural Science Foundation of China (Grant No.19771057)
文摘In this paper, a single-machine scheduling model with a given common due date and simple linear processing times was considered. The objective is the total weighted tardiness penalty and earliness award. Some polynomial time solvable cases for this problem are given. A dynamic programming algorithm was provided and a branch and bound algorithm for general case of the problem was provided based on a rapid method for estimating the lower bound.
文摘In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.
文摘Discharging patients directly to home from the intensive care unit(ICU)is becoming a new trend.This review examines the feasibility,benefits,challenges,and considerations of directly discharging ICU patients.By analyzing available evidence and healthcare professionals'experiences,the review explores the potential impacts on patient outcomes and healthcare systems.The practice of direct discharge from the ICU presents both opportunities and complexities.While it can potentially reduce costs,enhance patient comfort,and mitigate complications linked to extended hospitalization,it necessitates meticulous patient selection and robust post-discharge support mechanisms.Implementing this strategy successfully mandates the availability of home-based care services and a careful assessment of the patient's readiness for the transition.Through critical evaluation of existing literature,this review underscores the significance of tailored patient selection criteria and comprehensive post-discharge support systems to ensure patient safety and optimal recovery.The insights provided contribute evidence-based recommendations for refining the direct discharge approach,fostering improved patient outcomes,heightened satisfaction,and streamlined healthcare processes.Ultimately,the review seeks to balance patientcentered care and effective resource utilization within ICU discharge strategies.
文摘时间序列早期分类(ETSC)有两个矛盾的目标:早期性和准确率。分类早期性的实现,总是以牺牲它的准确率为代价。现有基于优化的多变量时间序列(MTS)早期分类方法,虽然在成本函数中考虑了错误分类成本和延迟决策成本,却忽视了MTS数据集样本之间的局部结构对分类性能的影响。针对这个问题,提出一种基于正交局部保持映射(OLPP)和成本优化的MTS早期分类模型(OLPPMOAE)。首先,使用OLPP将MTS样本前缀映射到低维空间,保持原数据集的局部结构;其次,在低维空间训练一组高斯过程(GP)分类器,生成训练集每个时刻的类概率;最后,使用粒子群优化(PSO)算法从这些类概率中学习停止规则中的最优参数。在6个MTS数据集上的实验结果表明,在早期性基本持平的情况下,OLPPMOAE的准确率显著高于基于成本的R1_C_(lr)(stopping Rule and Cost function with regularization term l_(1)and l_(2))模型,平均准确率能够提升11.33%~15.35%,调和均值(HM)能够提升4.71%~9.01%。因此,所提模型能够以较高的准确率尽早地分类MTS。
文摘BACKGROUND Acute necrotizing pancreatitis is a severe and life-threatening condition.It poses a considerable challenge for clinicians due to its complex nature and the high risk of complications.Several minimally invasive and open necrosectomy procedures have been developed.Despite advancements in treatment modalities,the optimal timing to perform necrosectomy lacks consensus.AIM To evaluate the impact of necrosectomy timing on patients with pancreatic necrosis in the United States.METHODS A national retrospective cohort study was conducted using the 2016-2019 Nationwide Readmissions Database.Patients with non-elective admissions for pancreatic necrosis were identified.The participants were divided into two groups based on the necrosectomy timing:The early group received intervention within 48 hours,whereas the delayed group underwent the procedure after 48 hours.The various intervention techniques included endoscopic,percutaneous,or surgical necrosectomy.The major outcomes of interest were 30-day readmission rates,healthcare utilization,and inpatient mortality.RESULTS A total of 1309 patients with pancreatic necrosis were included.After propensity score matching,349 cases treated with early necrosectomy were matched to 375 controls who received delayed intervention.The early cohort had a 30-day readmission rate of 8.6% compared to 4.8%in the delayed cohort(P=0.040).Early necrosectomy had lower rates of mechanical ventilation(2.9%vs 10.9%,P<0.001),septic shock(8%vs 19.5%,P<0.001),and in-hospital mortality(1.1%vs 4.3%,P=0.01).Patients in the early intervention group incurred lower healthcare costs,with median total charges of $52202 compared to$147418 in the delayed group.Participants in the early cohort also had a relatively shorter median length of stay(6 vs 16 days,P<0.001).The timing of necrosectomy did not significantly influence the risk of 30-day readmission,with a hazard ratio of 0.56(95%confidence interval:0.31-1.02,P=0.06).CONCLUSION Our findings show that early necrosectomy is associated with better clinical outcomes and lower healthcare costs.Delayed intervention does not significantly alter the risk of 30-day readmission.
基金supported by National Natural Science Foundation of China(Nos.61174040 and 61104178)Shanghai Commission of Science and Technology(No.12JC1403400)the Fundamental Research Funds for the Central Universities
文摘Considering the imprecise nature of the data in real-world problems, the earliness/tardiness （E/T） fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by employing the method of maximizing the membership function of middle value. Moreover, an effective scatter search based particle swarm optimization （SSPSO） algorithm is proposed to minimize the sum of total earliness and tardiness penalties. The proposed SSPSO algorithm incorporates the scatter search （SS） algorithm into the frame of particle swarm optimization （PSO） algorithm and gives full play to their characteristics of fast convergence and high diversity. Besides, a differential evolution （DE） scheme is used to generate solutions in the SS. In addition, the dynamic update strategy and critical conditions are adopted to improve the performance of SSPSO. The simulation results indicate the superiority of SSPSO in terms of effectiveness and efficiency.
文摘To describe the earliness/tardiness production planning problems in the JIT environment, a nonlinear semi\|infinite programming model was proposed in \. Due to a nonconvex objective function and many infinite constraints, the model is difficult to be solved by traditional methods. In this paper, simulated annealing method combined with a heuristic is developed. Numerical results shows that the present approach is very efficient. Theoretically, the developed method is an attempt to solve a continuous domain problem by using simulated annealing.
文摘Simple GNSS navigation receivers, developed for the mass market, can be used for positioning with sub centimeter accuracy in a wireless sensor network if the read-out of the carrier phase data is possible and all data is permanently broadcast to a central computer for near real time processing of the respective base lines. Experiences gained in two research projects related to landslide monitoring are depicted in terms of quality and reliability of the results by the developed approach. As far as possible a modular system set up with commercial off-the-shelf components, e.g., standard WLAN fur commtmication, solar batteries with solar panels for autarkic power supply and in cooperation of existing proofed program tools is chosen. The challenge of the still ongoing development is to have a flexible and robust GNSS based sensor network available - concerned not only for landslide monitoring in future.
