Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the...Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the satellite observe more targets and therefore save observation resources.First,for the densely distributed target points,a preprocessing scheme based on task clustering is proposed.The target points are clustered according to the distance condition.Second,the local observation path is generated by Tabu algorithm in the inner layer of cluster regions.Third,considering the scatter and cluster sets,the global observation path is obtained by adopting Tabu algorithm in the outer layer.Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.展开更多
Considering the flexible attitude maneuver and the narrow field of view of agile Earth observation satellite(AEOS)together,a comprehensive task clustering(CTC)is proposed to improve the observation scheduling problem ...Considering the flexible attitude maneuver and the narrow field of view of agile Earth observation satellite(AEOS)together,a comprehensive task clustering(CTC)is proposed to improve the observation scheduling problem for AEOS(OSPFAS).Since the observation scheduling problem for AEOS with comprehensive task clustering(OSWCTC)is a dynamic combination optimization problem,two optimization objectives,the loss rate(LR)of the image quality and the energy consumption(EC),are proposed to format OSWCTC as a bi-objective optimization model.Harnessing the power of an adaptive large neighborhood search(ALNS)algorithm with a nondominated sorting genetic algorithm II(NSGA-II),a bi-objective optimization algorithm,ALNS+NSGA-II,is developed to solve OSWCTC.Based on the existing instances,the efficiency of ALNS+NSGA-II is analyzed from several aspects,meanwhile,results of extensive computational experiments are presented which disclose that OSPFAS considering CTC produces superior outcomes.展开更多
Cloud computing has developed as an important information technology paradigm which can provide on-demand services. Meanwhile,its energy consumption problem has attracted a grow-ing attention both from academic and in...Cloud computing has developed as an important information technology paradigm which can provide on-demand services. Meanwhile,its energy consumption problem has attracted a grow-ing attention both from academic and industrial communities. In this paper,from the perspective of cloud tasks,the relationship between cloud tasks and cloud platform energy consumption is established and analyzed on the basis of the multidimensional attributes of cloud tasks. Furthermore,a three-way clustering algorithm of cloud tasks is proposed for saving energy. In the algorithm,f irst,t he cloud tasks are classified into three categories according to the content properties of the cloud tasks and resources respectively. Next,cloud tasks and cloud resources are clustered according to their computation characteristics（ e. g. computation-intensive,data-intensive）. Subsequently,greedy scheduling is performed. The simulation results showthat the proposed algorithm can significantly reduce the energy cost and improve resources utilization,compared with the general greedy scheduling algorithm.展开更多
A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm incl...A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm includes dynamic-group, detachgraph and front-sink components. The priority rules used are new. Relationship number, potentiality, weight and merge degree are defined for cluster＇s priority, and task potentiality for tasks＇ priority. Experiments show the algorithm could get good result in short time. The algorithm produces another optimal solution for the classic MJD benchmark. Its average performance is better than five latter-day representative algorithms, especially six benchmarks of the nines.展开更多
The formation of the manned aerial vehicle/unmanned aerial vehicle(MAV/UAV) task coalition is considered. To reduce the scale of the problem, the formation progress is divided into three phases. For the task clusterin...The formation of the manned aerial vehicle/unmanned aerial vehicle(MAV/UAV) task coalition is considered. To reduce the scale of the problem, the formation progress is divided into three phases. For the task clustering phase, the geographical position of tasks is taken into consideration and a cluster method is proposed. For the UAV allocation phase, the UAV requirement for both constrained and unconstrained resources is introduced, and a multi-objective optimal algorithm is proposed to solve the allocation problem. For the MAV allocation phase, the optimal model is firstly constructed and it is decomposed according to the ideal of greed to reduce the time complexity of the algorithm. Based on the above phases, the MAV/UAV task coalition formation method is proposed and the effectiveness and practicability are demonstrated by simulation examples.展开更多
We propose a content-based parallel image retrieval system to achieve high responding ability. Our system is developed on cluster architectures. It has several retrieval. servers to supply the service of content-based...We propose a content-based parallel image retrieval system to achieve high responding ability. Our system is developed on cluster architectures. It has several retrieval. servers to supply the service of content-based image retrieval. It adopts the Browser/Server (B/S) mode. The users could visit our system though web pages. It uses the symmetrical color-spatial features (SCSF) to represent the content of an image. The SCSF is effective and efficient for image matching because it is independent of image distortion such as rotation and flip as well as it increases the matching accuracy. The SCSF was organized by M-tree, which could speedup the searching procedure. Our experiments show that the image matching is quickly and efficiently with the use of SCSF. And with the support of several retrieval servers, the system could respond to many users at mean time. Key words content-based image retrieval - cluster architecture - color-spatial feature - B/S mode - task parallel - WWW - Internet CLC number TP391 Foundation item: Supported by the National Natural Science Foundation of China (60173058)Biography: ZHOU Bing (1975-), male, Ph. D candidate, reseach direction: data mining, content-based image retrieval.展开更多
The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic l...The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.展开更多
目的分析产科麻醉护士人力资源现况和岗位任务特征,为完善产科麻醉护士岗位管理和队伍建设提供依据。方法采用方便抽样法于2024年1—3月选取全国298家助产机构作为调查对象,采用自行编制的“产科麻醉护士人力资源及岗位管理调查问卷”...目的分析产科麻醉护士人力资源现况和岗位任务特征,为完善产科麻醉护士岗位管理和队伍建设提供依据。方法采用方便抽样法于2024年1—3月选取全国298家助产机构作为调查对象,采用自行编制的“产科麻醉护士人力资源及岗位管理调查问卷”和“产科麻醉护士岗位实践内容调查问卷”进行横断面调查,并对麻醉护士岗位任务进行因子分析和聚类分析。结果全国298家助产机构共有产科麻醉护士507人,年龄主要为30~39岁(50.7%),学历以本科(82.1%)为主,职称以护师和主管护师(84.0%)为主,麻醉护理工作年限多为≤10年(79.5%)。麻醉护士岗位角色以产科麻醉总务护士(47.9%)、产科手术间麻醉护士(44.8%)和产科麻醉后监测治疗室(post-anesthesia care unit,PACU)护士(59.0%)为主。产科麻醉总务护士岗位任务主要分为二类,Ⅰ类为麻醉药品、仪器设备管理和感染控制工作;Ⅱ类为麻醉相关收费。产科手术间麻醉护士岗位分为四类,Ⅰ类和Ⅱ类多为手术间常规麻醉护理操作,多由麻醉护士自主执行或在麻醉医师间接监督下执行;Ⅲ类和Ⅳ类多为特殊检验和操作。产科PACU护士岗位分为二类,Ⅰ类是基础任务,包括剖宫产术后病情观察、转运、健康教育及麻醉后住院随访等;Ⅱ类是进阶任务,包括全麻剖宫产气道管理、术后麻醉及手术并发症识别处理等。麻醉门诊护士岗位分为二类,Ⅰ类包括术前麻醉评估;Ⅱ类包含合并症孕产妇术前指导、麻醉后并发症识别处理和随访等。疼痛管理麻醉护士岗位分为三类,Ⅰ类是疼痛管理基础操作;Ⅱ类包括疼痛评估、镇痛前准备、并发症识别处理和镇痛效果评价;Ⅲ类为实施不同途径镇痛措施。结论产科麻醉护士的职称和学历结构有待提升,岗位实践内容呈阶梯化功能制特征,有必要进一步完善麻醉护士人力结构配置和工作模式,合理分配岗位任务,优化麻醉护士角色职能,提升其岗位实践效能。展开更多
基金the National Key Research and Development Program of China(Grant No.2016YFB0500801)sponsored by Qing Lan Project.
文摘Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the satellite observe more targets and therefore save observation resources.First,for the densely distributed target points,a preprocessing scheme based on task clustering is proposed.The target points are clustered according to the distance condition.Second,the local observation path is generated by Tabu algorithm in the inner layer of cluster regions.Third,considering the scatter and cluster sets,the global observation path is obtained by adopting Tabu algorithm in the outer layer.Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.
文摘Considering the flexible attitude maneuver and the narrow field of view of agile Earth observation satellite(AEOS)together,a comprehensive task clustering(CTC)is proposed to improve the observation scheduling problem for AEOS(OSPFAS).Since the observation scheduling problem for AEOS with comprehensive task clustering(OSWCTC)is a dynamic combination optimization problem,two optimization objectives,the loss rate(LR)of the image quality and the energy consumption(EC),are proposed to format OSWCTC as a bi-objective optimization model.Harnessing the power of an adaptive large neighborhood search(ALNS)algorithm with a nondominated sorting genetic algorithm II(NSGA-II),a bi-objective optimization algorithm,ALNS+NSGA-II,is developed to solve OSWCTC.Based on the existing instances,the efficiency of ALNS+NSGA-II is analyzed from several aspects,meanwhile,results of extensive computational experiments are presented which disclose that OSPFAS considering CTC produces superior outcomes.
基金Supported by the Harbin Technology Bureau Youth Talented Project(2014RFQXJ073)China Postdoctoral Fund Projects(2014M561330)
文摘Cloud computing has developed as an important information technology paradigm which can provide on-demand services. Meanwhile,its energy consumption problem has attracted a grow-ing attention both from academic and industrial communities. In this paper,from the perspective of cloud tasks,the relationship between cloud tasks and cloud platform energy consumption is established and analyzed on the basis of the multidimensional attributes of cloud tasks. Furthermore,a three-way clustering algorithm of cloud tasks is proposed for saving energy. In the algorithm,f irst,t he cloud tasks are classified into three categories according to the content properties of the cloud tasks and resources respectively. Next,cloud tasks and cloud resources are clustered according to their computation characteristics（ e. g. computation-intensive,data-intensive）. Subsequently,greedy scheduling is performed. The simulation results showthat the proposed algorithm can significantly reduce the energy cost and improve resources utilization,compared with the general greedy scheduling algorithm.
基金Supported by the National Natural Science Foundation of China (7047107)the Ph.D. Programs Foundation of Ministry of Education of China (20020487046)
文摘A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm includes dynamic-group, detachgraph and front-sink components. The priority rules used are new. Relationship number, potentiality, weight and merge degree are defined for cluster＇s priority, and task potentiality for tasks＇ priority. Experiments show the algorithm could get good result in short time. The algorithm produces another optimal solution for the classic MJD benchmark. Its average performance is better than five latter-day representative algorithms, especially six benchmarks of the nines.
基金supported by the National Natural Science Foundation of China(61573017 61703425)the Aeronautical Science Fund(20175796014)
文摘The formation of the manned aerial vehicle/unmanned aerial vehicle(MAV/UAV) task coalition is considered. To reduce the scale of the problem, the formation progress is divided into three phases. For the task clustering phase, the geographical position of tasks is taken into consideration and a cluster method is proposed. For the UAV allocation phase, the UAV requirement for both constrained and unconstrained resources is introduced, and a multi-objective optimal algorithm is proposed to solve the allocation problem. For the MAV allocation phase, the optimal model is firstly constructed and it is decomposed according to the ideal of greed to reduce the time complexity of the algorithm. Based on the above phases, the MAV/UAV task coalition formation method is proposed and the effectiveness and practicability are demonstrated by simulation examples.
文摘We propose a content-based parallel image retrieval system to achieve high responding ability. Our system is developed on cluster architectures. It has several retrieval. servers to supply the service of content-based image retrieval. It adopts the Browser/Server (B/S) mode. The users could visit our system though web pages. It uses the symmetrical color-spatial features (SCSF) to represent the content of an image. The SCSF is effective and efficient for image matching because it is independent of image distortion such as rotation and flip as well as it increases the matching accuracy. The SCSF was organized by M-tree, which could speedup the searching procedure. Our experiments show that the image matching is quickly and efficiently with the use of SCSF. And with the support of several retrieval servers, the system could respond to many users at mean time. Key words content-based image retrieval - cluster architecture - color-spatial feature - B/S mode - task parallel - WWW - Internet CLC number TP391 Foundation item: Supported by the National Natural Science Foundation of China (60173058)Biography: ZHOU Bing (1975-), male, Ph. D candidate, reseach direction: data mining, content-based image retrieval.
基金Natural Science Foundation of China (No.60 173 0 3 1)
文摘The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.
文摘目的分析产科麻醉护士人力资源现况和岗位任务特征,为完善产科麻醉护士岗位管理和队伍建设提供依据。方法采用方便抽样法于2024年1—3月选取全国298家助产机构作为调查对象,采用自行编制的“产科麻醉护士人力资源及岗位管理调查问卷”和“产科麻醉护士岗位实践内容调查问卷”进行横断面调查,并对麻醉护士岗位任务进行因子分析和聚类分析。结果全国298家助产机构共有产科麻醉护士507人,年龄主要为30~39岁(50.7%),学历以本科(82.1%)为主,职称以护师和主管护师(84.0%)为主,麻醉护理工作年限多为≤10年(79.5%)。麻醉护士岗位角色以产科麻醉总务护士(47.9%)、产科手术间麻醉护士(44.8%)和产科麻醉后监测治疗室(post-anesthesia care unit,PACU)护士(59.0%)为主。产科麻醉总务护士岗位任务主要分为二类,Ⅰ类为麻醉药品、仪器设备管理和感染控制工作;Ⅱ类为麻醉相关收费。产科手术间麻醉护士岗位分为四类,Ⅰ类和Ⅱ类多为手术间常规麻醉护理操作,多由麻醉护士自主执行或在麻醉医师间接监督下执行;Ⅲ类和Ⅳ类多为特殊检验和操作。产科PACU护士岗位分为二类,Ⅰ类是基础任务,包括剖宫产术后病情观察、转运、健康教育及麻醉后住院随访等;Ⅱ类是进阶任务,包括全麻剖宫产气道管理、术后麻醉及手术并发症识别处理等。麻醉门诊护士岗位分为二类,Ⅰ类包括术前麻醉评估;Ⅱ类包含合并症孕产妇术前指导、麻醉后并发症识别处理和随访等。疼痛管理麻醉护士岗位分为三类,Ⅰ类是疼痛管理基础操作;Ⅱ类包括疼痛评估、镇痛前准备、并发症识别处理和镇痛效果评价;Ⅲ类为实施不同途径镇痛措施。结论产科麻醉护士的职称和学历结构有待提升,岗位实践内容呈阶梯化功能制特征,有必要进一步完善麻醉护士人力结构配置和工作模式,合理分配岗位任务,优化麻醉护士角色职能,提升其岗位实践效能。
