基于C的湿度传感器校准平台设计

针对大量湿度传感器出厂或使用前需要定标或进行误差补偿的技术需求,基于C语言和SQL数据库技术,构建了一种采用传感器融合算法的大批量湿度传感器数据自校准平台;首先通过饱和盐溶液构建标准湿度环境,然后通过MT4080D数字电桥对待校准湿度传感器进行多次测量,之后把测量值矩阵和标准值导入基于最小二乘和加权融合算法的平台进行处理,得到不同固定点湿度环境下传感器标定和补偿的校准数据;该设计实现了操作简单,成本低廉,响应时间短,运算速度快的湿度传感器的软件校准算法平台,具有一定实际应用价值.     

多属性群决策在项目风险评价中的应用

工程项目的风险因素多,项目风险评价工作比较复杂.基于有序加权平均算子(0WA算子)和加权算术平均算子(CWAA算子)的多属性群决策,整合两种加权算子在纵向和横向集结的优点,对工程项目的风险值进行纵向与横向集结,可以比较有效地消除决策者主观因素的影响,并增加中间值的作用,使工程项目风险综合评价更加科学、合理.实例分析验证了该方法的可行性与有效性.     

防止路径攻击的加权社会网络匿名化技术

随着社会网络的普及,社会网络数据的隐私保护问题,已经成为数据隐私研究领域学者普遍关注的热点问题。由于隐私信息异常广泛,攻击者可以利用多种背景知识进行隐私攻击。现有的隐私保护技术,大多针对简单社会网络,并不适用于加权社会网络。对加权社会网络中的路径隐私泄露问题进行了研究,针对最短路径识别提出了加权图k-可能路径匿名（k-possible path anonymity,KPPA）隐私保护模型,来防止基于加权社会网络的最短路径隐私攻击,设计了一种基于权重泛化的匿名方法来实现KPPA算法。通过在真实数据集上的大量测试研究,证明了KPPA算法对于加权图路径隐私保护的有效性,同时基于KPPA算法可以保留原图结构性质,提高权重信息的可用性。     

基于邻域粗糙集的加权KNN肿瘤基因表达谱分类算法

肿瘤亚型的准确判别对肿瘤的治疗具有重要意义,对肿瘤的不同亚型进行准确判别是当前生物信息学研究的重要课题．本文首先利用Relief算法排序基因并选出初始的肿瘤信息基因子集,然后利用向基于邻域粗糙集模型的向前属性约减算法FARNeM来计算加权基因集合,最后用加权KNN算法对肿瘤对这些数据进行分析,从而发现有差异的基因表达。实验结果表明了上述方法的可行性和有效性。     

无线传感器网络自适应声音目标定位算法

基于声音能量的无线传感器网络目标定位算法因简单易行而受到广泛的关注。传统算法未考虑环境对衰减因子的影响,定位精度较差;提出一套辨识衰减因子的方案,并针对不同环境自适应改变衰减因子以优化加权质心算法的权重,设计了一种自适应加权质心定位算法。实验结果表明,本文算法较之传统加权质心定位算法大幅度提高了定位精度,且适用于更复杂的场景中。     

Face recognition using adaptively weighted patch PZM array from a single exemplar image per person

Though numerous approaches have been proposed for face recognition, little attention is given to the moment-based face recognition techniques. In this paper we propose a novel face recognition approach based on adaptively weighted patch pseudo Zernike moment array (AWPPZMA) when only one exemplar image per person is available. In this approach, a face image is represented as an array of patch pseudo Zernike moments (PPZM) extracted from a partitioned face image containing moment information of local areas instead of global information of a face. An adaptively weighting scheme is used to assign proper weights to each PPZM to adjust the contribution of each local area of a face in terms of the quantity of identity information that a patch contains and the likelihood of a patch is occluded. An extensive experimental investigation is conducted using AR and Yale face databases covering face recognition under controlled/ideal conditions, different illumination conditions, different facial expressions and partial occlusion. The system performance is compared with the performance of four benchmark approaches. The encouraging experimental results demonstrate that moments can be used for face recognition and patch-based moment array provides a novel way for face representation and recognition in single model databases.     

先验知识与基于核函数的回归方法的融合

In some sample based regression tasks, the observed samples are quite few or not informative enough. As a result, the conflict between the number of samples and the model complexity emerges, and the regression method will confront the dilemma whether to choose a complex model or not. Incorporating the prior knowledge is a potential solution for this dilemma. In this paper, a sort of the prior knowledge is investigated and a novel method to incorporate it into the kernel based regression scheme is proposed. The proposed prior knowledge based kernel regression (PKBKR) method includes two subproblems: representing the prior knowledge in the function space, and combining this representation and the training samples to obtain the regression function. A greedy algorithm for the representing step and a weighted loss function for the incorporation step are proposed. Finally, experiments are performed to validate the proposed PKBKR method, wherein the results show that the proposed method can achieve relatively high regression performance with appropriate model complexity, especially when the number of samples is small or the observation noise is large.     

赋权图上优化问题的DNA计算方法研究(英文)

对赋权图上经典优化问题的DNA计算方法进行探讨,改进原有DNA计算模型中的权值编码方法,提出一些新的DNA编码方法及DNA算法．具体地说,通过设计赋权无向图的相对长度图给出了旅行商问题的一种相对长度DNA编码方法及DNA算法,通过设计赋权无向图的广义边图给出了中国邮递员问题的一种广义边图DNA编码方法及DNA算法,通过选取DNA序列的最佳逆补比对给出了最小生成树问题的一种基于逆补比对的DNA编码方法及DNA算法,通过设计从顶点覆盖问题到Hamilton回路问题的一种改进多项式变换给出了顶点覆盖问题的一种基于多项式变换的DNA编码方法及DNA算法．所设计的DNA计算方法提高了DNA计算中表示数值和处理数值的能力．     

Single-machine scheduling with deteriorating jobs under a series–parallel graph constraint

This paper considers single-machine scheduling problems with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. In addition, the jobs are related by a series–parallel graph. It is shown that for the general linear problem to minimize the makespan, polynomial algorithms exist. It is also shown that for the proportional linear problem of minimization of the total weighted completion time, polynomial algorithms exist, too.     

The influence of dispositions and Internet motivation on online communication satisfaction and relationship closeness

Guided by the Uses and Gratifications (U&G) perspective, this study examined the influence of unwillingness to communicate, loneliness, Internet-use motives, and Internet (CMC) use and interaction (amount and types of use and self-disclosure) in online communication satisfaction and online relationship closeness. There were 261 participants in this study. Overall, participants who perceived their face-to-face communication to be rewarding, used CMC for self-fulfillment, and disclosed their personal feelings to others tended to feel close to their online partners. Moreover, those who used the Internet for purposes of self-fulfillment and affection and intended to disclose their feelings to others felt satisfied with their online communication. The associations among the constructs extend our knowledge of the U&G theoretical model, how and why people communicate interpersonally in CMC settings, and the influence of individual differences on CMC for relational communication.