自动信任协商中一种最小信任披露策略

自动信任协商是通过逐渐请求和披露数字证书在两个陌生实体间建立相互信任的方法。当前对自动信任协商协商策略的研究,往往存在很多问题。文章提出了一种基于期望因子的自动信任协商模型,该模型采用MCD策略,通过分析各信任证书的期望因子,当可能的协商存在时,它能披露和请求最小的信任证找到一条成功的协商路径,当协商不可能成功时,尽快的发现并终止它。它能保证在协商的过程中没有不相关的信任证被披露并且不需要暴露双方的访问控制策略,同时通过实验证了明MCD策略是完备的。     

Fuzzy local maximal marginal embedding for feature extraction

In graph-based linear dimensionality reduction algorithms, it is crucial to construct a neighbor graph that can correctly reflect the relationship between samples. This paper presents an improved algorithm called fuzzy local maximal marginal embedding (FLMME) for linear dimensionality reduction. Significantly differing from the existing graph-based algorithms is that two novel fuzzy gradual graphs are constructed in FLMME, which help to pull the near neighbor samples in same class nearer and nearer and repel the far neighbor samples of margin between different classes farther and farther when they are projected to feature subspace. Through the fuzzy gradual graphs, FLMME algorithm has lower sensitivities to the sample variations caused by varying illumination, expression, viewing conditions and shapes. The proposed FLMME algorithm is evaluated through experiments by using the WINE database, the Yale and ORL face image databases and the USPS handwriting digital databases. The results show that the FLMME outperforms PCA, LDA, LPP and local maximal marginal embedding.     

提升细节捕捉能力的非下采样轮廓波变换

针对传统NSCT(非下采样轮廓波变换)算法中NSP(多尺度分解方法)对细节信息捕捉能力较差及利用其进行图像融合得到的融合图像出现细节丢失问题,提出改进的NSCT算法。不同于传统NSCT算法,该算法首先采用细节捕捉能力较强的非下采样形态学小波分解替代NSP分解,实现对源图像的多尺度分解,将源图像分解成水平高频、垂直高频、对角高频和低频4部分;然后利用NDFB(非下采样的方向性滤波器)对高频部分进行多方向分解得到一系列高频信息,实现改进型NSCT分解。实验结果表明,该算法的细节捕捉能力较传统算法好,在相同融合规则下其图像融合效果更好,各项融合指标值均有所提高,其中平均梯度提高了10%,且易于实现,可广泛用于多分辨率图像融合,是一种有效的融合图像算法。     

基于模糊PID控制的数字溢流阀的建模与仿真

研究数字溢流阀系统性能优化问题,由于系统存在非线性,造成响应特性差。传统控制器参数整定后无法根据工况的变化调整,造成数字溢流阀响应速度慢。针对上述问题,为改善数字溢流阀的性能,提出一种自适应模糊PID控制的数字溢流阀,利用模糊推理的方法,在线调整PID控制器参数,以适应工况的变化,达到较好的控制效果。通过仿真表明,自适应模糊PID控制的数字溢流阀响应速度快、控制精度高,工作稳定。可作为实现高性能数字溢流阀的一种有效方案。     

强隐私保护的移动群智感知方案

为了实现移动群智感知系统中身份隐私、证书撤销和积分激励功能,同时解决恶意用户身份追踪与诚实用户隐私保护之间的矛盾,提出了强隐私保护的移动群智感知方案.基于门限密码思想将身份追踪能力分散到多个实体上,使得多个追踪者合作才能追踪用户身份;将Pointcheval-Sanders签名和基于RSA假设的Camenisch-Lysyanskaya累加器结合起来实现了证书的安全快速撤销;利用Pointcheval-Sanders签名构造了保护隐私的积分激励机制.对该方案进行了安全性分析和实验分析.研究结果表明,该方案不仅满足安全要求,而且在实际应用中具有可行性.     

基于矢量拟合法的永磁同步电机EMI模型

电动汽车中永磁同步电机常采用星型联结,因此建立星型联结的永磁同步电机高频阻抗模型是有必要的。首先,采用常见的电机EMI模型（π型）作为星型联结的永磁同步电机EMI模型,使用矢量拟合法推导电机EMI模型等效电路的阶数。在20 Hz~30 MHz范围内,永磁同步电机π型EMI模型的等效电路需要225个储能元件,为了降低电机EMI模型等效电路的复杂性,进一步分析了Γ型阻抗模型和反Γ型阻抗模型,将星型联结的永磁同步电机EMI模型的等效电路储能元件数降到56个。通过对比3种阻抗模型的端口阻抗特性,验证EMI模型优化方法的可行性。将电机EMI模型的等效电路代入电机驱动EMI仿真系统中进行时域仿真,仿真时域波形经EMI接收机模型处理得到噪声频谱。在150 kHz~30 MHz频率范围内,电动机驱动系统EMI接收机测试结果与仿真结果基本一致。     

