59 results about "Coloring algorithm" patented technology

Multi-hop wireless networks have benefits in coverage extension and throughput improvement. In this multi-hop wireless networks, multiple channels are available to improve system performance through concurrent transmission. In this invention, a multi-channel assignment method is described. For efficient utilization of multiple channels considering different channel condition at each node, the multi-channel assignment method is comprising the steps of: a) gathering neighbor relay node information by relaying control messages which include node information, such as the list of neighbor nodes, the preferable channel list of nodes, and the number of available radio interfaces; b) connectivity graph construction, by generating the multi-graph connectivity graph from the gathered node information; c) conflict graph composition, by generating the multi-channel conflict graph which exhibits interference among links from the multi-graph connectivity graph; and d) multi-channel assignment, by allocating channels to links considering channel interference by referring the multi-channel conflict graph using the list coloring algorithm.

The invention discloses methods and apparatus that facilitate efficient querying of tables referencing semistructured data such as digraphs and other domains with complex grouping structure. The invention methods enable meaningful indexing of the tables as well as rewriting of queries with respect to the structures. Dynamic schema extraction using proper coloring algorithms is disclosed that structures the semistructured data in such a way that complex set operations and grouping are replaced with traditional relational joins. This enables a relational database system to harness its entire query optimizing capability when querying tables referencing semistructured data.

A method for preparing data to create two or more masks required to print a desired feature pattern with a multiple mask technique. In one embodiment of the invention, a target feature pattern is separated into two or more groups or data layers with a coloring algorithm. Coloring conflicts or adjacent features that are within a predetermined distance of each other and are assigned to the same group or data layer are identified. Cutting boxes are added to a feature to divide a feature into two or more smaller features. A coloring algorithm is re-applied to the layout including the cutting boxes to assign the features into different groups or data layers. Data in each group or data layer is used to define a mask to print the target feature pattern.

The invention relates to the technical field of wireless communication and specifically to a broadband wireless ad hoc network MAC-layer protocol method based on TDMA. The method comprises a step 1 of selecting a central control node in a network; a step 2 of enabling each node to send a control signaling at a control time slot thereof, wherein the control signaling comprises a neighbor state table and a time slot distribution table; a step 3 of enable each node to perform monitoring at a control time slot not belonging to the node; a step 4 of when each node acquires the whole-network topological structure information after a little interaction, enabling the central control node to distribute time slots according to the whole-network topological structure by using an improved sequence vertex coloring algorithm; a step 5 of enabling all nodes in the network to determine the service time slots of their own according to the time slot distribution table and to transmit data packets at the control time slots of their own; a step 6 of applying for a requirement at an access time slot if a new node get access to the network or a node is to exit the network; and a step 7 of jumping to the step 2. The method achieves time slot multiplexing and dynamic distribution.

An online algorithm exchange is presented herein. The online algorithm exchange provides access to a plurality of coloring algorithms from any number of developers. Users can select a particular algorithm for use as well as specify particular color measurements as inputs thereto. The color measurements can be selected from a database at the algorithm exchange, or provided by the user from a client terminal.

The invention discloses an asynchronous graphic data processing system based on a GPU. The asynchronous graphic data processing system comprises achieving a combining coloring algorithm for changing an original single and heuristic coloring algorithm to the combining coloring algorithm; a data preprocessing strategy for changing an original preprocessing partition method based on a vertex degree to a mode based on vertex coloring distribution; and an asynchronous processing executing engine which changes the executing mode of a processing engine from a synchronous BSP mode to an asynchronous processing mode and achieve lockless asynchronous programming on the GPU in combination with a combining coloring algorithm module. In the asynchronous processing executing engine, an iteration processing module and a data flow executing module are achieved and the bandwidths and computing capabilities of a CPU and the GPU are managed and used in a unified manner. According to the graphic data processing system based on the GPU, the asynchronous processing executing engine may greatly accelerate graphic algorithm convergence and solve problems of synchronous waiting expense and asynchronous programming lock expense on the GPU so as to improve the graphic data processing capability of the GPU.

