Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in...Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented.展开更多
在线练习和测试是网络学习的重要组成部分。但目前多数开发工具实现的在线试题课程、学习管理系统很难标准化地记录测试结果、学习者反馈等重要学习数据。通过探索SCORM RTE API,SCORM Data Model Elements以及SCO和LMS之间的通信机制,...在线练习和测试是网络学习的重要组成部分。但目前多数开发工具实现的在线试题课程、学习管理系统很难标准化地记录测试结果、学习者反馈等重要学习数据。通过探索SCORM RTE API,SCORM Data Model Elements以及SCO和LMS之间的通信机制,给出了一个符合SCORM的Dreamweaver试题开发插件的范例,实现了标准化的数据跟踪和记录。展开更多
In the application of multiple-processor systems some processors or links in a system maynot function properly,thus the fault diagnosis is one of the most important issues in the analysisand maintenance of those syste...In the application of multiple-processor systems some processors or links in a system maynot function properly,thus the fault diagnosis is one of the most important issues in the analysisand maintenance of those systems.For the practical fault diagnosis systems,the probability that allneighboring processors of a processor are faulty simultaneously is very small.Thus,the conditionaldiagnosability,which is a new metric for evaluating such systems,assumes that every fault set doesnot contain all neighbors of any processor in the system.In this paper,the authors show that then-dimensional shuffle-cube has the conditional diagnosability of 4n-15 for n = 2 (mod 4) and n ≥ 10.展开更多
基金Project supported by the National Natural Science Foundation of China (Nos. 10271110 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE+2 种基金 China Project supported by the National Natural Science Foundation of China (Nos. 10271110 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE China
文摘Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented.
文摘在线练习和测试是网络学习的重要组成部分。但目前多数开发工具实现的在线试题课程、学习管理系统很难标准化地记录测试结果、学习者反馈等重要学习数据。通过探索SCORM RTE API,SCORM Data Model Elements以及SCO和LMS之间的通信机制,给出了一个符合SCORM的Dreamweaver试题开发插件的范例,实现了标准化的数据跟踪和记录。
基金supported by the National Natural Science Foundation of China under Grant Nos. 10701074,10531070, 10771209, and 10721101in part by Sciences Foundation for Young Scholars of Beijing Normal University+1 种基金in part by priority discipline of Beijing Normal Universityin part by Chinese Academy of Sciences under Grant No. kjcx-yw-s7
文摘In the application of multiple-processor systems some processors or links in a system maynot function properly,thus the fault diagnosis is one of the most important issues in the analysisand maintenance of those systems.For the practical fault diagnosis systems,the probability that allneighboring processors of a processor are faulty simultaneously is very small.Thus,the conditionaldiagnosability,which is a new metric for evaluating such systems,assumes that every fault set doesnot contain all neighbors of any processor in the system.In this paper,the authors show that then-dimensional shuffle-cube has the conditional diagnosability of 4n-15 for n = 2 (mod 4) and n ≥ 10.