基于能量谱相似度自适应聚类的配电网接地故障区段定位方法

分析谐振接地系统发生单相接地故障时各区段故障暂态零序电流的相似性特征,提出基于故障暂态零序电流Hilbert瞬时能量谱相似性自适应仿射传播聚类(adAP)的故障区段定位方法.所提方法对故障后首半个工频周期的故障线路各区段的故障暂态零序电流进行局部特征尺度分解(LCD),对得到的各频带波形进行Hilbert变换得到Hilbert瞬时能量谱.计算Hilbert瞬时能量谱两两间的动态时间弯曲距离,对动态时间弯曲距离构成的相似度矩阵进行adAP,根据Silhouette指标最高的聚类情况定位故障区段.在电弧故障、存在分布式消弧线圈系统、不同消弧线圈补偿度系统、噪声干扰、两点接地、采样不同步的场景下的仿真结果和现场数据验证结果表明,所提方法能克服工程应用中可能存在的影响,鲁棒性好、准确度高.     

基于时空特性以及需求响应的DG和EV充电站多目标优化配置

针对可再生分布式电源(DG)及电动汽车(EV)大规模接入给配电网带来的用电量增长以及电压波动问题,提出一种基于时空特性以及需求响应的DG和EV充电站多目标协调优化配置方法.通过提取城市路网的拓扑结构,监测路网流量,基于交通规划软件TransCAD进行起讫点(OD)矩阵反推,构建出行概率矩阵以描述用户的出行特性;基于蒙特卡洛方法模拟EV的时空分布特性,考虑EV、DG与常规负荷的时序特性,并基于改进K-means算法构建风-光-负荷的典型运行场景;兼顾电网侧与用户侧,以综合效益、系统负荷波动以及充电耗时成本为目标,构建DG和EV充电站的多目标联合配置模型,并采用改进粒子群优化算法进行求解.结合IEEE 33节点配电网与某城区主干道路网模型进行仿真分析,结果验证了所建模型的有效性与可行性.     

Greedy-search-based multi-objective genetic algorithm for emergency logistics scheduling

To enable the immediate and efficient dispatch of relief to victims of disaster, this study proposes a greedy-search-based, multi-objective, genetic algorithm capable of regulating the distribution of available resources and automatically generating a variety of feasible emergency logistics schedules for decision-makers. The proposed algorithm dynamically adjusts distribution schedules from various supply points according to the requirements at demand points in order to minimize unsatisfied demand for resources, time to delivery, and transportation costs. The proposed algorithm was applied to the case of the Chi–Chi earthquake in Taiwan to verify its performance. Simulation results demonstrate that under conditions of a limited/unlimited number of available vehicles, the proposed algorithm outperforms the MOGA and standard greedy algorithm in ‘time to delivery’ by an average of 63.57% and 46.15%, respectively, based on 10,000 iterations.     

Aligning principal and agent’s incentives: A principal–agent perspective of social networking sites

The viability of networked communities depends on the creation and disclosure of user-generated content and the frequency of user visitation (Facebook 10-K Annual Report, 2012). However, little is known about how to align the interests of user and social networking sites. In this study, we draw upon the principal-agent perspective to extend Pavlou et al.’s uncertainty mitigation model of online exchange relationships (2007) and propose an empirically tested model for aligning the incentives of the principal (user) and the agent (service provider). As suggested by Pavlou et al., we incorporated a multi-dimensional measure of trust: trust of provider and trust of members. The proposed model is empirically tested with survey data from 305 adults aged 20-55. The results support our model, delineating how real individuals with bounded rationality actually make decision about information disclosure under uncertainty in the social networking site context. There is show little to no relationship between online privacy concerns and information disclosure on online social network sites. Perceived benefits provide the linkage between the incentives of principal (user) and agent (provider) while usage intensity demonstrated the most significant impact on information disclosure. We argue that the phenomenon may be explained through Communication Privacy Management Theory. The present study enhances our understanding of agency theory and human judgment theory in the context of social media. Practical implications for understanding and facilitating online social exchange relationships are also discussed.