多目标优化理论在蜂窝夹芯结构设计中的应用

在确定了设计变量及目标函数的基础上,根据结构本身的要求,推导出用于多目标优化的5个约束条件.根据多目标优化理论,采用乘除法对蜂窝夹芯结构进行了评价函数的构造,并用VC语言编制了钢质蜂窝夹芯减振板结构的优化程序,该程序可实现结构尺寸及性能的优化,并计算出各目标函数的最终值.     

激光快速成形Rene′88DT高温合金的时效强化研究

研究了时效时间对激光快速成形后时效硬化镍基高温合金Rene′88DT中沉淀相组织演化和力学性能的影响。发现随时效时间的增加，沉淀相y’略有长大，颗粒之间发生大颗粒吞噬小颗粒的粗化，时效40h后沉淀相颗粒粗化明显。对经不同时间时效后的激光快速成形Rene′88DT试样进行了硬度测试。结果显示，在时效时间为28h时，硬度有一峰值HRC49。在此基础上，采用1165℃，2h固溶、空冷＋760℃，28h时效的热处理工艺对激光快速成形标准拉伸棒样进行了热处理，拉伸结果显示成形件的抗拉强度较激光沉积态提高了400MPa，屈服强度接近同种材料的粉末锻造水平。     

Camouflage texture evaluation using a saliency map

Multimedia Systems - Camouflage effect evaluation and examination is an important procedure in digital camouflage pattern design as it is helpful in improving the objectivity and effectiveness...     

基于逻辑回归模型的木片和树皮的图像识别

为了提高木片生物能的利用率,需要除去木片中的树皮杂质。识别木片和树皮的图像对于实现二者分离具有重要作用。提出一种基于逻辑回归模型来对木片和树皮进行图像识别的算法。算法流程包括计算各种可以描述木片和树皮纹理的参数,利用SAS统计分析出最佳参数,将最佳参数计算所得的样本数据用于SAS LOGISTIC过程得到预测方程,再将预测方程用于逻辑回归模型来实现木片和树皮的图像识别。通过实验可知,最佳参数为灰度方差,该图像识别算法的正确率能达到97.4%。     

Bounds on multipartite concurrence and tangle

We present an analytical lower bound of multipartite concurrence based on the generalized Bloch representations of density matrices. It is shown that the lower bound can be used as an effective entanglement witness of genuine multipartite entanglement. Tight lower and upper bounds for multipartite tangles are also derived. Since the lower bounds depend on just part of the correlation tensors, the result is experimentally feasible.     

Recover Fault Services via Complex Service-to-Node Mappings in Wireless Sensor Networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level.