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

作者： Wu, Song Tao, Zhiheng Fan, Hao Huang, Zhuo Zhang, Xinmin Jin, Hai Yu, Chen Cao, Chun 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 State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Elastic scaling in response to changes on demand is a main benefit of serverless computing. When bursty workloads arrive, a serverless platform launches many new containers and initializes function environments (known as cold starts), which incurs significant startup latency. To reduce cold starts, platforms usually pause a container after it serves a request, and reuse this container for subsequent requests. However, this reuse strategy cannot efficiently reduce cold starts because the schedulers are agnostic of container lifecycle. For example, it may ignore soon available containers or evict soon needed containers. We propose a container lifecycle-aware scheduling strategy for serverless computing, CAS. The key idea is to control distribution of requests and determine creation or eviction of containers according to different lifecycle phases of containers. We implement a prototype of CAS on OpenWhisk. Our evaluation shows that CAS reduces 81% cold starts and therefore brings a 63% reduction at 95th percentile latency compared with native scheduling strategy in OpenWhisk when there is worker contention between workloads, and does not add significant performance overhead. © 2021 John Wiley & Sons Ltd.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Data-Driven Model for Lithium-Ion Battery State-of-Health Estimation with Optimized Features and Prior Knowledge

引用

Automotive Innovation 2022年第2期5卷 134-145页

作者： Huanyang Huang Jinhao Meng Yuhong Wang Lei Cai Jichang Peng Ji Wu Qian Xiao Tianqi Liu Remus Teodorescu College of Electrical Engineering Sichuan UniversityChengduChina Faculty of Computer Science and Engineering Shanxi Key Laboratory for Network Computing and Security TechnologyXi’an University of TechnologyXi’anChina Smart Grid Research Institute Nanjing Institute of TechnologyNanjingChina Department of Automation University of Science and Technology of ChinaHefeiChina Key Laboratory of Smart Grid of Ministry of Education Tianjin UniversityTianjinChina Department of Energy Technology Aalborg University9220 AalborgDenmark

In the long-term prediction of battery degradation,the data-driven method has great potential with historical data recorded by the battery management *** paper proposes an enhanced data-driven model for Lithium-ion(Li-ion)battery state of health(SOH)estimation with a superior modeling procedure and optimized *** Gaussian process regression(GPR)method is adopted to establish the data-driven estimator,which enables Li-ion battery SOH estimation with the uncertainty level.A novel kernel function,with the prior knowledge of Li-ion battery degradation,is then introduced to improve the mod-eling capability of the *** for the features,a two-stage processing structure is proposed to find a suitable partial charging voltage profile with high *** the first stage,an optimal partial charging voltage is selected by the grid search;while in the second stage,the principal component analysis is conducted to increase both estimation accuracy and computing *** of the proposed method are validated on two datasets from different Li-ion batteries:Compared with other methods,the proposed method can achieve the same accuracy level in the Oxford dataset;while in Maryland dataset,the mean absolute error,the root-mean-squared error,and the maximum error are at least improved by 16.36%,32.43%,and 45.46%,respectively.

关键词： Li-ion battery State of health Gaussian process regression Kernel function Feature optimization

来源：评论

学校读者我要写书评

暂无评论

Lightweight Authentication of Devices in Industrial Control systems

Lightweight Authentication of Devices in Industrial Control ...

引用

IEEE International Conference on Software engineering and Service Sciences (ICSESS)

作者： Long Wang Siqi Niu Henggao Zhai Jing Fan Lei Wang National Computer System Engineering Research Institute of China Beijing China Department of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Coocaa Network Technology Co. Ltd. Guangdong China

A security authentication protocol based on number theory research unit (NTRU) for industrial control devices is proposed to address the security of data transmission in industrial control systems and the lack of resistance to attacks of security authentication protocols. Most of the original protocols contain complex encryption and decryption operations, which are difficult to run on industrial control devices with simple structures and cannot resist new types of network attacks. In this paper, the protocol takes advantage of the simple operation of NTRU public key encryption system and sets the authorization center to send only the public key of the device in a variant form to achieve the purpose of resisting new attacks such as quantum attacks and internal attacks, and the anti-attack capability is strengthened.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Advancing Orchard Fruit Detection: An Innovative Agricultural Foundation Model Approach

