Electromagnetic data processing method, device, storage medium and equipment

By using the oblique binary stack data structure to manage electromagnetic data in electromagnetic environment simulation, the problem of low efficiency in the existing technology is solved, efficient operation of electromagnetic signal source insertion and deletion, and simulation speed and field strength index efficiency are improved.

CN116756931BActive Publication Date: 2024-11-15JOINT WARFARE COLLEGE NAT DEFENSE UNIV OF THE CHINESE PEOPLES LIBERATION ARMY
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310559615.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-05-17
Publication Date
2024-11-15
Estimated Expiration
2043-05-17

Smart Images

  • Figure CN116756931B_ABST
    Figure CN116756931B_ABST
Patent Text Reader

Abstract

The embodiment of the present application provides an electromagnetic data processing method, device, storage medium and equipment. In the method, electromagnetic data generated by different signal sources in the target area are obtained, and the electromagnetic data is inserted into an empty skew binomial heap as a node. The insertion process ensures that the heap is ordered and maintains the maximum value pointer. After that, when the signal source changes, the data processing for the regional electromagnetic situation update is completed by inserting new nodes and / or deleting nodes. In this way, the regional electromagnetic environment is stored and managed based on the skew binomial heap, which reduces the time complexity of electromagnetic data calculation, thereby improving the simulation efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of electromagnetic environment simulation, and in particular to an electromagnetic data processing method, device, storage medium and equipment. Background Art

[0002] Electromagnetic environment generally refers to the sum of all electromagnetic phenomena existing in a certain place. With the rapid development and large-scale application of radio technology, the problems of spectrum interference and human protection caused by complex electromagnetic environment have become increasingly prominent. The optimized application of simulation technology has enabled people to process the invisible electromagnetic environment in an information and data manner, and discovered a lot of useful information. As an important technical means, the testing and simulation of the electromagnetic environment provides important support for ensuring the electromagnetic radiation safety of users.

[0003] At present, the traditional method of simulating the electromagnetic environment of a certain area is to traverse all signal sources that have electromagnetic influence on the area at each simulation step, calculate the magnitude of the field strength in this area, and calculate the maximum and / or minimum value. This method is not efficient and seriously affects the simulation speed. Summary of the invention

[0004] The purpose of the embodiments of the present application is to provide an electromagnetic data processing method, device, storage medium and equipment, aiming to solve the problem of low efficiency and low simulation speed in the related art of simulating the electromagnetic environment of a specified area.

[0005] In a first aspect, an electromagnetic data processing method provided by an embodiment of the present application includes:

[0006] Acquire electromagnetic data generated by different signal sources in the target area;

[0007] Insert the electromagnetic data as a node into an empty skew binomial heap, and maintain the maximum value pin of the skew binomial heap; the value of any child node in the skew binomial heap is less than the value of the parent node of the child node;

[0008] If the signal source changes, a corresponding processing operation is performed on the skew binomial heap; the processing operation includes inserting a new node and / or deleting a node.

[0009] In the above implementation process, the electromagnetic data generated by different signal sources in the target area are obtained, and the electromagnetic data is inserted into an empty oblique binomial heap as a node. The insertion process ensures that the heap is ordered and maintains the maximum value pointer. After that, when the signal source changes, the data processing for the update of the regional electromagnetic situation is completed by inserting new nodes and / or deleting nodes. In this way, the regional electromagnetic environment is stored and managed based on the oblique binomial heap, which reduces the time complexity of electromagnetic data calculation and improves the simulation efficiency.

[0010] Furthermore, in some embodiments, if the signal source changes, performing corresponding processing operations on the skew binomial heap includes:

[0011] If a new signal source is generated, a new node is established based on electromagnetic data generated by the new signal source;

[0012] Determine whether the ranks of the two trees with the smallest ranks in the skew binomial heap are equal. If the judgment result is yes, insert the new node into the skew binomial heap. If the judgment result is no, obliquely link the new node and the two trees with the smallest ranks in the skew binomial heap.

[0013] In the above implementation process, after the regional electromagnetic situation is updated, if a new signal source is generated, the electromagnetic data generated by the new signal source is added to the skew binomial heap through the skew binomial heap insertion method, thereby achieving the O(1) time complexity of the electromagnetic signal source insertion operation and effectively improving the efficiency of the electromagnetic environment field strength indexing.

