85 results about "Connectivity graph" patented technology

The invention discloses an energy storage capacity optimal configuration method for multi-dimensional constraint modeling, particularly relates to the technical field of energy storage capacity planning, and is used for solving the problems of feasible solution space fragmentation and low global optimization efficiency caused by heterogeneous constraint conflicts in the prior art. The method comprises the following steps: acquiring multi-dimensional constraint data such as continuous technical parameters, operating conditions and discrete policies and rules of the energy storage system; quantizing conflict strength between constraints and distributing dynamic weights; converting the discrete rule into a continuous penalty function to construct a fusion constraint model; analyzing the solution space topological structure and monitoring the dynamic change of the solution space topological structure to generate a connectivity graph and an evolution trend graph; generating a self-adaptive search strategy based on the atlas; outputting a global optimal solution set and generating a verifiable energy storage capacity configuration scheme; and through dynamic weight distribution and solution space connectivity guidance, the multi-constraint collaborative optimization capability is significantly improved.

The invention discloses an edge computing node task unloading method based on fruit fly optimization and ant colony collaboration. The method comprises the following steps: S1, obtaining a real-time state data set of all edge computing nodes in an edge computing environment through a preset monitoring module; s2, performing feature data extraction on the to-be-unloaded task based on the state data set; s3, performing global search on the state data set and the task feature data by using a fruit fly optimization algorithm to generate a preliminary task unloading candidate node set; s4, for the initial task unloading candidate node set, constructing a connected graph between edge computing nodes by adopting an ant colony collaborative algorithm, and locally optimizing an unloading path between candidate nodes; and S5, distributing and migrating the task to be unloaded according to the determined unloading path and the target node. According to the method, the communication delay and bandwidth between the nodes are considered, and dynamic weighting is carried out on the resource remaining and load state of the target node, so that the accuracy and flexibility of unloading path construction are remarkably improved.

The invention discloses an unmanned aerial vehicle automatic homeward voyage method based on a global topological map and a graph search algorithm, which comprises a global passable area topological connected graph module, a homeward voyage path search module, a homeward voyage path optimization module and a homeward voyage path error processing module. According to the method, global path searching is carried out in combination with a Dijkstra algorithm, path smoothness, flight time and obstacle avoidance are optimized by using a B spline curve, the precision and speed of path planning are effectively improved, and meanwhile, the system can cope with changes in the environment by updating a topological connected graph and optimizing the path in real time, so that the path planning efficiency is improved. And secondly, the path safety and the flight stability are both considered, and an obstacle distance penalty term is introduced, so that the flight path can avoid the obstacle, and the collision risk is reduced.

The invention discloses a path planning method and system for power grid engineering construction machinery transportation, and a medium. The method comprises the following steps: constructing a construction environment model and a grid adjacency list according to path planning data; processing the construction environment model and the grid adjacency list based on a path connectivity algorithm to obtain a weighted grid connectivity graph; analyzing the weighted grid connected graph based on a path analysis algorithm to obtain a transportation route combination graph; on the basis of a path selection algorithm, selecting a route communicating all construction nodes of the construction area in the transportation route combination diagram as a temporary transportation route; and detecting all the temporary transportation routes based on a route detection algorithm to obtain a target transportation route. Therefore, the shortest and most economical transportation planning path is found through the adaptive path algorithm and the deep reinforcement learning technology.

The invention discloses a clustering-based inland river distributed task unloading method, which comprises the following steps of: randomly dividing and acquiring a plurality of clustering clusters according to a cluster head node and member nodes on the basis of a task unloading clustering strategy; on the basis of a task unloading allocation strategy, dividing a task to be unloaded into sub-task chains according to the link connectivity graph, and allocating member nodes in a cluster to obtain a task distribution sequence; constructing a distributed task unloading network to obtain a plurality of task transmission delays according to the task distribution sequence; constructing a global delay cost target model for distributed task unloading according to the transmission delay of each task; according to a preset to-be-unloaded inland river distributed task, obtaining an optimal clustering cluster corresponding to the minimum global delay cost target model; and realizing inland river distributed task unloading according to the optimal clustering cluster. The problem that when the multiple unmanned ships need to unload the tasks to the edge cloud, due to the influence of resource competition, the task unloading effect is difficult to meet the user requirements, and the user experience is directly influenced is solved.

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.

