半绝缘InP（Fe）的低温氯化物VPE生长

介绍了一种半绝缘ＩｎＰ（Ｆｅ）的低温氯化物气相外延（ＶＰＥ）生长方法，生长温度为５５０℃，可为金属有机气相淀积的量子阱结构二次外延半绝缘ＩｎＰ（Ｆｅ）盖层。４０μｍ层厚时电阻率超过５×１０８Ωｃｍ，临界击穿电压达到１０Ｖ以上。用这种方法制备的激光器阈值电流达８０ｍＡ，较平板式的降低３倍，远场图样平行和垂直结平面方向光功率曲线对称性良好，远场发散角，器件测试得到较好光谱。目前尚未见到其它类似报道。     

基于神经网络的特征分析在烟叶分级中的应用。

通过数字图像技术可以自动提取烟叶的颜色和形状特征,而不同特征值对分部位、颜色和等级的决定程度不同,文章结合广义回归神经网络定性分析各种不同特征对部位或颜色分级的影响,分别得到对分部位、颜色和等级有决定影响的特征量,通过建立不同神经网络得到最终等级。     

服务器虚拟化带来的信息安全风险以及影响策略

服务器虚拟化大大提高了服务器的资源利用率,对客户来说是十分有利的。但是,也带来了一些诸如破坏正常的网络架构、可能致使系统服务器超载等信息安全风险,需要采取一定的影响策略予以解决。能采取的影响策略有:安装兼容性杀毒软件、不间断地进行服务器硬件的容量分析等。     

An incentive scheduling mechanism for peer-to-peer video streaming

P2P video streaming networks are found as a scalable solution and an alternative for traditional client–server based video streaming over the Internet. One of the significant issues affecting the success of any P2P streaming network is cooperation between peers. Practical observations have proved the prevalence of free riders in P2P networks that degrade their performance. To solve this problem, using incentive mechanisms, which encourage peers to contribute more in the network, is necessary. In this paper, we designed and proposed a distributed and scalable incentive mechanism for mesh based P2P video streaming networks. In the proposed approach the contribution of the peers is measured and maintained in a distributed fashion. Furthermore, we proposed an incentive sending side scheduler in which peers are served based on their contribution in the network. Our simulation evaluations show the efficiency of the proposed approach in improving the overall perceived video quality by the non-free rider nodes and consequently in the whole network.     

File size models for shared content over the BitTorrent Peer-to-Peer network

Peer-to-Peer (P2P) traffic has increased rapidly over the past few years, with file sharing providing the main drive behind such traffic. In this work we perform a measurement study of the content shared over the popular BitTorrent P2P file sharing network. We mathematically model the file size distributions of shared files after categorizing them into Audio, Video, Archive and CD image classes. For each of these categories we look into the most popular shared file formats and investigate their file size statistics. This provides an important milestone to building a realistic simulation framework for P2P systems, and for future analytical modeling of P2P networks.     

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.     

折线链节点标注技术

针对传统多边形位置关系计算比较烦琐,以及简单多边形的理论难以拓展到一般多边形的问题,提出标注节点状态的方法.通过定义11种位置来描述折线链上每个节点的状态,再采用"线段端点与线段"和"线段端点与邻折线"的标注方法来实现任意折线链的标注,同时利用两线段分割预处理使相交仅发生在端点处,从而使算法更高效;然后给出折线链基本位置关系的节点特征,并且探讨了三维顶点的标注方法.该方法的标注原理简单、方法实用,算法空间和时间复杂度分别为O(n)和O(n2).实验结果表明,该方法对任意形状的折线链都能实现稳定标注;通过搜索节点状态特征可以求解折线链间的相互关系,还可以实现一般折线链的碰撞检测、相交区域计算以及多边形简单化分解等.     

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

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