38 results about "Graph coloring" patented technology

The invention provides a hospital infection propagation path tracing method based on multi-source data fusion, and belongs to the technical field of infection propagation paths in hospitals, and the method comprises the steps: building a data set through collecting hospital multi-source infection monitoring data, constructing a multi-layer network propagation model comprising physical contact, spatial proximity and time co-occurrence, and carrying out the tracing of the multi-source infection propagation path. Community detection is carried out by using a random block model, infection propagation path identification is converted into graph coloring problem solving, an individual behavior heterogeneity model is established, and SEIR model propagation parameters are corrected by fusing individual characteristic parameters such as the immune state of a patient and the protection level of medical staff; a propagation situation awareness model based on a hybrid expert mechanism is adopted to optimize propagation parameter estimation, and a propagation parameter weight coefficient is obtained through a game optimization mechanism and Nash equilibrium solution for iterative optimization. And finally, outputting a high-confidence infection propagation path sequence and a propagation source positioning result by adopting a propagation path backtracking algorithm in combination with spatial-temporal correlation analysis.

The invention relates to a self-adaptive anisotropic cloth simulation method and system based on position dynamics, electronic equipment and a storage medium, and belongs to the field of computer graphics physical simulation. The method comprises the following steps: arranging a cloth grid; calculating a topological relation of the grids to form a set of points, edges and surfaces; according to the Newton's law, a linear system of external force is constructed, and a conjugate gradient method is used for solving change coordinates; carrying out data dependence decoupling on the grids by using a graph coloring method, and carrying out strain constraint iterative parallel calculation on the change coordinates by using a position dynamics method to obtain a coordinate correction value after cloth motion deformation; and calculating a grid tensor field according to the corrected coordinates, and dynamically refining and coarsening the grid to form a non-uniform anisotropic distribution grid. According to the method, the dynamic non-uniform grid is calculated by using the position dynamics method, the anisotropy of cloth deformation is simulated, the dynamic behavior of cloth wrinkles under a fine scale is reserved, rapid solving is performed on the basis of not losing simulation details, and the real-time performance is met.

The invention provides a low-code and component intelligent collaborative application construction method based on a dual-drive architecture, and belongs to the technical field of computer programming. The method comprises the following steps: establishing a component dependency digraph, optimizing a component collaborative relationship by adopting topological sorting, graph coloring and a minimum spanning tree algorithm, collecting multi-dimensional performance indexes to establish a monitoring matrix, processing monitoring data by utilizing a collaborative optimization model containing a gating information propagation mechanism, and generating a dynamic scheduling decision vector; the load change of the system is judged through a change rate threshold equation, quick or slow response adjustment is executed, and finally, a low-code component library and a visual configuration interface are established to realize intelligent collaboration and dynamic resource allocation among components. The technical problems that the collaboration efficiency among low-code platform components is low and intelligent dynamic scheduling cannot be achieved according to system load changes are solved.

The present application relates to a kind of based on position dynamics adaptive anisotropic cloth simulation method, system, electronic equipment and storage medium, belong to computer graphics physics simulation field.The method includes setting cloth grid;Topology relationship of grid is calculated, and the set of point edge surface is formed;According to Newton's law, the linear system of external force is constructed, and change coordinate is solved using conjugate gradient method;Using graph coloring method, data dependence is decoupled to grid, using the method of position dynamics, strain constraint iteration parallel computing is carried out to change coordinate, and the coordinate correction amount after cloth motion deformation is obtained;According to the revised coordinate, grid tensor field is calculated, grid dynamic refinement and coarsening are carried out, and non-uniform anisotropic cloth grid is formed.The present application uses position dynamics method to calculate dynamic non-uniform grid, simulates the anisotropy of cloth deformation, retains the dynamic behavior of cloth wrinkle under fine scale, is quickly solved on the basis of not losing simulation details, satisfies real-time.

