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

IEEE International Conference on systems, Man and Cybernetics

作者： Yixi Wu Yaying Zhang Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781665442084

Path recommendation is an essential application in people’s daily life. However, drivers’ experience hidden in their driving history and their personal preferences are less considered in path planning. In this paper we propose a dynamic time-constrained path recommendation method, utilizing the historical GPS trajectory information and user preferences. First, based on graph entropy, critical intersections are extracted from trajectory information to simplify the road network structure. Then the time-dependent mostly chosen path (TDMCP) is obtained by trajectories processing to determine the time-varying paths between critical intersections. Thus the original complex road network is abstracted as a search subnet. Finally we propose an improved dynamic A* search (IDAS) on the search sub-net to find the candidate paths satisfying the time-constraints, and further allow users to set personal preferences to select the final optimal path. The proposed method is validated on the real-world data set, and the result shows that the proposed method surpasses the competing ones especially on long distance path recommendation.

关键词： Roads Conferences Entropy Trajectory History Data mining Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Routing Strategy for SDN Large Flow Based on Deep Reinforcement Learning

Routing Strategy for SDN Large Flow Based on Deep Reinforcem...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Yu Ke Junli Wang Chungang Yan Jiamin Yao Key Laboratory of Embedded System and Service Computing Collaborative Innovation Center for Financial Network Security (Tongji University) Ministry of Education National (Province-Ministry Joint) Tongji University Shanghai China

With the expansion of network scale, traditional routing strategies in Software-Defined Networking (SDN) have difficulty adapting to fast traffic variability. The large flow in the network occupies 80% of the network traffic. An unreasonable schedule of the large flow will lead to the emergence of bottleneck links and reduce the network performance. To solve the above problems, this paper proposes a different routing method, called Routing Strategy for SDN Large Flow Based on Deep Reinforcement Learning (RSDRL). Considering the links in the network that can carry large flow are limited, RSDRL can schedule large flow firstly and generate routing strategies adaptively. At the same time, in order to avoid the occurrence of congestion, RSDRL quantifies the degree of congestion in the network to implement routing. Experiments show that the proposed model has better Quality of service (QoS) performance under the test traffic, realizing a reasonable schedule of traffic.

关键词： Deep learning Training Knowledge engineering Schedules Adaptation models Reinforcement learning Quality of service

来源：评论

学校读者我要写书评

暂无评论

Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Liu, Zhaobo Yuan, Jianhua Zhang, Haili Zeng, Tao Zhu, Zexuan Shenzhen University Institute for Advanced Study Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen Polytechnic University School of Undergraduate Education Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University Shenzhen City Key Laboratory of Embedded System Design Shenzhen518060 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of China Chongqing400044 China

Evolutionary multitasking algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of evolutionary multitasking algorithms. In this study, we propose an innovative approach to mitigate negative transfer in evolutionary multitasking algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed optimal crossover operator into a fundamental evolutionary multitasking algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A Dual-stage Attention Based SDN Traffic Prediction Method

A Dual-stage Attention Based SDN Traffic Prediction Method

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Chenjing Gao Junli Wang Chungang Yan Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University Shanghai China

Traffic matrix is the main research object of traffic prediction in software-defined networking. Accurate and timely traffic matrix prediction plays an important role in avoiding network congestion. While various methods have been proposed in previous studies to solve the SDN traffic prediction problem, few of them consider both inter- and intra-flow features. In this paper, we propose a dual-stage attention based Traffic Prediction method for the SDN traffic matrix prediction task. First, our method uses temporal pattern attention as the inter-flow attention mechanism before the encoding stage to realize adaptive feature extraction. Then, temporal attention is introduced as the intra-flow attention mechanism before the decoding stage to capture long-term temporal dependencies. Finally, we use the autoregressive module to handle the highly dynamic SDN traffic volume. Experimental results show that our proposed SDN traffic prediction method can capture more traffic features and improve the SDN traffic matrix prediction performance to some extent.

关键词： Network topology Time series analysis Prediction methods Machine learning Feature extraction Graph neural networks Encoding

来源：评论

学校读者我要写书评

暂无评论

Efficient poisoning attacks and defenses for unlabeled data in DDoS prediction of intelligent transportation systems

引用

Security and Safety 2022年第1期1卷 121-141页

