CN117112173A

CN117112173A - Task sequence adjusting method, device, equipment and storage medium

Info

Publication number: CN117112173A
Application number: CN202311078839.2A
Authority: CN
Inventors: 吴鑫; 林平; 唐琦松; 靳志业; 蒋奕然
Original assignee: Shanghai I Search Software Co ltd
Current assignee: Shanghai I Search Software Co ltd
Priority date: 2023-08-25
Filing date: 2023-08-25
Publication date: 2023-11-24

Abstract

The invention relates to a method, a device, equipment and a storage medium for adjusting a task sequence, which comprise the following steps: when an adjustment instruction of a user for at least one original task sequence is acquired, based on the adjustment instruction and the dependency relationship between operation event nodes carried by the original operation log, the operation of automatically expanding and/or contracting the task sequence is performed on the unadjusted original task sequence. The invention can realize automatic adjustment of the unadjusted original task sequences based on the adjustment instruction of the user on one or more original task sequences, thereby greatly improving the automation efficiency and reducing the manual intervention.

Description

Task sequence adjusting method, device, equipment and storage medium

Technical Field

The present invention relates to the field of information processing technologies, and in particular, to a method, an apparatus, a device, and a storage medium for adjusting a task sequence.

Background

In the related product of task mining, a plurality of corresponding task sequences can be automatically generated based on an original operation log, and in practical application, users tend to adjust the task sequences generated automatically, for example, one or a plurality of operation event nodes are added to the front section or the tail section of a certain sequence, or one or a plurality of operation event nodes are deleted. If the task sequences are manually adjusted, the efficiency is low and the manual intervention is high.

Therefore, in the prior art, a method for automatically adjusting the remaining task sequences based on the adjustment of one task sequence by the user is needed to improve the automation efficiency and reduce the manual intervention.

Disclosure of Invention

The invention overcomes the defects of the prior art, provides a method, a device, equipment and a storage medium for adjusting task sequences, and discloses a method for automatically adjusting other task sequences based on the adjustment of one task sequence by a user so as to improve the automation efficiency and reduce the manual intervention.

In order to achieve the above purpose, the invention adopts the following technical scheme: a method of adjusting a task sequence, comprising:

acquiring a plurality of original task sequences used for representing the operation of a computer desktop and corresponding original operation logs; the original task sequence is a time sequence formed by operation event nodes, and is extracted from the original operation log;

acquiring an adjustment instruction of a user aiming at least one original task sequence; wherein the adjustment instruction comprises an instruction for expanding a task sequence and/or contracting the task sequence;

and executing the operation of expanding and/or contracting the task sequence on the unadjusted original task sequence based on the adjustment instruction and the dependency relationship among the operation event nodes carried by the original operation log.

In a preferred embodiment of the present invention, the instruction for expanding the task sequence includes information indicating a first target operation event node, where the first target operation event node is a node of a subtask sequence expanded into the original task sequence;

when the adjustment instruction is an instruction for expanding a task sequence, based on the adjustment instruction and the dependency relationship between the operation event nodes carried by the original operation log, executing the step of expanding the unadjusted original task sequence, including:

based on the extended task sequence instruction and the original operation log, judging whether at least one first target operation event node exists outside a corresponding end of the unadjusted original task sequence and in one or more time windows;

under the condition that at least one first target operation event node in the instruction of the extended task sequence is arranged in one or more time windows, judging whether the first target operation event node has a dependency relationship with each operation event node in the unadjusted original task sequence or not based on the dependency relationship between each operation event node carried by an original operation log;

And under the condition that the first target node has a dependency relationship with at least one operation event node in the unadjusted original task sequence, the first target operation event node and the operation event node between the first target operation event node and the unadjusted original task sequence are contained in the unadjusted original task sequence according to a time sequence relationship based on the original operation log.

In a preferred embodiment of the present invention, the instruction for shrinking the task sequence includes information indicating a second target operation event node, where the second target operation event node is a node of the subtask sequence that is removed from the original task sequence;

