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

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Xiaohai Dai Bin Xiao Jiang Xiao Hai 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 Computing The Hong Kong Polytechnic University Hong Kong

It has been recognized that one of the bottlenecks in the UTXO-based blockchain systems is the slow block validation - the process of validating a newly-received block by a node before locally storing it and further broadcasting it. As a block contains multiple inputs, the block validation mainly involves checking the inputs against the status data, which is also known as the Unspent Transaction Outputs (UTXO) set. As time goes by, the UTXO set becomes more and more expansive, most of which can only be stored on disks. This considerably slows down the input checking and thus block validation, which can potentially compromise system security. To deal with the above problem, we disassemble the function of input checking into three parts: existence validation (EV), unspent validation (UV), and script validation (SV). Based on the disassembly, we propose EBV, an efficient block validation mechanism to speed up EV, UV, and SV individually. First, EBV changes the representation of status data, from UTXO set to a bit-vector set, which drastically reduces its size. The smaller status data can be entirely maintained in memory, thereby accelerating UV and also block validation. Second, EBV requires each transaction to carry the proof data, which enables EV and SV without accessing the disks. Furthermore, we also cope with two challenges in the design of EBV, namely transaction inflation and fake positions. To evaluate the EBV mechanism, we implement a prototype on top of Bitcoin, the most widely known UTXO-based blockchain, and conduct extensive experiments to compare EBV and Bitcoin. The experimental results demonstrate that EBV successfully reduces the memory requirement by 93.1 % and the block validation time by up to 93.5%.

关键词： Distributed processing Memory management Prototypes Bitcoin Broadcasting Blockchains Delays

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

Congress on Evolutionary Computation

作者： Yongfeng Li Yuze Zhang Lijia Ma Junkai Ji Dugang Liu Victor C. M. Leung Jianqiang Li College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen China Department of Electrical and Computer Engineering The University of British Columbia Vancouver Canada

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms.

关键词： Measurement Correlation Sociology Evolutionary computation Reinforcement learning Germanium Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Shielding Federated Learning: Robust Aggregation with Adaptive Client Selection

arXiv

引用

arXiv 2022年

作者： Wan, Wei Hu, Shengshan Lu, Jianrong Yu Zhang, Leo Jin, Hai He, Yuanyuan School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab School of Information Technology Deakin University Australia

Federated learning (FL) enables multiple clients to collaboratively train an accurate global model while protecting clients’ data privacy. However, FL is susceptible to Byzantine attacks from malicious participants. Although the problem has gained significant attention, existing defenses have several flaws: the server irrationally chooses malicious clients for aggregation even after they have been detected in previous rounds;the defenses perform ineffectively against sybil attacks or in the heterogeneous data setting. To overcome these issues, we propose MAB-RFL, a new method for robust aggregation in FL. By modelling the client selection as an extended multi-armed bandit (MAB) problem, we propose an adaptive client selection strategy to choose honest clients that are more likely to contribute high-quality updates. We then propose two approaches to identify malicious updates from sybil and non-sybil attacks, based on which rewards for each client selection decision can be accurately evaluated to discourage malicious behaviors. MAB-RFL achieves a satisfying balance between exploration and exploitation on the potential benign clients. Extensive experimental results show that MAB-RFL outperforms existing defenses in three attack scenarios under different percentages of attackers. Copyright © 2022, The Authors. All rights reserved.

关键词： data privacy

来源：评论

学校读者我要写书评

暂无评论

MAST: Video Polyp Segmentation with a Mixture-Attention Siamese Transformer

arXiv

引用

arXiv 2024年

作者： Chen, Geng Yang, Junqing Pu, Xiaozhou Ji, Ge-Peng Xiong, Huan Pan, Yongsheng Cui, Hengfei Xia, Yong National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University Xi’an China School of Computing Australian National University Canberra Australia Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Harbin Institute of Technology China

Accurate segmentation of polyps from colonoscopy videos is of great significance to polyp treatment and early prevention of colorectal cancer. However, it is challenging due to the difficulties associated with modelling long-range spatio-temporal relationships within a colonoscopy video. In this paper, we address this challenging task with a novel Mixture-Attention Siamese Transformer (MAST), which explicitly models the long-range spatio-temporal relationships with a mixture-attention mechanism for accurate polyp segmentation. Specifically, we first construct a Siamese transformer architecture to jointly encode paired video frames for their feature representations. We then design a mixture-attention module to exploit the intra-frame and inter-frame correlations, enhancing the features with rich spatio-temporal relationships. Finally, the enhanced features are fed to two parallel decoders for predicting the segmentation maps. To the best of our knowledge, our MAST is the first transformer model dedicated to video polyp segmentation. Extensive experiments on the large-scale SUN-SEG benchmark demonstrate the superior performance of MAST in comparison with the cutting-edge competitors. Our code is publicly available at https://***/Junqing-Yang/MAST. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Identifying Users Transferring between Transportation Modes: A Stable Matching Approach