作者： Zhong Li Xianke Wu Changjun Jiang College of Information Science and Technology Donghua University Key Laboratory of the Ministry of Education for Embedded System and Service Computing Department of Computer Science Tongji University Shanghai Network Financial Security Collaborative Innovation Center Tongji University

Nowadays, large numbers of smart sensors(e.g., road-side cameras) which communicate with nearby base stations could launch distributed denial of services(DDoS) attack storms in intelligent transportation systems. DDoS attacks disable the services provided by base stations. Thus in this paper, considering the uneven communication traffic flows and privacy preserving, we give a hidden Markov model-based prediction model by utilizing the multi-step characteristic of DDoS with a federated learning framework to predict whether DDoS attacks will happen on base stations in the future. However, in the federated learning,we need to consider the problem of poisoning attacks due to malicious participants. The poisoning attacks will lead to the intelligent transportation systems paralysis without security protection. Traditional poisoning attacks mainly apply to the classification model with labeled data. In this paper, we propose a reinforcement learning-based poisoning method specifically for poisoning the prediction model with unlabeled data. Besides, previous related defense strategies rely on validation datasets with labeled data in the server. However, it is unrealistic since the local training datasets are not uploaded to the server due to privacy preserving, and our datasets are also unlabeled. Furthermore, we give a validation dataset-free defense strategy based on Dempster–Shafer(D–S) evidence theory avoiding anomaly aggregation to obtain a robust global model for precise DDoS prediction. In our experiments, we simulate 3000 points in combination with DARPA2000 dataset to carry out evaluations. The results indicate that our poisoning method can successfully poison the global prediction model with unlabeled data in a short time. Meanwhile, we compare our proposed defense algorithm with three popularly used defense algorithms. The results show that our defense method has a high accuracy rate of excluding poisoners and can obtain a high attack prediction probability.

关键词： Poisoning attacks Defenses Multi-step DDoS prediction Unlabeled data Intelligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

Virtual Source-Based Particle Swarm Optimizer for Multi-Source Location Using Mobile Swarm Robotics

Virtual Source-Based Particle Swarm Optimizer for Multi-Sour...

引用

第33届中国过程控制会议

作者： JunQi Zhang YuXuan Lin Qi Kang Department of Computer Science and Technology the Key Laboratory of Embedded System and Service ComputingTongji UniversityMinistry of EducationShanghai Electronic Trans actions and Information Service Collaborative Innovation Center IEEE

Source location is an interesting topic in the field of swarm ***-source location is a vital branch of *** with a single-source location problem,the main difficulty for the multi-source location lies in that the number and distribution of sources are *** Swarm Optimizer(PSO) has been widely adopted for the single-source location ***,its performance deteriorates greatly when it faces multiple sources because it is designed to find the single global best solution,not multiple *** handle such a challenge,a virtual source mechanism is proposed to help PSO overcome this *** key idea of the virtual source mechanism is to divide the search area into multiple cells,each of which has a virtual *** virtual source leads the swarm to cover each cell such that particles can cover all cells in a search space before they *** results demonstrate that the virtual source mechanism-based PSO effectively locates multiple sources.

关键词： Particle swarm optimizer virtual source mobile swarm robotics multi-source location

来源：评论

学校读者我要写书评

暂无评论

LAMPT: LAbel Mask-Predicted Transformer for Extreme Multi-label Text Classification

LAMPT: LAbel Mask-Predicted Transformer for Extreme Multi-la...

引用

IEEE International Conference on Big Data

作者： Yifan Xu Minghao Zhu Junli Wang Chungang Yan Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education. National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University Shanghai China

ISBN: (纸本)9781665480468

Extreme Multi-label text Classification ( XMC) is a task of recalling the most relevant labels for each given text from an extremely large-scale label set. It is emphasized that XMC is a more complex classification task because there are two main problems: large space of labels and the labels in XMC tasks tend to be correlated. Existing methods attempt to model label correlations by viewing the XMC task as a sequence generation problem however they still suffer from (1) using the slow serial decoding strategy where labels are predicted one-by-one. (2) needing to compare a mass of label ordering strategies in the decoding stage to achieve satisfied accuracy. In this work, we propose LAbel Mask-Predicted Transformer (LAMPT) to address the both issues, which is a novel non-autoregressive generation model that (1) enriches the input raw text representation with the additional label features by fully exploiting the label dependencies, (2) allows for efficient parallel decoding thanks to its non-autoregressive decoding formulation and mask-prediced training strategy. Experimental results demonstrate that single model performance is substantially enhanced by LAMPT. On a Wiki dataset with thirty-one thousand labels, LAMPT-XLNet accuracy has gained 1.6% relative improvement on P@3 over the LightXML-XLNet. Also, the P@1 of ensemble LAMPT is 90.00%, a significant i mprovement over the state-of-the-art ensemble LightXML (transformer-based) and AttentionXML (LSTM-based), which achieve 89.45% and 87.47%, respectively.

