30 results about "Flooding algorithm" patented technology

A router executes a flooding algorithm. The router maintains a list of neighbors within an area data structure. When a new neighbor arises on an interface belonging to an area served by the router, the router updates the neighbor data structure describing that adjacency by linking it to a corresponding entry in the list of neighbors. Utilizing information contained in the list of neighbors, as well as information describing the types of interfaces used by the neighbors in the list, the router marks each interface data structure within the area as either flooding-active or flooding-passive. Marking of the interface is performed in connection with an interface election process that selects a flooding-active interface on the basis of, e.g., interface cost, giving preference to faster interfaces. Thereafter, link state protocol data units (PDUs) are sent to the neighbors over those interfaces marked as flooding-active.

The invention provides a long-distance concentrated ammeter reading system based on a flooding algorithm. The ammeter reading system is characterized by comprising a master ammeter reading station, a general packet radio service (GPRS) network, a concentrator and an electric carrier ammeter, wherein the master ammeter reading station and the concentrator are provided with GPRS modules and communicated through the GPRS network; and the concentrator and the electric carrier ammeter are communicated through an electric wire. By using the system, the disadvantages of the traditional ammeter reading mode are overcome, thereby completing functions such as data acquisition, measurement, transmission, settlement and the like, realizing functions such as long-distance reading, inquiry, payment, intelligent control and the like. The system has the advantages of small work load, large transmission data quantity, high veracity, low expenditure and the like; and a modern automatic technique is used for replacing manual management, thereby improving efficiency.

The invention belongs to the field of digital holographic microscopic measurement and relates to a rapid package removal method of a digital microscopic holographic phase diagram. The method includes calculating and obtaining a reappearing intensity image and a package phase diagram according to a fundamental principle of digital holographic microscopy, calculating residual point distribution of the package phase diagram, automatically setting threshold value of intensity according to intensity value distribution of the pixels in the intensity image corresponding to the residual points, considering a pixel region which is higher than the threshold value as a reliable phase area, considering a pixel region which is lower than the threshold value as a suspicious phase area, placing a intensity value in a normalized intensity image corresponding to the reliable phase area as number 1, keeping the intensity value corresponding to the suspicious phase area to be unchanged, establishing a novel quality guiding image, and finally, establishing a stack chain table flooding algorithm based on guidance of the quality guiding image. Operating rate of the rapid package removal method of the digital microscopic holographic phase diagram is more than 100 times faster than that of a traditional plug-in sequencing flood algorithm with quality image guide, and is even about 3 times faster than that of a branch cutting algorithm. The rapid package removal method of the digital microscopic holographic phase diagram is a phase package removal method applied to quasi real-time digital holographic microscopy.

The invention discloses a BP decoding method based on the Tanner sheet margin scheduling strategy. The Tanner sheet margin scheduling is adopted in a decoding process, and parallel transmission is performed to accelerate the decoding iteration speed. On a check node updating part, a diversity processing mode is adopted, when a verification equation is not tenable after several iterations, and a check node transmits information with all neighbor nodes so as to improve the reliability of the check node; when the verification equation is tenable, and the reliability of the check node is smaller than a reliability threshold, the check node only needs to perform information transmission with the previous w nodes smaller than LLR information, thereby reducing the partial computation complexity;the rest check nodes do not perform information transmission, so that the computation complexity of the algorithm is further reduced, the transmission of the LLR information along the edge is inhibited, and the BER performance is improved. The simulation results show that when the signal to noise ratio is 3.0dB, the computation complexity of the EDBP algorithm is only 42% of the BP algorithm, andthe computation complexity is reduced, and the BER performance of the EDBP algorithm is better than that of the Flooding algorithm.

The invention discloses a context-dependent non-uniform clustering routing algorithm. According to the context-dependent non-uniform clustering routing algorithm, the defect that clustering and route are isolated from each other by a traditional hierarchical routing model is overcome, information at a clustering stage is applied to a routing formation stage, set-up time of a network is largely shortened, and energy consumption of the network is reduced. Based on a clustering algorithm of a vote mechanism, the context-dependent non-uniform clustering routing algorithm optimizes energy consumption of an area, a time-sharing reversed flooding algorithm is used, and energy consumed by route discovery is largely saved. The context-dependent non-uniform clustering routing algorithm can be effectively applied to large-scale area monitoring, energy load balancing of the context-dependent non-uniform clustering routing algorithm is confirmed, node behavior is stable, and network lifetime is much longer.

