62 results about "Graph coloring" patented technology

Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node.

An improved method is provided for performing register allocation in a compiler. This method determines the allocation of a plurality R of registers of a processor for use during the execution of a software program. The register allocation process is treated as a graph-coloring problem, such that an interference graph is constructed for the software program, the graph is simplified, and an R-coloring the interference graph to the extent possible is attempted. Then, spill code is inserted in the software program each for each uncolored node of the graph, a new interference graph is constructed, and the process is repeated. During the simplification process, nodes with degree greater than or equal to R are removed from the graph in an order dictated by a spill cost metric. During the coloring process, these same nodes are reinserted in the graph in an order dictated by reapplying the spill cost metric.

The feasible solution of a large number of non-player character (NPC) problems in engineering practice is acquired by a few approximation algorithms, so a graph coloring-based frequency allocation algorithm is to acquire the approximate optimal solution of the problems on the premise of a plurality of limiting conditions. The invention provides the specific steps of the graph coloring-based frequency allocation algorithm.

The invention discloses an indoor human body detection method based on a 3D (three-dimensional) point cloud image. The method includes the steps of firstly, segmentation and clustering based on the 3D point cloud image, secondly, non-human-body-region filtering and thirdly, human body region detection. According to the method, firstly, most of filtering is performed by the aid of spatial geometrical information so as to decrease a region to be processed truly to the minimum; secondly, algorithms in different subdivided fields are combined, and both a graph coloring algorithm in a graph theory and a support vector machine training method in the field of computer vision are used. By combining the algorithms, the indoor human body detection method is a universal human body detection method which is effective and low in computation complexity.

The invention discloses a frequency domain resource distribution method based on graph coloring in an ultra-dense network. The frequency domain resource distribution method comprises the following steps: reflecting a disturbed condition between small stations by utilizing a disturbance relationship graph; and coloring the disturbance relationship graph by utilizing a multiplexing algorithm based on a conventional graph coloring Brelaz algorithm, and distributing sub-band for each user according to the coloring results, thereby achieving a purpose of reducing the disturbance between the small stations. The method disclosed by the invention can be used for remarkably reducing the disturbance between the small stations, so that the total throughput and edge throughput of the system are increased.

The invention discloses a distributed graph coloring algorithm based on Pregel. The distributed graph coloring algorithm comprises the following steps that a random number as a weight value is respectively assigned to all points in a graph G; a color value of 1 is assigned to a vertex with a degree of 0, that is, the vertex has no edge to be connected with other vertices; the current color value is initialized to 1; the Pregel model is used for finding an independent set S, and three schemes are included; the current color value is assigned to any vertex v in the independent set; the colored vertices are removed from the graph G, and the color value is increased by 1; the step 4) to the step 6) are executed again until all points in the graph G are colored. The distributed graph coloring algorithm adopts the Pregel model suitable for large-scale graph calculation to improve efficiency of a parallel graph coloring algorithm. Based on an idea of finding the maximum independent set, graphcoloring processing is performed on large-scale graph data, and the purposes for reduction of graph coloring algorithm time and the number of colors required for coloring are achieved by means of introduction of optimization strategies.

The invention discloses a method for discovering small stations based on graph coloring in an ultra-dense wireless network. The method comprises the steps that the number of small station groups, namely the available color number Ncolors, is determined by an operator; a multiplex distance dreuse which is as big as possible is found under the premise that the used color number is not larger than the Ncolors; an interference relation graph is established according to the dreuse, and a Brelaz algorithm is used for coloring; the small stations are grouped according to coloring results, and all groups of small stations are made to send synchronous signals in turn; when network topology changes, the interference relation graph is reestablished, coloring is conducted again, the small stations are regrouped, and the small stations are made to send synchronous signals in turn according to the new groups. According to the method, the small stations are grouped, the interference of the synchronous signals of different small stations is reduced; the interference relations between the small stations are reflected through the interference relation graph, so that the small stations which interfere with each other seriously are prevented from being distributed in the same group, and the interference between the small stations is further reduced; the probability that UE discovers weak small stations is improved, and the number of the small stations discovered by the UE is increased.

