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

11th International Symposium on Computing and Networking Workshops, CANDARW 2023

作者： Yamashita, Aoi Tanaka, Masahiro Bessho, Yutaro Fujiwara, Yasuhiro Kawashima, Hideyuki Graduate School of Keio University Japan Ntt Computer and Data Science Laboratories Japan Ntt Communication Science Laboratories Japan Keio University Japan

ISBN: (纸本)9798350306941

Raft is known as a replicating state machine that tolerates crash faults, and its use enables various distributed systems, including distributed transaction processing systems. The original Raft protocol creates an intra-cluster consensus by having the leader generate a log of each incoming client request and replicate it to its followers. When requests arrive frequently, the number of replications increases, increasing the number of communications and possibly leading to performance degradation. To solve this problem, we propose a bulk-transfer protocol that replicates multiple requests at once. We implemented the Raft system to verify the effect of the proposed method. We measured the performance of the implemented system when multiple requests were transferred in bulk and observed an increase in throughput with an increase in the amount of data replicated at a time. The highest throughput of 214 MB/sec was achieved when replicating 12.5 MB at a time. This is 12,066 times higher than the performance when replicating one request (18 B) at a time. Besides, the size of the log is reduced to 5/9 of the conventional method. © 2023 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Scale‐wise interaction fusion and knowledge distillation network for aerial scene recognition

引用

CAAI Transactions on Intelligence Technology 2023年第4期8卷 1178-1190页

作者： Hailong Ning Tao Lei Mengyuan An Hao Sun Zhanxuan Hu Asoke K.Nandi School of Computer Science and Technology Xi'an University of Posts and TelecommunicationsShaanxi Key Laboratory of Network Data Analysis and Intelligent ProcessingXi'anChina Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'anChina School of Electronic Information and Artificial Intelligence Shaanxi University of Science and TechnologyXi'anChina School of Computer Central China Normal UniversityWuhanChina Department of Electronic and Electrical Engineering Brunel University LondonLondonUK Xi'an Jiaotong University Xi'anChina

Aerial scene recognition(ASR)has attracted great attention due to its increasingly essential *** of the ASR methods adopt the multi‐scale architecture because both global and local features play great roles in ***,the existing multi‐scale methods neglect the effective interactions among different scales and various spatial locations when fusing global and local features,leading to a limited ability to deal with challenges of large‐scale variation and complex background in aerial scene *** addition,existing methods may suffer from poor generalisations due to millions of to‐belearnt parameters and inconsistent predictions between global and local *** tackle these problems,this study proposes a scale‐wise interaction fusion and knowledge distillation(SIF‐KD)network for learning robust and discriminative features with scaleinvariance and background‐independent *** main highlights of this study include two *** the one hand,a global‐local features collaborative learning scheme is devised for extracting scale‐invariance features so as to tackle the large‐scale variation problem in aerial scene ***,a plug‐and‐play multi‐scale context attention fusion module is proposed for collaboratively fusing the context information between global and local *** the other hand,a scale‐wise knowledge distillation scheme is proposed to produce more consistent predictions by distilling the predictive distribution between different scales during *** experimental results show the proposed SIF‐KD network achieves the best overall accuracy with 99.68%,98.74%and 95.47%on the UCM,AID and NWPU‐RESISC45 datasets,respectively,compared with state of the arts.

关键词： deep learning image analysis image classification information fusion

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Scheduling for Shared Manufacturing Systems 6

Multi-agent Scheduling for Shared Manufacturing Systems

引用

6th International Conference on Industry 4.0 and Smart Manufacturing, ISM 2024

作者： Duran, Ege Ozturk, Cemalettin O'Sullivan, Barry SFI Centre for Research Training in AI School of Computer Science IT University College Cork Ireland Department of Process Energy & Transport Engineering Munster Technological University Cork Ireland Insight SFI Research Centre for Data Analytics School of Computer Science & IT University College Cork Ireland