[0014] Furthermore, in some embodiments, if the signal source changes, performing corresponding processing operations on the skew binomial heap includes:

[0015] If the target signal source fails, the electromagnetic data generated by the target signal source is determined as a node to be deleted;

[0016] In the oblique binomial heap, move the node to be deleted to the root node position, take out the tree where the node to be deleted is located, and delete the current root node;

[0017] It is determined whether the maximum value in the oblique binomial heap is on the tree where the node to be deleted is located. If the determination result is no, the remaining subtree is stored in a preset buffer.

[0018] In the above implementation process, the deletion operation is improved on the basis of the traditional skew binomial heap, that is, a buffer is maintained in the memory to temporarily store the subtrees generated by some deletion operations. While ensuring that the maximum value is always in the original skew binomial heap, the time complexity of the merge operation is effectively reduced, thereby reducing the time required for the traversal operation.

[0019] Furthermore, in some embodiments, the method further comprises:

[0020] When the number of trees in the buffer is greater than a preset threshold, all trees in the buffer are merged with the current slanted binomial heap.

[0021] In the above implementation process, when the number of trees in the buffer is greater than the preset threshold, the buffer space is considered full, and all trees in the buffer are merged with the current slanted binomial heap. In this way, the impact of the deletion operation on the algorithm performance is effectively reduced when the tree order of the deleted node is high.

[0022] Furthermore, in some embodiments, the method further comprises:

[0023] When the maximum value in the oblique binomial heap is on the tree where the node to be deleted is located, the remaining subtrees are merged with the current oblique binomial heap.

[0024] In the above implementation process, when it is determined that the tree where the node to be deleted is located is the tree where the maximum value is located, the remaining subtree is not stored in the buffer, but the remaining subtree is directly merged with the current slanted binomial heap, thereby ensuring that the maximum value is always in the original binomial heap.

[0025] Furthermore, in some embodiments, the buffer uses a preset data structure to store the root node pointers of the remaining subtrees.

[0026] In the above implementation process, by storing the root node pointer of the remaining subtree, the speed of adding the remaining subtree to the heap after deleting the element is improved to a certain extent, thereby improving the speed of the deletion operation.

[0027] Furthermore, in some embodiments, the method further comprises:

[0028] When a query instruction is received, the value of the node pointed to by the maximum value pointer is output.

[0029] In the above implementation process, after the user triggers the query operation, the device can directly output the value of the node pointed to by the maximum value pointer, that is, the maximum value of the field strength in the current measurement result, thereby improving the user experience.

[0030] In a second aspect, an electromagnetic data processing device provided by an embodiment of the present application includes:

[0031] An acquisition module, used for acquiring electromagnetic data generated by different signal sources in the target area;

[0032] An insertion module, used for inserting the electromagnetic data as a node into an empty skew binomial heap, and maintaining the maximum value pin of the skew binomial heap; the value of any child node in the skew binomial heap is less than the value of the parent node of the child node;

[0033] A change module is used to perform corresponding processing operations on the skew binomial heap if the signal source changes; the processing operations include inserting new nodes and / or deleting nodes.

[0034] In a third aspect, an embodiment of the present application provides an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method described in any one of the first aspects when executing the computer program.

[0035] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which instructions are stored. When the instructions are executed on a computer, the computer executes the method as described in any one of the first aspects.

[0036] In a fifth aspect, an embodiment of the present application provides a computer program product, which, when running on a computer, enables the computer to execute the method as described in any one of the first aspects.

[0037] Other features and advantages disclosed in the present application will be described in the following description, or some features and advantages can be inferred or determined without doubt from the description, or can be learned by implementing the above-mentioned technology disclosed in the present application.

[0038] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, preferred embodiments are specifically cited below and described in detail with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0040] Figure 1 A flowchart of an electromagnetic data processing method provided in an embodiment of the present application;

[0041] Figure 2 A schematic diagram of an oblique binomial heap provided in an embodiment of the present application;

[0042] Figure 3 A schematic diagram of a workflow of an electromagnetic environment field strength indexing scheme based on an improved skew binomial heap provided in an embodiment of the present application;

[0043] Figure 4 A schematic diagram of a traditional deletion operation of a skew binomial heap provided in an embodiment of the present application;

[0044] Figure 5 A schematic diagram of an improved deletion operation of a skew binomial heap provided in an embodiment of the present application;

