Thermoelastic evaluation of composite laminates using digital imaging processing

The study of the variation of the curvature of non-symmetric composite laminates with temperature provides a measure of the magnitude of the thermal stresses and the mechanical behavior of the material with temperature. In the present work, an experimental method based on the pioneer use of a digital camera and image processing method is proposed to perform such measurements. Taking advantage of the method and by comparing experimental and CLT, extended-CLT and FEM simulation results, an evaluation of the residual stresses is described and an approach providing more precise determination of the residual thermal stresses in non-symmetric laminates is proposed.     

基于贝叶斯正则化神经网络虚拟企业敏捷性评价

高敏捷性是虚拟企业适应不断变化的市场必备的素质,如何对它进行准确评价是虚拟企业运行中的重要问题,针对此问题先对虚拟企业及其盟员敏捷性之间的关系分析,然后提出在已知虚拟企业盟员敏捷性的基础上用贝叶斯正则化神经网络来计算虚拟企业的敏捷性,最后通过仿真试验测试了该方法的可行性。实验结果证明与非正则化神经网络相比,贝叶斯正则化神经网络的泛化能力强,评价数据结果稳定。该方法可用于各种规模的虚拟企业评价。     

云应用程序编程接口安全研究综述:威胁与防护

云时代,云应用程序编程接口(API)是服务交付、能力复制和数据输出的最佳载体。然而,云API在开放服务和数据的同时,增加了暴露面和攻击面,攻击者通过数据劫持和流量分析等技术获取目标云API的关键资源,能够识别用户的身份和行为,甚至直接造成背后系统的瘫痪。当前,针对云API的攻击类型繁多,威胁与防护方法各异,缺乏对现有攻击和防护方法的系统总结。该文梳理了云API安全研究中云API面临的威胁和防护方法,分析了云API的演化历程和类别划分;讨论了云API的脆弱性以及云API安全研究的重要性;提出了云API安全研究框架,涵盖身份验证、云API分布式拒绝服务(DDoS)攻击防护、重放攻击防护、中间人(MITM)攻击防护、注入攻击防护和敏感数据防护6个方面相关研究工作综述。在此基础上,探讨了增加人工智能(AI)防护的必要性。最后给出了云API防护的未来挑战和发展趋势。     

多维注意力特征聚合立体匹配算法

现有基于深度学习的立体匹配算法在学习推理过程中缺乏有效信息交互, 而特征提取和代价聚合两个子模块的特征维度存在差异, 导致注意力方法在立体匹配网络中应用较少、方式单一. 针对上述问题, 本文提出了一种多维注意力特征聚合立体匹配算法. 设计2D注意力残差模块, 通过在原始残差网络中引入无降维自适应2D注意力残差单元, 局部跨通道交互并提取显著信息, 为匹配代价计算提供丰富有效的特征. 构建3D注意力沙漏聚合模块, 以堆叠沙漏结构为骨干设计3D注意力沙漏单元, 捕获多尺度几何上下文信息, 进一步扩展多维注意力机制, 自适应聚合和重新校准来自不同网络深度的代价体. 在三大标准数据集上进行评估, 并与相关算法对比, 实验结果表明所提算法具有更高的预测视差精度, 且在无遮挡的显著对象上效果更佳.     

基于多尺度特征结合细节恢复的单幅图像去雾方法

为提高单幅图像去雾方法的准确性及其去雾结果的细节可见性,该文提出一种基于多尺度特征结合细节恢复的单幅图像去雾方法。首先,根据雾在图像中的分布特性及成像原理,设计多尺度特征提取模块及多尺度特征融合模块,从而有效提取有雾图像中与雾相关的多尺度特征并进行非线性加权融合。其次,构造基于所设计多尺度特征提取模块和多尺度特征融合模块的端到端去雾网络,并利用该网络获得初步去雾结果。再次,构造基于图像分块的细节恢复网络以提取细节信息。最后,将细节恢复网络提取出的细节信息与去雾网络得到的初步去雾结果融合得到最终清晰的去雾图像,实现对去雾后图像视觉效果的增强。实验结果表明,与已有代表性的图像去雾方法相比,所提方法能够对合成图像及真实图像中的雾进行有效去除,且去雾结果细节信息保留完整。     

基于QoS的Web服务发现方法

由于传统的基于关键字和简单分类的Web服务发现机制较少考虑服务质量(QoS),因此不能很好地满足用户的需求。针对该问题,提出一种基于QoS的Web服务发现模型,通过引入QoS代理机制以支持基于QoS的Web服务发布与发现。在此基础上,根据不同用户的QoS需求,提出一种基于QoS的Web服务发现算法。实验结果表明,该算法具有较高的准确率。     

Interference aware resource allocation for hybrid hierarchical wireless networks

This paper addresses the problem of interference aware resource allocation for OFDMA based hybrid hierarchical wireless networks. We develop two resource allocation algorithms considering the impact of wireless interference constraints using a weighted SINR conflict graph to quantify the interference among the various nodes: (1) interference aware routing using maximum concurrent flow optimization; and (2) rate adaptive joint subcarrier and power allocation algorithm under interference and QoS constraints. We exploit spatial reuse to allocate subcarriers in the network and show that an intelligent reuse of resources can improve throughput while mitigating interference. We provide a sub-optimal heuristic to solve the rate adaptive resource allocation problem. We demonstrate that aggressive spatial reuse and fine tuned-interference modeling garner advantages in terms of throughput, end-to-end delay and power distribution.     

Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks

Wireless sensor and actor networks (WSANs) have recently emerged with the idea of combining wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. This requires that the actors should be placed carefully prior to network operation in order to maximize the coverage and maintain the inter-actor connectivity. In this paper, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. The approach applies repelling forces between neighboring actors and from the sensors that sit on the boundaries in order to spread them in the region. The spreading of the nodes is done using a tree of actors which can provide more freedom for the movement of the nodes but at the same time maintain the required connectivity among the nodes. We present two techniques for creation of such an actor tree which are based on local pruning of the actor links and spanning tree of the inter-actor network. The performance of our approach is validated both analytically and experimentally.     

A transmission window technique for CAN networks

The Controller Area Network (CAN) has become a de-facto communication protocol in automation systems over the last three decades. Some CAN networks now employ TDMA-based communication in order to help meet real-time constraints. Whilst this form of media access control brings several timeliness benefits, studies have also illustrated negative effects on transmission reliability; duplicated message instances can help to increase this reliability. In this paper a transmission window technique for CAN is proposed. A bounded amount of re-transmission is allowed for each message within this window, which can in many cases provides increased reliability in the presence of errors or bursts of errors. A probabilistic analysis of transmission windows is presented and used to develop a simple algorithm for calculating the optimal window size to achieve a specified statistical guarantee of message delivery. Stochastic simulations along with computational and empirical results are presented which validate the analysis, and indicate that in many circumstances the technique can potentially reduce the amount of bandwidth needed for specified reliability levels when compared to the use of message duplicates. Suggestions are also made to help increase the reliability of message duplications in error burst environments.