23 results about "Coloring algorithm" patented technology

The invention provides a self-adaptive network topology dynamic reconstruction method and system based on deep reinforcement learning, and relates to the technical field of deep reinforcement learning, and the method comprises the steps: obtaining the topology state information, service flow distribution information and historical reconstruction records of a current network; extracting topological correlation characteristics among nodes through graph convolution operation, and generating fusion state representation in combination with service flow information; inputting the fusion state representation into a deep reinforcement learning model to identify bottleneck nodes and redundant links, and outputting a reconstruction action candidate set; searching and evaluating the long-term cumulative income of the candidate actions through a Monte Carlo tree, and screening an optimal reconstruction action sequence; a graph coloring algorithm is utilized to allocate time slots and process resource conflicts, and a resource-feasible topology adjustment scheme is generated; and extracting a network evolution rule through tensor decomposition, and constructing a topological optimization association mapping graph. According to the method, the network bottleneck can be intelligently identified, the network topology structure is dynamically optimized, and the network performance and the resource utilization rate are effectively improved.

The invention discloses a paired time division multiple access method and a paired time division multiple access device in a high dynamic scene. The method comprises the following steps of: mapping each link request into a vertex of a conflict graph; according to a primary conflict and secondary conflict judgment rule, adding undirected edges for vertex pairs with conflicts, and constructing a communication conflict graph; a TDPA time slot allocation problem is formalized into a minimum vertex coloring problem of a communication conflict graph; calculating to obtain a neighborhood cardinal number of each vertex through a global greedy coloring algorithm; carrying out descending sorting on the vertexes according to a neighborhood cardinal number; a minimum positive integer which is not used by a neighborhood vertex is distributed to each vertex in sequence to serve as a time slot, and an initial scheduling baseline is generated; updating the communication conflict graph based on the generated initial scheduling baseline and the current topology change information, and identifying failure vertexes; and re-coloring the failure vertexes through an incremental greedy coloring algorithm to obtain a new scheduling scheme. According to the invention, the problems of low channel utilization rate, poor real-time response, insufficient dynamic adaptability and the like in the prior art are solved.

The invention belongs to the technical field of wireless communication and networks, and discloses a time-frequency resource joint scheduling method and system for unmanned aerial vehicle emergency service real-time return, and the method comprises the steps: employing a graph theory, and constructing an unmanned aerial vehicle emergency communication network into a dynamic directional conflict graph; based on a dynamic directional conflict graph, through a dynamic directional double graph coloring algorithm based on a dobby machine, combined scheduling of time-frequency resources of the unmanned aerial vehicle in a time-varying topology scene is realized, and reliable return of disaster situation data in a post-disaster high-dynamic emergency scene is solved.

In certain implementations, a method includes obtaining network information for a plurality of access points (APs) that are configured to provide user devices with access to a communication network, and determining, according to the network information, partitions in which to divide the APs for deploying a software update to the APs. The method includes dividing, according to a vertex coloring algorithm, the APs into the partitions. The APs correspond to vertices of the vertex coloring algorithm, and neighbor relationships of the APs correspond to edges of the vertex coloring algorithm. The method includes transmitting software update instructions to the APs to cause APs of a first partition to execute a reboot for installing the software update on the APs of the first partition at a different time than APs of a second partition execute a reboot for installing the software update on the APs of the second partition.

The application is suitable for the field of communication technology, and provides a global frequency planning method and system based on graph coloring and cost function, the method comprising: obtaining site information of to-be-planned frequencies, outputting a division result about a sub-connected graph according to the site information, and performing frequency point allocation through a graph coloring algorithm according to the principle that the frequencies between directly connected adjacent sites are different; traversing all sites, and counting a site set which has not been allocated frequencies; judging whether the site set is empty or not, when the site set is not empty, calculating an interference cost function when the site which has not been allocated frequencies and its directly connected sites are allocated the same frequency, and performing frequency allocation according to the principle that the minimum cost function is optimal, until the site set is empty, the embodiment of the application can realize automatic and rapid global frequency planning according to site positions and user working probability and other information, and can effectively reduce mutual interference between sites.