The invention discloses a Bluetooth mesh routing method based on an improved flooding algorithm, and the method comprises the steps: obtaining the related information of a neighbor node through a datapacket in a network, determining a forwarding threshold value according to the related information, and limiting the number of forwarding nodes; determining the forwarding probability of forwarding data packet nodes according to the distance between the two nodes and the residual energy of the nodes, determining the forwarding waiting time according to the forwarding probability, and performing time-sharing forwarding; if repeated data packets are received again after any node sends one data packet, it is considered that transmission of the data packets is successful, otherwise, it is considered that the data packets are lost, and the node sends the data packets again until transmission is successful. On the premise of ensuring the transmission reliability, the network energy consumptionis effectively reduced and balanced, so that the method is applicable to a wider application scene, and the value of the Bluetooth mesh is further improved.

The invention discloses a human body slice image automatic segmentation method based on shared matting and ROI gradual change. The method comprises the following steps: S1, roughly doodling an interested area; S2, selecting an internal region A of the region of interest; S3, covering the region of interest and reading a boundary region of the region of interest; S4, defining a foreground region of the internal region A as a white part, defining a middle part as a gray part, defining a background region as a black part, and obtaining a tripartite graph of the region of interest; S5, obtaining a black-and-white mask of the region of interest by adopting a shared matting algorithm according to the tripartite graph information, and obtaining a foreground skeleton of the black-and-white mask by applying a refinement algorithm; S6, taking the foreground skeleton as a foreground graffiti of the next picture, and obtaining a tripartite graph of the next picture by adopting a flooding algorithm; and S7, repeating the steps S5 to S6 until all the pictures are processed to obtain black and white masks of the regions of interest of all the pictures.

The invention discloses a parameter distribution method based on a flooding mechanism. The method comprises that parameter distribution within an area is completed in a basic flooding algorithm, nodes connected to a satellite channel notify a distribution source node but not forward messages to the satellite channel at first, and the distribution source node selects a node which returns at first and forwards the messages to other areas via the satellite channel. The node is started and then requests a parameter file version from the network, the distribution source node returns a confirmation message of the parameter file version, and other nodes substitute replies after receiving the confirmation message. When versions are inconsistent, the node requests a parameter file from the neighbor, and nodes in consistent versions distribute parameters to nodes in inconsistent versions. The method supports cross-area network parameter distribution, IP messages can be transmitted via physical links instead of fixed network transmission, manual copy or route intercommunication, narrowband broadcasting-satellite channel resource is saved to the largest degree, network opening time is greatly reduced, and the network opening efficiency is improved.

The invention discloses a crawler technology based on a block chain system, which comprises the following steps of: 1, adding a public key open node on an existing node in a block chain network; step2, after a node in the block chain system is started, accessing a nearby public key open node according to self-starting configuration, and carrying out public key information registration on the public key open node; 3, after the crawler is started, searching for nearby public key nodes, and downloading cache public key node information; 4, performing data crawling according to the clue information; and 5, processing crawling of the nodes by the crawler in the system by adopting a flooding algorithm, setting TTL corresponding values, and when deep crawling is carried out according to clue information, and if the TTL set values are exceeded, ending crawling of the clues. The method is mainly used in a block chain system, greatly plays the storage characteristics of the block chain, and isbeneficial to the development of the block chain application.

The invention discloses a barrier lake flooding range surveying and mapping method based on whole-process remote sensing data analysis, and the method comprises the steps: carrying out the quick calculation of the reservoir capacity of a barrier lake through employing a multi-grid discrete surface integral algorithm based on DEM remote sensing data; based on the reservoir capacity calculation result of the dammed lake, calculating the reservoir area flooding range by adopting a grid flooding algorithm, and performing graphical surveying and mapping display; introducing the longitude and latitude coordinates of the upstream residential point of the dammed lake, visually displaying the residential point on a graph, the upstream flooding disaster situation of the dammed lake under different water levels can be obtained, and decision support is provided for subsequent organization of safe evacuation of residents; and calculating and statistically analyzing the key technical parameters of the barrier lake according to a corresponding calculation formula, such as the maximum tail water length, the reservoir area submerging area and the water storage change characteristics. The defects that a traditional surveying and mapping method is limited in application condition and insufficient in timeliness are overcome, rapid surveying and mapping calculation is conducted on the upstream flooding condition of the barrier lake in the whole process based on DEM remote sensing data, and key technical information is provided for emergency rescue work of the barrier lake.