关键词： Training Correlation Text categorization Information services Big Data Predictive models Transformers

来源：评论

学校读者我要写书评

暂无评论

Reply to Comments on 'Direct-Splitting-Based CN-FDTD for Modeling 2D Material Nanostructure Problems'

IEEE Open Journal of Antennas and Propagation

引用

IEEE Open Journal of Antennas and Propagation 2021年 2卷 676-678页

作者： Feng, Naixing Zhang, Yuxian Zeng, Qingsheng Tong, Mei Song Joines, William T. Wang, Guo Ping Institute of Microscale Optoelectronics Shenzhen University Shenzhen China College of Astronautics Nanjing University of Aeronautics and Astronautics Nanjing China Key Laboratory of Embedded System and Service Computing of the Ministry of Education College of Electronics and Information Engineering Tongji University Shanghai China Department of Electrical and Computer Engineering Duke University DurhamNC United States

In this response letter, we focus on addressing Yu Hang Yang's comments so that the correctness and validity of the proposed auxiliary-differential-equation-based (ADE) Crank-Nicolson finite-difference time-domain method with direct-splitting technique (CNDS-FDTD) are demonstrated. Moreover, related applications in modeling 2D material nanostructure problems are shown. © 2020 IEEE.

关键词： Finite difference time domain method

来源：评论

学校读者我要写书评

暂无评论

Remote State Estimation for Complex Networks Under Probabilistic Bit Flips: A Transmission Power Allocation Scheme

引用

IEEE Transactions on Automatic Control 2025年

作者： Song, Jiahao Wang, Zidong Liu, Qinyuan He, Xiao Tsinghua University Department of Automation Beijing100084 China Brunel University London Department of Computer Science UxbridgeUB8 3PH United Kingdom Tongji University Department of Computer Science and Technology Shanghai201804 China Ministry of Education Tongji University Key Laboratory of Embedded System and Service Computing Shanghai200092 China Shanghai Artificial Intelligence Laboratory Shanghai China

In this paper, the problem of remote state estimation is investigated for a class of complex networks with noisy wireless communication channels. The employment of the binary encoding scheme allows for the description of the influence of channel noises as probabilistic bit flips, where the probability of these bit flips is influenced by several factors with the signal-to-noise ratio (SNR) being a crucial one. In engineering practice, the method of adjusting the transmission power for each node in a complex network is commonly applied to modify the SNR so as to reduce the data distortion caused by bit flips. Furthermore, due to restricted communication resources, the total available transmission power is often limited particularly in large-scale systems such as complex networks. Consequently, the allocation of transmission power for all nodes under a total transmission power constraint becomes a concern. Utilizing the ultimately bounded filtering method, we devise a transmission-power-dependent state estimator, by which the combined effect of probabilistic bit flips and transmission power allocation on estimation performance is analyzed. Moreover, the task of co-designing the transmission power allocation scheme and estimator gains is modeled as an optimization problem, which is then addressed through a two-step optimization strategy. The existence of a unique optimal transmission power allocation scheme is also proven. Finally, numerical simulation examples are provided to demonstrate the effectiveness of the proposed co-design approach. © 1963-2012 IEEE.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

Finite time cluster consensus of fractional-order multi-agent systems with directed topology

Finite time cluster consensus of fractional-order multi-agen...

引用

第33届中国控制与决策会议

作者： Weijin Liu Xiwei Liu Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education

In this paper,the finite time cluster consensus(FnTCC) of fractional-order multi-agent systems(FOMAS)with directed topology is *** fractional-order system is converted into an integer-order system by defining a neighborhood-based error variable,and suitable control rules are designed for the obtained first-order multi-agent *** to the exponential finite-time stability theorem,suitable Lyapunov functions are ***,the settling time function is *** simulation results prove the feasibility and validity of our theory.

关键词： Fractional-order Cluster consensus Exponential finite time Multi-agent systems Directed topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：