在不同Cl-含量土壤中硫酸盐还原菌对Q235钢腐蚀的影响

利用交流阻抗测试技术、扫描电镜及表面能谱分析、失重法、微生物分析等方法，研究了在同一类型不同Cl-含量的土壤中，硫酸盐还原菌对Q235钢腐蚀的影响规律.136天的试验结果表明：随着土壤中Cl-含量的增大，Q235钢腐蚀速率也增大，当Cl-含量增大到0.5%时，腐蚀速率达到最大；随后腐蚀速率随着土壤中Cl-含量的增大而减小，当土壤中Cl-含量高于1%时，接菌土壤与灭菌土壤中Q235钢腐蚀速率相差不大.在土壤中Cl-含量低于1%时，接菌土壤中Q235钢腐蚀速率明显大于灭菌土壤的腐蚀速率；点蚀速率在不同Cl-含量的土壤中的变化规律与腐蚀速率的变化有所不同，点蚀速率基本随着土壤中Cl-含量的增加而增大.而且接菌土壤中的点蚀速率大于灭菌土壤的点蚀速率. TG174.5  硫酸盐还原菌； 含Cl-土壤； Q235钢； 微生物腐蚀 2003-01-13 2003-05-08     

Design and Comparison Base Analysis of Adaptive Estimator for Completely Unknown Linear Systems in the Presence of OE Noise and Constant Input Time Delay

In this paper, an adaptive estimator (AE) is introduced to learn the approximate Q‐function and control policy by only using the noisy states and control signals of the unknown linear, discrete time systems having constant input time delay. The system measurements are uncertain owing to output error (OE)‐type noise acting randomly on the system measurements. Therefore, this research differs from the designed AE in the literature since previous research ignores the role of the external random disturbances on AE‐based learning. In order to compare the AE‐based learning results with traditional system identification (SI) approaches, a modified version of the OE model structure for unstable systems is reviewed and parameters of a second‐order unstable system with constant input time delay are identified. The simulation results demonstrate that the designed AE efficiently minimizes the stochastic cost function and the temporal difference error by learning the approximate solution for the Hamilton‐Jacobi‐Bellman (HJB) equation. It is noted that the error in the Q‐function obtained with the AE is slightly larger than the Q‐function attained with the identified OE parameters. However, as the noise standard deviation increases, the error in the AE‐based learning results reduces whereas the error in the OE‐based learning increases. This indicates that even though the added random noise deteriorates the performance of the OE predictor, it improves the learning efficiency of the AE since it acts like exploration noise.     

利用Wireshark软件进行信令分析

Wireshark软件是开源软件中应用最广的一种信令分析软件,支持众多的信令协议。PCAP文件格式是一种通用的封包存储格式,这个格式的文件可以被Wireshark软件直接读取。在分析PCAP文件格式的基础上,通过构建数据文件,可以利用Wireshark软件对已有的信令数据进行信令分析。分析结果可以用于科学研究和工程实践,避免了手工分解信令数据时的低效率,提高了工作的时效性。     

Playful gender swapping: user attitudes toward gender in MMORPG avatar customisation

Avatar gender is a basic element of an MMORPG user's identity. Gender customisation in a virtual space is an expansion of identity, an attempt to express oneself in more diverse ways. A survey showed that numerous users manage gender-swapped avatars, and men in particular prefer using female avatars. This study analysed user attitudes toward gender using a Q methodology. In the process, it confirmed the generalisations and motivating factors of gender swapping. The advanced graphic technology and high degree of freedom available in recent MMORPGs has led to an increased demand for avatar physical qualities, and the motives that underlie gender selection have become more diverse and complex. In particular, the notion of experimental and playful creation through customisation has been illuminated and treated as the core consideration of game design.     

VLAN Trunk技术及其应用

VLAN Trunk技术的作用,是让连接在不同交换机上的相同VLAN中的主机互通。对VLAN Trunk技术进行分析、研究与比较,并用一个实例进行了实验验证。     

Q2686无线CPU和LonWorks的无线监控网关设计

主要利用Q2686无线CPU结合LonWorks控制网络技术,开发设计出一种多功能无线监控网关。该无线监控网关有LON电力线接口（或LON双绞线接口）和RS485总线接口,具有遥控、遥测及定时控制等功能,可以采集水表、电表、煤气表等智能仪表的数据,并通过GPRS无线数据传输将数据传输给中心站网络服务器,也可以响应中心站的数据请求和控制。。     

基于强化学习的JLQ模型的直接自适应最优控制

研究离散时间跳变线性二次(JLQ)模型的直接自适应最优控制问题.将强化学习的理论和方法应用于JLQ模型,设计基于Q函数的策略迭代算法,以优化系统性能.在系统参数以及模态跳变概率未知的情况下,Q函数对应的参数矩阵,可通过观察给定策略下系统行为,应用递归最小二乘算法在线估计.基于此参数矩阵,可构造出新的策略使得系统性能更优.该算法可收敛到最优策略.     

基于Q2406B的车载智能终端的研究与设计

该文介绍了在智能交通系统中起到重要作用的车载智能终端的研究与设计。该智能终端是以GPRS／GPS等技术为基础,以Q2406B无线CPU为核心的一种嵌入式系统。文中给出了该嵌入式移动智能终端的软硬件设计方案。     

Invariance properties of RAMS and linear time

An operation on integers isLTTC if it is computable in linear time on a Turing machine (using the dyadic or binary representation of integers). AnLTTC-RAM (respectivelyI-RAM) is a RAM which only uses LTTC operations (respectively operations in the setI).The address-free time complexity measure of a RAM evaluates execution times using the logarithmic cost criterion but assumes that addressing operations are performed for free.     

Space-efficient recognition of sparse self-reducible languages

Mahaney and others have shown that sparse self-reducible sets have time-efficient algorithms, and have concluded that it is unlikely that NP has sparse complete sets. Mahaney's work, intuition, and a 1978 conjecture of Hartmanis notwithstanding, nothing has been known about the density of complete sets for feasible classes until now. This paper shows that sparse self-reducible sets have space-efficient algorithms, and in many cases, even have time-space-efficient algorithms. We conclude that NL, NC ^k , AC ^k , LOG(DCFL), LOG(CFL), and P lack complete (or even Turing-hard) sets of low density unless implausible complexity class inclusions hold. In particular, if NL (respectively P, _k , or NP) has a polylog-sparse logspace-hard set, then NLSC (respectively PSC, _k , or PHSC), and if P has subpolynomially sparse logspace-hard sets, then PPSPACE.