37 results about "Connectivity graph" patented technology

A method for identifying a botnet in a network, including analyzing historical network data using a pre-determined heuristic to determine values of a connectivity graph based feature in the historical network data, obtaining a ground truth data set having labels assigned to data units in the historical network data identifying known malicious nodes in the network, analyzing the historical network data and the ground truth data set using a machine learning algorithm to generate a model representing the labels as a function of the values of the connectivity graph based feature, analyzing real-time network data using the pre-determined heuristic to determine a value of the connectivity graph based feature for a data unit in the real-time network data, assigning a label to the data unit by applying the model to the value of the connectivity graph based feature, and categorizing the data unit as associated with the botnet based on the label.

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.

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.

A method for determining the state of an entire network, including state of applications and infrastructure includes receiving network control messages in an OpenFlow network; passing normal network control messages through FlowSense, a control plane middleware, and constructing from the network control messages an application level connectivity graph to infer network delay between any two communicating server in the network and estimating an application response time of a given server in the network, the FlowSense including a network utilization procedure for computing the utilization of each link in the network derived from using captured messages triggered by switches when flow entries expire and providing state of the network for enabling intelligent detection and diagnosis of infrastructure and application performance.

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.

An approach is provided for crowd sourcing and grouping points-of-interest based on cell broadcast message information. Reception of a message from a mobile terminal is caused, at least in part. The message specifies point-of-interest information and an associated area name corresponding to one of a plurality of cells of a communication network. The message is parsed to determine the point-of-interest information and the associated area name. A connectivity graph specifying relationships among the cells is selectively updated with the point-of-interest information.

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. A computer system product and a computer program product corresponding to the method are also disclosed herein.

A method for determining the state of an entire network, including state of applications and infrastructure includes receiving network control messages in an OpenFlow network, passing normal network control messages through OFSense, a control plane middleware, and constructing from the network control messages an application level connectivity graph to infer network delay between any two communicating server in the network and estimating an application response time of a given server in the network; and providing state of the network for enabling intelligent detection and diagnosis of infrastructure and application performance.

The invention discloses a power grid partitioning method based on spectral clustering. A power system is simplified and abstracted into a right undirected connectivity graph, and a network topology Laplacian matrix is determined. Based on the Laplacian matrix of a power system, a clustering problem is transformed into a graph segmentation problem, and power grid partitioning is carried out. According to the invention, a spectral clustering algorithm is used to partition the power system; the method has stronger adaptability, can be applied to a power system with a complex network structure, and can be adjusted according to the actual line operation situation; and the partitioning scheme is more reasonable and reliable.

Disclosed are a touch panel and the display panel provided by the embodiment of the invention, a first connecting structure for connecting two adjacent first electrode units and a second connecting structure for connecting the two adjacent second electrode units are improved, and the second connecting structure is designed to comprise the plurality of connecting grids and the graphic units adjacent to the connecting grids; the first connecting structure to be intersected is designed between the orthographic projection on the second connecting structure and the graph so as to form a graph gridwhich is the same as the connecting grid. Thus, the intersection area of the first connecting structure and the second connecting structure can be reduced by performing graphical design on the secondconnecting structure and designing the wiring mode of the first connecting structure, so that parasitic capacitance generated between the first connecting structure and the second connecting structureis reduced; thus, the influence of the bridging points of the touch electrodes on the touch linearity of the touch panel is improved or eliminated, and the touch panel has good use stability in use.

The invention discloses an optical access network ODN intelligent clustering planning method for sparse user distribution, and belongs to the technical field of communication. The method specifically comprises the following steps of: firstly, for a certain planning area, randomly generating position coordinates of k initial centroids as second-level light splitting points on a wiring segment of an ODN by taking the geographic position of a user in the area as input; then, constructing a cost function T, and optimizing the number k of the initial centroids and position coordinates; thirdly, determining the position coordinates of first-level light splitting points and optimizing the position coordinates; according to the optimized positions of the second-level light splitting points and the first-level light splitting points, calculating the reserved length of an optical fiber, and completing the planning of the wiring segment; for feeder line segment planning of the ODN , determining a weight connectivity graph through a connectivity relationship between field areas, and searching for a minimum spanning tree by adopting a minimum spanning tree algorithm; finally, completing optical access network ODN planning of sparse users according to planning results of the wiring segment and the feeder line segment. According to the method, the top and the bottom are combined, and the optical fiber planning cost is reduced while optimal planning is realized.