Exploring thermal spray gray alumina coating pore network architecture by combining stereological protocols and impedance electrochemical spectroscopy

Complex multiscale pore network architecture characterized by multimodal pore size distribution and connectivity develops during the manufacture of ceramic thermal spray coatings from intra- and interlamellar cracks generated when each lamella spreads and solidifies to globular pores resulting from lamella stacking defects. This network significantly affects the coating properties and their in-service behaviors. De Hoff stereological analysis permits quantification of the three-dimensional (3D) distribution of spheroids (i.e., pores) from the determination of their two-dimensional (2D) distribution estimated by image analysis when analyzing the coating structure from a polished plane. Electrochemical impedance spectroscopy electrochemically examines a material surface by frequency variable current and potential and analyzes the complex impedance. When a coating covers the material surface, the electrolyte percolates through the more or less connected pore network to locally passivate the substrate. The resistive and capacitive characteristics of the equivalent electrical circuit will depend upon the connected pore network architecture. Both protocols were implemented to quantify thermal spray coating structures. Al₂O₃-13TiO₂ coatings were atmospherically plasma sprayed using several sets of power parameters, are current intensity, plasma gas total flow rate, and plasma gas composition in order to determine their effects on pore network architecture. Particle characteristics upon impact, especially their related dimensionless numbers, such as Reynolds, Weber, and Sommerfeld criteria, were also determined. Analyses permitted identification of (a) the major effects of power parameters upon pore architecture and (b) the related formation mechanisms. This article was originally published inBuilding on 100 Years of Success, Proceedings of the 2006 International Thermal Spray Conference (Seattle, WA), May 15–18, 2006, B.R. Marple, M.M. Hyland, Y.-Ch. Lau, R.S. Lima, and J. Voyer, Ed., ASM International, Materials Park, OH, 2006.     

基于动态权限集的Android强制访问控制模型

针对Android存在的特权提升攻击问题,提出了基于动态权限集的Android强制访问控制模型DP_ManDroid。该模型首先分析强连通分支的权限分布特性,构建动态的权限集划分;然后在信息流与权限集耦合的基础上,抽象权限提升路径;最后提出线性时间的访问控制算法,并通过动态追踪权限集,实现了细粒度的决策控制。与现有 安全模型的对比,以及在原型系统上的仿真结果表明,所提出的安全模型很好地抵御了特权提升攻击,同时降低了时间复杂度。     

基于地址-事件表示的高速二值连通域标记方法

为提高二值连通域标记的速度,将地址-事件表示AER（Address Event Representation）思想引入到二值图像处理,提出了一种基于事件对等价标号的二值连通域标记方法。该算法无需多次遍历图像中的背景点和冗余目标点,首先将待标记的连通域以AER“事件对”的方式编码保存,通过“事件对”的遍历生成临时标号和等价标记表;然后根据等价表修改临时标号;完成标号映射后最终实现连通域标记。整个算法只处理极低冗余的事件信息,避免了对全图像素的重复扫描与处理。实验结果表明,图像以AER“事件对”方式存储,数据量仅为全帧图像的10%~35%,有较高的压缩比;且该算法速度快,可达到了传统基于等价标号算法的1.5~8倍。     

一种基于反向CDS树的异构WSNs拓扑构建方法

在无线传感器网络中,拓扑控制是节约能源、延长生命周期的一项关键技术。现有拓扑控制方法的研究主要集中在同构网络,对此,面向异构网络提出了一种低信息复杂度的基于反向连通支配集树的分布式拓扑构建算法。基于最小连通支配集构建虚拟骨干树,改进了A3G算法中节点的适应度函数和算法流程,优化了产生的连通支配集的规模和通信开销,进一步降低信息复杂度,在保证连通性的同时关闭网络冗余节点以降低能耗。理论分析和仿真实验证明,算法能够以较小的时间和通信代价构建拓扑,延长网络生命周期。     

Semi‐global output consensus of a group of linear systems in the presence of external disturbances and actuator saturation: An output regulation approach