The invention relates to the field of three-dimensional measurement, and particularly relates to a multi-queue rapid phase unwrapping method and a multi-queue rapid phase unwrapping system based on a quality diagram. According to the invention, the phase unwrapping process is guided by the quality diagram, thereby effectively avoiding influences imposed on the phase unwrapping precision by noises and a low-quality region. Meanwhile, queues, whose number is equal to that of quality levels, are established so as to be used for storing nodes of each quality level, thereby avoiding a process of sequencing carried out every time when a node is added to the queues in the phase unwrapping process of a traditional flood algorithm, and greatly improving the phase unwrapping speed.

A method for improving fuel cell system reliability in the event of end cell heater failure in a fuel cell stack. The method includes detecting that an end cell heater has failed. If an end cell heater failure is detected, then the method performs one or more of setting a cooling fluid pump to a predetermined speed that drives a cooling fluid through cooling fluid flow channels in the fuel cell stack, limiting the output power of the fuel cell stack or the net power of the fuel cell system, limiting the maximum temperature of the cooling fluid flowing out of the stack, turning off stack anti-flooding algorithms that may be used to remove water from reactant gas flow channels in the stack, and turning off cathode stoichiometry adjustments for relative humidity control in response to water accumulating in cathode flow channels in the fuel cell stack.

The invention provides a long-distance concentrated ammeter reading system based on a flooding algorithm. The ammeter reading system is characterized by comprising a master ammeter reading station, a general packet radio service (GPRS) network, a concentrator and an electric carrier ammeter, wherein the master ammeter reading station and the concentrator are provided with GPRS modules and communicated through the GPRS network; and the concentrator and the electric carrier ammeter are communicated through an electric wire. By using the system, the disadvantages of the traditional ammeter reading mode are overcome, thereby completing functions such as data acquisition, measurement, transmission, settlement and the like, realizing functions such as long-distance reading, inquiry, payment, intelligent control and the like. The system has the advantages of small work load, large transmission data quantity, high veracity, low expenditure and the like; and a modern automatic technique is used for replacing manual management, thereby improving efficiency.

The invention relates to a wireless sensor networks underground garage personal safety alarm system and a method. The system firstly needs to deploy a plurality of wireless sensor nodes according to the actual state of the underground garage to ensure that the wireless sensor nodes can cover the entire underground garage without blind spots and blind spots, the security sector outside of the garage needs to be installed with a remote control center to feedback unusual circumstances occurred in the garage, the garage needs to be installed with a lighting switch control receiver and a broadcast switch receiver, each wireless sensor nodes can send the instructions of starting lighting and broadcasting to the receivers. After the deployment, each wireless sensor node starts to monitor within the own perception range, once the words such as help, murder and the like or the screaming like ah is monitored, other wireless sensor nodes are waken up by using a flooding algorithm so as to form a self-organizing wireless sensor network immediately. The wireless sensor node firstly sensing the risk transmits alarm signals to the wireless sensor nodes at the entrance / exit of the garage through the network. The wireless sensor nodes continue to forward alarm information to the remote control center, after the sensor nearest to the lighting switch control receiver and the broadcast switch receiver sensor sends a start command to the receivers after completion of forwarding the alarm information, the lighting equipment and the broadcasting equipment are turn-on until the security personnel go to the scene, and the lighting equipment and the broadcasting equipment are closed after treatment, thus the wireless sensor nodes monitoring re-enters into a monitoring state.

The invention discloses a routing optimization method of a Bluetooth mesh network with a mobile node. The method comprises the following steps: when judging that a node needs to be forwarded, obtaining a forwarding probability initial value of the node according to an RSSI value in a received data packet; adjusting the forwarding probability initial value according to the neighbor node informationof the node; confirming the adjusted forwarding probability initial value according to the mobile node information of the node to obtain a forwarding probability value; and generating a random value,comparing the obtained node forwarding probability value with the generated random value, if the random value is greater than or equal to the forwarding probability value, performing forwarding operation by the node, and otherwise, not performing forwarding by the node. An original flooding algorithm is improved, and a novel routing method is provided. Redundant forwarding of the nodes in the Bluetooth mesh network is limited by dynamically adjusting the forwarding probability values of the nodes, so that the problems of network delay and data packet loss caused by mobile nodes are solved.

