检索结果-内蒙古大学图书馆

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhao, Jianjun Liu, Haikun Zhang, Shuhao Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Yu School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Engineering Nanyang Technological University Singapore

ISBN: (纸本)9798350317152

Transactional stream processing engines (TSPEs) have gained increasing attention due to their capability of processing real-time stream applications with transactional semantics. However, TSPEs remain susceptible to system failures and power outages. Existing TSPEs mainly focus on performance improvement, but still face a significant challenge to guarantee fault tolerance while offering high-performance services. We revisit commonly-used fault tolerance approaches in stream processing and database systems, and find that these approaches do not work well on TSPEs due to complex data dependencies. In this paper, we propose a novel TSPE called MorphStreamR to achieve fast failure recovery while guaranteeing low performance overhead at runtime. The key idea of MorphStreamR is to record intermediate results of resolved dependencies at runtime, and thus eliminate data dependencies to improve task parallelism during failure recovery. MorphStreamR further mitigates the runtime overhead by selectively tracking data dependencies and incorporating workload-aware log commitment. Experimental results show that MorphStreamR can significantly reduce the recovery time by up to 3.1 x while experiencing much less performance slowdown at runtime, compared with other applicable fault tolerance approaches. © 2024 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Seer: Accelerating Block chain Transaction Execution by Fine-Grained Branch Prediction 51st

Seer: Accelerating Block chain Transaction Execution by Fine...

引用

51st International Conference on Very Large data Bases, VLDB 2025

作者： Zhang, Shijie Cheng, Ru Liu, Xinpeng Xiao, Jiang Jin, Hai Li, Bo National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Increasingly popular decentralized applications (dApps) with complex application logic incur significant overhead for executing smart contract transactions, which greatly limits public block chain performance. Pre-executing transactions off the critical path can mitigate substantial I/O and computation costs during execution. However, pre-execution does not yield any state transitions, rendering the system state inconsistent with actual execution. This inconsistency can lead to deviations in pre-execution paths when processing smart contracts with multiple state-related branches, thus diminishing pre-execution effectiveness. In this paper, we develop Seer, a novel public block chain execution engine that incorporates fine-grained branch prediction to fully exploit pre-execution effectiveness. Seerpredicts state-related branches using a two-level prediction approach, reducing inconsistent execution paths more efficiently than executing all possible branches. To enable effective reuse of pre execution results, Seer employs checkpoint-based fast-path execution, enhancing transaction execution for both successful and unsuccessful predictions. Evaluations with realistic block chain workloads demonstrate that Seer delivers an average of 27.7× transaction-level speedup and an overall 20.6× speedup in the execution phase over vanilla Ethereum, outperforming existing block chain execution acceleration solutions. © 2025, VLDB Endowment, All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DDoS Detection and Defense Based on FLAD and SDN 20

DDoS Detection and Defense Based on FLAD and SDN

引用

20th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Dong, Jie Fang, Wenyu Zheng, Wanling Liu, Jinkun Liu, Yanhua College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China

ISBN: (纸本)9798350356328

In order to achieve more efficient and accurate DDoS detection while ensuring data privacy, this paper proposes a DDoS detection method based on FLAD. Firstly, this paper uses the FLAD algorithm to train a global DDoS detection model without leaving local traffic data, protecting the privacy and security of traffic data between different hosts, and improving aggregation efficiency by dynamically adjusting the aggregation weights to adapt to different sub-dataset increments. Secondly, a DDoS traffic detection method based on the integration of LSTM and CNN is proposed, which extracts and analyzes the temporal correlation of traffic data by calculating the statistical characteristics of traffic data within a time period, to achieve real-time detection of traffic feature data. Again, combined with the concept of SDN, real-time defense against DDoS based on ODL-API is implemented, and precise matching of DDoS detection results with network entity information is achieved, realizing the technology of real-time and precise issuance of multiple flow rules, effectively blocking DDoS malicious attack traffic, protecting important entities in the topology, and maintaining stable traffic in the topology. This paper focuses on solving the detection problem of DDoS traffic data increments and uneven data distribution through the FLAD algorithm. Experimental results show that the proposed method improves the accuracy of DDoS attack detection by more than 4% and the F1 Score by more than 7% compared to the FedAvg aggregation algorithm. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Towards Effective and Efficient Error Handling Code Fuzzing Based on Software Fault Injection 31