[0045] Figure 6 A block diagram of an electromagnetic data processing device provided in an embodiment of the present application;

[0046] Figure 7 A structural block diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0047] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0048] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0049] As described in the background art, the method of performing electromagnetic environment simulation on a specified area in the related art has the problem of low efficiency and low simulation speed. Based on this, the embodiment of the present application provides an electromagnetic data processing solution to solve the above problem.

[0050] Next, the embodiments of the present application are introduced:

[0051] like Figure 1 As shown, Figure 1 It is a flowchart of an electromagnetic data processing method provided in an embodiment of the present application. The method can be applied to a terminal or a server. The terminal can be various electronic devices, including but not limited to smart phones, tablet computers, laptop portable computers and desktop computers, etc. The server can be a single server or a distributed server cluster composed of multiple servers. The terminal or server provides an environment for data processing, which includes a software part and a hardware part. The software part mainly includes an operating system, such as Windows, Linux, etc., and the hardware part mainly includes computing resources, storage resources, etc., such as CPU (Central Processing Unit), memory, hard disk, etc. It should be noted that the terminal / server can also be implemented as multiple software or software modules, or can also be implemented as a single software or software module, and the present application does not limit this.

[0052] The method comprises:

[0053] In step 101, electromagnetic data generated by different signal sources in a target area are obtained;

[0054] The target area mentioned in this step is any area that needs to be simulated by the electromagnetic environment. Taking the airport terminal area as an example, the stability and safety of the airport electromagnetic environment is related to the life safety of airport staff and passengers. Therefore, it is very necessary to simulate the electromagnetic environment of the airport terminal area where various communication, navigation, and monitoring equipment are distributed. Of course, the target area can also be other areas, such as radio stations, weather radar stations, etc., and this application does not limit this.

[0055] The signal source of the target area actually refers to the object that generates and sends the signal in the target area. In practical applications, one area often corresponds to multiple different signal sources. Using the previous example, the electromagnetic environment of the airport terminal area is relatively complex. In addition to the various devices distributed in the area, the sources of signals in the area often include mobile communication equipment, power transmission equipment, etc. The electromagnetic data mentioned in this step may refer to the electromagnetic signal strength, which can be obtained by measuring the field strength in the target area through equipment such as a field strength meter.

[0056] In step 102, the electromagnetic data is inserted as a node into an empty skew binomial heap, and the maximum value pin of the skew binomial heap is maintained; the value of any child node in the skew binomial heap is less than the value of the parent node of the child node;

[0057] A skew binomial heap is a heap-ordered forest of skew binomial trees. The rank (used to record the height of the tree) of each tree is different, and only two trees with the smallest rank can exist at the same time. When constructing a skew binomial heap, skew binomial trees of different ranks are arranged from low to high according to their rank size, and their root nodes are connected with pointers. In addition, a pointer to the maximum value can be maintained. Figure 2 As shown, Figure 2 is a schematic diagram of a skew binomial heap provided in an embodiment of the present application, wherein r0≤r1 <r2<…<r n-1 <r n The skew binomial heap data structure is specially designed for the priority queue, which can meet the characteristics of outputting the maximum value and has a good insertion and merging speed. Based on this, the present embodiment stores and manages the regional electromagnetic environment based on the skew binomial heap, improves the efficiency of the electromagnetic environment field strength index, and thus improves the simulation speed.

[0058] Specifically, after obtaining the electromagnetic signal strength of all signal sources in the area, the device can construct an empty skew binomial heap, and insert all signal strengths as nodes into the skew binomial heap one by one. During the insertion process, it is ensured that the values ​​of all child nodes are less than the value of the parent node, that is, the heap is ensured to be ordered, and a maximum value pointer is also maintained, that is, the maximum value pointer points to the node with the largest value in the skew binomial heap.

[0059] In step 103, if the signal source changes, a corresponding processing operation is performed on the skew binomial heap; the processing operation includes inserting a new node and / or deleting a node.

[0060] This step means: after storing the electromagnetic data based on the oblique binomial heap, inserting new nodes and / or deleting nodes are performed according to the regional electromagnetic situation to achieve the management of the electromagnetic data, reduce the time complexity of the electromagnetic environment calculation to a certain extent, and thus improve the speed of electromagnetic environment simulation of the target area.