The invention discloses a distributed graph coloring link dispatch scheme of a wireless sensor network based on a graph coloring algorithm. According to the scheme, firstly, partial interference information is obtained through packet switching among nodes; secondly, a graph vertex coloring analysis is carried out on a generated localized network conflict graph; thirdly, the conflict-free time slot allocation of a wireless sensor network link is obtained. To improve the coloring success rate, two mechanisms are provided. One mechanism is a broadcast safeguard mechanism for improving the broadcast information delivery rate, and the other mechanism is a conflict processing mechanism for solving the coloring conflict problem. According to the distributed link dispatch scheme, the problems of packet loss, delay and the like caused by multi-hop transmission are solved, and the transmitting energy consumption is reduced. The result of the network simulation shows that the distributed graph coloring link dispatch scheme has the advantages over a conventional link dispatch method on the aspects of energy consumption, the space reusing rate, the packet loss probability and the like.

The invention discloses a spectrum allocation method based on graph coloring and an analytic hierarchy process in cognitive radio. The method comprises the following steps: 1, establishing a recursion order hierarchy structure; 2, constructing paired comparison matrixes; 3, performing single hierarchical sequencing and checking the consistency; 4, performing total hierarchical sequencing, i.e., calculating the weight of relative importance of all factors on each layer relative to the highest layer from top to bottom to obtain a weight sequence of each scheme in the bottom layer relative to a target so as to select a scheme, and checking the consistency too in the total sequencing process, wherein the relative weights of all available spectrum resources about the total target can be normalized into a weight vector by the total hierarchical sequencing, and the spectra corresponding to the maximum value are selected for next allocation in the algorithm; and 5, allocating the selected optimal spectra by using a coloring algorithm in the graph theory. A sequence of spectrum qualities is obtained by analysis and decision on multiple attributes of all current available bands, so that a reasonable spectrum access strategy is provided.

The invention discloses a power network topology dynamic coloring algorithm which comprises the following steps of: defining active N-port elements and passive N-port elements into substation islands which are charged or not and substation islands which display a charged color or not; abstracting a power network into connection between the active N-port elements and the passive N-port elements, which is carried out by switching equipment; starting a computing service process and maintaining threads of which the number corresponds to the number of the substation islands; and when the variation of a power generating state of each substation island, a switching state associated with the substation island or a charged state of the adjacent substation island is detected, executing the thread for once to obtain the charged state of the substation island. The algorithm disclosed by the invention is irrelevant with a network topology structure; a network topology dynamic coloring function and a network topology analysis function are decoupled; different charged algorithms are selected for the properties of the substation islands; and times of backtracking and calculation are reduced. The network topology dynamic coloring of a power grid with a complex structure can be realized. The power network topology dynamic coloring algorithm has excellent practicality, strong expansibility and rapidity.

The invention discloses a three-dimensional map line element note automatic placing method, can be applied to automatically placing and adjusting writing nodes in a three-dimensional geographic scene. The method comprises the following stages of 1, pretreatment stage: attaching note reference lines to the surface of the earth, and building a note reference line layered tree structure; 2, a parallel traversal screening stage: dynamically building view point related reference lines, and executing shielded cutting based on a shadow map and monotonicity segmentation of the reference lines; and 3, a screen space note confliction processing stage: projecting the reference lines to a screen space, processing mutual confliction relation between the notes, and generating a renderable note object. By dynamically building the view point related note reference lines, the note automatic placing method can adapt to different view distance and variations of the viewing angle, and reflect the trend of line elements; in addition, shielding of surface features on the notes is avoided due to shielded cutting based on the shadow map, and the problem of confliction between the notes is solved by using a non-backtracking graph coloring algorithm in the screen space.

The embodiment of the invention discloses an up-link interference coordination method and a base station. The up-link interference coordination method comprises the following steps of: obtaining channel condition changing parameters in a cell according to channel information obtained from terminals, wherein the channel condition changing parameters reflect an up-link interference condition between two adjacent sections of the cell; judging whether the channel condition changing parameters in cell exceed preset threshold values; and if so, redistributing the channel resources of the terminals by adopting a coloring algorithm according to an up-link interference degree between two terminals so as to reduce up-link interference between the two adjacent sections. According to the up-link interference coordination method, the unnecessary up-link interference between the two adjacent sections is eliminated, and the purpose of maximizing the throughout of a whole network is achieved.

