CN114253348A - Method for preventing conflict of editing information under online cooperation of multiple persons - Google Patents
Method for preventing conflict of editing information under online cooperation of multiple persons Download PDFInfo
- Publication number
- CN114253348A CN114253348A CN202111507692.5A CN202111507692A CN114253348A CN 114253348 A CN114253348 A CN 114253348A CN 202111507692 A CN202111507692 A CN 202111507692A CN 114253348 A CN114253348 A CN 114253348A
- Authority
- CN
- China
- Prior art keywords
- time
- client
- edited
- clock
- cell
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 230000001360 synchronised effect Effects 0.000 claims description 13
- 238000004891 communication Methods 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000008859 change Effects 0.000 claims description 3
- 230000000737 periodic effect Effects 0.000 claims description 3
- 230000008569 process Effects 0.000 claims description 3
- 230000004044 response Effects 0.000 claims description 3
- 238000001914 filtration Methods 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 abstract description 3
- 230000007246 mechanism Effects 0.000 abstract description 2
- 238000013480 data collection Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
- G06F1/04—Generating or distributing clock signals or signals derived directly therefrom
- G06F1/12—Synchronisation of different clock signals provided by a plurality of clock generators
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0638—Clock or time synchronisation among nodes; Internode synchronisation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to the technical field of power transmission and distribution data acquisition, and particularly relates to a method for preventing an information from being edited by multiple persons in an online collaborative manner. The invention carries out anti-collision according to the address of the cell, the editing time and the priority of the client in sequence, compared with the prior art that only one client is reminded of the other client when the other client is edited, the anti-collision mechanism of the invention is more perfect, and the invention can alarm when the address of the cell, the editing time and the priority of the client are the same so as to avoid data collision.
Description
Technical Field
The invention belongs to the technical field of power transmission and distribution data acquisition, and particularly relates to a method for preventing conflict when multiple persons edit information in an online collaborative manner.
Background
Data collection and statistics of daily business in power transmission and distribution monitoring lack digital technical means at present, have a large amount of business statistics statement and running analysis report and still need collect through the form of off-line or electronic document, and the data collection is inefficient, and simultaneously, the data that collects neither can obtain effectual utilization, also is convenient for go back to historical data, fix a position to there is great information security risk of revealing yet, consequently needs to realize the online collection of information through the informationization means urgently.
The invention patent of China with the publication number of CN110019279B provides a collaborative updating method, a device, equipment and a storage medium of an online document, and a first target cell updated in a current first display interface of a first client is identified by the first client; acquiring first position information corresponding to the first target cell in a database; sending an update prompting message to a database server, wherein the update prompting message carries the first position information; the database server synchronizes the update prompt message with other second clients which are cooperated with the first client; the second client determines a third target cell corresponding to the first position information in a current second display interface of the second client according to the update prompt message; and performing display processing on the third target cell; wherein the second display interface has a different display view than the first display interface. Under the condition that different clients adopt different display interfaces to cooperatively edit online documents of a database, the online documents of other clients can be prompted to be updated when the first client updates the online documents, so that the situation that a plurality of clients simultaneously edit the data at the same position to cause conflict is avoided, but the problems of real-time communication and a clock source of the clients are not considered, and historical data cannot be traced and positioned.
Disclosure of Invention
In order to solve the problems, the invention provides a method for preventing an information from being collided by editing information under the online cooperation of multiple persons, which has the following specific technical scheme:
a method for preventing conflict of editing information under the online cooperation of multiple persons comprises the following steps:
s1: storing the target document in a server, and establishing communication between the server and a plurality of clients; coding each editing cell of the target document, and numbering and prioritizing each client;
s2: taking a clock of a server as a master clock, and carrying out time service on a plurality of clients so that the plurality of clients and the server clock are synchronous;
s3: acquiring cell information edited by each client, wherein the cell information comprises edited time information, cell address information and cell content;
s4: judging whether the cell address information edited by each client is the same;
when the cell address information edited by each client is different, performing union operation on the cell addresses edited by each client, filling the acquired content into corresponding cells in the target document, and storing the combination of the serial number of the client, the editing time information, the edited cell addresses and the edited content in an operation log of the server;
s5: and when the cell address information edited by the plurality of clients is the same, acquiring the content edited by the corresponding client at the later editing moment as the latest content.
Preferably, the method further comprises the following steps:
s6: and the account numbers of each client are prioritized, when the cell address information edited by a plurality of clients is the same and the editing time is the same, the cells are preferentially edited by the client with high priority, and the content edited by the client with high priority is used as the filling content of the corresponding cell.
Preferably, the method further comprises the following steps: when the cell address information edited by a plurality of clients is the same, the editing time is the same, and the priorities of the two clients are the same, the server sends out an alarm signal and locks the corresponding cells until the priorities of the two clients are different, or the editing time is different or the edited cell addresses are different, and the server releases the alarm.
Preferably, the step S2 is to time service the multiple clients by using the server clock as a master clock, so that the synchronization between the multiple clients and the server clock specifically includes the following steps:
s21: taking a clock of a server as a master clock and taking a clock of a client as a slave clock;
s22: the master clock sends periodic sending messages, takes a certain frame of message as a starting point message, and sets the sending time as TM0Reception time of TS0Sending out time TM0Provided by a master clock and receiving a time T via link delay compensationS0The slave clock provides the time, and after a plurality of sending periods are separated, the sending time of the currently sent message is TMiReception time of TSiI is the interval number of the sending period of the current sent message and the starting message, wherein i is more than 0, the time change rate of the slave clock is adjusted according to the ratio of the frequency of the master clock to the frequency of the slave clock, and the ratio of the frequency of the master clock to the frequency of the slave clock is (T)Mi-TM0)/(TSi-TS0);
S23: calculating a time delay TdelayAnd a time offset Toffset:
S24: according to time delay TdelayAnd a time offset ToffsetThe slave clock is adjusted so that the slave clock is synchronized with the master clock.
Preferably, the time delay T is calculated in the step S23delayAnd a time offset ToffsetThe method specifically comprises the following steps:
s231: is arranged at T1Sending a synchronization message at a time, recording the arrival time T of the synchronization message by a slave clock at the time2At this time, the slave clock end only has a time stamp T2;
S232: then the following message sent immediately following the synchronous message carries the synchronous message sending time T1To the slave clock side, where the slave clock side has a time stamp T1And T2;
S233: then, the slave clock sends a delay request message to the master clock, and the slave clock end records the sending time T of the delay request message3At this time, the slave clock end has a time stamp T1、T2And T3;
S234: finally, the time T of the delay request message reaching the master clock is obtained by the master clock end4Record that the delay response message carries the arrival time T of the delay request message4Sending to the slave clock and recording the time T by the slave clock4At this time, the slave clock end has a time stamp T1、T2、T3And T4;
S235: whereby the entire time synchronization process is substantially completed, however T1And T4The time of day is measured by the time information of the master clock, and T2And T3The time is measured by the time information of the slave clock, if the time is measured by the standard of the master clock, T is2And T3In time with respect to T1And T4There is a time delay TdelayAnd a time offset ToffsetThe calculation expression is:
T2-Toffset-Tdelay=T1;
T3-Toffset+Tdelay=T4;
the two formulas are arranged with
Preferably, in the step S3, the step S3 is to determine whether the cell address information edited by each client is the same, specifically, perform an exclusive or operation on any two cell addresses, where when the operation result is 0, it indicates that the two corresponding cell addresses are the same, and when the operation result is 1, it indicates that the two corresponding cell addresses are different.
Preferably, in the step S4, one or more conditions of the client number, the editing time information, and the editing cell address are used as the filtering condition in the operation log to trace back the cell content edited by the history and present the cell content in the form of the target document.
Preferably, when a plurality of clients edit the cell content, the server summarizes the cell address edited by each client and uniformly displays the cell address to the interface of each client.
The invention has the beneficial effects that: the invention provides a method for preventing conflict of editing information under the online collaboration of multiple persons, which is characterized in that the clients are numbered and prioritized, cells are encoded, time service is carried out, so that the time of each client and a server is synchronized, the communication real-time performance of the multiple clients and the server is ensured, all the clients and the server adopt clocks of the server as clock sources, time difference is adjusted and compensated, and the conditions of editing conflict and data storage error caused by time disorder are solved.
The invention carries out anti-collision according to the address of the cell, the editing time and the priority of the client in sequence, compared with the prior art that only one client is reminded of the other client when the other client is edited, the anti-collision mechanism of the invention is more perfect, and the invention can alarm when the address of the cell, the editing time and the priority of the client are the same so as to avoid data collision. The invention adopts exclusive OR operation when judging whether the cell addresses are the same, the operation method is simple, the judgment result is only 0 and 1, and the judgment method is simple and easy to realize.
The invention also supports that one or more conditions of the client number, the editing time information and the editing cell address are used as screening conditions to trace the cell contents edited by the history and show the cell contents in the form of a target document, can realize the tracing of the data source, can select the editing contents at any time to trace and position, and can improve the efficiency of data collection and the accuracy of data collection by adopting the method of the invention to collect the data.
Drawings
In order to more clearly illustrate the detailed description of the invention or the technical solutions in the prior art, the drawings that are needed in the detailed description of the invention or the prior art will be briefly described below. Throughout the drawings, like elements or portions are generally identified by like reference numerals. In the drawings, elements or portions are not necessarily drawn to scale.
FIG. 1 is a schematic flow diagram of the present invention;
FIG. 2 is a diagram of a communication architecture of the present invention;
FIG. 3 is a flow chart of the time service tuning of the present invention;
FIG. 4 is a flow chart of time service calculation time delay and time offset of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
As shown in fig. 1, the embodiment of the present invention provides a method for editing information with multiple persons in online collaboration to prevent collision, which includes the following steps:
s1: storing the target document in a server, and establishing communication between the server and a plurality of clients; encoding each edit cell of the target document, and numbering and prioritizing each client.
S2: taking a clock of a server as a master clock, and carrying out time service on a plurality of clients so that the plurality of clients and the server clock are synchronous; the method specifically comprises the following steps:
s21: taking a clock of a server as a master clock and taking a clock of a client as a slave clock;
s22: the master clock sends periodic sending messages, takes a certain frame of message as a starting point message, and sets the sending time as TM0Reception time of TS0Sending out time TM0Provided by a master clock and receiving a time T via link delay compensationS0The slave clock provides the time, and after a plurality of sending periods are separated, the sending time of the currently sent message is TMiReception time of TSiI is the interval number of the sending period of the current sent message and the starting message, wherein i is more than 0, the time change rate of the slave clock is adjusted according to the ratio of the frequency of the master clock to the frequency of the slave clock, and the ratio of the frequency of the master clock to the frequency of the slave clock is (T)Mi-TM0)/(TSi-TS0);
S23: calculating a time delay TdelayAnd a time offset Toffset:
S24: according to time delay TdelayAnd time biasMoving ToffsetThe slave clock is adjusted so that the slave clock is synchronized with the master clock.
The method specifically comprises the following steps:
s231: is arranged at T1Sending a synchronization message at a time, recording the arrival time T of the synchronization message by a slave clock at the time2At this time, the slave clock end only has a time stamp T2;
S232: then the following message sent immediately following the synchronous message carries the synchronous message sending time T1To the slave clock side, where the slave clock side has a time stamp T1And T2;
S233: then, the slave clock sends a delay request message to the master clock, and the slave clock end records the sending time T of the delay request message3At this time, the slave clock end has a time stamp T1、T2And T3;
S234: finally, the time T of the delay request message reaching the master clock is obtained by the master clock end4Record that the delay response message carries the arrival time T of the delay request message4Sending to the slave clock and recording the time T by the slave clock4At this time, the slave clock end has a time stamp T1、T2、T3And T4;
S235: whereby the entire time synchronization process is substantially completed, however T1And T4The time of day is measured by the time information of the master clock, and T2And T3The time is measured by the time information of the slave clock, if the time is measured by the standard of the master clock, T is2And T3In time with respect to T1And T4There is a time delay TdelayAnd a time offset ToffsetThe calculation expression is:
T2-Toffset-Tdelay=T1;
T3-Toffset+Tdelay=T4;
the two formulas are arranged with
S3: and acquiring cell information edited by each client, wherein the cell information comprises edited time information, cell address information and cell content.
S4: judging whether the cell address information edited by each client is the same; specifically, an exclusive or operation is performed on any two cell addresses, when the operation result is 0, it indicates that the two corresponding cell addresses are the same, and when the operation result is 1, it indicates that the two corresponding cell addresses are different. When the plurality of clients edit the contents of the cells, the server collects the cell addresses edited by each client and uniformly displays the cell addresses to the interface of each client.
When the cell address information edited by each client is different, performing union operation on the cell addresses edited by each client, filling the acquired content into corresponding cells in the target document, and storing the combination of the serial number of the client, the editing time information, the edited cell addresses and the edited content in an operation log of the server; and taking one or more conditions of the number of the client, the editing time information and the editing cell address as screening conditions in the operation log to trace the cell contents edited by the history and show the cell contents in the form of a target document.
S5: and when the cell address information edited by the plurality of clients is the same, acquiring the content edited by the corresponding client at the later editing moment as the latest content.
S6: and the account numbers of each client are prioritized, when the cell address information edited by a plurality of clients is the same and the editing time is the same, the cells are preferentially edited by the client with high priority, and the content edited by the client with high priority is used as the filling content of the corresponding cell. The priority can be set according to the post level, and the administrator client can also be set, mainly according to the actual setting.
S7: when the cell address information edited by a plurality of clients is the same, the editing time is the same, and the priorities of the two clients are the same, the server sends out an alarm signal and locks the corresponding cells until the priorities of the two clients are different, or the editing time is different or the edited cell addresses are different, and the server releases the alarm.
Those of ordinary skill in the art will appreciate that the elements of the examples described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the components of the examples have been described above generally in terms of their functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present application, it should be understood that the division of the unit is only one division of logical functions, and other division manners may be used in actual implementation, for example, multiple units may be combined into one unit, one unit may be split into multiple units, or some features may be omitted.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention, and they should be construed as being included in the following claims and description.
Claims (8)
1. A method for preventing conflict of editing information under the online cooperation of multiple persons is characterized in that: the method comprises the following steps:
s1: storing the target document in a server, and establishing communication between the server and a plurality of clients; coding each editing cell of the target document, and numbering and prioritizing each client;
s2: taking a clock of a server as a master clock, and carrying out time service on a plurality of clients so that the plurality of clients and the server clock are synchronous;
s3: acquiring cell information edited by each client, wherein the cell information comprises edited time information, cell address information and cell content;
s4: judging whether the cell address information edited by each client is the same;
when the cell address information edited by each client is different, performing union operation on the cell addresses edited by each client, filling the acquired content into corresponding cells in the target document, and storing the combination of the serial number of the client, the editing time information, the edited cell addresses and the edited content in an operation log of the server;
s5: and when the cell address information edited by the plurality of clients is the same, acquiring the content edited by the corresponding client at the later editing moment as the latest content.
2. The method for multi-person online collaborative editing of information anti-collision as claimed in claim 1, wherein: further comprising the steps of:
s6: and the account numbers of each client are prioritized, when the cell address information edited by a plurality of clients is the same and the editing time is the same, the cells are preferentially edited by the client with high priority, and the content edited by the client with high priority is used as the filling content of the corresponding cell.
3. The method for multi-user online collaborative editing of information anti-collision as claimed in claim 2, wherein: further comprising the steps of: when the cell address information edited by a plurality of clients is the same, the editing time is the same, and the priorities of the two clients are the same, the server sends out an alarm signal and locks the corresponding cells until the priorities of the two clients are different, or the editing time is different or the edited cell addresses are different, and the server releases the alarm.
4. The method for multi-person online collaborative editing of information anti-collision as claimed in claim 1, wherein: the step S2 is to time service a plurality of clients by using the server clock as the master clock, so that the synchronization between the plurality of clients and the server clock specifically includes the following steps:
s21: taking a clock of a server as a master clock and taking a clock of a client as a slave clock;
s22: the master clock sends periodic sending messages, takes a certain frame of message as a starting point message, and sets the sending time as TM0Reception time of TS0Sending out time TM0Provided by a master clock and receiving a time T via link delay compensationS0The slave clock provides the time, and after a plurality of sending periods are separated, the sending time of the currently sent message is TMiReception time of TSiI is the interval number of the sending period of the current sent message and the starting message, wherein i is more than 0, the time change rate of the slave clock is adjusted according to the ratio of the frequency of the master clock to the frequency of the slave clock, and the ratio of the frequency of the master clock to the frequency of the slave clock is (T)Mi-TM0)/(TSi-TS0);
S23: calculating a time delay TdelayAnd a time offset Toffset:
S24: according to time delay TdelayAnd a time offset ToffsetThe slave clock is adjusted so that the slave clock is synchronized with the master clock.
5. The method of claim 4, wherein the method comprises: in the step S23, the time delay T is calculateddelayAnd a time offset ToffsetThe method specifically comprises the following steps:
s231: is arranged at T1Sending a synchronization message at a time, recording the arrival time T of the synchronization message by a slave clock at the time2At this time, the slave clock end only has a time stamp T2;
S232: then the following message sent immediately following the synchronous message carries the synchronous message sending time T1To the slave clock side, where the slave clock side has a time stamp T1And T2;
S233: then, the slave clock sends a delay request message to the master clock, and the slave clock end records the sending time T of the delay request message3At this time, the slave clock end has a time stamp T1、T2And T3;
S234: finally, the time T of the delay request message reaching the master clock is obtained by the master clock end4Record that the delay response message carries the arrival time T of the delay request message4Sending to the slave clock and recording the time T by the slave clock4At this time, the slave clock end has a time stamp T1、T2、T3And T4;
S235: whereby the entire time synchronization process is substantially completed, however T1And T4The time of day is measured by the time information of the master clock, and T2And T3The time is measured by the time information of the slave clock, if the time is measured by the standard of the master clock, T is2And T3In time with respect to T1And T4There is a time delay TdelayAnd a time offset ToffsetThe calculation expression is:
T2-Toffset-Tdelay=T1;
T3-Toffset+Tdelay=T4;
the two formulas are arranged with
6. The method for multi-person online collaborative editing of information anti-collision as claimed in claim 1, wherein: in the step S3, it is determined whether the cell address information edited by each client is the same, specifically, an exclusive or operation is performed on any two cell addresses, where an operation result is 0 to indicate that the two corresponding cell addresses are the same, and an operation result is 1 to indicate that the two corresponding cell addresses are different.
7. The method for multi-person online collaborative editing of information anti-collision as claimed in claim 1, wherein: in step S4, one or more conditions among the client' S number, the editing time information, and the edited cell address are used as the filtering conditions in the operation log to trace back the cell contents edited by the history and to present the cell contents in the form of the target document.
8. The method for multi-person online collaborative editing of information anti-collision as claimed in claim 1, wherein: when the plurality of clients edit the contents of the cells, the server collects the cell addresses edited by each client and uniformly displays the cell addresses to the interface of each client.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111507692.5A CN114253348B (en) | 2021-12-10 | 2021-12-10 | Method for preventing conflict of editing information under online collaboration of multiple people |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111507692.5A CN114253348B (en) | 2021-12-10 | 2021-12-10 | Method for preventing conflict of editing information under online collaboration of multiple people |
Publications (2)
Publication Number | Publication Date |
---|---|
CN114253348A true CN114253348A (en) | 2022-03-29 |
CN114253348B CN114253348B (en) | 2024-04-16 |
Family
ID=80794725
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202111507692.5A Active CN114253348B (en) | 2021-12-10 | 2021-12-10 | Method for preventing conflict of editing information under online collaboration of multiple people |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114253348B (en) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107656988A (en) * | 2017-09-12 | 2018-02-02 | 北京北信源软件股份有限公司 | Document edit method and system |
CN108322281A (en) * | 2018-05-14 | 2018-07-24 | 上海市计量测试技术研究院 | Time calibration in network service based on NTP and assessment system and method |
-
2021
- 2021-12-10 CN CN202111507692.5A patent/CN114253348B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107656988A (en) * | 2017-09-12 | 2018-02-02 | 北京北信源软件股份有限公司 | Document edit method and system |
CN108322281A (en) * | 2018-05-14 | 2018-07-24 | 上海市计量测试技术研究院 | Time calibration in network service based on NTP and assessment system and method |
Also Published As
Publication number | Publication date |
---|---|
CN114253348B (en) | 2024-04-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103152117B (en) | A kind of embedded high-precision network time server system | |
CN111740860B (en) | Log data transmission link monitoring method and device | |
CN108322281A (en) | Time calibration in network service based on NTP and assessment system and method | |
CN101425887A (en) | Time synchronization method used for wireless sensor network | |
JP2023504944A (en) | Internet of Things data transfer method and system | |
CN103778041B (en) | Data monitoring method and device for internet | |
CN111008245A (en) | WAMS data sharing method for scheduling mechanism above provincial level based on regulation cloud | |
CN112559475A (en) | Data real-time capturing and transmitting method and system | |
CN110083600A (en) | A kind of method, apparatus, calculating equipment and the storage medium of log collection processing | |
CN102026228B (en) | Statistical method and equipment for communication network performance data | |
CN110335148A (en) | Securities data parallel processing system (PPS) and method | |
CN114253348A (en) | Method for preventing conflict of editing information under online cooperation of multiple persons | |
CN110868338A (en) | Early warning monitoring method | |
CN117112656A (en) | Integrated information intelligent management system and method for scientific and technological volunteer service management | |
CN115685816A (en) | Energy data subscription and control system based on websocket | |
CN108345650A (en) | Electronic invoice business monitors method for early warning and system in real time | |
CN106385299B (en) | The master-salve clock synchronous method of intelligent substation maintenance service category information background stream | |
CN109165203A (en) | Large public building energy consumption data based on Hadoop framework stores analysis method | |
CN116775973A (en) | Medical big data acquisition method and system | |
CN106034044B (en) | The method and apparatus of alert analysis | |
CN112417838A (en) | Configurable automated reporting system | |
CN110850824A (en) | Implementation method for acquiring data of distributed control system to Hadoop platform | |
CN113973121A (en) | Internet of things data processing method and device, electronic equipment and storage medium | |
CN111799779A (en) | Load generation planned value curve transmission method and system | |
CN107276782B (en) | Information processing method, equipment and system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |