Porters play a crucial role in hospitals because they ensure the efficient transportation of patients,medical equipment,and vital documents.Despite its importance,there is a lack of research addressing the prediction ...Porters play a crucial role in hospitals because they ensure the efficient transportation of patients,medical equipment,and vital documents.Despite its importance,there is a lack of research addressing the prediction of completion times for porter tasks.To address this gap,we utilized real-world porter delivery data from Taiwan University Hospital,China,Yunlin Branch,Taiwan Region of China.We first identified key features that can influence the duration of porter tasks.We then employed three widely-used machine learning algorithms:decision tree,random forest,and gradient boosting.To leverage the strengths of each algorithm,we finally adopted an ensemble modeling approach that aggregates their individual predictions.Our experimental results show that the proposed ensemble model can achieve a mean absolute error of 3 min in predicting task response time and 4.42 min in task completion time.The prediction error is around 50%lower compared to using only the historical average.These results demonstrate that our method significantly improves the accuracy of porter task time prediction,supporting better resource planning and patient care.It helps ward staff streamline workflows by reducing delays,enables porter managers to allocate resources more effectively,and shortens patient waiting times,contributing to a better care experience.展开更多
Parallel processors provide fast computing environments for various users.But the real efficiencies ofparallel processors intensively depend on the partitioning strategies of tasks over the processors.In thispaper,the...Parallel processors provide fast computing environments for various users.But the real efficiencies ofparallel processors intensively depend on the partitioning strategies of tasks over the processors.In thispaper,the partitioning problems of independent tasks for homogeneous system of parallel processors arequantitatively studied.We adopt two criteria,minimizing the completion time and the total waiting time,to determine the optimal partitioning strategy.展开更多
In cloud computing(CC),resources are allocated and offered to the cli-ents transparently in an on-demand way.Failures can happen in CC environment and the cloud resources are adaptable tofluctuations in the performance...In cloud computing(CC),resources are allocated and offered to the cli-ents transparently in an on-demand way.Failures can happen in CC environment and the cloud resources are adaptable tofluctuations in the performance delivery.Task execution failure becomes common in the CC environment.Therefore,fault-tolerant scheduling techniques in CC environment are essential for handling performance differences,resourcefluxes,and failures.Recently,several intelli-gent scheduling approaches have been developed for scheduling tasks in CC with no consideration of fault tolerant characteristics.With this motivation,this study focuses on the design of Gorilla Troops Optimizer Based Fault Tolerant Aware Scheduling Scheme(GTO-FTASS)in CC environment.The proposed GTO-FTASS model aims to schedule the tasks and allocate resources by considering fault tolerance into account.The GTO-FTASS algorithm is based on the social intelligence nature of gorilla troops.Besides,the GTO-FTASS model derives afitness function involving two parameters such as expected time of completion(ETC)and failure probability of executing a task.In addition,the presented fault detector can trace the failed tasks or VMs and then schedule heal submodule in sequence with a remedial or retrieval scheduling model.The experimental vali-dation of the GTO-FTASS model has been performed and the results are inspected under several aspects.Extensive comparative analysis reported the better outcomes of the GTO-FTASS model over the recent approaches.展开更多
基金supported by National Taiwan University Hospital Yunlin Branch Project NTUHYL 110.C018National Science and Technology Council,Taiwan.
文摘Porters play a crucial role in hospitals because they ensure the efficient transportation of patients,medical equipment,and vital documents.Despite its importance,there is a lack of research addressing the prediction of completion times for porter tasks.To address this gap,we utilized real-world porter delivery data from Taiwan University Hospital,China,Yunlin Branch,Taiwan Region of China.We first identified key features that can influence the duration of porter tasks.We then employed three widely-used machine learning algorithms:decision tree,random forest,and gradient boosting.To leverage the strengths of each algorithm,we finally adopted an ensemble modeling approach that aggregates their individual predictions.Our experimental results show that the proposed ensemble model can achieve a mean absolute error of 3 min in predicting task response time and 4.42 min in task completion time.The prediction error is around 50%lower compared to using only the historical average.These results demonstrate that our method significantly improves the accuracy of porter task time prediction,supporting better resource planning and patient care.It helps ward staff streamline workflows by reducing delays,enables porter managers to allocate resources more effectively,and shortens patient waiting times,contributing to a better care experience.
基金This work was supported in part by the National Natural Science Foundation of China and in part by the 863 Project.
文摘Parallel processors provide fast computing environments for various users.But the real efficiencies ofparallel processors intensively depend on the partitioning strategies of tasks over the processors.In thispaper,the partitioning problems of independent tasks for homogeneous system of parallel processors arequantitatively studied.We adopt two criteria,minimizing the completion time and the total waiting time,to determine the optimal partitioning strategy.
文摘In cloud computing(CC),resources are allocated and offered to the cli-ents transparently in an on-demand way.Failures can happen in CC environment and the cloud resources are adaptable tofluctuations in the performance delivery.Task execution failure becomes common in the CC environment.Therefore,fault-tolerant scheduling techniques in CC environment are essential for handling performance differences,resourcefluxes,and failures.Recently,several intelli-gent scheduling approaches have been developed for scheduling tasks in CC with no consideration of fault tolerant characteristics.With this motivation,this study focuses on the design of Gorilla Troops Optimizer Based Fault Tolerant Aware Scheduling Scheme(GTO-FTASS)in CC environment.The proposed GTO-FTASS model aims to schedule the tasks and allocate resources by considering fault tolerance into account.The GTO-FTASS algorithm is based on the social intelligence nature of gorilla troops.Besides,the GTO-FTASS model derives afitness function involving two parameters such as expected time of completion(ETC)and failure probability of executing a task.In addition,the presented fault detector can trace the failed tasks or VMs and then schedule heal submodule in sequence with a remedial or retrieval scheduling model.The experimental vali-dation of the GTO-FTASS model has been performed and the results are inspected under several aspects.Extensive comparative analysis reported the better outcomes of the GTO-FTASS model over the recent approaches.
