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

9th Future Technologies Conference, FTC 2024

作者： Du, Yuxin Fan, Jing Happonen, Ari Paulraj, Dassan Tuape, Micheal Department of Software Engineering School of Engineering Sciences Lappeenranta-Lahti University of Technology Mukkulankatu 19 Lahti15210 Finland Department of Software Engineering School of Engineering Sciences Lappeenranta-Lahti University of Technology Yliopistonkatu 34 Lappeenranta53850 Finland Department of Computer Science and Engineering R.M.K. Engineering College Chennai India

ISBN: (纸本)9783031731242

Artificial Intelligence and Deep Learning-based methods show constant promise in addressing time series forecasting challenges. Lake water level forecasting is an essential & significant environmental and societal impact related time series forecasting problem, with climate change connections. Lakes’ diverse hydrological characteristics make high-performance forecasting models to be lake-specific. Thus, comprehensive experiments are necessary to develop accurate deep learning-based forecasting models. We propose an approach for effective and efficient systematic search conduction for high-performance Deep Learning forecasting models. The method is applicable across various time series forecasting challenges. The research was structured around three experimental groups, each focusing on predicting the water levels of Lake Vesijärvi in Lahti, Finland, over periods of 1 day, 3 days, and 7 days, respectively with Long Short-Term Memory and Gated Recurrent Unit. The results are highly promising. All models achieved a Nash-Sutcliffe Efficiency above 0.95 and a Root Mean Squared Error below 0.025. The best-performing model achieved a Nash-Sutcliffe Efficiency above 0.99 and a Root Mean Squared Error below 0.0011. All evaluation metrics were calculated from testing data without signs of overfitting. This research provides insights into Deep Learning-based time series forecasting and a replicable method to conduct such studies effectively. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Lakes

来源：评论

学校读者我要写书评

暂无评论

BCLB: A Scalable and Cooperative Layer-4 Load Balancer for Data Centers

BCLB: A Scalable and Cooperative Layer-4 Load Balancer for D...

引用

International Conference on Distributed Computing Systems

作者： Shu Yang Xinze Wu Laizhong Cui College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350386059

ISBN: (纸本)9798350386066

Nowadays, load balancing is more and more important for huge data centers. Most data centers usually adopt a software-based load balancer (LB), which consumes too many server resources and does not scale with the increasing traffic volume. However, there is an increased demand for layer-4 load balancers, which need to check more bits in packet headers. Although hardware-based load balancers can meet the requirements, they are much more expensive. During the past years, data centers frequently update their devices, including kinds of switches. Thus, there exists a huge number of obsolete switches, some of which are in good condition and equipped with high-performance storage like SRAM (Static Random Access Memory). In this paper, we proposed BCLB (Bit-based Collaborative Load Balancer), a new cooperative LB, which builds more powerful load balancing based on existing switches. Different with previous cooperative mechanisms that distribute rules to different LBs, BCLB lets switches cooperate based on bits. Many switches along the data path check different bits, and cooperatively check all bits in 5-tuple (which would be 296 bits in IPv6) for layer-4 packet header. In this way, rule updating will not influence the load balancing in BCLB. To optimize the performance of BCLB, we formulate the problem as an optimization problem, then we propose a dynamic programming algorithm to solve it. Finally, we conduct comprehensive simulations using both real-world traffic datasets and a P4-based prototype, the results show that BCLB performs much better than previous rule-based cooperative schemes.

关键词： Data centers Heuristic algorithms Random access memory Prototypes Distributed databases Load management Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

NAS-SW: Efficient Neural Architecture Search with Stage-Wise Search Strategy

NAS-SW: Efficient Neural Architecture Search with Stage-Wise...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Jikun Nie Yeming Yang Qingling Zhu Qiuzhen Lin College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

