期刊文献+
共找到313篇文章
< 1 2 16 >
每页显示 20 50 100
Graph neural network-based scheduling for multi-UAV-enabled communications in D2D networks
1
作者 Pei Li Lingyi Wang +3 位作者 Wei Wu Fuhui Zhou Baoyun Wang Qihui Wu 《Digital Communications and Networks》 SCIE CSCD 2024年第1期45-52,共8页
In this paper,we jointly design the power control and position dispatch for Multi-Unmanned Aerial Vehicle(UAV)-enabled communication in Device-to-Device(D2D)networks.Our objective is to maximize the total transmission... In this paper,we jointly design the power control and position dispatch for Multi-Unmanned Aerial Vehicle(UAV)-enabled communication in Device-to-Device(D2D)networks.Our objective is to maximize the total transmission rate of Downlink Users(DUs).Meanwhile,the Quality of Service(QoS)of all D2D users must be satisfied.We comprehensively considered the interference among D2D communications and downlink transmissions.The original problem is strongly non-convex,which requires high computational complexity for traditional optimization methods.And to make matters worse,the results are not necessarily globally optimal.In this paper,we propose a novel Graph Neural Networks(GNN)based approach that can map the considered system into a specific graph structure and achieve the optimal solution in a low complexity manner.Particularly,we first construct a GNN-based model for the proposed network,in which the transmission links and interference links are formulated as vertexes and edges,respectively.Then,by taking the channel state information and the coordinates of ground users as the inputs,as well as the location of UAVs and the transmission power of all transmitters as outputs,we obtain the mapping from inputs to outputs through training the parameters of GNN.Simulation results verified that the way to maximize the total transmission rate of DUs can be extracted effectively via the training on samples.Moreover,it also shows that the performance of proposed GNN-based method is better than that of traditional means. 展开更多
关键词 Unmanned aerial vehicle d2 dcommunication graph neural network Power control Position planning
下载PDF
SGT-Net: A Transformer-Based Stratified Graph Convolutional Network for 3D Point Cloud Semantic Segmentation
2
作者 Suyi Liu Jianning Chi +2 位作者 Chengdong Wu Fang Xu Xiaosheng Yu 《Computers, Materials & Continua》 SCIE EI 2024年第6期4471-4489,共19页
In recent years,semantic segmentation on 3D point cloud data has attracted much attention.Unlike 2D images where pixels distribute regularly in the image domain,3D point clouds in non-Euclidean space are irregular and... In recent years,semantic segmentation on 3D point cloud data has attracted much attention.Unlike 2D images where pixels distribute regularly in the image domain,3D point clouds in non-Euclidean space are irregular and inherently sparse.Therefore,it is very difficult to extract long-range contexts and effectively aggregate local features for semantic segmentation in 3D point cloud space.Most current methods either focus on local feature aggregation or long-range context dependency,but fail to directly establish a global-local feature extractor to complete the point cloud semantic segmentation tasks.In this paper,we propose a Transformer-based stratified graph convolutional network(SGT-Net),which enlarges the effective receptive field and builds direct long-range dependency.Specifically,we first propose a novel dense-sparse sampling strategy that provides dense local vertices and sparse long-distance vertices for subsequent graph convolutional network(GCN).Secondly,we propose a multi-key self-attention mechanism based on the Transformer to further weight augmentation for crucial neighboring relationships and enlarge the effective receptive field.In addition,to further improve the efficiency of the network,we propose a similarity measurement module to determine whether the neighborhood near the center point is effective.We demonstrate the validity and superiority of our method on the S3DIS and ShapeNet datasets.Through ablation experiments and segmentation visualization,we verify that the SGT model can improve the performance of the point cloud semantic segmentation. 展开更多
关键词 3d point cloud semantic segmentation long-range contexts global-local feature graph convolutional network dense-sparse sampling strategy
下载PDF
单圈图的D(2)-点和可区别全染色
3
作者 强会英 刘欢 王洪申 《高校应用数学学报(A辑)》 北大核心 2024年第3期371-378,共8页
图G的D(2)-点和可区别全染色是指在图G的一个正常全染色φ下,G中任意两个距离不超过2的顶点u,v,其色集合中所有颜色数之和互不相同.使得G有一个k-D(2)-点和可区别全染色的最小整数k,称为图G的D(2)-点和可区别全色数.文中应用组合零点定... 图G的D(2)-点和可区别全染色是指在图G的一个正常全染色φ下,G中任意两个距离不超过2的顶点u,v,其色集合中所有颜色数之和互不相同.使得G有一个k-D(2)-点和可区别全染色的最小整数k,称为图G的D(2)-点和可区别全色数.文中应用组合零点定理和权转移方法刻画了单圈图的D(2)-点和可区别全染色,并得到其D(2)-点和可区别全色数. 展开更多
关键词 单圈图 全染色 d(2)-点和可区别全染色 权转移方法
下载PDF
GCR-Net:3D Graph convolution-based residual network for robust reconstruction in cerenkov luminescence tomography
4
作者 Weitong Li Mengfei Du +7 位作者 Yi Chen Haolin Wang Linzhi Su Huangjian Yi Fengjun Zhao Kang Li Lin Wang Xin Cao 《Journal of Innovative Optical Health Sciences》 SCIE EI CAS CSCD 2023年第1期15-25,共11页
Cerenkov Luminescence Tomography(CLT)is a novel and potential imaging modality which can display the three-dimensional distribution of radioactive probes.However,due to severe ill-posed inverse problem,obtaining accur... Cerenkov Luminescence Tomography(CLT)is a novel and potential imaging modality which can display the three-dimensional distribution of radioactive probes.However,due to severe ill-posed inverse problem,obtaining accurate reconstruction results is still a challenge for traditional model-based methods.The recently emerged deep learning-based methods can directly learn the mapping relation between the surface photon intensity and the distribution of the radioactive source,which effectively improves the performance of CLT reconstruction.However,the previously proposed deep learning-based methods cannot work well when the order of input is disarranged.In this paper,a novel 3D graph convolution-based residual network,GCR-Net,is proposed,which can obtain a robust and accurate reconstruction result from the photon intensity of the surface.Additionally,it is proved that the network is insensitive to the order of input.The performance of this method was evaluated with numerical simulations and in vivo experiments.The results demonstrated that compared with the existing methods,the proposed method can achieve efficient and accurate reconstruction in localization and shape recovery by utilizing threedimensional information. 展开更多
关键词 Cerenkov luminescence tomography optical molecular imaging optical tomography deep learning 3d graph convolution
下载PDF
一类仙人掌图的D(2)-点可区别全染色
5
作者 汪银芳 李沐春 王国兴 《吉林大学学报(理学版)》 CAS 北大核心 2024年第1期1-6,共6页
用数学归纳法和组合分析法给出最大度为3的仙人掌图G T的D(2)-点可区别全染色,进而得到χ_(2vt)(G T)≤6.结果表明,D(β)-VDTC猜想对最大度为3的仙人掌图成立.
关键词 仙人掌图 d(2)-点可区别全染色 d(2)-点可区别全色数
下载PDF
Performance analysis of graph-based scheduling for device-to-device communications overlaying cellular networks
6
作者 杜鹏 张源 《Journal of Southeast University(English Edition)》 EI CAS 2016年第3期272-277,共6页
The performance of the graph-based scheduling for device-to-device communications overlaying cellular networks is studied. The graph-based scheduling consists of two stages, the frequency assignment stage and the time... The performance of the graph-based scheduling for device-to-device communications overlaying cellular networks is studied. The graph-based scheduling consists of two stages, the frequency assignment stage and the time slot scheduling stage. For such scheduling, a theoretical method to analyze the average spectrum efficiency of the D2D subsystem is proposed. The method consists of three steps. First, the frequency assignment stage is analyzed and the approximate formula of the average number of the D2D links which are assigned the same frequency is derived. Secondly, the time slot scheduling stage is analyzed and the approximate formula of the average probability of a D2D link being scheduled in a time slot is derived. Thirdly, the average spectrum efficiency of the D2D subsystem is analyzed and the corresponding approximate formula is derived. Analysis results show that the average spectrum efficiency of the D2D subsystem is approximately inversely linearly proportional to the second- order origin moment of the normalized broadcast radius of D2D links. Simulation results show that the proposed method can correctly predict the average spectrum efficiency of the D2D subsystem. 展开更多
关键词 CELLULAR device-to-device d2d communication graph SCHEdULING spectrum efficiency
下载PDF
基于点面特征融合的RGB-D SLAM算法 被引量:2
7
作者 孙超 朱勇杰 +4 位作者 余林波 苗隆鑫 曹勉 叶力 郭乃宇 《计算机工程》 CAS CSCD 北大核心 2023年第6期201-207,共7页
传统的视觉SLAM算法主要依赖于点特征来构建视觉里程计,而在人造环境中通常存在一些点特征不足但结构特征丰富的场景,此时基于点特征的视觉里程计方法容易出现跟踪失败或位姿估计精度降低的问题。提出一种融合点面特征的RGB-D SLAM算法... 传统的视觉SLAM算法主要依赖于点特征来构建视觉里程计,而在人造环境中通常存在一些点特征不足但结构特征丰富的场景,此时基于点特征的视觉里程计方法容易出现跟踪失败或位姿估计精度降低的问题。提出一种融合点面特征的RGB-D SLAM算法,利用人造环境中的平面特征提高SLAM算法定位与建图的精度与鲁棒性。使用AGAST特征点提取算法并采用四叉树的方式进行改进,使特征点在图像中均匀分布以减少点特征提取的冗余度。同时,在传统点特征方法的基础上添加平面特征,使用连通域分割算法从点云中获取平面特征,并构建伪平面特征,结合AGAST特征点构建点面特征融合的结构约束因子图,添加多重约束关系用于图优化。实验结果表明,该算法AGAST特征点提取效率优于ORB-SLAM2算法,融合的点面特征使其在室内环境下的定位和建图精度更高,绝对轨迹误差减小约20%,相对轨迹误差减小约10%,单帧跟踪耗时减少约7.3%。 展开更多
关键词 RGB-d SLAM算法 AGAST算法 点云分割 点面特征融合 图优化
下载PDF
双圈图的D(2)-点可区别边染色 被引量:2
8
作者 贾秀卿 文飞 +1 位作者 李泽鹏 李沐春 《高校应用数学学报(A辑)》 北大核心 2023年第2期236-252,共17页
图G的一个正常k-边染色f满足对■u,v∈V(G),当d(u,v)≤2时都有S_(f)(u)≠S_(f)(v),其中S_(f)(v)={f(vw)|vw∈E(G)}表示顶点v的所有关联边上所染颜色构成的集合,则称f为图G的k-D(2)-点可区别边染色(简记为k-D(2)-VDEC),将其所需要颜色的... 图G的一个正常k-边染色f满足对■u,v∈V(G),当d(u,v)≤2时都有S_(f)(u)≠S_(f)(v),其中S_(f)(v)={f(vw)|vw∈E(G)}表示顶点v的所有关联边上所染颜色构成的集合,则称f为图G的k-D(2)-点可区别边染色(简记为k-D(2)-VDEC),将其所需要颜色的最小数k称为D(2)-点可区别边色数,简记为χ’_(2-vd)(G).结合Hall定理证明了最大度为△(G)的双圈图G都有χ’_(2-vd)(G)≤△(G)+2. 展开更多
关键词 双圈图 正常边染色 d(2)-点可区别边染色 d(2)-点可区别边色数
下载PDF
A Note on General Third Geometric-arithmetic Index of Special Chemical Molecular Structures 被引量:2
9
作者 Gao Wei 《Communications in Mathematical Research》 CSCD 2016年第2期131-141,共11页
In theoretical chemistry, the geometric-arithmetic indices were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this note, we report the general third geometric-arithmetic inde... In theoretical chemistry, the geometric-arithmetic indices were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this note, we report the general third geometric-arithmetic index of unilateral polyomino chain and unilateral hexagonal chain. Also, the third geometric-arithmetic index of these chemical structures are presented. 展开更多
关键词 molecular graph general third geometric-arithmetic index unilateralpolyomino chain unilateral hexagonal chain
下载PDF
基于PSO-GRNN和D-S证据理论的电网分区故障诊断 被引量:5
10
作者 邹红波 宋璐 +2 位作者 张馨煜 段治丰 宋家乐 《智慧电力》 北大核心 2023年第3期25-30,45,共7页
针对大电网中保护和断路器误动、拒动、信息丢失等不确定的电网故障信息以及现有电网分区方法的不足,提出了基于粒子群优化广义回归神经网络(PSO-GRNN)和D-S证据理论的电网分区故障诊断方法。首先,通过改进图形分割法将大电网划分为相... 针对大电网中保护和断路器误动、拒动、信息丢失等不确定的电网故障信息以及现有电网分区方法的不足,提出了基于粒子群优化广义回归神经网络(PSO-GRNN)和D-S证据理论的电网分区故障诊断方法。首先,通过改进图形分割法将大电网划分为相互重叠的不同区域,降低故障诊断难度。然后在各个区域建立PSOGRNN诊断模块,根据故障警报信息,并行完成各自的故障诊断任务。最后,采用D-S证据理论对相邻区域的重叠区域进行分析,以实现对重叠区域的综合故障诊断。仿真结果表明,该方法能有效识别非重叠区域和重叠区域的故障,容错能力强,诊断准确率高。 展开更多
关键词 电网分区 故障诊断 改进图形分割法 粒子群算法 广义回归神经网络 d-S证据理论
下载PDF
Deep Learning Accelerates the Discovery of Two- Dimensional Catalysts for Hydrogen Evolution Reaction 被引量:2
11
作者 Sicheng Wu Zhilong Wang +2 位作者 Haikuo Zhang Junfei Cai Jinjin Li 《Energy & Environmental Materials》 SCIE EI CAS CSCD 2023年第1期138-144,共7页
Two-dimensional materials with active sites are expected to replace platinum as large-scale hydrogen production catalysts.However,the rapid discovery of excellent two-dimensional hydrogen evolution reaction catalysts ... Two-dimensional materials with active sites are expected to replace platinum as large-scale hydrogen production catalysts.However,the rapid discovery of excellent two-dimensional hydrogen evolution reaction catalysts is seriously hindered due to the long experiment cycle and the huge cost of high-throughput calculations of adsorption energies.Considering that the traditional regression models cannot consider all the potential sites on the surface of catalysts,we use a deep learning method with crystal graph convolutional neural networks to accelerate the discovery of high-performance two-dimensional hydrogen evolution reaction catalysts from two-dimensional materials database,with the prediction accuracy as high as 95.2%.The proposed method considers all active sites,screens out 38 high performance catalysts from 6,531 two-dimensional materials,predicts their adsorption energies at different active sites,and determines the potential strongest adsorption sites.The prediction accuracy of the two-dimensional hydrogen evolution reaction catalysts screening strategy proposed in this work is at the density-functional-theory level,but the prediction speed is 10.19 years ahead of the high-throughput screening,demonstrating the capability of crystal graph convolutional neural networks-deep learning method for efficiently discovering high-performance new structures over a wide catalytic materials space. 展开更多
关键词 crystal graph convolutional neural network deep learning hydrogen evolution reaction two-dimensional(2d)material
下载PDF
3D scene graph prediction from point clouds
12
作者 Fanfan WU Feihu YAN +1 位作者 Weimin SHI Zhong ZHOU 《Virtual Reality & Intelligent Hardware》 EI 2022年第1期76-88,共13页
Background In this study,we propose a novel 3D scene graph prediction approach for scene understanding from point clouds.Methods It can automatically organize the entities of a scene in a graph,where objects are nodes... Background In this study,we propose a novel 3D scene graph prediction approach for scene understanding from point clouds.Methods It can automatically organize the entities of a scene in a graph,where objects are nodes and their relationships are modeled as edges.More specifically,we employ the DGCNN to capture the features of objects and their relationships in the scene.A Graph Attention Network(GAT)is introduced to exploit latent features obtained from the initial estimation to further refine the object arrangement in the graph structure.A one loss function modified from cross entropy with a variable weight is proposed to solve the multi-category problem in the prediction of object and predicate.Results Experiments reveal that the proposed approach performs favorably against the state-of-the-art methods in terms of predicate classification and relationship prediction and achieves comparable performance on object classification prediction.Conclusions The 3D scene graph prediction approach can form an abstract description of the scene space from point clouds. 展开更多
关键词 Scene understanding 3d scene graph Point cloud dGCNN GAT
下载PDF
图的L(d,1,1)-标号 被引量:7
13
作者 段滋明 苗正科 苗连英 《吉林大学学报(理学版)》 CAS CSCD 北大核心 2009年第6期1135-1139,共5页
给出了图L(d,1,1)-标号的一般性质.对一般图G,给出了构造L(d,1,1)-标号的一个算法,证明了λd,1,1(G)≤Δ3-Δ2+dΔ.对最大度Δ的树T,证明了d+Δ-1≤λd,1,1(T)≤d+2Δ-2,并且式中的上界与下界都是可达的.此外,对于两类特殊的树图:拟正则... 给出了图L(d,1,1)-标号的一般性质.对一般图G,给出了构造L(d,1,1)-标号的一个算法,证明了λd,1,1(G)≤Δ3-Δ2+dΔ.对最大度Δ的树T,证明了d+Δ-1≤λd,1,1(T)≤d+2Δ-2,并且式中的上界与下界都是可达的.此外,对于两类特殊的树图:拟正则树TΔ及正则毛毛虫Catn,给出了确切的L(d,1,1)-标号数,其中d≥2. 展开更多
关键词 图标号 L(d 1 1)-标号 频率分配
下载PDF
基于偏差有向图和D-H方法的产品装配精度预测技术 被引量:20
14
作者 刘伟东 宁汝新 +1 位作者 刘检华 蒋科 《机械工程学报》 EI CAS CSCD 北大核心 2012年第7期125-140,共16页
装配精度预测对于产品装配精度保证具有重要意义。综合产品偏差源和偏差统一模型表达,提出偏差的旋量映射方法;在零件配合、双配合偏差传递分析的基础上,给出装配偏差有向图(Directed deviation graph,DDG)模型,并提出产品装配偏差有向... 装配精度预测对于产品装配精度保证具有重要意义。综合产品偏差源和偏差统一模型表达,提出偏差的旋量映射方法;在零件配合、双配合偏差传递分析的基础上,给出装配偏差有向图(Directed deviation graph,DDG)模型,并提出产品装配偏差有向图的构建流程。基于DDG模型,进一步研究用于装配精度累积的最小偏差路及其Dijkstra求解算法。在最小偏差路基础上,针对一维线性方向的装配精度预测,给出刚性零件装配偏差统计量的求解方法;针对多维空间方向的装配精度预测,提出借鉴并联机器人末端位姿计算的D-H(Denavit-hartenberg,D-H)方法,进行刚性零件装配偏差统计量的求解流程。基于装配偏差统计量,进一步给出产品装配精度评价指标,以及产品装配精度预测方法。以某产品的装配为例,介绍装配偏差统计量的求解及其装配精度预测过程。 展开更多
关键词 装配精度预测 偏差有向图 最小偏差路 d-H 装配偏差统计量
下载PDF
概念格理论中的G-D基蕴涵约简研究 被引量:2
15
作者 马垣 王月行 +1 位作者 胡志宇 罗伟 《计算机应用研究》 CSCD 北大核心 2009年第10期3629-3631,共3页
概念格理论中的G-D基是一个形式背景的最小蕴涵基,从G-D基中可以产生一个背景的所有蕴涵,对G-D基的研究对于数据挖掘和规则提取都有很重要的意义。当G-D基中的蕴涵很多时,从它推导出背景中的全部蕴涵就很困难,减小G-D基的尺寸能够节省... 概念格理论中的G-D基是一个形式背景的最小蕴涵基,从G-D基中可以产生一个背景的所有蕴涵,对G-D基的研究对于数据挖掘和规则提取都有很重要的意义。当G-D基中的蕴涵很多时,从它推导出背景中的全部蕴涵就很困难,减小G-D基的尺寸能够节省很多时间。提出了利用概念层次图约简G-D基的尺寸,通过利用Armstrong公理系统比较说明了G-D基的尺寸变小后推导蕴涵的效率明显提高,并提出了恢复G-D基中的蕴涵的一种并行算法,该算法基于可约属性类对G-D基中的蕴涵进行恢复。 展开更多
关键词 背景 G-d 蕴涵 可约属性 概念层次图
下载PDF
电流型CMOS脉冲D触发器设计 被引量:9
16
作者 姚茂群 张立彬 耿亮 《电子与信息学报》 EI CSCD 北大核心 2014年第9期2278-2282,共5页
该文根据脉冲触发器的设计要求,结合阈算术代数系统,提出一种电流型CMOS脉冲D触发器的通用结构,用于二值及多值电流型CMOS脉冲触发器的设计,并可方便地应用于单边沿和双边沿触发。在此结构的基础上设计了电流型CMOS二值、三值以及四值脉... 该文根据脉冲触发器的设计要求,结合阈算术代数系统,提出一种电流型CMOS脉冲D触发器的通用结构,用于二值及多值电流型CMOS脉冲触发器的设计,并可方便地应用于单边沿和双边沿触发。在此结构的基础上设计了电流型CMOS二值、三值以及四值脉冲D触发器。采用TSMC 180 nm CMOS工艺参数对所设计的电路进行HSPICE模拟后表明所设计的电路具有正确的逻辑功能和良好的瞬态特性,且较以往文献提出的电流型D触发器,优化了触发器的建立时间和保持时间,二值和四值触发器最差最小D-Q延时比相关文献的主从触发器降低了59.67%和54.99%,比相关文献的边沿触发器降低了4.62%以上,所用晶体管数也相对减少,具有更简单的结构以及更高的电路性能。 展开更多
关键词 集成电路 通用结构 电流型CMOS电路 脉冲d触发器 阈算术代数系统 和图
下载PDF
路和圈上的锥的D(2)-点可区别正常边染色 被引量:14
17
作者 刘利群 陈祥恩 《山东大学学报(理学版)》 CAS CSCD 北大核心 2008年第2期87-97,共11页
设G是顶点集合为V(G)={v0i|i=1,2,…,p}的简单图,n是正整数,称Mn(G)为G上的锥(或广义My-cielski图),如果V(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…;vn1,vn2,…,vnp,w},E(Mn(G))=E(G)∪{vijv(i+1)k|v0jv0k∈E(G),1≤j,k≤p,i=0,1,…,n... 设G是顶点集合为V(G)={v0i|i=1,2,…,p}的简单图,n是正整数,称Mn(G)为G上的锥(或广义My-cielski图),如果V(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…;vn1,vn2,…,vnp,w},E(Mn(G))=E(G)∪{vijv(i+1)k|v0jv0k∈E(G),1≤j,k≤p,i=0,1,…,n-1}∪{vnjw|1≤j≤p}。讨论了路和圈上的锥的D(2)-点可区别正常边染色,并给出了相应的色数。 展开更多
关键词 d(2)-点可区别的正常边染色 d(2)-点可区别的正常边色数 图上的锥.
下载PDF
应用多尺度三维图搜索的SD-OCT图像层分割方法 被引量:8
18
作者 牛四杰 陈强 +1 位作者 陆圣陶 沈宏烈 《计算机科学》 CSCD 北大核心 2015年第9期272-277,共6页
频谱域光学相干层析技术(SD-OCT)是一种广泛应用于眼科领域的成像技术,视网膜组织层分割对视网膜疾病诊断起着至关重要的作用。传统的三维图搜索方法能够同时分割k(k≥1)个三维面,但其存在时间复杂度高、分割病变图像鲁棒性弱等问题。... 频谱域光学相干层析技术(SD-OCT)是一种广泛应用于眼科领域的成像技术,视网膜组织层分割对视网膜疾病诊断起着至关重要的作用。传统的三维图搜索方法能够同时分割k(k≥1)个三维面,但其存在时间复杂度高、分割病变图像鲁棒性弱等问题。在传统三维图搜索模型的基础上引入多尺度思想,提出应用多尺度三维图搜索的SDOCT视网膜图像分割方法。首先根据每个组织层的特点,为每层构造一个合理的顶点权重;然后利用相邻列的最大与最小高度差构造列约束限制,改进表面的平滑约束条件;最后利用低尺度的图像,应用三维图搜索方法进行粗分割,逐步向高一尺度应用三维图搜索方法进行单表面细分割。使用改进算法对3组正常眼睛及1组老年黄斑变性视网膜图像进行分割,并将结果与手动分割及传统三维图搜索方法进行比较,实验结果表明,改进算法能够准确有效地分割出3个层边界(边界位置绝对误差是3.86±2.50μm),并且接近于手动分割结果(3.78±2.76μm),优于传统三维图搜索方法(7.92±3.31μm)。 展开更多
关键词 Sd-OCT技术 视网膜图像分割 多尺度 三维图搜索
下载PDF
广义Petersen图的L(d,1)-标号 被引量:2
19
作者 马巧灵 张苏梅 《济南大学学报(自然科学版)》 CAS 2007年第3期256-258,共3页
图G的顶点集到非负整数集的一个映射f满足:对任意的x,y∈V(G),当dG(x,y)=1时,有f(x)-f(y)≥d;当dG(x,y)=2时,有f(x)-f(y)≥1。图的一个k-L(d,1)-标号是指图的一个标号L(d,1)使得min{f(v)|v∈V(G)}=k,标号数简记为λd(G)。研究了广义的Pe... 图G的顶点集到非负整数集的一个映射f满足:对任意的x,y∈V(G),当dG(x,y)=1时,有f(x)-f(y)≥d;当dG(x,y)=2时,有f(x)-f(y)≥1。图的一个k-L(d,1)-标号是指图的一个标号L(d,1)使得min{f(v)|v∈V(G)}=k,标号数简记为λd(G)。研究了广义的Petersen图的标号L(d,1),给出一个特殊的标号方法,得到了广义的Petersen图的标号数λd(G)≤4d。 展开更多
关键词 运筹学 L(d 1)-标号 PETERSEN图 广义的Petersen图
下载PDF
无线传感器网络中d-Hop 2-连通容错支配集的分布式构造算法 被引量:4
20
作者 郑婵 尹令 孙世新 《传感技术学报》 CAS CSCD 北大核心 2012年第5期696-701,共6页
无线传感器网络随节点移动组成自我维持的自组织系统,采用连通支配集的虚拟骨干技术可使平面网络系统层次化而简化节点路由、管理和维护。但大规模无线传感器网络的连通支配集节点数目依然庞大,d-hop连通支配集可以大大减小支配集节点... 无线传感器网络随节点移动组成自我维持的自组织系统,采用连通支配集的虚拟骨干技术可使平面网络系统层次化而简化节点路由、管理和维护。但大规模无线传感器网络的连通支配集节点数目依然庞大,d-hop连通支配集可以大大减小支配集节点数目。另外,由于存在节点失效、链路断裂等无线特性,虚拟骨干网需要具备一定的容错性。在单位圆盘图网络模型中为构建精简且具有容错能力的虚拟骨干网,提出d-hop 2-连通支配集的分布式构造算法,先构造d-hop独立支配集后再连通形成d-hop 2-连通支配集。并从理论和仿真上对算法的复杂度、近似比和算法性能作了进一步探讨和验证。 展开更多
关键词 无线传感器网络 虚拟骨干 d-hop连通支配集 2-连通支配集 容错 单位圆盘图
下载PDF
上一页 1 2 16 下一页 到第
使用帮助 返回顶部