The Resource-Energy Nexus as a Key Factor for Circular Economy

The extraction of raw materials is associated with energy input and CO₂ emissions. What is obvious for extraction from mining, however, also applies to recycling. Mostly, recycling is preferred for reasons of climate protection or because of the geological scarcity of raw materials, which is controversially discussed. While in mining, the declining ore grade is a driver for the energy demand, in case of recycling it is the dissipation of materials into products or waste. As concentration decreases, the effort required also increases disproportionately. The “closing the loop” metaphor of Circular Economy is therefore inappropriate in its stricter meaning. It is rather about optimizing the overall system and finding the optimal recycling rate. However, first, it must be clarified what the political goals for Circular Economy are.     

有色金属资源加工提取技术研发的新进展

叙述了有色金属工业和科技面临的挑战与展望，介绍了有色金属硫化矿物的电位调控浮选技术，铜矿和金矿的生物浸出技术、水硬铝石型铝土矿的选矿脱硅（生产氧化铝的技术创新）。     

地质矿产资源勘查问题及对策

为了适应我国当前社会发展的需要,地质矿产资源的利用率越来越高。我国拥有大量的矿产资源,但由于长期不合理的勘探、开发和出口,使矿产企业遭受了巨大的损失。要促进我国矿产资源产业的发展及转型,就必须加强地质矿产勘察力度,同时保证合理开发。     

Resource-aware hybrid scheduling algorithm in heterogeneous distributed computing

Today, almost everyone is connected to the Internet and uses different Cloud solutions to store, deliver and process data. Cloud computing assembles large networks of virtualized services such as hardware and software resources. The new era in which ICT penetrated almost all domains (healthcare, aged-care, social assistance, surveillance, education, etc.) creates the need of new multimedia content-driven applications. These applications generate huge amount of data, require gathering, processing and then aggregation in a fault-tolerant, reliable and secure heterogeneous distributed system created by a mixture of Cloud systems (public/private), mobile devices networks, desktop-based clusters, etc. In this context dynamic resource provisioning for Big Data application scheduling became a challenge in modern systems. We proposed a resource-aware hybrid scheduling algorithm for different types of application: batch jobs and workflows. The proposed algorithm considers hierarchical clustering of the available resources into groups in the allocation phase. Task execution is performed in two phases: in the first, tasks are assigned to groups of resources and in the second phase, a classical scheduling algorithm is used for each group of resources. The proposed algorithm is suitable for Heterogeneous Distributed Computing, especially for modern High-Performance Computing (HPC) systems in which applications are modeled with various requirements (both IO and computational intensive), with accent on data from multimedia applications. We evaluate their performance in a realistic setting of CloudSim tool with respect to load-balancing, cost savings, dependency assurance for workflows and computational efficiency, and investigate the computing methods of these performance metrics at runtime.     

DynamicCloudSim: Simulating heterogeneity in computational clouds

Simulation has become a commonly employed first step in evaluating novel approaches towards resource allocation and task scheduling on distributed architectures. However, existing simulators fall short in their modeling of the instability common to shared computational infrastructure, such as public clouds. In this work, we present DynamicCloudSim which extends the popular simulation toolkit CloudSim with several factors of instability, including inhomogeneity and dynamic changes of performance at runtime as well as failures during task execution. As a validation of the introduced functionality, we simulate the impact of instability on scientific workflow scheduling by assessing and comparing the performance of four schedulers in the course of several experiments both in simulation and on real cloud infrastructure. Results indicate that our model seems to adequately capture the most important aspects of cloud performance instability. The source code of DynamicCloudSim and the examined schedulers is available at https://code.google.com/p/dynamiccloudsim/.     

带有线性恶化工件和释放时间的两个代理单机调度问题

研究了带有简单线性恶化工件和释放时间的两个代理单机调度问题. 所有工件在一台机器上加工, 每个代理有各自依赖于自己工件的优化目标. 针对工件释放时间相同与不同两种情况, 研究了有约束的优化模型, 即找到调度最小化一个代理的目标函数而使得另一个代理的目标函数不超过一个给定的上界. 当工件具有相同的释放时间, 我们主要考虑的目标函数有: 总加权完工时间和总加权拖期工件数. 当工件具有不同释放时间, 我们考虑的目标函数有: 最大完工时间、总完工时间以及拖期工件数. 对于每一个问题, 我们分析了问题的计算复杂性. 此外, 对于NP难问题的一些特殊情况本文分析了最优解性质, 基于这些性质给出了最优算法.     

Single machine scheduling problems with exponentially time-dependent learning effects

In this paper, we introduce a single-machine scheduling problem with an exponentially time-dependent learning effect. The processing time of a job is assumed to be an exponential function of the total normal processing time of jobs already processed before it. For such a scheduling problem, we first provide the upper bound for the maximum lateness and for the total weighted completion time. Next, we show that problems with the following criteria: makespan, the total completion time, the total weighted completion time, the total earliness/tardiness penalties and the maximum lateness under some agreeable conditions, are polynomially solvable.     

LSO改进CGA解决多目标作业车间调度问题

针对传统方法在处理作业车间调度问题时很难将库存容量考虑在内的问题,提出了基于局部搜索算子(LSO)改进交叉遗传算法(CGA)的多目标作业车间调度模型。为了提高所提模型的效率,首先设计一种基于关键路径的交叉遗传算子;然后,设计一种新的局部搜索算子来提高遗传算法的局部搜索能力;最后,基于这两种算子,设计混合遗传算法框架,在考虑调度总完成时间的同时将库存容量作为目标进行优化。所提算法的有效性在FT10、LA01、LA06、LA11、LA21和LA36等基准问题测试中得到验证。仿真结果表明,与较为先进的非劣分层遗传算法(NSGA-II)相比,使用所提算法获得了更好的非支配解,从而更好地解决了多目标作业车间调度问题。     

农业海量信息资源管理平台设计与实现

随着农业信息化的深入,如何描述、存储、管理和处理海量分布信息资源成为农业应用的首要问题。提出基于XML/XML Schema的统一农业信息资源描述框架,将XML描述与元数据约束相结合,采用层次化管理结构实现元数据与资源信息的组织;在HDFS(Hadoop Distributed File System)云存储架构适应性改进基础之上,设计实现了农业海量信息资源管理平台,实现了海量、分布、异构资源的分类组织、存储和访问服务。平台覆盖了全国6个省市资源节点,实现了3.2 TB农业资源存储管理,与传统资源检索方法相比,平台资源检索时间缩短73%;同时,用户在同一检索条件下能更多地获得相关资源,不仅查准率平均提高5%,而且资源利用率平均提高17.7%。平台在海量资源检索和利用效率方面获得提升。     

云计算环境下基于主动预测的节点部署模型研究

随着云计算的不断普及,越来越多的用户选择将自身的业务迁移至云计算系统。 用户的使用习惯与社会日常的运行规律 也伴随着大量用户涌入云计算系统,如每早8点集中地向云计算系统申请资源节点,这给系统带来了一种可预期的资源冲击。针对上述问题,提出了一种基于主动预测模式的资源部署模型。该模型首先根据预测模块中Holt-Winters季节指数平滑模型的算法周期长度来预测下一个时间周期的任务请求量,通过设计的主动预测算法判断是否应对当前的任务请求量做出响应并得出其具体数量、位置等参数指标,以实现对用户使用规律的主动应对。使用CloudSim进行仿真实验,系统地评判模型的性能。实验结果表明,AF-HW模型在应对可预测的海量并发任务请求时可有效地提升单点及整体的响应速率,使用户得到更好的体验。