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.

One embodiment of the present invention provides a method for supporting the development of a parallel / distributed application, wherein the development process comprises a design phase, an implementation phase and a test phase. A script language can be provided in the design phase for representing elements of a connectivity graph and the connectivity between them. In the implementation phase, modules can be provided for implementing functionality of the application, executors can be provided for defining a type of execution for the modules, and process-instances can be provided for distributing the application over several computing devices. In the test phase, abstraction levels can be provided for monitoring and testing the application.

The invention provides a user behavior analysis method and apparatus. The user behavior analysis method comprises the following steps: establishing an information connectivity graph according to the behavior data of a plurality of users; extracting a plurality of bipartite graphs based on a plurality of preset relationship models according to the information connectivity graph; obtaining a score density curve of the plurality of bipartite graphs based on a preset scoring model; and identifying suspicious user behaviors based on the score density curve. By adoption of the user behavior analysismethod provided by the invention, the abnormal user behaviors can be effectively identified, which is helpful for discovering a new network fraud mode and preventing the network fraud.

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 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 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 tensor processing technique includes: accessing a first tensor representing interconnections of a plurality of nodes, the first tensor being a tensor of three or more dimensions; accessing a second tensor; convolving the first tensor with the second tensor to generate a convolution result tensor; and outputting at least a portion of the convolution result tensor.

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.

One embodiment of the present invention provides a method for supporting the development of a parallel / distributed application, wherein the development process comprises a design phase, an implementation phase and a test phase. A script language can be provided in the design phase for representing elements of a connectivity graph and the connectivity between them. In the implementation phase, modules can be provided for implementing functionality of the application, executors can be provided for defining a type of execution for the modules, and process-instances can be provided for distributing the application over several computing devices. In the test phase, abstraction levels can be provided for monitoring and testing the application.

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. 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.

A superconducting quantum processor unit for quantum computing is provided. The processor unit is formed from the union of a qubit chip and a wiring chip with superconducting bonding bumps and spacers. The bumps may be densely distributed around active elements between the two chips and effectively form a Faraday-Cage around the qubits, control signal waveguides etc. The qubit chip has strategically spaced qubits and an inductively coupled probe line and the wiring chip has a bus coupling resonator with a number of voltage nodes and anti-nodes, a resonator pump and at least one SQUID. Magnetic flux applied through the SQUIDs changes their impedances and modifies the microwave boundary conditions of the bus. This allows in-situ shifting of electric field distributions of the resonance modes of the bus along the length of the bus. This tunes the coupling rates of the bus to all qubits simultaneously.

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.

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 domain name detection method, a device, equipment and a readable storage medium. According to the method, domain name sequences are utilized to construct a directed graph, domain name sequence behaviors, the relation between the sequences and the relation between hosts are mined, and malicious domain name activity detection is carried out. Specifically, firstly, a directed domain name connection graph is constructed based on domain name access sequences of multiple hosts; at least one connectivity branch is then derived based on the directed domain name connectivity graph. The malicious domain name detection is carried out on each connected branch. Therefore, the problem that the domain name sequence cannot be connected due to a random domain name confrontation technology can be solved, missing report and false report are reduced, and the detection accuracy can be improved.

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.

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 discloses a wireless charging sensor network routing method and equipment based on the principle of dynamic programming. The algorithm first constructs a routing model suitable for the principle of dynamic programming, divides the wireless charging sensor network into stages, and assigns the state variables of the obtained stages to stages. attributes and receiving attributes; record the node information of each node in the communication, so as to obtain a routing model suitable for the principle of dynamic programming; filter out reachable routes from the routing model; convert the wireless charging sensor network into a weighted connected graph, according to the The weighted connectivity graph establishes the minimum weight function from the source node to the node base station; transforms the weighted connectivity graph into a weight matrix, and uses the dynamic programming principle to obtain the minimum weight reachable route and solve the minimum weight function according to the weight matrix. The invention realizes the establishment of a reasonable and efficient charging strategy for the wireless charging sensor network, improves energy utilization and efficiency, and reduces time and labor costs.

The invention relates to a logistics distribution path planning method and device. The method and device of the present invention construct a path connectivity graph by taking the distribution point and the demand point as nodes, and taking the shortest path directly reachable between the distribution point and the demand point and between the demand points as the edge; according to each demand The delivery volume of point nodes and the distance of each edge divide the task subgraph whose total delivery volume of the included nodes is not greater than the preset transportation volume tolerance; construct a minimum support tree containing all nodes contained in the task subgraph; from all Among the loops formed by the minimum support tree and the distribution point node, the loop containing the longest path of the minimum support tree is selected as the trunk of the distribution path, and the hanging nodes outside the trunk of the distribution path adopt a round-trip path. It can make the distribution path more reasonable, and use self-organizing method to reasonably merge and divide the demand points into task subgraphs. It is suitable for large-scale distribution path planning, and can effectively shorten the distribution time and improve the distribution full load rate.