when the adjustment instruction is an instruction for shrinking the task sequence, the step of executing the operation for shrinking the task sequence on the unadjusted original task sequence based on the adjustment instruction and the dependency relationship between the operation event nodes carried by the original operation log includes:

judging whether at least one second target operation event node exists in one or more time windows and is in one corresponding end of the unadjusted original task sequence based on the contracted task sequence instruction and the original operation log;

Under the condition that at least one second target operation event node in the instruction of the contracted task sequence is arranged in one or more time windows, judging whether the second target operation event node has a dependency relationship with other operation event nodes from the second target operation event node to one end of the unadjusted original task sequence or not according to the dependency relationship among the operation event nodes carried by the original operation log; wherein the one end corresponds to a shrink task sequence instruction;

and deleting the second target operation event node and the rest operation event nodes from the unadjusted original task sequence under the condition that the second target operation event node and the rest operation event nodes have a dependency relationship.

In a preferred embodiment of the present invention, the information representing the first target operation event node and the information representing the second target operation event node at least include information representing a window title or information representing a page title.

In a preferred embodiment of the invention, the time window is one half minute or one minute.

In a preferred embodiment of the present invention, when acquiring a plurality of original task sequences and corresponding original operation logs for characterizing the operation of a desktop of a computer, or when acquiring an adjustment instruction of a user for at least one task sequence, the method further includes:

Taking the original operation log as input of a preset flow mining algorithm, and calculating the dependency relationship of each operation event node in the original operation log through the flow mining algorithm; wherein the dependency relationship is expressed as dependent or independent.

In a preferred embodiment of the present invention, a plurality of original task sequences for characterizing the operation of a computer desktop are automatically extracted from the original operation log by a process mining algorithm; or manually extracted from the original operation log.

In a preferred embodiment of the present invention, an apparatus for adjusting a task sequence includes:

the first acquisition module is used for acquiring a plurality of original task sequences used for representing the operation of the desktop of the computer and corresponding original operation logs; the original task sequence is a time sequence formed by operation event nodes, and is extracted from the original operation log;

the second acquisition module is used for acquiring an adjustment instruction of a user for at least one original task sequence; wherein the adjustment instruction comprises an instruction for expanding a task sequence and/or contracting the task sequence;

And the automatic adjustment module is used for executing the operation of expanding and/or contracting the task sequence on the unadjusted original task sequence based on the adjustment instruction and the dependency relationship among the operation event nodes carried by the original operation log.

In a preferred embodiment of the present invention, an apparatus comprises: a memory; a processor; a computer program; wherein the computer program is stored in the memory and configured to be executed by the processor to implement a method of adjusting a task sequence.

In a preferred embodiment of the invention, a storage medium has stored thereon a computer program which, when executed by a processor, implements a method for adjusting a task sequence.

A storage medium having stored thereon a computer program which, when executed by a processor, implements a method of adjusting a task sequence.

The invention solves the defects existing in the background technology, and has the beneficial effects that:

the invention provides a method, a device, equipment and a storage medium for adjusting task sequences, which are used for executing the operation of automatically expanding and/or contracting the task sequences of unadjusted original task sequences based on the adjustment instruction and the dependency relationship among operation event nodes carried by an original operation log when an adjustment instruction of a user for at least one original task sequence is obtained. The invention can realize automatic adjustment of the unadjusted original task sequences based on the adjustment instruction of the user on one or more original task sequences, thereby greatly improving the automation efficiency and reducing the manual intervention.

Drawings

The invention will be further described with reference to the drawings and examples.

FIG. 1 is a schematic diagram of an example of a scenario provided by an embodiment of the present invention;

FIG. 2 is a flowchart of a method for adjusting a task sequence according to an embodiment of the present invention;

FIG. 3 is a block diagram of an apparatus for adjusting a task sequence according to an embodiment of the present invention;