SSRN

引用

SSRN 2023年

作者： Yang, Hongtai Liu, Zheng Kondor, Daniel Han, Ke He, Zhengbing School of Transportation and Logistics National Engineering Laboratory of Integrated Transportation Big Data Application Technology National United Engineering Laboratory of Integrated and Intelligent Transportation Institute of System Science and Engineering Southwest Jiaotong University Chengdu China Complexity Science Hub Vienna Austria Beijing Key Laboratory of Traffic Engineering Beijing University of Technology Beijing China

Travel data containing personal identification information needs to be anonymized before being shared and analyzed for privacy considerations. In a multi-modal transport system with different operators covering one segment of the market and collecting their own customers’ travel data, it is typically difficult to identify the trajectory of the same traveler across these different modes (e.g. shared bikes, metro, bus). This has been the main hurdle to the understanding of complete trip chains and door-to-door travel patterns. To address this challenge, this paper develops TBLink, a method to match individual travelers between different modes. The underlying idea is that if a traveler makes a transfer, the spatial-temporal signatures of the previous and next trips will be similar and must satisfy certain conditions. When this pattern happens for two travelers in the two datasets repeatedly, we can infer that the two travelers are actually the same person. Traveler matching is regarded as a stable matching problem and the Gale-Shapley algorithm is used to solve the problem. TBLink is demonstrated using metro and bus trip data from Chengdu city between January and March 2021. Results show that the precision, recall, and recovery rate of user matching are 80.81%, 92.77%, and 10.56% respectively, and the matching is more reliable as the dataset increases. Sensitivity analysis is performed to study the effect of several model parameters on the matching performance. © 2023, The Authors. All rights reserved.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Spatio-Temporal State Estimation for Fine-Grained Adaptive Anomaly Diagnosis of Industrial Cyber-Physical systems

SSRN

引用

SSRN 2024年

作者： Sun, Haili Huang, Yan Han, Lansheng Fu, Cai Zhou, Chunjie Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China National Key Laboratory of Science and Technology on Multispectral Information Processing School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

Accurate detection and diagnosis of abnormal behaviors such as network attacks from multivariate time series (MTS) are crucial for ensuring the stable and effective operation of industrial cyber-physical systems (CPS). However, existing researches pay little attention to the logical dependencies among system working states, and have difficulties in explaining the evolution mechanisms of abnormal signals. To reveal the spatio-temporal association relationships and evolution mechanisms of the working states of industrial CPS, this paper proposes a fine-grained adaptive anomaly diagnosis method (i.e. MAD-Transformer) to identify and assess anomalies in MTS. A temporal and spatial state matrix are constructed to characterize state changes and inter-sensor correlations for precise anomaly localization. Subsequently, a three-branch structure of series-temporal-spatial attention module is designed to simultaneously capture the series, temporal, and spatial dependencies among MTS. Three associated alignment loss and a reconstruction loss are constructed to jointly optimize the model. Finally, anomalies are determined and diagnosed by comparing the residual matrices with the original matrices. Comparative experiments on five publicly datasets along with a petroleum refining simulation dataset demonstrate that MAD-Transformer can adaptively detect fine-grained anomalies with short duration, and outperforms the state-of-the-art baselines in terms of noise robustness and localization performance. © 2024, The Authors. All rights reserved.

关键词： State estimation

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Spatio-Temporal State Estimation for Fine-grained Adaptive Anomaly Diagnosis of Industrial Cyber-physical systems

arXiv

引用

arXiv 2024年

Accurate detection and diagnosis of abnormal behaviors such as network attacks from multivariate time series (MTS) are crucial for ensuring the stable and effective operation of industrial cyber-physical systems (CPS). However, existing researches pay little attention to the logical dependencies among system working states, and have difficulties in explaining the evolution mechanisms of abnormal signals. To reveal the spatio-temporal association relationships and evolution mechanisms of the working states of industrial CPS, this paper proposes a fine-grained adaptive anomaly diagnosis method (i.e. MAD-Transformer) to identify and diagnose anomalies in MTS. MAD-Transformer first constructs a temporal state matrix to characterize and estimate the change patterns of the system states in the temporal dimension. Then, to better locate the anomalies, a spatial state matrix is also constructed to capture the inter-sensor state correlation relationships within the system. Subsequently, based on these two types of state matrices, a three-branch structure of series-temporal-spatial attention module is designed to simultaneously capture the series, temporal, and space dependencies among MTS. Afterwards, three associated alignment loss functions and a reconstruction loss are constructed to jointly optimize the model. Finally, anomalies are determined and diagnosed by comparing the residual matrices with the original matrices. We conducted comparative experiments on five publicly datasets spanning three application domains (service monitoring, spatial and earth exploration, and water treatment), along with a petroleum refining simulation dataset collected by ourselves. The results demonstrate that MAD-Transformer can adaptively detect fine-grained anomalies with short duration, and outperforms the state-of-the-art baselines in terms of noise robustness and localization performance. © 2024, CC BY.

