MoS2/g-C3N4复合催化剂的制备及CdSe量子点敏化产氢性能研究

太阳能光催化分解水制氢被认为是从根本上解决能源与环境问题较为理想的途径之一。在以尿素为原料制得石墨相氮化碳(g-C_3N_4)的基础之上,采用简单的低温溶液反应法将二硫化钼(MoS_2)与石墨相氮化碳(g-C_3N_4)复合得到复合催化剂MoS_2/g-C_3N_4,并利用透射电子显微镜(TEM)、X射线衍射(XRD)、紫外-可见漫反射(DRS)、傅里叶变换红外光谱(FT-IR)和荧光光谱等对该复合光催化剂的组成、形貌和光物理性能进行了表征;进而以CdSe量子点为光敏剂,三乙醇胺(TEOA)为牺牲剂,构建了不含贵金属的三组分光催化产氢体系,并对体系pH值、CdSe量子点浓度等对产氢性能的影响进行了研究。结果表明:将MoS_2纳米颗粒负载到g-C_3N_4上可使g-C_3N_4的光催化产氢性能得到显著提高。当MoS_2负载量为7%(质量比)时,在最佳的条件下(pH=9.0,CdSe量子点的体积为25mL),最大产氢速率达到了141.74μmol·h-1,6h的产氢总量达到了212.61μmol。最后,结合荧光猝灭实验,推测了该体系的产氢机理。     

An adaptive method based on the improved LPA-ICI algorithm for MRI enhancement

Various diseases are diagnosed using medical imaging used for analysing internal anatomical structures. However, medical images are susceptible to noise introduced in both acquisition and transmission processes. We propose an adaptive data-driven image denoising algorithm based on an improvement of the intersection of confidence intervals (ICI), called relative ICI (RICI) algorithm. The 2D mask of the adaptive size and shape is calculated for each image pixel independently, and utilized in the design of the 2D local polynomial approximation (LPA) filters. Denoising performances, in terms of the PSNR, are compared to the original ICI-based method, as well as to the fixed sized filtering. The proposed adaptive RICI-based denoising outperformed the original ICI-based method by up to 1.32 dB, and the fixed size filtering by up to 6.48 dB. Furthermore, since the denoising of each image pixel is done locally and independently, the method is easy to parallelize.     

Numerical and experimental investigations of laser shock forming aluminum alloy sheet with mold

Laser shock forming (LSF) technology employs shock waves to form sheet metal into three-dimensional complex parts, and has application potential in manufacturing sheet metal parts. In this paper, the forming of 2024 aluminum alloy sheet with LSF was investigated through numerical and experimental methods. The numerical model was established with the commercial code ABAQUS/Explicit. The formed conical cup was obtained from the simulation, and validated by the experiment. With the verified numerical model, the deformation behaviors, including deformation velocity, sheet thickness variation and strain distribution, were studied. In addition, the influence of different shock wave pressures on the forming precision was also investigated. The experimental and numerical results show that the metal sheet loaded by shock wave can take the shape of the mold, and the non-uniform thickness is distributed in the formed cup. The investigations also display that there exists reverse deformation at the central region of deforming sheet owing to severe collision during LSF. In order to obtain formed part with better quality, an appropriate pressure of applied shock waves is required.     

基于Q—learning的一种多Agent系统结构模型

多Agent系统是近年来比较热门的一个研究领域,而Q-learning算法是强化学习算法中比较著名的算法,也是应用最广泛的一种强化学习算法。以单Agent强化学习Qlearning算法为基础,提出了一种新的学习协作算法,并根据此算法提出了一种新的多Agent系统体系结构模型,该结构的最大特点是提出了知识共享机制、团队结构思想和引入了服务商概念,最后通过仿真实验说明了该结构体系的优越性。     

某型直升机飞行性能仿真建模与验证