The invention discloses a quantum circuit conversion method and system, electronic equipment and a storage medium, and relates to the technical field of quantum circuit conversion, and the method comprises the steps: extracting a feature vector of a logic quantum circuit based on initial quantum bit mapping; the feature vector is input into a pre-trained decision tree, recommendation parameters of a line conversion algorithm are obtained, the decision tree is constructed by a training set, and the feature vector of each sample corresponds to the optimal parameter of the decision tree, namely the parameter with the minimum number of physical line gates; and configuring a line conversion algorithm by using recommended parameters, converting a logic line into a physical line, and ensuring that all two quantum bit gates meet quantum computer connected graph constraints and are equivalent in function. According to the method, adaptive parameter configuration can be achieved through the feature vectors and the decision tree, the line conversion quality is effectively improved, the number of physical line gates is remarkably reduced, and the quantum program execution efficiency is improved on the premise that function equivalence and connectivity are guaranteed.

The invention discloses a topological communication coverage path planning method and system of an unmanned ship cluster for wide-area target search and detection, and belongs to the technical field of multi-agent collaborative path planning. According to the method, turning frequency optimization is converted into a minimum rectangular coverage problem, an integer programming model is established, a layered relaxation integer programming acceleration strategy based on maximum extension candidates is proposed, and the bottleneck of model expansion and calculation efficiency caused by candidate solution space explosion in a large-scale scene is broken through; then, constructing a rectangular topological connected graph, designing an improved spectral clustering algorithm fusing load balancing constraint and subgraph connectivity guarantee, realizing efficient and balanced distribution of regions in a complex environment, and ensuring internal connectivity of subregions; and finally, providing a dynamic pruning optimization method for the minimum corner spanning tree based on strong and weak connection characteristics, iteratively evaluating the corner cost and removing redundant edges, and finally generating a coverage path spanning tree with the minimum corner cost, thereby providing an accurate and efficient full-coverage operation path for scenes such as regional exploration and environment monitoring.

The invention provides an oil reservoir inter-well communication path dynamic evolution intelligent prediction method and system based on permeability change, and relates to the technical field of intelligent oil and gas field development. The method comprises the following steps: preprocessing static seismic multi-attribute, initial permeability and production dynamic data, and extracting multi-scale features; establishing a dynamic permeability and static prior fusion mechanism, and generating a dynamic weight connectivity graph; on the basis, reinforcement learning path search is adopted, dynamic re-planning is achieved through time sequence rolling, and inter-well communication paths and migration rules are obtained; a non-dominated solution set and a Pareto frontier are formed in combination with multi-objective optimization of path length and cumulative flow capacity, and candidate schemes are provided for different engineering preferences; and finally outputting a spatio-temporal evolution prediction result of the path and a matched adjustment suggestion. The method realizes the fusion of static and dynamic data, breaks through the limitation of depicting the reservoir only by depending on static earthquakes, and remarkably improves the development effect and decision scientificity of the marine facies sandstone reservoir.

The invention relates to a bus voltage regulation method and system based on a power distribution network topology model and a medium, and the method comprises the following steps: carrying out the topology recognition of a power distribution network, determining the specific connection modes of each bus, line, transformer and load, and constructing a connected graph of the network; estimating the operation state of the whole power grid through a state estimation algorithm by using real-time measurement data and the topological model, including the voltage amplitude and the phase angle of an unknown node; monitoring the voltage level of each bus according to a state estimation result, and evaluating whether the voltage level meets a voltage quality standard or not; based on a voltage monitoring result, applying an optimization algorithm; determining the most effective voltage regulation measure; and issuing the formulated voltage regulation strategy to corresponding control equipment for execution, performing state estimation again, and verifying the voltage regulation effect. Stable operation and power supply quality of the power distribution network are powerfully guaranteed, and a foundation is laid for further intelligent and automatic management of the power distribution network.