Advances in digitization and resource-sharing business models have created new opportunities for manufacturing companies, enhancing competitiveness and resilience. However, these benefits bring computational challenges in efficiently planning and scheduling shared resources. Therefore, there is a need for scalable and quick solutions for practical applications. Shared manufacturing systems share characteristics with parallel machine scheduling, allowing for the application of advancements from this domain. This research focuses on Multi-Agent Parallel Machine Scheduling (MAPMS) in shared manufacturing, specifically addressing scenarios involving two parallel machines and distinct agents managing exclusive, set of non-overlapping orders. The study introduces a novel multi-objective mixed integer programming (MIP) model for order scheduling across multiple facilities, accounting for sequence-dependent setup times between orders. It also proposes a new heuristic method designed for industrial use. Benchmark instances demonstrate the practicality of both the MIP model and heuristic, contributing valuable insights into MAPMS challenges in shared manufacturing environments. © 2025 The Authors.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of computer science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Hybrid GA-Cellular Encoding Approach to Neural Architecture Search

A Two-Stage Hybrid GA-Cellular Encoding Approach to Neural A...

引用

2023 IEEE Symposium Series on Computational Intelligence, SSCI 2023

作者： Londt, Trevor Gao, Xiaoying Andreae, Peter Mei, Yi Centre for Data Science and Artificial Intelligence School of Engineering and Computer Science Victoria University of Wellington PO Box 600 Wellington6140 New Zealand

ISBN: (纸本)9781665430654

Neural Architecture Search (NAS) aims to automate the creation of Artificial Neural Networks, including Convolutional Neural Networks (CNN), lessening the reliance on labour-intensive manual design by human experts. A CNN architecture can be decomposed into a micro- and macro-architecture, each influenced by distinct design and optimisation strategies to con-tribute to the overall construction and performance of the CNN. Cellular Encoding (CE), an evolutionary computation technique, has been successfully used to represent diverse network topologies of varying complexities. Recently, CE has been applied to evolve CNN architectures, showing promising results. However, current CE-based NAS approaches focus on evolving either the micro-or macro-architectures without considering the evolution of both in the same algorithm. Evolving the micro- and macro-architecture together can increase the performance of evolved CNN architectures. This research introduces a novel two-stage hybrid approach, combining Genetic Algorithms (GA) and CE to evolve both the micro- and macro-architectures to synthesise CNNs for classification tasks. Candidate macro-architectures are evolved using a CE approach, while a GA approach is used to explore the micro-architecture search space. The proposed algorithm is evaluated across four commonly used datasets and compared against six NAS peer competitors and five state-of-the-art manually designed CNN architectures. The results validate the approach's high competitiveness, outperforming several peer competitors on image and text classification tasks. © 2023 IEEE.

关键词： Cellular Encoding Convolutional Neural Networks Neural Architecture Search

来源：评论

学校读者我要写书评

暂无评论

Leveraging Deep Learning to Improve COVID-19 Forecasting Using Wastewater Viral Load

Leveraging Deep Learning to Improve COVID-19 Forecasting Usi...

引用

2023 IEEE International Conference on Big data, Bigdata 2023

作者： Fazli, Mehrdad Shakeri, Heman George Mason University Department of Computer Science FairfaxVA United States University of Virginia School of Data Science CharlottesvilleVA United States

ISBN: (纸本)9798350324457

The outburst of COVID-19 in late 2019 was the start of a health crisis that shook the world and took millions of lives in the ensuing years. Many governments and health officials failed to arrest the rapid circulation of infection in their communities. The long incubation period and the large proportion of asymptomatic cases made COVID-19 particularly elusive to track. However, wastewater surveillance soon became a promising data source in addition to conventional indicators such as confirmed daily cases, hospitalizations, and deaths. Despite the consensus on the effectiveness of wastewater viral load, there is a lack of methodological approaches that leverage viral load to improve COVID-19 forecasting. This paper proposes a deep learning framework to automatically discover the relationship between daily cases and viral load data. We trained a Deep Temporal Convolutional Network (DeepTCN) and a Temporal Fusion Transformer (TFT) model to obtain a global forecasting model. We supplement the daily confirmed cases with viral loads and other socio-economic factors as covariates to the models. Our results suggest that TFT outperforms DeepTCN and learns a better association between viral load and daily cases. We demonstrate that equipping the models with the viral load improves forecasting accuracy and reduces uncertainty. Moreover, viral load is shown to be the second most predictive input, following the containment and health index. Our results reveal the feasibility of training a location-agnostic deep-learning model to capture the dynamics of infection diffusion when wastewater viral load data is available. © 2023 IEEE.