A distributed inference communication method of a super-large-scale graph neural network comprises the following steps: dividing a global topology to be processed into a plurality of local sub-domains matched with the number of GPUs, and determining a local master node and a boundary master node allocated to each GPU; calculating coloring priorities of nodes, and performing parallel graph coloring based on the coloring priorities to construct a global independent set sequence; mapping the global independent set sequence to the local sub-domains of the GPUs to generate a local task slice sequence, which comprises boundary node slices and internal node slices, evaluating communication load and calculation load of the slices, and taking the internal node slices as calculation fillers to be executed in the communication waiting period of the boundary node slices; and each GPU executes an inference task by using a multi-stream asynchronous pipeline constructed locally according to the local task slice sequence. The method can improve the throughput of distributed inference.

The invention relates to a line draft graph coloring processing method and device, computer equipment, a storage medium and a computer program product. The method comprises the steps of obtaining a line draft graph, and in response to coloring operation for a target area in the line draft graph, filling the target area with a first color specified by the coloring operation; displaying an edge color line of the target area, and determining at least one neighbor area adjacent to the target area through the edge color line from the line draft graph; obtaining a color group pre-configured for the line draft graph, wherein the color group comprises a second color pre-configured for the edge color line and corresponding to the first color; and filling the at least one neighbor region with a second color. By adopting the method, the coloring treatment efficiency can be improved.

The invention provides a high-energy-efficiency digital-analog hybrid CMOS Boolean satisfiability problem solver chip which comprises a solver core, an SRAM peripheral read-write drive circuit and a parallel-to-serial read-out circuit, the SRAM peripheral read-write drive circuit is connected with a processor core and used for reading and writing data, the parallel-to-serial read-out circuit is used for reading a final solution, and the solver core comprises a 218 * 50 processing unit array. The processing units in each column are interconnected through charge sharing lines so as to complete accumulation operation in a charge domain. The processing units in each row are interconnected through TCAM matching lines, and the word and sentence evaluation operation is completed. In addition, a graph coloring circuit is also integrated for grouping Boolean variables. In each iteration, the Boolean variables in the same group can be updated at the same time, so that the parallel computing capability of the solver is improved. The energy efficiency is improved by using a digital-analog hybrid calculation mode, and the degree of parallelism is improved by using a packet updating strategy.

The present invention discloses a wireless resource management method based on personalized multi-granularity stepless graph coloring, comprising: establishing a multi-access fusion resource management model; obtaining potential interference relationships of wireless resources between user devices, and obtaining potential interference values ​​between user devices according to the potential interference relationships and the multi-access fusion resource management model, so as to establish an undirected interference graph with the user devices as vertices and the potential interference values ​​between user devices as edge weights; performing interference isolation on the vertices according to the undirected interference graph, so as to map the vertices to corresponding coloring axes, and coloring the vertices according to RGB color values ​​corresponding to the positions of the vertices on the coloring axes; clustering the isolated and colored vertices based on a multi-granularity clustering algorithm, and dividing the vertices on the coloring axis into multiple interference tolerance intervals with different tolerances, so that user devices in the same interference tolerance interval can reuse the same wireless resources; thereby reducing system interference and improving resource utilization.

The invention provides a wavelength routing method and device, equipment and a storage medium, which can be applied to the technical field of optical communication. The method comprises the following steps: acquiring a structure diagram of an optical topology network to be subjected to wavelength routing; converting the structure diagram of the optical topology network into an auxiliary diagram; converting a wavelength allocation problem into a graph coloring problem of the auxiliary graph; converting a graph coloring problem of the auxiliary graph into an Isin model; converting the graph structure of the auxiliary graph into an interaction matrix of the Isin model; and obtaining a wavelength allocation result of the optical topology network according to the interaction matrix of the Isin model. The method has the characteristics of adaptability to a large-scale network, rapidness and high accuracy.

