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

Analysis on D2D Heterogeneous Networks with State-Dependent Priority Traffic

computers, Materials & Continua 2023年第2期74卷 2981-2998页

作者： Guangjun Liang Jianfang Xin Linging Xia Xueli Ni Yi Cao Department of Computer Information and Cyber Security Jiangsu Police InstituteNanjingChina National and Local Joint Engineering Laboratory of Radio Frequency Integration and Microassembly Technology Nanjing University of Posts and TelecommunicationsNanjingChina School of Intelligent Engineering Nanjing Institute of Railway TechnologyNanjingChina Jiangsu Province Electronic Data Forensics and Analysis Engineering Research Center NanjingChina Department of Electrical and Computer Engineering University of WindsorWindsorONN9B 3P4Canada

In this work,we consider the performance analysis of state dependent priority traffic and scheduling in device to device(D2D)heterogeneous *** are two priority transmission types of data in wireless communication,such as video or telephone,which always meet the requirements of high priority(HP)data transmission *** there is a large amount of low priority(LP)data,there will be a large amount of LP data that cannot be *** situation will cause excessive delay of LP data and packet dropping *** order to solve this problem,the data transmission process of high priority queue and low priority queue is *** the priority jump strategy to the priority queuing model,the queuing process with two priority data is modeled as a two-dimensionalMarkov chain.A state dependent priority jump queuing strategy is proposed,which can improve the discarding performance of low priority *** quasi birth and death process method(QBD)and fixed point iterationmethod are used to solve the causality,and the steady-state probability distribution is further ***,performance parameters such as average queue length,average throughput,average delay and packet dropping probability for both high and low priority data can be *** simulation results verify the correctness of the theoretical ***,the proposed priority jump queuing strategy can significantly improve the drop performance of low-priority data.

关键词： Stochastic geometry queuing theory D2D heterogeneous networks quasi-birth and death process

来源：评论

学校读者我要写书评

暂无评论

Cryptocurrency Transaction Network Embedding From Static and Dynamic Perspectives: An Overview

引用

IEEE/CAA Journal of Automatica Sinica 2023年第5期10卷 1105-1121页

作者： Yue Zhou Xin Luo MengChu Zhou the School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing 400065 the Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714 the Chongqing School University of Chinese Academy of SciencesChongqing 400714China the College of Computer and Information Science Southwest UniversityChongqing 400715China the School of Information and Electronic Engineering Zhejiang Gongshang UniversityHangzhou 310018China the Helen and John C.Hartmann Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102 USA

Cryptocurrency, as a typical application scene of blockchain, has attracted broad interests from both industrial and academic communities. With its rapid development, the cryptocurrency transaction network embedding(CTNE) has become a hot topic. It embeds transaction nodes into low-dimensional feature space while effectively maintaining a network structure,thereby discovering desired patterns demonstrating involved users' normal and abnormal behaviors. Based on a wide investigation into the state-of-the-art CTNE, this survey has made the following efforts: 1) categorizing recent progress of CTNE methods, 2) summarizing the publicly available cryptocurrency transaction network datasets, 3) evaluating several widely-adopted methods to show their performance in several typical evaluation protocols, and 4) discussing the future trends of CTNE. By doing so, it strives to provide a systematic and comprehensive overview of existing CTNE methods from static to dynamic perspectives,thereby promoting further research into this emerging and important field.

关键词： Big data analysis cryptocurrency transaction network embedding(CTNE) dynamic network network embedding network representation static network

来源：评论

学校读者我要写书评

暂无评论

Modeling and Clustering of Parabolic Granular Data

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3728-3742页

作者： Tang, Yiming Gao, Jianwei Pedrycz, Witold Hu, Xianghui Xi, Lei Ren, Fuji Hu, Min Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6R 2V4 Canada Hefei University of Technology School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Polish Academy of Sciences Systems Research Institute Warsaw00-901 Poland Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Southeast University School of Computer Science and Engineering Nanjing211189 China University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China

