37 results about "Connectivity graph" patented technology

Multi-hop wireless networks have benefits in coverage extension and throughput improvement. In this multi-hop wireless networks, multiple channels are available to improve system performance through concurrent transmission. In this invention, a multi-channel assignment method is described. For efficient utilization of multiple channels considering different channel condition at each node, the multi-channel assignment method is comprising the steps of: a) gathering neighbor relay node information by relaying control messages which include node information, such as the list of neighbor nodes, the preferable channel list of nodes, and the number of available radio interfaces; b) connectivity graph construction, by generating the multi-graph connectivity graph from the gathered node information; c) conflict graph composition, by generating the multi-channel conflict graph which exhibits interference among links from the multi-graph connectivity graph; and d) multi-channel assignment, by allocating channels to links considering channel interference by referring the multi-channel conflict graph using the list coloring algorithm.

A system for exchanging routing information over a communications network constructs a connectivity graph that indicates connectivity between a first node and a first set of nodes in the network. The system constructs an adjacency graph that indicates a second set of nodes with which the first node will exchange routing data, where the adjacency graph is distinct from the connectivity graph. The system exchanges routing data between the first node and each node of the second set of nodes based on the adjacency graph.

Exemplary methods for assigning relative rank values to a plurality of linked documents are provided. In one embodiment, the method comprises constructing or modeling a nodal network according to a connectivity graph of a linked database and determining conductance of inter-nodal links based on a link structure of the nodal network and rank values of end-nodes. The method may further comprise computing rank values of nodes in the nodal network through an iterative process, and obtaining quality scores for documents from the rank values of the nodes. The method may also include obtaining the quality scores for groups of documents.

As disclosed herein, a method, executed by a computer, for analyzing a performance metric includes distributing link connection information for a network to each node in the network, pairing each node with another node in the network to provide paired nodes, testing a performance metric for the paired nodes, and generating a performance report for the network. The method may further include receiving link connection information for the network. The method may further include constructing a connectivity graph based on the received link connection information. The method can be used to test link performance within non-homogeneous networks.

The embodiment of the invention provides a method and a device for discovering suspected newly-added roads, and relates to the field of dynamic traffic information service. Newly-added roads can be timely and accurately discovered, the up-to-date state of a map is improved, and the updating cost of the map is lowered. The method comprises the following steps of: acquiring the floating vehicle data records of an area to be analyzed within a preset time interval; dividing the area to be analyzed into a plurality of grids with the same size; acquiring the grid density of each grid; screening abnormal grids according to the grid densities; acquiring highly related grids by analyzing trend relevance between the abnormal grids, and acquiring a grid connectivity graph according to a spatial position relationship between the highly related grids; and acquiring a grid tree according to the grid connectivity graph to obtain the shape of the suspended newly-added roads according to the grid tree. The embodiment of the invention is used for discovering the suspected newly-added roads.

A process is provided that reduces the amount of data for a map tile that could not be displayed separately on the scale of that tile. The process generates an equivalent of the road data by rasterizing the vectors representing road segments lying within a tile and generating a connectivity mask that keeps track of which pixels are connected to which other pixels along the vectors. The process constructs an undirected graph. Each “on” pixel of the undirected graph represents a vertex and the vertices are connected by edges generated from the connectivity graph, but without a set direction. The process traces the undirected graph to generate chains of connected road segments and takes the chains and simplifies them in order to reduce the amount of data that must be stored and transmitted for the tile in order to produce all the visible roads of the tile at that scale.

The invention discloses a network flow transmission optimization method, device, system and readable storage medium. The method includes: according to the current flow between adjacently connected network nodes of the network system, simplifying the network flow by the network system Corresponding weighted values ​​are assigned to the corresponding edges in the coming connected graph to obtain a weighted connected graph; determine the minimum spanning tree and the shortest path of traffic transmission between two network nodes to be optimized in the weighted connected graph ; Carry out distribution ratio calculation processing to calculate the distribution ratio of the total flow between the two network nodes in the two paths and meet the preset conditions; distribute the distribution ratio to the two paths correspondingly Each network node on the network, so that each network node performs traffic transmission work according to the distribution ratio. The invention can well optimize the flow transmission of the network system.

