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

SSRN 2024年

作者： Ding, Zhijun Yan, Huanlan Chen, Yijun The Key Laboratory of Embedded System and Service Computing Tongji University No.4800 Caoan Gonglu Road Shanghai201804 China The Department of Computer Science and Technology Tongji University No.4800 Caoan Gonglu Road Shanghai201804 China Shanghai Artificial Intelligence Laboratory No.701 Yunjin Road Shanghai200232 China

The interbank lending network, while facilitating transactions, poses risk contagion in the banking system. To address challenges in existing research, this paper models the interbank lending network using a multi-agent approach and generates a dynamic network through a bidirectional matching mechanism(BiMM). Additionally, We divide banks into three categories based on realistic bank balance sheet data. Given the fact that banks of different categories exhibit different degrees of contagion, we propose the weighted DebtRank (W-DebtRank). Then, comprehensive simulation analysis is conducted on the risk contagion of heterogeneous banks in the dynamic network using W-DebtRank. The proposed method addresses four issues: the heterogeneity of banks, the dynamic nature of networks, the practicality of lending strategies, and the comprehensiveness of risk analysis. The model is validated using the SRISK metric and the Monte Carlo-based SYMBOL simulation model. Through multiple perspectives in simulation experiments, the risk contagion process among banks is deeply investigated in our paper. © 2024, The Authors. All rights reserved.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Learning Adaptive and View-Invariant Vision Transformer with Multi-Teacher Knowledge Distillation for Real-Time UAV Tracking

arXiv

引用

arXiv 2024年

作者： Wu, You Li, Yongxin Liu, Mengyuan Wang, Xucheng Yang, Xiangyang Ye, Hengzhou Zeng, Dan Zhao, Qijun Li, Shuiwang College of Computer Science and Engineering Guilin University of Technology Guilin541006 China Guangxi Key Laboratory of Embedded Technology and Intelligent System Guilin541006 China School of Computer Science Fudan University Shanghai200082 China School of Artificial Intelligence Sun Yat-sen University Zhuhai510275 China College of Computer Science Sichuan University Chengdu610017 China

Visual tracking has made significant strides due to the adoption of transformer-based models. Most state-of-the-art trackers struggle to meet real-time processing demands on mobile platforms with constrained computing resources, particularly for real-time unmanned aerial vehicle (UAV) tracking. To achieve a better balance between performance and efficiency, we introduce AVTrack, an adaptive computation framework designed to selectively activate transformer blocks for real-time UAV tracking. The proposed Activation Module (AM) dynamically optimizes the ViT architecture by selectively engaging relevant components, thereby enhancing inference efficiency without significant compromise to tracking performance. Furthermore, to tackle the challenges posed by extreme changes in viewing angles often encountered in UAV tracking, the proposed method enhances ViTs’ effectiveness by learning view-invariant representations through mutual information (MI) maximization. Two effective design principles are proposed in the AVTrack. Building on it, we propose an improved tracker, dubbed AVTrack-MD, which introduces the novel MI maximization-based multi-teacher knowledge distillation (MD) framework. It harnesses the benefits of multiple teachers, specifically the off-the-shelf tracking models from the AVTrack, by integrating and refining their outputs, thereby guiding the learning process of the compact student network. Specifically, we maximize the MI between the softened feature representations from the multi-teacher models and the student model, leading to improved generalization and performance of the student model, particularly in noisy conditions. Extensive experiments on multiple UAV tracking benchmarks demonstrate that AVTrack-MD not only achieves performance comparable to the AVTrack baseline but also reduces model complexity, resulting in a significant 17% increase in average tracking speed. Codes is be available at https://***/wuyou3474/AVTrack. Copyright © 2024, The

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Predictive Resilience Assessment Featuring Diffusion Reconstruction for Road Networks Under Rainfall Disturbances

SSRN

引用

SSRN 2024年

作者： Zang, Di Wei, Chenguang Zhao, Jiayi Zhang, Junqi Tang, Keshuang Zhu, Hong Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science and Technology Tongji University No. 4800 Cao’an Road Shanghai200092 China Key Laboratory of Road and Traffic Engineering Ministry of Education College of Transportation Engineering Tongji University No. 4800 Cao’an Road Shanghai200092 China

The ability of road networks to withstand external disturbances is a crucial measure of transportation system performance, where resilience distinctly emerges as an effective perspective for its unique insights into the system's resistance and recovery capabilities. In the face of unforeseen resilience disturbance events, predictive and accurate assessment of road network resilience is essential for better traffic regulation and emergency response management. However, existing resilience assessment methods of road networks are insufficient: they lack reliable real-time big-data analysis, do not possess predictive capabilities for guiding decision-making, and have a narrow view with single-dimensional resilience indicators. To address these issues, focusing on rainfall disturbance scenarios, this work introduces a novel resilience assessment method, which is predictive and real-time, consisting of two components: a deep learning traffic indicator prediction model and a comprehensive resilience assessment model. Firstly, we propose a two-stage traffic indicator prediction model, namely the Conditional Diffusion-Reconstruction-based Graph Neural Network (CDRGNN), which particularly enhances disturbance-scenario prediction accuracy, thereby providing reliable foresight in aid of the following assessments. Subsequently, we develop a resilience assessment model featuring structural-functional comprehensive resilience indicators established through shortest-path aggregation, and the overall resilience assessment is performed through comparative analysis using indicators obtained in real-time with historical non-disruptive resilience benchmarks. In a case study focusing on heavy rainfall disturbances on a road network in California, the United States, abundant experiments and visualizations are conducted to demonstrate the rationality of our proposed comprehensive resilience indicators as well as the precision and reliability of these predictive resilience assessment outcom

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PseudoSC: A Binary Approximation to Stochastic Computing within Latent Operation-Space for Ultra-Lightweight on-Edge DNNs 23

