CN114579349B - Form annular event recognition method and device, electronic equipment and storage medium - Google Patents

Form annular event recognition method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN114579349B
CN114579349B CN202210495694.5A CN202210495694A CN114579349B CN 114579349 B CN114579349 B CN 114579349B CN 202210495694 A CN202210495694 A CN 202210495694A CN 114579349 B CN114579349 B CN 114579349B
Authority
CN
China
Prior art keywords
data
ring
field
event
annular
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.)
Active
Application number
CN202210495694.5A
Other languages
Chinese (zh)
Other versions
CN114579349A (en
Inventor
万雄
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang Taimei Medical Technology Co Ltd
Original Assignee
Zhejiang Taimei Medical Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang Taimei Medical Technology Co Ltd filed Critical Zhejiang Taimei Medical Technology Co Ltd
Priority to CN202210495694.5A priority Critical patent/CN114579349B/en
Publication of CN114579349A publication Critical patent/CN114579349A/en
Application granted granted Critical
Publication of CN114579349B publication Critical patent/CN114579349B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0706Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
    • G06F11/0718Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in an object-oriented system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/079Root cause analysis, i.e. error or fault diagnosis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/10Text processing
    • G06F40/166Editing, e.g. inserting or deleting
    • G06F40/177Editing, e.g. inserting or deleting of tables; using ruled lines
    • G06F40/18Editing, e.g. inserting or deleting of tables; using ruled lines of spreadsheets
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/445Program loading or initiating
    • G06F9/44505Configuring for program initiating, e.g. using registry, configuration files

Abstract

The application discloses a form annular event identification method and device, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring all fields in a target form, and reading configuration values of the fields; converting ring data based on the configuration values of the fields, wherein the ring data comprise the variable field data and self-variable field data corresponding to the variable field data; instantiating a ring event algorithm class with ring data to create a field adjacency matrix; based on the instance class query algorithm and the field adjacency matrix, a ring event in the target form is identified. The form annular event identification method can identify the annular event in the form, and avoids the influence of the configuration of the annular event on the rendering of the landing page.

Description

Form annular event recognition method and device, electronic equipment and storage medium
Technical Field
The application belongs to the technical field of computer data processing, and particularly relates to a form annular event identification method and device, electronic equipment and a storage medium.
Background
With the continuous development of computer technology, more and more data are stored in the form of a form. Taking a master data management (mdm) form as an example, the form field values may be configured using a form designer. However, cyclic dependency may be generated in the configuration process, so that the cyclic dependency problem also exists on the values of mdm form landing pages, and particularly when the number of configured fields is too large, it is difficult for a user to determine the problematic configuration.
The information disclosed in this background section is only for enhancement of understanding of the general background of the application and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
The present application aims to provide a form ring event recognition method, which is used for solving the problem that form ring events generated in form configuration cannot be recognized.
In order to achieve the above object, the present application provides a form ring event recognition method, including:
acquiring all fields in a target form, and reading configuration values of the fields;
converting out ring data based on the configuration values of the fields;
instantiating a ring event algorithm class with the ring data to create a field adjacency matrix;
identifying a ring event in the target form based on an instance class query algorithm and the field adjacency matrix.
In one embodiment, the ring data includes a variant field data and a self-variant field data corresponding to the variant field data;
instantiating a ring event algorithm class using the ring data to create a field adjacency matrix, specifically comprising:
and instantiating the annular event algorithm class based on the corresponding relation between the self-variation field data and the cause-variation field data in the annular data, and determining the out-degree relation and the in-degree relation in the field adjacency matrix.
In one embodiment, the method further comprises:
calling a constructor with the ring data to initialize the ring event algorithm class;
and initializing a data structure of the annular event algorithm class according to the annular data.
In an embodiment, identifying the ring event in the target form based on the instance-class query algorithm and the field adjacency matrix specifically includes:
determining annular node data based on an instance type query algorithm and the field adjacency matrix;
determining a ring data chain corresponding to the ring node data according to the ring node data;
identifying a ring event in the target form based on the ring data chain.
In one embodiment, determining ring node data based on the instance class query algorithm and the field adjacency matrix comprises:
traversing the ring data to acquire data of each field in the ring data;
circularly matching the field adjacency matrix with each field data in the ring data;
and respectively determining field data repeatedly accessed in each matching as ring node data.
In one embodiment, the ring data link corresponding to the ring node data is determined according to the ring node data:
and circularly matching the field adjacency matrix with the ring node data to determine a ring data chain corresponding to the ring node data.
In one embodiment, the dependent field data and the independent field data in the ring data include a field ID.
In one embodiment, identifying the ring event in the target form based on the instance class query algorithm and the field adjacency matrix comprises:
establishing ID mapping of all fields in the target form;
and querying a field corresponding to the annular data chain based on the ID mapping so as to determine the annular event in the target form.
In one embodiment, before matching the field adjacency matrix with each field data in the ring data, the method further comprises:
constructing an object set based on the ring data, wherein the object set comprises field data of out-degree objects which do not exist in the ring data;
inquiring whether each field data in the ring data is located in the object set; if not, the user can not select the specific application,
and determining the corresponding field data as non-ring-shaped node data.
In one embodiment, the method further comprises:
and responding to the identified annular event, and displaying a prompt interface on the currently displayed interface, wherein the prompt interface comprises information for prompting the annular event.
The present application further provides a form annular event recognition apparatus, including:
the acquisition module is used for acquiring all fields in the target form and reading the configuration values of the fields;
a data conversion module for converting out ring data based on the configuration value of the field;
an instantiation module for instantiating a ring event algorithm class using the ring data to create a field adjacency matrix;
and the query module is used for identifying the annular event in the target form based on an example type query algorithm and the field adjacency matrix.
The present application further provides an electronic device, comprising:
at least one processor; and
a memory storing instructions that, when executed by the at least one processor, cause the at least one processor to perform a form loop event recognition method as described above.
The present application also provides a machine-readable storage medium having stored thereon executable instructions that, when executed, cause the machine to perform a form loop event recognition method as described above.
Compared with the prior art, according to the form annular event identification method, the annular event in the target form can be identified based on the example type query algorithm and the field adjacency matrix by converting the annular data according to the configuration values of all the fields in the form and instantiating the annular event algorithm class by using the annular data to create the field adjacency matrix.
In another aspect, by rendering the identified ring events to the currently displayed interface, the user can know in advance the cyclic dependency problem existing in the form through the prompt interface, and the ring event configuration is prevented from influencing the rendering of the landing page.
Drawings
Fig. 1 is a schematic view of an application scenario of a form annular event recognition method and apparatus according to an embodiment of the present application;
FIG. 2 is a flow chart of a form annular event recognition method according to an embodiment of the present application;
FIG. 3 is an interaction diagram of a form annular event recognition method according to an embodiment of the present application;
fig. 4 to 7 are diagrams of form editing pages in a form annular event recognition method according to an embodiment of the present application;
FIG. 8 is a page diagram of a prompt form item with a ring event according to an embodiment of the present application;
FIG. 9 is a block diagram of a form loop event recognition apparatus according to an embodiment of the present application;
fig. 10 is a hardware configuration diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The present application will be described in detail below with reference to embodiments shown in the drawings. The embodiments are not limited to the embodiments, and structural, methodological, or functional changes made by those skilled in the art according to the embodiments are included in the scope of the present disclosure.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims of the present application and in the drawings described above, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Moreover, the terms "comprises," "comprising," and "corresponding" and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements explicitly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Clinical trials of drugs refer to systematic study of drugs in humans to determine the efficacy and safety of drugs. The clinical test stages of the medicine are divided into phase I, phase II, phase III clinical tests and phase IV clinical tests. Phase I is mainly related to preliminary clinical pharmacology and human safety evaluation tests. Phase II is understood to be the initial stage of treatment, which is primarily related to the initial assessment of the therapeutic effect and safety of the drug on the patient with the target indication, and also provides the basis for the design of phase III clinical trial studies and the determination of the dosage regimen for administration. Stage III can be understood as a treatment effect confirmation stage, which is mainly used for further verifying the treatment effect and safety of the drug on a target indication patient, evaluating the relationship between benefit and risk and finally providing a sufficient basis for the examination of a drug registration application. The stage IV is mainly a clinical test after the medicine is on the market, and after the medicine is on the market, the curative effect and adverse reaction of the medicine under the condition of wide use can be continuously tracked so as to evaluate the benefit and risk relationship in the use of ordinary or special people, improve the administration dosage and the like.
During the clinical trial, a data source form file can be set according to the clinical trial scheme and is used for recording the clinical trial data of each subject during the trial. The data source Form may be a Case Report Form (CRF) of EDC (electronic data Capture System, clinical trial data acquisition). The case report form may require the reference to forms such as demographic attributes forms, adverse event forms, merge/past medication forms, PK sample collection forms, past medical history data forms, blood donation history forms, allergy history forms, medication records forms, coagulation function forms, urine routine forms, blood routine forms, and the like.
Referring to fig. 1 and 3, in one particular example scenario, the terminal may access a platform server, which may be communicatively coupled to the EDC system. The terminal can be deployed with a browser, and the platform server can be deployed with a form editor program, so that the terminal can access a form editing page provided by the platform server through a network. Form field information (e.g., form name, form label) entered by the user and configuration of default values for the form field attributes may be received via the form edit page, and after configuration is complete, the user may click a "save" button to request that the form be saved. At this time, the server may execute the form ring event recognition method provided by the present application to determine whether a ring event exists in the configured form field. If yes, displaying form fields related to the annular events on an interface of the terminal; and if the data does not exist, displaying that the storage is successful on an interface of the terminal.
Referring to fig. 2, an embodiment of the method for recognizing a circular event in the form of the present application is described. In this embodiment, the method includes:
and S11, acquiring all fields in the target form, and reading the configuration values of the fields.
The configuration values of the fields may include the user's setting of the formula logic for each field at the time of form configuration.
Referring to fig. 4 to fig. 8, taking the configuration of the mdm form as an example, the user may access the mdm designer interface through the terminal and add or edit the form fields, and the fields may call or customize the required functions during the field configuration. For example, when field configuration is performed on a single line of text, "the value of the single line of text = multi-line text + 1" is configured, that is, the value of the single line of text varies depending on the values of the multi-line text. The "value of single line text = multiple lines of text + 1" configured here may be the configured value of the read single line text field.
And S12, converting the ring data based on the configuration value of the field.
The ring data includes the variant field data and the self-variant field data corresponding to the variant field data.
For example, a single line of text a field has been configured with "a single line of text a value = multiple lines of text B + 1", and in such a field relationship, the single line of text a field is a dependent field and the multiple lines of text B field is a corresponding independent field.
In one embodiment, each field data in the ring data may be stored in a field ID format. For example, a single line of text a field corresponds to a field ID: "a", the multiple lines of text B field corresponds to the field ID: "B", the format of the ring data with a single line of text a field as a dependent field and multiple lines of text B field as a self-varying field may be stored as:
[{sourceID:“B”,targetID:“A”}]。
in some configurations, the two fields may also have a relationship to each other as an independent/dependent variable. For example, a single-line text a field is configured with "a value of single-line text a = multiple lines of text B + 1", and a multiple-line text B field is configured with "a value of multiple lines of text B = single-line text a + 2". At this time, for a single line of text a field, multiple lines of text B fields are the corresponding autovariant fields; meanwhile, for a multi-line text B field, a single line of text a field is also its corresponding autovariant field. The format of the corresponding ring data may be stored as:
[{sourceID:“A”,targetID:“B”},{sourceID:“B”,targetID:“A”}]。
in different embodiments, other attributes of the field, such as the field name, etc., may also be encapsulated in the ring data to accommodate the requirements for these attribute calls in other application scenarios.
And S13, instantiating a ring event algorithm class by using the ring data to create a field adjacency matrix.
Specifically, the out-degree relation and the in-degree relation in the field adjacency matrix may be determined based on the correspondence between the self-variation field data and the dependent variation field data in the ring data.
Here, each field data in the ring data is regarded as each vertex in one directed graph. For a vertex in the directed graph, the point corresponding to the outgoing edge is the outgoing object, and the point corresponding to the incoming edge with the vertex as the head is the incoming object. For example, for ring data [ { sourceID: "B", targetID: "A" }, where the change of the self-variable field data B affects the variable field data A, the variable field data A is the out-degree object of the self-variable field data B, and the self-variable field data B is the in-degree object of the variable field data A, and the process of determining the out-degree object and the in-degree object of each field data here can be regarded as determining the out-degree relation and the in-degree relation in the field adjacency matrix.
In the instantiation process of the ring event algorithm class, a constructor can be called by using ring data to initialize the ring event algorithm class, and a data structure of the ring event algorithm class can be initialized according to the ring data.
Since each ring data corresponds to data having two fields, and there may be duplication of fields between different ring data. Therefore, the field data corresponding to all the ring data can be disassembled and collected, the deduplication operation is performed to obtain all the field data contained in the ring data, and then the out-degree relation and the in-degree relation in the field adjacency matrix are determined according to the field data.
Exemplarily, if the ring data is collected: the field data A, the field data B, the field data C and the field data D, and corresponding field adjacency matrixes are established as follows:
Figure 942894DEST_PATH_IMAGE001
wherein, the row of the matrix represents the out degree relation of the field data (row direction) corresponding to the field data (column direction), "1" represents that there is out degree object relation, and "0" represents that there is no out degree object relation; the columns of the matrix represent the in-degree relationship of field data (column direction) to field data (row direction), "1" represents the in-degree object relationship, and "0" represents no in-degree object relationship. From this adjacency matrix it can be seen that: the out degree object of the field data A comprises field data B and field data D, the out degree object of the field data B comprises the field data A, the out degree object of the field data C comprises the field data B, and the out degree object of the field data D comprises the field data C; the degree object of the field data A is provided with field data B, the degree object of the field data B is provided with field data A and field data C, the degree object of the field data C is provided with field data D, and the degree object of the field data D is the field data A.
When converting each field data in the ring data into a field adjacency matrix, different conversion rules may be provided as necessary. For example, the ring data [ { sourceID: in "B", targetID: "A" }, the self-variable field data B is used as the entry object of the dependent field data A.
S14, identifying the ring event in the target form based on the example type query algorithm and the field adjacency matrix.
Similarly, the ring data may be traversed first to obtain the field data therein. And matching the field adjacency matrix circularly by using each field data in the ring data. In a specific matching process, whether field data in the adjacency matrix is accessed or not can be determined from the out-degree or in-degree direction according to different conversion rules during data conversion in the previous step.
For example, considering in the direction of out-of-degrees, the ring data [ { sourceID: if there is field data B in the out-degree object of field data a in "a", targetID: "B" }, it can be considered that field data a accesses field data B in the field adjacency matrix when field data a accesses the field adjacency matrix.
In the process of matching each field data in the ring data with the field adjacency matrix, if some field data is repeatedly accessed, a ring event is considered to occur at this time, and the repeatedly accessed field data is determined as ring node data.
Exemplarily, the following field adjacency matrix is taken as an example:
Figure 66839DEST_PATH_IMAGE002
the field data A, the field data B, the field data C and the field data D correspond to each other.
From the direction of out-degree, the field adjacency matrix is matched in the order of field data a-field data B-field data C-field data D. For field data a: it can access field data C and field data D in the field adjacency matrix, while field data C can access field data B in the field adjacency matrix, which can access field data a in the field adjacency matrix. In such a scenario, the field data a is repeatedly accessed in this matching, and it can be confirmed that the field data a is a ring-shaped data node.
Similarly, the field data B and the field data C may be respectively determined as ring-shaped data nodes by looping the above matching process. For field data D, field data D is not determined to be a ring data node because it cannot access other field data in the field adjacency matrix.
In the above embodiment, the manner in which the argument field data in the ring data directly matches the field adjacency matrix to find the ring data node data is exemplified. In another embodiment, prior to performing the matching algorithm herein, a set of objects may also be constructed based on the ring data; and inquiring whether each field data in the ring data is located in the object set, and if not, determining the corresponding field data as non-annular node data.
The object set here includes field data in which no out-degree object exists in the ring data. If there is no out-degree object for one field data, it means that the change of the field data does not affect the other field data in the ring data, and thus it is impossible to make the data a ring node data. In the specific object set construction, whether the field data is the self-changing field data of any other field data or not can be judged, and if not, the field data is classified into the object set.
The searching of the ring-shaped data node data and the determining of the non-ring-shaped node data can be the configuration of execution sequence according to different application environments. The following is also the search order of the ring node data: possible embodiments are explained here by taking field data a-field data B-field data C-field data D as an example.
In one embodiment, before performing the lookup of the ring node data, it is queried whether field data A, B, C, D is in the out-degree object set and whether these field data are non-ring node data, respectively. Wherein for field data determined to be non-ring node data, no further lookup of subsequent ring node data is performed.
In another embodiment, according to the search sequence of the ring-shaped node data, it is first queried whether the field data a is located in the out-degree object set, and if not, the ring-shaped node data is directly searched for the field data a. Then, whether the field data B is located in the out-degree object set is queried, and whether to perform subsequent ring node data search is determined. And circulating the steps until all the field data are determined to be the ring node data or the non-ring node data.
In some application scenarios, the process of querying the object set may be lighter than the matching algorithm of the field adjacency matrix, so that the identification process of the ring event occupies less system resources.
After the ring node data is determined, the field adjacency matrix may be circularly matched with the ring node data to further determine a ring data chain corresponding to the ring node data.
In an embodiment, it may also be determined whether the ring node data has a value at this time, and if not, it indicates that a ring event does not exist in the form, and directly saves the form configuration call interface, so that the form is saved successfully.
If the annular node data is judged to have a value, or the above one-field adjacency matrix is taken as an example, the annular node data is determined to be: field data A, field data B and field data C. And sequentially accessing the field adjacency matrix by using the field data A, the field data B and the field data C to obtain associated nodes which can form a ring event relation with the ring node data. It can be seen that a ring event relationship is obtained among the field data a, the field data B and the field data C, and then the field data a-the field data B-the field data C are determined as a ring data chain.
In one embodiment, the circular data chain may be stored in an array, such as [ A, B, C ].
Based on the circular data chain, a circular event in the target form may be identified, which may be prompted to the user in different forms in different embodiments. For example, after the circular data chain is obtained, a prompt interface may be directly displayed on the currently displayed interface, and "the form has a circular event and the form is not successfully saved" is displayed on the prompt interface. Still alternatively, a prompt interface may be displayed on the currently displayed interface, and information of a specific field included in the ring event may be displayed in the prompt interface.
In the embodiment where each field data in the ring data is stored as a data ID, an ID mapping corresponding to all fields in the target form may be further established, and a field corresponding to each field data in the ring data chain may be queried based on the ID mapping, so that the ring event determined in the target form is rendered to the prompt interface in a user-friendly display manner.
Exemplarily, referring to fig. 4 to 8 in cooperation, "value of single line text = multiple lines of text + 1" and "value of multiple lines of text = single line of text + 1" are configured in the form field editing. Then, for a single-line text field and a multi-line text field, there is a circularly dependent functional relationship between the two, resulting in a ring event between the single-line text field and the multi-line text field. Further, in the prompt box of the current display interface shown in fig. 8, there are prompted: "there is a conflict; multiple lines of text, single lines of text, whether there is a loop modification operation. The user can further know in advance that the ring events exist in the multiple lines of text and the single line of text, and locate the fields for examination and configuration modification.
Referring to fig. 9, an embodiment of the present application is described. In this embodiment, the form ring event recognition device includes an acquisition module 21, a data conversion module 22, an instantiation module 23, and a query module 24.
The obtaining module 21 is configured to obtain all fields in the target form, and read configuration values of the fields; a data conversion module 22, configured to convert ring data based on the configuration values of the fields; the instantiation module 23 is configured to instantiate a ring event algorithm class using the ring data to create a field adjacency matrix; the query module 24 is configured to identify ring events in the target form based on the instance class query algorithm and the field adjacency matrix.
In one embodiment, the ring data includes a cause field data and a self-change field data corresponding to the cause field; the instantiation module 23 is specifically configured to instantiate a ring event algorithm class based on a correspondence between self-variation field data and dependent-variation field data in the ring data, and determine an out-degree relationship and an in-degree relationship in the field adjacency matrix.
In one embodiment, instantiation module 23 is further configured to call a constructor with ring data to initialize a ring event algorithm class; and initializing a data structure of the ring event algorithm class based on the ring data.
In an embodiment, the query module 24 is specifically configured to determine ring node data based on an instance-type query algorithm and a field adjacency matrix; determining a ring data chain corresponding to the ring node data according to the ring node data; and identifying a ring event in the target form based on the ring data chain.
In an embodiment, the query module 24 is specifically configured to traverse the ring data to obtain data of each field therein; circularly matching field adjacency matrixes by using field data in ring data; and determining field data repeatedly accessed in each matching as ring node data respectively.
In one embodiment, the query module 24 is specifically configured to match the field adjacency matrix with the cyclic node data cycle to determine the cyclic data chain corresponding to the cyclic node data.
In one embodiment, the dependent field data and the independent field data in the ring data include a field ID.
In one embodiment, the data conversion module 22 is further configured to establish ID mappings for all fields in the target form; and querying a field corresponding to the circular data chain based on the ID mapping to determine the circular event in the target form.
In one embodiment, the instantiation module 23 is further configured to construct an object set based on the ring data before matching each field data in the ring data with the field adjacency matrix, where the object set includes field data in which no out-degree object exists in the ring data; inquiring whether the field data in the ring data are in the object set; if not, determining the corresponding field data as non-annular node data.
In one embodiment, the form ring event recognition apparatus further includes a rendering module 25, configured to, in response to the recognized ring event, display a prompt interface on the currently displayed interface, where the prompt interface includes information for prompting the ring event.
As described above with reference to fig. 1 to 8, the form annular event recognition method according to the embodiment of the present specification is described. The details mentioned in the above description of the method embodiments are also applicable to the form loop event recognition apparatus of the embodiments of the present specification. The above form ring event recognition device can be implemented by hardware, or can be implemented by software, or a combination of hardware and software.
Fig. 10 shows a hardware configuration diagram of an electronic device according to an embodiment of the present specification. As shown in fig. 10, the electronic device 30 may include at least one processor 31, a storage 32 (e.g., a non-volatile storage), a memory 33, and a communication interface 34, and the at least one processor 31, the storage 32, the memory 33, and the communication interface 34 are connected together via an internal bus 35. The at least one processor 31 executes at least one computer readable instruction stored or encoded in the memory 32.
It should be understood that the computer-executable instructions stored in the memory 32, when executed, cause the at least one processor 31 to perform the various operations and functions described above in connection with fig. 1-8 in the various embodiments of the present description.
In embodiments of the present description, the electronic device 30 may include, but is not limited to: personal computers, server computers, workstations, desktop computers, laptop computers, notebook computers, mobile electronic devices, smart phones, tablet computers, cellular phones, Personal Digital Assistants (PDAs), handheld devices, messaging devices, wearable electronic devices, consumer electronic devices, and the like.
According to one embodiment, a program product, such as a machine-readable medium, is provided. A machine-readable medium may have instructions (i.e., elements described above as being implemented in software) that, when executed by a machine, cause the machine to perform various operations and functions described above in connection with fig. 1-8 in the various embodiments of the present specification. Specifically, a system or apparatus may be provided which is provided with a readable storage medium on which software program code implementing the functions of any of the above embodiments is stored, and causes a computer or processor of the system or apparatus to read out and execute instructions stored in the readable storage medium.
In this case, the program code itself read from the readable medium may realize the functions of any of the above-described embodiments, and thus the machine-readable code and the readable storage medium storing the machine-readable code form part of this specification.
Examples of the readable storage medium include floppy disks, hard disks, magneto-optical disks, optical disks (e.g., CD-ROMs, CD-R, CD-RWs, DVD-ROMs, DVD-RAMs, DVD-RWs), magnetic tapes, nonvolatile memory cards, and ROMs. Alternatively, the program code may be downloaded from a server computer or from the cloud via a communications network.
It will be understood by those skilled in the art that various changes and modifications may be made in the above-disclosed embodiments without departing from the spirit of the invention. Accordingly, the scope of the present description should be limited only by the attached claims.
It should be noted that not all steps and units in the above flows and system structure diagrams are necessary, and some steps or units may be omitted according to actual needs. The execution order of the steps is not fixed, and can be determined as required. The apparatus structures described in the above embodiments may be physical structures or logical structures, that is, some units may be implemented by the same physical client, or some units may be implemented by multiple physical clients, or some units may be implemented by some components in multiple independent devices.
In the above embodiments, the hardware units or modules may be implemented mechanically or electrically. For example, a hardware unit, module or processor may comprise permanently dedicated circuitry or logic (such as a dedicated processor, FPGA or ASIC) to perform the corresponding operations. The hardware units or processors may also include programmable logic or circuitry (e.g., a general purpose processor or other programmable processor) that may be temporarily configured by software to perform the corresponding operations. The specific implementation (mechanical, or dedicated permanent, or temporarily set) may be determined based on cost and time considerations.
The detailed description set forth above in connection with the appended drawings describes exemplary embodiments but does not represent all embodiments that may be practiced or fall within the scope of the claims. The term "exemplary" used throughout this specification means "serving as an example, instance, or illustration," and does not mean "preferred" or "advantageous" over other embodiments. The detailed description includes specific details for the purpose of providing an understanding of the described technology. However, the techniques may be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form in order to avoid obscuring the concepts of the described embodiments.
The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other variations without departing from the scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples and designs described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (10)

1. A form ring event recognition method, the method comprising:
acquiring all fields in a target form, and reading configuration values of the fields;
converting out ring data based on the configuration values of the fields;
instantiating a ring event algorithm class with the ring data to create a field adjacency matrix;
determining annular node data based on an instance type query algorithm and the field adjacency matrix;
determining a ring data chain corresponding to the ring node data according to the ring node data;
identifying a ring event in the target form based on the ring data chain;
wherein determining ring node data based on the instance class query algorithm and the field adjacency matrix comprises:
traversing the ring data to acquire data of each field in the ring data;
circularly matching the field adjacency matrix with each field data in the ring data;
respectively determining field data repeatedly visited in each matching as ring node data; and
before matching the field adjacency matrix with each field data in the ring data, the method further comprises:
constructing an object set based on the ring data, wherein the object set comprises field data of out-degree objects which do not exist in the ring data;
inquiring whether each field data in the ring data is located in the object set; if the number of the user terminal is not the same as the preset number,
and determining the corresponding field data as non-ring-shaped node data.
2. The form annular event recognition method according to claim 1, wherein the ring data includes a dependent field data and a self-dependent field data corresponding to the dependent field data;
instantiating a ring event algorithm class using the ring data to create a field adjacency matrix, specifically comprising:
and instantiating the annular event algorithm class based on the corresponding relation between the self-variation field data and the cause-variation field data in the annular data, and determining the out-degree relation and the in-degree relation in the field adjacency matrix.
3. The form annular event recognition method of claim 2, further comprising:
calling a constructor with the ring data to initialize the ring event algorithm class;
initializing a data structure of the ring event algorithm class according to the ring data.
4. The form ring event recognition method of claim 1, wherein the determining the ring data chain corresponding to the ring node data according to the ring node data comprises:
and circularly matching the field adjacency matrix with the ring node data to respectively determine the ring data chains corresponding to the ring node data.
5. The form ring event recognition method of claim 4, wherein the variant field data and the self-variant field data in the ring data include a field ID.
6. The form ring event recognition method of claim 5, wherein the recognizing the ring event in the target form based on the ring data chain comprises:
establishing ID mapping of all fields in the target form;
and querying a field corresponding to the annular data chain based on the ID mapping so as to determine the annular event in the target form.
7. The form annular event recognition method of any one of claims 1 to 6, further comprising:
and responding to the identified annular event, and displaying a prompt interface on the currently displayed interface, wherein the prompt interface comprises information for prompting the annular event.
8. A form annular event recognition apparatus, characterized in that the form annular event recognition apparatus comprises:
the acquisition module is used for acquiring all fields in the target form and reading the configuration values of the fields;
the data conversion module is used for converting the ring data based on the configuration values of the fields;
an instantiation module for instantiating a ring event algorithm class using the ring data to create a field adjacency matrix;
the query module is used for determining annular node data based on an instance type query algorithm and the field adjacency matrix; determining a ring data chain corresponding to the ring node data according to the ring node data; identifying a ring event in the target form based on the ring data chain; traversing the ring data to acquire each field data; circularly matching field adjacency matrixes by using field data in ring data; and determining the field data repeatedly visited in each matching as ring node data respectively;
before each field data in the ring data is matched with the field adjacency matrix, constructing an object set based on the ring data, wherein the object set comprises the field data without the out-degree object in the ring data; inquiring whether the field data in the ring data are in the object set; if not, determining the corresponding field data as non-annular node data.
9. An electronic device, comprising:
at least one processor; and
a memory storing instructions that, when executed by the at least one processor, cause the at least one processor to perform the form ring event recognition method of any of claims 1 to 7.
10. A machine readable storage medium storing executable instructions that when executed cause the machine to perform the form loop event recognition method of any of claims 1 to 7.
CN202210495694.5A 2022-05-09 2022-05-09 Form annular event recognition method and device, electronic equipment and storage medium Active CN114579349B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210495694.5A CN114579349B (en) 2022-05-09 2022-05-09 Form annular event recognition method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210495694.5A CN114579349B (en) 2022-05-09 2022-05-09 Form annular event recognition method and device, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN114579349A CN114579349A (en) 2022-06-03
CN114579349B true CN114579349B (en) 2022-08-12

Family

ID=81767544

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210495694.5A Active CN114579349B (en) 2022-05-09 2022-05-09 Form annular event recognition method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN114579349B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3168791A1 (en) * 2015-11-10 2017-05-17 Fujitsu Limited Method and system for data validation in knowledge extraction apparatus

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7174540B2 (en) * 2003-06-16 2007-02-06 Microsoft Corporation Component dependency matrices
CN109086050B (en) * 2018-07-04 2021-11-30 烽火通信科技股份有限公司 Method and system for analyzing module dependency relationship
CN112837026A (en) * 2021-01-22 2021-05-25 山东浪潮通软信息科技有限公司 Method, device and equipment for analyzing delivery cycle dependence and storage medium
CN113568693B (en) * 2021-07-13 2023-12-08 杭州每刻科技有限公司 Form rendering method and form rendering system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3168791A1 (en) * 2015-11-10 2017-05-17 Fujitsu Limited Method and system for data validation in knowledge extraction apparatus

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
半监督二次划分聚类算法及其报表系统应用;赵立永等;《小型微型计算机系统》;20110315(第03期);全文 *

Also Published As

Publication number Publication date
CN114579349A (en) 2022-06-03

Similar Documents

Publication Publication Date Title
US11507629B2 (en) Dataset networking and database modeling
JP5714688B2 (en) Context platform framework for aggregation, analysis and use of context information
US8959106B2 (en) Class loading using java data cartridges
WO2016186833A1 (en) System and method for extracting and sharing application-related user data
CN104239158A (en) Analysis engine for automatic analysis and error log linking
US20210029001A1 (en) System and a method for automatic conversion of monolithic services to micro-services
CN110532107B (en) Interface calling method, device, computer equipment and storage medium
CN107239527A (en) web access method and device
CN107861750A (en) A kind of label management method, tag control device and intelligent terminal
CN106649488A (en) Method and device for invoking multi-data-source interaction interface
JP7206331B2 (en) Clothing Coordination Method and Apparatus, Computing Device and Medium
CN114579349B (en) Form annular event recognition method and device, electronic equipment and storage medium
CN103093147B (en) A kind of method identifying information and electronic installation
KR20150117043A (en) Method for sorting a media content and electronic device implementing the same
US20210150243A1 (en) Efficient image sharing
Datta et al. mCHOIS: an application of mobile technology for childhood obesity surveillance
KR101767481B1 (en) Method and device for analyzing program
CN114531340B (en) Log acquisition method and device, electronic equipment, chip and storage medium
CN112100156B (en) Method, device, medium and system for constructing knowledge base based on user behaviors
CN111142735B (en) Software page creating method and device, terminal equipment and storage medium
CN114157734A (en) Data analysis method and device, electronic equipment and storage medium
CN114969064A (en) Fault detection method, device, system and storage medium
Loseto et al. Mining the User Profile from a Smartphone: a Multimodal Agent Framework.
KR20170082427A (en) Mobile device, and method for retrieving and capturing information thereof
CN117391687A (en) Fee settlement method and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant