A method for transformation of engineering bill of materials to maintenance bill of materials

In order to solve the transformation problem of Bill of Materials (BOM) from engineering BOM to maintenance BOM for Maintenance, Repair and Overhaul (MRO) systems, a formal transformation model of BOM view is proposed. In this model, the intermediate component, inherited component, virtual component are defined in the specific maintenance management domain, and the transformation process from engineering BOM to maintenance BOM is discussed through feature recognition methods and rules. The proposed transformation model has been developed and deployed in an MRO system for a steel manufacturing enterprise.     

Detecting stable locality-aware predicates

In a large-scale locality-driven network such as in modular robotics and wireless sensor networks, knowing the state of a local area is sometimes necessary due to either interactions being local and driven by neighborhood proximity or the users being interested in the state of a certain region. We define locality-aware predicates (LAP) that aim at detecting a predicate within a specified area. We model the area of interest as the set of processes that are within a breadth-first search tree (BFST) of height k$k$ rooted at the initiator process. Although a locality-aware predicate specifies a predicate only within a local area, observing the area consistently requires considering the entire system in a consistent manner. This raises the challenge of making the complexities of the corresponding predicate detection algorithms scale-free, i.e., independent of the size of the system. Since all existing algorithms for getting a consistent view of the system require either a global snapshot of the entire system or vector clocks of the size of the system, a new solution is needed. We focus on stable LAP, which are those LAP that remain true once they become true. We propose a scale-free algorithm to detect stable LAP within a k$k$-height BFST. Our algorithm can detect both stable conjunctive LAP and stable relational LAP. In the process of designing our algorithm, we also propose the first distributed algorithm for building a BFST within an area of interest in a graph, and the first distributed algorithm for recording a consistent sub-cut within the area of interest. This paper demonstrates that LAPs are a natural fit for detecting distributed properties in large-scale distributed systems, and stable LAPs can be practically detected at low cost.     

Security-aware intermediate data placement strategy in scientific cloud workflows

Massive computation power and storage capacity of cloud computing systems allow scientists to deploy data-intensive applications without the infrastructure investment, where large application datasets can be stored in the cloud. Based on the pay-as-you-go model, data placement strategies have been developed to cost-effectively store large volumes of generated datasets in the scientific cloud workflows. As promising as it is, this paradigm also introduces many new challenges for data security when the users outsource sensitive data for sharing on the cloud servers, which are not within the same trusted domain as the data owners. This challenge is further complicated by the security constraints on the potential sensitive data for the scientific workflows in the cloud. To effectively address this problem, we propose a security-aware intermediate data placement strategy. First, we build a security overhead model to reasonably measure the security overheads incurred by the sensitive data. Second, we develop a data placement strategy to dynamically place the intermediate data for the scientific workflows. Finally, our experimental results show that our strategy can effectively improve the intermediate data security while ensuring the data transfer time during the execution of scientific workflows.     

基于ECT的高速数据采集系统设计

数据采集系统的速度制约了电容层析成像技术在航空发动机气路监测系统等高速设备中的应用。为此,设计了一种基于FPGA的新型电容数据采集系统,采用DDR2存储技术和PCI总线技术实现了数据的高速传输。同时应用卡尔曼滤波器代替传统的FIR滤波器,有效提高了滤波效率。测试结果表明,该系统具有抗干扰能力强、采样精度高、处理速度快等优点。     

一种多接口多信道VANET动态信道分配算法研究

为了合理地实现多接口多信道车载自组织网络（VANET）车辆节点间通信信道的动态分配,提出了一种基于通信双方车辆节点信道切换队列的动态信道分配算法。定义了车辆节点的射频接口状态,给出了信道的性能因子以及信道切换队列的生成方法,通过综合考虑通信双方车辆节点的射频接口状态和信道切换队列,快速自主地建立通信链路,从而解决了信道公平接入和分配不合理的问题。通过软件仿真比较可以看出,该算法实现了信道的动态分配,减小了平均端到端时延,增加了网络平均吞吐量,显著提高了多接口多信道VANET的网络性能。     

随机环境下带有私人信息的单机能力分配策略

本文研究随机环境下考虑私人信息的单机能力分配问题.该问题中各部门的单位产品收益、需求信息及加工设备各时段的能力为私人信息,且各时段中产品的加工时间为随机变量.本文采用设备方与各部门协商的方法对问题进行求解,首先利用随机规划理论将能力分配问题清晰化,然后利用拉格朗日松弛和泰勒级数展开方法进行协商机制设计,接着给出基于偏转次梯度方法的协商参数更新法则,最后综合上述过程给出最终的问题求解算法.数值算例验证了算法的有效性并分析了关键参数对能力分配结果的影响.     

多尺度空间特征提取的脊柱图像拼接算法

针对脊柱图像视野有限,提出一种基于优化MSFE的脊柱图像自动拼接算法。设计出一种基于尺度因子变化的高斯卷积模板尺寸自适应调整以及双向配对办法;相似性度量采用城市距离;利用RANSAC算法去除错配,从而确定待拼接图像之间的变换参数,最后利用加权平均对图像融合。对实际取得的多幅脊柱图像拼接结果表明该算法具有很好的实时性和鲁棒性。     

Efective Error-Tolerant Keyword Search for Secure Cloud Computing简

The existing solutions to keyword search in the cloud can be divided into two categories： searching on exact keywords and searching on error-tolerant keywords. An error-tolerant keyword search scheme permits to make searches on encrypted data with only an approximation of some keyword. The scheme is suitable to the case where users＇ searching input might not exactly match those pre-set keywords. In this paper, we first present a general framework for searching on error-tolerant keywords. Then we propose a concrete scheme, based on a fuzzy extractor, which is proved secure against an adaptive adversary under well-defined security definition. The scheme is suitable for all similarity metrics including Hamming distance, edit distance, and set difference. It does not require the user to construct or store anything in advance, other than the key used to calculate the trapdoor of keywords and the key to encrypt data documents. Thus, our scheme tremendously eases the users＇ burden. What is more, our scheme is able to transform the servers＇ searching for error-tolerant keywords on ciphertexts to the searching for exact keywords on plaintexts. The server can use any existing approaches of exact keywords search to search plaintexts on an index table.     

基于容差关系的不完备信息系统的属性约简

粗糙集理论是一种处理不确定性知识的有效工具,属性约简是其核心内容之一,然而对于属性值有缺省的不完备信息系统,基于等价关系的经典粗糙集理论已经不再适用。由于容差关系下的不完备信息系统的属性约简的定义与经典粗糙集的属性约简定义相似,可以用容差关系对粗糙集理论进行扩充。文中通过定义容差关系下的可辨识矩阵,运用可辨识方法,得到了一种属性约简算法;接着分析了算法的不足之处,并且在此基础上提出了增加约简效率的改进型算法;最后通过一个数值例子,说明了该算法是合理的和有效的。