The invention provides a configuration method of a frame structure of a digital multimedia wireless broadcasting system. The configuration method comprises the steps of: transmitting broadcasting frames in different types on multiple carrier frequencies by the digital multimedia wireless broadcasting system, calculating frame structure parameters based on initial parameters of the digital multimedia wireless broadcasting system to obtain a distribution pattern of a multi-carrier-frequency frame structure; adjusting the start time of an initial frame of each carrier frequency; aiming at a broadcasting frame in each type, building a frame structure topological graph by utilizing a graph method, coloring the frame structure topological graph by using a coloring algorithm and judging if the coloring is effective; if not, adjusting the parameters of the frame structure, rebuilding the frame structure topological graph and coloring; if so, finishing the configuration of the frame structure. The configuration method of the frame structure of the digital multimedia wireless broadcasting system supports mixed transmission of the broadcasting frames in different types, so that frequency-hopping reception of a wireless broadcasting signal by a single-tuning receiver is realized and a frequency diversity gain is obtained; meanwhile different demands of data of wireless broadcasting frames in different types on a transmission flow are satisfied, and a statistical multiplexing gain is obtained.

The present invention relates to the technical field of wireless communication and of mobile communication, and more particularly to a method for spectrum resource allocation and interference avoidance of femtocell in a heterogeneous environment consisting of macro cell and femtocell, and specifically to a spectrum allocation method based on interference suppression and user difference bandwidth requirements. According to the spectrum allocation method based on interference suppression and user difference bandwidth requirements of the present invention, spectrum resource can be allocated reasonably according to the priority level of bandwidth requirements in combination with graph coloring algorithm and chromaticity preference algorithm. In this manner, in-layer interference among femtocells and cross-layer interference among femtocells and macro cells can be effectively suppressed, the difference bandwidth requirements of femtocell users can be satisfied, and the efficiency of frequency utilization and the whole throughput of system can be also optimized to the maximum extent.

The invention discloses an encoding and reconstruction method of three-dimensional model topological data robust transmission in a wireless network. The encoding and reconstruction method includes the steps of firstly, encoding three-dimensional model topological data at a server terminal: particularly, traversing top points of a three-dimensional model according to a certain rule, and obtaining traversal serial numbers, degree information and adjacent point information of the top points; secondly, coloring the top points according to an improved sequence coloring algorithm and the traversal serial numbers of the top points; thirdly, carrying out grouping on the model according to colors, and enabling the top points in the same color to serve as a group; finally, compressing the groups through Huffman coding, and carrying out topology reconstruction on the three-dimensional model at the server terminal: particularly, after the groups are received, ranking the received top points according to the serial numbers from the small serial numbers to the large serial numbers, and then reconstructing the model topological structure based on a value driving decoding method. According to the encoding and reconstruction method, the good reconstruction effect on the three-dimensional model during network transmission with the high packet loss probability can be obtained through the effective model topological data encoding and client terminal reconstruction technology.

The invention discloses a random graph neighboring point and distinguishable edge coloring algorithm. The random graph neighboring point and distinguishable edge coloring algorithm comprises a storage medium. The storage medium comprises a program of a defined data structure, a target function construction program step and a dyeing algorithm; the algorithm comprises the steps that firstly, dyeing constraint conditions are determined, and then target functions and decision functions are abstracted, so that a determination equation and a total target function are formed, and finally an algorithm and a dyeing result are given; compared with a conventional algorithm, the problem of the dyeing limitation under the single condition is solved, distinguishable dyeing can be achieved under the multi-constraint condition, and the purposes of computer communication, timetable arrangement, task scheduling, storage distribution and other combination optimization are achieved.

