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

20th IEEE International Conference on Mobile Ad Hoc and Smart Systems, MASS 2023

作者： Wang, Jiajun Mao, Yingchi Wang, Zibo Wu, Jun Wu, Jie Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources Nanjing China Hohai University School of Computer and Information Nanjing China Temple University Center for Networked Computing Philadelphia United States

ISBN: (纸本)9798350324334

Federated learning faces significant challenges of data heterogeneity among clients. In this heterogeneous data scenario, the preference of local models can result in gradient conflict during the global aggregation phase. This can significantly lead to a decrease in the global accuracy. In this paper, we present a novel Federated Learning Mitigating Gradient Conflict method named FedMGC that aims to mitigate gradient conflict. FedMGC replaces the cross-entropy loss function with the focal loss function. This balances the proportion of each class in the loss and reduces the preference of the local models for majority classes. In the global aggregation phase, we design the dominant gradient correction method called DGC to improve the global accuracy. Specifically, we select some of the gradients with small outliers to form the dominant gradients. And then we use dominant gradients to adjust the local gradients and alleviate the gradient conflict. In the evaluation experiments on heterogeneous datasets, FedMGC achieves higher test accuracy compared to baselines. In particular, over the CIFAR-10 dataset, FedMGC achieves 3.88%, 1.7% and 1.31% higher test accuracy than those of FedAvg, FedProx and FedNova, respectively. © 2023 IEEE.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

A structural VAR and VECM modeling method for open-high-low-close data contained in candlestick chart

引用

Financial Innovation 2024年第1期10卷 2017-2045页

作者： Wenyang Huang Huiwen Wang Shanshan Wang College of Economics and Management China Agricultural UniversityBeijingChina School of Economics and Management Beihang UniversityBeijingChina Key Laboratory of Complex System Analysis Management and Decision(Beihang University)Ministry of EducationBeijingChina Beijing Advanced Innovation Center for Big Data and Brain Computing BeijingChina

The structural modeling of open-high-low-close(OHLC)data contained within the candlestick chart is crucial to financial ***,the inherent constraints in OHLC data pose immense challenges to its structural *** that fail to process these constraints may yield results deviating from those of the original OHLC data *** address this issue,a novel unconstrained transformation method,along with its explicit inverse transformation,is proposed to properly handle the inherent constraints of OHLC data.A flexible and effective framework for structurally modeling OHLC data is designed,and the detailed procedure for modeling OHLC data through the vector autoregression and vector error correction model are provided as an example of multivariate time-series *** simulations and three authentic financial datasets from the Kweichow Moutai,CSI 100 index,and 50 ETF of the Chinese stock market demonstrate the effectiveness and stability of the proposed modeling *** modeling results of support vector regression provide further evidence that the proposed unconstrained transformation not only ensures structural forecasting of OHLC data but also is an effective feature-extraction method that can effectively improve the forecasting accuracy of machine-learning models for close prices.

关键词： OHLC data Structural modeling Unconstrained transformation Candlestick chart VAR VECM

来源：评论

学校读者我要写书评

暂无评论

AutoMiner: Reinforcement Learning-Based Mining Attack Simulator 24th

AutoMiner: Reinforcement Learning-Based Mining Attack Simula...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Li, Wei Xue, Lide Han, Ziyang Chen, Bingren Zhang, Xishan Zhou, Xuehai University of Science and Technology of China Hefei China ShangHai Municipal Big Data Center Shanghai China Anban Tech Co. Shanghai China State Key Laboratory of Processor Technologies Institute of Computing Technology Chinese Academy of Sciences Beijing China Cambricon Technologies Beijing China

ISBN: (纸本)9789819615247

As blockchain technology rapidly advances, it faces significant security threats from attacks like selfish mining, which exploit consensus algorithm vulnerabilities, undermining system security. Traditional analysis methods, primarily reliant on Markov models, are often utilized to address these complex threats. However, these methods frequently fall short in accurately simulating the multifaceted nature of blockchain attacks, leading to gaps in security measures. To bridge this gap, we introduce AutoMiner, an innovative reinforcement learning-based framework that integrates Miner Monte Carlo Tree Search (MMCTS) with Long Short-Term Memory (LSTM) networks for simulating and detecting potential mining attacks within the Proof of Work (PoW) framework. Our experimental results demonstrate AutoMiner’s capability to outperform traditional selfish and honest mining strategies, achieving up to 20% higher profits under specific scenarios. This highlights AutoMiner’s potential in enhancing blockchain security by providing a more comprehensive and effective approach to analyzing and mitigating mining attacks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Blockchain Reinforcement learning Security analysis

来源：评论

学校读者我要写书评

暂无评论

X-Stream: A Flexible, Adaptive Video Transformer for Privacy-Preserving Video Stream Analytics

