CN111046028A - Time sequence correction method and device, readable storage medium and electronic equipment - Google Patents
Time sequence correction method and device, readable storage medium and electronic equipment Download PDFInfo
- Publication number
- CN111046028A CN111046028A CN201911168751.3A CN201911168751A CN111046028A CN 111046028 A CN111046028 A CN 111046028A CN 201911168751 A CN201911168751 A CN 201911168751A CN 111046028 A CN111046028 A CN 111046028A
- Authority
- CN
- China
- Prior art keywords
- time sequence
- time
- node
- executed
- service
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000012937 correction Methods 0.000 title claims description 37
- 238000004590 computer program Methods 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 7
- 201000004569 Blindness Diseases 0.000 abstract description 8
- 230000004048 modification Effects 0.000 description 11
- 238000012986 modification Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 8
- 238000004364 calculation method Methods 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 238000007792 addition Methods 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 230000005856 abnormality Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000002715 modification method Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000005215 recombination Methods 0.000 description 1
- 230000006798 recombination Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
- G06F16/215—Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2474—Sequence data queries, e.g. querying versioned data
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Probability & Statistics with Applications (AREA)
- Fuzzy Systems (AREA)
- Quality & Reliability (AREA)
- Electric Clocks (AREA)
Abstract
The embodiment of the disclosure discloses a method and a device for correcting a time sequence, a readable storage medium and an electronic device, wherein the method comprises the following steps: determining a first time sequence based on a service to be executed; executing the service to be executed according to the first time sequence; responding to the first node in the first time sequence to generate errors, and correcting the first time sequence to obtain a third time sequence; judging whether the service to be executed further comprises unexecuted nodes, if so, taking the third time sequence as the first time sequence, and continuing to execute the unexecuted nodes in the service to be executed; otherwise, the third time sequence is used as the second time sequence, and in this embodiment, for a situation that a node in the relational time sequence is in error, the time sequence is corrected, so that the corrected second time sequence is effective sequence data, and the problems of system blindness, high manual operation cost and poor user experience when the traditional relational time sequence data is changed are solved.
Description
Technical Field
The present disclosure relates to time series data technologies, and in particular, to a method and an apparatus for correcting a time series, a readable storage medium, and an electronic device.
Background
The time series (or called dynamic number series) refers to a number series formed by arranging the numerical values of the same statistical index according to the occurrence time sequence. Most of the economic data is given in time series. The time in the time series may be year, quarter, month or any other form of time depending on the time of observation.
The nature of time series data is commonly used in the design of computer software systems. Generally, time series data is given certain realistic meaning in practical applications, such as continuous time series data, relational time series data, and the like. Relational time-series data: and a set of time series data with context correlation relationship, which is composed of a plurality of single time series data. At present, the common practice is to give no consideration to the node change situation in the relational time series data, and the first relational time series data is taken as the main cause, which results in the blindness of the system.
Disclosure of Invention
The present disclosure is proposed to solve the above technical problems. The embodiment of the disclosure provides a time series correction method and device, a readable storage medium and an electronic device.
According to an aspect of the embodiments of the present disclosure, there is provided a method for correcting a time series, including:
determining a first time sequence based on a service to be executed; the service to be executed comprises a plurality of nodes, and the first time sequence comprises a scheduled execution time corresponding to each node in all nodes included in the service to be executed;
executing the service to be executed according to the first time sequence;
responding to the first node in the first time sequence to generate errors, and correcting the first time sequence to obtain a third time sequence;
judging whether the service to be executed further comprises nodes which are not executed, if so, taking the third time sequence as the first time sequence, and continuing to execute the nodes which are not executed in the service to be executed; and if not, taking the third time sequence as a second time sequence.
Optionally, the modifying the first time series in response to the first node in the first time series having an error to obtain a third time series includes:
in response to the fact that the actual execution time of executing the first node is not matched with the planned execution time corresponding to the first node in the first time sequence, correcting the first time sequence to obtain a third time sequence; and/or the presence of a gas in the gas,
and when responding to the first node of the first time sequence, receiving a sequence correction instruction, and correcting the first time sequence according to the sequence correction instruction to obtain a third time sequence.
Optionally, the actual execution time of executing the first node does not match a planned execution time corresponding to the first node in the first time series, including:
and the actual execution time of executing the first node is later than the planned execution time corresponding to the first node in the first time sequence.
Optionally, the modifying the first time series to obtain a third time series includes:
and modifying the planned execution time corresponding to all nodes after the first node in the first time sequence to obtain the third time sequence.
Optionally, the determining a first time sequence based on the traffic to be executed includes:
determining a starting node and an ending node based on the service to be executed;
determining at least one executable node from the starting node to the ending node according to a set rule, and respectively allocating scheduled execution time to all nodes in the service to be executed; the all nodes include the start node, the end node, and the all executable nodes;
and determining the first time sequence based on the scheduled execution time corresponding to each node in all the nodes.
Optionally, the method further comprises:
saving the first time series and the second time series.
Optionally, the method further comprises:
comparing the stored second time series with the first time series;
and adjusting the set rule based on the comparison result.
According to another aspect of the embodiments of the present disclosure, there is provided a time-series correction apparatus including:
the sequence determining module is used for determining a first time sequence based on the service to be executed; the service to be executed comprises a plurality of nodes, and the first time sequence comprises a scheduled execution time corresponding to each node in all nodes included in the service to be executed;
a service execution module, configured to execute the service to be executed according to the first time sequence;
the sequence correction module is used for responding to the error of a first node in the first time sequence, correcting the first time sequence and obtaining a third time sequence; judging whether the service to be executed further comprises nodes which are not executed, if so, taking the third time sequence as the first time sequence, and continuing to execute the nodes which are not executed in the service to be executed; and if not, taking the third time sequence as a second time sequence.
Optionally, when responding to a first node in the first time sequence having an error and correcting the first time sequence to obtain a third time sequence, the sequence correction module is configured to respond to that an actual execution time of executing the first node is not matched with a planned execution time corresponding to the first node in the first time sequence and correct the first time sequence to obtain the third time sequence; and/or receiving a sequence correction instruction when the first node of the first time sequence is executed, and correcting the first time sequence according to the sequence correction instruction to obtain a third time sequence.
Optionally, when determining that the actual execution time of the first node does not match the planned execution time corresponding to the first node in the first time series, the sequence modification module includes: and determining that the actual execution time of the first node is later than the planned execution time corresponding to the first node in the first time sequence.
Optionally, when the sequence modification module modifies the first time sequence to obtain a third time sequence, the sequence modification module is configured to modify the scheduled execution time corresponding to all nodes after the first node in the first time sequence to obtain the third time sequence.
Optionally, the sequence determining module is specifically configured to determine a starting node and an ending node based on the service to be executed; determining at least one executable node from the starting node to the ending node according to a set rule, and respectively allocating scheduled execution time to all nodes in the service to be executed; the all nodes include the start node, the end node, and the all executable nodes; and determining the first time sequence based on the scheduled execution time corresponding to each node in all the nodes.
Optionally, the apparatus further comprises:
and the sequence storage module is used for storing the first time sequence and the second time sequence.
Optionally, the apparatus further comprises:
the sequence comparison module is used for comparing the stored second time sequence with the first time sequence; and adjusting the set rule based on the comparison result.
According to still another aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium storing a computer program for executing the time-series correction method according to any one of the embodiments.
According to still another aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:
a processor;
a memory for storing the processor-executable instructions;
the processor is configured to read the executable instructions from the memory and execute the instructions to implement the time series correction method described in any of the above embodiments.
Based on the method and the device for correcting the time sequence, the readable storage medium and the electronic device, a first time sequence is determined based on a service to be executed; the service to be executed comprises a plurality of nodes, and the first time sequence comprises a scheduled execution time corresponding to each node in all nodes included in the service to be executed; executing the service to be executed according to the first time sequence; responding to the first node in the first time sequence to generate errors, and correcting the first time sequence to obtain a third time sequence; judging whether the service to be executed further comprises nodes which are not executed, if so, taking the third time sequence as the first time sequence, and continuing to execute the nodes which are not executed in the service to be executed; otherwise, the third time sequence is used as the second time sequence, and in this embodiment, for a situation that a node in the relational time sequence is in error, the time sequence is corrected, so that the corrected second time sequence is effective sequence data, and the problems of system blindness, high manual operation cost and poor user experience when the traditional relational time sequence data is changed are solved.
The technical solution of the present disclosure is further described in detail by the accompanying drawings and examples.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent by describing in more detail embodiments of the present disclosure with reference to the attached drawings. The accompanying drawings are included to provide a further understanding of the embodiments of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the principles of the disclosure and not to limit the disclosure. In the drawings, like reference numbers generally represent like parts or steps.
Fig. 1 is a flowchart illustrating a method for correcting a time series according to an exemplary embodiment of the disclosure.
FIG. 2 is a schematic flow chart of step 102 in the embodiment shown in FIG. 1 of the present disclosure.
Fig. 3 is a schematic diagram of a first time series generated by a time series modification method according to another exemplary embodiment of the disclosure.
Fig. 4 is a flowchart illustrating a method for correcting a time series according to still another exemplary embodiment of the present disclosure.
Fig. 5 is a schematic structural diagram of a time-series correction apparatus according to an exemplary embodiment of the present disclosure.
Fig. 6 is a block diagram of an electronic device provided in an exemplary embodiment of the present disclosure.
Detailed Description
Hereinafter, example embodiments according to the present disclosure will be described in detail with reference to the accompanying drawings. It is to be understood that the described embodiments are merely a subset of the embodiments of the present disclosure and not all embodiments of the present disclosure, with the understanding that the present disclosure is not limited to the example embodiments described herein.
It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.
It will be understood by those of skill in the art that the terms "first," "second," and the like in the embodiments of the present disclosure are used merely to distinguish one element from another, and are not intended to imply any particular technical meaning, nor is the necessary logical order between them.
It is also understood that in embodiments of the present disclosure, "a plurality" may refer to two or more and "at least one" may refer to one, two or more.
It is also to be understood that any reference to any component, data, or structure in the embodiments of the disclosure, may be generally understood as one or more, unless explicitly defined otherwise or stated otherwise.
In addition, the term "and/or" in the present disclosure is only one kind of association relationship describing an associated object, and means that three kinds of relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in the present disclosure generally indicates that the former and latter associated objects are in an "or" relationship.
It should also be understood that the description of the various embodiments of the present disclosure emphasizes the differences between the various embodiments, and the same or similar parts may be referred to each other, so that the descriptions thereof are omitted for brevity.
Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
The disclosed embodiments may be applied to electronic devices such as terminal devices, computer systems, servers, etc., which are operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known terminal devices, computing systems, environments, and/or configurations that may be suitable for use with electronic devices, such as terminal devices, computer systems, servers, and the like, include, but are not limited to: personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, microprocessor-based systems, set top boxes, programmable consumer electronics, network pcs, minicomputer systems, mainframe computer systems, distributed cloud computing environments that include any of the above systems, and the like.
Electronic devices such as terminal devices, computer systems, servers, etc. may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform particular tasks or implement particular abstract data types. The computer system/server may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.
Summary of the application
In implementing the present disclosure, the inventors found that, at present, it is common practice to consider the change of nodes in the relational time-series data, and to give priority to the first-time relational time-series data. This practice has at least the following problems: blindness of the system: in an actual production system, if a certain node in the relational time series data changes but the whole relational time series data cannot be corrected, the blindness of the system is easily caused, the blindness of the system causes that the business process is blocked, for example, goods are from A-B-C-D, wherein the time series data of the point B changes (for example, timeB > timeC), and if the data of the point B-C-D cannot be corrected again, the data of the point C-D loses the guidance function; the manual operation cost is high: for the condition that the relational time series data are changed but not corrected, offline manual intervention is mostly adopted for readjustment, and when the occurrence frequency of the change is more and more high, a large amount of manual intervention is needed, so that the labor cost is greatly increased; the user experience is weak: for example, the tracking of the route of the goods is usually shown to the user, so that the user can intuitively know where the goods are in and when the goods can be received, and if the relational time-series data is sent to be changed but not corrected, the user cannot track the current time and place of the goods, and the user experience is poor.
Exemplary method
Fig. 1 is a flowchart illustrating a method for correcting a time series according to an exemplary embodiment of the disclosure. The embodiment can be applied to an electronic device, as shown in fig. 1, and includes the following steps:
The service to be executed comprises a plurality of nodes, and the first time sequence comprises scheduled execution time corresponding to each node in all the nodes included in the service to be executed.
Optionally, the service to be executed in this embodiment is a service with an execution time sequence that is suitable for describing a relational time sequence, and the node of the service to be executed represents an executable step in the service to be executed. For example, when the service to be executed is a logistics service, the node reaches different intermediate stations, and the like.
And 104, executing the service to be executed according to the first time sequence.
In an embodiment, the first time sequence is static time sequence data, where the execution time corresponding to each node is a scheduled execution time, and ideally (before the node goes wrong), each node executes according to its corresponding scheduled execution time.
Optionally, since there is an association between a plurality of nodes in the relational time series, there is an association between a plurality of nodes in the service to be executed, and when a certain node is faulty, at least one node in all nodes after the node may not be able to execute according to the scheduled execution time, at this time, it is necessary to correct the first time series to ensure that no contradiction occurs between the scheduled execution times of the plurality of nodes in the corrected time series (for example, the execution time of the node that is executed later is earlier than the execution time of the node that is executed earlier), in this embodiment, the node that is faulty in each of the plurality of nodes in the service to be executed may be corrected.
And 106, responding to the first node in the first time sequence to generate errors, and correcting the first time sequence to obtain a third time sequence.
Optionally, the modifying process for the first time series in step 106 may include: and modifying the planned execution time corresponding to all nodes behind the first node in the first time sequence to obtain a third time sequence.
Optionally, in this embodiment, the modification process for the first time series may be implemented by using the same or different rule as that used for generating the first time series, for example, a logic rule or algorithm refers to a concatenation rule and a calculation manner with a context relationship, which are established based on actually existing business meanings for the time series data. The rule of concatenation: comparison of sizes, verification of existing relationships, etc.; the calculation method comprises the following steps: and calculating data formulas based on addition, subtraction, multiplication, division and the like of time points in the time series.
In this embodiment, when the third time sequence is used as the first time sequence and the service to be executed is executed according to the first time sequence, before continuing from the first node where the error occurs, the scheduled execution time corresponding to the node that has not made an error before the first node is not corrected; according to the embodiment, when a plurality of nodes in the time sequence corresponding to the service to be executed are in error, the scheduled execution time corresponding to the node after the error node is executed is sequentially corrected, that is, the third time sequence obtained through intermediate correction is dynamic time sequence data, and the embodiment realizes multiple corrections on the dynamic time sequence data.
The method for correcting a time sequence provided by the above embodiment of the present disclosure determines a first time sequence based on a service to be executed; executing the service to be executed according to the first time sequence; in response to the fact that at least one node has an error in the process of executing the service to be executed, the first time sequence is corrected at least once to obtain a second time sequence, and in the embodiment, for the case that the node has an error in the relational time sequence, the time sequence is corrected to enable the corrected second time sequence to be effective sequence data, so that the problems of system blindness, high manual operation cost and poor user experience when the traditional relational time sequence data is used for responding to changes are solved. The beneficial effects of this embodiment include: responding timeliness, if the intermediate link of the static relational time sequence data with guiding significance is abnormal, timely correcting the abnormal link, generating dynamic relational time sequence data with new guiding significance, and further guiding subsequent production; the manual operation cost is reduced, the relational time series data with guiding significance are corrected in time, the probability of manual intervention can be reduced, and the labor cost is greatly reduced; the user experience is improved, even if the intermediate link of the relational time series data with the business meaning is abnormal, the final state can be updated in time in a correction mode, the user can really feel the people-goods consensus, the user perception is improved, and the experience is enhanced.
Optionally, step 106 may include:
and in response to the fact that the actual execution time of executing the first node is not matched with the planned execution time corresponding to the first node in the first time sequence, correcting the first time sequence to obtain a third time sequence.
Optionally, there are two possibilities that the actual execution time of the first node is not matched with the scheduled execution time, one is that the actual execution time of executing the first node is later than the scheduled execution time corresponding to the first node in the first time sequence, and in this case, the first time sequence must be corrected to ensure that no error occurs in the execution of the subsequent node in the service to be executed; the other is that the actual execution time of executing the first node is later than the scheduled execution time corresponding to the first node in the first time series, in which case, whether to modify the first time series is optional, but in order to provide a more suitable time series for the same service next time, the first time series in this case may be modified.
And/or the presence of a gas in the gas,
and when the first node of the first time sequence is responded to be executed, the sequence correction instruction is received, and the first time sequence is corrected according to the sequence correction instruction to obtain a third time sequence.
In this embodiment, whether to modify the first time sequence may be determined according to a relationship between an actual execution time of the first node and a scheduled execution time, and/or may be executed according to an external instruction, which increases flexibility of modification, realizes automatic error handling, improves modification efficiency, and ensures subjective initiative of a user, and when the user requests modification of the time sequence, the time sequence is modified according to the request. For example, when an abnormality occurs in the intermediate link of the static relational time-series data, the subsequent link relational time-series data is calculated based on the logic rule or algorithm (the logic index refers to the logic of data concatenation, specifically see step 2) again by self-driving (the self-driving refers to the data abnormality alarm triggering of the data itself, such as the occurrence of data singular values, etc.) or external driving (the external driving refers to the reception of external data as a trigger point, such as the reception of mq messages, etc.), so as to generate the dynamic relational time-series data.
As shown in fig. 2, based on the embodiment shown in fig. 1, step 102 may include the following steps:
Wherein all nodes include a start node, an end node, and all executable nodes.
In this embodiment, after determining the service to be executed, the start node and the end node may determine, for example, logistics service according to the service to be executed, where the start node is for delivery and the end node is for receipt; the intermediate executable node may be determined according to the specific situation of the service to be executed in combination with a set rule, and plan execution time is respectively allocated to each node according to the set rule, for example, the set rule may include a logic rule or an algorithm, which refers to a concatenation rule and a calculation method with a context relationship established by time series data based on the actually existing service meaning. The rule of concatenation: comparison of sizes, verification of existing relationships, etc.; the calculation method comprises the following steps: and calculating data formulas based on addition, subtraction, multiplication, division and the like of time points in the time series.
Fig. 3 is a schematic diagram of a first time series generated by a time series modification method according to another exemplary embodiment of the disclosure. As shown in fig. 3, the start node in the first time series is time series a, the end node is time series E, the first time series specifically includes time series a, time series B, time series C, time series D, and time series E, and the interval between each two time series is determined by a logic rule or algorithm, for example, time series a.time < time series a-b.time 2; wherein, time0-time1 represents the execution cycle of the node in time series A, time4-time5 represents the execution cycle of the node in time series B, time8-time9 represents the execution cycle of the node in time series C, time12-time13 represents the execution cycle of the node in time series D, and time16-time17 represents the execution cycle of the node in time series E; by determining all nodes and their corresponding execution times (corresponding execution periods), a relational time series can be obtained.
Optionally, the method provided in this embodiment further includes:
the first time series and the second time series are saved.
In this embodiment, in order to compare the actual execution time with the planned execution time in the subsequent process, after the second time series is obtained, the first time series and the second time series are saved.
Optionally, the method provided in this embodiment further includes:
comparing the stored second time series with the first time series;
and adjusting the set rule based on the comparison result.
Optionally, in order to improve that a more accurate first time sequence can be provided for the same service next time to reduce the number of node errors in the first time sequence, in this embodiment, the first time sequence is compared with the second time sequence, for example, when the scheduled execution time corresponding to each node in the second time sequence is later than the scheduled execution time corresponding to each node in the first time sequence, the scheduled execution time is shifted backwards when the scheduled execution time is determined for each node in the service next time, so as to reduce the probability of node errors.
In an alternative application example, a new room transaction path is taken as an example to illustrate the application of the relational time-series data correction method. Fig. 4 is a flowchart illustrating a method for correcting a time series according to still another exemplary embodiment of the present disclosure. As shown in fig. 4, in the process of correcting the time series, when the actual execution time does not match the scheduled execution time, the first time series is corrected, which is expressed as: if the client does not coincide with the planned time in the house purchasing process, timely correction is carried out, and the house purchasing process is planned again.
Any time series correction method provided by the embodiment of the present disclosure may be executed by any suitable device with data processing capability, including but not limited to: terminal equipment, a server and the like. Alternatively, any time series correction method provided by the embodiments of the present disclosure may be executed by a processor, for example, the processor may execute any time series correction method mentioned in the embodiments of the present disclosure by calling a corresponding instruction stored in a memory. And will not be described in detail below.
Exemplary devices
Fig. 5 is a schematic structural diagram of a time-series correction apparatus according to an exemplary embodiment of the present disclosure. As shown in fig. 5, the present embodiment includes:
a sequence determining module 51, configured to determine a first time sequence based on the service to be executed.
The service to be executed comprises a plurality of nodes, and the first time sequence comprises scheduled execution time corresponding to each node in all the nodes included in the service to be executed.
And the service execution module 52 is configured to execute the service to be executed according to the first time sequence.
A sequence correction module 53, configured to respond to an error occurring in a first node in the first time sequence, and correct the first time sequence to obtain a third time sequence; judging whether the service to be executed further comprises unexecuted nodes, if so, taking the third time sequence as the first time sequence, and continuing to execute the unexecuted nodes in the service to be executed; otherwise, the third time sequence is taken as the second time sequence.
The correction device for time series provided by the above embodiment of the present disclosure determines a first time series based on a service to be executed; executing the service to be executed according to the first time sequence; in response to the fact that at least one node has an error in the process of executing the service to be executed, the first time sequence is corrected at least once to obtain a second time sequence, and in the embodiment, for the case that the node has an error in the relational time sequence, the time sequence is corrected to enable the corrected second time sequence to be effective sequence data, so that the problems of system blindness, high manual operation cost and poor user experience when the traditional relational time sequence data is used for responding to changes are solved.
Optionally, when responding to an error occurring at a first node in the first time sequence and correcting the first time sequence to obtain a third time sequence, the sequence correction module 53 is configured to respond to that an actual execution time for executing the first node is not matched with a planned execution time corresponding to the first node in the first time sequence and correct the first time sequence to obtain the third time sequence; and/or receiving a sequence correction instruction when the first node of the first time sequence is executed, and correcting the first time sequence according to the sequence correction instruction to obtain a third time sequence.
Optionally, when determining that the actual execution time of the first node does not match the planned execution time corresponding to the first node in the first time series, the sequence modification module includes: and determining that the actual execution time of the first node is later than the planned execution time corresponding to the first node in the first time sequence.
Optionally, the sequence modification module is configured to modify the scheduled execution time corresponding to all nodes after the first node in the first time sequence to obtain a third time sequence when the first time sequence is modified to obtain the third time sequence.
In some optional embodiments, the sequence determining module 51 is specifically configured to determine a starting node and an ending node based on a service to be executed; determining at least one executable node from a starting node to an ending node according to a set rule, and respectively distributing scheduled execution time for all nodes in the service to be executed; all nodes comprise a start node, an end node and all executable nodes; and determining a first time sequence based on the scheduled execution time corresponding to each node in all the nodes.
In this embodiment, after determining the service to be executed, the start node and the end node may determine, for example, logistics service according to the service to be executed, where the start node is for delivery and the end node is for receipt; the intermediate executable node may be determined according to the specific situation of the service to be executed in combination with a set rule, and plan execution time is respectively allocated to each node according to the set rule, for example, the set rule may include a logic rule or an algorithm, which refers to a concatenation rule and a calculation method with a context relationship established by time series data based on the actually existing service meaning. The rule of concatenation: comparison of sizes, verification of existing relationships, etc.; the calculation method comprises the following steps: and calculating data formulas based on addition, subtraction, multiplication, division and the like of time points in the time series.
Optionally, the apparatus provided in this embodiment further includes:
and the sequence storage module is used for storing the first time sequence and the second time sequence.
Optionally, the apparatus provided in this embodiment further includes:
the sequence comparison module is used for comparing the stored second time sequence with the first time sequence; and adjusting the set rule based on the comparison result.
Exemplary electronic device
Next, an electronic apparatus according to an embodiment of the present disclosure is described with reference to fig. 6. The electronic device may be either or both of the first device 100 and the second device 200, or a stand-alone device separate from them that may communicate with the first device and the second device to receive the collected input signals therefrom.
FIG. 6 illustrates a block diagram of an electronic device in accordance with an embodiment of the disclosure.
As shown in fig. 6, the electronic device 60 includes one or more processors 61 and a memory 62.
The processor 61 may be a Central Processing Unit (CPU) or other form of processing unit having data processing capabilities and/or instruction execution capabilities, and may control other components in the electronic device 60 to perform desired functions.
In one example, the electronic device 60 may further include: an input device 63 and an output device 64, which are interconnected by a bus system and/or other form of connection mechanism (not shown).
For example, when the electronic device is the first device 100 or the second device 200, the input device 63 may be a microphone or a microphone array as described above for capturing an input signal of a sound source. When the electronic device is a stand-alone device, the input means 63 may be a communication network connector for receiving the acquired input signals from the first device 100 and the second device 200.
The input device 63 may also include, for example, a keyboard, a mouse, and the like.
The output device 64 may output various information including the determined distance information, direction information, and the like to the outside. The output devices 14 may include, for example, a display, speakers, a printer, and a communication network and its connected remote output devices, among others.
Of course, for simplicity, only some of the components of the electronic device 60 relevant to the present disclosure are shown in fig. 6, omitting components such as buses, input/output interfaces, and the like. In addition, the electronic device 60 may include any other suitable components depending on the particular application.
Exemplary computer program product and computer-readable storage Medium
In addition to the above-described methods and apparatus, embodiments of the present disclosure may also be a computer program product comprising computer program instructions that, when executed by a processor, cause the processor to perform the steps in a method of modifying a time series according to various embodiments of the present disclosure described in the "exemplary methods" section above of this specification.
The computer program product may write program code for carrying out operations for embodiments of the present disclosure in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server.
Furthermore, embodiments of the present disclosure may also be a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, cause the processor to perform the steps in the time-series correction method according to various embodiments of the present disclosure described in the "exemplary method" section above in this specification.
The computer-readable storage medium may take any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may include, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The foregoing describes the general principles of the present disclosure in conjunction with specific embodiments, however, it is noted that the advantages, effects, etc. mentioned in the present disclosure are merely examples and are not limiting, and they should not be considered essential to the various embodiments of the present disclosure. Furthermore, the foregoing disclosure of specific details is for the purpose of illustration and description and is not intended to be limiting, since the disclosure is not intended to be limited to the specific details so described.
In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts in the embodiments are referred to each other. For the system embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The block diagrams of devices, apparatuses, systems referred to in this disclosure are only given as illustrative examples and are not intended to require or imply that the connections, arrangements, configurations, etc. must be made in the manner shown in the block diagrams. These devices, apparatuses, devices, systems may be connected, arranged, configured in any manner, as will be appreciated by those skilled in the art. Words such as "including," "comprising," "having," and the like are open-ended words that mean "including, but not limited to," and are used interchangeably therewith. The words "or" and "as used herein mean, and are used interchangeably with, the word" and/or, "unless the context clearly dictates otherwise. The word "such as" is used herein to mean, and is used interchangeably with, the phrase "such as but not limited to".
The methods and apparatus of the present disclosure may be implemented in a number of ways. For example, the methods and apparatus of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above unless specifically stated otherwise. Further, in some embodiments, the present disclosure may also be embodied as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.
It is also noted that in the devices, apparatuses, and methods of the present disclosure, each component or step can be decomposed and/or recombined. These decompositions and/or recombinations are to be considered equivalents of the present disclosure.
The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
The foregoing description has been presented for purposes of illustration and description. Furthermore, this description is not intended to limit embodiments of the disclosure to the form disclosed herein. While a number of example aspects and embodiments have been discussed above, those of skill in the art will recognize certain variations, modifications, alterations, additions and sub-combinations thereof.
Claims (10)
1. A method for correcting a time series, comprising:
determining a first time sequence based on a service to be executed; the service to be executed comprises a plurality of nodes, and the first time sequence comprises a scheduled execution time corresponding to each node in all nodes included in the service to be executed;
executing the service to be executed according to the first time sequence;
responding to the first node in the first time sequence to generate errors, and correcting the first time sequence to obtain a third time sequence;
judging whether the service to be executed further comprises nodes which are not executed, if so, taking the third time sequence as the first time sequence, and continuing to execute the nodes which are not executed in the service to be executed; and if not, taking the third time sequence as a second time sequence.
2. The method of claim 1, wherein modifying the first time series in response to the first node in the first time series having an error, resulting in a third time series, comprises:
in response to the fact that the actual execution time of executing the first node is not matched with the planned execution time corresponding to the first node in the first time sequence, correcting the first time sequence to obtain a third time sequence; and/or the presence of a gas in the gas,
and when responding to the first node of the first time sequence, receiving a sequence correction instruction, and correcting the first time sequence according to the sequence correction instruction to obtain a third time sequence.
3. The method of claim 2, wherein the actual execution time of the first node is not matched to the scheduled execution time corresponding to the first node in the first time series, comprising:
and the actual execution time of executing the first node is later than the planned execution time corresponding to the first node in the first time sequence.
4. The method according to any one of claims 1-3, wherein said modifying the first time series to obtain a third time series comprises:
and modifying the planned execution time corresponding to all nodes after the first node in the first time sequence to obtain the third time sequence.
5. The method according to any of claims 1-4, wherein said determining a first time sequence based on traffic to be performed comprises:
determining a starting node and an ending node based on the service to be executed;
determining at least one executable node from the starting node to the ending node according to a set rule, and respectively allocating scheduled execution time to all nodes in the service to be executed; the all nodes include the start node, the end node, and the all executable nodes;
and determining the first time sequence based on the scheduled execution time corresponding to each node in all the nodes.
6. The method of claim 5, further comprising:
saving the first time series and the second time series.
7. The method of claim 6, further comprising:
comparing the stored second time series with the first time series;
and adjusting the set rule based on the comparison result.
8. A time-series correction apparatus, comprising:
the sequence determining module is used for determining a first time sequence based on the service to be executed; the service to be executed comprises a plurality of nodes, and the first time sequence comprises a scheduled execution time corresponding to each node in all nodes included in the service to be executed;
a service execution module, configured to execute the service to be executed according to the first time sequence;
the sequence correction module is used for responding to the error of a first node in the first time sequence, correcting the first time sequence and obtaining a third time sequence; judging whether the service to be executed further comprises nodes which are not executed, if so, taking the third time sequence as the first time sequence, and continuing to execute the nodes which are not executed in the service to be executed; and if not, taking the third time sequence as a second time sequence.
9. A computer-readable storage medium, characterized in that the storage medium stores a computer program for executing the time-series correction method according to any one of claims 1 to 7.
10. An electronic device, characterized in that the electronic device comprises:
a processor;
a memory for storing the processor-executable instructions;
the processor is used for reading the executable instructions from the memory and executing the instructions to realize the time series correction method of any one of the above claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911168751.3A CN111046028A (en) | 2019-11-25 | 2019-11-25 | Time sequence correction method and device, readable storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911168751.3A CN111046028A (en) | 2019-11-25 | 2019-11-25 | Time sequence correction method and device, readable storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111046028A true CN111046028A (en) | 2020-04-21 |
Family
ID=70233337
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911168751.3A Pending CN111046028A (en) | 2019-11-25 | 2019-11-25 | Time sequence correction method and device, readable storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111046028A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116991681A (en) * | 2023-09-27 | 2023-11-03 | 北京中科润宇环保科技股份有限公司 | NLP-combined fly ash fusion processing system abnormality report identification method and server |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101770616A (en) * | 2010-02-09 | 2010-07-07 | 北京航空航天大学 | Multi-level collaborative project plan management method |
| CN107885609A (en) * | 2017-11-08 | 2018-04-06 | 泰康保险集团股份有限公司 | Service conflict processing method and processing device, storage medium and electronic equipment |
| CN109345108A (en) * | 2018-09-26 | 2019-02-15 | 湖南人文科技学院 | Method for allocating tasks, device, equipment and storage medium |
| CN109636099A (en) * | 2018-10-31 | 2019-04-16 | 平安科技（深圳）有限公司 | Project process collection method, device, equipment and computer readable storage medium |
| CN110231985A (en) * | 2019-06-17 | 2019-09-13 | 三角兽（北京）科技有限公司 | Operation flow data processing method, device, electronic equipment and storage medium |
-
2019
- 2019-11-25 CN CN201911168751.3A patent/CN111046028A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101770616A (en) * | 2010-02-09 | 2010-07-07 | 北京航空航天大学 | Multi-level collaborative project plan management method |
| CN107885609A (en) * | 2017-11-08 | 2018-04-06 | 泰康保险集团股份有限公司 | Service conflict processing method and processing device, storage medium and electronic equipment |
| CN109345108A (en) * | 2018-09-26 | 2019-02-15 | 湖南人文科技学院 | Method for allocating tasks, device, equipment and storage medium |
| CN109636099A (en) * | 2018-10-31 | 2019-04-16 | 平安科技（深圳）有限公司 | Project process collection method, device, equipment and computer readable storage medium |
| CN110231985A (en) * | 2019-06-17 | 2019-09-13 | 三角兽（北京）科技有限公司 | Operation flow data processing method, device, electronic equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116991681A (en) * | 2023-09-27 | 2023-11-03 | 北京中科润宇环保科技股份有限公司 | NLP-combined fly ash fusion processing system abnormality report identification method and server |
| CN116991681B (en) * | 2023-09-27 | 2024-01-30 | 北京中科润宇环保科技股份有限公司 | NLP-combined fly ash fusion processing system abnormality report identification method and server |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108153670B (en) | Interface testing method and device and electronic equipment | |
| US20210304201A1 (en) | Transaction verification method and apparatus, storage medium, and electronic device | |
| US11847480B2 (en) | System for detecting impairment issues of distributed hosts | |
| US20190057379A1 (en) | Systems and methods for data file transfer balancing and control on blockchain | |
| US8850575B1 (en) | Geolocation error tracking in transaction processing | |
| US11307949B2 (en) | Decreasing downtime of computer systems using predictive detection | |
| US11176517B2 (en) | System and method for anomaly detection and deduplication of electronic data feeds | |
| CN111353841B (en) | Document data processing method, device and system | |
| EP3665623A1 (en) | Multi-platform model processing and execution management engine | |
| CN111046028A (en) | Time sequence correction method and device, readable storage medium and electronic equipment | |
| US20220358162A1 (en) | Method and system for automated feedback monitoring in real-time | |
| CN113064905B (en) | Business process processing method, device, electronic equipment and computer readable medium | |
| US10740306B1 (en) | Large object partitioning system | |
| CN110991992A (en) | Business process information processing method and device, storage medium and electronic equipment | |
| US11714699B2 (en) | In-app failure intelligent data collection and analysis | |
| CN115640310A (en) | Method and device for business data aggregation, electronic equipment and storage medium | |
| CN111581213B (en) | Information recording method, device and equipment | |
| CN117692463B (en) | Block generation method, device, equipment and medium based on block chain network | |
| CN114374650B (en) | Notification sending method based on routing middleware, storage medium and electronic equipment | |
| CN109067611A (en) | The method, apparatus of communication state, storage medium and processor between detection system | |
| CN110430267A (en) | Ballot associated data processing method and its device on block chain | |
| US11551024B1 (en) | Hybrid clustered prediction computer modeling | |
| CN115545935B (en) | Block chain transaction account processing method and device, equipment and medium | |
| US11977439B2 (en) | Method and system for actionable smart monitoring of error messages | |
| CN112016081B (en) | Method, device, medium and electronic equipment for realizing identifier mapping |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200421 |