Query：
学者姓名：张栋
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
目的:建立基于深度学习的金属伪影去除系统（MARS），评估其对锥形束CT影像中不同厚度金属产生的伪影的去除效果。方法:采用三维打印的光敏树脂制作标准牙列模型（60 mm×75 mm×110 mm），设计目标牙位（上颌、下颌双侧第一和第二前磨牙）为可拆卸替换牙位，通过置入不同厚度（轴面及 面厚度均分别为1.0、1.5、2.0 mm，即A、B、C组）的钴铬合金全冠试件，获得完全配对的含有或不含有金属伪影的锥形束CT影像，并通过结构相似度（SSIM）及峰值信噪比（PSNR）评估不同厚度钴铬合金全冠试件产生伪影的范围。建立基于卷积神经网络（CNN）与U型网络（U-net）的MARS（CNN-MARS及U-net-MARS），检验CNN-MARS和U-net-MARS两种系统去伪影前后图像的SSIM值和PSNR值，评估其去伪影效果；通过可视化方式分析两种系统去除锥形束CT影像中金属伪影的效果。采用单因素方差分析分别对两种系统的SSIM值和PSNR值进行统计分析，检验水准为双侧α=0.05。 结果:A、B、C组钴铬合金全冠试件的SSIM值（分别为0.916±0.019、0.873±0.010、0.833±0.010）和PSNR值（分别为20.834±1.176、17.002±0.427、14.673±0.429）差异均有统计学意义（ F=447.89， P<0.001； F=796.51， P<0.001），并且随着钴铬合金全冠试件厚度增加，其SSIM及PSNR值均显著增加（ P<0.05）。对含有同一厚度钴铬合金全冠试件的图像，采用CNN-MARS与U-net-MARS去伪影后的SSIM和PSNR值均显著高于伪影去除前（均 P<0.05）。使用CNN-MARS去U-net-MARS伪影后，含不同厚度钴铬合金全冠试件图像的SSIM值和PSNR值差异均无统计学意义（均 P>0.05）。CNN-MARS与U-net-MARS去伪影后图像与原始图像的相似度较高；相比U-net-MARS，CNN-MARS去伪影后仍可见较清晰的金属边缘，目标区域的组织结构恢复更完整。 结论:本研究构建的锥形束CT图像金属伪影消除CNN-MARS与U-net-MARS模型，均可有效去除金属伪影的干扰，提升图像质量，且去伪影效果不受金属厚度的影响。相比于U-net-MARS，CNN-MARS对恢复伪影周围组织结构具有显著优势。
Keyword ：
U型网络 U型网络 卷积神经网络 卷积神经网络 去伪影 去伪影 金属伪影 金属伪影 锥束计算机体层摄影术 锥束计算机体层摄影术
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 贾泠卉 , 林泓磊 , 郑松炜 et al. 基于深度学习的锥形束CT钴铬合金全冠金属伪影去除研究 [J]. | 中华口腔医学杂志 , 2024 , 59 (1) : 71-79 . |
| MLA | 贾泠卉 et al. "基于深度学习的锥形束CT钴铬合金全冠金属伪影去除研究" . | 中华口腔医学杂志 59 . 1 (2024) : 71-79 . |
| APA | 贾泠卉 , 林泓磊 , 郑松炜 , 林秀娇 , 张栋 , 于皓 . 基于深度学习的锥形束CT钴铬合金全冠金属伪影去除研究 . | 中华口腔医学杂志 , 2024 , 59 (1) , 71-79 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Network Function Virtualization (NFV) decouples network functions from dedicated hardware devices into Virtual Network Functions (VNFs). These VNFs are chained in order as a Service Function Chain (SFC) to provision flexible and efficient services. When service requests dynamically increase, the intensive workloads often lead to node overloads and further impact the Quality of Service (QoS). Existing works address this problem by migrating VNFs from overload nodes to other low-load nodes, known as VNF migration. However, when a VNF is shared by multiple SFCs, migrating the VNF will change the mapping relationships between these SFCs and the physical network (nodes and links). That may make some SFCs traverse more links and increase their propagation latency. That violates the demand of users for low-latency services. In this paper, to minimize the impact of VNF migration on SFC latency, we propose partial VNF migration. It migrates only partial VNFs within these SFCs to minimize the overall SFC latency while reducing migration costs. As such, we leverage partial VNF migration for efficient latency minimization with the formulation of an integer linear programming (ILP) model. Given the NP-hard nature of the problem, we propose a dynamic latency-aware partial VNF migration algorithm to reduce node overloads and minimize SFC latency. Evaluation indicates that the proposed approach has 12.7%-21.8% lower average SFC latency and 12.5%-48.5% less migration cost than state -of -the -art VNF migration algorithms. And it demonstrates about 90% shorter execution time with similar minimization performance, compared to other SFC reconfiguration algorithms.
Keyword ：
Multi-access edge computing Multi-access edge computing Network function virtualization Network function virtualization Request dynamics Request dynamics Service function chain Service function chain VNF migration VNF migration
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Dongquan , Zhou, Zhengyan , Zhang, Dong et al. Efficient service reconfiguration with partial virtual network function migration [J]. | COMPUTER NETWORKS , 2024 , 241 . |
| MLA | Liu, Dongquan et al. "Efficient service reconfiguration with partial virtual network function migration" . | COMPUTER NETWORKS 241 (2024) . |
| APA | Liu, Dongquan , Zhou, Zhengyan , Zhang, Dong , Guo, Kaiwei , Wu, Yanni , Wu, Chunming . Efficient service reconfiguration with partial virtual network function migration . | COMPUTER NETWORKS , 2024 , 241 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
在各种网络流量中，突发是一种常见且重要的流量模式。突发会增大网络时延并影响应用性能，因此对突发流的检测、分析和缓解对于提升网络性能和鲁棒性是有意义的。然而，当前基于逐次突发的检测方案存在显著的带宽开销和高用户负担问题。文中通过观察并分析多个场景下的突发流量特征，提出了价值突发流(Remarkable Burst Flow, RBF)检测，在降低带宽开销的同时，减少了传统突发检测中的密集手工劳动和专家经验要求，减轻了网络管理者的负担。RBFRadar是基于Sketch数据结构的框架，支持可编程数据平面上的RBF检测，在一段时间内观察流级别的突发性。该框架仅产生有限的内存占用和低时间复杂性，其原型可在PISA架构上实现。实验结果表明，在检测RBF的准确性方面，RBFRadar的F1分数是现有方案的5.6～23.4倍；在带宽开销方面，与基于逐次突发的检测方案相比，RBFRadar可降低84.62%～98.84%的带宽开销。
Keyword ：
Sketch Sketch 可编程数据平面 可编程数据平面 数据中心网络 数据中心网络 突发流检测 突发流检测 网络测量 网络测量
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 吴艳妮 , 周政演 , 陈翰泽 et al. RBFRadar:基于可编程数据平面检测价值突发流 [J]. | 计算机科学 , 2024 , 51 (04) : 48-55 . |
| MLA | 吴艳妮 et al. "RBFRadar:基于可编程数据平面检测价值突发流" . | 计算机科学 51 . 04 (2024) : 48-55 . |
| APA | 吴艳妮 , 周政演 , 陈翰泽 , 张栋 . RBFRadar:基于可编程数据平面检测价值突发流 . | 计算机科学 , 2024 , 51 (04) , 48-55 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Network administrators usually realize network functions in data plane programs. They employ the network-wide program deployment that decomposes input programs into match-action tables (MATs) while deploying each MAT on a specific switch. Since MATs may be deployed on different switches, existing solutions propose the inter-switch coordination that uses the per-packet header space to deliver crucial packet processing information among switches. However, such coordination incurs non-trivial per-packet byte overhead, leading to end-to-end performance degradation. We propose, a framework that aims to minimize the per-packet byte overhead. The key idea is to formulate network-wide program deployment as a mixed-integer programming (MIP) problem with the objective of minimizing the per-packet byte overhead. Also, offers a greedy-based heuristic that solves the problem in a near-optimal and timely manner. We have implemented on Tofino switches. Compared to existing frameworks, decreases the per-packet byte overhead by 156 bytes while preserving end-to-end performance in terms of flow completion time and goodput.
Keyword ：
Control systems Control systems Degradation Degradation Indexes Indexes inter-switch coordination inter-switch coordination Metadata Metadata Optimization Optimization Program deployment Program deployment Research and development Research and development Synchronization Synchronization
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Xiang , Liu, Hongyan , Xiao, Qingjiang et al. Hermes: Low-Overhead Inter-Switch Coordination in Network-Wide Data Plane Program Deployment [J]. | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 , 32 (4) : 2842-2857 . |
| MLA | Chen, Xiang et al. "Hermes: Low-Overhead Inter-Switch Coordination in Network-Wide Data Plane Program Deployment" . | IEEE-ACM TRANSACTIONS ON NETWORKING 32 . 4 (2024) : 2842-2857 . |
| APA | Chen, Xiang , Liu, Hongyan , Xiao, Qingjiang , Huang, Qun , Zhang, Dong , Zhou, Haifeng et al. Hermes: Low-Overhead Inter-Switch Coordination in Network-Wide Data Plane Program Deployment . | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 , 32 (4) , 2842-2857 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
流式数据库在数据库中的占比逐渐增加，在流式数据库的数据流中提取所需信息是一项重要任务。文中研究了数据流的间隔项，并将其应用到了网络场景中。其中间隔项指在数据流中以固定时间间隔到达的元素对，这是第一项在数据流中定义和统计间隔项的工作。为了高效统计间隔项的top-K,提出了IntervalSketch。IntervalSketch首先基于模拟退火对数据流分块以加快统计速度，其次利用Sketch进行间隔项的存储，最后通过特征分组存储策略降低Sketch存储间隔项的空间开销，提升了统计间隔项的精度。IntervalSketch在两个真实数据集上进行了大量对比实验，实验结果表明，在同样内存的情况下，IntervalSketch明显优于基线方案，其中处理时间为基线方案的1/3～1/2,平均绝对误差、平均相对误差约为基线方案的1/3。
Keyword ：
Sketch Sketch 数据库 数据库 数据挖掘 数据挖掘
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈昕杨 , 陈翰泽 , 周嘉晟 et al. IntervalSketch:面向数据流的间隔项近似统计方法 [J]. | 计算机科学 , 2024 , 51 (04) : 4-10 . |
| MLA | 陈昕杨 et al. "IntervalSketch:面向数据流的间隔项近似统计方法" . | 计算机科学 51 . 04 (2024) : 4-10 . |
| APA | 陈昕杨 , 陈翰泽 , 周嘉晟 , 黄家卿 , 余佳硕 , 朱龙隆 et al. IntervalSketch:面向数据流的间隔项近似统计方法 . | 计算机科学 , 2024 , 51 (04) , 4-10 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Carbon-based nanomaterials such as graphene oxide sheetreinforced cementitious composites have attracted extensive interest owing to their improved post-fire mechanical properties. However, the role of graphene in anti-thermal detriment is still unclear. In the current study, the mechanical characteristics, pore structure, and interface evolution of graphene-toughened cementbased materials under high temperatures are investigated. Scanning electron microscope analysis showed that graphene implanted in the cement matrix had out-of-plane deformation at elevated temperature. The deformation caused the evolution of the interface between graphene and the cement-based material with respect to temperature. Correspondingly, the toughening effect of graphene on cement-based materials decreased first and then increased. The reinforced domain of graphene switched from mesopores to capillary pores when the temperature was beyond 400 degrees C, contributing to the enhanced reinforcement efficiency of the cement mortar. The interfacial evolution process with an in-depth analysis based on multiple scales would benefit from optimizing the design of graphene composites at high temperatures.
Keyword ：
cementitious materials cementitious materials elevated temperature elevated temperature graphene graphene inter- face evolution inter- face evolution thermal detriment thermal detriment
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhang, Zhenyu , Yao, Yao , Liu, Hu et al. Interfacial Evolution between Graphene and Cementitious Composites [J]. | ACI MATERIALS JOURNAL , 2024 , 121 (1) : 31-40 . |
| MLA | Zhang, Zhenyu et al. "Interfacial Evolution between Graphene and Cementitious Composites" . | ACI MATERIALS JOURNAL 121 . 1 (2024) : 31-40 . |
| APA | Zhang, Zhenyu , Yao, Yao , Liu, Hu , Zhang, Dong , Zhuge, Yan . Interfacial Evolution between Graphene and Cementitious Composites . | ACI MATERIALS JOURNAL , 2024 , 121 (1) , 31-40 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
区块链存在网络动态性强和其管理困难等问题，使得区块链普遍存在DDoS 攻击和账户接管等异常现象. 现有区块链异常检测方法多从所有区块链账户中提取历史交易信息和交易频率等特征加以分析以甄别异常. 然而，随着区块链数据规模的不断扩大，现有方法在提取特征时面临内存消耗高、检测精度低的挑战. 为此，提出了一种高检测精度、低内存开销的区块链异常检测机制，该机制采用近似测量算法将区块链异常检测转化为异常交易账户检测，包括区块内异常账户和跨区块异常账户. 对于区块内异常账户，即仅存在于单个区块内的异常账户，使用Sketch算法进行账户识别，精度高. 而对于存在于多个区块且难以通过单个区块信息检测到的跨区块异常账户，则通过聚合和分析多区块信息进行账户的准确检测. 使用包含88 847个区块的真实区块链数据评估上述机制. 实验结果表明，与现有代表性方法对比，所提出的机制将区块链异常检测的召回率最高提升了6.3倍，F1分数最高提升了4.4倍. 因此，提出的高精度区块链异常检测机制对于规范区块链交易行为、维护系统安全性具有意义.
Keyword ：
Sketch Sketch 区块链 区块链 安全 安全 异常检测 异常检测 近似算法 近似算法
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 朱龙隆 , 陈翔 , 陈浩东 et al. 基于近似测量算法Sketch的高精度区块链异常检测机制 [J]. | 计算机研究与发展 , 2024 , 61 (10) : 2526-2539 . |
| MLA | 朱龙隆 et al. "基于近似测量算法Sketch的高精度区块链异常检测机制" . | 计算机研究与发展 61 . 10 (2024) : 2526-2539 . |
| APA | 朱龙隆 , 陈翔 , 陈浩东 , 牛继堂 , 刘雯靓 , 林声睿 et al. 基于近似测量算法Sketch的高精度区块链异常检测机制 . | 计算机研究与发展 , 2024 , 61 (10) , 2526-2539 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
灰色故障是指对生产网络产生细微影响的交换机故障. 然而，当这些轻微故障相互叠加或与新增故障叠加时，可能会导致整个生产网络的瘫痪. 因此，检测灰色故障对生产网络的稳定性至关重要. 传统解决方案关注的是在控制平面收集数据平面交换机中的流记录，并对其进行处理以检测灰色故障. 然而，此类解决方案存在着不足：（1）缓存和处理大量的流记录会引入庞大的资源开销；（2）较高的检测时延无法保证灰色故障检测的时效性. 近年来，可编程交换机的出现为灰色故障检测技术带来了新机遇：网络管理员可以将灰色故障检测算法部署运行至可编程交换机的线速ASIC流水线上，从而支持低开销、低时延、高精度的网内灰色故障检测技术. 本文针对基于可编程交换机的网内灰色故障检测技术进行综述，在对灰色故障的概念、普遍性及对生产网络的危害进行描述的基础上，分析与讨论了现有基于可编程交换机的网内灰色故障检测技术的研究现状与进展，详细介绍每项技术的工作原理及流程，搭建真实的实验平台评估各项技术的检测指标，在文末指出了现有技术所面临的问题与挑战.
Keyword ：
可编程交换机 可编程交换机 数据中心网络 数据中心网络 数据报丢失 数据报丢失 灰色故障检测 灰色故障检测 网内计算 网内计算 网络测量 网络测量
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 刘宏岩 , 张栋 , 吴春明 . 基于可编程交换机的网内灰色故障检测技术研究进展 [J]. | 电子学报 , 2024 . |
| MLA | 刘宏岩 et al. "基于可编程交换机的网内灰色故障检测技术研究进展" . | 电子学报 (2024) . |
| APA | 刘宏岩 , 张栋 , 吴春明 . 基于可编程交换机的网内灰色故障检测技术研究进展 . | 电子学报 , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Programmable switches allow administrators to customize packet processing behaviors in data plane programs. However, existing solutions for program deployment fail to achieve resource efficiency and high packet processing performance. In this paper, we propose, a system that provides resource-efficient and high-performance deployment for data plane programs. For resource efficiency, merges input data plane programs by reducing program redundancy. Then it abstracts the substrate network into an one big switch (OBS), and deploys the merged program on the OBS while minimizing resource usage. For high performance, searches for the performance-optimal mapping between the OBS and the substrate network with respect to network-wide constraints. It also maintains program logic among different switches via inter-device packet scheduling. We have implemented on a Barefoot Tofino switch. The evaluation indicates that achieves resource-efficient and high-performance deployment for real data plane programs.
Keyword ：
Data plane programs Data plane programs packet processing performance packet processing performance program deployment program deployment programmable networks programmable networks resource efficiency resource efficiency
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Hongyan , Chen, Xiang , Huang, Qun et al. Toward Resource-Efficient and High-Performance Program Deployment in Programmable Networks [J]. | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 . |
| MLA | Liu, Hongyan et al. "Toward Resource-Efficient and High-Performance Program Deployment in Programmable Networks" . | IEEE-ACM TRANSACTIONS ON NETWORKING (2024) . |
| APA | Liu, Hongyan , Chen, Xiang , Huang, Qun , Sun, Guoqiang , Wang, Peiqiao , Zhang, Dong et al. Toward Resource-Efficient and High-Performance Program Deployment in Programmable Networks . | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The research of architecture has tremendous significance in realizing quantum Internet. Although there is not yet a standard quantum Internet architecture, the distributed architecture is one of the possible solutions, which utilizes quantum repeaters or dedicated entanglement sources in a flat structure for entanglement preparation & distribution. In this paper, we analyze the distributed architecture in detail and demonstrate that it has three limitations: 1) possible high maintenance overhead, 2) possible low-performance entanglement distribution, and 3) unable to support optimal entanglement routing. We design a hierarchical quantum Internet architecture and a communication model to solve the problems above. We also present a W-state Based Centralized Entanglement Preparation & Distribution (W-state Based CEPD) scheme and a Centralized Entanglement Routing (CER) algorithm within our hierarchical architecture and perform an experimental comparison with other entanglement preparation & distribution schemes and entanglement routing algorithms within the distributed architecture. The evaluation results show that the entanglement distribution efficiency of hierarchical architecture is 11.5% higher than that of distributed architecture on average (minimum 3.3%, maximum 37.3%), and the entanglement routing performance of hierarchical architecture is much better than that of a distributed architecture according to the fidelity and throughput.
Keyword ：
Computer architecture Computer architecture entanglement distribution entanglement distribution entanglement preparation entanglement preparation Internet Internet Protocols Protocols Quantum entanglement Quantum entanglement Quantum internet architecture Quantum internet architecture Qubit Qubit routing routing Routing Routing Teleportation Teleportation
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | He, Binjie , Zhang, Dong , Loke, Seng W. et al. Building a Hierarchical Architecture and Communication Model for the Quantum Internet [J]. | IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 2024 , 42 (7) : 1919-1935 . |
| MLA | He, Binjie et al. "Building a Hierarchical Architecture and Communication Model for the Quantum Internet" . | IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 42 . 7 (2024) : 1919-1935 . |
| APA | He, Binjie , Zhang, Dong , Loke, Seng W. , Lin, Shengrui , Lu, Luke . Building a Hierarchical Architecture and Communication Model for the Quantum Internet . | IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 2024 , 42 (7) , 1919-1935 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