According to one aspect, the subject matter of the present description is a method for allocating logical qubits of a quantum algorithm to physical qubits of a quantum processor arranged according to a given architecture, the method including: establishing, from the architecture, a connectivity graph; the establishing, from the quantum algorithm, a graph of the logical operations; assigning a weight to each logical qubit; ranking the logical qubits according to the weight; allocating a first logical qubit chosen according to the weight, to a first physical qubit of the quantum register; iteratively allocating the logical qubits remaining to be allocated, including calculating a score; and reproducing the iterative allocation procedure until allocating the last logical qubit remaining to be allocated, thus resulting in obtaining a configuration for allocating logical qubits of the quantum algorithm to physical qubits of the quantum processor.

The present disclosure proposes a method and apparatus for robot control and positioning pen full-connectivity graph generation, comprising: obtaining a target robot to be controlled and obtaining a full-connectivity graph between n positioning pens; in response to receiving a control request from a candidate positioning pen for the target robot, obtaining a first transformation matrix between the candidate positioning pen and the target positioning pen based on the full-connectivity graph, and obtaining a second transformation matrix between the target positioning pen and the target robot; determining a third transformation matrix between the candidate positioning pen and the target robot based on the first transformation matrix and the second transformation matrix; and controlling the target robot via the candidate positioning pen based on the third transformation matrix. Thus, by establishing a full-connectivity graph between the positioning pens, cross-control between unpaired robots and positioning pens can be achieved, improving the flexibility of multi-robot and multi-positioning pen control and reducing calibration workload. This method has broad application prospects in industrial automation, collaborative robotics, intelligent logistics, and other fields.

A vector retrieval method is proposed to improve the efficiency of vector retrieval. In this method, when performing vector retrieval based on a vector connectivity graph, the distance between the second-order quantized data of a vector and the query vector is calculated to determine whether the vector needs to be added to the candidate set. After the candidate set is updated, the distance between the vectors in the candidate set and the query vector is updated to the distance between the vector's first-order quantized data and the query vector. Since both the first-order and second-order quantized data are obtained by quantizing the original vector data, using the second-order quantized data to calculate the distance between vectors during vector traversal of the vector connectivity graph effectively improves computational efficiency. Furthermore, using the first-order quantized data to update the distance between vectors after the candidate set is updated ensures that the vector with the largest distance to the query vector in the candidate set is replaced each time the candidate set is updated, thereby guaranteeing the accuracy of vector retrieval.

The present invention relates to a method for processing communication-sensing data and a routing system of a quantum approximate optimization algorithm under incomplete information, comprising the following steps: S1, obtaining a communication-sensing signal at the current moment, extracting the current time-frequency resource block of the communication-sensing signal at the current moment, and calculating the current time-frequency correlation of the information boundary of the communication-sensing signal at the current moment through any two current time-frequency resource blocks; S2, constructing a connectivity graph through the current time-frequency correlation and the current time-frequency resource block, solving the connectivity graph to obtain a current adaptive graph mapping, and solving the solution of the cutting problem of any two of the current time-frequency resource blocks with respect to the adaptive graph mapping; S3, incrementing the current adaptive graph mapping through the subsequent time-frequency resource block to obtain a subsequent adaptive graph mapping, and obtaining the solution of the cutting problem of the subsequent time-frequency resource block through parameter iteration to complete the decoupling of any two current time-frequency resource blocks.

Examples of layouts and layout generation techniques for fault-tolerant quantum computers are disclosed herein. Example embodiments include methods for performing layout simplification techniques for fault-tolerant quantum computing. In certain embodiments, the layout of any quantum circuit is simplified to a layout of an exponent of multi-qubit Pauli matrices and measurements of multi-qubit Pauli matrices. In certain embodiments, qubits are labeled as one of data qubits, interface qubits, or ancilla qubits for a 2D nearest-neighbor qubit connectivity graph, and ancillary paths are provided from corresponding data qubits to corresponding interface qubits.

