In capsule networks, the routing algorithm connects capsules in consecutive layers, enabling the upper-level capsules to learn higher-level concepts by combining the concepts of the lower-level capsules. Capsule netwo...
详细信息
In capsule networks, the routing algorithm connects capsules in consecutive layers, enabling the upper-level capsules to learn higher-level concepts by combining the concepts of the lower-level capsules. Capsule networks are known to have a few advantages over conventional neural networks, including robustness to 3D viewpoint changes and generalization capability. However, some studies have reported negative experimental results. Nevertheless, the reason for this phenomenon has not been analyzed yet. We empirically analyzed the effect of five different routing algorithms. The experimental results show that the routing algorithms do not behave as expected and often produce results that are worse than simple baseline algorithms that assign the connection strengths uniformly or randomly. We also show that, in most cases, the routing algorithms do not change the classification result but polarize the link strengths, and the polarization can be extreme when they continue to repeat without stopping. In order to realize the true potential of the capsule network, it is essential to develop an improved routing algorithm.
End-to-end network latency has become an important issue for big data processing on large-scale and heterogeneous data centers. To realize them, a low-latency inter-switch network is required. In recent years, a novel...
详细信息
ISBN:
(纸本)9781728152684
End-to-end network latency has become an important issue for big data processing on large-scale and heterogeneous data centers. To realize them, a low-latency inter-switch network is required. In recent years, a novel network based on a random regular graph such as Jellyfish has been proposed as a solution to these problems. To realize this network on Infiniband, we explore layered shortest path routing that guarantees deadlock freedom. Infiniband can avoid deadlocks by using Virtual Lane (VL), which is a QoS guarantee mechanism. However, the output VL is indirectly determined by using Service Level (SL) held by each packet. In this research, to minimize the number of consumed SLs, we propose an algorithm based on a graph coloring problem to assign SLs to all source-destination pairs. The proposed method can reduce the number of consumed SLs by up to 38 % compared to the conventional SL mapping method.
To control the flow in a dynamical network where the nodes are associated with buffer variables and the arcs with controlled flows, we consider a network-decentralised strategy such that each arc controller makes its ...
详细信息
ISBN:
(纸本)9781728113982
To control the flow in a dynamical network where the nodes are associated with buffer variables and the arcs with controlled flows, we consider a network-decentralised strategy such that each arc controller makes its decision exclusively based on local information about the levels of the buffers that it connects. We seek a flow control law that asymptotically minimises a cost specified in terms of a weighted L-1-norm. This approach has the advantage of providing a solution that is generally sparse, because it uses a limited number of controlled flows. In particular, in the presence of a resource demand applied on a single node, the asymptotic flow is concentrated along the shortest path.
Efficient routing is an essential requirement for the design of wireless sensor network (WSN) protocols to overcome inherent challenges and to meet hardware and resource constraints. An energy-efficient scalable routi...
详细信息
ISBN:
(纸本)9781728129716
Efficient routing is an essential requirement for the design of wireless sensor network (WSN) protocols to overcome inherent challenges and to meet hardware and resource constraints. An energy-efficient scalable routing algorithm based on ant colony optimization (ACO) for WSNs is presented here to find the optimal path of data transmission while consuming less energy leading to increase of network's lifetime. Most of the existing ACO based routing algorithms are designed on the assumption that the sensor nodes and the sinks are stationary and do not consider the overhead of mobility and the current node energy is not considered, which will prompt sudden passing of certain nodes. To overcome the existing problem of accommodating node mobility, reducing initialization time for ant based routing algorithm and to maintain scalability in WSN for time critical applications, an ACO based WSN routing algorithm has been proposed and analyzed in this paper. The proposed algorithm has been simulated and verified utilizing MATLAB. The evaluation results demonstrate that it has reduced energy consumption, almost 50% less consumed energy even with the increasing number of nodes, compared with the traditional ACO and an existing ant-based routing algorithm. Moreover, it increases the nodes' lifetime and lifetime of the network.
to design a tour plan which provide a maximum satisfaction, before have any experiences with the destination can be hard and time consuming process. The goal of this study is to create an algorithm that efficiently ge...
详细信息
Stress and anxiety are well known feelings for a car driver when it comes to finding a free on-street parking spot in an urban area or estimating the time for punctual arrival at a certain destination. Cars looking fo...
详细信息
ISBN:
(纸本)9781538670248
Stress and anxiety are well known feelings for a car driver when it comes to finding a free on-street parking spot in an urban area or estimating the time for punctual arrival at a certain destination. Cars looking for a free on-street parking spot could constitute up to 50 percent of urban traffic, as studies have shown. This results in time loss for the driver, increased air pollution and congested cities. The integrated routing approach presented in this paper aims at overcoming these problems. It is called universal routing algorithm and combines a park spot routing (PSR) and a stochastic routing algorithm. The PSR uses on-street parking information, while the stochastic route utilizes historic travel time data to address punctual arrival. The universal route leads the driver through streets with high parking probabilities close to the destination while maximizing the probability of arriving on time. This paper presents a method on how to combine the two algorithms in order to provide an integrated approach to the user. Additionally, the algorithm is verified on an artificial grid.
Remote coordinating is the rapidly creating zone in present world to make correspondence between the center points. It is to a great degree obvious in nature to evaluate the center point openness and data transmission...
详细信息
Remote coordinating is the rapidly creating zone in present world to make correspondence between the center points. It is to a great degree obvious in nature to evaluate the center point openness and data transmission of center points. It is basic to realize the cunning guiding in the present territory to trade the data from source to objective which keeps up the imperativeness and information exchange limit between the center points. In this paper, the proposed gathering extremist coordinating estimation executes the dynamic course and keeps up the steady essentialness and at the every center point and moreover the information transmission at the center points. The results exhibit the execution of the proposed system.
Detailed routing problem has become more challenging in the advanced technology nodes due to the extreme scaling of chip size and the complicated design rules. In this paper, we present an effective algorithm for init...
详细信息
ISBN:
(纸本)9781538674444
Detailed routing problem has become more challenging in the advanced technology nodes due to the extreme scaling of chip size and the complicated design rules. In this paper, we present an effective algorithm for initial detailed routing considering connectivity constraints and design rules. Firstly we present an valid pin-access candidates generation technology for handling complex pin shapes. Then, we propose a tree-based net's components rearrangement algorithm to decide connect order for multiple nets' components. Finally, honoring routing preference metrics and advanced technology nodes, a multi-threaded algorithm is presented to achieve initial detailed routing results. Experimental results on industrial benchmarks show that, our proposed algorithm not only achieves high-quality routing result in a reasonable runtime, but also eliminates all the routing constraints efficiently.
In 2.5D stacking technology, multiple chips have stacked side-by-side on a silicon interposer layer. The network-on-chip in the central processing unit (CPU) layer makes it possible to connect processing cores to each...
详细信息
In 2.5D stacking technology, multiple chips have stacked side-by-side on a silicon interposer layer. The network-on-chip in the central processing unit (CPU) layer makes it possible to connect processing cores to each other. The interposer layer prepares the connection between the CPU cores and other chips such as memory chip. The memory chip usually contains several segments stacked vertically. The network-on-chip can be extended to the interposer layer to make use of unused routing resources of the interposer. Applying an efficient topology and deadlock-free routing algorithm on the CPU layer and interposer layer is essential. In this paper, a new topology and routing algorithm are proposed to use on the CPU layer as well as on the interposer layer for creating a uniform interconnection network to decrease delay and power consumption. This topology is scalable and can be used simply for extensive networks. Most of interposer layer topologies are not scalable and have a lot of crossed links. Moreover, it is required to increase the degree of routers connected to memory segments. The proposed topology uses a few crossed links compared to other proposed interposer layer topologies. There will be some similar small sub-networks that fairly connected together with intermediate routers. Furthermore, this topology can be extended in a hierarchical manner.
Capacitated vehicle routing problem (CVRP) is being one of the most common optimization problems in our days, considering the wide usage of routing algorithms in multiple fields such as transportation domain, food del...
详细信息
暂无评论