fig. 4 is a block diagram of an electronic device according to an embodiment of the present invention.

Detailed Description

The invention will now be described in further detail with reference to the drawings and examples, which are simplified schematic illustrations of the basic structure of the invention, which are presented only by way of illustration, and thus show only the structures that are relevant to the invention.

Before explaining the embodiments of the present invention in detail, a specific scenario is exemplified to disclose a scenario in which the technical solution of the present invention may be used. Specifically, fig. 1 is an application scenario diagram of a method, an apparatus, a device, and a storage medium for adjusting a task sequence according to the present invention, where the application scenario may include: server and client.

The server may be an electronic device having a certain arithmetic processing capability. For example, the server may be a server of a distributed system, or may be a system having a plurality of processors, memories, network communication modules, etc. operating in conjunction. The server can also be a cloud server, or an intelligent cloud computing server or an intelligent cloud host with artificial intelligence technology. The server may also be a cluster of servers formed for several servers. Or, with the development of science and technology, the server may also be a new technical means capable of realizing the corresponding functions of the embodiment of the specification. For example, a new form of "server" based on quantum computing implementation may be possible.

The client may be an electronic device with network access capabilities. Specifically, for example, the client may be a desktop computer, a tablet computer, a notebook computer, or the like. Alternatively, the client may be software capable of running in the electronic device.

The data interaction between the server and the client is performed through a network, which may be any type of network that may support data communications using any of a variety of available protocols, including but not limited to TCP/IP, SNA, IPX, etc. The one or more networks may be a Local Area Network (LAN), an ethernet-based network, a token ring, a Wide Area Network (WAN), the internet, a virtual network, a Virtual Private Network (VPN), an intranet, an extranet, a Public Switched Telephone Network (PSTN), an infrared network, a wireless network (e.g., bluetooth, WIFI), and/or any combination of these and/or other networks.

Furthermore, the application scene can also comprise a database, and the database can store the pre-collected original operation log. The database and the server can interact data through the network. It should be noted that, the task sequence adjustment method disclosed in the present invention may be executed by the above-mentioned server, and the corresponding task sequence adjustment device may be configured in the above-mentioned server.

Example 1

As shown in fig. 2, a method for adjusting a task sequence may be applied to the above-mentioned server, and includes:

step S100, acquiring a plurality of original task sequences and corresponding original operation logs for representing the operation of a computer desktop; the original task sequence is a time sequence composed of operation event nodes, and the original task sequence is extracted from the original operation log.

In this embodiment, the original operation log is obtained by collecting the desktop operation of the computer of the user through a data set collector deployed on the user terminal. The original operation log stores a plurality of log records, each log record being used to characterize one of the operation events of the computing desktop operation. Each log record or each operational event node may be configured with a plurality of fields, such as a field storing a window header or page header, a field storing a timestamp, a field storing an event type, a field storing an element tag or name, and so forth. It should be noted that, in the present invention, the operation event and the operation event node refer to the same concept, but only the expression of the same concept in different states, for example, a log record stored in the original operation log, which characterizes an operation event, an operation event node in the original task sequence, which characterizes an operation event, and a corresponding log record can be found in the original operation log.

The original task sequence is a time sequence consisting of one or more operation event nodes related to the task. The original task sequence is extracted from the original operation log, and can be automatically extracted or manually extracted from the original operation log by a user. For example, in the task mining of the product, the product can be automatically extracted from the original operation log based on a process mining algorithm configured in the product, so as to be recommended to the user.

The original task sequence and the plurality of original task sequences for characterizing the computer desktop operation may be stored in a database, so that the obtaining action is represented as a data interaction between the server and the database to invoke the original task sequence and the plurality of original task sequences for characterizing the computer desktop operation.

Step S200, acquiring an adjustment instruction of a user for at least one original task sequence; wherein the adjustment instructions comprise instructions for expanding the task sequence and/or contracting the task sequence.