At present, there exist some problems in granular clustering methods, such as lack of nonlinear membership description and global optimization of granular data boundaries. To address these issues, in this study, revolving around the parabolic granular data, we propose an overall architecture for parabolic granular modeling and clustering. To begin with, novel coverage and specificity functions are established, and then a parabolic granular data structure is proposed. The fuzzy c-means (FCM) algorithm is used to obtain the numeric prototypes, and then particle swarm optimization (PSO) is introduced to construct the parabolic granular data from the global perspective under the guidance of principle of justifiable granularity (PJG). Combining the advantages of FCM and PSO, we propose the parabolic granular modeling and optimization (PGMO) method. Moreover, we put forward attribute weights and sample weights as well as a distance measure induced by the Gaussian kernel similarity, and then come up with the algorithm of weighted kernel fuzzy clustering for parabolic granularity (WKFC-PG). In addition, the assessment mechanism of parabolic granular clustering is discussed. In summary, we set up an overall architecture including parabolic granular modeling, clustering, and assessment. Finally, comparative experiments on artificial, UCI, and high-dimensional datasets validate that our overall architecture delivers a good improvement over previous strategies. The parameter analysis and time complexity are also given for WKFC-PG. In contrast with related granular clustering algorithms, it is observed that WKFC-PG performs better than other granular clustering algorithms and has superior stability in handling outliers, especially on high-dimensional datasets. © 2020 IEEE.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Recent Developments in Event-Triggered Control of Nonlinear Systems:An Overview

引用

无人系统（英文） 2023年第1期11卷 27-56页

作者： Pengpeng Zhang Tengfei Liu Jie Chen Zhong-Ping Jiang Department of Control Science & Engineering Frontiers Science Center for Intelligent Autonomous SystemsTongji UniversityShanghai 201804P.R.China State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819P.R.China Department of Electrical and Computer Engineering New York University370 Jay StreetBrooklynNY 11201USA

Event-triggered control is a most popular paradigm for transferring feedback information in an economical"as needed"*** study of event-triggered control can be traced back to the *** significant advances on the topic of control over networks and the topic of nonlinear control systems over the last two decades,event-triggered control has quickly emerged as a major theoretical subject in control *** of event-triggered control are wide-spread ranging from embedded control systems and industrial control processes to unmanned systems and cyber-physical transportation *** this paper,we first review developments in the synthesis of event-triggered sampling *** event triggering mechanisms,such as static event trigger,dynamic event trigger,time-regularized event trigger,and event trigger with positive threshold offsets,are systematically ***,we study how to design a stabilizing controller that is robust with respect to the sampling ***,we review some recent results in the directions of self-triggered control,event-triggered tracking control and cooperative control,and event-triggered control of stochastic systems and partial differential equation *** applications of event-triggered control are also discussed.

关键词： Event-triggered control event-triggered sampling mechanism event-triggered controller

来源：评论

学校读者我要写书评

暂无评论

RoboFold: A platform for Protein-folding Inspired Robot Swarms ∗ 5

RoboFold: A platform for Protein-folding Inspired Robot Swar...

引用

5th World Robot Conference Symposium on Advanced robotics and Automation, WRC SARA 2023

作者： Zhang, Feng Gu, Yuping Yuan, Shuai Yang, Yongliang Shenyang Jianzhu University School of Electrical and Control Engineering Liaoning Shenyang110168 China Shenyang Institute of Automation Chinese Academy of Sciences State Key Laboratory of Robotics Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Liaoning Shenyang110016 China Shenyang Jianzhu University School of Computer Science and Engineering School of Electrical and Control Engineering Liaoning Shenyang110168 China

ISBN: (纸本)9798350307320

Natural swarms have inspired various controlling algorithms for swarm robotics, while few of them were programmed in a similar way as the natural swarms. Defining a reliable programming method is still a daunting challenge in swarm robotics. In nature, the information of 3D protein structure is programmed in the sequence of amino acids of the protein. To mimic the programming method of protein folding, we present a platform for investigating protein-folding inspired programming method for robot swarms. This platform includes three parts: a vibration machine, protein-like robot sequences, and recording devices. The preliminary results presented here demonstrated the effectiveness of this platform and the feasibility of protein-folding inspired programming method for robot swarms. © 2023 IEEE.