The invention provides a city governance event disposal method, device and equipment and a storage medium, and relates to the technical field of computers. According to the municipal governance event handling method, firstly, a plurality of personnel or institutions responsible for event handling are modeled according to a graph coloring theory, and a complex and abstract practical problem is converted into a simple mathematical problem; then, improving a dung beetle optimization algorithm from multiple aspects by using fusion improved Circle mapping, an optimized region boundary factor, parameter adaptive adjustment and population fitness optimization; and finally, carrying out multiple iterations through an improved dung beetle optimization algorithm, and finding out a solution which is most suitable for solving the event. Through the improved dung beetle optimization algorithm based on the graph coloring theory, the event processing flow is optimized, and the problems of quick response and efficient disposal of complex and changeable urban or rural events are solved.

The present invention discloses an on-line computing resource scheduling method and system for MLaaS services. The method comprises: for computing tasks entering a cluster, sequentially obtaining a computing node allocation plan based on a specified computing node allocation method, obtaining the ToR switches required for use under the allocation plan, and deriving a feasible high-level switch allocation plan for the task, wherein the computing node allocation methods include: a greedy computing node allocation method, a computing node allocation method that skips switches, a method that uses shared switches, and a computing node allocation method for shared switches; converting the global high-level switch allocation plan into a corresponding graph coloring problem, solving the problem using a simulated annealing algorithm with practical constraints, determining a reasonable global allocation plan, seamlessly switching switch resources used by running tasks according to the determined global allocation plan, and allocating switch resources to new tasks. The present invention can effectively alleviate competition for switch resources in MLaaS scenarios.

The invention relates to the field of computer science, in particular to a method for converting a Boolean satisfiability problem (SAT) into a 3-coloring problem. According to the method, variables and clauses in an SAT formula are mapped into vertexes of a graph through a specific graph structure and coloring constraints, and logic constraints are represented through edges, so that solution of a Boolean formula is converted into a graph coloring problem. The method comprises the following steps: S1, reading an SAT problem, and initializing an adjacent matrix of a topological graph; s2, setting fixed coloring points, and performing necessary connection on the fixed coloring points and vertexes of the correlation graph; s3, sequentially selecting two SAT variables each time, newly adding intermediate graph vertexes in the graph, and connecting the intermediate graph vertexes in the graph according to a logical relationship in the SAT and a rule set by the invention; s4, circularly performing the step S3 until the logic relationship of all the variables has a complete description in the graph; and S5, finally forming a 3-graph coloring graph. According to the conversion method provided by the invention, the structure of the SAT problem is simplified, so that the SAT problem can be applied to an existing graph theory algorithm, the possibility of solving parallelization capability of a large-scale problem is provided, and the visual analysis of the solution is more intuitive. The method has the advantages of improving the visualization degree of the solution and being simple and rapid in conversion.

The invention relates to the technical field of touch interface optimization, in particular to a dynamic distribution method for a touch screen area. According to the method, the direction change rate and the dragging span information are extracted from the operation path of the user on the touch screen, the dynamic behavior characteristics of the path can be accurately perceived, the space overlapping relation is established between the path and the edge of the screen function area, and the distance between the end point of the path and the edge line segment and the continuous hit number are calculated. According to the method, a path boundary coincidence ratio parameter is formed, and whether a user dragging behavior has an obvious adsorption intention or not is comprehensively judged in combination with an evaluation result of path direction change stability, so that a system can intelligently recognize a target function region based on a gesture trend when a user operation does not clearly specify a specific region; the function calling sequence before and after the adsorption path is tracked, the minimum jump frequency is used as an optimization target, the function space layout is divided through a graph coloring method, and it is ensured that the calling sequence between the function modules conforms to the operation habit of a user.

A data communication system includes a link unit, a first communication unit, and a second communication unit. The first communication unit is connected to the link unit to transmit and receive pulse amplitude modulation (PAM) signals. The second communication unit is connected to the link unit to transmit and receive the PAM signals. The number of PAM signal levels is greater than or equal to the number of transmission lines, the sum of PAM values of each transmission line is “0”, and signal pairs with different signal levels of each transmission line are assigned to a vertex and a line segment of an inference graph diagram using graph coloring theory, and are defined as symbols according to a determined relationship. Each of the first communication unit and the second communication unit encodes and transmits transmission data to fit a corresponding symbol, and decodes and restores the received data.