This invention discloses an ecological management zoning method and system based on static and dynamic supply and demand matching, belonging to the field of ecological management technology. The invention constructs a node feature matrix by calculating a comprehensive static supply and demand matching index and a comprehensive dynamic change trend index, then generates a dynamic spatiotemporal adjacency matrix to construct a spatiotemporal physical connectivity graph. This graph is then input into a spatiotemporal graph neural network for processing, outputting predicted static supply and demand matching indices and predicted dynamic change trend indices. Based on the zero-value boundaries of these indices, the study area is divided into initial four-level basic management zones. A Markov decision process is then constructed, and a Pareto optimal solution set is obtained through reinforcement learning algorithms to fine-tune the spatial boundaries of the initial four-level basic management zones. The resulting refined ecological management zoning map and management priority sequence are output, making the zoning results more targeted for management. This solves the problem that existing ecological management zoning results lag behind actual changes and are difficult to effectively support adaptive management.

The present application discloses a method, device, equipment and medium for single-tree segmentation of airborne lidar point clouds, which relates to the field of single-tree segmentation. The method includes: performing point cloud voxelization on the target point cloud to obtain cuboid voxels; extracting the modulus points in each cuboid voxel; generating a connectivity graph according to the modulus points in each cuboid voxel and the corresponding group of neighboring modulus points; extracting the initial tree base points from the connectivity graph; determining the material transportation paths of the modulus points in each cuboid voxel according to the connectivity graph and the initial tree base points; for any initial tree base point, determining the number of paths of the material transportation path passing through the initial tree base point; screening the initial tree base points according to the number of paths to obtain the final tree base points, and determining the single-tree segmentation result of the target forest according to the final tree base points and the material transportation paths passing through the final tree base points. The present application can improve the accuracy and applicability of single-tree segmentation.

The invention provides a line optimization method and device for a quantum key distribution network, equipment and a medium. The method comprises the following steps: obtaining a quantum network connection graph of the quantum key distribution network; determining a bottleneck line set according to the quantum network connected graph; determining a total importance index corresponding to the bottleneck line set, wherein the total importance index is the sum of importance indexes of all bottleneck lines included in the bottleneck line set; and carrying out capacity expansion on the bottleneck lines in the bottleneck line set according to the total importance index, thereby solving the problem of difficulty in capacity expansion of the bottleneck lines of the current quantum key distribution network.

This invention relates to the field of 3D model processing technology, specifically to an intelligent hierarchical simplification method and device for 3D models. The method involves acquiring 3D device model data and converting it into a mesh model; performing region growth and segmentation based on patch normals and curvature to obtain the original component regions; employing standard part matching, rule base matching, and deep learning recognition for three-level semantic annotation and importance grading; generating multi-precision mesh models based on the importance level using a feature-weighted point cloud non-uniform simplification algorithm; and finally assembling 3D device model data with different simplification precipitates based on the region connectivity graph. This application achieves intelligent and differentiated hierarchical simplification of 3D models, balancing core feature preservation with data lightweighting, adapting to the needs of multiple application scenarios, and improving the efficiency and flexibility of model processing.

The invention provides an AIS intra-cluster local path self-adaptive reconstruction method and system, and the method comprises the steps: generating a global route based on an off-line constructed maritime traffic network connected graph plan according to a starting and ending point and an expected navigational speed inputted by a user, and carrying out the local path reconstruction of a cluster where a route turning point is located, global course information of the global course is obtained; according to the global course information and the expected navigational speed, obtaining an optimal sub-cluster in the cluster where the course turning point is located; and obtaining a cluster entrance reference point and a cluster exit reference point in the optimal sub-cluster through an adaptive algorithm, reconstructing a local path in the cluster according to the cluster entrance reference point and the cluster exit reference point, and updating global course information of the global course. According to the method, the global course information is utilized and the AIS track points in the clusters are combined to guide the adaptive reconstruction of the local paths in the clusters, so that the centroids of the clusters are not directly connected any more, the route planning is more consistent with the logic, and the authenticity and availability of the route planning are improved.