The application discloses a satellite slant beam inter-beam interference avoidance method and system based on cost flow and dynamic graph coloring, and accurately models the interference range of slant beams in a multi-satellite satellite hop-beam system, considers the influence of the slant beams when modeling the anti-beam inter-beam interference hop-beam pattern design problem, divides the dynamic graph coloring problem into two sub-problems of satellite-wave position matching and hop-beam time slot allocation which are coupled with each other, pre-solves the satellite-wave position matching problem by using a minimum cost maximum flow algorithm, obtains a satellite-wave position matching initial solution which maximizes the sum of satellite elevation angles of all wave positions in the system under the constraint of the maximum number of simultaneously opened beams of the satellite, and on the basis, combines a tabu search algorithm and a graph coloring algorithm to jointly optimize the two sub-problems, so as to further improve the inter-beam interference avoidance performance of the same hop-beam time slot opened beam. The application can obtain a multi-satellite hop-beam scheme with minimum inter-beam interference, and the algorithm has low complexity and is convenient for actual system implementation.

The invention discloses an inter-body area network interference mitigation method based on clustering and graph coloring, which reduces the overall conflict strength of a system through a cluster division mechanism of interference perception, performs intra-cluster time slot allocation by using a graph coloring algorithm, and introduces a task priority as a scheduling weight to realize a unified scheduling target of interference avoidance and task guarantee. The allocation strategy ensures that any pair of nodes with the interference relationship is not allocated with the same time slot, and the graph coloring conflict avoidance constraint is met. Meanwhile, under the condition of the same structure, high-priority nodes can be processed preferentially, so that the probability of acquiring low-number time slots is improved, and low-delay transmission and communication stability of key tasks are ensured. And when all the nodes complete time slot number distribution, the algorithm is terminated. The finally obtained distribution result is a complete time slot scheduling scheme in the cluster. The maximum time slot number used in the whole allocation process represents the minimum number of non-overlapping communication time slots required in the cluster.

The invention discloses a solid state disk storage optimization method and system, and relates to the technical field of data storage.The method comprises the steps that based on behavior layer data and physical layer data of a solid state disk, a topological coloring algorithm and a graph cut algorithm are used for conducting regional division on a storage unit; performing abnormal behavior detection on the storage unit of each area by using an isolated forest algorithm to obtain an abnormal storage unit; acquiring change increment data of the abnormal storage unit; on the basis of a neural network model, taking the feature data and the change increment data of the abnormal storage unit as input, and generating an optimization strategy set, so that different regions are subjected to different optimization processing; and on the basis of the optimization strategy set and under the principle that the optimization strategy of the abnormal storage unit is balanced with the overall optimization target, the storage of the solid state disk is optimized after an optimal execution strategy is obtained through multi-target adjustment and optimization. Different optimization strategies can be applied to the internal area, the boundary area and the external area of the solid state disk.

In certain implementations, a method includes obtaining network information for a plurality of access points (APs) that are configured to provide user devices with access to a communication network, and determining, according to the network information, partitions in which to divide the APs for deploying a software update to the APs. The method includes dividing, according to a vertex coloring algorithm, the APs into the partitions. The APs correspond to vertices of the vertex coloring algorithm, and neighbor relationships of the APs correspond to edges of the vertex coloring algorithm. The method includes transmitting software update instructions to the APs to cause APs of a first partition to execute a reboot for installing the software update on the APs of the first partition at a different time than APs of a second partition execute a reboot for installing the software update on the APs of the second partition.