The invention discloses a quantum circuit optimization method and device based on the easy Hamiltonian, and belongs to the technical field of quantum computation.The optimization method comprises the steps that the overall Hamiltonian is divided into local Hamiltonian, the eigenstate of the local Hamiltonian is mapped to a computing ground state through a conversion gate, and the computing ground state is converted into the local Hamiltonian; a target ground state phase is directionally corrected by using a multi-control phase gate, other ground state phase relations are adjusted in combination with an overturning operation, and finally an original state space is restored, so that a linear complexity circuit is realized; and quantifying the importance of variables on constraint conditions, preferentially removing high-contribution variables and reconstructing constraint equations and Hamiltonian of residual variables to complete quantum circuit optimization. According to the method, the exponential level circuit depth is reduced to the linear level, gate operation and resource allocation are optimized, the execution efficiency and the solving success rate of a quantum approximation optimization algorithm on medium-scale quantum equipment containing noise are remarkably improved, and the method is suitable for hardware adaptation deployment of constraint optimization problems such as facility site selection and graph coloring.

The invention discloses a traffic scheduling method and system in a distributed training task scene, which are used for distributed training tasks between a first device end and a second device end. The method comprises the following steps: according to a communication demand of a distributed training task, performing bipartite graph abstraction and graph coloring processing on a first device end, a second device end and network resources between the first device end and the second device end in sequence, establishing a communication model, and establishing a traffic scheduling optimization problem in combination with a first traffic scheduling target and a second traffic scheduling target; the first flow scheduling target selects paths flowing through different core switches for communication flows with the same source address or target address in any communication stage of a single task, and the second flow scheduling target selects paths flowing through different core switches for communication flows with the same source address or target address among different tasks; and solving a traffic scheduling optimization problem to obtain a path set and complete routing. According to the method, the flow conflicts in the tasks and among the tasks in the distributed training task scene are reduced.

The invention relates to a dynamic routing method based on storage and forwarding in a space division multiplexing elastic optical network, and belongs to the technical field of communication. The method comprises the following steps: firstly, acquiring the current state of a time-shifting multilayer graph, performing routing in the time-shifting multilayer graph, then determining the total occupied frequency slot number according to a path distance and a modulation format, and selecting a transmission path of a request in combination with the balance of multi-dimensional resources; then grouping and grading the fiber cores by using a graph dyeing method, and selecting the fiber cores for each link by considering crosstalk of the fiber cores and frequency slot use conditions according to a fiber core selection method designed in the invention; secondly, designing a frequency spectrum selection method, and selecting a proper frequency spectrum block for the request by comprehensively considering fragments of time domain and frequency domain dimensions; and finally, carrying out allocation in the time-shifting multilayer graph, and updating topology and resource use states until all requests are allocated. The storage and forwarding process can be simplified while the network capacity is improved, and the blocking rate is improved.

The application provides an optical wave signal distribution method, device and system, which are applied to the technical field of optical communication. The method converts the distribution problem of optical wave signals into a coloring problem of a conflict graph corresponding to the optical wave signals, and then uses a related algorithm model to solve the graph coloring problem to obtain a coloring scheme of the conflict graph. The coloring scheme of the conflict graph has a corresponding relationship with an optical wave signal distribution scheme of the optical wave signals, and accordingly the optical wave signal distribution scheme can be obtained. Based on the method, the distribution of the optical wave signals in an optical switching architecture can be automatically calculated by a device, without human planning, and the planning efficiency of the optical wave signal distribution scheme in the optical switching architecture can be greatly improved.

Embodiments relate to building and redacting of universal functional modules (UFMs). An example method includes receiving a register-transfer-level (RTL) description of an integrated circuit (IC) asset, generating a split RTL description comprising a plurality of sub-circuits by splitting the RTL description of the IC asset, and generating a plurality of replaced sub-circuits by replacing a subset of the plurality of sub-circuits with multiplexor (MUX)-based lookup-tables (LUTs). Determining the subset of the plurality of sub-circuits to replace with MUX-based LUTs includes identifying, based at least in part on performing a conflict graph coloring, non-interference sub-circuits of the plurality of sub-circuits, generating a plurality of scores by generating a score for each non-interference sub-circuit and based at least in part on the non-interference sub-circuit interaction with other sub-circuits, and based at least in part on a desired number of sub-circuits to replace and the plurality of scores, determining the subset.

