In order to make the network model was more fitting the actual condition of city traffic, this paper presents a dynamic transportation network model based on the traffic time division, and designs improved Dijkstra algorithm to solve the city traffic paths planning problem. Dijkstra algorithm is a typical singlesource shortest path algorithm is used to calculate a node to all other nodes in the...

It is shown that an algebra Λ can be lifted with nilpotent Jacobson radical r = r(Λ) and has a generalized matrix unit {eii}I with each ēii in the center of Λ̄ = Λ/r iff Λ is isomorphic to a generalized path algebra with weak relations. Representations of the generalized path algebras are given. As a corollary, Λ is a finite algebra with non-zero unity element over perfect field k (e.g. a field ...

In this paper, we propose a new fast search algorithm for block motion estimation (BME). This algorithm employs two techniques: the center-biased technique and the two-path technique. The former is applied to stop the search procedure if the block currently being processed is stationary. Otherwise, the proposed algorithm conducts the two-path search to perform BME. The search result of the trad...

Given a network infrastructure (e.g., a grid, datacenter or on-chip-network) and a distribution on the sourcedestination requests, the expected path (route) length is an important measure for the performance, efficiency and power consumption of the network. In this work we initiate a study on self-adjusting networks: networks that use local-distributed mechanisms to adjust the position of the n...

Background: Although alterations in resting-state functional connectivity between brain regions have previously been reported in Parkinson’s disease (PD), the spatial organization of these changes remains largely unknown. Here, we longitudinally studied brain network topology in PD in relation to clinical measures of disease progression, using magnetoencephalography and concepts from graph theo...

Motivated by the massive deployment of power-hungry data centers for IT service provisioning, we examine the problem of routing in optical networks with the aim of minimizing traffic-driven power consumption. To tackle this issue, routing must take into account energy efficiency as well as capacity considerations; moreover, in rapidly-varying network environments, this must be accomplished in a...

The overall performance of data center depends on the physical topology and the corresponding routing mechanism. Many novel network structures have been proposed in recent years to remedy the shortcomings of traditional tree-based structure. Especially some hybrid recursively defined structures with acceptable costs can perform well. These structures mainly adopt the conventional routing mechan...

Given a graph G = (V,E) and a path P , let d(v, P ) be the distance from vertex v ∈ V to path P . A path-center is a path which minimizes the eccentricity e(P ) = maxv∈V d(v, P ) such that for every path P ′ in G, e(P ) ≤ e(P ′), and for every subpath P ′′ ⊂ P , e(P ) < e(P ′′). Similarly, a core is a path which minimizes the distance d(P ) = ∑v∈V d(v, P ) such that for every path P ′ in G, d(P...

to study yield and its relationships with yield components in 10 varieties of foxtail millet (kfm1 to kfm10), an experiment was carried out in safiabad agricultural research center in rcbd design with three replications for a period of three years (2003 to 2005). vegetative and reproductive characteristics of each cultivar were recordered during the growing seasons. three year results showed si...