A computer, computer compiler and method for reducing the number of interferences between variables during graph coloring while maintaining the possibility that the instructions will be executed in parallel. A compiler, which converts into a machine language the source code of a program written in a programming language and optimizes the program includes: a directed acyclic graph DAG analysis unit 11 for constructing and analyzing a DAG for an instruction in a program to be processed; an interference graph construction unit 12 for employing the analysis results to construct an interference graph representing the probability that an interference will occur between variables used by the instructions; and a graph coloring unit 13 for allocating registers for the instruction based on the interference graph that is constructed.

The invention discloses a dynamic frequency multiplexing method in cloud wireless access heterogeneous network architecture. The cloud wireless access heterogeneous network comprises a macro far end radio frequency head, a micro far end radio frequency head, a base station resource pool and a high-speed switching structure, and is characterized in that the heterogeneous network and the cloud wireless access network structure are combined, a graph coloring-based frequency resource allocation method and a graph coloring-based frequency resource allocation adjustment method are adopted, two cells in the adjacent same layers or different layers in the heterogeneous network can be ensured not to use the same frequency band to avoid same-frequency interference, and allocation of spectrum resources is dynamically realized and adjusted so as to meet constantly-changing user number inside the cell according to the spectrum resource requirement amount changing along with the time in each cell. The dynamic frequency multiplexing method in cloud wireless access heterogeneous network architecture can be applied to a full-frequency band orthogonal frequency division multiplexing system, the utilization rate of the spectrum resources can be effectively improved, and the throughput of each cell is added.

The invention discloses a method for achieving dynamic frequency reuse under cloud wireless access network architecture. The method is characterized by being suitable for a full-frequency-band orthogonal frequency division multiplexing system. The cloud wireless access network architecture comprises a far-end radio-frequency head, a base station resource pool and a high-speed switching fabric. The base station resource pool comprises a base-band processing unit and a central management and scheduling module. The central management and scheduling module is used for distributing frequency resources to users in the central zone and marginal zone of each cell covered by a system respectively according to the service load of different zones of the cell, wherein when the frequency resources are distributed to the users in the marginal zone of each cell, a method based on graph coloring is adopted so as to guarantee that same frequency interference between the marginal zones of two adjacent cells can not occur and the utilization ratio of high-frequency-spectrum resources can be further improved. Compared with an existing cellular system, operation and maintenance cost can be effectively reduced, same frequency interference between the cells can be avoided, the utilization ratio of the high-frequency-spectrum resources can be improved, and the throughput of each cell can be improved.

The invention provides an interference coordination method based on resource allocation. The method comprises the following steps: 1) determining interference base stations for users; 2) determining an interference graph with the users as nodes according to the interference base stations; 3) and carrying out resource allocation by using a graph coloring method according to the interference graph. According to the interference coordination method provided by the invention, resources orthogonal to the interference base stations of the users are selected for the users so as to avoid inter-cell interference, and the number of resources allocated to the users and the priorities of the acquired resources are adjusted according to the QoS requirements of different users. The interference coordination method provided by the invention is a user-centered interference coordination method based on resource allocation, the proportions of the acquired resources of cells are adjusted according to actual user needs of the cells, and thus the problem of inter-cell load imbalance in a super dense cellular network can be solved.

The invention relates to a graph coloring node operation method based on the ring-shaped DNA, comprising the following steps of obtaining the coloring scheme congregation of a vertex corresponding to a graph according to given color kinds; finding out two edges with undetermined vertex colors from edges with nonadjacent but connected vertex digit sequences according to the coloring scheme congregation of the vertex; and deleting and untying the two edges with undetermined vertex colors by the operation of the ring-shaped DNA and a backtracking method to obtain the true solution set of vertex coloring schemes. The technical proposal of the invention is to explain graphs, avoids the molecule recombination by concurrency of the life-form operation of the DNA operation and based on the characteristic of the operation of the ring-shaped DNA, and gradually obtains the vertex coloring scheme congregation for a coloring graph, thereby organically combining an optimized operation method, DNA sequence codes, various biochemistry operations, solution detection problems, solution space scales and the like, and enhancing the solving rate of the coloring problem of a graph.

