Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routin...

In order to satisfy the high bandwidth and performance demands of applications, host servers are built with multiple network interfaces, and a data center network consists of multiple redundant links. It is important to make efficient use of all the available network capacity, using multiple physical paths whenever possible, but traditional forwarding mechanisms using a single path are not able...

1. The discharge of neurons in the deeper layers of the monkey superior colliculus was recorded during saccades made to stationary and to smoothly moving visual targets. 2. All neurons that discharged for saccades made to stationary targets also discharged during saccades made to moving targets, but there was a systematic shift in the saccade vector yielding maximal activity (i.e. center of the...

This paper presents studies on the characteristics of gas molecular mean freepath in nanopores by molecular dynamics simulation. Our study results indicate that themean free path of all molecules in nanopores depend on both the radius of the nanoporeand the gas-solid interaction strength. Besides mean free path of all molecules in thenanopore, this paper highlights the gas molecular mean free p...

The fleet operation model in which electric vehicles coexist with traditional is becoming increasingly popular. Because have certain disadvantages and usage limitations, the multi-center management of distribution mixed fleets very complex. There no research on vehicle routing problem based integration reverse logistics dynamic energy consumption. In response to this challenge, study proposes a...

The path-table P(T ) of a tree T collects information regarding the paths in T: for each vertex v, the row of P(T ) relative to v lists the number of paths containing v of the various lengths. We call this row the path-row of v in T. Two trees having the same path-table (up to reordering the rows) are called path-congruent (or path-isomorphic). Motivated byKelly–Ulam’sReconstructionConjecture a...

In [8, 9] M. G. Corrales Garcia, D. M. Barquero, C. Martin Gonzalez, M. Siles Molina, J. F Solanilla Hernandez described the center of a Leavitt path algebra and characterized it in terms of the underlying graph. We offer a different characterization of the center. In particular, we prove that the Boolean algebra of central idempotents of a Leavitt path algebra of a finite graph is isomorphic t...

Service routes optimization (SRO) of pallet service center should meet customers' demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP) and Chinese postman problem (CPP), but it has its own characteristics...