关键词： COVID-19 Forecasting Deep Learning Wastewater-based epidemiology

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Model for Heterogeneous dataset Analysis - Application to Winter Wheat Crop Yield Prediction 8th

A Deep Learning Model for Heterogeneous Dataset Analysis - A...

引用

8th International Conference on Information, Communication and Computing Technology, ICICCT 2023

作者： Bansal, Yogesh Lillis, David Kechadi, M.-Tahar School of Computer Science University College Dublin Dublin Ireland Insight Centre for Data Analytics Dublin Ireland

ISBN: (纸本)9783031438370

Western countries rely heavily on wheat, and yield prediction is crucial. Time-series deep learning models, such as Long Short Term Memory (LSTM), have already been explored and applied to yield prediction. Existing literature reports that they perform better than traditional Machine Learning (ML) models. However, the existing LSTM cannot handle heterogeneous datasets (a combination of data that varies and remains static with time). In this paper, we propose an efficient deep learning model that can deal with heterogeneous datasets. We developed the system architecture and applied it to the real-world dataset in the digital agriculture area. We showed that it outperformed the existing ML models. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

A Method of Advanced Persistent Threat data Processing Based on Ensemble Learning 9

A Method of Advanced Persistent Threat Data Processing Based...

引用

9th International Conference on Intelligent Computing and Signal Processing, ICSP 2024

作者： Wang, Xuelong Zheng, Xin Tu, Yang School of Computer Science Xi'an Shiyou University Shaanxi Xi'an China Xi'an Shiyou University Internet data center Shaanxi Xi'an China

ISBN: (纸本)9798350376548

Finding the features with the highest correlation degree in the source APT data from network security devices is essential for preprocessing the data in order to train models that will increase the accuracy of APT attack classification. The preprocessing, cleaning, and feature transformation of the dataset are the first steps in the application of data mining techniques in this work. VarianceThreshold is ultimately chosen for feature selection to create the optimal feature subset after a range of feature selection techniques are used for experimental comparison. The best feature subset is then used to compare and evaluate several machine learning algorithms, and by integrating ensemble learning methods, the VT-stacking model is recommended. The experimental results demonstrate that the VT-stacking model developed in this paper achieves 97.3% accuracy in categorizing APT assaults after preprocessing the APT data. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading 23

AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Duan, Zhuohui Feng, Hao Liu, Haikun Liao, Xiaofei Jin, Hai Li, Bangyu National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133458

The key-value separation is renowned for its significant mitigation of the write amplification inherent in traditional LSM trees. However, KV separation potentially increases performance overhead in the management of Value region, especially for garbage collection (GC) operation that is used to reduce the redundant space occupation. In response, many efforts have been made to optimize the GC mechanism for KV separation. However, our analysis indicates that such solution based on trade-offs between CPU and I/O overheads cannot simultaneously satisfy the three requirements of KV separated systems in terms of throughput, tail latency, and space usage. This limitation hinders their real-world application. In this paper, we introduce AegonKV, a "three-birds-one-stone" solution that comprehensively enhances the throughput, tail latency, and space usage of KV separated systems. AegonKV first proposes a SmartSSD-based GC offloading mechanism to enable asynchronous GC operations without competing with LSM read/write for bandwidth or CPU. AegonKV leverages offload-friendly data structures and hardware/software execution logic to address the challenges of GC offloading. Experiments demonstrate that AegonKV achieves the largest throughput improvement of 1.28-3.3 times, a significant reduction of 37%-66% in tail latency, and 15%-85% in space overhead compared to existing KV separated systems. © 2025 FAST. All Rights Reserved.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：