A system for generating an automatically segmented and annotated two-dimensional (2D) map of an environment includes processors coupled to a scanner to convert a 2D map from the scanner into a 2D image. Further, a mapping system categorizes a first set of pixels from the image into one of room-inside, room-outside, and noise by applying a trained neural network to the image. The mapping system further categorizes a first subset of pixels from the first set of pixels based on a room type if the first subset of pixels is categorized as room-inside. The mapping system also determines the room type of a second subset of pixels from the first set of pixels based on the first subset of pixels by using a flooding algorithm. The mapping system further annotates a portion of the 2D map to identify the room type based on the pixels corresponding to the portion.

A system for generating an automatically segmented and annotated two-dimensional (2D) map of an environment includes processors coupled to a scanner to convert a 2D map from the scanner into a 2D image. Further, a mapping system categorizes a first set of pixels from the image into one of room-inside, room-outside, and noise by applying a trained neural network to the image. The mapping system further categorizes a first subset of pixels from the first set of pixels based on a room type if the first subset of pixels is categorized as room-inside. The mapping system also determines the room type of a second subset of pixels from the first set of pixels based on the first subset of pixels by using a flooding algorithm. The mapping system further annotates a portion of the 2D map to identify the room type based on the pixels corresponding to the portion.

The invention discloses a crawler technology based on a block chain system, and the steps are as follows: step 1: in the block chain network, on the existing nodes, an open public key node is added; step 2: when the block chain system After the node is started, it can visit nearby public key open nodes according to its own startup configuration, and register public key information with it; Step 3: When the crawler starts, it first looks for nearby public key nodes, and downloads the cached public key node information; step 4: Crawl data according to the clue information; Step 5: The crawler in the system uses the flood algorithm to process the crawling of nodes, and sets the corresponding value of TTL. When crawling in depth according to the clue information, if the TTL setting If it is a value, the crawling of the thread is terminated. The present invention is mainly used in the block chain system, greatly exerts the storage characteristics of the block chain, and is beneficial to the development of the block chain application.

The invention discloses a power line carrier remote upgrading method and a terminal. The method comprises the steps that when a broadcast upgrading command which includes broadcast sending times is received by a concentrator, and if program upgrading times of a collecting terminal fail to reach the broadcast sending times set by the concentrator, it is judged that whether the collecting terminal needs to be upgraded or not; if the collecting terminal needs to be upgraded, then when a first single-package command is received by the concentrator, it is judged that whether the upgrade of a program package in the first single-package command is completely or not; if the upgrade of the program package is unsuccessful, then a second single-package command comprising the program package which are unsuccessful in upgrading is received by the collecting terminal, and peer-to-peer upgrading is carried out on the program package which is unsuccessful in upgrading. According to the power line carrier remote upgrading method and the terminal, upgrading is carried out by using the flooding algorithm transmission, broadcast upgrading is carried out on a to-be-upgraded terminal, and if the broadcast upgrading is unsuccessful, peer-to-peer upgrading can be carried out on the program package which is unsuccessful in upgrading, so that the upgrade successful rate is increased.

The invention discloses a BP decoding method based on the Tanner sheet margin scheduling strategy. The Tanner sheet margin scheduling is adopted in a decoding process, and parallel transmission is performed to accelerate the decoding iteration speed. On a check node updating part, a diversity processing mode is adopted, when a verification equation is not tenable after several iterations, and a check node transmits information with all neighbor nodes so as to improve the reliability of the check node; when the verification equation is tenable, and the reliability of the check node is smaller than a reliability threshold, the check node only needs to perform information transmission with the previous w nodes smaller than LLR information, thereby reducing the partial computation complexity;the rest check nodes do not perform information transmission, so that the computation complexity of the algorithm is further reduced, the transmission of the LLR information along the edge is inhibited, and the BER performance is improved. The simulation results show that when the signal to noise ratio is 3.0dB, the computation complexity of the EDBP algorithm is only 42% of the BP algorithm, andthe computation complexity is reduced, and the BER performance of the EDBP algorithm is better than that of the Flooding algorithm.