关键词： Protein folding

来源：评论

学校读者我要写书评

暂无评论

PriFU: Capturing Task-Relevant Information Without Adversarial Learning 24

PriFU: Capturing Task-Relevant Information Without Adversari...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Bi, Xiuli Hu, Yang Liu, Bo Li, Weisheng Cosman, Pamela Xiao, Bin Chongqing Key Laboratory of Image Cognition Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing China Department of Electrical and Computer Engineering University of California San Diego San Diego United States

ISBN: (纸本)9798400706868

As machine learning advances, machine learning as a service (MLaaS) in the cloud brings convenience to human lives but also privacy risks, as powerful neural networks used for generation, classification or other tasks can also become privacy snoopers. This motivates privacy preservation in the inference phase. Many approaches for preserving privacy in the inference phase introduce multi-objective functions, training models to remove specific private information from users' uploaded data. Although effective, these adversarial learning-based approaches suffer not only from convergence difficulties, but also from limited generalization beyond the specific privacy for which they are trained. To address these issues, we propose a method for privacy preservation in the inference phase by removing task-irrelevant information, which requires no knowledge of the privacy attacks nor introduction of adversarial learning. Specifically, we introduce a metric to distinguish task-irrelevant information from task-relevant information, and achieve more efficient metric estimation to remove task-irrelevant features. The experiments demonstrate the potential of our method in several tasks. Our code will be available at: https://***/iwhoyoung/PriFU. © 2024 ACM.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

IoT for Sustainable Hospitality: A Systematic Review of Opportunities and Challenges for the Hospitality Industry Revolution 19

IoT for Sustainable Hospitality: A Systematic Review of Oppo...

引用

19th Annual International Conference on Distributed Computing in Smart Systems and the Internet of Things, DCOSS-IoT 2023

作者： Poullas, Marios S. Kakoulli, Elena Neapolis University Pafos Intelligent Systems Laboratory Department of Computer Science Pafos Cyprus Cell and Developmental Biology University College London London United Kingdom Cyprus University of Technology Electrical Engineering and Computer Engineering and Informatics Limassol Cyprus

ISBN: (纸本)9798350346497

Technology has influenced the hospitality industry, and the Internet of Things (IoT) has become a focus for sustainability, revenue growth, and problem-solving. This systematic review examined the opportunities and challenges of implementing IoT technology for a sustainable hospitality. Through a thorough analysis of 28 studies, we found that IoT technology has great potential to address sustainability issues in the hospitality industry. However, there are still significant challenges that need to be addressed for the successful implementation of IoT technology in the hospitality industry. Overall, this study highlights the potential of IoT technology to revolutionize the hospitality industry and make it more sustainable. Further research is needed to address the challenges of IoT implementation in the hospitality industry and to evaluate the effectiveness of IoT technology in achieving sustainability goals. © 2023 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Optimal Linear Deception Attacks on Remote State Estimation with Constrained Alarm Rates: A Low-Dimensional Case 63

Optimal Linear Deception Attacks on Remote State Estimation ...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Shang, Jun Zhang, Hanwen Zhou, Jing Chen, Tongwen Tongji University Shanghai Research Institute for Intelligent Autonomous Systems National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Department of Control Science and Engineering Shanghai200092 China University of Science and Technology Beijing Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering Beijing100083 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada

ISBN: (纸本)9798350316339

This study addresses linear attacks on remote state estimation within the context of a constrained alarm rate. Smart sensors, which are equipped with local Kalman filters, transmit innovations instead of raw measurements through a wireless communication network. This transmission is vulnerable to malicious data interception and manipulation by attackers. The aim of this research is to identify the optimal attack strategy that degrades the system performance while adhering to stealthiness constraints. A notable innovation of this paper is the direct association of the attack's stealthiness with the alarm rate, diverging from traditional approaches that rely on the covariance of the innovation or the Kullback-Leibler divergence, which are conventional metrics that have been extensively explored in previous studies. Our findings reveal that the optimal attack strategy exhibits some structural characteristics in systems of low dimensions. The performance of the proposed attack strategy is demonstrated through numerical examples. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning Probabilistic Coordinate Fields for Robust Correspondences

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2023年第10期45卷 12004-12021页

