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

IEEE Conference on Global Communications (GLOBECOM)

作者： Jin Cheng Ningning Ding John C. S. Lui Jianwei Huang School of Science and Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society The Chinese University of Hong Kong Shenzhen Data Science and Analytics Thrust Information Hub Hong Kong University of Science and Technology Guangzhou Department of Computer Science and Engineering The Chinese University of Hong Kong School of Science and Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen Key Laboratory of Crowd Intelligence Empowered Low-Carbon Energy Network and CSIJRI Joint Research Centre on Smart Energy Storage The Chinese University of Hong Kong Shenzhen

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In the era of big data, data trading significantly enhances data-driven technologies by facilitating data sharing. Despite the clear advantages often experienced by data users when incorporating multiple sources, the topic of multi-source data trading remains largely unexplored. This paper designs a novel data trading framework, which enables multi-source data trading through multi-source cooperation. The proposed framework aims to improve data usage efficiency and increase seller revenue. In particular, we model data sellers’ cooperative decisions through the Nash bargaining framework and systematically outline the interactions between sellers and buyers as a two-stage Stackelberg game. A key contribution of this work is the consideration of coupling among diverse data products, which is essential but often overlooked in prior studies. We properly classify data’s utility into endogenous and relational categories to disentangle the coupling. Despite the inherent non-convex nature of the optimization problem, we methodically derive the closed-form optimal solutions by decomposing the problem into several subproblems. Interestingly, we reveal that, under our proposed framework, sellers’ revenue initially remains steady with the increase of product coupling level, but begins to rise once the level exceeds a certain threshold due to the substitute effect. Finally, experimental results show that our proposed framework can improve the seller’s profit by up to 46.32% compared to traditional data trading methods in the current data market.

关键词： Couplings Games Big Data Data models Global communication Optimization

来源：评论

学校读者我要写书评

暂无评论

Exploring Token-Level Augmentation in Vision Transformer for Semi-Supervised Semantic Segmentation

arXiv

引用

arXiv 2025年

作者： Zhang, Dengke Tang, Quan Liu, Fagui Mei, Haiqing Chen, C.L. Philip The School of Computer Science and Engineering South China University of Technology Guangzhou510006 China The Department of New Network Pengcheng Laboratory Shenzhen518000 China The China Tobacco Guangdong Industrial Corporation Guangzhou510385 China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100080 China

Semi-supervised semantic segmentation has witnessed remarkable advancements in recent years. However, existing algorithms are based on convolutional neural networks and directly applying them to Vision Transformers poses certain limitations due to conceptual disparities. To this end, we propose TokenMix, a data augmentation technique specifically designed for semi-supervised semantic segmentation with Vision Transformers. TokenMix aligns well with the global attention mechanism by mixing images at the token level, enhancing learning capability for contextual information among image patches. We further incorporate image augmentation and feature augmentation to promote the diversity of augmentation. Moreover, to enhance consistency regularization, we propose a dual-branch framework where each branch applies image and feature augmentation to the input image. We conduct extensive experiments across multiple benchmark datasets, including Pascal VOC 2012, Cityscapes, and COCO. Results suggest that the proposed method outperforms state-of-the-art algorithms with notably observed accuracy improvement, especially under limited fine annotations. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semisupervised Encrypted Traffic Identification Based on Auxiliary Classification Generative Adversarial network

引用

computer Systems Science & engineering 2021年第12期39卷 373-390页

作者： Jiaming Mao Mingming Zhang Mu Chen Lu Chen Fei Xia Lei Fan ZiXuan Wang Wenbing Zhao State Grid Jiangsu Electric Power Co. Ltd.Information and Telecommunication BranchNanJing210003China Institute of Information and Communication Global Energy Interconnection Research InstituteState Grid Key Laboratory of Information and Network SecurityNanjing210003China Engineering Research Center of Post Big Data Technology and Application of Jiangsu Province Research and Development Center of Post Industry Technology of the State Posts Bureau(Internet of Things Technology)Broadband Wireless Communication Technology Engineering Research Center of the Ministry of EducationNanjing University of Posts and TelecommunicationsNanjing210003China Department of Electrical Engineering and Computer Science Cleveland State UniversityCleveland44115USA