[0061] In some embodiments, this step may include: if a new signal source is generated, establishing a new node based on the electromagnetic data generated by the new signal source; judging whether the ranks of the two trees with the smallest ranks in the oblique binomial heap are equal, if the judgment result is yes, inserting the new node into the oblique binomial heap, if the judgment result is no, obliquely linking the new node and the two trees with the smallest ranks in the oblique binomial heap. That is to say, after the regional electromagnetic situation is updated, if a new signal source is generated, the electromagnetic data generated by the new signal source can be added to the oblique binomial heap through the oblique binomial heap insertion method. Specifically, during implementation, a new tree with rank 0 can be created, and the node key value is the value of the element to be inserted, that is, the electromagnetic data generated by the new signal source. Afterwards, if the rank values ​​of the two trees with the smallest rank in the skew binomial heap are different, the newly created node is directly added to the heap. If the rank values ​​of the two trees with the smallest rank in the skew binomial heap are the same, the two trees and the newly created node are connected by an oblique link. The oblique link can be an A-type link (i.e., two oblique binomial trees with rank r are used as subtrees of a tree with rank 0), or a B-type link (i.e., a tree with rank 0 and one of the oblique binomial trees with rank r are used as the leftmost subtree of another tree with rank r, and the tree with rank 0 is placed on the leftmost), and then the obtained oblique binomial tree is added to the heap. In this way, the electromagnetic signal source insertion operation is realized with O(1) time complexity, which greatly improves the efficiency of electromagnetic environment field strength indexing.

[0062] In addition, in some embodiments, this step may also include: if the target signal source fails, the electromagnetic data generated by the target signal source is determined as a node to be deleted; in the oblique binomial heap, the node to be deleted is moved up to the root node position, the tree where the node to be deleted is located is taken out, and the current root node is deleted; it is determined whether the maximum value in the oblique binomial heap is on the tree where the node to be deleted is located, and if the judgment result is no, the remaining subtrees are stored in a preset buffer. That is to say, when a signal source fails, the deletion method provided in this embodiment can be adopted to delete the electromagnetic data generated by the signal source from the oblique binomial tree. For the oblique binomial tree, the traditional deletion operation is to perform a sift up operation on the deleted node, that is, to continuously exchange the data of the parent node and the child node until the deleted node reaches the position of the root node, and then remove the oblique binomial tree where the node is located from the oblique binomial heap, and the oblique binomial heap at this time is recorded as heap1, and then the removed oblique binomial tree root node is deleted, and all the remaining subtrees are inserted into heap1 in order from high to low according to the order. During this process, the subtree generated by the deletion operation is linked to each tree with a lower rank than the deleted tree at most once. Since the position where the subtree to be inserted or linked needs to be found before linking, it is necessary to traverse the root node of the oblique binomial heap for each tree to be added and compare its rank. This means that if the rank of the tree where the deleted node is located is higher, the traversal operation will take more time, thereby increasing the time complexity of the deletion operation. Based on this, the embodiment of the present application improves the deletion operation on the basis of the traditional slant binomial heap, that is, a buffer is maintained in the memory to temporarily store the subtrees generated by some deletion operations. When the tree where the node to be deleted is located is not the tree where the maximum value is located, the tree is first taken out from the heap according to the original method, the node is moved to the root node, the root node is deleted, and the remaining subtrees are stored in the buffer, and are not immediately merged with the original heap. In this way, since the deletion operation may occur in the buffer, whenever a deletion operation occurs in the buffer, it is possible to cause the rank of the tree to be added to the heap in the buffer to be reduced, that is, reduce the time complexity of the merge operation, thereby reducing the time required for the traversal operation. At the same time, it can also ensure that the maximum value is always in the original slant binomial heap, and only non-critical subtrees are cached.

[0063] Furthermore, the above method may also include: when the number of trees in the buffer is greater than a preset threshold, merging all trees in the buffer with the current oblique binomial heap. That is to say, a preset threshold may be set to characterize the upper limit of the number of trees cached in the buffer. When the number of trees in the buffer is greater than the preset threshold, the buffer space is considered to be full, and at this time, all trees in the buffer are merged with the current oblique binomial heap. In this way, the impact of the deletion operation on the algorithm performance is effectively reduced when the tree order of the deleted node is high.

[0064] In addition, the above method may further include: when the maximum value in the oblique binomial heap is on the tree where the node to be deleted is located, merging the remaining subtree with the current oblique binomial heap. That is, when it is determined that the tree where the node to be deleted is located is the tree where the maximum value is located, the remaining subtree is not stored in the buffer, but directly merged with the current oblique binomial heap, thereby ensuring that the maximum value is always in the original binomial heap.