The invention relates to the technical field, in particular to a general nameplate format setting and printing method, which comprises the following steps of: comparing a code scanning entry item, a server database and a local data source, removing repeated contents by utilizing uniqueness retrieval, and executing sorting and restructuring between an attribute field and a content field, so as to obtain a general nameplate format; a data sequence structure is more compact and has logic coherence, coordinate values, font sizes and rotation angles are uniformly written into a real number string, and different combinations are iteratively screened under three quantitative indexes of an overlapping rate, a blank rate and an alignment offset by combining exchange and disturbance operations of a genetic algorithm, so that the accuracy of the real number string is improved. The space utilization rate is maximized, information shielding is avoided, boundary parameters are converted into nodes, a graph coloring algorithm is adopted to allocate colors for intersection areas, meanwhile, the positions of titles and parameters are adjusted according to a priority table, adjustment is stopped when the number of conflict edges is lower than a threshold value, and it is ensured that the overall structure meets readability and logic orderliness.

The invention relates to the technical field of image processing, in particular to a diffusion model thangka draft image coloring method and equipment, and aims to realize primary coloring on a thangka draft by using an initial coloring network so as to ensure semantic alignment. And subsequently, the preliminary coloring image is input into diffusion for quality enhancement, and the Thangka color is further refined and smoothed, so that the coloring of the Thangka line draft can be realized under the condition that special color gradient and semantic segmentation are not involved, the coloring process is greatly simplified, and meanwhile, the artistic style and cultural characteristics of the Thangka are kept.

A data communication system includes a link unit, a first communication unit including a first encoding / decoding unit, and a second communication unit including a second encoding / decoding unit. Each of the first and second encoding / decoding units includes an encoder logic and an decoder logic. The encoder logic defines signal pairs, in which a sum of PAM4 signals of each of the transmission lines is 0 and PAM values of each of the simultaneously driving transmission lines have different signal levels, as state symbols according to a relationship determined by assigning the signal pairs to vertices and line segments of graph coloring theory, and encodes the transmission data to match a corresponding state symbol using a relationship between a previous state symbol and a current state symbol. The decoder logic restores the received signal using the relationship between the previous state symbol and the current state symbol.

The disclosure provides a kind of regulation system operation event rule analysis method, it is related to electric power system technical field.This method is carried out data processing by operation alarm data, obtains the characteristic attribute of operating state;According to the feature attribute, graph coloring is carried out on knowledge graph, and colored knowledge graph is generated;According to the subgraph mining algorithm of frequent subgraph, subgraph mining is carried out on colored knowledge graph, and multiple frequent subgraphs are obtained;According to the frequent subgraph, reverse calculation is carried out, and the alarm sequence constituting event is obtained;According to the center degree algorithm, each frequent subgraph is calculated, and the center degree of frequent subgraph is obtained;Based on the center degree of multiple frequent subgraphs, root cause frequent subgraph is obtained;The alarm sequence and root cause frequent subgraph are analyzed, and analysis result is obtained;Based on analysis result and regulation operation procedure requirement, typical event rule is generated.It can realize when facing mass data, saves manpower processing cost, avoids misjudgment, can improve the efficiency of mining event rule.

To provide a vibration neural network circuit device for solving a graphcoloringproblem by allowing a plurality of oscillators coupled by a capacitor or a resistor to detect an edge or to indicate colors of at least two graphs for an input graph.SOLUTION: In the vibration neural network circuit device 700 using a gated diode-based oscillator, phase differences between the voltage VIN1 and the voltage VIN2 may occur due to time differences between the voltage VOUT1 and the voltage VOUT2 input to at least two gated diodes constituting at least two oscillators 701 and 702, and thus colors of at least two graphs with respect to input graphs of a graph coloring problem may be represented based on the phase differences over time.SELECTED DRAWING: Figure 7A