The rapidly increasing popularity of mobile devices has changed the methods with which people access various network services and increased net-work traffic *** the past few decades,network traffic identification has been a research hotspot in the field of network management and security ***,as more network services use encryption technology,network traffic identification faces many *** classic machine learning methods can solve many problems that cannot be solved by port-and payload-based methods,manually extract features that are frequently updated is time-consuming and *** learning has good automatic feature learning capabilities and is an ideal method for network traffic identification,particularly encrypted traffic identification;Existing recognition methods based on deep learning primarily use supervised learning methods and rely on many labeled ***,in real scenarios,labeled samples are often difficult to *** paper adjusts the structure of the auxiliary classification generation adversarial network(ACGAN)so that it can use unlabeled samples for training,and use the wasserstein distance instead of the original cross entropy as the loss function to achieve semisupervised *** results show that the identification accuracy of ISCX and USTC data sets using the proposed method yields markedly better performance when the number of labeled samples is small compared to that of convolutional neural network(CNN)based classifier.

关键词： Encrypted traffic recognition deep learning generative adversarial network traffic classification semisupervised learning

来源：评论

学校读者我要写书评

暂无评论

Adaptive Information Bottleneck Guided Joint Source and Channel Coding for Image Transmission

arXiv

引用

arXiv 2022年

作者： Sun, Lunan Yang, Yang Chen, Mingzhe Guo, Caili Saad, Walid Poor, H. Vincent The Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China The Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Beijing Laboratory of Advanced Information Net works School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China The Wireless@VT Group Bradley Department of Electrical and Computer Engineering Virginia Tech ArlingtonVA United States The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

Joint source and channel coding (JSCC) for image transmission has attracted increasing attention due to its robustness and high efficiency. However, the existing deep JSCC research mainly focuses on minimizing the distortion between the transmitted and received information under a fixed number of available channels. Therefore, the transmitted rate may be far more than its required minimum value. In this paper, an adaptive information bottleneck (IB) guided joint source and channel coding (AIB-JSCC) method is proposed for image transmission. The goal of AIB-JSCC is to reduce the transmission rate while improving the image reconstruction quality. In particular, a new IB objective for image transmission is proposed so as to minimize the distortion and the transmission rate. A mathematically tractable lower bound on the proposed objective is derived, and then, adopted as the loss function of AIB-JSCC. To trade off compression and reconstruction quality, an adaptive algorithm is proposed to adjust the hyperparameter of the proposed loss function dynamically according to the distortion during the training. Experimental results show that AIB-JSCC can significantly reduce the required amount of transmitted data and improve the reconstruction quality and downstream task accuracy. Copyright © 2022, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Covert ISAC Against Collusive Wardens

引用

IEEE Transactions on Wireless Communications 2025年

作者： Wu, Yujie Xing, Chengwen Tang, Jie Zhao, Nan Zhang, Xiu Yin Wong, Kai-Kit Karagiannidis, George K. Dalian University of Technology School of Information and Communication Engineering Dalian 116024 China Beijing Institute of Technology School of Information and Electronics Beijing 100081 China South China University of Technology School of Electronic and Information Engineering Guangzhou 510641 China South China University of Technology Engineering Research Center of Short-Distance Wireless Communications and Network Ministry of Education School of Microelectronics Guangzhou 510641 China Pazhou Lab China University College London Department of Electronic and Electrical Engineering Torrington Place WC1E 7JE United Kingdom Yonsei University Yonsei Frontier Lab Seoul South Korea Taif University Department of Electrical Engineering Taif Saudi Arabia Aristotle University of Thessaloniki Department of Electrical and Computer Engineering Thessaloniki 54124 Greece

