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

An interpretable unsupervised capsule network via comprehensive contrastive learning and two-stage training

PATTERN RECOGNITION 2025年 158卷

作者： Zeng, Ru Song, Yan Zhong, Yanjiu Univ Shanghai Sci & Technol Dept Control Sci & Engn Shanghai 200093 Peoples R China

Limited attention has been given to unsupervised capsule networks (CapsNets) with contrastive learning due to the challenge of harmoniously learning interpretable primary and high-level capsules. To address this issue, we focus on three aspects: loss function, routing algorithm, and training strategy. First, we propose a comprehensive contrastive loss to ensure consistency in learning both high-level and primary capsules across different objects. Next, we introduce an agreement-based routing mechanism for the activation of high-level capsules. Finally, we present a two-stage training strategy to resolve conflicts between multiple losses. Ablation experiments show that these methods all improve model performance. Results from linear evaluation and semi-supervised learning demonstrate that our model outperforms other CapsNets and convolutional neural networks in learning high-level capsules. Additionally, visualizing capsules provides insights into the primary capsules, which remain consistent across images and align with human vision.

关键词： Unsupervised capsule network Comprehensive contrastive loss routing algorithm Interpretability Primary capsules

来源：评论

学校读者我要写书评

暂无评论

routing algorithms on the bus-based hypercube network

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2005年第4期16卷 335-348页

作者： Fan, LJ Yang, CB Shiau, SH Natl Sun Yat Sen Univ Dept Appl Math Taoyuan 333 Taiwan Natl Sun Yat Sen Univ Dept Comp Sci & Engn Kaohsiung 804 Taiwan

In this paper, we study the properties of the bus-based hypercube, denoted as U(n, b), which is a kind of multiple-bus networks (MBN). U(n, b) consists of 2(n) processors and 2(b) buses, where 0 less than or equal to b less than or equal to n - 1, and each processor is connected to either inverted right perpendicularb+2/2inverted left perpendicular or inverted right perpendicularb+1/2inverted left perpendicular buses. We show that the diameter of U(n, b) is inverted right perpendicularb+1/2inverted left perpendicular if b greater than or equal to 2. We also present an algorithm to select the best neighbor processor via which we can obtain one shortest routing path. In U(n, b), we show that if there exist some faults, the fault diameter DF(n, b, f) less than or equal to b + 1, where f is the sum of bus faults and processor faults and 0 less than or equal to f less than or equal to inverted right perpendicularb-3/2inverted left perpendicular. Furthermore, we also show that the bus-fault diameter DB(n, b, f) less than or equal to b + 1, where f is the sum of bus faults and processor faults and 0 less than or equal to f less than or equal to inverted right perpendicularb-1/2inverted left perpendicular and f is the number of bus faults. These results improve significantly the previous result that DB(n, b, f) less than or equal to b + 2f + 1, where f is the number of bus faults.

关键词： multiple-bus network hypercube routing algorithm diameter fault tolerance

来源：评论

学校读者我要写书评

暂无评论

CAFEEN: A Cooperative Approach for Energy-Efficient NoCs With Multiagent Reinforcement Learning

IEEE DESIGN & TEST

引用

IEEE DESIGN & TEST 2025年第2期42卷 71-78页

作者： Khan, Kamil Pasricha, Sudeep Colorado State Univ Ft Collins CO 80523 USA

Editor's notes: This article proposes a reinforcement-learning-based methodology to improve energy-efficiency of Network-on-Chip-based systems. -Partha Pratim Pande, Washington State University, USA

关键词： routing Turning Telecommunication traffic Q-learning System recovery Energy efficiency Costs Topology Quality of service Power demand networks-on-chip multi-agent reinforcement learning power-gating routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Architectural Exploration for Waferscale Switching System

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2025年第2期33卷 512-524页

作者： Wan, Zhiquan Cao, Zhipeng Li, Shunbin Li, Peijie Deng, Qingwen Wang, Weihao Zhang, Kun Liu, Guandong Zhang, Ruyun Liu, Qinrang Zhejiang Lab Hangzhou 311121 Zhejiang Peoples R China Peoples Liberat Army Strateg Support Force Informa Inst Informat Technol Zhengzhou 450003 Henan Peoples R China