[0065] Furthermore, the aforementioned buffer can be implemented by using a Pool (object pool), and the buffer can use a preset data structure to store the root node pointer of the remaining subtree, where the preset data structure can be any one of an array, a linked list, a Map (an object that maps keys to values), a Set (an object is a set of values), etc. In this way, by storing the root node pointer of the remaining subtree, the speed of adding the remaining subtree to the heap after deleting the element is improved to a certain extent, thereby improving the speed of the deletion operation.

[0066] In addition, in some embodiments, the method may further include: when receiving a query instruction, outputting the value of the node pointed to by the maximum value pointer. In practical applications, the maximum value of field strength in an area is a very important parameter. Therefore, after the user triggers the query operation, the device may directly output the value of the node pointed to by the maximum value pointer, that is, the maximum value of field strength in the current measurement result, thereby improving the user experience.

[0067] In the embodiment of the present application, electromagnetic data generated by different signal sources in the target area are obtained, and the electromagnetic data is inserted as a node into an empty oblique binomial heap. The insertion process ensures that the heap is ordered and maintains the maximum value pointer. After that, when the signal source changes, the data processing for updating the regional electromagnetic situation is completed by inserting new nodes and / or deleting nodes. In this way, the regional electromagnetic environment is stored and managed based on the oblique binomial heap, which reduces the time complexity of electromagnetic data calculation, thereby improving the simulation efficiency.

[0068] In order to explain the solution of this application in more detail, a specific embodiment is introduced below:

[0069] This embodiment provides an electromagnetic environment field strength indexing scheme based on an improved skew binomial heap. The working process of the scheme is as follows: Figure 3 As shown, including:

[0070] S301, obtaining electromagnetic signal values ​​generated by different electromagnetic signal sources in a specified area;

[0071] S302, construct an empty skew binomial heap, and insert all electromagnetic signal values ​​as nodes into the skew binomial heap one by one; wherein, during the insertion process, the heap is ensured to be ordered, that is, the values ​​of all child nodes are smaller than the value of the parent node, and the maximum value pointer is maintained;

[0072] S303, when a new signal source is generated, triggering an insertion operation;

[0073] S304: Determine whether the rank values ​​of the two trees with the smallest rank in the heap are equal. If yes, execute S305; otherwise, execute S306;

[0074] S305, taking the electromagnetic signal value generated by the new signal source as a new node, and linking it obliquely with the two trees with the smallest rank, and then executing S316;

[0075] S306, directly inserting the electromagnetic signal value generated by the new signal source as a new node into the oblique binomial heap, and then executing S316;

[0076] S307, when a signal source fails, triggering a deletion operation;

[0077] S308, taking the electromagnetic signal value generated by the failed signal source as the node to be deleted, moving it up to the root node position, taking out the tree where the node to be deleted is located, and deleting the root node;

[0078] S309, determine whether the maximum value in the heap is in the tree where the node to be deleted is located, if yes, execute S310, otherwise execute S311;

[0079] S310, merging the remaining subtree with the original heap, and then executing S316;

[0080] S311, storing the remaining subtrees into the buffer pool;

[0081] S312, determine whether the number of trees in the buffer pool is greater than a preset threshold, if yes, execute S313, otherwise return to S308;

[0082] S313, merge the subtree in the buffer pool with the original heap, and then execute S316;

[0083] S314, when a query instruction is received, a query operation is triggered;

[0084] S315, output the value of the position pointed by the maximum value pointer, and then execute S316;

[0085] S316, end the process.

[0086] It should be noted that in the embodiment of the present application, S303 to S306 correspond to the insertion operation of the skew binomial heap, S307 to S313 correspond to the deletion operation of the skew binomial heap, and S314 to S315 correspond to the query operation of the skew binomial heap. There is no fixed order between these three operations.