The invention discloses a method for allocating registers for a mixed length instruction set. By less revising the conventional graph coloring register allocation method, namely fully utilizing the characteristics of a mixed coding instruction set, codes with higher code density are generated. The method has the characteristics of simplicity, practicability and high in reliability.

The invention discloses a D2D resource allocation method based on graph coloring. The method comprises the steps of assuming that all D2D users in a system multiplex channel resources of the same cellular user and take threshold power as transmitting power; obtaining an unignorable undirected mutual interference graph, wherein the interference value is the weight of each edge of the graph; dividing all D2D users in a cell into a plurality of clusters with relatively low mutual interference degrees through a graph coloring method; the users with the same color are the same cluster; enabling theD2D users in each cluster to multiplex the same cellular channel, acquiring a cellular channel capable of being multiplexed by each cluster, calculating the maximum throughput for matching all the cellular channels with the D2D clusters in pairs one by one, setting the throughput of the D2D clusters and the cellular channels which cannot be matched to be zero, and acquiring a throughput matrix; and solving an optimal matching matrix for maximizing the system throughput, allocating channel resources to the D2D cluster according to the matching matrix, and taking a power solution obtained by using a Lagrangian multiplier method as the transmitting power of the D2D pair.

The invention discloses a frequency spectrum polymerization method assisted by time division long term evolution (TD-LTE) Femtocell database using TV White Space (TVWS). In order to achieve the frequency spectrum polymerization method, the invention further provides a centralized control entity compatible with a database structure suggested by the federal communications commission (FCC) and a modeling approach considering graph coloring model in the process of frequency spectrum polymerization. The frequency spectrum polymerization method takes full advantage of uneven cochannel interference relationship between family base stations (FBSs). Database-assisted Spectrum Aggregation Algorithm (DSAA) is applied to the graph coloring model in the process of considering frequency spectrum polymerization, and therefore the Femtocell is enabled to obtain good system access performance on aspects of general system access bandwidth and the number of the FBSs system access.

The invention provides an energy-efficient wireless sensor network distribution type link scheduling controller based on a graph coloring method. Through constructing conflict graphs in two hop neighbor scopes to any node, a sequence of time slot distribution is determined according to a priority of each link in an interference pattern and an interference degree. The line with a high priority acquires a priority scheduling opportunity. If the priorities are the same, scheduling is performed according to the interference degrees. The priority of the link and the interference degree are determined respectively through the number of connection links with the distributed time slots and the number of the interfered links. Because the adjacent time slots are distributed for the node, unnecessary state conversion of the node can be reduced so that network node energy consumption is reduced too.

The invention relates to a register allocation method for a super block in a dynamic binary translation system. The method is a simplified graph coloring register allocation method according to the characteristic of the super block of the binary translation system. An interference graph is constructed by activity information of variables in the super block; and then a register allocation problem is converted into an interference graph simplification problem to make an object code of the super block use an object platform register maximally and has the characteristic of high object code execution efficiency. During the allocation, the variables in a basic block are allocated with registers according to the different demands in the field of dynamic binary translation; and the allocation comprises common allocation, mandatory specified register allocation, and mandatory non-specific register allocation. The register allocation method has the characteristic of retargetability and the characteristics of good allocation effect and low allocation expense for the super block. The register allocation method is suitable for a plurality of object platforms, particularly for a multi-source multi-objective binary translation platform.

