Laser‐irradiated zinc oxide thin‐film transistors fabricated by solution processing

Abstract— This study investigates the effects of subjecting zinc oxide (ZnO) thin films to laser irradiation. The optical, structural, and electrical properties of the as‐deposited and laser‐irradiated films at different laser energies were studied. The transmittances without/with laser irradiation showed a net increase from 85 to 92% (@550 nm) for 250‐nm ZnO films, indicating an improvement in sample crystal linity. In addition, laser treatment decreased the ZnO band gap. Composition structure analysis shows that the crystallinity increased when the laser energy increased. Thin‐film transistors (TFTs) with a ZnO active layer were fabricated. The mobility of as‐deposited ZnO TFT devices (0.19 cm²/V‐sec) increased more than 2.5 times for ZnO of unirradiated laser treatment (0.49 cm²/V‐sec).     

Energy-efficient adaptive sensor scheduling for target tracking in wireless sensor networks

Sensor scheduling is essential to collaborative target tracking in wireless sensor networks (WSNs). In the existing works for target tracking in WSNs, such as the information-driven sensor query (IDSQ), the tasking sensors are scheduled to maximize the information gain while minimizing the resource cost based on the uniform sampling intervals, ignoring the changing of the target dynamics and the specific desirable tracking goals. This paper proposes a novel energyefficient adaptive sensor scheduling approach that jointly selects tasking sensors and determines their associated sampling intervals according to the predicted tracking accuracy and tracking energy cost. At each time step, the sensors are scheduled in alternative tracking mode, namely, the fast tracking mode with smallest sampling interval or the tracking maintenance mode with larger sampling interval, according to a specified tracking error threshold. The approach employs an extended Kalman filter (EKF)-based estimation technique to predict the tracking accuracy and adopts an energy consumption model to predict the energy cost. Simulation results demonstrate that, compared to a non-adaptive sensor scheduling approach, the proposed approach can save energy cost significantly without degrading the tracking accuracy.     

Enhancements of two-stage stochastic decomposition

This paper presents some enhancements associated with stochastic decomposition (SD). Specifically, we study two issues: (a) Are there any conditions under which the regularized version of SD generates a unique solution? (b) Is there a way to modify the SD algorithm so that a user can trade-off solution times with solution quality? The second issue addresses the scalability of SD for very large scale problems for which computational resources may be limited and the user may be willing to accept solutions that are “nearly optimal”. We show that by using bootstrapping (re-sampling) the regularized SD algorithm can be accelerated without significant loss of optimality. We report computational results that demonstrate the viability of this approach.     

Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks

All elliptic curve cryptographic schemes are based on scalar multiplication of points, and hence its faster computation signifies faster operation. This paper proposes two different parallelization techniques to speedup the GF(p) elliptic curve multiplication in affine coordinates and the corresponding architectures. The proposed implementations are capable of resisting different side channel attacks based on time and power analysis. The 160, 192, 224 and 256 bits implementations of both the architectures have been synthesized and simulated for both FPGA and 0.13μ CMOS ASIC. The final designs have been prototyped on a Xilinx Virtex-4 xc4vlx200-12ff1513 FPGA board and performance analyzes carried out. The experimental result and performance comparison show better throughput of the proposed implementations as compared to existing reported architectures.     

构造基于证据理论的群组信任管理模型

针对资源共享系统中节点的恶意行为,提出一种基于证据理论的群组信任管理模型,在节点间服务与被服务的过程中建立信任关系,抑止恶意节点的破坏行为.首先根据改进的直方图法计算节点直接信任值,利用改进的冲突信任加权证据组合规则计算推荐信任值;然后融合本地信任值和其它节点推荐信任值完成对目标节点的最终信任评估;最后进一步通过服务节点选择算法选择可信度较高的节点作为服务提供节点,避免服务请求节点得到错误或破坏性的资源.通过仿真实验对此模型在对抗恶意攻击时的有效性进行了验证.     

基于RIA方式的WebGIS构建

RIA是一种具有近似于传统桌面应用功能和特性的网络应用,在界面表现力和交互能力、网络传输等方面具有不可替代的优势。在总结RIA的相关概念和技术以及传统WebGIS RIAs的构建方式的基础上,结合Web 2.0的发展趋势,本文提出了基于JavaScript/AJAX、Flex等客户端技术构建WebGIS RIAs的一系列解决方案,并详细阐述了这些解决方案的实现机制。     

混沌敏感性在图像加密中的2种应用

混沌系统的结构参数敏感性、初值敏感性和以同一分布遍历各态的特性较好地对应密码系统的一些基本特性。分析结构参数和初始值变化对混沌序列敏感性影响,得到混沌序列敏感性效应是一个积累过程。将混沌序列按照敏感性划分为混沌敏感性前后期序列并给出界定原则。探究混沌序列敏感性在图像加密时的2种不同应用。     

基于Rollout算法的测试不可靠条件下的诊断策略*

实际复杂装备系统测试时存在虚警和漏检,其导致的误诊费用往往超过了测试成本。针对复杂系统故障诊断中诊断精度低、虚警率高的问题,进行了不可靠测试条件下,基于Rollout算法的诊断策略优化方法研究。首先建立综合考虑测试点的故障检测能力、信息量、测试费用以及测试结果信任度的启发函数,然后利用Rollout算法生成诊断策略,最后用阿波罗检测系统实例验证了该算法的优越性。理论和实验表明,Rollout算法的平均测试费用低于贪婪算法,而且计算时间在可接受范围内,因此可用于测试不可靠条件下的诊断策略设计。     

公交线路查询算法

公共交通不仅是衡量城市现代化程度的重要标志也是解决交通拥堵问题的途径. 而公交线路查询系统的关键技术是公交线路查询算法, 它对提高公交资源的利用率有着重要的意义. 总结了国内外城市公交最优路径算法并在此基础上分析了高效运行城市公交系统的条件和影响因素. 介绍了最短路径问题及Dijkstra算法及其在查询系统应用中的弊端. 然后提出了基于换乘最小的广度优先算法的数学模型, 给出了算法的实现, 并以银川市公共交通公司的公交部分数据为基础, 完成了公交信息查询系统的设计与开发.