[0087] In addition, the deletion operation provided in the embodiment of the present application is an improved deletion operation. The traditional deletion operation of the oblique binomial heap is as follows: Figure 4 As shown, the oblique binomial heap 41 is composed of oblique binomial trees such as B0, B1, B2, and B3, and the node 42 is the element to be deleted. When performing the deletion operation, the element to be deleted is first moved to the root node, and the tree where the element to be deleted is located is removed from the heap, and then the root node is deleted to obtain the original heap 43 and the remaining subtree 44, which includes three subtrees A0, A1, and A2. After that, the original heap 43 and the remaining subtree 44 are merged to obtain a new oblique binomial heap 45. In this process, A0 and A1 are linked with B2 and B1 respectively. Before linking, it is necessary to find the position where the subtree to be inserted or linked is inserted. Therefore, it is necessary to traverse the root node of the oblique binomial heap for each tree to be added and compare its rank. For example, when linking A0, it is necessary to traverse the root nodes of each tree in the heap. When traversing to B2, it is found that its rank is the same as that of A0 to be added, so A0 is linked with B2. Therefore, if the deleted node has a higher tree rank, the traversal operation takes more time, thereby increasing the time complexity of the deletion operation.

[0088] The deletion operation provided in the embodiment of the present application is as follows Figure 5 As shown, similarly, the oblique binomial heap 51 is composed of oblique binomial trees such as B0, B1, B2, and B3, and node 52 is the element to be deleted. When performing the deletion operation, the element to be deleted is first moved to the root node, and the tree where the element to be deleted is located is removed from the heap and the root node is deleted to obtain the original heap 53 and the remaining subtree 54. The difference is that the embodiment of the present application maintains an area Pool (numbered 55 in the figure) in the memory to temporarily store the subtrees generated by the partial deletion operation. When the maximum value is not in B3, the remaining subtree 54 is stored in the Pool. When the number of trees in the Pool is greater than the threshold, all trees in the Pool are merged with the existing heap. In this process, if the deletion operation occurs in the Pool, if the remaining subtree 54 is changed from three subtrees A0, A1, and A2 to four subtrees A3, A4, A1, and A2, the rank of the tree to be added to the heap in the Pool is reduced, thereby reducing the time required for the traversal operation.

[0089] The solution of the embodiment of the present application adopts an improved skew binomial heap method to achieve O(1) time complexity for electromagnetic signal source insertion operation, greatly improving the efficiency of electromagnetic environment field strength indexing; and, based on the traditional skew binomial heap, the deletion operation is transformed, and the Pool structure is used to cache non-critical subtrees. The deletion operation performed in the Pool can reduce the frequency of merging and reduce the rank of the merged tree, thereby increasing the speed of the merging operation, and ultimately reducing the impact of the deletion operation on the algorithm performance when the tree order of the deleted node is high.

[0090] Corresponding to the embodiments of the aforementioned method, the present application also provides embodiments of an electromagnetic data processing device and a terminal using the same:

[0091] like Figure 6 As shown, Figure 6 is a block diagram of an electromagnetic data processing device provided in an embodiment of the present application, the device comprising:

[0092] An acquisition module 61 is used to acquire electromagnetic data generated by different signal sources in a target area;

[0093] Insertion module 62, used for inserting the electromagnetic data as a node into an empty skew binomial heap, and maintaining the maximum value pin of the skew binomial heap; the value of any child node in the skew binomial heap is less than the value of the parent node of the child node;

[0094] The changing module 63 is used to perform corresponding processing operations on the skew binomial heap if the signal source changes; the processing operations include inserting new nodes and / or deleting nodes.

[0095] The implementation process of the functions and effects of each module in the above-mentioned device is specifically described in the implementation process of the corresponding steps in the above-mentioned method, which will not be repeated here.

[0096] This application also provides an electronic device, see Figure 7 , Figure 7 A block diagram of an electronic device provided in an embodiment of the present application. The electronic device may include a processor 710, a communication interface 720, a memory 730, and at least one communication bus 740. The communication bus 740 is used to realize direct connection and communication between these components. The communication interface 720 of the electronic device in the embodiment of the present application is used to communicate signaling or data with other node devices. The processor 710 may be an integrated circuit chip with signal processing capabilities.

[0097] The processor 710 mentioned above can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor 710 can also be any conventional processor, etc.

[0098] The memory 730 may be, but is not limited to, a random access memory (RAM), a read only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electric erasable programmable read-only memory (EEPROM), etc. The memory 730 stores computer-readable instructions. When the computer-readable instructions are executed by the processor 710, the electronic device can execute the above-mentioned Figure 1 The method embodiment involves various steps.

[0099] Optionally, the electronic device may further include a storage controller and an input / output unit.

