依托网络教学平台 提高课堂教学效果

网络教学作为一种新的辅助教学手段,是目前教学改革主要研究的方向之一。通过对网络教学平台的功能分析,探讨了在网络教学平台上进行教学资源的建设、交流互动教学活动的开展和虚拟实验室的建设,通过应用实践证明,充分利用网络教学平台的优势,能有效地提高课堂教学质量和效率,培养学生的学习能力、实践能力和创新能力。     

用于腺苷检测的基于级联扩增核酸适体电化学传感界面的构建研究

该文报道了一种基于酶级联扩增的电化学核酸适体检测腺苷的新方法。当腺苷存在时,滚环扩增的引物通过E.coli DNA连接酶的作用与通过巯基组装在金电极上的固定探针连接。在pHi29 DNA聚合酶的作用下,滚环扩增反应进行并产生一条与环形探针完全互补的长的单链,然后将大量金纳米粒子标记的核酸探针与滚环扩增的产物杂交。该传感界面电化学行为的结果表明,通过酶级联扩增的方法提高了检测腺苷的阻抗响应灵敏度,且选择性和重现性良好。用于腺苷的检测时,其线性范围为2.0μmol/L~100μmol/L,最低检测浓度为2.0μmol/L,表明该传感界面的设计可作为一种通用方法而有望用于其它目标物的检测。     

IT时代的第三种文化产业机遇

人类社会一直存在着并行不悖的科技与人文的两种文化与文化产业。如今,出现了第三种文化与第三种文化产业。第三种文化产业的思想基础是图灵的可计算原理;其物质基础是微处理器智力内核。第三种文化产业将打破两种文化产业界线,用人工智能与智能化工具等现代科技手段,实现人文文化领域中的艺术创作,这是人类文化领域中已经开始的没有硝烟的产业战争。     

Sampling average approximation method for a class of stochastic Nash equilibrium problems

We consider a class of stochastic Nash equilibrium problems (SNEP). Under some mild conditions, we reformulate the SNEP as a stochastic mixed complementarity problem (SMCP). We apply the well-known sample average approximation (SAA) method to solve the SMCP. We further introduce a semismooth Newton method to solve the SAA problems. The comprehensive convergence analysis is given as well. In addition, we demonstrate the proposed approach on a stochastic Nash equilibrium model in the wholesale gas–oil markets.     

Polar-Cartesian Hybrid Transforms: A novel 2D range scan registration algorithm

Registration of range scans is commonly required in many localization and mapping algorithms. In this paper, we introduce a novel approach called Polar-Cartesian Hybrid Transforms for pair-wise registration of range scans. The proposed algorithm iteratively establishes correspondences by searching the points with closest polar angles in the polar coordinate frame. An angular look-up table is constructed based on the properties of the laser range finder to accelerate the searching procedure. In order to speed up the convergence, we compute the difference of polar range of every matched point pair to select the most contributing correspondences. After the correspondences are determined, the transformation is computed in Cartesian coordinate frame using a point-to-line metric. Combining the advantages of the polar and Cartesian coordinate frames, both robustness and efficiency are greatly improved compared with an up-to-date ICP algorithm.     

Mediating and inducing quantum correlation between two separated qubits by one-dimensional plasmonic waveguide

We investigate the dynamics of quantum correlation between two separated qubits trapped in one-dimensional plasmonic waveguide. It is found that for a class of initial states, the quantum discord shows a sudden change phenomenon during the dynamical evolution. Furthermore, we demonstrate that the quantum discord can be enhanced if a proper product of the plasmon wave number and two qubits distance is chosen. Finally, we find that the non-zero quantum discord between two qubits can be created for the states without initial quantum discord during the time evolution of the system.     

New insights on survivability in multi-domain optical networks

With the development of intelligent optical networks and the general multi-protocol label switching (GMPLS) technique, the seamless convergence between IP network and optical network is no longer be a dream but a practical reality. Similar to the Internet, current optical networks have been divided into multiple domains each of which has its own network provider and management policy. Therefore, the development of multi-domain optical networks will be the trend of new-generation intelligent optical networks, and GMPLS-based survivability for multi-domain optical networks will become a hot topic of research in the future. This paper provides a comprehensive review of the existing survivable schemes in multi-domain optical networks and analyzes the shortcomings of current research. Based on previous studies, we present possible challenges and propose new ideas to design efficient survivable schemes to guide the future work of researchers in multi-domain optical networks.     

Image mosaicking for polyhedral scene and in particular singly visible surfaces

Image mosaic construction is about stitching together a number of images about the same scene to construct a single image with a larger field of view. The majority of the previous work was rooted at the use of a single image-to-image mapping termed planar homography for representing the imaged scene. However, the mapping is applicable only to cases where the imaged scene is either a single planar surface, or very distant from the cameras, or imaged under a pure rotation of the camera, and that greatly limits the range of applications of the mosaicking methods. This paper presents a novel mosaicking solution for scenes that are polyhedral (thus consisting of multiple surfaces) and that are pictured possibly in closed range of the camera. The solution has two major advantages. First, it requires only a few correspondences over the entire scene, not correspondences over every surface patch in it to work. Second, it conquers a seemingly impossible task—warping image data of surfaces that are visible in only one of the input images, which we refer to as the singly visible surfaces, to another viewpoint to constitute the mosaic there. We also provide a detail analysis of what determines whether a singly visible surface could be mosaicked or not. Experimental results on real image data are presented to illustrate the performance of the method.