Query：
学者姓名：张栋
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
3D concrete printing (3DCP) faces challenges in the automated integration of reinforcement. The use of strain-hardening cementitious composites (SHCCs) with high ductility offers a promising solution to this issue. However, the high cement content in printable SHCC increases the carbon footprint, contributing to heavy environmental burden. This study investigates using diatomite (DE), a natural sedimentary rock, to develop sustainable SHCC for 3DCP. Diatomite partially replaces ordinary Portland cement, and the effects of various DE replacement ratios (10 %, 20 %, 30 %) on fresh properties, mechanical properties, hydration, and microstructure are experimentally examined. Sustainability analysis is conducted using life cycle assessment (LCA). Results show that a 30 % DE replacement ratio increases the dynamic yield stress, static yield stress, and plastic viscosity by 31.7 %, 79.7 %, and 239.5 %, respectively. A 10 % DE replacement achieves the highest mechanical properties, with tensile, compressive, and flexural strengths increased by 54.6 %, 14.0 %, and 27.4 %, respectively, compared to the reference group. A 10 % DE replacement ratio enhances the hydration process with increased calcium silicate hydrate gels formation and refines the microstructure. DE replacement ratio above 20 % negatively impacts hydration due to insufficient portlandite, while the porous structure of unhydrated DE increases the total porosity by 18.4 %. LCA results show a 25.8 % reduction in global warming potential can be achieved. The findings reveal that the developed DE-SHCC has the potential to facilitate sustainability and enhance the mechanical properties in construction 3D printing. © 2025
Keyword ：
Bending strength Bending strength Carbon footprint Carbon footprint Compressive strength Compressive strength Concretes Concretes Portland cement Portland cement Silicates Silicates Strain hardening Strain hardening Tensile strength Tensile strength
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Teng, Fei , Xu, Fengming , Yang, Minxin et al. Development of sustainable strain-hardening cementitious composites containing diatomite for 3D printing [J]. | Journal of Building Engineering , 2025 , 103 . |
| MLA | Teng, Fei et al. "Development of sustainable strain-hardening cementitious composites containing diatomite for 3D printing" . | Journal of Building Engineering 103 (2025) . |
| APA | Teng, Fei , Xu, Fengming , Yang, Minxin , Yu, Jie , Zhang, Dong , Weng, Yiwei . Development of sustainable strain-hardening cementitious composites containing diatomite for 3D printing . | Journal of Building Engineering , 2025 , 103 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This study developed a size-dependent model to predict the flexural strength of 3D printed engineered cementitious composites (ECC) beams with different beam spans. The proposed model relates the flexural strength of printed ECC beams to beam spans based on a stochastic tensile constitutive model of ECC, by taking the size effect into account. ECC beams with four spans (240 mm, 300 mm, 450 mm, and 1500 mm) were printed and tested by four-point bending. The results showed that the size-dependent model can predict the flexural strength with an approximate accuracy of 90%. Compared to the size-independent model, the proposed size-dependent model improved the prediction accuracy by approximately 27%. The force analysis of the shear strength of interlayers further revealed that interfacial bonding has a negligible impact on the simulated flexural strength. Consequently, the developed size-dependent model can potentially guide the structural design of 3D printed ECC beams.
Keyword ：
3D concrete printing 3D concrete printing Engineered cementitious composites Engineered cementitious composites Flexural strength Flexural strength Size-dependent model Size-dependent model Size effect Size effect
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yu, Jie , Teng, Fei , Ye, Junhong et al. Size-dependent model to predict the flexural strength of 3D printed engineered cementitious composites beams [J]. | CONSTRUCTION AND BUILDING MATERIALS , 2025 , 462 . |
| MLA | Yu, Jie et al. "Size-dependent model to predict the flexural strength of 3D printed engineered cementitious composites beams" . | CONSTRUCTION AND BUILDING MATERIALS 462 (2025) . |
| APA | Yu, Jie , Teng, Fei , Ye, Junhong , Zhang, Dong , Yu, Kequan , Yu, Jiangtao et al. Size-dependent model to predict the flexural strength of 3D printed engineered cementitious composites beams . | CONSTRUCTION AND BUILDING MATERIALS , 2025 , 462 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The cracking of double-block ballastless track slab concrete has become a critical issue, which can be mitigated through the use of low-heat Portland cement (LC), a MgO-based expansive agent (ME), and a shrinkage-reducing admixture (SR). However, the combined effects of these three components on shrinkage cracking of concrete have not yet been studied. In this paper, the drying shrinkage deformation, cracking risk index (eta), and microstructure of ordinary concrete and LC concrete with different contents of ME and SR are systematically studied. The findings indicate that LC decreases the cracking risk of concrete by approximately 38.7 % compared to ordinary Portland cement (PC). By generating expansion crystals and reducing the surface tension of pore solution, both ME and SR can further inhibit the shrinkage of LC, thereby improving the crack resistance of LC-concrete. A significant synergistic shrinkage reduction effect of ME (8 %) and SR (2 %) on LC-concrete is demonstrated, reducing the cracking risk by around 51.04 %. The combined use of SR and ME promotes the formation of more elongated brucite crystals, enhancing particle interaction and improving the cracking resistance of LC. These findings offer essential insights for designing concrete with high crack resistance, ensuring that the cracking risk index remains below the acceptable threshold.
Keyword ：
Concrete for track slab Concrete for track slab Cracking risk Cracking risk Low-heat cement Low-heat cement Magnesium oxide expansion agent Magnesium oxide expansion agent Shrinkage reducing agent Shrinkage reducing agent
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Fang, Lei , Fu, Dabao , Yuan, Qiang et al. Combined effects of low-heat cement, expansive agent and shrinkage-reducing admixture on drying shrinkage and cracking of concrete [J]. | CASE STUDIES IN CONSTRUCTION MATERIALS , 2025 , 22 . |
| MLA | Fang, Lei et al. "Combined effects of low-heat cement, expansive agent and shrinkage-reducing admixture on drying shrinkage and cracking of concrete" . | CASE STUDIES IN CONSTRUCTION MATERIALS 22 (2025) . |
| APA | Fang, Lei , Fu, Dabao , Yuan, Qiang , Xu, Song , Zhang, Dong , Cai, Huangyi et al. Combined effects of low-heat cement, expansive agent and shrinkage-reducing admixture on drying shrinkage and cracking of concrete . | CASE STUDIES IN CONSTRUCTION MATERIALS , 2025 , 22 . |
| 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 ：
The programmable switch offers a limited capacity of packet header vector (PHV) words that store packet header fields and metadata fields defined by network functions. However, existing switch compilers employ inefficient strategies of encoding fields on PHV words. Their encoding wastes scarce PHV words and may result in failures when deploying network functions. In this paper, we propose, a new framework that reuses PHV words for as many fields as possible to achieve resource-efficient PHV encoding. offers a field analyzer and an optimization framework. The analyzer identifies which fields can reuse PHV words while preserving the original packet processing logic. The framework integrates analysis results into its encoding to offer the resource-optimal decisions. Also, to achieve timeliness at runtime, it provides a Greedy-based heuristic, which quickly solves PHV encoding and returns near-optimal results. We evaluate with production-scale network functions. Our results show that reduces the consumption of PHV words by up to 85%.
Keyword ：
Encoding Encoding Metadata Metadata Optimization Optimization Packet header vector Packet header vector Production Production programmable switch programmable switch Program processors Program processors Runtime Runtime Vectors Vectors
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Xiang , Zhang, Wenbin , Sun, Xi et al. Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches [J]. | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 , 32 (5) : 4191-4206 . |
| MLA | Chen, Xiang et al. "Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches" . | IEEE-ACM TRANSACTIONS ON NETWORKING 32 . 5 (2024) : 4191-4206 . |
| APA | Chen, Xiang , Zhang, Wenbin , Sun, Xi , Liu, Hongyan , Zhang, Jianshan , Huang, Qun et al. Resource-Efficient and Timely Packet Header Vector (PHV) Encoding on Programmable Switches . | IEEE-ACM TRANSACTIONS ON NETWORKING , 2024 , 32 (5) , 4191-4206 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The flow table is a critical component of Software-Defined Networking (SDN). However, flow tables' limited capacity makes them highly vulnerable to flow table overflow attacks (FTOAs). Due to the low attack cost and highly flexible attack forms, it is hard to eradicate FTOAs. This paper addresses three unsolved problems for table security and proposes a robust defense accordingly. First, we reveal that the existing defenses with fixed defense speeds will cause severe packet loss when handling diverse traffic. We prove that deleting multiple rules can efficiently solve this problem and give a rigorous derivation to calculate the suitable deletion number according to the environment. Second, we illustrate that abnormal table occupancy squeezing is a constant characteristic of FTOAs regardless of attack forms. It can be used to identify attacked ports accurately in different scenarios. Third, we mathematically prove that random deletion can guarantee the continuous decrease of malicious flow rules after confirming attacked ports. It achieves fast speed and robust effectiveness in different environments. Based on these findings, we design rDefender, a robust and lightweight defense prototype. We evaluate its effect by designing diverse, powerful attacks and using real-world datasets and topology. The results demonstrate that it achieves the best overall performance compared to six existing mainstream defenses, providing stable security for switch flow tables.
Keyword ：
security security Software-defined networking Software-defined networking table overflow attacks table overflow attacks
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Kong, Dezhang , Chen, Xiang , Wu, Chunming et al. rDefender: A Lightweight and Robust Defense Against Flow Table Overflow Attacks in SDN [J]. | IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY , 2024 , 19 : 9436-9451 . |
| MLA | Kong, Dezhang et al. "rDefender: A Lightweight and Robust Defense Against Flow Table Overflow Attacks in SDN" . | IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 19 (2024) : 9436-9451 . |
| APA | Kong, Dezhang , Chen, Xiang , Wu, Chunming , Shen, Yi , Zhou, Zhengyan , Cheng, Qiumei et al. rDefender: A Lightweight and Robust Defense Against Flow Table Overflow Attacks in SDN . | IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY , 2024 , 19 , 9436-9451 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Tuple space search(TSS)-based packet classification is the keystone of network system. Previous studies accelerate TSS by partitioning tuples, combining trees and tuples, and merging tuples. However, they do not scale with the number of rules, resulting in a high memory footprint or update time. In this paper, we propose TupleRadar, a framework for accelerating TSS while ensuring low memory footprint and fast rule updates. Our key idea is to construct learned indexes for tuples, which inherently improve the lookup speed but ensure the advantages of TSS. Specifically, TupleRadar builds orderly hash table-based tuples and then constructs the updatable learned index. It provides a bounded memory footprint of the index structure as well. We have evaluated TupleRadar on multiple scales rule-sets. Experimental results show that TupleRadar outperforms previous solutions, reducing 46.66% lookup time and 61.53% memory footprint on average, by up to 86.70% and 88.95%. It also performs a competitive rule update speed.
Keyword ：
learned index learned index packet classification packet classification software-defined networking software-defined networking tuple space search tuple space search
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhu, Longlong , Yu, Jiashuo , Huang, Long et al. TupleRadar: Accelerating Tuple Space Search in Packet Classification by Learned Index [J]. | ACM 32ND INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE, IWQOS , 2024 . |
| MLA | Zhu, Longlong et al. "TupleRadar: Accelerating Tuple Space Search in Packet Classification by Learned Index" . | ACM 32ND INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE, IWQOS (2024) . |
| APA | Zhu, Longlong , Yu, Jiashuo , Huang, Long , Lin, Hang , Huang, Kaiwei , Zhou, Zhengyan et al. TupleRadar: Accelerating Tuple Space Search in Packet Classification by Learned Index . | ACM 32ND INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE, IWQOS , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The normal operation of data center network management tasks relies on accurate measurement of the network status. In-band Network Telemetry (INT) leverages programmable data planes to provide fine-grained and accurate network status. However, existing INT-related works have not considered the telemetry data required for dynamic adjustments of INT under uninterrupted conditions, including additions, deletions, and modifications. To address this issue, this paper proposes OpenINT, a lightweight and flexible In-band Network Telemetry system. The key innovation of OpenINT lies in decoupling telemetry operations in the data plane, using three generic sub-modules to achieve lightweight telemetry. Meanwhile, the control plane utilizes heuristic algorithms for dynamic planning to achieve near-optimal telemetry paths. Additionally, OpenINT provides primitives for defining network measurement tasks, which abstract the underlying telemetry architecture's details, enabling network operator to conveniently access network status. A prototype of OpenINT is implemented on a programmable switch equipped with the Tofino chip. Experimental results demonstrate that OpenINT achieves highly flexible dynamic telemetry and significantly reduces network overhead.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Cai, Jiayi , Lin, Hang , Sun, Tingxin et al. OpenINT: Dynamic In-band Network Telemetry with Lightweight Deployment and Flexible Planning [J]. | IEEE INFOCOM 2024-IEEE CONFERENCE ON COMPUTER COMMUNICATIONS , 2024 : 2488-2497 . |
| MLA | Cai, Jiayi et al. "OpenINT: Dynamic In-band Network Telemetry with Lightweight Deployment and Flexible Planning" . | IEEE INFOCOM 2024-IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (2024) : 2488-2497 . |
| APA | Cai, Jiayi , Lin, Hang , Sun, Tingxin , Zhou, Zhengyan , Zhu, Longlong , Chen, Haodong et al. OpenINT: Dynamic In-band Network Telemetry with Lightweight Deployment and Flexible Planning . | IEEE INFOCOM 2024-IEEE CONFERENCE ON COMPUTER COMMUNICATIONS , 2024 , 2488-2497 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Sketches are useful for network measurement thanks to their low resource overheads and theoretically bounded accuracy. However, their network-wide deployment suffers from the trade-off between optimality and scalability: (1) Most solutions rely on mixed integer linear programming (MILP) solvers to provide the optimal decisions. But they are time-consuming and can hardly scale to large-scale deployment scenarios. (2) While heuristics achieve scalability, they deteriorate resource and performance overheads. We propose Eagle, a framework that achieves scalable and near-optimal network-wide sketch deployment. Our key idea is to decompose network-wide sketch deployment into sub-problems. Such decomposition allows Eagle to (1) simultaneously optimize switch resource consumption and end-to-end performance (retaining optimality), and (2) incorporate time-saving techniques into sub-problem solving (achieving scalability). Compared to existing solutions, Eagle improves scalability by up to 255x with negligible loss of optimality. It has also saved administrators in a production network days of efforts and reduced the operation time from O(hour) to O(second).
Keyword ：
Network Measurement Network Measurement Network-Wide Deployment Network-Wide Deployment Sketch Sketch
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Xiang , Xiao, Qingjiang , Liu, Hongyan et al. Eagle: Toward Scalable and Near-Optimal Network-Wide Sketch Deployment in Network Measurement [J]. | PROCEEDINGS OF THE 2024 ACM SIGCOMM 2024 CONFERENCE, ACM SIGCOMM 2024 , 2024 : 291-310 . |
| MLA | Chen, Xiang et al. "Eagle: Toward Scalable and Near-Optimal Network-Wide Sketch Deployment in Network Measurement" . | PROCEEDINGS OF THE 2024 ACM SIGCOMM 2024 CONFERENCE, ACM SIGCOMM 2024 (2024) : 291-310 . |
| APA | Chen, Xiang , Xiao, Qingjiang , Liu, Hongyan , Huang, Qun , Zhang, Dong , Liu, Xuan et al. Eagle: Toward Scalable and Near-Optimal Network-Wide Sketch Deployment in Network Measurement . | PROCEEDINGS OF THE 2024 ACM SIGCOMM 2024 CONFERENCE, ACM SIGCOMM 2024 , 2024 , 291-310 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Blockchain suffers from network dynamics and management difficulties, making the anomalies such as DDoS attacks and account takeovers possible. Existing approaches that detect anomalies in blockchains extract features, such as historical transaction information and transaction frequencies, from blockchain accounts to identify anomalies. However, the increasing scale of blockchain data results in the challenge of high memory consumption and low detection accuracy in the feature extraction of existing approaches. To address this challenge, we propose a blockchain anomaly detection mechanism that achieves detection accuracy and reduces resource footprints. This mechanism embraces approximate sketching algorithms to transform the detection of blockchain anomalies into that of malicious accounts, including intra-block accounts and inter-block accounts. For intra-block accounts, i.e., the malicious accounts that occur inside a single block and the mechanism uses sketching algorithms to collectively filter out those accounts with high precision. For inter-block accounts, malicious accounts can be hardly detected by analyzing the information of a single block, it aggregates multi-block information to accurately detect those accounts. We evaluate our mechanism with real Ethereum block data comprising of 88 847 blocks. Our results indicate that compared with typical existing approaches, our mechanism improves the recall of detecting blockchain anomalies by up to 6.3 times and the F1 score by up to 4.4 times. Therefore, our proposed blockchain anomaly detection mechanism can bring benefits to regulating blockchain transaction behaviors and maintain system security. © 2024 Science Press. All rights reserved.
Keyword ：
Anomaly detection Anomaly detection Blockchain Blockchain
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhu, Longlong , Chen, Xiang , Chen, Haodong et al. An Accurate Blockchain Anomaly Detection Mechanism Built on Approximate Sketch Algorithms [J]. | Computer Research and Development , 2024 , 61 (10) : 2526-2539 . |
| MLA | Zhu, Longlong et al. "An Accurate Blockchain Anomaly Detection Mechanism Built on Approximate Sketch Algorithms" . | Computer Research and Development 61 . 10 (2024) : 2526-2539 . |
| APA | Zhu, Longlong , Chen, Xiang , Chen, Haodong , Niu, Jitang , Liu, Wenjing , Lin, Shengrui et al. An Accurate Blockchain Anomaly Detection Mechanism Built on Approximate Sketch Algorithms . | Computer Research and Development , 2024 , 61 (10) , 2526-2539 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