PseudoSC: A Binary Approximation to Stochastic Computing wit...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Jihe Wang Zhaoqing Wang Danghui Wang School of Computer Science Northwestern Polytechnical University Xi'an China Engineering Research Center of Embedded System Integration Ministry of Education Northwestern Polytechnical University Xi'an China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9798350323481

Recently, stochastic computing (SC) is increasingly popular in constructing MAC for on-edge DNNs benefiting from its outstanding energy-efficiency, including its adequate precision and gatelevel operation. However, current SC-DNN systems always include a lot of costly SNGs/APCs for inevitably switches between binary and stochastic domains, which mortgages incongruous resources to pay the "bill" of the domain-switches and impedes highly-concurrent deployments. In this work, PseudoSC, a binary approximation to low-discrepancy SC, is proposed to totally remove the domain-switch for SNG/APC-free SC-DNNs. Its basic idea is to virtually re-arrange a couple of stochastic operands into a 2-D latent op-space, in which, original Monte Carlo sampling can be partitioned into three sub-ops, i.e., two fixed binary-ops and a fractal recursion. In theory, the recursion forms an isomorphic partition of the sampling repeated in smaller scales until the binary base-case achieved, as a result, a SC-op is well approximated only with binary-ops. Based on above theory, a multi-lane micro-architecture is designed to unroll the recursion within a few cycles and its advantages on hardware saving is verified under popular DNNs. The evaluation shows that the DNN-models with our schemes achieve 98.7% accuracy of the fixed-point implementations, which significantly outperform other SOTA methods. In addition, its reduced structure improves the power efficiency by 3.67 times on average.

关键词： stochastic computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Routing Protection Algorithm Based on Optimized Network Topology

引用

computers, Materials & Continua 2022年第9期72卷 4525-4540页

作者： Haijun Geng Zikun Jin Jiangyuan Yao Han Zhang Zhiguo Hu Bo Yang Yingije Guo Wei Wang Qidong Zhang Guoao Duan School of Computer and Information Technology Shanxi UniversityShanxi030006China School of Automation and Software Engineering Shanxi UniversityShanxi030006China School of Computer Science and Technology Hainan UniversityHaikou570228China Department of Computer Science&Technology Tsinghua UniversityBeijing100084China Department of Urban&Regional Planning San JoséState University San JoséCA95192USA Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai201804China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu610054China Beijinng University of Technology Beijing-Dublin International CollegeBeijing University of TechnologyBeijing100124China

Network failures are unavoidable and occur *** the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence *** this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be *** usually employs routing protection algorithms to improve intra-domain routing ***,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in *** address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source ***,the backup path with the minimum path coincidence with the shortest path is described as an integer programming *** the simulated annealing algorithm ERPBONT is used to find the optimal ***,the algorithm is tested on the simulated topology and the real *** experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.

关键词： Routing protection algorithm network availability network failure shortest path backup path

来源：评论

学校读者我要写书评

暂无评论

E2DAS: An Efficient Equivariant Dynamic Aggregation Saliency Model for Omnidirectional Images 27th

E2DAS: An Efficient Equivariant Dynamic Aggregation Saliency...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Nana Liu, Qian Zhu, Dandan Zhu, Kun Zhai, Guangtao Yang, Xiaokang School of Computer Science and Technology Donghua University No.2999 Renmin North Road Songjiang District Shanghai201620 China Institute of AI Education Shanghai East China Normal University No.3663 Zhongshan North Road Putuo District Shanghai200333 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No.4800 Cao’an Highway Jiading District Shanghai201804 China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9783031781216

Recent years have witnessed rapid progress of convolutional neural networks (CNNs) and their successful application in the task of saliency prediction for omnidirectional images (ODIs). Albeit achieving tremendous performance improvements, these CNNs-based saliency models are plagued by two major shortcomings: spatial content-agnostic and computationally intensive. Inspired by the effectiveness of equivariant network in the majority of computer vision tasks, we propose a novel efficient equivariant dynamic aggregation saliency (E2DAS) model to efficiently tackle the issue of human fixation prediction in ODIs. To be specific, our proposed model consists of an efficient equivariant module, a dynamic convolutional aggregation module, and an optimization computation module. Different from existing saliency models for ODIs, we are the first attempt to introduce an efficient equivariant dynamic convolutional aggregation operation into the saliency prediction task, which can fundamentally alleviate the projection distortion problem and can effectively learn spatial content-adaptive features. Moreover, we clearly observe a considerable decrease in the number of parameters resulting from the replacement of standard convolution with dynamic convolution aggregation. Extensive experiments on several benchmark datasets show the proposed model’s superiority over other state-of-the-art methods in terms of performance. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Equivariant dynamic aggregation light-weight model omnidirectional images saliency prediction spatial content-adaptive