The invention discloses a medical band-aid flaw detection method based on YOLO v2-tone. The methodethod based on YOLO v2-. The method for detecting the defects of the medical band-aid of the tiny comprises the following steps: acquiring image data of the band-aid by using a camera, and making a VOC format data set; T; using the made data set to train a YOLO v2-line model until the loss function isreduced to 0.1-0.2, and storing the weight modelraining YOLO v2-with the made dataset Reducing the loss function to be 0.1-0.2 by the aid of the tiny model, and storing the weight model; returning the specific coordinate position of the band-aid image by using the trained YOLO v2-ty model, and cutting a target band-aid according to the coordinateYOLO v2-USING TRAINED YOLO v2- Returning a specificcoordinate position of the band-aid image by the tiny model, and cutting a target band-aid according to the coordinate; T. Taking the pixel size between 10 * 10 <-30 > * 30 at the center of the cut band-aid, calculating the similarity between the cut target and the white area with the same size by utilizing a single-channel color algorithm, and adopting an Euclidean distance as a similarity calculation formula; a threshold value is set according to the environment, the value range of the threshold value is 3500-5000, if the Euclidean distance calculation result is larger than the value, no flux core exists, and the value smaller than or equal to the value is set to be provided with the flux core. The problem that medical bandages on an existing production line consume a large amount of manpower and financial resources can be effectively solved, and the flaw detection efficiency can reach 40 times per minute.

The invention discloses a method for detecting light source calibration of a standard light source coloring observation box. The method comprises the steps of: sampling XYZ data of a light source through an externally connected spectrum analyzer before the coloring observation box leaves a factory; sampling RGB data of the light source through a color sensor arranged in the coloring observation box; calculating a matrix coefficient between the RGB data and the XYZ data; calculating the RGB data sampled through the color sensor and the matrix coefficient after the observation box leaves the factory and obtaining XYZ data; calculating the XYZ data and obtaining color temperature data; and calibrating the light source through the color temperature data. The measurement of the color temperature is realized by using the color sensor and a method combining a color algorithm and the calibration. In comparison with the spectrum analyzer, the method of the invention has low cost, and the measurement precision of the color temperature is accurate. The color temperature measurement in the low cost can be realized, and thus whether there is an error in the light source color temperature can be monitored in real time. If the error exits, the debugging must be performed in time, and the accuracy of the color measurement of the coloring observation box is improved.

The invention provides an implicit finite element parallel method based on two-level domain decomposition. The method comprises steps: a solving procedure of implicit finite element nonlinear analysisis established; second-order domain decomposition is used to establish the parallel solving procedure of implicit finite element nonlinear analysis; the preconditioner is selected and the LPCG solveris established to solve the equilibrium equations of Newton iterative method; a correlation diagram is constructed; the weighted balanced coloring algorithm is used to parallelize the preconditionerand realize the overlap of computation and communication. The invention has the advantages that each processor can carry out fine-grained parallel computation by adopting two-level regional decomposition; combining unstructured correlation graph with weighted coloring algorithm, the parallel computation within and between regions can be well realized. The HW preconditioner can reduce the computational time and has better performance.

The invention provides a satellite heterogeneous network resource allocation method based on graph theory. The method comprises the following steps: 1) carrying out grouping on users with different priorities based on service classification of application users; 2) carrying out resource allocation on the basis of priority grouping with service preference for reference, and specifically, carrying out allocation according to connection number of nodes, wherein the connection number of the nodes is the number of the nodes having same and available networks. The satellite heterogeneous network resource allocation method based on the graph theory is the maximum-return-oriented resource allocation method with cognitive user resource application amount, service priorities, network preference and network authorization user caused load change and the like being taken into overall consideration on the basis of combining a list coloring algorithm, a group allocation algorithm and a sensitive coloring algorithm in the graph theory, and thus the overall benefit of the system can be improved obviously.

The invention discloses a wireless sensor network routing method based on node redundancy and a graph coloring algorithm. The method comprises the following steps of S1, searching redundant nodes in a network and defining that the nodes covered by surrounding nodes with coverage rates 90% or above are the redundant nodes; through utilization of a monte carlo thought, randomly getting m*n points in a region with an area of m*n, wherein the number of the points falling into a to-be-calculated region is the area of the required region; S2, establishing a utility function as the basis for searching the maximum feasible set according to a graph theory, and through establishment of the utility function, striving to search the nodes with high residual energy, high link communication quality and short transmission distance as the nodes of a next hop; and S3, through utilization of a graph theory greedy algorithm, searching the maximum feasible set to determine a route. According to the method, the network energy balance and route effectiveness are taken into consideration, the energy consumption is integrally balanced, and the life cycle of the network is prolonged.