The invention discloses a multipath electric power signal coupling method and system for a centralized control system, and belongs to the technical field of electric power signal coupling. A coupling tolerance matrix is constructed based on multi-parameter characteristics of electric power signals, the signals are divided into reusable groups by using a graph coloring algorithm, and coupling carrier parameters are distributed for each group of signal sets; multiple groups of signals generate coupling control waveforms through a waveform modulator, the coupling control waveforms are injected into a shared transmission channel, a configuration table is used for parallel decoding and error checking at a receiving end, a parameter self-adaptive tuning mechanism can be triggered when the error rate exceeds a threshold value, and closed-loop updating of frequency offset and time slots is achieved. The decoupled signal is output to the load control module, and the current coupling configuration state is transmitted back to the centralized control system master station in real time; the method is suitable for high-density and multi-node industrial control, power grid automation, rail transit and other scenes, and has the technical advantages of high signal coupling efficiency, strong anti-interference capability, error code self-repairing, configuration passback and the like.

The present invention discloses a GPU-based parallel tetrahedron mesh generation method and an aircraft shape design method. Currently, the rapid generation of large-scale tetrahedron meshes with reliable quality is still an open problem. The present invention designs a block-based GPU tetrahedron mesh data structure, and implements an efficient parallel tetrahedron mesh generation method based on the data structure. First, the center of gravity of the tetrahedron is calculated and the size is checked. If the size requirements are not met, multiple rounds of iterative cavity growth are performed as the starting point. After that, independent cavities with no overlapping boundaries are selected through a coloring algorithm. These cavities are then repaired through multiple rounds of iterations. Finally, the cavities are reconnected and the topological information and neighbor information of the mesh are updated. The above steps are repeated until all tetrahedrons meet the size requirements, thereby achieving the rapid generation of large-scale tetrahedron meshes with reliable quality, thereby greatly reducing the time required for aircraft shape design optimization.

The invention discloses a brain magnetic compatible near-infrared channel arrangement and modulation frequency distribution method, and belongs to the technical field of multi-mode brain function imaging. In order to solve the problems that in the prior art, personalized optrode arrangement optimization is difficult, standardized meta-information files are tedious to generate, and brain magnetic compatible frequency distribution efficiency is low, optrode coordinates are constructed based on individual head three-dimensional information, the positions of a light source and a detector are optimized through a greedy algorithm, and optrode two-dimensional coordinates are adjusted through dimension reduction and nonlinear optimization; and an automatic scheme is generated by using a method for carrying out brain magnetic compatible frequency allocation by using a graph coloring algorithm. According to the method, the experimental channel scheme of the whole brain or the region of interest can be quickly generated, the standard file and the channel visualization graph can be automatically generated, the brain magnetic compatibility and the high frequency utilization rate are considered at the same time, and the method is suitable for multi-mode brain imaging experiment preparation and personalized helmet or flexible cap optrode design.

The present invention discloses a solid-state hard disk storage optimization method and system, which relates to the field of data storage technology. The method comprises: partitioning storage units into regions based on behavioral layer data and physical layer data of the solid-state hard disk using a topological coloring algorithm and a graph cut algorithm; detecting abnormal behavior of storage units in each region using an isolation forest algorithm to obtain abnormal storage units; obtaining incremental change data of the abnormal storage units; generating an optimization strategy set based on a neural network model using the feature data and incremental change data of the abnormal storage units as input, so that different regions receive different optimization treatments; and optimizing the storage of the solid-state hard disk after obtaining the optimal execution strategy based on the optimization strategy set and under the principle of balancing the optimization strategy of the abnormal storage unit with the overall optimization goal through multi-objective tuning. The present invention can apply different optimization strategies to the internal region, boundary region, and external region of the solid-state hard disk.