X-Stream: A Flexible, Adaptive Video Transformer for Privacy...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Dou Feng Lin Wang Shutong Chen Lingching Tung Fangming Liu 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 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 Paderborn University Germany 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 Guangxi University China 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 Peng Cheng Laboratory China

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Video stream analytics (VSA) systems fuel many exciting applications that facilitate people’s lives, but also raise critical concerns about exposing too much individuals’ privacy. To alleviate these concerns, various frameworks have been presented to enhance the privacy of VSA systems. Yet, existing solutions suffer two limitations: (1) being scenario-customized, thus limiting the generality of adapting to multifarious scenarios, (2) requiring complex, imperative programming, and tedious process, thus largely reducing the usability of such systems. In this paper, we present X-Stream, a privacy-preserving video transformer that achieves flexibility and efficiency for a large variety of VSA tasks. X-Stream features three major novel designs: (1) a declarative query interface that provides a simple yet expressive interface for users to describe both their privacy protection and content exposure requirements, (2) an adaptation mechanism that dynamically selects the most suitable privacy-preserving techniques and their parameters based on the current video context, and (3) an efficient execution engine that incorporates optimizations for multi-task deduplication and inter-frame inference. We implement X-Stream and evaluate it with representative VSA tasks and public video datasets. The results show that X-Stream achieves significantly improved privacy protection quality and performance over the state-of-the-art, while being simple to use.

关键词： Privacy Transforms Streaming media Transformers Multitasking Real-time systems Task analysis

来源：评论

学校读者我要写书评

暂无评论

Pheromone Matrix Eigenvalue-based Convergence Assessment Indicator for Ant Colony Optimization 11

Pheromone Matrix Eigenvalue-based Convergence Assessment Ind...

引用

11th International Conference on Machine Intelligence Theory and Applications, MiTA 2024

作者： Li, Xu Shi, Lin Li, Jian-Yu Xu, Jing Zhan, Zhi-Hui South China University of Technology School of Computer Science and Engineering Guangzhou510006 China Guangdong University of Finance and Economics Research Center of Intelligent Computing & Big Data Technology Guangdong Guangzhou510320 China Nankai University College of Artificial Intelligence Tianjin300350 China

ISBN: (纸本)9798350385670

As a crucial member of the evolutionary computation (EC), ant colony optimization (ACO) converges to the optimal result through a continuous process of iterative optimization. However, determining the convergence status of an ant colony remains a challenging task without well-established methods. To this end, this paper proposes a global evaluation indicator - average absolute eigenvalue of pheromone matrix (AAEPM) by constructing a pheromone matrix and analyzing its eigenvalue variations. This indicator aims to assess the convergence status of the ant colony during the evolutionary process. Experimental results show that the AAEPM is correlated with the convergence status of ACO and is not significantly influenced by algorithm parameters and problem scale. © 2024 IEEE.

关键词： Anthropogenic

来源：评论

学校读者我要写书评

暂无评论

Demystifying Ethereum account diversity:observations,models and analysis

引用

Frontiers of Computer Science 2022年第4期16卷 119-130页

作者： Chaofan Wang Xiaohai Dai Jiang Xiao Chenchen Li Ming Wen Bingbing Zhou Hai Jin Clusters and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Centre for Distributed and High Performance Computing School of Information TechnologiesThe University of SydneyCamperdownNew South Wales2006Australia

Blockchain platform Ethereum has involved millions of accounts due to its strong potential for providing numerous services based on smart *** massive accounts can be divided into diverse categories,such as miners,tokens,and exchanges,which is termed as account diversity in this *** benefit of investigating diversity are multi-fold,including understanding the Ethereum ecosystem deeper and opening the possibility of tracking certain abnormal ***,the exploration of blockchain account diversity remains *** the most relevant studies,which focus on the deanonymization of the accounts on Bitcoin,can hardly be applied on Ethereum since their underlying protocols and user idioms are *** this end,we present the first attempt to demystify the account diversity on *** key observation is that different accounts exhibit diverse behavior patterns,leading us to propose the heuristics for classification as the *** then raise the coverage rate of classification by the statistical learning model Maximum Likelihood Estimation(MLE).We collect real-world data through extensive efforts to evaluate our proposed method and show its ***,we make an in-depth analysis of the dynamic evolution of the Ethereum ecosystem and uncover the abnormal arbitrage *** for the former,we validate two sweeping statements reliably:(1)standalone miners are gradually replaced by the mining pools and cooperative miners;(2)transactions related to the mining pool and exchanges take up a large share of the total *** latter analysis shows that there are a large number of arbitrage transactions transferring the coins from one exchange to another to make a price difference.

关键词： blockchain Ethereum classification account diversity network analysis

来源：评论

学校读者我要写书评

暂无评论

Toward High-Performance Delta-Based Iterative Processing with a Group-Based Approach

引用

Journal of Computer Science & Technology 2022年第4期37卷 797-813页