Towards Effective and Efficient Error Handling Code Fuzzing ...

引用

31st IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024

作者： Chen, Kang Wen, Ming Jia, Haoxiang Wu, Rongxin Jin, Hai Wuhan430074 China Jin YinHu Laboratory Wuhan430074 China School of Informatics Xiamen University Xiamen361005 China School of Computer Science and Technology HUST Wuhan430074 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security China Cluster and Grid Computing Lab China

ISBN: (纸本)9798350330663

Software systems often encounter various errors or exceptions in practice, and thus proper error handling code is essential to ensure the reliability of software systems. Unfortunately, error handling code is often bug-prone, while sufficiently testing them is challenging as such code often cannot be triggered under normal conditions. Motivated by this, recent studies have proposed to leverage software fault injection (SFI) based fuzzing to discover potential bugs in complicated error handling code. Despite the promising results achieved, their effectiveness and efficiency are still compromised in practice due to the huge search space of error sites, inadequate fuzzing guidance, and the overhead induced by context-sensitive SFI. To achieve effective and efficient testing of error handling code, this study presents AFL-FI, which first utilizes a similarity-based method to identify suspicious error sites, and then incorporates the idea of error site coverage to guide the fuzzing process. Finally, the design of lightweight context-sensitive SFI enables AFL-FI to execute test cases efficiently. We evaluate AFL-FI on eight large-scale open-source projects, and the results show that it can outperform existing state-of-the-art fuzzing tools significantly in terms of branch code coverage. More importantly, AFL-FI has discovered 13 previously unknown bugs, and all of them have been confirmed while 12 of them have been fixed. Besides, our evaluation also demonstrates that all the key designs of AFL-F I are effective that contribute significantly to its overall performance. © 2024 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

DFGET: Displacement-Field Assisted Graph Energy Transmitter for Gland Instance Segmentation 17

DFGET: Displacement-Field Assisted Graph Energy Transmitter ...

引用

17th IEEE International Conference on Signal Processing, ICSP 2024

作者： Jian, Caiqing Qin, Yongbin Wang, Lihui Ye, Chen Cheng, Xinyu Guizhou University Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang China

ISBN: (纸本)9798350387384

Gland instance segmentation is an essential but challenging task in the diagnosis of adenocarcinoma. The existing models usually achieve gland instance segmentation through multi-task learning and boundary loss constraint. However, how to deal with the problems of gland adhesion and inaccurate boundary in segmenting the complex samples remains a challenge. In this work, we propose a novel geometric feature named displacement field (DF), which can represent the geometric information such as shape, size, and orientation of the glands. Based on the explicit constraint of DF, a displacement-field assisted graph energy transmitter (DFGET) framework is proposed for solving the above problems. Using such graph framework, the gland semantic segmentation map and the displacement field of the graph nodes are estimated with two graph network branches. With the constraint of DF, a graph cluster module is presented to improve the intra-class feature consistency and inter-class feature discrepancy, as well as to separate the adherent glands. Extensive comparison and ablation experiments on the GlaS dataset demonstrate the effectiveness of the displacement field and the superiority of DFGET. Compared to the best comparative model, DFGET increases the object-Dice and object-F1 score by 2.27% and 3.11% respectively, while decreases the object-HD by 15.58, achieving state-of-the-art performance, which indicates that DFGET can serve as an auxiliary tool for the diagnosis of adenocarcinoma. © 2024 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A Graph Sequence Generator and Multi-head Self-attention Mechanism based Knowledge Graph Reasoning Architecture 26