mymargin2 With the end of Moore's law and Dennard scaling, waferscale systems or processors that integrate multiple pre-tested known good dies (KGDs) on a waferscale-interposer are new approaches to further improve the chiplet-based system's performance. This article explores the network on wafer (NoW) architecture of waferscale switching system under several physical constraints. A software-based approach is proposed to redefine the topological property. A five-level butterfly fat-tree (BFT)-like logical topology with 8.96-Tb/s (896 ports $\times$ 10 Gb/s/port) switching bandwidth is achieved based on 2-D-mesh-like physical topology. We show that the proposed BFT-like topology with breadth-first-search (BFS) based traffic balanced routing algorithm reduces 55.6% hops, 41.4% transmission delay, and improves 24.2% throughput compared to 2-D-mesh-like topology under different traffic distributions. This BFT-like waferscale switching system is suitable for high-performance computing and data centers. In addition, the numerical analysis shows that the waferscale package can provide significant power efficiency and latency advantages compared to the typical single-chip package, which mainly benefits from the short-reach IO requirements. Note that the proposed waferscale switching system is compatible with high-switch-capacity dies with advanced process technology, which can further improve system performance. Finally, we present the physical implementations for the waferscale system with heterogeneous dies.

关键词： Topology Switching systems routing Bonding Optical switches Integrated circuit interconnections Chiplets Chiplet network architecture and design on-wafer interconnect networks routing algorithm waferscale system

来源：评论

学校读者我要写书评

暂无评论

routing algorithms for the shuffle-exchange permutation network

引用

JOURNAL OF SUPERCOMPUTING 2021年第10期77卷 11556-11574页

作者： Khosravi, Behnam Khosravi, Behrooz Khosravi, Bahman Inst Adv Studies Basic Sci IASBS Dept Math Zanjan *** Iran Amirkabir Univ Technol Tehran Polytech Fac Math & Comp Sci Dept Pure Math 424 Hafez Ave Tehran 15914 Iran Qom Univ Technol Dept Math Qom Iran

For a natural number n, let S-n denote the symmetric group on n letters. Let SEPn be the Cayley graph Cay(S-n, {sigma, sigma(-1), tau}), where tau = (12) and sigma = (1,..., n). In this note, we present an easy static routing algorithm for SEPn which gives us an exact formula for the path between every pair of nodes in SEPn and it does not need any calculations. Also, we show that an upper bound of this algorithm is l(3n + 1)(2)/9. Furthermore, we use our results to present a dynamic routing algorithm for SEPn which needs at most n calculations for routing and also it does not need large amount of memory for routing tables.

关键词： Cayley graph The shuffle-exchange permutation network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

routing algorithms with efficient resource utilization for LEO satellite networks 2

Routing algorithms with efficient resource utilization for L...

引用

2nd Symposium on Novel Technology of X-Ray Imaging

作者： Zhang, Tingting Yin, Jie Shi, Huifeng Liu, Zhihui Dong, Tao Beijing Inst Satellite Informat Engn State Key Lab Space Ground Integrated Informat Te Beijing 100029 Peoples R China

ISBN: (数字)9781510628274

ISBN: (纸本)9781510628274

Recently, a series of researches have been emphasized on developing advanced satellite networks, mostly because of its advantage in providing spaced-based global communication service. But most of these work prefer to focus on the time-varying topologies, large delays and intermittent connections of satellite networks. However, there is another issue worthy of attentions, i.e., the scarcity and preciousness of satellite resources, owing to the shortage of orbit resources and the high cost of launching a satellite. Therefore, it is significantly important to consider the efficient utilization of resources during designing routing strategies for satellite networks. In this paper, we propose two routing algorithms to optimize the number of used inter-satellite links, which will directly improve the bandwidth utilization and save resources for LEO satellite networks. The basic idea is to reduce the number of links used by lower-priority traffic through scheduling them to links used by highest-priority services, and simultaneously introduce the load balancing strategies to control the aggregation of network flow. Simulation results show that with the price of little longer latency and load unbalancing, our algorithms can effectively decrease the total number of used links, and thus improve the resource utilization and save energy for satellite networks.

关键词： satellite network routing algorithm bandwidth utilization load balancing

来源：评论

学校读者我要写书评

暂无评论

A 2N-2-STEP algorithm FOR routing IN AN NXN ARRAY WITH CONSTANT-SIZE QUEUES

引用

algorithmICA 1995年第4期14卷 291-304页

作者： LEIGHTON, T MAKEDON, F TOLLIS, IG MIT COMP SCI LABCAMBRIDGEMA 02139 DARTMOUTH COLL DEPT MATH & COMP SCIHANOVERNH 03755 UNIV TEXAS DEPT COMP SCIRICHARDSONTX 75083

In this paper we describe a deterministic algorithm for solving any 1-1 packet-routing problem on an n x n mesh in 2n - 2 steps using constant-size queues. The time bound is optimal in the worst case. The best previous deterministic algorithm for this problem required time 2n + Theta(n/q) using queues of size Theta(q) for any 1 less than or equal to q less than or equal to n, and the best previous randomized algorithm required time 2n + Theta(log n) using constant-size queues.

