8 results about "Coloring algorithm" patented technology

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.

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.

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