A Graph Sequence Generator and Multi-head Self-attention Mec...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wu, Yuejia Zhou, Jian-Tao College of Computer Science Inner Mongolia University Hohhot China National & Local Joint Engineering Research Center Intelligent Info. Proc. Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Knowledge Graph (KG) is an essential research direction that involves storing and managing knowledge data, but its incompleteness and sparsity hinder its development in various applications. Knowledge Graph Reasoning (KGR) is an effective method to solve this limitation via reasoning missing knowledge based on existing knowledge. The graph Convolution Network (GCN) based method is one of the state-of-the-art approaches to this work. However, there are still some problems, such as the insufficient ability to perceive graph structure and the poor effect of learning data features which may limit the reasoning accuracy. This paper proposes a KGR architecture based on a graph sequence generator and multi-head self-attention mechanism, named GaM-KGR, to improve the above problems and enhance prediction accuracy. Specifically, the GaM-KGR first introduces the graph generation model into the field of KGR for graph representation learning to obtain the hidden features in the data so that enhancing the reasoning effect and then embeds the generated graph sequence into the multi-head self-attention mechanism for subsequent processing to improve the graph structure perception ability of the proposed architecture, so that it can process the graph structure data more appropriately. Extensive experimental results show that the GaM-KGR architecture can achieve the state-of-the-art prediction results of current GCN-based models. © 2023 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Optimizing the Copy-on-Write Mechanism of Docker by Dynamic Prefetching

引用

Tsinghua Science and technology 2021年第3期26卷 266-274页

作者： Yan Jiang Wei Liu Xuanhua Shi Weizhong Qiang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabHuazhong University of Science and TechnologyWuhan 430074China

Docker,as a mainstream container solution,adopts the Copy-on-Write(CoW)mechanism in its storage *** mechanism satisfies the need of different containers to share the same ***,when a single container performs operations such as modification of an image file,a duplicate is created in the upper readwrite layer,which contributes to the runtime *** the accessed image file is fairly large,this additional overhead becomes *** we present the concept of Dynamic Prefetching Strategy Optimization(DPSO),which optimizes the Co W mechanism for a Docker container on the basis of the dynamic prefetching *** the beginning of the container life cycle,DPSO pre-copies up the image files that are most likely to be copied up later to eliminate the overhead caused by performing this operation during application *** experimental results show that DPSO has an average prefetch accuracy of greater than 78%in complex scenarios and could effectively eliminate the overhead caused by the CoW mechanism.

关键词： Docker container Copy-on-Write(CoW) storage driver prefetch strategy

来源：评论

学校读者我要写书评

暂无评论

LSGraph: A Locality-centric High-performance Streaming Graph Engine 24

LSGraph: A Locality-centric High-performance Streaming Graph...

引用

19th European Conference on Computer Systems, EuroSys 2024

作者： Qi, Hao Wu, Yiyang He, Ligang Zhang, Yu Luo, Kang Cai, Minzhi Jin, Hai Zhang, Zhan Zhao, Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science University of Warwick United Kingdom Zhejiang Lab China

ISBN: (纸本)9798400704376

Streaming graph has been broadly employed across various application domains. It involves updating edges to the graph and then performing analytics on the updated graph. However, existing solutions either suffer from poor data locality and high computation complexity for streaming graph analytics, or need high overhead to search and move graph data to ensure ordered neighbors during streaming graph update. This paper presents a novel locality-centric streaming graph engine, called LSGraph, to enable efficient both graph analytics and graph update. The main novelty of this engine is a differentiated hierarchical indexed streaming graph representation approach to achieve efficient data search and movement for graph update and also maintain data locality and ordered neighbors for efficient graph analytics simultaneously. Besides, a locality-aware streaming graph data update mechanism is also proposed to efficiently regulate the distance of data movement, minimizing the overhead of memory access during graph update. We have implemented LSGraph and conducted a systematic evaluation on both real-world and synthetic datasets. Compared with three cutting-edge streaming graph engines, i.e., Terrace, Aspen, and PaC-tree, LSGraph achieves 2.98×-81.08×, 1.46×-12.56×, and 1.26×-10.31× speedups during graph update, while obtaining 1.02×-4.28×, 1.58×-3.55×, and 1.20×-2.72× speedups during graph analytics, respectively. © 2024 Owner/Author.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Identification of Key Genes as Potential Drug Targets for Gastric Cancer