关键词： ARRAY PACKET routing QUEUE routing algorithm

来源：评论

学校读者我要写书评

暂无评论

routing and Wavelength Assignment algorithm for Mesh-based Multiple Multicasts in Optical Network-on-chip

引用

THEORY OF COMPUTING SYSTEMS 2024年第5期68卷 1353-1371页

作者： Gao, Fei Yu, Cui Chen, Yawen Gao, Boyong China Jiliang Univ Coll Informat Engn Key Lab Electromagnet Wave Informat Technol & Metr Hangzhou 310018 Peoples R China Univ Otago Dept Comp Sci Dunedin 9016 New Zealand

Optical network-on-chip (ONoC) is an emerging architecture to realize high-performance and low power consumption for many-core processors. Multicast in ONoC is a vital communication pattern widely used in parallel computing and computational genomics. This paper proposes an efficient scheme for multiple multicast requests in ONoC. Firstly, we design an algorithm to construct two trees for two multicasts without duplicate edges in a mesh topology, and it only uses one wavelength. We propose a graph to represent the relationship between each multicast. Secondly, a group-based wavelength assignment scheme is designed to assign wavelengths for multiple multicasts. Finally, we used data analysis to extract helpful simulation results to form conclusions. The results indicate that our algorithm is superior to other tree-based schemes in communication latency and wavelength number usage.

关键词： Mesh topology Multicast Optical network-on-chip routing algorithm

来源：评论

学校读者我要写书评

暂无评论

routing Technology in Wireless Sensor Network Based on Ant Colony Optimization algorithm

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第3期95卷 1911-1925页

作者： Zheng Enxing Liu Ranran Jiangsu Univ Technol Sch Elect & Informat Engn Inst Bioinformat & Med Engn Changzhou 213001 Jiangsu Peoples R China Jiangsu Univ Technol Sch Automot & Traff Engn Changzhou 213001 Jiangsu Peoples R China

With rapid development of wireless communication, sensor, micro power system and electronic technology, the research on wireless sensor network has attracted more and more attention. The work proposed routing algorithm in wireless sensor network based on ant colony optimization by analyzing routing protocol and utilizing advanced idea. Ant colony optimization algorithm has advantages in implementing local work, supporting multiple paths and integrating link quality into pheromone formation. In routing selection, the work calculated probability that node is selected as the next hop according to pheromone concentration on the path. With characteristics including self-organization, dynamic and multipath, ant colony optimization algorithm is suitable for routing in wireless sensor network. With low routing cost, good adaptability and multipath, the algorithm balanced energy consumption to prolong network lifetime. In terms of simulation and experiments, ant colony algorithm was proved to be suitable for finding optimal routing in wireless sensor network, thus achieving design goal of routing algorithm.

关键词： Wireless sensor network routing algorithm Ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Decision Analysis on IoV routing Transmission and Energy Efficiency Optimization algorithm with AmBC

引用

Computer Modeling in Engineering & Sciences 2023年第12期137卷 2661-2673页

作者： Baofeng Ji Mingkun Zhang Weixing Wang Song Chen Henan University of Science and Technology College of Information EngineeringLuoyang471000China Longmen Laboratory Research and Innovation Center of Intelligent SystemLuoyang471000China Institute of Atmospheric Physics Chinese Academy of Sciences(LAGEO)Beijing100000China YTO Group Corporation Luoyang471000China

The improvement of the quality and efficiency of vehicle wireless network data transmission is always a key concern in the Internet of Vehicles(IoV).routing transmission solved the limitation of transmission distance to a certain *** routing algorithm cannot adapt to complex traffic environment,resulting in low transmission *** order to improve the transmission success rate and quality of vehicle network routing transmission,make the routing algorithm more suitable for complex traffic environment,and reduce transmission power consumption to improve energy efficiency,a comprehensive optimized routing transmission algorithm is *** on the routing transmission algorithm,an optimization algorithmbased on road condition,vehicle status and network performance is proposed to improve the success rate of routing transmission in the *** distance difference and density are used as decision-making indicators to measure Road Side Unit(RSU)assisted *** the Ambient backscatter communication(AmBC)technology and energy collection are used to reduce the energy consumption of routing relay *** energy collection optimization algorithm is proposed to optimize the energy efficiency of AmBC and improve the energy efficiency of *** results show that the proposed routing optimization algorithm can effectively improve the success rate of packet transmission in vehicular ad hoc networks(VANETs),and theAmBC optimization algorithmcan effectively reduce energy consumption in the transmission *** proposed optimization algorithm achieves comprehensive optimization of routing transmission performance and energy efficiency.

关键词： IoV routing algorithm AmBC relay transmission

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：