主要研究并建立直升机飞行性能仿真模型,在直升机动力学和运动学微分方程的基础上重点解算作用在直升机各部件上的气动力和力矩模型,建立旋翼和尾桨的气动仿真模型,对旋翼挥舞运动进行了分析研究,还考虑了平尾、垂尾、机身和重力的仿真模型。最后通过对各飞行性能指标及其验证原理方法的分析研究,验证了静态性能指标,应用标量指标法验证动态性能指标。     

Ranking queries on uncertain data

Uncertain data is inherent in a few important applications. It is far from trivial to extend ranking queries (also known as top-k queries), a popular type of queries on certain data, to uncertain data. In this paper, we cast ranking queries on uncertain data using three parameters: rank threshold k, probability threshold p, and answer set size threshold l. Systematically, we identify four types of ranking queries on uncertain data. First, a probability threshold top-k query computes the uncertain records taking a probability of at least p to be in the top-k list. Second, a top-(k, l) query returns the top-l uncertain records whose probabilities of being ranked among top-k are the largest. Third, the p-rank of an uncertain record is the smallest number k such that the record takes a probability of at least p to be ranked in the top-k list. A rank threshold top-k query retrieves the records whose p-ranks are at most k. Last, a top-(p, l) query returns the top-l uncertain records with the smallest p-ranks. To answer such ranking queries, we present an efficient exact algorithm, a fast sampling algorithm, and a Poisson approximation-based algorithm. To answer top-(k, l) queries and top-(p, l) queries, we propose PRist+, a compact index. An efficient index construction algorithm and efficacious query answering methods are developed for PRist+. An empirical study using real and synthetic data sets verifies the effectiveness of the probabilistic ranking queries and the efficiency of our methods.     

模糊化的无线传感节点自适应定位算法

节点定位是无线传感网络的研究基础,具有重要的研究价值和研究意义.现有定位算法主要分为测距相关的算法(range-based)与测距无关的算法(range-free)两类.前者通常使用未经处理的、包含环境噪声的测距信号,导致其定位稳定性较差;后者常使用节点间的连通性信息,导致其定位精度相对较低.针对该现状,本文提出一种基于模糊处理的节点自适应定位算法(fuzzy localization, FL).FL算法首先收集有关测距信息,然后对测距信息进行模糊化处理,最后采用自适应算法计算节点位置.FL算法对测距信息的模糊化处理,减少了环境噪声对定位的影响,提高了节点定位的稳定性;同时细化了通讯半径内的距离估计,提高了节点的定位精度;且自适应算法能对模糊化过程进行自适应控制,取得有效模糊化参数.实验结果表明,与DV-Hop算法和Spring算法相比,FL算法减少了约31%和6%的定位误差,且定位稳定性较好.     

采用任意播方式的机会数据聚集算法

数据收集是无线传感网络研究的关键问题,是诸多无线传感网络应用的基础.降低数据聚集的延迟是数据聚集研究中的重点问题.现有的面向延迟的数据聚集算法,多是通过在树型网络结构上设计无冲突的节点调度算法,来降低数据聚集的延迟,没有考虑到无线网络数据易丢失的特性,不能达到期望的延迟效果.本文针对上述问题,提出一种采用任意播(anycast)方式的机会数据收集算法(OA算法).该算法利用机会传输(opportunistic transmission)的思想,用任意播方式传输数据,通过减少数据聚集中重传数据包的数目,来降低数据聚集的延迟.实验表明,与SPT(Shortest path tree)上的数据聚集延迟相比,该方法的发包数目减少了15%,延迟降低了10%.     

Cluster based Routing Scheme for Distributed Regression in Wireless Sensor Networks: Gaussian Eliminations

This paper addresses the issue of the in-network implementation of data regression in wireless sensor networks (WSNs). In particular, a cluster based routing scheme is proposed for achieving the distributed Gaussian elimination in solving the regression algebraic equation. In doing this, the tree structure is incorporated to coordinate the clusters so as to decouple the intersections with each other via a new message passing protocol. The cluster based routing scheme proposed here contributes not only to ease network topology management, but also to speed the convergence of distributed computation. Experimental results are reported to illustrate the validation of the proposed approach.