The Effects of Survey Administration on Disclosure Rates to Sensitive Items Among Men: A Comparison of an Internet Panel Sample with a RDD Telephone Sample

Research using Internet surveys is an emerging field, yet research on the legitimacy of using Internet studies, particularly those targeting sensitive topics, remains under-investigated. The current study builds on the existing literature by exploring the demographic differences between Internet panel and RDD telephone survey samples, as well as differences in responses with regard to experiences of intimate partner violence perpetration and victimization, alcohol and substance use/abuse, PTSD symptomatology, and social support. Analyses indicated that after controlling for demographic differences, there were few differences between the samples in their disclosure of sensitive information, and that the online sample was more socially isolated than the phone sample. Results are discussed in terms of their implications for using Internet samples in research on sensitive topics.     

基于工作岗位的Linux课程教学体系构建与实践

Linux课程是高职计算机网络类专业的一门专业课程,具有较强的理论性和实践性。如何使学生既能掌握Linux的基本概念和基本技能,又能熟练的应用与实际工作,教学体系的构建至关重要。高职院校是培养应用型人才的基地,必须改革传统的教学体系,构建基于工作岗位的课程教学体系,培养高水平的Linux应用型人才。     

论信息素养在研究生培养过程中的作用和地位

面对信息时代的严峻挑战,培养研究生信息素养已成为当代高等教育面临的一个重要任务。文章探讨信息素养在研究生培养过程中的作用和地位,以期高等院校更注重把信息素养纳入到研究生教育目标和评价体系之中,使研究生更自觉主动地把提升信息素养作为自身学习与发展的重要目标。     

DFANS: A highly efficient strategy for automated trust negotiation

Automated trust negotiation (ATN) is an approach establishing mutual trust between strangers wishing to share resources or conduct business by gradually requesting and disclosing digitally signed credentials. The digital credentials themselves are usually sensitive, so they have corresponding access control policies to control their disclosure. Therefore, an ATN strategy must be adopted to determine the search for a successful negotiation based on the access control policies. Previously proposed negotiation strategies are either not complete, disclosing irrelevant credentials, or not efficient enough. In this paper, we propose a novel ATN strategy, that is, Deterministic Finite Automaton Negotiation Strategy (DFANS). DFANS is complete and ensures that no irrelevant credentials are disclosed during the negotiation. Furthermore, DFANS is highly efficient. In the worst case, its communication complexity is O(n), where n is the total number of credentials requested, and its computational complexity is O(m) when not involving the cyclic dependencies, where m is the total size of the both sides' policies looked up during the negotiation. When cyclic dependencies exist, a reasonable additional cost of running OSBE protocol that is a provably secure and quite efficient scheme will be added to the computational cost of DFANS to guarantee the negotiation success whenever possible.     

基于速度向量的VANET位置预测路由协议

针对车辆自组网（VANET）中车辆快速移动引起的网络拓扑快速变化及路由路径频繁切换引起的网络性能下降问题,提出一种适用于城市环境的基于速度向量的位置预测路由协议（VPRP）。该协议根据行驶方向将车辆分组,根据速度和当前位置预测下一步位置,选择路径中所有节点总的方向差异最小且总的距离变化最小的路径作为路由路径。仿真实验结果表明,VPRP比AODV和VHRP在吞吐量、分组投递率、平均传输延迟、控制开销等方面均有改进。     

一种基于不放回抽样的图像混沌加密算法

针对现有基于混沌序列的图像加密算法的缺陷,提出一种基于不放回抽样的图像混沌加密算法。该算法采用可变模运算和间接地址映射技术,将混沌序列一对一、高度随机地转换为图像像素地址,实现图像的位置置乱和灰度扰乱加密。对混沌序列的分布无严格要求,使混沌序列的参数和初值可以作为密钥被使用。实验结果表明,与现有同类算法相比,该算法性能优越、运算速度快且易于实现。     

Intelligent adaptive observer-based optimal control of overhead transmission line de-icing robot manipulator

In cold season, wet snow ice accretion on overhead transmission lines increases wind load effects which in turn increases line tension. This increased line tension causes undesirable effects in power systems. This paper discusses the design of an observer-based boundary sliding mode control (BSMC) for 3 DOF overhead transmission line de-icing robot manipulator (OTDIRM). A robust radial basis functional neural network (RBFNN) observer-based neural network (NN) controller is developed for the motion control of OTDIRM, which is a combination of BSMC, NN approximation and adaptation law. The RBFNN-based adaptive observer is designed to estimate the positions and velocities. The weights of both NN observer and NN approximator are tuned off-line using particle swarm optimization. Using Lyapunov analysis the closed loop tracking error was verified for a 3 DOF OTDIRM. Finally, the robustness of the proposed neural network-based adaptive observer boundary sliding mode control (NNAOBSMC) was verified against the input disturbances and uncertainties.     

ADRC Law of Spacecraft Rendezvous and Docking in Final Approach Phase

This article addresses the high-precision coordinated control problem of spacecraft autonomous rendezvous and docking, which couple the relative position and attitude in the final approach phase. The coupled dynamics equations of the tracking-target spacecrafts is derived by using dual quaternions. Then, a cascade Active Disturbance Rejection Controller is proposed, by which the extended state observer and nonlinear error feedback law is designed, the virtual value on which the actual control volume tracking is calculated to ensure the finite time convergence of the relative position and attitude tracking errors in spite of parametric uncertainties and external disturbances. Finally, numerical simulations are performed to demonstrate that the proposed approaches, which can avoid the coupling effect and restrain the interference, can track the target spacecraft in a relatively short period of time, and the control precision can satisfy the requirements of docking.     

基于GM(1,1)预测算法的民航飞机实时轨迹可视算法

针对民航飞机动态飞行可视化中滞后和跳跃问题,研究并提出了一种基于预测的民航飞机实时轨迹可视化算法.算法包括轨迹点预测,目标点行进和误差修正三部分.轨迹点预测基于GM （1,1）算法进行改进,在每次迭代时依据所有先验点和搜索方向动态调整发展系数.目标点行进基于预测坐标点提出TSUS （Time Slice Uniform Speed）算法,TSUS算法保证了在既定时间内目标确实移动到目的地,且能够根据初始速度方向调整轨迹弧度.误差修正采用分段式误差修正策略,以平衡不同情况下精确性和实用性.实验表明,提出的算法模型可用于民航飞机可视轨迹渲染中,且能获得良好的效果,提高系统的可用性和用户体验.     

增强寻优能力的改进蜂群算法

针对人工蜂群算法易陷入局部最优问题,首先,将蜂群算法中的跟随蜂数量翻倍,用其一半采用轮盘赌选择机制更新,保持蜂群沿着蜜源浓度大的方向进化;增加的一半跟随蜂采用反向的轮盘赌选择机制,用以维持种群的多样性。其次,将所有未更新计数器次数大于阈值的蜜源对应的引领蜂变成侦察蜂,并对相应蜜源进行更新搜索。最后,求出每一轮迭代后所得蜜源的中心位置,通过中心位置与每个蜜源所在的邻域内产生一新解,再比较适应度值的大小,选择优者。经过实验证明,该改进算法具有更高的收敛精度和很好的鲁棒性,且增加了算法跳出局部最优的机会,增强了蜂群算法的寻优能力,具有更好的优化性能。