期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
四维扫描透射电子显微镜技术:从材料微观结构到物性分析 被引量:1
1
作者 冯启龙 朱翀之 +3 位作者 盛冠 孙土来 李永合 朱艺涵 《物理化学学报》 SCIE CAS CSCD 北大核心 2023年第3期43-57,共15页
扫描透射电子显微镜(Scanning transmission electron microscopy,STEM)目前已经达到了原子级分辨率,并且由于其具有灵活的多通道成像能力以及强大的与谱学分析相结合的特点,因此在材料科学、生命科学等领域展现出强大的微尺度表征能力... 扫描透射电子显微镜(Scanning transmission electron microscopy,STEM)目前已经达到了原子级分辨率,并且由于其具有灵活的多通道成像能力以及强大的与谱学分析相结合的特点,因此在材料科学、生命科学等领域展现出强大的微尺度表征能力。但传统STEM的探测器受单像素积分式探测机制的限制,使其只能收集特定角度的散射电子,这导致不仅丢失了散射电子的角分辨信息,还降低了入射电子的剂量效率,因此迫切需要发展全新成像技术来实现高通量、高电子剂量效率成像。近年来,电子探测技术和分区或像素化探测器的研发联合计算机运算、存储能力的大幅提高,推动了四维扫描透射电子显微镜技术(Four-dimensional scanning transmission electron microscopy,4D-STEM)的蓬勃发展,并为最大化、最高效挖掘散射电子信息带来希望。在采集4D-STEM数据时,会聚电子束在样品平面上进行二维扫描,与此同时使用一块具有高帧速、高动态范围以及高信噪比的像素化阵列式探测器在远场收集二维的衍射数据。因为这些衍射数据是角度解析的,所以既可以用来进行常规的STEM成像,也可以用来实现前沿的相位衬度成像。例如利用电子叠层重构(Ptychography)技术通过在不同空间位置测量的一系列衍射花样来重建样品物函数。此外,4D-STEM技术还可以被进一步挖掘从而获得更多关于材料内部结构的信息,这为材料的多尺度表征带来机会。本文从4D-STEM技术原理介绍开始,总结了4D-STEM技术从材料微观结构到物性分析方面的一系列应用。具体而言,内容包含了虚拟探测器成像、微区电磁场测量、微区晶体取向测量、微区应变分布测量以及材料局域厚度测量等材料微尺度表征方面的原理和应用。除此之外,利用4D-STEM数据实现的电子叠层重构成像技术因为具有较高的散射电子利用效率,所以在低电子剂量领域展现出极大的应用潜力,因此本文还对4D-STEM技术在低电子剂量领域的应用进行了探讨与展望。总而言之,随着电子探测器以及4D-STEM数据后处理分析软件的快速发展,相信新颖的4D-STEM技术最终将彻底取代传统的扫描透射电子显微镜。 展开更多
关键词 扫描透射电子显微镜 电磁场分布 叠层成像 晶体取向 应变分布 低剂量成像
下载PDF
Clothing Needs for Wheelchair Users: A Systematic Literature Review
2
作者 qilong feng Chi-Leung Hui 《Advances in Aging Research》 2021年第1期1-30,共30页
The aim of this study was to identify the clothing needs of wheelchair users using relevant literatures in a global scale and to design a method to classify the clothing needs into a unified system, in order to genera... The aim of this study was to identify the clothing needs of wheelchair users using relevant literatures in a global scale and to design a method to classify the clothing needs into a unified system, in order to generate a map of wheelchair users’ clothing needs with the information from multiple resources. The paper reviewed the previous studies about clothing needs and preference of wheelchair users. A three-tier screening was designed to extract main findings from the relevant literature. Content analysis and statistical analysis w</span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">ere</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;"> used to integrate the information and identify implications. Information was categorized to represent the attributes of the clothing needs. The paper provides comprehensive insights about the specific barriers and abstract demands about the clothing needs of wheelchair users regarding their preference </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">for</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;"> apparel products. Eight essential attributes relating to the clothing needs of wheelchair users were identified: functional needs, fit attribute fabric and fiber, safety issue, aesthetic needs, expressive needs, quality of life, and extrinsic attributes. The attributes were classified into two general domains, reflecting the physical challenges and psychological desires of wheelchair users. 展开更多
关键词 Wheelchair User Disabled People Clothing Needs APPAREL GARMENT
下载PDF
优先k-设施选址问题的近似算法
3
作者 张震 冯启龙 +3 位作者 徐雪松 彭晗 刘利枚 石峰 《中国科学:信息科学》 CSCD 北大核心 2024年第7期1588-1603,共16页
给定度量空间中的一个设施集合与一个带有最低服务级别要求的用户集合,优先k-设施选址问题的目标是开设最多k个设施,在每个开设设施上安置不同级别的服务,并将每个用户连接到一个能满足其服务级别要求的开设设施上,使得设施开设费用、... 给定度量空间中的一个设施集合与一个带有最低服务级别要求的用户集合,优先k-设施选址问题的目标是开设最多k个设施,在每个开设设施上安置不同级别的服务,并将每个用户连接到一个能满足其服务级别要求的开设设施上,使得设施开设费用、服务安置费用与用户连接费用之和最小.本文利用拉格朗日(Lagrange)松弛技术求解优先k-设施选址问题,针对用户的服务级别要求提出了新的确定化舍入方法,并基于此给出了多项式时间的(7.9533+ε)-近似算法.这是关于该问题的第一个常数近似算法. 展开更多
关键词 设施选址 近似算法 拉格朗日松弛
原文传递
Kernelization in Parameterized Computation: A Survey
4
作者 qilong feng Qian Zhou +1 位作者 Wenjun Li Jianxin Wang 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第4期338-345,共8页
Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton... Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton in parameterized computation has recently become an active research area. In this paper, we discuss several kernelizaiton techniques, such as crown decomposition, planar graph vertex partition, randomized methods, and kernel lower bounds, which have been used widely in the kernelization of many hard problems. 展开更多
关键词 parameterized computation kernelization parameterized algorithm NP-hard
原文传递
Distances Between Phylogenetic Trees: A Survey
5
作者 feng Shi qilong feng +2 位作者 Jianer Chen Lusheng Wang Jianxin Wang 《Tsinghua Science and Technology》 SCIE EI CAS 2013年第5期490-499,共10页
Phylogenetic trees have been widely used in the study of evolutionary biology for representing the tree-like evolution of a collection of species. However, different data sets and different methods often lead to the c... Phylogenetic trees have been widely used in the study of evolutionary biology for representing the tree-like evolution of a collection of species. However, different data sets and different methods often lead to the construction of different phylogenetic trees for the same set of species. Therefore, comparing these trees to determine similarities or, equivalently, dissimilarities, becomes the fundamental issue. Typically, Tree Bisection and Reconnection(TBR)and Subtree Prune and Regraft(SPR) distances have been proposed to facilitate the comparison between different phylogenetic trees. In this paper, we give a survey on the aspects of computational complexity, fixed-parameter algorithms, and approximation algorithms for computing the TBR and SPR distances of phylogenetic trees. 展开更多
关键词 phylogenetic tree tree bisection and reconnection subtree prune and regraft fixed-parameter algorithm approximation algorithm
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部