This invention discloses an image clustering method, apparatus, computer device, and storage medium. The method involves acquiring a sample image cluster, which includes multiple sample image nodes. After performing image clustering on each sample image node to obtain an image connectivity graph, the image connectivity graph is segmented to obtain at least one image connectivity subgraph. Each image connectivity subgraph includes at least one node relationship edge connecting two sample image nodes. The shortest path value and the robustness value of the relationship edges corresponding to all node relationship edges in each image connectivity subgraph are determined. Based on the shortest path value and the robustness value of the relationship edges corresponding to each node relationship edge, a target connectivity graph corresponding to the sample image cluster is determined from the image connectivity graph. This invention improves the accuracy and precision of image clustering and segmentation.

Systems and methods are provided for automatically grouping branch devices based on device information (e.g., IPSec tunnel connectivity, etc.). The devices with similar branch gateways which would customarily receive similar route information and / or properties (e.g., AS-PATH, cost, MED, Metric1, Metric2, community / extended community) and / or devices with similar connectivity graphs can be grouped together. This can reduce the number of electronic communications transmitted throughout the network and increase computational efficiency for the controller and devices.

The application relates to a text recognition method and device, computer equipment and a readable storage medium. The method comprises the following steps: obtaining to-be-detected text and association relationship information; generating a text connectivity graph according to the to-be-detected text and the association relationship information; iteratively updating the text connectivity graph, and generating target text features corresponding to the to-be-detected text according to the iteratively updated text connectivity graph; and identifying target text with semantic repetition from the to-be-detected text by clustering the target text features of the to-be-detected text. The method can accurately recognize text.

This application concerns a computer-implemented method for compiling an input unitary acting on a set of logical qubits to an output quantum circuit operable on a quantum system comprising a plurality of output qubits (1), wherein the output qubits (1) of the quantum system are arranged in accordance with a connectivity mesh (11), wherein nodes (111) of the connectivity mesh (11) represent possible sites for the output qubits (1) of the quantum system and each edge (112) of the connectivity mesh (11) indicates that quantum interactions between the output qubits (1) of the quantum system connected by one of the edges (112) are possible, comprising the following steps: providing the connectivity mesh (11) of the quantum system; assigning an index to each of the logical qubits; extracting a set of target labels (2) from the input unitary, wherein the target labels (2) correspond to a set comprising at least one of the indices of the logical qubits; compiling circuit building blocks (4) implementing a subset of the target labels (2), wherein the circuit building blocks (4) comprise body path gates (41) and / or leg gates (42) acting on the output qubits (1), wherein compiling the circuit building blocks (4) comprises: defining a tree (3) comprising a subset of edges (112) and a subset of nodes (111) of the connectivity mesh (11), wherein the tree (3) comprises a body (31) with at least one body node (1111) representing a site for an output qubit (1), wherein the body (31) comprises at least two output qubits (1) at two body nodes (1111) and at least one path (6) connecting all body nodes (1111) of the body (31) and / or at least one leg (32) with at least one leg node (1112) representing a site for an output qubit (1), wherein the at least one leg node (1112) is connected by an edge (112) with at least one body node (1111); adding a body path gate (41) to the output quantum circuit for each body node (1111) along the at least one path (6) and / or adding a leg path gate (42) to the output quantum circuit for each leg node (1112); adding a single-qubit gate (43) to the output quantum circuit for at least one of the target labels (2) of the input unitary, wherein the single-qubit gate acts on the output qubit (1) and at the moment on which the target label (2) is implemented due to the gates of the circuit building blocks (4).

A subsurface representation may define subsurface configuration of a subsurface region. A grid connectivity graph for the subsurface representation may include (1) nodes that represent cells within the subsurface representation, and (2) edges between the nodes that represent connectivity between the cells within the subsurface representation. The grid connectivity graph may be filtered to remove edges that do not satisfy a connectivity criterion. The filtered grid connectivity graph may be used to compute a linear solver preconditioner that improves the performance of the subsurface simulation.