The invention discloses a fast method for locating Uighur characters in a complex background image, comprising: detecting stroke key points from the image based on a detection template; combining the detected stroke key points with a flooding algorithm to extract text components in the image; The similarity of text components is used to cluster components to realize the construction of text lines; the line classifier composed of HOG+SVM system is used to extract HOG features from text lines, and to classify text lines and non-text lines. This method can improve the speed and accuracy of Uighur text positioning in complex background images.

The invention discloses a Gossip routing method and a Gossip routing device based on average node degree improvement in an Ad hoc network. The method comprises the steps of receiving a node routing list message to compute an average node degree, wherein the average node degree is an average value of neighbor node numbers within one-hop ranges of all nodes in a certain area; determining a false rumor forwarding probability according to the relationship between sizes of the node degree of the current node and the average node degree; and determining a rumor forwarding probability according to arelationship between the predefined false rumor forwarding probability and the rumor forwarding probability. Through the introducing of the rumor forwarding probability p and the combination of the average node degree, the problem of excessive routing overhead caused by a flooding algorithm is solved, and the transmission reliability of the network message is also ensured.

The invention discloses a method of quickly positioning a Uyghur character in a complex background image. The method comprises steps: a stroke key point is detected from an image based on a detectiontemplate; in combination of the detected stroke key point and a flooding algorithm, a character assembly in the image is extracted; based on similarities of the character assembly, assembly clusteringis carried out to realize construction of a character line; and by using a line classifier formed by an HOG+SVM system, HOG feature extraction on the character line and binary classification of a character line and a non-character line are carried out. The method can enhance the speed and the precision of positioning the Uyghur character in the complex background image.

The invention discloses an improved Gossip routing method and device based on the average node degree in an Ad hoc network. The method includes: receiving a node routing table message to calculate the average node degree, and the average node degree is one hop of all nodes in a certain area The average number of adjacent nodes within the range; determine the false rumor forwarding probability according to the relationship between the node degree of the current node and the average node degree; determine the rumor forwarding probability according to the predefined false rumor forwarding probability and the relationship between the rumor forwarding probability. By combining the introduction of the rumor forwarding probability p and the combination of the average node degree, it not only solves the problem of excessive routing overhead caused by the flooding algorithm, but also ensures the reliability of network message transmission.

The invention belongs to the field of digital holographic microscopic measurement and relates to a rapid package removal method of a digital microscopic holographic phase diagram. The method includes calculating and obtaining a reappearing intensity image and a package phase diagram according to a fundamental principle of digital holographic microscopy, calculating residual point distribution of the package phase diagram, automatically setting threshold value of intensity according to intensity value distribution of the pixels in the intensity image corresponding to the residual points, considering a pixel region which is higher than the threshold value as a reliable phase area, considering a pixel region which is lower than the threshold value as a suspicious phase area, placing a intensity value in a normalized intensity image corresponding to the reliable phase area as number 1, keeping the intensity value corresponding to the suspicious phase area to be unchanged, establishing a novel quality guiding image, and finally, establishing a stack chain table flooding algorithm based on guidance of the quality guiding image. Operating rate of the rapid package removal method of the digital microscopic holographic phase diagram is more than 100 times faster than that of a traditional plug-in sequencing flood algorithm with quality image guide, and is even about 3 times faster than that of a branch cutting algorithm. The rapid package removal method of the digital microscopic holographic phase diagram is a phase package removal method applied to quasi real-time digital holographic microscopy.

A new three-dimensional measurement method based on wavelet transform to solve the phase distribution of a fringe pattern accurately and obtain three-dimensional profile information of a measured object from phase distribution. The method includes: projecting a monochrome sinusoidal fringe pattern onto the object; performing wavelet transform for the deformed fringe pattern acquired with CCD line by line, solving the relative phase distribution by detecting the wavelet ridge line, recording the wavelet transform scale factors at the line, and creating a quality map; dividing the relative phase distribution into two parts according to the map, and performing direct-phase unwrapping for the part with better reliability using a scan line based algorithm, and unwrapping the part with lower reliability using a flood algorithm under the guide of the quality map, to obtain the absolute phase distribution of the fringe pattern; obtaining the three dimensional information using a phase-height conversion.