在高职学院开设嵌入式应用技术专业

随着嵌入式技术的飞速发展,对各层次人才的需求量也在迅速增长,高职院校在嵌入式领域的人才培养处于起步阶段。本文针对嵌入式领域适合高职层次的岗位,给出"偏软"和"偏硬"两个培养方向的课程设置方案,建议采用项目教学法实施双目标教学,强化学生的职业技能和职业核心能力训练。     

基于KISOMAP-LDA-KNN算法TE过程故障诊断研究

针对化工连续生产过程的时序性及非线性等特征,文章提出了一种基于KISOMAP-LDA-KNN的非线性故障辨识方法。首先采用核等距映射（KISOMAP）算法在保持训练数据内在几何结构下进行非线性降维,然后使用线性判别（LDA）算法保持数据的最佳分类效果下进行降维,完成过程的特征提取,最后用K近邻（KNN）算法进行模式分类。将上述方法应用到TE过程,仿真结果验证了该故障诊断方法有较高的辨识能力。     

PKI网络信任模型的分析与研究

信任模型是整个网络安全体系的基础,决定了在网络上采用信任的形式与采用该形式带来的信任风险,并提供了建立和管理信任关系的框架。可见,对于信任模型的研究在网络安全中非常重要。文章着重分析了基于PKI的各类信任模型的信任机制、认证过程及其存在优缺点,指出了各类信任模型对网络信息安全产生影响的主要原因。通过总结与对比,指出了PKI信任模型的设计策略与发展趋势。     

基于ZigBee和GPRS的风电场远程监控系统研究

文章设计了一种基于ZigBee无线传感器网络和GPRS技术的风电场远程监控系统,可以对风力发电机组的发电机参数、状态参数、机械参数、环境参数等信息进行现场采集和监控,编制了适合应用于各类风电场的基于ZigBee无线传感器网络和GPRS技术的监控软件,能够很好地完成对风电场监控与管理的功能。     

Using improved grey forecasting models to forecast the output of opto-electronics industry

Numerous forecasting models have been developed. Each has its own conditions of application. However, it has always been an important research objective to improve prediction accuracy with a small amount of data. In recent years, the grey forecasting model has achieved good prediction accuracy with limited data and has been widely used in various research fields. However, the grey forecasting models still have some potential problems that need to be improved. Therefore, this study proposed an improved transformed grey model based on a genetic algorithm (ITGM(1,1)), and used the output of the opto-electronics industry in Taiwan from 1990 to 2008 as an example for verification. Three grey forecasting models, GM(1,1), rolling GM(1,1), and the transformed GM(1,1), were chosen for the purpose of comparison with ITGM(1,1) by mean absolute percent error and root mean square percent error. The results show that ITGM(1,1) is more accurate than the other three models in both in-sample and out-of-sample forecasting performance, and can greatly improve the accuracy of short-term forecasts.     

Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem

Unconstrained binary quadratic programming problem (UBQP) consists in maximizing a quadratic 0–1 function. It is a well known NP-hard problem and is considered as a unified model for a variety of combinatorial optimization problems. This paper combines a tabu Hopfield neural network (HNN) (THNN) with estimation of distribution algorithm (EDA), and thus a THNN–EDA is proposed for the UBQP. In the THNN, the tabu rule, instead of the original updating rule of the HNN, is used to govern the state transition or updating of neurons to search for the global minimum of the energy function. A probability vector in EDA model is built to characterize the distribution of promising solutions in the search space, and then the THNN is guided by the global search information in EDA model to search better solution in the promising region. Thus, the short term memory of the tabu mechanism in the THNN cooperates with the long term memory mechanism in the EDA to help the network escape from local minima. The THNN–EDA is tested on 21 UBQP benchmark problems with the size ranging from 3000 to 7000, and 48 maximum cut benchmark problems, a special case of the UBQP, with the size ranging from 512 to 3375. Simulation results show that the THNN–EDA is better than the other HNN based algorithms, and is better than or competitive with metaheuristic algorithms and state-of-the-art algorithms.     

Utility function of TCP

Understanding the TCP congestion control mechanism from a global optimization point of view is not only important in its own right, but also crucial to the design of other transport layer traffic control protocols with provable properties. In this paper, we derive a global utility function and the corresponding optimal control law, known as TCP control law, which maximizes the global utility. The TCP control law captures the essential behaviors of TCP, including slow start, congestion avoidance, and the binary nature of congestion feedback in TCP. We find that the utility function of TCP is linear in the slow start phase and is proportional to the additive increase rate and approaches the well-known logarithm function as the data rate becomes large in the congestion avoidance phase. We also find that understanding the slow start phase with a fixed threshold is critical to the design of new transport layer control protocols to enable quality of service features. Finally, as an application, we design a Minimum Rate Guaranteed (MRG) traffic control law that shares the same utility function as the TCP control law. Our simulation study of the MRG control law indicates that it is indeed TCP friendly and can provide minimum rate guarantee as long as the percentage of network resource consumed by the MRG flows is moderately small.     

云环境下基于协同推荐的信任评估与服务选择

“模糊、自治”的云计算环境中,服务品类繁多、质量参差不齐,用户主体难以进行可信赖的服务选择。在用户交互经验的基础上,结合现实人际交易模式,提出了一种基于协同推荐的综合信任量化评估模型。模型引入了时间衰减、权重两类动态因子,设计了多元化混合协同推荐算法来实现用户之间的有效协作,帮助用户正确选择可信云服务。为了验证模型的可行性,设计出一个分布式的原型系统,对模型的用户满意度和服务选择质量进行仿真实验。仿真结果表明,该模型能够更快地提高平均服务满意度,更有效地抑制恶意服务,而且随着交互次数的增长,服务选择质量也会不断提高。     

基于68013A的USB图像采集系统设计

本文介绍了基于USB2.0接口的68013A的图像采集板设计方案,包括硬件设计,下位机程序设计,上位机程序设计,USB驱动程序改写.在此基础上,实现了PC端实时显示感光芯片OV6620输出的数字信号图像.     

一种改进的有间隔流形ISOMAP算法

ISOMAP算法成功应用的潜在条件是要求数据集均匀抽样于单个的内在流形。如果数据集均匀采样于某个内在流形,但内部出现了一个间隔,ISOMAP算法可能失效。提出了G-ISOMAP(ISOMAP with a Gap)算法,该算法充分利用了数据集中的间隔特性。首先检测被间隔的子流形间最短欧氏距离对应的数据点,然后将这些数据点互相设置为邻域点,最后用ISOMAP算法找到低维嵌入结果。对G-ISOMAP与ISOMAP算法的区别与联系进行了详细的理论说明,得出ISOMAP算法是G-ISOMAP算法的一个特例,G-ISOMAP算法是ISOMAP算法扩充的结论。实验结果验证了该算法比其他常用的流形学习算法在有间隔的数据集上更有效。