作者： Hui Yu Xin-Yu Jiang Jin Zhao Hao Qi Yu Zhang Xiao-Fei Liao Hai-Kun Liu Fu-Bing Mao Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Many systems have been built to employ the delta-based iterative execution model to support iterative algorithms on distributed platforms by exploiting the sparse computational dependencies between data items of these iterative algorithms in a synchronous or asynchronous approach. However, for large-scale iterative algorithms, existing synchronous solutions suffer from slow convergence speed and load imbalance, because of the strict barrier between iterations;while existing asynchronous approaches induce excessive redundant communication and computation cost as a result of being barrier-free. In view of the performance trade-off between these two approaches, this paper designs an efficient execution manager, called Aiter-R, which can be integrated into existing delta-based iterative processing systems to efficiently support the execution of delta-based iterative algorithms, by using our proposed group-based iterative execution approach. It can efficiently and correctly explore the middle ground of the two extremes. A heuristic scheduling algorithm is further proposed to allow an iterative algorithm to adaptively choose its trade-off point so as to achieve the maximum efficiency. Experimental results show that Aiter-R strikes a good balance between the synchronous and asynchronous policies and outperforms state-of-the-art solutions. It reduces the execution time by up to 54.1% and 84.6% in comparison with existing asynchronous and the synchronous models, respectively.

关键词： iterative algorithm delta-based execution model efficiency

来源：评论

学校读者我要写书评

暂无评论

OpticE: A Coherence Theory-Based Model for Link Prediction 29

OpticE: A Coherence Theory-Based Model for Link Prediction

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Gui, Xiangyu Zhao, Feng Jin, Langjunqing Jin, Hai 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

Knowledge representation learning is a key step required for link prediction tasks with knowledge graphs (KGs). During the learning process, the semantics of each entity are embedded by a vector or a point in a feature space. The distance between these points is a measure of semantic similarity. However, in a KG, while two entities may have similar semantics in some relations, they have different semantics in others. It is ambiguous to assign a fixed distance to depict the variant semantic similarity of entities. To alleviate the semantic ambiguity in KGs, we design a new embedding approach named OpticE, which is derived from the well-known physical phenomenon of optical interference. It is a lightweight and relation-adaptive model based on coherence theory, in which each entity’s semantics vary automatically regarding different relations. In addition, a unique negative sampling method is proposed to combine the multimapping properties and self-adversarial learning during the training process. The experimental results obtained on practical KG benchmarks show that the OpticE model, with elegant structures, can compete with existing link prediction methods. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

MeG2: In-Memory Acceleration for Genome Graphs Analysis 23

MeG2: In-Memory Acceleration for Genome Graphs Analysis

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Yu Huang Long Zheng Haifeng Liu Zhuoran Zhou Dan Chen Pengcheng Yao Qinggang Wang Xiaofei Liao Hai Jin National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China and Zhejiang Lab Hangzhou China National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798350323481

Genome graphs analysis has emerged as an effective means to enable mapping DNA fragments (known as reads) to the reference genome. It replaces the traditional linear reference with a graph-based representation to augment the genetic variations and diversity information, significantly improving the quality of genotyping. The in-depth characterization of genome graphs analysis uncovers that it is bottlenecked by the irregular seed index access and the intensive alignment operation, stressing both the memory system and computing *** on these observations, we propose MeG2, a lightweight, commodity DRAM-compliant, processing-in-memory architecture to accelerate genome graphs analysis. MeG2 is specifically integrated with the capabilities of both near-memory processing and bitwise in-situ computation. Specifically, MeG2 leverages the low access latency of near-memory processing with the index-centric offload mechanism to alleviate the irregular memory access in the seeding procedure, and harnesses the row-parallel capacity of in-situ computation with the distance-aware technique to exploit the intensive computational parallelism in the alignment process. Results show that MeG2 outperforms the CPU-, GPU-, and ASIC-based genome graphs analysis solutions by 502× (30.2×), 272× (15.1×), and 5.5× (8.3×) for short (long) reads, while reducing energy consumption by 1628× (85.6×), 1443× (77.1×), and 7.8× (11.7×), respectively. We also demonstrate that MeG2 offers significant improvements over existing PIM-based genome sequence analysis accelerators.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration

引用

Journal of Computer Science & Technology 2022年第5期37卷 1068-1085页

作者： Chun-Xue Zhu Long-Long Lin Ping-Peng Yuan Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Real-world networks,such as social networks,cryptocurrency networks,and e-commerce networks,always have occurrence time of interactions between *** networks are typically modeled as temporal *** cohesive subgraphs from temporal graphs is practical and essential in numerous data mining applications,since mining cohesive subgraphs gets insights into the time-varying nature of temporal ***,existing studies on mining cohesive subgraphs,such as Densest-Exact and k-truss,are mainly tailored for static graphs(whose edges have no temporal information).Therefore,those cohesive subgraph models cannot indicate both the temporal and the structural characteristics of *** this end,we explore the model of cohesive temporal subgraphs by incorporating both the evolving and the structural characteristics of temporal ***,the volume of time intervals in a temporal network is *** a result,the time complexity of mining temporal cohesive subgraphs is *** efficiently address the problem,we first mine the temporal density distribution of temporal *** by the distribution,we can safely prune many unqualified time intervals with the linear time ***,the remaining time intervals where cohesive temporal subgraphs fall in are examined using the greedy *** results of the experiments on nine real-world temporal graphs indicate that our model outperforms state-of-the-art solutions in efficiency and ***,our model only takes less than two minutes on a million-vertex DBLP and has the highest overall average ranking in EDB and TC metrics.

关键词： temporal network temporal feature distribution cohesive subgraph convex property

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：