Integrated sensing and communication (ISAC) is seen as a future solution to frequency congestion due to its excellent ability to simultaneously support target sensing and information transmission. To guarantee robust data security and privacy protection, covert communication can be employed in ISAC systems. In this paper, we propose a covert ISAC scheme against collusive wardens. In particular, a dual-function base station transmits the sensing beamforming to continuously sense an aerial target while communicating with a ground receiver with a probability of 0.5 via the communication beamforming. First, we derive a closed-form expression of the detection outage probability of each warden to obtain the global detection outage probability. Under the worst case that the wardens can collusively adjust their detection thresholds to achieve the best detection performance, we jointly optimize the communication and sensing beamformings to maximize the covert transmission rate. To tackle this non-convex problem, unitary-iteration and zero-forcing schemes are proposed to transform it into convex ones via semidefinite relaxation and successive convex approximation, respectively. Numerical results demonstrate the validity of the proposed covert ISAC scheme, which can achieve a better trade-off among communication, sensing and covertness compared to benchmarks. © 2002-2012 IEEE.

关键词： beamforming optimization collusive wardens covert communication covert transmission rate Integrated sensing and communication

来源：评论

学校读者我要写书评

暂无评论

A game-theoretic framework for controlled islanding in the presence of adversaries

arXiv

引用

arXiv 2021年

作者： Niu, Luyao Sahabandu, Dinuka Clark, Andrew Poovendran, Radha Department of Electrical and Computer Engineering Worcester Polytechnic Institute WorcesterMA01609 United States Network Security Lab Department of Electrical and Computer Engineering University of Washington SeattleWA98195-2500 United States

Controlled islanding effectively mitigates cascading failures by partitioning the power system into a set of disjoint islands. In this paper, we study the controlled islanding problem of a power system under disturbances introduced by a malicious adversary. We formulate the interaction between the grid operator and adversary using a game-theoretic framework. The grid operator first computes a controlled islanding strategy, along with the power generation for the post-islanding system to guarantee stability. The adversary observes the strategies of the grid operator. The adversary then identifies critical substations of the power system to compromise and trips the transmission lines that are connected with compromised substations. For our game formulation, we propose a double oracle algorithm based approach that solves the best response for each player. We show that the best responses for the grid operator and adversary can be formulated as mixed integer linear programs. In addition, the best response of the adversary is equivalent to a submodular maximization problem under a cardinality constraint, which can be approximated up to a (1 − 1e ) optimality bound in polynomial time. We compare the proposed approach with a baseline where the grid operator computes an islanding strategy by minimizing the power flow disruption without considering the possible response from the adversary. We evaluate both approaches using IEEE 9-bus, 14-bus, 30-bus, 39-bus, 57-bus, and 118-bus power system case study data. Our proposed approach achieves better performance than the baseline in about 44% of test cases, and on average it incurs about 12.27 MW less power flow disruption. © 2021, CC BY.

关键词： Electric load flow

来源：评论

学校读者我要写书评

暂无评论

Scalable planning in multi-agent MDPS

arXiv

引用

arXiv 2021年

作者： Sahabandu, Dinuka Niu, Luyao Clark, Andrew Poovendran, Radha Network Security Lab Department of Electrical and Computer Engineering University of Washington SeattleWA98195-2500 United States Department of Electrical and Computer Engineering Worcester Polytechnic Institute WorcesterMA01609 United States

Multi-agent Markov Decision Processes (MMDPs) arise in a variety of applications including target tracking, control of multi-robot swarms, and multiplayer games. A key challenge in MMDPs occurs when the state and action spaces grow exponentially in the number of agents, making computation of an optimal policy computationally intractable for medium- to large-scale problems. One property that has been exploited to mitigate this complexity is transition independence, in which each agent’s transition probabilities are independent of the states and actions of other agents. Transition independence enables factorization of the MMDP and computation of local agent policies but does not hold for arbitrary MMDPs. In this paper, we propose an approximate transition dependence property, called δ-transition dependence and develop a metric for quantifying how far an MMDP deviates from transition independence. Our definition of δ-transition dependence recovers transition independence as a special case when δ is zero. We develop a polynomial time algorithm in the number of agents that achieves a provable bound on the global optimum when the reward functions are monotone increasing and submodular in the agent actions. We evaluate our approach on two case studies, namely, multi-robot control and multi-agent patrolling example. © 2021, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Multiple Receiver Over-the-Air Computation for Wireless networked Control Systems