A number of Neural Architecture Search (NAS) methods have been proposed to automate the design of Convolutional Neural Networks (CNNs). However, they typically require significant computational resources and exhibit search instability. To save computational costs, many NAS methods design only a single group of cell architectures (i.e., a small part of the total network architecture), which are simply stacked to form the final network. This leads to a lack of diversity in network architecture design, thereby reducing network performance. To alleviate this problem, we propose a Particle Swarm Optimization (PSO)-based Stage-Wise NAS algorithm (named NAS-SW). Initially, we introduce a stage-wise architecture search strategy, which can find different cell architectures at various search stages. Then, we propose a grouping architecture update strategy, which can realize effective information transfer between cell architectures rapidly. Importantly, these strategies do not add extra computational costs. Experiments demonstrate that NAS-SW has superior performance and better efficiency. NAS-SW only needs 0.37 GPU days to design a CNN on CIFAR-10. Additionally, on the CIFAR-10 and CIFAR-100 datasets, the network architectures searched by NAS-SW achieve top-1 validation accuracies of 97.55% and 83.78%, respectively.

关键词： Microprocessors Design methodology Neural networks Graphics processing units computer architecture Network architecture Search problems

来源：评论

学校读者我要写书评

暂无评论

SMRI: A New Method for siRNA Design for COVID-19 Therapy

引用

Journal of computer science & Technology 2022年第4期37卷 991-1002页

作者： Meng-Xin Chen Xiao-Dong Zhu Hao Zhang Zhen Liu Yuan-Ning Liu College of Software Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Jilin UniversityChangchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China Graduate School of Engineering Nagasaki Institute of Applied ScienceNagasaki 851-0193Japan

First discovered in Wuhan, China, SARS-CoV-2 is a highly pathogenic novel coronavirus, which rapidly spreads globally and becomes a pandemic with no vaccine and limited distinctive clinical drugs available till March 13th, 2020. Ribonucleic Acid interference (RNAi) technology, a gene-silencing technology that targets mRNA, can cause damage to RNA viruses effectively. Here, we report a new efficient small interfering RNA (siRNA) design method named Simple Multiple Rules Intelligent Method (SMRI) to propose a new solution of the treatment of COVID-19. To be specific, this study proposes a new model named Base Preference and Thermodynamic Characteristic model (BPTC model) indicating the siRNA silencing efficiency and a new index named siRNA Extended Rules index (SER index) based on the BPTC model to screen high-efficiency siRNAs and filter out the siRNAs that are difficult to take effect or synthesize as a part of the SMRI method, which is more robust and efficient than the traditional statistical indicators under the same circumstances. Besides, to silence the spike protein of SARS-CoV-2 to invade cells, this study further puts forward the SMRI method to search candidate high-efficiency siRNAs on SARS-CoV-2's S gene. This study is one of the early studies applying RNAi therapy to the COVID-19 treatment. According to the analysis, the average value of predicted interference efficiency of the candidate siRNAs designed by the SMRI method is comparable to that of the mainstream siRNA design algorithms. Moreover, the SMRI method ensures that the designed siRNAs have more than three base mismatches with human genes, thus avoiding silencing normal human genes. This is not considered by other mainstream methods, thereby the five candidate high-efficiency siRNAs which are easy to take effect or synthesize and much safer for human body are obtained by our SMRI method, which provide a new safer, small dosage and long efficacy solution for the treatment of COVID-19.

关键词： COVID-19 SARS-CoV-2 RibonucleicAcid interference

来源：评论

学校读者我要写书评

暂无评论

FireRobBrain: Planning for a Firefighting Robot using Knowledge Graph and Large Language Model

FireRobBrain: Planning for a Firefighting Robot using Knowle...

引用

Intelligent Data and Security (IDS), IEEE International Conference on

作者： Jialei Zhang Shubin Cai Zhiwei Jiang Jian Xiao Zhong Ming College of Computer Science and Software Engineering Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Guang Ming Laboratory Shenzhen China College of Computer Science and Software Engineering Shenzhen University Guang Ming Laboratory Shenzhen Technology University Shenzhen China

ISBN: (数字)9798350389487

ISBN: (纸本)9798350389494

