声发射源特征识别的最新方法

介绍多传感器数据融合、时频能量模式分析及分析理论识别声发射源特征的方法，说明基于波形分析的现代信号处理技术是揭示声发射源及信号传播规律的重要手段。     

埋地管道常规防腐应用分析

对环氧粉末及3PE等防腐材料的特点进行了论述，对其存在的技术问题和人为因素进行了剖析，希望引起管道安装和管理部门对防腐技术的高度重视，保证我国的防腐市场健康向上。稳步发展。     

Distilled Collections from Textual Image Queries

We present a distillation algorithm which operates on a large, unstructured, and noisy collection of internet images returned from an online object query. We introduce the notion of a distilled set, which is a clean, coherent, and structured subset of inlier images. In addition, the object of interest is properly segmented out throughout the distilled set. Our approach is unsupervised, built on a novel clustering scheme, and solves the distillation and object segmentation problems simultaneously. In essence, instead of distilling the collection of images, we distill a collection of loosely cutout foreground “shapes”, which may or may not contain the queried object. Our key observation, which motivated our clustering scheme, is that outlier shapes are expected to be random in nature, whereas, inlier shapes, which do tightly enclose the object of interest, tend to be well supported by similar shapes captured in similar views. We analyze the commonalities among candidate foreground segments, without aiming to analyze their semantics, but simply by clustering similar shapes and considering only the most significant clusters representing non‐trivial shapes. We show that when tuned conservatively, our distillation algorithm is able to extract a near perfect subset of true inliers. Furthermore, we show that our technique scales well in the sense that the precision rate remains high, as the collection grows. We demonstrate the utility of our distillation results with a number of interesting graphics applications.     

一种分区域多方向数据融合图像插值方法

为满足高端工业检测中对检测精度和检测时间的严格要求,针对现有图像插值方法在插值速度与精度方面的矛盾,本文提出了一种分区域多方向数据融合图像插值方法。在灰度平坦区域,采用双线性插值算法进行插值。在边缘纹理区域,则选取待插值点在源图像中对应点的4×4邻域内4个插值方向上距离最近的12个像素点,基于距离平方反比计算估计值;然后结合方向灰度梯度和插值距离两个权 重因子,进行数据融合,获得最终插值。实验表明,新提出的插值方法运行速度快,并且在图像任意级别变换时都具有较高的插值精度,能够很好地保持图像的边缘纹理细节。     

利用两阶段遗传算法的机械手最优轨迹控制仿真

针对大多数机器人最优轨迹规划控制算法成本较高的问题,提出了一种两阶段分析-进化算法,分析算法基于间接开环最优控制问题,进化算法基于遗传算法。首先,利用遗传算法产生最优控制;然后,新的次优轨迹通过最优控制生成,计算每个最优解的成本函数,并为下一个步骤选择最优解做准备;最后,遗传算法使用获得的轨迹产生新一代起始点,迭代直到实现最小成本值。算法的验证由两个仿真系统组成:具有完整约束的两关节机械手和具有非完整约束的移动机械手。运用本文算法后,第一个仿真系统的成本降低了92.3%,第二个仿真系统获得的最优成本明显低于只使用最优控制时的成本,表明其算法可应用于实际机器人轨迹规划控制系统。     

Real-time congestion prediction for urban arterials using adaptive data-driven methods

Multimedia Tools and Applications - Congestion prediction can support traffic departments to take effective traffic management measures, and it aids users to adopt smarter trip strategies,...     

Privacy Preserving Geo-Linkage in the Big Urban Data Era

Big data technologies and a range of Government open data initiatives provide the basis for discovering new insights into cities; how they are planned, how they managed and the day-to-day challenges they face in health, transport and changing population profiles. The Australian Urban Research Infrastructure Network (AURIN – www.aurin.org.au) project is one example of such a big data initiative that is currently running across Australia. AURIN provides a single gateway providing online (live) programmatic access to over 2000 data sets from over 70 major and typically definitive data-driven organizations across federal and State government, across industry and across academia. However whilst open (public) data is useful to bring data-driven intelligence to cities, more often than not, it is the data that is not-publicly accessible that is essential to understand city challenges and needs. Such sensitive (unit-level) data has unique requirements on access and usage to meet the privacy and confidentiality demands of the associated organizations. In this paper we highlight a novel geo-privacy supporting solution implemented as part of the AURIN project that provides seamless and secure access to individual (unit-level) data from the Department of Health in Victoria. We illustrate this solution across a range of typical city challenges in localized contexts around Melbourne. We show how unit level data can be combined with other data in a privacy-protecting manner. Unlike other secure data access and usage solutions that have been developed/deployed, the AURIN solution allows any researcher to access and use the data in a manner that meets all of the associated privacy and confidentiality concerns, without obliging them to obtain ethical approval or any other hurdles that are normally put in place on access to and use of sensitive data. This provides a paradigm shift in secure access to sensitive data with geospatial content.     

基于灰关联混合蛙跳算法的雷达波形设计

提出了一种基于灰关联混合蛙跳算法的雷达波形设计方法,以混合蛙跳算法为主体,在局部更 新算子中引入遗传算法的遗传算子,并改进原始蛙跳算法的分组方法,丰富了种群的多样性,同时引入灰关联综合评价法则对适应度函数值加以关联度分析。文中以设计具有低自相关旁瓣和互相关特性的正交多相编码为例,将该算法用于雷达波形设计中。仿真结果表明使用本文算法产生 的波形具备较好的低自相关特性和互相关特性,表明了该算法是有效和可行的。     

A QoE-based jointly subcarrier and power allocation for multiuser multiservice networks在多业务多用户网络场景下的基于QoE的联合子载波和功率资源分配

Quality of experience (QoE) is widely applied to reflect user’s satisfaction of the network service, which exactly conforms to the user-centric concept in 5G. In this paper, we propose a QoE-based subcarrier and power allocation algorithm for the downlink transmission of a multiuser multiservice system. For the subcarrier allocation algorithm, the rate proportional fairness factor is defined to ensure the fairness between users. Based on different QoE models of three services, i.e., file down (FD), video streaming and voice over internet protocol (VOIP), a multi-objective optimization method is exploited to allocate the power resource by minimizing the total power consumption and maximizing the mean opinion score (MOS) value of users simultaneously. Simulation results indicate that the proposed algorithm has less power consumption and higher QoE performance than the traditional proportional fairness (PF) algorithm. In addition, the proposed algorithm can achieve nearly the same fairness performance as the PF algorithm. Moreover, when the number of subcarriers becomes larger, the power assumption will be less but with little influence on both the QoE and fairness performances.     

Biclique cryptanalysis using balanced complete bipartite subgraphs

Dear editor,At Asiacrypt 2011,Bogdanov et al.[1]formally defined the biclique cryptanalysis method and proposed the first key recovery attack on full-round AES faster than exhaustible search in single-key model.The basic idea underlying the biclique cryptanalysis is to determine two independent(or interleaving)differential paths in the forward and the backward direction to construct a biclique for a