In this embodiment, the above-mentioned extended task sequence is represented by extending one end or both ends of the original task sequence in the time sequence, so that the extended task sequence can accommodate more operation event nodes relative to the original task sequence. The above-described contracted task sequence is represented by contracting one or both ends of the task sequence in time sequence, so that the contracted task sequence can accommodate fewer operational event nodes relative to the original task sequence.

In this embodiment, the instruction for expanding the task sequence includes information indicating a first target operation event node, where the first target operation event node is a node of a sub-task sequence expanded into the original task sequence. The instruction for shrinking the task sequence includes information representing a second target operation event node, where the second target operation event node is a node of the subtask sequence that is removed from the original task sequence.

In this embodiment, the information indicating the first target operation event node and the information indicating the second target operation event node may be information carried by the first target operation event node and information carried by the second target operation event node, for example, a window title or a page title of the operation event node, and may also be an event type, an element name, an element tag, and so on.

It will be appreciated that in this embodiment, the adjustment instruction may include an instruction of an extended task sequence for the head end or the tail end of the original task sequence, or may include an instruction of an extended task sequence for both the head end and the tail end of the original task sequence. Accordingly, the adjustment instruction may include an instruction for contracting the task sequence with respect to the head end or the tail end of the original task sequence, and may also include an instruction for contracting the task sequence with respect to both the head end and the tail end of the original task sequence.

It will also be appreciated that in this embodiment, the adjustment instruction may further include an instruction for expanding the task sequence at one end of the original task sequence and an instruction for contracting the task sequence at the other end.

Step S300, based on the above-mentioned adjustment instruction and the dependency relationship between the operation event nodes carried by the original operation log, executing the operation of automatically expanding and/or contracting the task sequence on the unadjusted original task sequence.

In view of the brevity and clarity of expression, the original task sequence actively modified by the user may be referred to as a first original task sequence, and the original task sequence automatically modified may be referred to as a second original task sequence. It will be appreciated that the automatic expansion operation should be performed on the second original task sequence based on the instruction of the expanded task sequence and the above-described dependency relationship, and, correspondingly, the automatic contraction operation should be performed on the second original task sequence based on the instruction of the contracted task sequence and the above-described dependency relationship.

It may also be appreciated that the head end or the tail end of the second original task sequence may be automatically extended, or both the head end and the tail end may be automatically extended, based on the instruction of the extended task sequence to the head end of the first original task sequence and the dependency relationship described above. Correspondingly, the head end or the tail end of the second original task sequence can be automatically expanded based on the instruction of the expansion task sequence at the tail end of the first original task sequence and the dependency relationship, and the head end or the tail end of the second original task sequence can be automatically expanded.

It may be further understood that, based on the instruction for the task sequence that contracts the head end of the first original task sequence and the above-mentioned dependency relationship, the head end or the tail end of the second original task sequence may be automatically contracted, or both the head end and the tail end may be automatically contracted. Correspondingly, the head end or the tail end of the second original task sequence can be automatically contracted based on the instruction of the contracted task sequence at the tail end of the first original task sequence and the dependency relationship, and the head end or the tail end of the second original task sequence can be automatically contracted.

In this embodiment, the dependency relationships between the operation events expressed in the original operation log may be the direct dependency relationships between the operation events in the original operation log when the original operation log is obtained in step S100. In step S200, the direct dependency of each operation event in the original operation log may be extracted only when an instruction of the user to expand and/or contract the task sequence for at least one of the task sequences is acquired.