Firefighting robots play a crucial role in improving fire safety. However, these robots have limitations in understanding their surroundings and adapting to changing situations. In this paper, we propose the “FireRobBrain”, a combination of a knowledge graph and a large language model, to act as the “brain” of firefighting robots. This approach aims to tackle challenges related to planning robots in dynamic environments. The FireRobBrain consists of a KG with a dynamic information base and a relatively static knowledge base. It also includes a prompting module that helps the language model generate suggestions for the robot's reactions. We evaluated the framework using a dataset of 864 samples and discovered that the combination of LLM and KG, facilitated by a well-designed prompt module, significantly improves the quality of answers, particularly for tasks involving specific contexts and structured information. Furthermore, we noted that providing a task scope in the input prefix contributes to a better understanding of the robot's task, resulting in enhanced performance.

关键词： Large language models Prevention and mitigation Knowledge based systems Knowledge graphs Planning Security Reliability

来源：评论

学校读者我要写书评

暂无评论

A Novel Unsupervised Anomaly Detection Approach Using Neural Transformation in Cloud Environment 1

引用

15th International Conference on Cloud Computing, CLOUD 2022, held as part of the Services Conference Federation, SCF 2022

作者： Zhang, Rui Chen, Juan Song, Yujia Shan, Wenyu Chen, Peng Xia, Yunni School of Computer and Software Engineering Xihua University Chengdu China College of Computer Science Chongqing University Chongqing China

ISBN: (数字)9783031234989

ISBN: (纸本)9783031234972

As a new way of computing on the Internet, cloud computing has completely changed the abstraction and utilization of computing infrastructure and is favored by users of significant enterprises. Therefore, various large-scale cloud computing systems have emerged. Cloud computing systems capture real-time indicators in the form of multivariate time series. Therefore, it is necessary and valuable to do multivariate time series anomaly detection in the cloud computing system. However, because the data monitored in the cloud computing system is massive, redundant, contains noise and missing values, and is accompanied by the randomness and scarcity of anomalies, anomaly detection in the cloud computing system will generate high computational costs and the challenge of uncertain detection results. To solve these problems, we use neural transformation (NT) for anomaly detection, that is, Neural Transformation-Encoding-Auto Regression (NT-E-AR). NT-E-AR uses NT to generate different transformation views from the input data. Convolutional Long-Short Term Memory (ConvLSTM) encoding network and Autoregressive Long-Short Term Memory (LSTM) are combined to extract Spatio-Temporal features of time series data to achieve better anomaly detection capability. Extensive experiments show that NT-E-AR consistently outperforms all baselines on three open datasets and achieves an average F1 (0.772), increasing the average accuracy by 16.52%. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

SRE-KGC : A Knowledge Graph Completion Model Based on Hidden Graph Structure and Relational Semantic Enhancement

SRE-KGC : A Knowledge Graph Completion Model Based on Hidden...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Sijun Lu Guoyan Xu Shuangyang Sun College of Computer Science and Software Engineering Hohai University Nanjing China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Knowledge Graph Completion (KGC) endeavors to use existing knowledge graph data for predicting missing elements in triples. Recently, due to the efficiency of graph neural networks (GNNs) in capturing topological structures and the effectiveness of text descriptions in supplementing semantic information, numerous models integrating graph structures and entity descriptions have emerged. However, these approaches typically focus on aggregating neighboring feature information and overlook mining hidden structural information. Furthermore, they often append textual descriptions to entities independently without considering the semantics within specific relations. Hence, we propose the SRE-KGC model to address these challenges. First, while aggregating neighbors, we analyze and mine the hidden structure in the neighborhood from the perspective of entities and relations; then we introduced a dual-layer attention mechanism to extract the most pertinent textual information towards relations from both the relational semantic level and the neighbor semantic level respectively; finally, the two learned features are fused and sent to the decoder for scoring. Experiments demonstrate that our model delivers superior performance.

关键词： Knowledge engineering Attention mechanisms Semantics Knowledge graphs Interference Predictive models Feature extraction Graph neural networks Decoding Data mining

来源：评论

学校读者我要写书评

暂无评论

New Algorithms for Distributed Fair k-Center Clustering: Almost Accurate as Sequential Algorithms 23

New Algorithms for Distributed Fair k-Center Clustering: Alm...

引用

23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024