The application discloses a chip layout processing method, device, equipment, computer storage medium and program product. The chip layout processing method comprises the following steps: acquiring a chip layout; performing division processing on the chip layout according to a preset division rule to obtain a plurality of division region graphs, wherein the preset division rule is used to make the graph in each division region graph not in conflict with any graph in adjacent division region graphs; coloring each graph in each division region graph according to a graph coloring algorithm to obtain a colored region graph; acquiring a graph feature of each graph, adjusting the coloring of each colored region graph according to the graph feature of each graph to obtain a plurality of target colored region graphs; and performing splitting processing on the graphs with different colors in each target colored region graph to obtain a chip splitting graph. The method can uniformly split the graphs involved in the chip layout.

In certain implementations, a method comprises obtaining network information for a plurality of access points (APs) configured to provide user devices with access to a communications network, and determining, according to the network information, partitions into which to divide the APs to distribute a software update among the APs. The method comprises dividing the APs into the partitions according to a vertex coloring algorithm. The APs correspond to the vertices of the vertex coloring algorithm, and the neighbor relationships of the APs correspond to the edges of the vertex coloring algorithm.The method includes transmitting software update instructions to the APs to cause the APs of a first partition to reboot to install the software update on the APs of the first partition at a different time than the APs of a second partition reboot to install the software update on the APs of the second partition.

Method, systems, and apparatus for measuring fermionic operators. In one aspect, a method includes obtaining an input comprising k-body Majorana operators, a predefined precision, and copies of a tensor product of a quantum state and the quantum state. For each Majorana operator, a basis to measure the Majorana operator in is determined. The input is processed to obtain expectation values that correspond to the Majorana operators. A graph is constructed by, for each non-zero expectation value, adding a vertex to the graph that represents a Majorana operator that corresponds to the non-zero expectation value and adding edges between vertices in the graph that represent anticommuting Majorana operators. A vertex coloring algorithm is applied to the graph. For a color that corresponds to the Majorana operator, a simultaneous eigenbasis of Majorana operators in the graph with the color is determined. The Majorana operator is measured in the determined basis.

An ad hoc distributed time slot allocation method based on graph coloring algorithm: 1) Each node in the ad hoc self-organizing network completes the situation awareness within the collision domain, obtains the topology within the communication range of this node, and obtains the node information and link parameters within the topology; 2) After each node in the ad hoc self-organizing network obtains the topology information within the collision domain, a node distribution state graph within the collision domain is constructed with nodes as vertices. According to parameters such as the time slot settings preset in the system configuration and the degrees of the nodes and neighbors obtained by sensing, colors are assigned to each node to avoid interference between interfering nodes, and each node occupies a time slot according to the obtained color; 3) According to parameters such as the message queue length of the node, the color allocation algorithm is used to adjust the allocation of the remaining time slots in the data sub-frame; after the color selection is completed, the message queue length is read, and the number of time slots of the node is dynamically adjusted, and the time slot allocation is dynamically adjusted when a node joins or exits.

The invention provides a concrete shrinkage deformation reverse modeling compensation method, and belongs to the technical field of wind tunnel construction, and the method comprises the steps: building a pouring unit adjacent relation topological graph, optimizing a pouring time sequence through a graph coloring algorithm, and building a heat-humidity-force multi-physics field coupling finite element model; kriging interpolation is adopted to reconstruct complete temperature field distribution and extract a temperature deviation field, Kalman filtering inversion is used to correct hydration heat source parameters, a moving boundary identification algorithm is used to update dynamic boundary conditions, an incremental iteration algorithm is used to solve coupling response, and a Green function stress response matrix is used to quickly calculate stress field distribution. When the stress value of the key position exceeds the threshold value, reverse compensation calculation is started to generate a template adjustment instruction, actually measured data is fed back to the model to form closed-loop iteration, and the technical problem of wind tunnel structure construction deformation control failure caused by insufficient concrete shrinkage deformation prediction precision is solved.