The dependency relationship may be extracted by a process mining algorithm, for example, a heurisics Miner algorithm may be used, and a sequence model mining algorithm may be used, for example, a PrefixSpan may be used. Specifically, when using the Heuristics Miner algorithm, the Heuristics Miner algorithm automatically discovers the dependency relationship between the operation events with the original operation log as input, and generates a process model, and can interpret and analyze the dependency relationship between the operation events according to the generated process model. Further, the strength and direction of the dependency relationship can be determined according to the structures of connection, parallelism, selection and the like in the model. In this embodiment, only whether two events have dependencies may be considered, and the strength and direction of a specific dependency may not be considered. More specifically, first, preprocessing is performed on the original operation log, for example, operation events with the same window title or page title may be classified into one type to reduce the dimensionality of data analysis, and then, a dependency matrix is constructed, that is, a dependency matrix is constructed according to the preprocessed original operation log. The rows and columns of the matrix represent different operational events, respectively, and the elements in the matrix represent whether a dependency exists between two operational events. And finally, dependency mining, namely traversing a dependency matrix, and judging whether a dependency exists between two operation events according to a certain rule or a threshold value. For example, a threshold may be defined that is considered to have a dependency when the number of frequent co-occurrences between two operational events exceeds the threshold.

In some embodiments, when the adjustment instruction is an instruction for expanding a task sequence, the step of executing an operation of automatically expanding and/or contracting the task sequence on the unadjusted original task sequence based on the adjustment instruction and the dependency relationship between the operation event nodes carried by the original operation log may include:

step S301, based on the extended task sequence instruction and the original operation log, determines whether at least one first target operation event node exists outside the corresponding end of the unadjusted original task sequence and within one or more time windows.

The above-mentioned corresponding end is indicated as the end corresponding to the extended task sequence instruction, and in particular, if the extended task sequence instruction is an extension of the first end of the first original task sequence, in this embodiment, it is required to determine whether at least one first target operation event node exists outside the first end of the second original task sequence and within one or more time windows. More specifically, for example, the extended task sequence instruction is a head-end extended task sequence for the first original task sequence, where the sub task sequences extended into the first original task sequence may be [ a, B, C ], where a, B, C each represent an operation event node and each carry a timestamp, so that each operation event node has a time sequence relationship, in this step, it is only required to determine whether a or B or C exists outside the head-end of the second original task sequence and within one or more time windows, and in some cases, it may also be determined whether three first target operation event nodes that are outside the head-end of the second original task sequence and have a, B, C simultaneously within one or more time windows. If at least one first target operation event node exists, the process proceeds to step S302, and the process of step S302 is executed. If not, the method ends, indicating that the second original task sequence does not have the basis of being automatically adjusted. Further, in this embodiment, the criterion for determining whether the first target operation event node exists outside the head end of the second original task sequence and within one or more time windows is: an operational event node having the same window title or page title as the first target operational event node exists within one or more time windows. That is, if the window title or page title of the operation event node is the same as the window title or page title of the first target operation event node, it is defined as present. In some cases, considering finer granularity matching, in case the window title or page title is the same, it may be further judged that the element tags or names are also the same. The window header or page header of the first target operational event is present in the instruction of the extended task sequence.

In this embodiment, the concept of a time window is introduced, in particular, for a specific task, different users have different execution modes, and in most cases, for a person, on a "day" or other longer time scale, the operation behavior of the person on the desktop tends to be irregular, for example, after some users process a task related to work for a period of time, chat for a period of time or browse news by using chat software, so that the brain is relaxed; but user behavior operations at a smaller time scale tend to have similarities and regularity, such as may be half a minute or one minute. In this embodiment, the first target operation event node is searched for by going to the head end or the tail end of the second original task sequence (specifically, whether the head end or the tail end needs to correspond to the extended task sequence instruction) in one or more time windows, and this searching mode considers the actual operation situation of the user, and compared with the searching mode in a plurality of fixed operation events except from the head end or the tail end of the second original task sequence, the method based on the time windows is more flexible and has higher robustness.

In this embodiment, the searching for the presence of the first target operation event node by going to the head end or the tail end of the second original task sequence may specifically be: first, a log record corresponding to a second original task sequence is located from an original operation log based on the second original task sequence, and then, whether a first target operation event node exists or not is searched outwards from the head end or the tail end of the log record. The outward search from the head end of the log record is expressed as: and searching the log record with the previous timestamp in the time sequence relation by taking the log record corresponding to the operation event node at the head end of the second original task sequence as a starting point. Accordingly, the outward search from the tail end of the log record is expressed as: and searching the log record with the later time stamp in the time sequence relation by taking the log record corresponding to the operation event node at the head end of the second original task sequence as a starting point.