The invention discloses a graph coloring theory based method for eliminating interference among coexisting Wireless Body Area Networks (WBANs). The method comprises two stages of interference graph construction and graph coloring, wherein in the stage of interference graph construction, firstly, an uplink communication mode of a source node and a home network internal coordinator is determined tobe a direct transmission mode or a mode of carrying out forwarding by utilizing a relay; and then with reference to an interference node at the longest distance from a receiving end corresponding to the source node, an interference set is established for the source node by measuring interference signal intensity of the interference node. In the stage of graph coloring, different time slots are mapped into different colors, and firstly, inter-network interference is relieved by allocating different colors to the nodes interfering with each other; and then according to the diversity of data acquired by the sensor nodes, various colors are allocated to the nodes with a high requirement for a data transmission rate so as to further improve Quality-of-Service (QoS), resource utilization rates and network capabilities of the networks.

A system, method, and computer program product are provided for performing graph coloring. In use, a graph with a plurality of vertices is identified. Additionally, the plurality of vertices of the graph is categorized, where the categorizing of the plurality of vertices is optimized.

The invention provides a GPU-based dynamic graph coloring method. The method comprises the following steps: converting an original undirected graph into a directional graph; updating directional diagrams after multiple deletion and inserting operation is carried out in batches; storing outer adjacent information of the directional diagram in a compressed sparse row CSR mode, storing inner adjacent information of the directional diagram in a compressed sparse column CSC mode, and transmitting the outer adjacent information and the inner adjacent information to a GPU global memory; judging whether the queue is empty or lower than a threshold value, if not, partitioning a subgraph formed by the to-be-updated node by using a greedy coloring method, and transmitting a partitioning result to the GPU; if yes, processing by the CPU end; carrying out parallel RC-processing of nodes in each region according to partitioning results Hybrid coloring. According to the method, the parallel processing capability of the GPU can be fully utilized, hybrid partitioning design is carried out on the nodes to be processed, the concurrency is improved, and the correctness and the consistency of a coloring result are ensured.

The invention discloses a QoS-based clustered channel allocation method in a D2D communication system. According to the QoS-based clustered channel allocation method, the concept of user satisfaction degree is introduced for better satisfying different QoS requirements of D2D users in the situation that the D2D users multiplex cellular user downlink resources, and a graph coloring method is adopted for allocating channels to the D2D users. The QoS-based clustered channel allocation method comprises the specific steps of: firstly, constructing an interference pattern among the D2D users; secondly, establishing an available color list of the D2D users while guaranteeing the QoS requirements of cellular users; and finally, defining effectiveness of using different colors by the D2D user based on user satisfaction degree and system fairness, and clustering the D2D users based on the same, wherein the users in the same cluster can share a cellular user channel. The QoS-based clustered channel allocation method can improve the satisfaction degree of the D2D users while effectively guaranteeing the QoS requirements of the cellular users, and takes the fairness among the users into account.

The invention provides a spectrum management method and system based on a smart grid double-layer cognitive network architecture. The method comprises the following steps: receiving a spectrum conversion request, performing spectrum allocation between power information terminals in the smart grid double-layer cognitive network architecture by using a graph coloring part of an interference reduction type graph coloring-simulated annealing fusion algorithm, obtaining real-time spectrum information, establishing an available spectrum matrix and an inter-cell spectrum interference matrix, establishing a local solution list, calculating the optimum spectrum allocation through a simulated annealing part of the interference reduction type graph coloring-simulated annealing fusion algorithm according to the established local solution list and the inter-cell spectrum interference matrix, and feeding back an optimum spectrum allocation result to the power information terminals. During the entire process, by taking the interference reduction type graph coloring-simulated annealing fusion algorithm as a spectrum management allocation core, an optimum spectrum allocation strategy of a smart grid double-layer network can be quickly acquired, and spectrum resources in the network can be fully used.