This paper studies the problem of semi‐global leader‐following output consensus of a multi‐agent system. The output of each follower agent in the system, described by a same general linear system subject to external disturbances and actuator saturation, is to track the output of the leader, described by a linear system, which also generates disturbances as the exosystem does in the classical output regulation problem. Conditions on the agent dynamics are identified, under which a low‐gain feedback‐based linear state‐control algorithm is constructed for each follower agent such that the output consensus is achieved when the communication topology among the agents is a digraph containing no loop, and the leader is reachable from any follower agent. We also extend the results to the non‐identical disturbance case. In this case, conditions based on both the agent dynamics and the communication topology are identified, under which a low‐gain feedback‐based linear state‐control algorithm is constructed for each follower agent such that the leader‐following output consensus is achieved when the communication topology among the follower agents is a strongly connected and detailed balanced digraph, and the leader is a neighbor of at least one follower. In addition, under some further conditions on the agent dynamics, the control algorithm is adapted so as to achieve semi‐global leader‐following output consensus for a jointly connected undirected graph and the leader reachable from at least one follower. Copyright © 2015 John Wiley & Sons, Ltd.     

Frequent Interaction and Fast Feedback Predict Perceived Social Support: Using Crawled and Self‐Reported Data of Facebook Users

The present study examines if Facebooking can contribute to psychological well‐being and if so, which aspects of Facebook use could play a significant role. Matching crawled data with self‐reported data from mobile Facebook users, we found that more social interactions with Facebook friends and faster friends' reactions to a user's post contributed toFacebook user's perceived social support and ultimately alleviated loneliness. We also found that the association between frequency as well as speed of Facebook social interactions and psychological well‐being were more significant among those who were sensitive to other's behaviors and feelings than those who were not. The theoretical and practical implications of the findings, particularly regarding mobile communication context, are also discussed.     

一种高效强K—栅栏覆盖构建算法

K－栅栏覆盖是无线传感器网络覆盖控制的研究热点之一。本文构建了强栅栏覆盖模型,提出了分区强K－栅栏覆盖构建算法PMNSB,用最少的节点形成强栅栏。首先把监控区域分成多个子区域,通过匈牙利算法选用移动距离之和最少的网格集合为基准1－栅栏覆盖,缺少移动节点的子区域,选择附近区域的剩余移动节点修补形成1－栅栏覆盖。水平相邻的两个子区域之间构建竖直栅栏,这些1－栅栏合起来构成强K－栅栏覆盖。仿真结果证明了该方法的有效性,本文的研究对提升无线传感器网络的性能具有重要的理论与实际意义。     

基于大规模MIMO网络的低复杂度块对角化算法

在多用户MIMO系统下行链路中,块对角化（Block diagonalization, BD）预编 码算法的和速率性能要优于匹配滤波算法（Matched filter, MF）和迫零算法（Zero forc i ng, ZF）。然而,传统的BD算法利用矩阵分解来构造除当前用户的其他所有用户信道的零空 间,需要O(N2)浮点运算次数（Float point operations, FLOPs）。当 基站的天线数N趋向于大规模时,BD算法计算复杂度巨大。本文 提出一种基于投影子方法构造其他用户合成信道的零空间的BD算法,该算法仅需O( N)FLOPs。仿真表明：同传统的BD算法相比,本文所提出的低复杂度BD算法显著地降低 了实现复杂度,而和速率性能损失微小,仍然优于MF和ZF,并且当N趋 向于大规模时,它的和速率性能趋向于传统的BD算法和SVD算法。     

一种可验证的多候选人电子投票方案

电子投票相对传统投票具有安全、便捷、低成本的优势,近年来得到了广泛的关注。2012年孙培勇等人提出了基于多方求和的多候选人电子投票方案。经分析发现该方案不满足可验证性,给出了一种具有可验证性的多候选人电子投票方案,保证计票结果的不可欺骗性。     

Alternative branching rules for some nonconvex problems

Following Linderoth (A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, Math. Program. 103 (2005), pp. 251–282), in this paper we show how a preliminary theoretical analysis about the quality of convex and concave envelopes over different regions may suggest branching rules alternative to the traditional ones based on boxes. For two nonconvex problems (minimization of the sum of products of affine functions and maximization of the sum of ratios of affine functions, in both cases over polytopes), we show how the indications of the theoretical analysis lead to computational results which confirm the superiority of the alternative branching rules with respect to those based on boxes.