In this embodiment, the specific time window or time windows may be determined by a method, specifically, the threshold of the maximum number of time windows may be preset, for example, may be 5, that is, in all the 5 time windows, the first target operation event node is not searched, and the searching is stopped. If the node is searched for the operation event a in the first time window, the search may be stopped, and the process proceeds to step S302. Or continue searching until 5 time windows, judge whether there is B or C operation event node.

Step S302, under the condition that at least one first target operation event node in the instruction of the extended task sequence is provided in one or more time windows, determining whether the first target operation event node has a dependency relationship with each operation event node in the unadjusted original task sequence based on the dependency relationship between each operation event node carried by the original operation log.

In this embodiment, dependency relationships between each operation event node in the original operation log may be mined in advance using a Heuristics Miner algorithm, and the dependency relationships may be expressed as dependency and non-dependency. In this embodiment, whether the first target operation event node has a dependency relationship with each operation event node in the unadjusted original task sequence may be determined by determining whether any one operation event in the first target operation event node and the second original task sequence (that is, the unadjusted original task sequence, and the second original task sequence is an unadjusted original task sequence simplified expression) has a dependency relationship, if so, step S303 is entered, and if not, ending, which indicates that the second original task sequence is not suitable for automatic adjustment. In some embodiments, it may also be determined whether a dependency relationship exists between the first target operation event node and all operation events in the second original task sequence, if and only if a dependency relationship exists between the first target operation event node and all operation events, step S303 is entered, otherwise, the process is ended. The method considers the dependency relationship between the first target operation event node and all operation events in the second original task sequences, so that the method has higher reliability, and correspondingly, fewer sequences can be automatically adjusted in each second original task sequence.

Step S303, when the first target node has a dependency relationship with at least one operation event node in the unadjusted original task sequence, storing the first target operation event node and the operation event node between the first target operation event node and the unadjusted original task sequence into the unadjusted original task sequence according to a time sequence relationship based on the original operation log.

In this embodiment, when the head end of the second original task sequence is automatically adjusted, the above-mentioned storing, based on the original operation log, the first target operation event node and the operation event node between the first target operation event node and the unadjusted original task sequence into the unadjusted original task sequence according to the time sequence relationship is expressed as: and positioning the log record corresponding to the first target operation event node from the original operation log, and then accommodating the log record (the log record exists in the original task sequence) among the log records corresponding to the operation event node at the head end of the second original task sequence into the second original task sequence, so as to realize the automatic expansion of the head end of the second original task sequence. It should be noted that, if the timing relationship of the accommodated operation event node in the original operation log is a→b→c, the timing relationship of the accommodated operation event node should also be a→b→c when the three operation event nodes are accommodated to the head end of the second original task sequence.

Correspondingly, in the case of automatically adjusting the tail end of the second original task sequence, the above-mentioned accommodating, based on the original operation log, the first target operation event node and the operation event node between the first target operation event node and the unadjusted original task sequence into the unadjusted original task sequence according to the time sequence relationship is expressed as: and positioning the log record corresponding to the first target operation event node from the original operation log, and then accommodating the log record (the log record exists in the original task sequence) among the log records corresponding to the operation event node at the tail end of the second original task sequence into the second original task sequence, so as to realize automatic expansion of the tail end of the second original task sequence.

Similarly, in the case of automatic adjustment of both ends of the tail end of the second original task sequence, the execution is as described above.

In some embodiments, when the adjustment instruction is an instruction for shrinking the task sequence, the step of executing the operation of automatically expanding and/or shrinking the task sequence on the unadjusted original task sequence based on the above adjustment instruction and the dependency relationship between the operation event nodes carried by the original operation log includes:

Step S311, based on the contracted task sequence instruction and the original operation log, determines whether at least one second target operation event node exists within a corresponding end of the unadjusted original task sequence and within one or more time windows.

As described in the above embodiment, the instruction for shrinking the task sequence is needed at one end in the step S311, and the detailed description is omitted here.

It should be noted that in this step S311, among the second original task sequences (i.e., the unadjusted original task sequences, the second original task sequences are simplified representations of the unadjusted original task sequences) indicated as being within the above-mentioned one end, correspondingly, the above-mentioned determination is made as to whether at least one second target operation event node exists within the corresponding one end of the unadjusted original task sequences and within one or more time windows, and the second target operation event node exists within the second original task sequences is searched for by taking the one end of the second original task sequences as a starting point and taking the time window as a searching step.

Step S312, judging whether the second target operation event node has a dependency relationship with other operation event nodes from the second target operation event node to one end of the unadjusted original task sequence according to the dependency relationship among the operation event nodes carried by the original operation log under the condition that at least one second target operation event node in the instruction of the contracted task sequence is in one or more time windows; wherein the one end corresponds to a shrink task sequence instruction.

Step S313, deleting the second target operation event node and the rest operation event nodes from the unadjusted original task sequence under the condition that the second target operation event node and the rest operation event nodes have a dependency relationship.

It should be noted that, in this embodiment, in the case that the second target operation event node and the remaining operation event nodes have a dependency relationship, the second target operation event node and the remaining operation event nodes are deleted from the unadjusted original task sequence, specifically, the extended task sequence and the contracted task sequence are different, because for a task sequence, only the task is completed by execution, and any sequence is valid, and there may be various situations in the execution process and the path, but only if execution is completed, the task sequence is valid, but not necessarily the optimal task sequence, and accordingly, if any sequence cannot complete a task, the sequence is not a valid task sequence, but rather the optimal task sequence. Therefore, when the task sequence is contracted, under the condition that the second target operation event node and the other operation event nodes have the dependency relationship, the second target operation event node and the other operation event nodes are deleted from the unadjusted original task sequence, and the method has higher reliability.

Example two

As shown in fig. 3, according to a first embodiment, the present embodiment provides a task sequence adjusting device, including:

and the automatic adjustment module is used for executing the operation of automatically expanding and/or contracting the task sequence on the unadjusted original task sequence based on the adjustment instruction and the dependency relationship among the operation event nodes carried by the original operation log.

Example III

As shown in fig. 4, according to the first embodiment, there is provided an apparatus including a memory; a processor; a computer program; wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method of embodiment 1: acquiring a plurality of original task sequences used for representing the operation of a computer desktop and corresponding original operation logs; the original task sequence is a time sequence formed by operation event nodes, and is extracted from the original operation log; acquiring an adjustment instruction of a user aiming at least one original task sequence; wherein the adjustment instruction comprises an instruction for expanding a task sequence and/or contracting the task sequence; and executing the operation of automatically expanding and/or contracting the task sequence on the unadjusted original task sequence based on the adjustment instruction and the dependency relationship among the operation event nodes carried by the original operation log.

Example IV

Based on the first embodiment, the present embodiment provides a storage medium having stored thereon a computer program that when executed by a processor implements the method described in embodiment 1: acquiring a plurality of original task sequences used for representing the operation of a computer desktop and corresponding original operation logs; the original task sequence is a time sequence formed by operation event nodes, and is extracted from the original operation log; acquiring an adjustment instruction of a user aiming at least one original task sequence; wherein the adjustment instruction comprises an instruction for expanding a task sequence and/or contracting the task sequence; and executing the operation of automatically expanding and/or contracting the task sequence on the unadjusted original task sequence based on the adjustment instruction and the dependency relationship among the operation event nodes carried by the original operation log.

Example five

Based on the first embodiment, the present embodiment further provides a computer program product containing instructions that, when executed by a computer, cause the computer to perform the method for adjusting a task sequence in the first embodiment.