作者： Wu, Xiaoliang Feng, Qilong Huang, Ziyun Xu, Jinhui Wang, Jianxin School of Computer Science and Engineering Central South University Xiangjiang Laboratory Changsha China Department of Computer Science and Software Engineering Penn State Erie The Behrend College Erie United States Department of Computer Science and Engineering State University of New York at Buffalo Buffalo United States Hunan Provincial Key Lab on Bioinformatics Central South University Xiangjiang Laboratory Changsha China

Fair clustering problems have been paid lots of attention recently. In this paper, we study the k-Center problem under the group fairness and data summarization fairness constraints, denoted as Group Fair k-Center (GFkC) and Data Summarization Fair k-Center (DSFkC), respectively, in the massively parallel computational (MPC) distributed model. The previous best results for the above two problems in the MPC model are a 9-approximation with violation 7 (WWW 2022) and a (17 + ∊)-approximation without fairness violation (ICML 2020), respectively. In this paper, we obtain a (3 + ∊)- approximation with violation 1 for the GFkC problem in the MPC model, which is almost as accurate as the best known approximation ratio 3 with violation 1 for the sequential algorithm of the GFkC problem. Moreover, for the DSFkC problem in the MPC model, we obtain a (4 + ∊)-approximation without fairness violation, which is very close to the best known approximation ratio 3 for the sequential algorithm of the DSFkC problem. Empirical experiments show that our distributed algorithms perform better than existing state-of-the-art distributed methods for the above two problems. © 2024 International Foundation for Autonomous Agents and Multiagent Systems.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

NPSVC++:Nonparallel Classifiers Encounter Representation Learning

arXiv

引用

arXiv 2024年

作者： Zhang, Junhong Lai, Zhihui Zhou, Jie Liang, Guangfei College of Computer Science and Software Engineering Shenzhen University Shenzhen China

This paper focuses on a specific family of classifiers called nonparallel support vector classifiers (NPSVCs). Different from typical classifiers, the training of an NPSVC involves the minimization of multiple objectives, resulting in the potential concerns of feature suboptimality and class dependency. Consequently, no effective learning scheme has been established to improve NPSVCs’ performance through representation learning, especially deep learning. To break this bottleneck, we develop NPSVC++ based on multi-objective optimization, enabling the end-to-end learning of NPSVC and its features. By pursuing Pareto optimality, NPSVC++ theoretically ensures feature optimality across classes, hence effectively overcoming the two issues above. A general learning procedure via duality optimization is proposed, based on which we provide two applicable instances, K-NPSVC++ and D-NPSVC++. The experiments show their superiority over the existing methods and verify the efficacy of NPSVC++. Copyright © 2024, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Correlation-Aware Exit Setting for Deep Neural Network Inference

Correlation-Aware Exit Setting for Deep Neural Network Infer...

引用

Digital Society and Intelligent Systems (DSInS), International Conference on

作者： Yuer Ma Bin Tang College of Computer Science and Software Engineering Hohai University Nanjing China

ISBN: (数字)9798331528829

ISBN: (纸本)9798331528836

Deep Neural Networks (DNNs) have been widely applied in video object recognition, yet tasks of varying complexity are often required to pass through the entire model, leading to inference redundancy for simpler tasks. By inserting exit branches at intermediate layers of the network, tasks that meet exit criteria can terminate early, reducing inference computation overhead and latency without significantly compromising accuracy. However, exit branches themselves introduce additional computational load, making it essential to strategically determine exit insertion points. The exit rules used in existing exit setting methods require tasks to sequentially attempt exits at each point, neglecting the correlation between adjacent video frames and resulting in numerous unnecessary exit attempts. To address this issue, we propose an exit rule based on the correlation between adjacent video frames, allowing video inference tasks to skip certain unsuitable exits. Building on this rule, we analyze the expected inference overhead under different exit settings and introduce an efficient estimation method. Finally, we present a high-efficiency exit setting method based on the ant colony optimization algorithm. Experimental results confirm that the proposed exit rule and setting method significantly reduce computational cost and inference latency.

关键词： Ant colony optimization Correlation Accuracy Computational modeling Redundancy Artificial neural networks Complexity theory Object recognition Optimization Load modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：