来源：评论

学校读者我要写书评

暂无评论

HeavyTracker: An Efficient Algorithm for Heavy-Hitter Detection in High-Speed Networks

HeavyTracker: An Efficient Algorithm for Heavy-Hitter Detect...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Jiakun Yu Yu-E Sun He Huang Yang Du Guoju Gao Hongli Xu Shigang Chen School of Computer Science and Technology Soochow University Suzhou China School of Rail Transportation Soochow University Suzhou China Ministry of Education Key Laboratory of Embedded System and Service Computing (Tongji University) Shanghai China School of Computer Science and Technology University of Science and Technology of China Hefei China

Detecting heavy hitters that constitute the majority of network traffic is a critical task in network measurement. However, the highly skewed network traffic and the size-limited on-chip memory pose great challenges for heavy-hitter detection. The prior arts either use sketches to track all flows or maintain a fix-sized tracking list for recording elephant flows, resulting in limited detection precision or time-consuming tracking list exchanges. This paper presents HeavyTracker, an efficient algorithm that detects heavy hitters based on a count-with-threshold strategy. A two-dimensional tracker unit array is employed in our design to capture the heavy hitters, where each flow is randomly mapped to one unit in all rows. The tracker unit is designed to accept many flows and precisely report the largest two with frequencies that reach a predefined threshold. This design eliminates the frequent and time-consuming exchanges for maintaining the tracking list, allowing us to use a hash table to track the reported elephant flows. Experimental results based on real Internet traces show that HeavyTracker achieves a high $\mathbf{F}_{\beta}$-Score of threshold-t detection (0.97) and over 99% precision of top-k detection under a tight memory size. Besides, it reduces the frequency estimation error by 97.4% compared to the state-of-the-art.

关键词： Art High-speed networks Measurement uncertainty Telecommunication traffic Size measurement Frequency estimation Internet

来源：评论

学校读者我要写书评

暂无评论

Heuristic Elastic Scaling for Kubernetes Heterogeneous Microservices

Heuristic Elastic Scaling for Kubernetes Heterogeneous Micro...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Song Wang Sheng He Yishuang Ning Xiang Gao Zhijun Ding Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Tongji University Shanghai China Kingdee Research Kingdee International Software Group Co. Ltd Shenzhen China Intelligent Computing Facility Innovation Center ZhejiangLab Hangzhou China

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Kubernetes has become the basic platform for building cloud native applications. However, existing horizontal scaling methods based on Kubernetes have problems with resource redundancy. Furthermore, the combined horizontal and vertical scaling based on Kubernetes takes a long time. Regarding the issue above, first, we describe the execution processes of three scaling techniques and compare them in different dimensions; second, we construct a formal elastic scaling model for expansion scenarios, with the goal of minimizing the total cost; and third, we introduce a heuristic expansion algorithm after balancing resource redundancy and execution time as the heuristic information. The experiment results show that the elastic scaling algorithm proposed in this paper achieves better performance than other algorithms.

关键词： Costs Heuristic algorithms Redundancy Buildings Microservice architectures Sensors

来源：评论

学校读者我要写书评

暂无评论

TDiffSal: Text-Guided Diffusion Saliency Prediction Model for Images 27th

TDiffSal: Text-Guided Diffusion Saliency Prediction Model fo...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Nana Xiong, Min Zhu, Dandan Zhu, Kun Zhai, Guangtao School of Computer Science and Technology Donghua University No. 2999 Renmin North Road Songjiang District Shanghai201620 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210093 China Institute of AI Education Shanghai East China Normal University No. 3663 Zhongshan North Road Putuo District Shanghai200333 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No. 4800 Cao’an Highway Jiading District Shanghai201804 China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9783031781858

Existing visual saliency prediction methods mainly focus on single-modal visual saliency prediction, while ignoring the significant impact of text on visual saliency. To more comprehensively explore the influence of text on human attention in images, we propose a text-guided diffusion saliency prediction model, named TDiffSal. In specific, recent studies on stable diffusion models have shown promising performance in unifying tasks due to their inherent generalization ability. Inspired by this, a novel diffusion model for generalized visual-text saliency prediction is proposed, which formulates the prediction issue as a conditional generative task of the saliency map by employing input visual and text as the conditions. Meanwhile, we introduce a multi-head fusion module to effectively integrate text features and image features, which can efficiently guide the image denoising process and progressively refine the generated saliency map to make it semantically relevant to the text. Additionally, we employ an efficient pre-training strategy to enhance the robustness and generalization of the proposed model. We conduct extensive experiments on benchmark datasets to demonstrate its superior performance compared to other state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：