It will be appreciated that the specific examples herein are intended only to assist those skilled in the art in better understanding the embodiments of the present disclosure and are not intended to limit the scope of the present invention.

It will be appreciated that in various embodiments herein, the size of the sequence number of each process does not imply a sequential order of execution, that each process should be determined by its function and inherent logic,

and should not be construed as limiting the practice of the embodiments herein.

It will be appreciated that the various embodiments described in this specification may be implemented either alone or in combination, and are not limited in this regard.

Unless defined otherwise, all technical and scientific terms used in the embodiments of this specification have the same meaning as commonly understood by one of ordinary skill in the art to which this specification belongs. The terminology used in the description is for the purpose of describing particular embodiments only and is not intended to limit the scope of the description.

The term "and/or" as used in this specification includes any and all combinations of one or more of the associated listed items. As used in this specification 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 will be appreciated that the processor of the embodiments of the present description may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method embodiments may be implemented by integrated logic circuits of hardware in a processor or instructions in software form. The processor may be a general purpose processor, a Digital signal processor (Digital SignalProcessor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), an off-the-shelf programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. The methods, steps and logic blocks disclosed in the embodiments of the present specification may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present specification may be embodied directly in hardware, in a decoded processor, or in a combination of hardware and software modules in a decoded processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.

It will be appreciated that the memory in the embodiments of this specification may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable Programmable ROM (EPROM), an Electrically Erasable Programmable ROM (EEPROM), or a flash memory, among others. The volatile memory may be Random Access Memory (RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps described in connection with the embodiments disclosed herein can be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. 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 specification.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system, apparatus and unit may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.

In the several embodiments provided in this specification, it should be understood that the disclosed systems, apparatuses, and methods may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment.

In addition, each functional unit in each embodiment of the present specification may be integrated into one processing unit, each unit may exist alone physically, or two or more units may be integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the present specification may be essentially or portions contributing to the prior art or portions of the technical solutions may be embodied in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present specification. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a read-only memory (ROM), a random-access memory (RAM), a magnetic disk, or an optical disk, etc.

The above-described preferred embodiments according to the present invention are intended to suggest that, from the above description, various changes and modifications can be made by the person skilled in the art without departing from the scope of the technical idea of the present invention. The technical scope of the present invention is not limited to the description, but must be determined according to the scope of claims.

Claims

1. A method for adjusting a task sequence, comprising:

2. The method according to claim 1, wherein the instruction for expanding the task sequence includes information indicating a first target operation event node, the first target operation event node being a node of a sub task sequence expanded into the original task sequence;

3. The method according to claim 2, wherein the instruction for shrinking the task sequence includes information indicating a second target operation event node, the second target operation event node being a node of the sub-task sequence that is removed from the original task sequence;

4. A method of task sequence adaptation as claimed in claim 3, characterized in that the information representing the first target operational event node and the information representing the second target operational event node comprise at least information characterizing a window title or information characterizing a page title.

5. A method of adjusting a task sequence according to claim 2 or 3, wherein the time window is one half minute or one minute.

6. The method for adjusting task sequences according to claim 1, wherein when acquiring a plurality of original task sequences and corresponding original operation logs for characterizing the operation of a desktop of a computer, or when acquiring an adjustment instruction of a user for at least one task sequence, the method further comprises:

7. The method for adjusting task sequences according to claim 1, wherein the plurality of original task sequences for characterizing the operation of the desktop of the computer are automatically extracted from the original operation log by a process mining algorithm; or manually extracted from the original operation log.

8. An apparatus for adjusting a task sequence, comprising:

9. An apparatus, comprising:

a memory;

a processor;

and

a computer program;

wherein the computer program is stored in the memory and is configured to be processed by the processing

An executable to implement the method of any one of claims 1 to 7.

10. A storage medium having a computer program stored thereon, the computer

The program is to implement the method of any one of claims 1 to 7 when executed by a processor.