The application discloses a kind of probability disassembly parallel optimization method and system based on double buffering.Thereby, binary program is modeled as the super-set instruction graph containing conflict edge and control flow edge;Using graph coloring algorithm, conflict node is colored and grouped, so that the node in the same color group is connected without conflict edge;Double buffering structure of probability array is constructed, and conflict-free parallel reading and writing are realized by reading and writing separation;Each color group is serially scheduled according to color group order, and multi-thread parallel execution of probability propagation update is performed in the same color group node, and the reading buffer and writing buffer pointers are switched after the current color group update;Parallel determination mechanism is used to detect node convergence state, and if there is a non-converged node, iteration continues;After all nodes converge, the probability of each super-set instruction being a real instruction is calculated in parallel and output.The application eliminates data competition by double buffering reading and writing separation, and meets the serial constraint of occlusion instruction by graph coloring grouping, which significantly improves parallel efficiency while ensuring zero false negative and low false positive accuracy.

The present invention belongs to the technical field of channel allocation, and specifically relates to a full-duplex D2D communication channel allocation method based on a novel graph coloring. The steps include constructing a bidirectional interference graph containing all potential interference links; formulating the channel allocation problem as an interference minimization graph coloring problem; allocating N independent communication channels to all cellular user equipment; using a greedy graph coloring algorithm to assign a single color to the uncolored D2D vertices one by one; if the number of D2D vertices in a certain color set increases or decreases, re-evaluate the interference level; traverse each color and assign a single color to the remaining D2D vertices. When all D2D vertices have been traversed, the algorithm terminates, generating a conflict-free channel allocation scheme. The present invention can optimize channel allocation, effectively manage and mitigate the interference within the system, thereby improving the user access rate and the overall spectrum efficiency.

The present invention relates to the field of integrated circuit technology, and discloses a clock distribution method, apparatus, computer device, storage medium, and program product. The method includes: obtaining the clock distribution of each device in a target field programmable gate array; respectively determining the bounding boxes corresponding to each clock of the target field programmable gate array based on the clock distribution of each device in the target field programmable gate array; constructing an undirected graph with each clock of the target field programmable gate array as vertices based on the bounding boxes corresponding to each clock; processing the undirected graph through a graph coloring algorithm to color each vertex in the undirected graph; and respectively allocating the devices in the target field programmable gate array corresponding to the vertices with the same color to the same clock plane. The above solution ensures the accuracy and effectiveness of clock distribution.

The application provides a deep reinforcement learning-based adaptive network topology dynamic reconstruction method and system, relates to the technical field of deep reinforcement learning, and comprises the following steps: acquiring the topology state information, service traffic distribution information and historical reconstruction records of a current network; extracting the topological correlation characteristics between nodes through graph convolution operation, combining the service traffic information to generate a fusion state representation; inputting the fusion state representation into a deep reinforcement learning model to identify bottleneck nodes and redundant links, and outputting a reconstruction action candidate set; evaluating the long-term cumulative benefits of the candidate actions through Monte Carlo tree search to select an optimal reconstruction action sequence; allocating time slots and processing resource conflicts by using a graph coloring algorithm to generate a resource feasible topology adjustment scheme; and extracting network evolution rules by using tensor decomposition to construct a topology optimization correlation mapping graph. The application can intelligently identify network bottlenecks, dynamically optimize the network topology structure, and effectively improve the network performance and resource utilization.

The invention provides a low-orbit satellite constellation co-frequency interference reduction method based on'beam-time-space 'overall planning. According to the method, inter-satellite link resources of all satellites in a constellation are uniformly and predictively distributed and scheduled through a centralized management entity or a distributed negotiation mechanism; according to the method, a graph theory coloring algorithm is creatively applied to optimal distribution of satellite resources, and specifically, each inter-satellite link is regarded as a node. If the potential interference Iij and Iji of the two links Li and Lj exceeds a threshold value, an edge is connected between the two links Li and Lj. The resource allocation problem is converted into a problem of "coloring" the interference pattern, where colors represent available resources, such as frequency and slot two-tuples. The aim is to complete coloring using the fewest colors, i.e. Resources, or to maximize the weight of the colored nodes under a given number of colors.