Comparison of a‐Si and Poly‐Si for AMOLED displays

Abstract— The characteristics of OLED backplanes including the intrinsic properties of a‐Si TFTs and LTPS TFTs will be reviewed. While LTPS TFTs reveal satisfactory stability in AMOLED‐display applications, a‐Si AMOLEDs show better uniformity and are capable of driving OLEDs. However, the stability of a‐Si TFTs under long‐term operation is still unacceptable and remains to be the key issue constraining the commercialization of a‐Si TFT AMOLEDs.     

齿轮齿条式液压转向机齿条杆部的表面处理工艺及参数测定

本文重点介绍该主一些加工的参数设定过程,该工艺及参数也适应于推进杆与密切圈有相对运动的液压动力机构地其推进杆表面的处理处理。     

A distributed deadlock detection algorithm for mobile computing system

The mode of mobile computing originated from distributed computing and it has the un-idempotent operation property, therefore the deadlock detection algorithm designed for mobile computing systems will face challenges with regard to correctness and high efficiency. This paper attempts a fundamental study of deadlock detection for the AND model of mobile computing systems. First, the existing deadlock detection algorithms for distributed systems are classified into the resource node dependent （ RD ） and the resource node independent （RI） categories, and their corresponding weaknesses are discussed. Afterwards a new RI algorithm based on the AND model of mobile computing system is presented. The novelties of our algorithm are that： 1 ） the blocked nodes inform their predecessors and successors simultaneously; 2） the detection messages （agents） hold the predecessors information of their originator; 3 ） no agent is stored midway. Additionally, the quit-inform scheme is introduced to treat the excessive victim quitting problem raised by the overlapped cycles. By these methods the proposed algorithm can detect a cycle of size n within n - 2 steps and with （ n^2- n - 2 ）/2 agents. The performance of our algorithm is compared with the most competitive RD and RI algorithms for distributed systems on a mobile agent simulation platform. Experiment results point out that our algorithm outperforms the two algorithms under the vast majority of resource configurations and concurrent workloads. The correctness of the proposed algorithm is formally proven by the invariant verification technique.     

基于弹性需求的城市间客车开行频率与票价优化

基于两城市间旅客出行弹性需求,研究了客运企业客车开行频率与票价的组合决策优化问题。在综合考虑旅客出行时间调整费用、车内拥挤费用、票价支出以及客运企业运营的固定成本、可变成本、线路的建设维护分摊费用、车票收入的基础上,以旅客和客运企业的系统净收益为目标函数建立了优化模型和求解方法,并就一组特殊旅客出行时间调整费用函数进行了深入讨论和数值计算分析。研究结果为客运企业客车开行频率和票价的组合决策提供了理论依据。     

上升流式生物流化床反应器膨胀行为的数学建模与分析

基于Richardson—Zaki液固流态化方程,运用数值模拟分析的方法针对上升流式生物流化床反应器的膨胀行为展开了研究,并建立了相应数学模型．同时以厌氧膨胀颗粒污泥床反应器为例进行了数值模拟研究,数值模拟研究结果很好反映了该反应器的特点且两次相关实验结果的平均相对误差分别为4．74％和8．3％．所得结果显示所建模型以及所采用的数值模拟分析方法基本可行．     

基于FPGA的分布式算法FIR滤波器设计

FIR滤波器具有许多优点,是数字信号处理系统中基本的元件。本文比较了目前FIR滤波器硬件实现的几种方法,详细研究了基于FPGA、采用分布式算法实现FIR滤波器的原理和方法,设计了一个32阶线性相位FIR滤波器,并用VHDL语言对其进行了描述。此滤波器采用串行加法器将数据进行预相加,从而将滤波器的规模减半。其主要部分——乘累加单元,采用LUT查找表结构,将乘法运算转换为查表操作,提升处理速度。最后进行了硬件仿真,结果证明,这一方法是可行且高效的。     

R∞关系的几个重要性质

在二元关系R的基础上构造了R^∞关系，给出并证明了R^∞关系的几个重要性质。这些性质在粗糙集理论中研究R^∞领域系统及其近似算子时甚为重要。     

轴心受压FRP约束圆形混凝土柱应力-应变模型

外包纤维复合材料(FRP)可以有效的提高混凝土柱的承载力和延性.本文系统总结了现有的几种FRP约束混凝土柱应力-应变模型,通过对已有大量试验研究结果的分析,指出FRP约束圆形混凝土柱的性能主要取决于FRP对混凝土柱的约束效果,引入约束效应系数ξ.并以约束效应系数ξ为主要参数,提出了FRP约束圆形混凝土柱三阶段应力-应变模型.该模型能较好的反映FRP约束混凝土柱应力-应变关系的特点,模型计算结果与试验数据吻合较好.     

Gaussian process assisted coevolutionary estimation of distribution algorithm for computationally expensive problems

In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in parallel. The search space was projected into multiple subspaces and searched by sub-populations. Also, the whole space was exploited by the other population which exchanges information with the sub-populations. In order to make the evolutionary course efficient, multivariate Gaussian model and Gaussian mixture model were used in both populations separately to estimate the distribution of individuals and reproduce new generations. For the surrogate model, Gaussian process was combined with the algorithm which predicted variance of the predictions. The results on six benchmark functions show that the new algorithm performs better than other surrogate-model based algorithms and the computation complexity is only 10% of the original estimation of distribution algorithm.