作者： Zhao, Weiyue Lu, Hao Ye, Xinyi Cao, Zhiguo Li, Xin Huazhong University of Science and Technology The Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Wuhan430074 China West Virginia University The Lane Department of Computer Science and Electrical Engineering MorgantownWV26506-6109 United States

We introduce Probabilistic Coordinate Fields (PCFs), a novel geometric-invariant coordinate representation for image correspondence problems. In contrast to standard Cartesian coordinates, PCFs encode coordinates in correspondence-specific barycentric coordinate systems (BCS) with affine invariance. To know when and where to trust the encoded coordinates, we implement PCFs in a probabilistic network termed PCF-Net, which parameterizes the distribution of coordinate fields as Gaussian mixture models. By jointly optimizing coordinate fields and their confidence conditioned on dense flows, PCF-Net can work with various feature descriptors when quantifying the reliability of PCFs by confidence maps. An interesting observation of this work is that the learned confidence map converges to geometrically coherent and semantically consistent regions, which facilitates robust coordinate representation. By delivering the confident coordinates to keypoint/feature descriptors, we show that PCF-Net can be used as a plug-in to existing correspondence-dependent approaches. Extensive experiments on both indoor and outdoor datasets suggest that accurate geometric invariant coordinates help to achieve the state of the art in several correspondence problems, such as sparse feature matching, dense image registration, camera pose estimation, and consistency filtering. Further, the interpretable confidence map predicted by PCF-Net can also be leveraged to other novel applications from texture transfer to multi-homography classification. © 1979-2012 IEEE.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

pFedCal: Lightweight Personalized Federated Learning with Adaptive Calibration Strategy

引用

IEEE Transactions on Services Computing 2025年第03期18卷 1627-1640页

作者： Deng, Dongshang Wu, Xuangou Zhang, Tao Xiang, Chaocan Zhao, Wei Xu, Minrui Kang, Jiawen Han, Zhu Niyato, Dusit Anhui University of Technology School of Computer Science and Technology Anhui Province Key Laboratory of Digital Twin Technology in Metallurgical Industry Anhui Engineering Research Center for Intelligent Applications and Security of Industrial Internet Ma'anshan243002 China Beijing Jiaotong University School of Cyberspace Science and Technology Beijing100044 China Anhui Provincial Key Laboratory of Digital Twin Technology in Metallurgical Industry Anhui243002 China Chongqing University College of Computer Science Chongqing400044 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore Guangdong University of Technology School of Automation Guangzhou510062 China University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

Federated learning (FL) is a promising artificial intelligence framework that enables clients to collectively train models with data privacy. However, in real-world scenarios, to construct practical FL frameworks, several challenges have to be addressed, including statistical heterogeneity, constrained resources, and fairness. Therefore, we first investigate an aggregation gap caused by statistical heterogeneity during local model initialization, which not only causes additional computational overhead for clients but also leads to the degradation of fairness. To bridge this gap, we propose pFedCal, a novel personalized federated learning with lightweight adaptive calibration strategy that performs calibration compensation through the prior knowledge of clients. Specifically, we introduce compensation for each client at the model initialization, with the compensation derived from the global gradient and the latest gradient bias. To enhance the calibration effect, we introduce a smoothing-based calibration strategy, and we design an adaptive calibration strategy. A representative example demonstrates that the proposed calibration and smoothing strategies improve fairness for clients. The theoretical analysis indicates that with an appropriate learning rate, pFedCal converges to a first-order stationary point for non-convex loss functions. Comprehensive experimental results show that pFedCal achieves faster convergence, higher accuracy, and improved fairness than the state-of-the-art methods. © 2008-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：