arXiv

引用

arXiv 2025年

作者： Hussein, Seif Enyioha, Chinwendu Fischione, Carlo Division of Network and Systems Engineering KTH Royal Institute of Technology Stockholm Sweden Department of Electrical and Computer Engineering University of Central Florida OrlandoFL United States

We propose a multi-sender, multi-receiver over-the-air computation (OAC) framework for wireless networked control systems (WNCS) with structural constraints. Our approach enables actuators to directly compute and apply control signals from sensor measurements, eliminating the need for a centralized controller. We use an iterative and convexifying procedure to obtain a control law that is structured with respect to the network topology and minimizes the overall system energy-to-energy gain. Furthermore, we solve a constrained matrix factorization problem to find the optimal OAC configuration with respect to power consumption, robustness, and stability of the WNCS. We prove the convergence of our proposed algorithms and present numerical results that validate our approach to preserve closed-loop stability with robust control performance and constrained power. Copyright © 2025, The Authors. All rights reserved.

关键词： networked control systems

来源：评论

学校读者我要写书评

暂无评论

Assigning Entities to Teams as a Hypergraph Discovery Problem

arXiv

引用

arXiv 2024年

作者： de Arruda, Guilherme Ferraz He, Wan Heydaribeni, Nasimeh Javidi, Tara Moreno, Yamir Eliassi-Rad, Tina CENTAI Institute Turin Italy Network Science Institute Northeastern University BostonMA United States Department of Electrical and Computer Engineering University of California San Diego United States University of Zaragoza Zaragoza50018 Spain Department of Theoretical Physics University of Zaragoza Zaragoza50018 Spain Khoury College of Computer Sciences Northeastern University BostonMA United States Santa Fe Institute Santa FeNM United States

We propose a team assignment algorithm based on a hypergraph approach focusing on resilience and diffusion optimization. Specifically, our method is based on optimizing the algebraic connectivity of the Laplacian matrix of an edge-dependent vertex-weighted hypergraph. We used constrained simulated annealing, where we constrained the effort agents can exert to perform a task and the minimum effort a task requires to be completed. We evaluated our methods in terms of the number of unsuccessful patches to drive our solution into the feasible region and the cost of patching. We showed that our formulation provides more robust solutions than the original data and the greedy approach. We hope that our methods motivate further research in applying hypergraphs to similar problems in different research areas and in exploring variations of our methods. © 2024, CC BY.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Green Routing Game: Strategic Logistical Planning using Mixed Fleets of ICEVs and EVs

arXiv

引用

arXiv 2022年

作者： Sasahara, Hampei Dán, György Amin, Saurabh Sandberg, Henrik The Department of Systems and Control Engineering School of Engineering Tokyo Institute of Technology Tokyo152-8552 Japan The Division of Network and Systems Engineering School of Electrical Engineering and Computer Science Kth Royal Institute of Technology StockholmSE-100 44 Sweden The Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Division of Decision and Control Systems School of Electrical Engineering and Computer Science Kth Royal Institute of Technology StockholmSE-100 44 Sweden

This paper introduces a "green" routing game between multiple logistic operators (players), each owning a mixed fleet of internal combustion engine vehicle (ICEV) and electric vehicle (EV) trucks. Each player faces the cost of delayed delivery (due to charging requirements of EVs) and a pollution cost levied on the ICEVs. This cost structure models: 1) limited battery capacity of EVs and their charging requirement;2) shared nature of charging facilities;3) pollution cost levied by regulatory agency on the use of ICEVs. We characterize Nash equilibria of this game and derive a condition for its uniqueness. We also use the gradient projection method to compute this equilibrium in a distributed manner. Our equilibrium analysis is useful to analyze the trade-off faced by players in incurring higher delay due to congestion at charging locations when the share of EVs increases versus a higher pollution cost when the share of ICEVs increases. A numerical example suggests that to increase marginal pollution cost can dramatically reduce inefficiency of equilibria. © 2022, CC BY-NC-ND.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：