Advancing Orchard Fruit Detection: An Innovative Agricultura...

引用

2024 American Society of Agricultural and Biological Engineers Annual International Meeting, ASABE 2024

作者： Li, Jiajia Lammers, Kyle Yin, Xunyuan Yin, Xiang He, Long Lu, Renfu Li, Zhaojian Department of Electrical and Computer Engineering Michigan State University MI United States School of Chemical and Biomedical Engineering Nanyang Technological University Singapore Department of Automation Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Department of Agricultural and Biological Engineering Pennsylvania State University United States United States Department of Agriculture Agricultural Research Service East LansingMI United States Department of Mechanical Engineering Michigan State University East LansingMI United States

ISBN: (纸本)9798331302214

Fruit harvesting poses a significant labor and financial burden on the fruit industry, which underscore the urgent need for advancements in robotic harvesting solutions. Despite considerable progress in leveraging deep learning and machine learning techniques for fruit detection, a common shortfall is the inability to swiftly extend the developed models across different orchards and/or various fruit species. Additionally, the limited availability of pertinent data further compounds these challenges. In this work, we introduce MetaFruit, the largest publicly available multi-class fruit dataset, comprising 4,248 images and 248,015 manually labeled instances across diverse U.S. orchards. Furthermore, this study proposes an innovative open-set fruit detection system leveraging advanced Vision Foundation Models (VFMs) for fruit detection that can adeptly identify a wide array of fruit types under varying orchard conditions. This system not only demonstrates remarkable adaptability in learning from minimal data through few-shot learning but also shows the ability to interpret human instructions for subtle detection tasks. The performance of the developed foundation model is comprehensively evaluated across several metrics, outperforming existing state-of-the-art algorithms in our MetaFruit, thereby setting a new benchmark in the field of agricultural technology and robotic harvesting. The MetaFruit dataset (https://***/datasets/jiajiali/metafruit) and detection framework (https://***/JiajiaLi04/FMFruit) are open-sourced to foster future research in vision-based fruit harvesting, marking a significant stride toward addressing the urgent needs of the agricultural sector. © 2024 ASABE Annual International Meeting. All rights reserved.

关键词： Orchards

来源：评论

学校读者我要写书评

暂无评论

Short-term multi-step-ahead sector-based traffic flow prediction based on the attention-enhanced graph convolutional LSTM network (AGC-LSTM)

引用

Neural Computing and Applications 2024年 1-20页

作者： Zhang, Ying Xu, Shimin Zhang, Linghui Jiang, Weiwei Alam, Sameer Xue, Dabin College of General Aviation and Flight Nanjing University of Aeronautics and Astronautics Nanjing China State Key Laboratory of Air Traffic Management System Nanjing China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China Air Traffic Management Research Institute School of Mechanical & ampAerospace Engineering Nanyang Technological University Singapore Singapore Department of Land Surveying and Geo-Informatics The Hong Kong Polytechnic University Hong Kong

Accurate sector-based air traffic flow predictions are essential for ensuring the safety and efficiency of the air traffic management (ATM) system. However, due to the inherent spatial and temporal dependencies of air traffic flow, it is still a challenging problem. To solve this problem, some methods are proposed considering the relationship between sectors, while the complicated spatiotemporal dynamics and interdependencies between traffic flow of route segments related to the sector are not taken into account. To address this challenge, the attention-enhanced graph convolutional long short-term memory network (AGC-LSTM) model is applied to improve the short-term sector-based traffic flow prediction, in which spatial structures of route segments related to the sector are considered for the first time. Specifically, the graph convolutional networks (GCN)-LSTM network model was employed to capture spatiotemporal dependencies of the flight data, and the attention mechanism is designed to concentrate on the informative features from key nodes at each layer of the AGC-LSTM model. The proposed model is evaluated through a case study of the typical enroute sector in the central–southern region of China. The prediction results show that MAE reduces by 14.4% compared to the best performing GCN-LSTM model among the other five models. Furthermore, the study involves comparative analyses to assess the influence of route segment range, input and output sequence lengths, and time granularities on prediction performance. This study helps air traffic managers predict flight situations more accurately and avoid implementing overly conservative or excessively aggressive flow management measures for the sectors. © The Author(s) 2024.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

DPP-HSS: Towards Fast and Scalable Hypervolume Subset Selection for Many-objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Gong, Cheng Nan, Yang Shang, Ke Guo, Ping Ishibuchi, Hisao Zhang, Qingfu City University of Hong Kong Department of Computer Science Hong Kong City University of Hong Kong Shenzhen Research Institute Shenzhen China Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China

Hypervolume subset selection (HSS) has received significant attention since it has a strong connection with evolutionary multi-objective optimization (EMO), such as environment selection and post-processing to identify representative solutions for decision-makers. The goal of HSS is to find the optimal subset that maximizes the hypervolume indicator subject to a given cardinality constraint. However, existing HSS algorithms or related methods are not efficient in achieving good performance in high-dimensional objective spaces. This is primarily because HSS problems become NP-hard when the number of objectives exceeds two, and the calculation of hypervolume contribution is very time-consuming. To efficiently solve HSS problems while maintaining a good solution quality, we propose a fast and scalable hypervolume subset selection method for many-objective optimization based on the determinantal point process (DPP), named DPP-HSS, which is fully free of hypervolume contribution calculation. Specifically, DPP-HSS constructs a hypervolume kernel matrix by extracting the convergence and diversity representations of each solution for a given HSS problem. This matrix is then used to build a DPP model. Subsequently, the original HSS problem is reformulated as a new maximization optimization problem based on the constructed model. A greedy DPP-based hypervolume subset selection algorithm is implemented to solve this transformed problem. Extensive experiments show that the proposed DPP-HSS achieves significant speedup and good hypervolume performance in comparison with state-of-the-art HSS algorithms on benchmark problems. Furthermore, DPP-HSS demonstrates very good scalability with respect to the number of objectives. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Cyber Deception system based on Monte Carlo Simulation in the Mobile Edge Computing (MEC)

Cyber Deception System based on Monte Carlo Simulation in th...

引用

International Conference on computer, Information and Telecommunication systems (CITS)

作者： Joelle Kabdjou Elie Fute Tagne Danda B. Rawat Jaime Acosta Charles Kamhoua Department of Mathematics and Computer Science University of Dschang Dschang Cameroon Department of Computer Engineering University of Buea Buea Dschang Cameroon Department of Electrical Engineering and Computer Science Howard University Washington USA DEVCOM Army Research Laboratory Network Security Branch Adelphi US

The frequency of malicious activities by cyber attackers is on the rise, posing a significant challenge to counter cyber attacks in the Mobile Edge Computing (MEC) environment. The vulnerability of wireless networks, which serve as the primary communication media for MEC servers and IoT applications, is due to their open nature of communication. This work proposes a MEC architecture that utilizes network Function Virtualization (NFV) and Service Function Chain (SFC) to combat cyber adversaries. Additionally, we evaluate the performance of a cyber deception system, which leverages a software-defined networking (SDN) controller and decision- maker to continuously monitor incoming MEC traffic and direct cyber adversaries to a deception MEC server. The deception MEC server collects information about cyber adversaries' intent, capabilities, and potential damage to the system, thus securing legitimate users from cyber attacks. The proposed approach was evaluated using Monte Carlo simulations, and numerous results were obtained which demonstrate the effectiveness of cyber deception in MEC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BLDTS: Blockchain-based Lightweight Data Trusted Sharing Scheme for Internet of Vehicles

BLDTS: Blockchain-based Lightweight Data Trusted Sharing Sch...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Haoran Lin Zhongyuan Yu Guijuan Wang Anming Dong Xiang Tian School of Computer Science Qufu Normal University Rizhao China School of Information Science and Engineering Lanzhou University Lanzhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

Ensuring safe and reliable data sharing is crucial for the development of Internet of Vehicles (IoV) technology. To provide a trusted data environment for IoV and enable traditional consensus algorithms to meet the high dynamic requirements of the IoV. In this article, we propose a blockchain-based data sharing scheme for IoV (BLDTS) to achieve secure and trusted sharing. First, we design a false information identification strategy that utilizes a bayesian inference model to determine the authenticity of shared data with the assistance of reputation value. Second, the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is used to construct a novel lightweight consensus mechanism based on vehicle reputation values and traffic environment factors, and the nodes with high scores were selected as participants in the consensus, which can reduce the computational overhead. Finally, experimental results show that our scheme has advantages in improving the accuracy of false message identification and consensus efficiency.

关键词： Data privacy Federated learning Heuristic algorithms Bayes methods Consensus protocol Reliability Vehicle dynamics Protection Fake news Internet of Vehicles

来源：评论

学校读者我要写书评

暂无评论

The Entrapment Problem in Random Walk Decentralized Learning

The Entrapment Problem in Random Walk Decentralized Learning

引用

IEEE International Symposium on Information Theory

作者： Zonghong Liu Salim El Rouayheb Matthew Dwyer Department of Electrical and Computer Engineering Rutgers University New Brunswick NJ USA Network Cyber and Computational Sciences Division DEVCOM Army Research Laboratory Adelphi MD USA

ISBN: (数字)9798350382846

ISBN: (纸本)9798350382853

This paper explores decentralized learning in a graph-based setting, where data is distributed across nodes. We investigate a decentralized SGD algorithm that utilizes a random walk to update a global model based on local data. Our focus is on designing the transition probability matrix to speed up convergence. While importance sampling can enhance centralized learning, its decentralized counterpart, using the Metropolis-Hastings (MH) algorithm, can lead to the entrapment problem, where the random walk becomes stuck at certain nodes, slowing convergence. To address this, we propose the Metropolis-Hastings with Levy Jumps (MHLJ) algorithm, which incorporates random perturbations (jumps) to overcome entrapment. We theoretically establish the convergence rate and error gap of MHLJ and validate our findings through numerical experiments.

关键词： Monte Carlo methods Perturbation methods Distributed databases Data models Convergence Information theory

来源：评论

学校读者我要写书评

暂无评论

Distributionally Robust Optimization for Computation Offloading in Aerial Access networks

Distributionally Robust Optimization for Computation Offload...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Jiang, Guanwang Jia, Ziye He, Lijun Dong, Chao Wu, Qihui Han, Zhu Nanjing University of Aeronautics and Astronautics Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information Technology Nanjing211106 China Southeast University National Mobile Communications Research Laboratory Nanjing211111 China Northwestern Polytechnical University School of Software Xi'an710072 China University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States

ISBN: (纸本)9798350351255

With the rapid increment of multiple users for data offloading and computation, it is challenging to guarantee the quality of service (QoS) in remote areas. To deal with the challenge, it is promising to combine aerial access networks (AANs) with multi-access edge computing (MEC) equipments to provide computation services with high QoS. However, as for uncertain data sizes of tasks, it is intractable to optimize the offloading decisions and the aerial resources. Hence, in this paper, we consider the AAN to provide MEC services for uncertain tasks. Specifically, we construct the uncertainty sets based on historical data to characterize the possible probability distribution of the uncertain tasks. Then, based on the constructed uncertainty sets, we formulate a distributionally robust optimization problem to minimize the system delay. Next, we relax the problem and reformulate it into a linear programming problem. Accordingly, we design a MEC-based distributionally robust latency optimization algorithm. Finally, simulation results reveal that the proposed algorithm achieves a superior balance between reducing system latency and minimizing energy consumption, as compared to other benchmark mechanisms in the existing literature. © 2024 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：