[0100] The memory 730, storage controller, processor 710, peripheral interface, input and output unit components are directly or indirectly electrically connected to each other to achieve data transmission or interaction. For example, these components can be electrically connected to each other via one or more communication buses 740. The processor 710 is used to execute executable modules stored in the memory 730, such as software function modules or computer programs included in the electronic device.

[0101] The input and output unit is used to provide users with the task creation and to create a start optional time period or preset execution time for the task to realize the interaction between the user and the server. The input and output unit can be, but is not limited to, a mouse and a keyboard.

[0102] Understandably, Figure 7 The structure shown is for illustration only, and the electronic device may also include Figure 7 More or fewer components as shown, or with Figure 7 Different configurations shown. Figure 7 Each component shown in the figure can be implemented by hardware, software or a combination thereof.

[0103] An embodiment of the present application further provides a storage medium having instructions stored thereon. When the instructions are run on a computer, the computer program is executed by a processor to implement the method described in the method embodiment. To avoid repetition, the method will not be described here.

[0104] The present application also provides a computer program product, which, when executed on a computer, enables the computer to execute the method described in the method embodiment.

[0105] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, a program segment or a part of a code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0106] In addition, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0107] If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0108] The above description is only an embodiment of the present application and is not intended to limit the scope of protection of the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the scope of protection of the present application. It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings.

[0109] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0110] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

Claims

1. A method for processing electromagnetic data, characterized in that: include: Acquire electromagnetic data generated by different signal sources in the target area; Insert the electromagnetic data as a node into an empty skew binomial heap, and maintain the maximum value pin of the skew binomial heap; the value of any child node in the skew binomial heap is less than the value of the parent node of the child node; If the signal source changes, a corresponding processing operation is performed on the skew binomial heap; the processing operation includes inserting a new node and / or deleting a node; If the signal source changes, performing corresponding processing operations on the skew binomial heap includes: If the target signal source fails, the electromagnetic data generated by the target signal source is determined as a node to be deleted; In the oblique binomial heap, move the node to be deleted to the root node position, take out the tree where the node to be deleted is located, and delete the current root node; It is determined whether the maximum value in the oblique binomial heap is on the tree where the node to be deleted is located. If the determination result is no, the remaining subtree is stored in a preset buffer.

2. The method according to claim 1, characterized in that If the signal source changes, performing corresponding processing operations on the skew binomial heap includes: If a new signal source is generated, a new node is established based on electromagnetic data generated by the new signal source; Determine whether the ranks of the two trees with the smallest ranks in the skew binomial heap are equal. If the judgment result is yes, insert the new node into the skew binomial heap. If the judgment result is no, obliquely link the new node and the two trees with the smallest ranks in the skew binomial heap.

3. The method according to claim 1, characterized in that The method further comprises: When the number of trees in the buffer is greater than a preset threshold, all trees in the buffer are merged with the current slanted binomial heap.

4. The method according to claim 1, characterized in that: The method further comprises: When the maximum value in the oblique binomial heap is on the tree where the node to be deleted is located, the remaining subtrees are merged with the current oblique binomial heap.

5. The method according to claim 1, characterized in that The buffer uses a preset data structure to store the root node pointers of the remaining subtrees.

6. The method according to claim 1, characterized in that The method further comprises: When a query instruction is received, the value of the node pointed to by the maximum value pointer is output.

7. An electromagnetic data processing device, characterized in that: include: An acquisition module, used for acquiring electromagnetic data generated by different signal sources in the target area; An insertion module, used for inserting the electromagnetic data as a node into an empty skew binomial heap, and maintaining the maximum value pin of the skew binomial heap; the value of any child node in the skew binomial heap is less than the value of the parent node of the child node; A change module, configured to perform corresponding processing operations on the skew binomial heap if the signal source changes; the processing operations include inserting new nodes and / or deleting nodes; The change module is specifically used for: If the target signal source fails, the electromagnetic data generated by the target signal source is determined as a node to be deleted; In the oblique binomial heap, move the node to be deleted to the root node position, take out the tree where the node to be deleted is located, and delete the current root node; It is determined whether the maximum value in the oblique binomial heap is on the tree where the node to be deleted is located. If the determination result is no, the remaining subtree is stored in a preset buffer.

8. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and when the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

9. An electronic device, characterized in that: The method comprises a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method according to any one of claims 1 to 6 is implemented.