The invention discloses a container collaborative arrangement method based on graph coloring. The method comprises the steps that based on a load conflict avoidance rule of graph coloring, a vertex coloring method in a graph theory is adopted to map container services into an adjacent matrix, and the adjacent matrix means an arrangement scheme of conflict avoidance of a container set; performancemonitoring of a container cluster is realized by introducing heartbeat messages, and containers are initialized and cooperatively placed according to real-time monitoring conditions; a dominant resource type of the service is evaluated and calculated within a specific time; and a resource depletion early warning threshold is set, the container is migrated to the optimal node according to the attribute of the dominant resource, and finally the original container instance is terminated to release the resource. According to the method disclosed by the invention, the problems of port conflicts, container copy conflicts, resource conflicts and the like in container scheduling are solved by cooperatively considering the resource heterogeneity of the memory, the CPU, the network I / O, the block I / O and the like of each node of the container cluster, and the fault tolerance and the reliability of container placement are ensured, so that the resource utilization rate and the application programperformance are improved.

Line system design techniques are provided for use in performing routing and coloring operations associated with one or more demands. In one aspect of the invention, a technique for designing a line system comprises the following steps / operations. A set of one or more demands is obtained for use in computing the line system design. The line system design is then represented as a graph in accordance with a graph coloring operation wherein colors represent bandwidths such that bandwidths are assigned and the one or more demands are routed so as to attempt to achieve a minimum total design cost. The line system being designed may be an optical line system.

The invention discloses a hybrid heuristic graph coloring method, which integrates a probability learning strategy and a hybrid evolution algorithm, and performs hybrid evolution based on two coloring grouping schemes. And before hybrid purification, according to a conditional grouping strategy, a probability learning strategy is introduced according to a coloring distribution similarity degree of two coloring grouping schemes to carry out coloring dynamic adjustment, so that better balance exists between rapid convergence and population diversity maintenance, and while the relatively high solving efficiency of the image coloring grouping scheme is maintained, the image quality is improved. And the resolving precision is further improved, so that the resolving precision and the resolving efficiency of the graph coloring problem are better balanced and considered.

The invention discloses a method for drawing a benefit map of every ten thousand yuan of power sale quantity of a power grid asset unit. According to the method, through combination of scientific classification of the asset unit, data map series layers of the asset unit are established; and evaluation index values are assigned for "every ten thousand yuan of asset power sale quantity" of different apertures of asset units, the evaluation index grades are classified and graph coloring definition is performed on different grades of evaluation index, and the layers of different apertures of asset units are colored separately, so that benefit maps of "every ten thousand yuan of asset power sale quantity" of different apertures of asset units are obtained. The method is convenient and scientific.

The invention relates to a D2D communication resource allocation method for improving graph coloring, and the method comprises the following steps: S1, calculating the signal-to-interference-and-noiseratio of cellular users and D2D users; S2, calculating a safety distance di between D2D users; S3, determining a D2D user set of which the D2D users can share the same channel; S4, constructing a D2Duser multiplexing relation graph; S5, grouping the D2D users according to an improved graph coloring principle in combination with accumulated interference among the D2D users; and S6, allocating channel resources to each multiplexing group by using a Hungary algorithm; According to the method, the throughput of the cellular system and the access rate of the D2D users are improved, the resource utilization rate is effectively optimized, the interference between the D2D users can be reduced, and the service quality of D2D communication is ensured.

The invention relates to an anti-collision graph coloring two-stage distribution method for an RFID reader. The method comprises two stages of graph coloring distribution schemes which are sequentially executed in each round and are respectively a graph coloring first-stage distribution scheme and a graph coloring second-stage distribution scheme. The first-stage graph coloring allocation scheme relates to a color time slot initialization stage and a time slot resource competition and back-off judgment stage, and the second-stage graph coloring allocation scheme relates to an estimation and reallocation stage of idle time slots; according to the method, the anti-collision problem of the RFID reader is converted into the coloring optimization problem of the RFID reader; through mutual coordination and communication, the RFID readers which collide with each other can negotiate the allocation of time slot resources friendly, and the secondary collision of the RFID readers is reduced. theRFID reader estimates available idle time slots according to the distribution of the neighbor RFID readers, and more time slot resources are obtained in a competitive manner, so that the efficient utilization of the time slot resources is realized, and the throughput rate and the label identification rate of the RFID reader network are maximized.