引用

Tsinghua Science and technology 2023年第4期28卷 649-664页

作者： Md.Tofazzal Hossain Md.Selim Reza Yin Peng Shengzhong Feng Yanjie Wei Center for High Performance Computing Joint Engineering Research Center for Health Big Data Intelligent Analysis TechnologyShenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhen 518055China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Statistics Bangabandhu Sheikh Mujibur Rahman Science and Technology UniversityGopalganj 8100Bangladesh Guangdong Provincial Key Laboratory for Genome Stability and Disease Prevention and Regional Immunity and Diseases Department of PathologyShenzhen UniversityShenzhen 518060China

Gastric cancer(GC)is one of the most common cancers and ranks the third in cancer mortality all over the *** goal of this study was to identify potential hub-genes,highlighting their functions,signaling pathways,and candidate drugs for the treatment of GC *** used publicly available next generation sequencing(NGS)data to identify differentially expressed(DE)*** top DE genes were mapped to STRING database to construct the protein-protein interaction(PPI)network and top hub genes were selected for further *** found a total of 1555 DE genes with 870 upregulated and 685 downregulated genes in *** selected the top 400(200 upregulated and 200 downregulated)genes to construct a PPI network and extracted the top 15 hub *** gene ontology(GO)term and kyoto encyclopedia of genes and genomes(KEGG)pathway enrichment analyses of the 15 hub genes exposed some important functions and signaling pathways that were significantly associated with GC *** survival analysis of the hub genes disclosed that the lower expressions of the three hub genes CDH2,COL4A1,and COL5A2 were associated with better survival of GC *** three genes might be the candidate biomarkers for the diagnosis and treatment of ***,we considered 3 key proteins(genomic biomarkers)(COL4A1,CDH2,and CO5A2)as the drug target proteins(receptors),performed their docking analysis with the 102 meta-drug agents,and found Everolimus,Docetaxel,Lanreotide,Venetoclax,Temsirolimus,and Nilotinib as the top ranked 6 candidate drugs with respect to our proposed target proteins for the treatment against GC ***,the proposed drugs might play vital role for the treatment against GC patients.

关键词： gastric cancer hub genes candidate genes molecular docking candidate drugs

来源：评论

学校读者我要写书评

暂无评论

Automatic Segmentation Method for the Nuclei Contour of High Resolution Rat Brain 23

Automatic Segmentation Method for the Nuclei Contour of High...

引用

6th International Conference on big data Technologies, ICBDT 2023

作者： Xu, Xiaofeng Zheng, Wei Henan Engineering Research Center of Intelligent Processing for Big Data of Digital Image School of Computer Science and Technology Nanyang Normal University Nanyang473061 China

ISBN: (纸本)9798400707667

The brain consists of massive nuclei with different functions. In neuroscience research, the precise recognition and delineation of nucleus boundaries is the crux of brain atlas illustration. Here, we propose a method based on Markov Random Field. This method introduces fractional differentiation into texture feature extraction and a new potential energy function is defined based on kernel region information. To handle the problem of large data volume, we propose a strategy of dual MRF processing with down sampling for pre classification. Finally, the fuzzy entropy criterion is used to optimize the segmentation results. Experiments on model data and real tissue slice data show that this method can not only segment the regions with obvious differences in the density of the nuclei with insignificant differences in the density of nuclei, but also divide the nuclei without insignificant density differences by the cell shapes and textures. In addition, this method can not only segment a specific target kernel in one calculation, but also simultaneously partition multiple target kernels. The segmentation algorithm shows great potential for illustrating high-resolution 3D brain atlases. © 2023 ACM.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：