Disclosed are a data communication system, an encoder logic and a decoder logic provided therein, and an encoding method and a decoding method using same. An encoder logic provided in a data communication system, which drives link units composed of four transmission lines using PAM4 signals, respectively, and uses 24 state symbols, in which the sum of PAM4 signals is 0 and the results of six comparators do not overlap, for communication by using graph coloring theory, and generating signals for driving a PHY of a communication unit that receives and encodes data to be transmitted and transmits a state symbol signal comprises: a transmission initial position setting module for setting, as a new position, a specific position set as an initial position in a state transition diagram which has 24 state symbols and in which the relative distances between the respective state symbols are defined as conversion symbols X, Y, and Z; a data input module which receives transmission data from a transmission data stream; and a transmission state determination module configured to check whether the transmission data satisfies one of a plurality of transmission conditions to determine a corresponding state and set the new position.

The invention relates to a color draft pattern coloring processing method and device, computer equipment, a computer readable storage medium and a computer program product. The method comprises the steps of obtaining a target line draft graph to be colored and a reference line draft graph corresponding to a reference color draft graph from a line draft graph sequence corresponding to a target object; with the reference color draft graph as a reference, coloring the target line draft graph based on the time information of the target line draft graph and the reference line draft graph in the line draft graph sequence to obtain an initial color draft graph corresponding to the target line draft graph; determining a first area contained in the corresponding initial color draft image based on the closed area in the target line draft image, and determining a second area contained in the corresponding reference color draft image based on the closed area in the reference line draft image; and performing color correction on a target first area matched with the target second area in the first area based on the area image of the target second area in the second area to obtain a target color draft image corresponding to the target line draft image. By adopting the method, the coloring accuracy can be improved.

A method may include: (1) generating, by a classical computer program executed by a client electronic device, a pseudorandom graph having a depth, a number of nodes based on a number of qubits in a quantum computer, and edges between the nodes; (2) creating, by the classical computer program, a coloring of the graph such that no two edges that share a node have the same color; (3) creating, by the classical computer program, a graph coloring layer for each color that includes edges with that color; (4) generating, by the classical computer, a quantum circuit from the graph coloring layers; (5) estimating, by the classical computer program, a cost of validating the quantum circuit; (6) determining, by the classical computer program, that the cost is acceptable; and (7) saving, by the classical computer program, the quantum circuit in response to the cost being acceptable.

The invention provides a light wave signal distribution method, device and system, and is applied to the technical field of optical communication. According to the method, the distribution problem of light wave signals is converted into the dyeing problem of the conflict graph corresponding to the light wave signals, and then the graph dyeing problem is solved by using a related algorithm model to obtain the dyeing scheme of the conflict graph. And the dyeing scheme of the conflict graph corresponds to the light wave signal distribution scheme of the light wave signal, so that the light wave signal distribution scheme can be obtained. Based on the method, the distribution of the light wave signals in the optical switching architecture can be automatically calculated by the equipment, manual planning is not needed, and the planning efficiency of a light wave signal distribution scheme in the optical switching architecture can be greatly improved.

The invention discloses a satellite communication access method, which comprises the following steps that: a user sends an access signaling to a satellite in a time frame access stage of the satellite, and completes initial access according to a beam selection strategy; the time frame comprises the access stage, the channel allocation stage and the communication stage; the satellite carries out channel allocation on all beam services according to the number of users newly accessed by each beam service in the access stage of the current time frame; wherein channel allocation is modeled as a coloring problem of a graph theory, and node coloring is determined by utilizing a Welsh-Powell algorithm based on node weights, so that channel allocation is realized; the satellite sends a channel allocation result of the beam service to the accessed user of each beam service, and allocates a corresponding communication time slot for the accessed user; and the user completes data transmission in a communication stage according to the channel corresponding to the accessed beam service and the allocated time slot. According to the invention, interference between beam services can be reduced, and user communication quality is improved.