Simulating peer-to-peer cloud resource scheduling

Resource scheduling in large-scale distributed systems, such as grids and clouds, is difficult due to the size, dynamism, and volatility of resources. These resources are eclectic and autonomous, and may exhibit different usage policies, levels of participation, capabilities, local load, and reliability. Moreover, applications are likely to exhibit various patterns and levels, and distributed resources may organize into various different overlay topologies for information and query dissemination. Researchers have proposed a wide variety of approaches and policies for mapping offered load onto resources and for solving the various component parts of the scheduling problem. However, production clouds and grids may be underutilized, and may not exhibit the load to effectively characterize all of the scheduling system inputs. The composition of large-scale systems is also changing, potentially to include more individual and peer-to-peer resources. These factors will influence the effectiveness of proposed scheduling solutions. Therefore, a simulation environment is necessary to study different approaches under different scenarios, especially those that are expected, but that are not currently characteristic of existing systems. This article describes a general-purpose peer-to-peer simulation environment that allows a wide variety of parameters, protocols, strategies and policies to be varied and studied. To provide a proof of concept, utilization of the simulation environment is presented in a large-scale distributed system problem that includes a core model and related mechanisms. In particular, this article presents a definition and possible peer-to-peer solutions for the large-scale scheduling problem. Moreover, this article describes a general simulation model, some policies that can be varied, an implementation, and some sample results.     

Organisation and management of shared documents in super-peer networks based semantic hierarchical cluster trees

A super-peer semantic network defines the semantic groups that client peers and their super peers use to connect with each other according to the semantic similarity of shared documents in peers. This will result in a query that can be evaluated locally thus reducing query process time and the amount of communication required to obtain related data. In this study, new algorithms are proposed to arrange shared documents in peers into hierarchical cluster tree structures, and links will be set up to connect semantically related super peers. During query evaluation, only related peers will be searched thus the complexity of computing is significantly reduced. Consideration is also given to automatically deciding the threshold for clustering and the construction and other essential operations for hierarchical cluster trees. The experiment results illustrate the features of the approach developed in this study.     

CloudRank-D: benchmarking and ranking cloud computing systems for data processing applications

With the explosive growth of information, more and more organizations are deploying private cloud systems or renting public cloud systems to process big data. However, there is no existing benchmark suite for evaluating cloud performance on the whole system level. To the best of our knowledge, this paper proposes the first benchmark suite CloudRank-D to benchmark and rank cloud computing systems that are shared for running big data applications. We analyze the limitations of previous metrics, e.g., floating point operations, for evaluating a cloud computing system, and propose two simple metrics: data processed per second and data processed per Joule as two complementary metrics for evaluating cloud computing systems. We detail the design of CloudRank-D that considers representative applications, diversity of data characteristics, and dynamic behaviors of both applications and system software platforms. Through experiments, we demonstrate the advantages of our proposed metrics. In several case studies, we evaluate two small-scale deployments of cloud computing systems using CloudRank-D.     

一种基于区域分割的多尺度遥感图像融合方法

光谱保持和高分辨率保留是图像融合的重要问题,提出了一种区域分割和小波变换相结合的多尺度遥感图像融合方法。首先对经过配准的待融合图像进行小波变换,然后对变换后的低频系数进行基于区域标准差的分割,将低频系数分为目标信息和背景信息,接着对目标信息采取基于绝对值的融合,对背景信息采用基于灰度误差的融合。对小波变换后的高频系数采用基于清晰度的融合规则,最后进行小波逆变换得到融合图像。将该方法和几种常用融合方法进行对比分析,结果表明:该方法在有效地保持多光谱影像光谱信息的同时,可以有效地提高融合影像的空间细节信息,有利于后续进行信息提取和图像分类。     

完备ARRs集的生成方法及传感器优化配置应用

广泛应用于故障诊断和传感器优化、分析、证实的解析冗余关系(Analytical redundancy relations,ARRs)缺乏系统、有效的方法来产生完备ARRs集,为此,提出了一种逐次消元法。该方法以系统元关系(Primary relations,PRs)为基础,通过若干次循环消元过程,生成了完备ARRs集,同时生成了对应的假定特征矩阵(Hypothetical signature matrix,HSM);基于HSM,把传感器优化配置问题映射为一个特殊的0-1整数规划模型,并用分支定界法求解该模型。应用表明,该方法能在不降低故障检测率、隔离率的前提下减少传感器数目,降低了测试代价,对故障诊断中的传感器配置问题有借鉴意义。     

穷举法在程序设计中的应用

穷举法是程序设计中经常用到的一种算法,用来解决一些用常规的数学方法无法解决的问题.文章通过两个典型的例子对穷举法的思路和有关注意事项进行了分析,供编程学习者参考.     

光学遥感舰船目标识别方法

提出一种基于粗糙集理论和分层判别回归技术的光学遥感舰船目标识别方法。该方法首先提出新的光学遥感舰船识别特征———面积比编码,并与四类特征组合作为备选特征;然后基于粗糙集理论按同可区分度来计算各备选特征的重要性权值,自动选择出对正确识别贡献较大的特征组合;最后根据分层判别回归原理生成分类判决树来识别光学遥感舰船目标。实验结果表明,本文方法在识别精度和速度方面优于最近邻和支持向量机方法,且通用可行。     

基于多通路融合网络的高速公路雾天能见度等级识别

雾天是影响高速公路交通安全的重要因素。研究从监控图像进行高速公路雾天能见度的自动识别方法可以为交通管理部门的智能管理和决策提供技术支持。根据大气散射模型分析出与雾浓度相关的多个物理因素,提出了综合这些物理因素的多通路融合识别网络。该网络使用三个通路联合学习深度视觉特征、传输矩阵特征和场景深度特征,并设计注意力融合模块来自适应地融合这三类特征以进行能见度等级识别。同时构建了一个合成数据集和一个真实的高速公路场景数据集,用于网络参数学习和性能评估。实景数据集中的图像是从中国多条高速公路的监控视频中收集的。在这两个数据集上的实验表明,所提方法可以适应不同的监控拍摄场景,能够比现有方法更准确地识别能见度等级,有效提升了识别精度。     

An ET-Based Two-Phase Method for the Calibration and Application of Distributed Hydrological Models

Water Resources Management - Parameter calibration is a core process for the application of distributed hydrological models, which depends strongly on river runoff records. However, the sparse...     

Maximizing learning without sacrificing the fun: Stealth assessment,adaptivity and learning supports in educational games

In this study, we investigated the validity of a stealth assessment of physics understanding in an educational game, as well as the effectiveness of different game-level delivery methods and various in-game supports on learning. Using a game called Physics Playground, we randomly assigned 263 ninth- to eleventh-grade students into four groups: adaptive, linear, free choice and no-treatment control. Each condition had access to the same in-game learning supports during gameplay. Results showed that: (a) the stealth assessment estimates of physics understanding were valid—significantly correlating with the external physics test scores; (b) there was no significant effect of game-level delivery method on students' learning; and (c) physics animations were the most effective (among eight supports tested) in predicting both learning outcome and in-game performance (e.g. number of game levels solved). We included student enjoyment, gender and ethnicity in our analyses as moderators to further investigate the research questions.