一种在硅材料表面组装金纳米颗粒的新方法

以氯金酸、L-半胱氨酸为反应试剂,利用内电流和金硫自组装效应,在硅材料表面组装了较为均一的金纳米颗粒,并利用荧光分析与硅纳米线场效应晶体管对该方法进行了相关验证。结果表明:经氢氟酸处理后的硅材料,在氯金酸和L-半胱氨酸混合溶液中反应3min可在硅表面得到较为均匀、稳定的金纳米颗粒层,其中,氯金酸浓度为0.5mmol/L,氯金酸和L-半胱氨酸浓度比为3∶1。荧光分析表明该方法组装的金颗粒表面已氨基功能化,使得金纳米颗粒修饰的硅材料在应用于生物检测时可直接醛基化修饰蛋白,简化了实验操作。同时,该方法可以在硅纳米线场效应晶体管中特异性组装金纳米颗粒,有力地支持了相关器件在疾病检测方面的应用。     

An Influence Maximization Algorithm Based on Improved K-Shell in Temporal Social Networks

Influence maximization of temporal social networks (IMT) is a problem that aims to find the most influential set of nodes in the temporal network so that their information can be the most widely spread. To solve the IMT problem, we propose an influence maximization algorithm based on an improved K-shell method, namely improved K-shell in temporal social networks (KT). The algorithm takes into account the global and local structures of temporal social networks. First, to obtain the kernel value Ks of each node, in the global scope, it layers the network according to the temporal characteristic of nodes by improving the K-shell method. Then, in the local scope, the calculation method of comprehensive degree is proposed to weigh the influence of nodes. Finally, the node with the highest comprehensive degree in each core layer is selected as the seed. However, the seed selection strategy of KT can easily lose some influential nodes. Thus, by optimizing the seed selection strategy, this paper proposes an efficient heuristic algorithm called improved K-shell in temporal social networks for influence maximization (KTIM). According to the hierarchical distribution of cores, the algorithm adds nodes near the central core to the candidate seed set. It then searches for seeds in the candidate seed set according to the comprehensive degree. Experiments show that KTIM is close to the best performing improved method for influence maximization of temporal graph (IMIT) algorithm in terms of effectiveness, but runs at least an order of magnitude faster than it. Therefore, considering the effectiveness and efficiency simultaneously in temporal social networks, the KTIM algorithm works better than other baseline algorithms.     

利用光闪烁现象进行粉尘排放的监测

粉尘排放监测系统正在各国推广应用,新的方法也不断出现．本文提出一种基于光闪烁现象的粉尘排放监测方法．同光透射法相比,这种新方法具有测量精度高、不怕污染、成本低的特点．实验结果表明,测量系统的输出与粉尘排放的浓度呈线性关系．     

基于PXI的飞控襟翼仿真系统的设计与实现

为了真实仿真飞控襟翼系统部件的功能和接口,替代系统真件参与试验,探查飞控襟翼操纵系统的组成结构和工作原理,设计并实现了基于PXI的飞控襟翼仿真系统;根据真件相关资料,建立了完整的襟翼操纵系统闭环控制模型,建设了襟翼硬件仿真测试平台,编制了仿真测试软件;仿真系统硬件采用模块化结构设计,提高了稳定性和可靠性;系统软件基于QNX实时操作系统编制,保证了仿真测试过程中事件响应的实时性;成果在实际工作中成功应用于飞控系统联测,满足了仿真系统的功能需求和技术指标.     

无线传感器网络簇级拓扑演化模型研究

复杂网络理论研究表明,复杂系统的容错能力不仅仅存在于具有冗余组件的系统之中;而且也同样存在于具有无标度(scale-free)特征的网络之中;文章借助于复杂网络理论和偏好依附机制提出一种无线传感器网络簇级拓扑演化模型;拓扑动态分析表明,该模型能够很好地体现无线传感器簇间的拓扑生长过程,由该模型演化成的无线网络拓扑具有无标度网络的性质,所以该拓扑模型具有很强的容错性。     

“主导·主体”教学模式在配置路由选择协议实验中的应用

针对多数计算机网络实验课以学生为中心的实际情况,在分析其缺点的基础上,文章提出将"主导.主体"教学模式应用于计算机网络原理实验课中,并以配置路由选择协议为实验案例,探讨"主导.主体"教学模式在其中的应用,为该教学模式在计算机网络其他实验中的应用提供借鉴意义。     

证券行业信息系统备份能力现状浅析

为了发挥备份能力建设在证券行业信息系统业务连续性中的重要作用,本文结合行业信息系统备份能力标准,信息系统备份能力分级,以及行业备份能力建设实践,分析证券行业信息系统备份能力现状与标准的差距,建设中存在的难点,进一步提出备份能力建设的建议。     

A relativistic extension of the complex scaling method using oscillator basis functions

We develop the complex scaling method within the relativistic framework by expanding the Dirac spinors in the complete set of eigensolutions of a harmonic oscillator potential, and present the theoretical formalism of describing the discrete bound and resonant states on the same footing. Based on a well established and frequently used model, we demonstrate the utility and applicability of the extended method and examine the stability of the results with respect to the variations of the parameters of the model. Satisfactory agreements are found for all the calculated results in comparison with some other calculations in references. Especially, the present calculation in the nonrelativistic limit gives a consistent result with that in the nonrelativistic calculation.     

A graph-theoretical clustering method based on two rounds of minimum spanning trees

Many clustering approaches have been proposed in the literature, but most of them are vulnerable to the different cluster sizes, shapes and densities. In this paper, we present a graph-theoretical clustering method which is robust to the difference. Based on the graph composed of two rounds of minimum spanning trees (MST), the proposed method (2-MSTClus) classifies cluster problems into two groups, i.e. separated cluster problems and touching cluster problems, and identifies the two groups of cluster problems automatically. It contains two clustering algorithms which deal with separated clusters and touching clusters in two phases, respectively. In the first phase, two round minimum spanning trees are employed to construct a graph and detect separated clusters which cover distance separated and density separated clusters. In the second phase, touching clusters, which are subgroups produced in the first phase, can be partitioned by comparing cuts, respectively, on the two round minimum spanning trees. The proposed method is robust to the varied cluster sizes, shapes and densities, and can discover the number of clusters. Experimental results on synthetic and real datasets demonstrate the performance of the proposed method.     

基于GoogleMap的WebGIS技术在数字化苗圃中的应用与研究

该文简要介绍了GoogleMap的WebGIS技术和开发要点,并结合数字化苗圃的应用,采用C/S模式内嵌B/S模式的来实现网页的交互操作,达到了既充分利用了已有的软件资源,又增加了新的WebGIS应用,取得了满意的效果。