A method for path routing according to an embodiment of the present disclosure may include selecting a first start point and a first end point with which path routing is performed in a circular frame generated by connecting all points included in one or more start point sets included in a layer, one or more end point sets paired with the start point set, and one or more edge point pair sets to one closed curve, generating a connectivity graph by connecting edge points included in one or more nodes corresponding to segments obtained by dividing the circular frame into one or more regions, and connecting the first start point and the first end point based on a cost for connecting the first start point and the first end point calculated using the connectivity graph.

The invention provides an indoor multi-level semantic topology index construction method for complex navigation applications. The method includes acquiring a real three-dimensional model of the target complex, synchronously matching the corresponding relationship between the semantic and geometric components in the spatial building object, and obtaining an indoor unit model with complete topological consistency; extracting the passable area, and abstracting the passable area as Leaf nodes; build a multi-dimensional correlation function oriented to scene similarity, group the leaf nodes to generate aggregate units; split and superimpose the inside of the aggregate units to obtain the indoor unit model and indoor unit model The connectivity relationship and the connection relationship between aggregated units are constructed from the inside to the outside of the connectivity graph index. In this way, it can make up for the disordered connection relationship expressed by a single topology structure, simplify the logical relationship of the index, and improve the time efficiency and accuracy of the target search in the path planning task.

The invention discloses a method for identifying the final circuit breaker of a multi-valve group in a direct current system based on an improved Tarjan algorithm. First, the topological connection relationship between the incoming and outgoing lines of the alternating current field in the direct current system, the valve group and the circuit breaker is abstracted into an undirected connection diagram , according to the state of each circuit breaker in the AC field, the adjacency matrix of the undirected connectivity graph is corrected, and the final circuit breaker identification problem is transformed into solving the cut point problem between the valve bank and the AC line; the Tarjan algorithm can only obtain the entire undirected connectivity For the cut point of the graph, the present invention improves the Tarjan algorithm. First, the set of cut points on the path connecting any two vertices in the undirected connected graph is obtained, and the set of vertices passing through the path to the vertex of each valve group is recorded, and the set of vertices is determined. Whether the intersection with the cut point set of the undirected connected graph contains the breaker cut points, the final breaker set of each valve group is obtained; the final breaker identification method is correct, effective, efficient and stable, and can be solved at one time The last circuit breaker for each valve group.

The invention relates to method and device for planning a logistics distribution route. The method and device are that a distribution point and a demand point are treated as nodes, and the directly-arrived shortest routes between the distribution point and the demand point and between the demand points are treated as the edges, so as to construct a route connection map; task sub-maps in which the total distribution quantity of the nodes included is not greater than the preset transportation quantity tolerance are divided according to the distribution quantity of each demand point node and the distance of each edge; the minimum support tree for all the nodes included in the task sub-maps is constructed; a loop including the longest supporting tree and the longest path is selected from the loops formed by the minimum supporting trees and the distribution point nodes as a main distribution route; return routes are provided for hanging nodes outside the main distribution route. With the adoption of the method an device, the distribution route is reasonable; the demand points are reasonably adjacently combined by a self-organization manner, and the task sub-maps are divided; therefore, the method and device are applied to large-scale distribution route planning, and can effectively reduce the distribution time and increase the distribution load factors.

The invention discloses a sequence detection method based on a generalized likelihood ratio detection principle in wireless optical communication. In view of a multi-order modulation system, sequence detection is carried out on signals through a full-connection grid graph search method and a selective storage method on the basis of generalized likelihood ratio path measurement of an observation window and a decision condition, and channel estimation and ambient light estimation can also be carried out based on sequence detection values. The grid graph designed by the invention is a full-connection graph, and the memory span of the channel does not required to be mastered. The complexity of the grid graph search algorithm is close to the square of a modulation order and does not increase with the sequence length, the observation window length or the memory span of the channel. The complexity and the storage capacity of the system are further reduced by the selective storage method, and the problems of decision failure and error leveling layers are avoided.