The invention provides a quantum error correction decoding method and decoder based on hypergraph contraction, and belongs to the technical field of quantum error correction decoding. The quantum error correction decoding method comprises the following steps: S1, constructing a comprehensive measurement circuit containing noise, and generating a detector error model and a measurement sample set by using the comprehensive measurement circuit; s2, converting the detector error model into a hypergraph structure; s3, selecting hyperedges closely related to the currently input measurement sample in the hypergraph structure to construct a sub-hypergraph structure; s4, simplifying the sub-hypergraph structure into a connectivity graph, and determining a contraction sequence of the sub-hypergraph based on the connectivity graph; s5, performing approximate contraction processing on the sub-hypergraph according to the determined contraction sequence to obtain approximate distribution of error mechanism probability; and S6, determining a final decoding output result according to the approximate distribution of the error mechanism probability.

This application discloses a centralized wireless communication resource dynamic allocation method, including: creating a topology structure diagram that stores complete information about the current network topology using a connectivity graph data structure; creating a communication task request queue based on the communication needs of each communication node in the communication network; creating a request node based on the communication request and inserting it into the communication task request queue as a judgment criterion; sequentially extracting the request node and creating a minimum spanning tree using the topology structure diagram as the connectivity graph; obtaining the communication path from the request node to the target node based on the minimum spanning tree, and selecting appropriate resources to allocate to the task request. This method can simultaneously meet the needs of communication tasks while improving the utilization rate of network resources.

This application concerns a computer-implemented method for compiling an input unitary acting on a set of logical qubits to an output quantum circuit operable on a quantum system comprising a plurality of output qubits (1), wherein the output qubits (1) of the quantum system are arranged in accordance with a connectivity mesh (11), wherein nodes (111) of the connectivity mesh (11) represent possible sites for the output qubits (1) of the quantum system and each edge (112) of the connectivity mesh (11) indicates that quantum interactions between the output qubits (1) of the quantum system connected by one of the edges (112) are possible, comprising the following steps: providing the connectivity mesh (11) of the quantum system; assigning an index to each of the logical qubits; extracting a set of target labels (2) from the input unitary, wherein the target labels (2) correspond to a set comprising at least one of the indices of the logical qubits; compiling circuit building blocks (4) implementing a subset of the target labels (2), wherein the circuit building blocks (4) comprise body path gates (41) and / or leg gates (42) acting on the output qubits (1), wherein compiling the circuit building blocks (4) comprises: defining a tree (3) comprising a subset of edges (112) and a subset of nodes (111) of the connectivity mesh (11), wherein the tree (3) comprises a body (31) with at least one body node (1111) representing a site for an output qubit (1), wherein the body (31) comprises at least two output qubits (1) at two body nodes (1111) and at least one path (6) connecting all body nodes (1111) of the body (31) and / or at least one leg (32) with at least one leg node (1112) representing a site for an output qubit (1), wherein the at least one leg node (1112) is connected by an edge (112) with at least one body node (1111); adding a body path gate (41) to the output quantum circuit for each body node (1111) along the at least one path (6) and / or adding a leg path gate (42) to the output quantum circuit for each leg node (1112); adding a single-qubit gate (43) to the output quantum circuit for at least one of the target labels (2) of the input unitary, wherein the single-qubit gate acts on the output qubit (1) and at the moment on which the target label (2) is implemented due to the gates of the circuit building blocks (4).

The application provides a line optimization method, device and equipment of a quantum key distribution network and a medium, comprising: acquiring a quantum network connectivity graph of a quantum key distribution network; determining a bottleneck line set according to the quantum network connectivity graph; determining a total importance index corresponding to the bottleneck line set, the total importance index being the sum of the importance index of each bottleneck line included in the bottleneck line set; and expanding the bottleneck line in the bottleneck line set according to the total importance index, thereby solving the problem of difficult expansion of the bottleneck line of the quantum key distribution network.

A method, computer system, and a computer program product for determining a cluster connectivity is provided. The present invention may first include receiving as input a connectivity graph. The present invention may then include generating a minimal list of firewall rules from the received connectivity graph by iteratively merging firewall rules with commonality of connectivity attribute.