关键词： Cyber Physical system

来源：评论

学校读者我要写书评

暂无评论

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Network for Segmenting Pathology Lesion of the Focal Lymphocytic Sialadenitis

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Ne...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Hao Han Feng Lu Yanhan Deng Xiaofang Luo Hai Jin Wei Tu Xia Xie 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 Wuhan China Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

In the medical realm, the pivotal role of pathological Whole Slide Images (WSIs) in detecting cancer, tracking disease progression, and evaluating treatment efficacy is indisputable. Nevertheless, the identification and quantification of lesion areas in these gigapixel WSIs present a significant challenge due to their substantial size and the intricate details of lesions. To address these issues, we developed a novel multi-resolution and multi-scale cross fusion network (M 2 CF-Net), adept at managing large-scale pathological WSIs and capturing both fine details and context. Our model particularly focuses on segmenting local lymphocyte infiltration lesions in pathological WSIs of patients diagnosed with primary Sjogren's syndrome. By employing a patch-based training approach and combining interconnected elements via a multi-scale fusion technique, we enhance our model's capacity to detect and analyze structures and features in minor salivary gland section WSIs. Extensive experiments and ablation studies conducted on real-world clinical datasets affirm our model's superior accuracy in identifying lymphocyte-infiltrated regions over state-of-the-art models, with a performance improvement of up to 4.32% in terms of the Dice Similarity Coefficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Temporal Knowledge Graph Reasoning via Time-Distributed Representation Learning

Temporal Knowledge Graph Reasoning via Time-Distributed Repr...

引用

IEEE International Conference on data Mining (ICDM)

作者： Kangzheng Liu Feng Zhao Guandong Xu Xianzhi Wang Hai 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 Wuhan China Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Temporal knowledge graph (TKG) reasoning has attracted significant attention. Recent approaches for modeling historical information have led to great advances. However, the problems of time variability and unseen entities have become two major obstacles preventing further development. The time variability problem means that different historical timestamps play different roles in the inference process. Furthermore, in the context of time variability, the unseen entity problem means that a query cannot obtain a predicted entity that is unseen in the scale-varying history rather than in a fixed set, thus turning from static to dynamic. In this paper, we propose a novel method named DHU-NET for addressing the time variability challenge and the dynamic unseen entity challenge derived from it. With regard to the former concern, we propose a time-distributed representation learning method based on a graph convolutional network(GCN) and a self-attention mechanism, which learns the distributed representations of facts at different historical timestamps and comprehensively pays different levels of attention to the different timestamps. With regard to the latter issue, we extract the unseen entities from a global static KG based on a copy mechanism and bring them into consideration during the final prediction step. Experiments on six benchmark datasets demonstrate the substantial improvements achieved by DHUNET in terms of multiple evaluation metrics. Our released codes are available at https://***/CGCL-codes/DHUNET.

关键词： Representation learning Measurement Knowledge engineering Predictive models Turning Cognition data models

来源：评论

学校读者我要写书评

暂无评论

A Real-Time Demonstration of Bidirectional Multi-Format/Rate-Adjustable Integrated Laser Communication/Ranging for Satellite Communication

A Real-Time Demonstration of Bidirectional Multi-Format/Rate...

引用

Conference on Lasers and Electro-Optics (CLEO)

作者： Yizhou Wang Yuanxiang Wang Zhen Luo Linsheng Zhong Yang Zou Xueyuan Ao Jiale Liu Feng Fan Xiaoliang Li Xiaoxiao Dai Qi Yang Deming Liu Wuhan National Lab for Optoelectronics (WNLO) & National Engineering Laboratory for Next Generation Internet Access System School of Optical and Electronic Information Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Beijing Research Institute of Telemetry Beijing China Jinyinhu Laboratory Wuhan China

A multi-format/rate-adjustable integrated laser communication/ranging system is proposed, achieving adjustable rates between 0.625-10Gbit/s. Real-time experiment shows that at 1e-4 BER the ranging error is only 0.29% ... 详细信息

ISBN: (纸本)9798350369311

关键词： Laser theory Codes Sensitivity Lasers Measurement uncertainty Measurement by laser beam Electro-optic effects Real-time systems Distance measurement Satellite communications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：