CN114118944A - Forensic laboratory grading management method, terminal device and storage medium - Google Patents
Forensic laboratory grading management method, terminal device and storage medium Download PDFInfo
- Publication number
- CN114118944A CN114118944A CN202111297422.6A CN202111297422A CN114118944A CN 114118944 A CN114118944 A CN 114118944A CN 202111297422 A CN202111297422 A CN 202111297422A CN 114118944 A CN114118944 A CN 114118944A
- Authority
- CN
- China
- Prior art keywords
- laboratory
- code
- codes
- laboratories
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Abstract
The invention relates to a hierarchical management method for a forensics laboratory, terminal equipment and a storage medium, wherein the method comprises the following steps: s1: setting codes of all laboratories based on administrative division codes of regions where the laboratories are located; s2: extracting feature codes of all laboratories formed by effective numbers in the codes according to the codes of all laboratories; s3: determining the hierarchical relationship among the laboratories according to the inclusion relationship among the feature codes of the laboratories, and further constructing a hierarchical tree according to the hierarchical relationship; each node in the hierarchical tree corresponds to a laboratory, and the attribute of each node comprises a code of the corresponding laboratory of the node, a parent node code of the node and a feature code of the corresponding laboratory of the node; s4: hierarchical management of the laboratory is achieved based on the hierarchical tree. The invention can conveniently integrate all laboratories, automatically generate the grading information of the laboratories, automatically connect the added laboratories, report codes without manual intervention, and automatically insert the information into the corresponding tree nodes according to rules.
Description
Technical Field
The invention relates to the field of data management, in particular to a forensic laboratory grading management method, terminal equipment and a storage medium.
Background
With the rapid development of economy, the methods and equipment for case detection are also advancing, and with the increasing update of equipment and technology, more and more departments begin to establish laboratories for systematic laboratory management and evidence collection. A common laboratory is equipped with a laboratory management system to manage information such as cases, examination materials, documents, and the like.
Most of the current laboratory management systems only can carry out the management of internal laboratories, but do not relate to cross-laboratory hierarchical management, and higher laboratories cannot know which laboratory devices or evidence obtaining devices are purchased in lower laboratories. Because of the particularity of laboratory evidence collection, the network is not basically communicated with the intranet, and cases accepted by the laboratory cannot be directly synchronized with the intranet, so that a higher-level laboratory cannot know the details of cases in a lower-level laboratory, information communication can be realized only by other means such as offline synchronization, and statistics of documents and cases is difficult to realize.
On the other hand, some laboratory systems often suffer from difficult maintenance if they are managed hierarchically. First, all laboratory information is entered into the system, one of which is manual, which is the least convenient and will not be discussed here. Most systems import systems by filling out laboratory information into templates, which often encounters several problems:
firstly, the hierarchical relationship of the laboratories is not easily embodied through documents, and the hierarchical relationship between two laboratories is difficult to obtain through the names of the laboratories, so that the system cannot judge the hierarchy during importing, all the laboratories can only be listed, and the hierarchical relationship is manually modified at a later stage, which is very inconvenient.
And secondly, part of the management system marks the document by adding the auxiliary fields, and the system can automatically generate the hierarchical tree by judging the upper level and the lower level of the auxiliary fields. However, this method also causes a problem that the document writer needs to be familiar with the management system to ensure that the filled auxiliary fields do not have errors; moreover, since the auxiliary field often has no correlation with actual laboratory information, a document writer needs to carefully check the corresponding relationship between the hierarchical relationship of the laboratory and the auxiliary field, and the fault tolerance is poor.
Thirdly, after the list is imported for the first time, if a newly added laboratory appears, the corresponding upper and lower levels need to be found, and then the laboratory information is input, so that the process is complicated.
Disclosure of Invention
In order to solve the above problems, the present invention provides a forensic laboratory hierarchical management method, a terminal device, and a storage medium.
The specific scheme is as follows:
a forensic laboratory grading management method comprises the following steps:
s1: setting codes of all laboratories based on administrative division codes of regions where the laboratories are located;
s2: extracting feature codes of all laboratories formed by effective numbers in the codes according to the codes of all laboratories;
s3: determining the hierarchical relationship among the laboratories according to the inclusion relationship among the feature codes of the laboratories, and further constructing a hierarchical tree according to the hierarchical relationship; each node in the hierarchical tree corresponds to a laboratory, and the attribute of each node comprises a code of the corresponding laboratory of the node, a parent node code of the node and a feature code of the corresponding laboratory of the node;
s4: hierarchical management of the laboratory is achieved based on the hierarchical tree.
Further, the process of extracting the feature code according to the laboratory code is as follows: the first six bits of the code from the highest bit are extracted, and after 0 located at the end of the first six bits is removed, the code is divided by a separator in units of every two bits.
Further, step S4 is preceded by constructing a staff mapping table for storing the correspondence between laboratory staff and the laboratory and a case mapping table for storing the correspondence between cases and the laboratory.
Further, the hierarchical management of the laboratory includes: when a new laboratory is needed, the following steps are carried out:
s101: inquiring whether the code of the newly added laboratory exists in the hierarchical tree, if so, adding failure, and ending; otherwise, entering S102;
s102: judging whether the newly-added laboratory is assigned to a superior laboratory, if so, setting the corresponding node of the assigned superior laboratory as a father node of the corresponding node of the newly-added laboratory; otherwise, setting the root node as a father node of the corresponding node of the newly-added laboratory;
s103: extracting the codes of the laboratories corresponding to all the child nodes under the father node set in the step S102, and adding 1 to the maximum value of all the extracted codes to be used as the codes of the newly added laboratories;
s104: judging whether the codes of the newly added laboratories accord with administrative division code rules or not, and if so, extracting feature codes according to the codes of the newly added laboratories; if not, generating the feature code of the newly-added laboratory according to the feature code of the father node and the code of the newly-added laboratory;
s105: and adding the codes, the feature codes and the parent node codes of the corresponding nodes of the newly-added laboratory into the attributes of the corresponding nodes of the newly-added laboratory in the hierarchical tree.
Further, the hierarchical management of the laboratory includes: when the laboratory needs to be deleted, the following steps are carried out:
s201: judging whether the laboratory to be deleted contains a lower-level laboratory, if so, entering S205; otherwise, go to S202;
s202: searching whether the laboratory to be deleted contains a worker or not from a worker mapping table, and if so, entering S205; otherwise, entering S203;
s203: searching whether the laboratory to be deleted contains unarchived evidence collection entrusts or not from the case mapping table, and if so, entering S205; otherwise, entering S204;
s204: deleting the corresponding node of the laboratory to be deleted from the hierarchical tree;
s205: deleting all child nodes of the corresponding node of the laboratory to be deleted from the hierarchical tree, deleting the staff corresponding to the laboratory to be deleted in the staff mapping table, filing or invalidating the case corresponding to the laboratory to be deleted in the case mapping table, and finally deleting the corresponding node of the laboratory to be deleted.
Further, in the step S201, in the process of determining whether the to-be-deleted laboratory includes a next-level laboratory, the determination is performed according to the feature codes of the laboratories stored in the nodes of the hierarchical tree, based on the feature codes of the to-be-deleted laboratories, the feature codes of the laboratories stored in all the nodes of the hierarchical tree are retrieved, and when the feature code of a laboratory completely includes the feature code of the to-be-deleted laboratory from the highest position, the laboratory is set as the next-level laboratory of the to-be-deleted laboratory.
Further, the hierarchical management of the laboratory includes: when the laboratory needs to be modified, the following steps are carried out:
s301: judging whether the code of the laboratory to be modified is modified, if so, entering S302; otherwise, entering S303;
s302: judging whether a node corresponding to the code of the laboratory to be modified exists in the hierarchical tree or not, and if so, judging that the modification fails; otherwise, entering S303;
s303: modifying the feature codes of the corresponding nodes of the laboratory to be modified and the information of other attributes except the father node codes in the hierarchical tree;
s304: and judging whether the superior laboratory of the laboratory to be modified is modified, if so, taking the modified code of the superior laboratory as the father node code of the corresponding node of the laboratory to be modified, and recalculating new feature codes of the corresponding node of the laboratory to be modified and all child nodes of the corresponding node.
Further, the process of recalculating the feature codes of the node and all the child nodes corresponding to the laboratory to be modified in step S304 includes: and splicing the new code of the laboratory to be modified and the feature code of the new superior laboratory thereof into a new feature code, and taking the new feature code as the new feature code of the corresponding node and all the child nodes of the laboratory to be modified.
Further, the hierarchical management of the laboratory includes: and when the laboratory needs to be searched, searching corresponding information from the hierarchical tree according to the code of the laboratory to be searched.
Further, the hierarchical management of the laboratory includes: when the code of a laboratory is known and the laboratory list of the primary child node of the laboratory needs to be searched, all the nodes of which the corresponding laboratory code of the parent node is the code of the known laboratory are searched from the hierarchical tree, and the codes of the corresponding laboratory of the nodes are extracted from all the searched nodes to form the laboratory list of the primary child node.
Further, the hierarchical management of the laboratory includes: when the code of a laboratory is known and the laboratory list of all child nodes of the laboratory needs to be searched, all nodes of the code of the laboratory completely containing the code of the known laboratory are searched from the hierarchical tree, and the codes of the corresponding laboratory of the nodes are extracted from all the searched nodes to form the laboratory list of all the child nodes.
A forensic laboratory grading management terminal device comprising a processor, a memory and a computer program stored in the memory and operable on the processor, the processor implementing the steps of the method as described above in embodiments of the invention when executing the computer program.
A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the method as described above for an embodiment of the invention.
According to the technical scheme, the laboratories are coded by combining administrative division codes, all the laboratories can be conveniently integrated, the hierarchical information of the laboratories can be automatically generated, the added laboratories are automatically connected, manual intervention is not needed after the coding is reported, and the laboratories can be automatically inserted into the corresponding tree nodes according to rules.
Drawings
Fig. 1 is a flowchart illustrating a first embodiment of the present invention.
FIG. 2 is a schematic diagram of the codes of the laboratories at all stages in this example.
FIG. 3 is a schematic diagram of the laboratory feature codes at each stage in this embodiment.
Detailed Description
To further illustrate the various embodiments, the invention provides the accompanying drawings. The accompanying drawings, which are incorporated in and constitute a part of this disclosure, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the embodiments. Those skilled in the art will appreciate still other possible embodiments and advantages of the present invention with reference to these figures.
The invention will now be further described with reference to the accompanying drawings and detailed description.
The first embodiment is as follows:
the embodiment of the invention provides a forensic laboratory grading management method, as shown in fig. 1, comprising the following steps:
s1: the code of each laboratory is set based on the administrative division code of the area where the laboratory is located.
Since laboratories in the evidence obtaining industry all belong to national special institutions and all have national uniform administrative division codes, the codes of the laboratories can be considered not to change and present a certain rule, and therefore the administrative division codes can be used for coding so as to facilitate subsequent grading.
According to the related regulations of the existing administrative division codes, the left-to-right meaning of the codes is as follows: the first and second digits represent provincial level, the third and fourth digits represent prefectural level, the fifth and sixth digits represent county level, and the subsequent digits represent village, town and lower level units. In order to make all the coded bits consistent, the upper level code is supplemented with 0 in the back, for example, the code of Jiangsu province laboratory is 320000000000, the code of Jiangsu Nanjing laboratory is 320100000000, and the code of Jiangsu Nanjing basalt laboratory is 320102000000, if a plurality of laboratories exist in a region, the upper level code can be increased in the code of the last six bits, for example, the code of Jiangsu Nanjing basalt laboratory No. 2 is 320102000001.
S2: and extracting the feature codes of the laboratories consisting of the effective numbers in the codes according to the codes of the laboratories.
Since the first six bits of the code represent the relationship of the main region, as shown in fig. 2, in this embodiment, the feature code is extracted based on the first six bits of the code, specifically: the first six bits of the code from the highest bit are extracted, and after 0 located at the end of the first six bits is removed, the code is divided by a separator in units of every two bits. The delimiter in this embodiment is denoted with "|" as shown in fig. 3. It should be noted that, since the upper level code will complement 0 later, the last 0 in the first six bits is removed as all meaningless 0 at the end of the removal, for example, four last 0 are removed in 320000, two last 0 are removed in 320100, and no 0 is removed at the end of 320102. The corresponding signature code of the fig. 2 encoding is shown in fig. 3.
The hierarchical relationship between laboratories can be better obtained through the feature codes, and if the numbers of the feature codes of two laboratories are consistent and the first 2 × N (N ═ 1 or 2) bits are consistent, the laboratories are considered to be at the same level; if the first 2 × N (N ═ 1 or 2) bits of the two laboratory signatures are identical, they are considered to be in membership.
S3: and determining the hierarchical relationship among the laboratories according to the inclusion relationship among the feature codes of the laboratories, and further constructing a hierarchical tree according to the hierarchical relationship. Each node in the hierarchical tree corresponds to a laboratory, and the attribute of each node comprises a code (represented by a symbol id) of the corresponding laboratory of the node, a code of a parent node of the node (namely, the code of the corresponding forensics laboratory of the parent node of the node is represented by a symbol parent _ id), and a feature code (represented by a symbol path) of the corresponding forensics laboratory of the node.
The method for determining the hierarchical relationship comprises the following steps: and when the first feature code completely contains the second feature code from the highest bit, judging that the laboratory corresponding to the second feature code is a superior laboratory of the laboratory corresponding to the first feature code. If the feature code of the south Beijing laboratory of Jiangsu is 32|01|00, the feature code of the basalt laboratory of south Beijing of Jiangsu is 32|01|02, and the feature code of the basalt laboratory of south Beijing of Jiangsu completely contains the feature code of the south Beijing laboratory of Jiangsu from the highest position, the south Beijing laboratory of Jiangsu is a superior laboratory of the basalt laboratory of south Beijing of Jiangsu.
S4: hierarchical management of the laboratory is achieved based on the hierarchical tree.
Further, in order to better perform hierarchical management on the laboratory by using the hierarchical tree, the embodiment preferably includes combining the laboratory in the hierarchical tree with laboratory workers and cases, and the specific method includes: and constructing a staff mapping table for storing the corresponding relation between the laboratory staff and the laboratory and a case mapping table for storing the corresponding relation between the case and the laboratory. The codes of the working personnel in the working personnel mapping table and the codes of the laboratory have a mapping relation, and the codes of the cases in the case mapping table and the codes of the laboratory have a mapping relation.
The hierarchical management of the laboratory in this embodiment specifically includes the following steps:
(1) when a new laboratory is needed, the following steps are carried out:
s101: inquiring whether the code of the newly added laboratory exists in the hierarchical tree, if so, adding failure, and ending; otherwise, entering S102;
s102: judging whether the newly-added laboratory is assigned to a superior laboratory, if so, setting the corresponding node of the assigned superior laboratory as a father node of the corresponding node of the newly-added laboratory; otherwise, setting the root node as a father node of the corresponding node of the newly-added laboratory;
s103: extracting the codes of the laboratories corresponding to all the child nodes under the father node set in the step S102, and adding 1 to the maximum value of all the extracted codes to be used as the codes of the newly added laboratories;
s104: judging whether the codes of the newly added laboratories accord with administrative division code rules or not, and if so, extracting feature codes according to the codes of the newly added laboratories; if the codes do not conform to the preset encoding mode (namely other laboratories which do not adopt the encoding mode of the embodiment for encoding), generating the feature codes of the newly added laboratories according to the feature codes of the father nodes and the codes of the newly added laboratories;
s105: and adding the codes, the feature codes and the parent node codes of the corresponding nodes of the newly-added laboratory into the attributes of the corresponding nodes of the newly-added laboratory in the hierarchical tree.
In the step S104, it is necessary to determine whether or not the code of the newly added laboratory conforms to the rules of the administrative division code, and whether or not both the number of bits and the format conform to the regulations relating to the administrative division code. Generating the feature code of the newly added laboratory according to the feature code of the father node and the code of the newly added laboratory specifically comprises the following steps: and splicing the feature code of the parent node and the code of the newly-added laboratory, namely the feature code path of the newly-added laboratory is the parent-level path | code.
(2) When the laboratory needs to be deleted, the following steps are carried out:
s201: judging whether the laboratory to be deleted contains a lower-level laboratory, if so, entering S205; otherwise, go to S202;
s202: searching whether the laboratory to be deleted contains a worker or not from a worker mapping table, and if so, entering S205; otherwise, entering S203;
s203: searching whether the laboratory to be deleted contains unarchived evidence collection entrusts or not from the case mapping table, and if so, entering S205; otherwise, entering S204;
s204: deleting the corresponding node of the laboratory to be deleted from the hierarchical tree;
s205: deleting all child nodes of the corresponding node of the laboratory to be deleted from the hierarchical tree, deleting the staff corresponding to the laboratory to be deleted in the staff mapping table, filing or invalidating the case corresponding to the laboratory to be deleted in the case mapping table, and finally deleting the corresponding node of the laboratory to be deleted.
In the step S201, in the process of determining whether the to-be-deleted laboratory includes the next-level laboratory, the feature codes of the laboratories stored in the nodes of the hierarchical tree are determined, based on the feature codes of the to-be-deleted laboratory, the feature codes of the laboratories stored in all the nodes of the hierarchical tree are retrieved, and when the feature code of a laboratory completely includes the feature code of the to-be-deleted laboratory from the highest position (i.e., path 1), the laboratory is set as the next-level laboratory of the to-be-deleted laboratory.
The steps S202 and S203 are used for searching from the staff mapping table and the case mapping table according to the laboratory codes.
(3) When the laboratory needs to be modified, the following steps are carried out:
s301: judging whether the code of the laboratory to be modified is modified, if so, entering S302; otherwise, entering S303;
s302: judging whether a node corresponding to the code of the laboratory to be modified exists in the hierarchical tree or not, and if so, judging that the modification fails; otherwise, entering S303;
s303: modifying the feature codes of the corresponding nodes of the laboratory to be modified and the information of other attributes except the father node codes in the hierarchical tree;
s304: and judging whether the superior laboratory of the laboratory to be modified is modified, if so, taking the modified code of the superior laboratory as the father node code of the corresponding node of the laboratory to be modified, and recalculating new feature codes of the corresponding node of the laboratory to be modified and all child nodes of the corresponding node.
The process of recalculating the feature codes of the node corresponding to the laboratory to be modified and all the child nodes in step S304 includes: and splicing the new code of the laboratory to be modified and the feature code of the new superior laboratory thereof into a new feature code, and taking the new feature code as the new feature code of the corresponding node and all the child nodes of the laboratory to be modified. If the new code of the laboratory to be modified is code _ new and the feature code of the new superior laboratory is path _ parent, the new feature code is path _ new ═ path _ parent | code _ new |.
(4) The search based on the hierarchical tree comprises the following three types:
when a laboratory needs to be searched, corresponding information is searched from the hierarchical tree according to the code of the laboratory to be searched.
Secondly, when the code of a laboratory is known and the laboratory list of the primary child node of the laboratory needs to be searched, all the nodes of which the corresponding laboratory codes of the father nodes are the codes of the known laboratory are searched from the hierarchical tree, and the codes of the corresponding laboratory nodes of the nodes are extracted from all the searched nodes to form the laboratory list of the primary child node.
And thirdly, when the code of a laboratory is known and the laboratory list of all child nodes of the laboratory needs to be searched, searching all nodes of which the code of the laboratory completely contains the code of the known laboratory from the hierarchical tree, and extracting the codes of the corresponding laboratory from all the searched nodes to form the laboratory list of all the child nodes.
In addition, when the staff and the associated case in the laboratory need to be searched, the staff and the associated case can be searched from the staff mapping table and the case mapping table according to the laboratory code.
In addition to the hierarchical management of the four laboratories based on the hierarchical tree, the present embodiment further includes managing related workers and cases of the laboratory, specifically:
s501: and using the created personnel account to create the case.
S502: and binding the case code and the personnel code generated after the creation.
S503: when a related person inquires a case, the case code to be inquired is reported, the corresponding creator code is found through the case code, the creator code is compared with the inquirer code, the laboratory code to which the creator belongs is found according to the creator code, the corresponding feature code path1 is inquired according to the hierarchical tree, the laboratory code to which the inquirer belongs is found according to the inquirer code, the corresponding feature code path2 is inquired according to the hierarchical tree, and the condition that the inquirer has the authority to inquire the case is judged to be satisfied when the condition is judged to be satisfied with the condition that the path2 is equal to path 1. The path2 is the path1, which indicates that the feature code path2 completely contains the feature code path1 from the highest order bit.
S504: when case statistics is carried out, if only the case quantity of the laboratory is counted, only the laboratory code needing to be counted is needed to be obtained, then all cases bound with the code are screened out, and statistics is carried out; if the sub-level laboratories need to be counted, the laboratory feature codes path are obtained first, all the laboratory code lists id _ list which accord with the path are found out, the laboratory codes which the cases belong to are found out through the creator codes corresponding to the case lists, and the cases which accord with the codes in the id _ list are all included in the counting range.
S505: when carrying out case operation, need to judge personnel's authority, if the case can only supply personnel oneself to operate, then judge: if the creator code of the case binding is the personnel code, authorization is carried out; if the case can be operated by all the personnel in the laboratory to which the personnel belong, judging: extracting 1 of the organization path to which the creator code of the case binding belongs, and 2 of the organization path to which the personnel code belongs, if the path1 is equal to the path2, then authorization is carried out; if the case can be operated by all the personnel belonging to the personnel and the superior laboratory, the judgment is carried out: and extracting the organization path1 to which the creator code of the case binding belongs, and the organization path2 to which the personnel code belongs, wherein the agreement is 2-1, and then performing authorization.
The embodiment of the invention can be widely applied to laboratory construction in the evidence obtaining industry, the administrative division codes of the industry mechanisms are utilized to set the standards of upper and lower level judgment among laboratories, and most of the time, a template is not required to be filled manually, and the laboratory information can be automatically input only by network intercommunication among the laboratories, so that a large number of manual input and check programs are reduced, and the fault tolerance is greatly improved. The embodiment of the invention not only can quickly and effectively construct a laboratory network, but also has strong flexible expansibility. The method is applied to various domestic laboratories at present and is an innovation of a design mode.
Example two:
the invention also provides forensic laboratory grading management terminal equipment which comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein the processor executes the computer program to realize the steps of the method embodiment of the first embodiment of the invention.
Further, as an executable scheme, the forensic laboratory hierarchical management terminal device may be a desktop computer, a notebook, a palm computer, a cloud server, and other computing devices. The forensic laboratory hierarchical management terminal device may include, but is not limited to, a processor, a memory. It is understood by those skilled in the art that the above-mentioned constituent structure of the forensic laboratory hierarchical management terminal device is only an example of the forensic laboratory hierarchical management terminal device, and does not constitute a limitation on the forensic laboratory hierarchical management terminal device, and may include more or less components than the above-mentioned one, or combine some components, or different components, for example, the forensic laboratory hierarchical management terminal device may further include an input/output device, a network access device, a bus, and the like, which is not limited in this embodiment of the present invention.
Further, as an executable solution, the Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, a discrete hardware component, and the like. The general processor can be a microprocessor or the processor can be any conventional processor and the like, the processor is a control center of the forensic laboratory hierarchical management terminal device, and various interfaces and lines are used for connecting various parts of the whole forensic laboratory hierarchical management terminal device.
The memory can be used for storing the computer program and/or the module, and the processor can realize various functions of the forensic laboratory hierarchical management terminal device by running or executing the computer program and/or the module stored in the memory and calling the data stored in the memory. The memory can mainly comprise a program storage area and a data storage area, wherein the program storage area can store an operating system and an application program required by at least one function; the storage data area may store data created according to the use of the mobile phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
The invention also provides a computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the above-mentioned method of an embodiment of the invention.
The module/unit integrated with the forensic laboratory grading management terminal device may be stored in a computer readable storage medium if it is implemented in the form of a software functional unit and sold or used as an independent product. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), software distribution medium, and the like.
While the invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (13)
1. A forensic laboratory grading management method is characterized by comprising the following steps:
s1: setting codes of all laboratories based on administrative division codes of regions where the laboratories are located;
s2: extracting feature codes of all laboratories formed by effective numbers in the codes according to the codes of all laboratories;
s3: determining the hierarchical relationship among the laboratories according to the inclusion relationship among the feature codes of the laboratories, and further constructing a hierarchical tree according to the hierarchical relationship; each node in the hierarchical tree corresponds to a laboratory, and the attribute of each node comprises a code of the corresponding laboratory of the node, a parent node code of the node and a feature code of the corresponding laboratory of the node;
s4: hierarchical management of the laboratory is achieved based on the hierarchical tree.
2. The forensic laboratory grading management method according to claim 1, characterised in that: the process of extracting the feature codes according to the codes of the laboratory is as follows: the first six bits of the code from the highest bit are extracted, and after 0 located at the end of the first six bits is removed, the code is divided by a separator in units of every two bits.
3. The forensic laboratory grading management method according to claim 1, characterised in that: step S4 is preceded by constructing a staff mapping table for storing laboratory staff-to-laboratory correspondences and a case mapping table for storing case-to-laboratory correspondences.
4. The forensic laboratory grading management method according to claim 1, characterised in that: hierarchical management of laboratories includes: when a new laboratory is needed, the following steps are carried out:
s101: inquiring whether the code of the newly added laboratory exists in the hierarchical tree, if so, adding failure, and ending; otherwise, entering S102;
s102: judging whether the newly-added laboratory is assigned to a superior laboratory, if so, setting the corresponding node of the assigned superior laboratory as a father node of the corresponding node of the newly-added laboratory; otherwise, setting the root node as a father node of the corresponding node of the newly-added laboratory;
s103: extracting the codes of the laboratories corresponding to all the child nodes under the father node set in the step S102, and adding 1 to the maximum value of all the extracted codes to be used as the codes of the newly added laboratories;
s104: judging whether the codes of the newly added laboratories accord with administrative division code rules or not, and if so, extracting feature codes according to the codes of the newly added laboratories; if not, generating the feature code of the newly-added laboratory according to the feature code of the father node and the code of the newly-added laboratory;
s105: and adding the codes, the feature codes and the parent node codes of the corresponding nodes of the newly-added laboratory into the attributes of the corresponding nodes of the newly-added laboratory in the hierarchical tree.
5. The forensic laboratory grading management method according to claim 3, characterised in that: hierarchical management of laboratories includes: when the laboratory needs to be deleted, the following steps are carried out:
s201: judging whether the laboratory to be deleted contains a lower-level laboratory, if so, entering S205; otherwise, go to S202;
s202: searching whether the laboratory to be deleted contains a worker or not from a worker mapping table, and if so, entering S205; otherwise, entering S203;
s203: searching whether the laboratory to be deleted contains unarchived evidence collection entrusts or not from the case mapping table, and if so, entering S205; otherwise, entering S204;
s204: deleting the corresponding node of the laboratory to be deleted from the hierarchical tree;
s205: deleting all child nodes of the corresponding node of the laboratory to be deleted from the hierarchical tree, deleting the staff corresponding to the laboratory to be deleted in the staff mapping table, filing or invalidating the case corresponding to the laboratory to be deleted in the case mapping table, and finally deleting the corresponding node of the laboratory to be deleted.
6. The forensic laboratory grading management method of claim 5, wherein: step S201 determines whether the laboratory to be deleted includes a lower laboratory according to the feature codes of the laboratories stored in the nodes of the hierarchical tree, retrieves the feature codes of the laboratories stored in all the nodes of the hierarchical tree based on the feature codes of the laboratories to be deleted, and sets the laboratory as the lower laboratory of the laboratory to be deleted when the feature code of the laboratory completely includes the feature code of the laboratory to be deleted from the highest position.
7. The forensic laboratory grading management method according to claim 1, characterised in that: hierarchical management of laboratories includes: when the laboratory needs to be modified, the following steps are carried out:
s301: judging whether the code of the laboratory to be modified is modified, if so, entering S302; otherwise, entering S303;
s302: judging whether a node corresponding to the code of the laboratory to be modified exists in the hierarchical tree or not, and if so, judging that the modification fails; otherwise, entering S303;
s303: modifying the feature codes of the corresponding nodes of the laboratory to be modified and the information of other attributes except the father node codes in the hierarchical tree;
s304: and judging whether the superior laboratory of the laboratory to be modified is modified, if so, taking the modified code of the superior laboratory as the father node code of the corresponding node of the laboratory to be modified, and recalculating new feature codes of the corresponding node of the laboratory to be modified and all child nodes of the corresponding node.
8. The forensic laboratory grading management method of claim 7, wherein: the process of recalculating the feature codes of the corresponding node and all the child nodes of the laboratory to be modified in step S304 includes: and splicing the new code of the laboratory to be modified and the feature code of the new superior laboratory thereof into a new feature code, and taking the new feature code as the new feature code of the corresponding node and all the child nodes of the laboratory to be modified.
9. The forensic laboratory grading management method according to claim 1, characterised in that: hierarchical management of laboratories includes: and when the laboratory needs to be searched, searching corresponding information from the hierarchical tree according to the code of the laboratory to be searched.
10. The forensic laboratory grading management method according to claim 1, characterised in that: hierarchical management of laboratories includes: when the code of a laboratory is known and the laboratory list of the primary child node of the laboratory needs to be searched, all the nodes of which the corresponding laboratory code of the parent node is the code of the known laboratory are searched from the hierarchical tree, and the codes of the corresponding laboratory of the nodes are extracted from all the searched nodes to form the laboratory list of the primary child node.
11. The forensic laboratory grading management method according to claim 1, characterised in that: hierarchical management of laboratories includes: when the code of a laboratory is known and the laboratory list of all child nodes of the laboratory needs to be searched, all nodes of the code of the laboratory completely containing the code of the known laboratory are searched from the hierarchical tree, and the codes of the corresponding laboratory of the nodes are extracted from all the searched nodes to form the laboratory list of all the child nodes.
12. The utility model provides a hierarchical management terminal equipment in laboratory of collecting evidence which characterized in that: comprising a processor, a memory and a computer program stored in the memory and running on the processor, the processor implementing the steps of the method according to any of claims 1 to 11 when executing the computer program.
13. A computer-readable storage medium storing a computer program, characterized in that: the computer program when executed by a processor implementing the steps of the method as claimed in any one of claims 1 to 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111297422.6A CN114118944A (en) | 2021-11-04 | 2021-11-04 | Forensic laboratory grading management method, terminal device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111297422.6A CN114118944A (en) | 2021-11-04 | 2021-11-04 | Forensic laboratory grading management method, terminal device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114118944A true CN114118944A (en) | 2022-03-01 |
Family
ID=80381169
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111297422.6A Pending CN114118944A (en) | 2021-11-04 | 2021-11-04 | Forensic laboratory grading management method, terminal device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114118944A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115840751A (en) * | 2023-02-21 | 2023-03-24 | 山东经伟晟睿数据技术有限公司 | Novel tree data coding method |
-
2021
- 2021-11-04 CN CN202111297422.6A patent/CN114118944A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115840751A (en) * | 2023-02-21 | 2023-03-24 | 山东经伟晟睿数据技术有限公司 | Novel tree data coding method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104967620A (en) | Access control method based on attribute-based access control policy | |
| CN103810212A (en) | Automated database index creation method and system | |
| CN105488471B (en) | A kind of font recognition methods and device | |
| CN111651453A (en) | User historical behavior query method and device, electronic equipment and storage medium | |
| CN114118944A (en) | Forensic laboratory grading management method, terminal device and storage medium | |
| CN113282579A (en) | Heterogeneous data storage and retrieval method, device, equipment and storage medium | |
| US10360208B2 (en) | Method and system of process reconstruction | |
| CN113742332A (en) | Data storage method, device, equipment and storage medium | |
| CN115543428A (en) | Simulated data generation method and device based on strategy template | |
| CN115203435A (en) | Entity relation generation method and data query method based on knowledge graph | |
| CN115114297A (en) | Data lightweight storage and search method and device, electronic equipment and storage medium | |
| Schlie et al. | Reengineering variants of matlab/simulink software systems | |
| CN105095283A (en) | Quasi-friend recommending method in social networking system and quasi-friend recommending system in social networking system | |
| CN113553458A (en) | Data export method and device in graph database | |
| CN113971044A (en) | Component document generation method, device, equipment and readable storage medium | |
| CN107888415B (en) | Network management system data maintenance method | |
| CN112445461A (en) | Business rule generation method and device, electronic equipment and readable storage medium | |
| CN112596719A (en) | Method and system for generating front-end and back-end codes | |
| CN110334098A (en) | A kind of database combining method and system based on script | |
| CN111930705B (en) | Binary message protocol data processing method and device | |
| CN117729176B (en) | Method and device for aggregating application program interfaces based on network address and response body | |
| CN113434359B (en) | Data traceability system construction method and device, electronic device and readable storage medium | |
| CN115688711B (en) | Document merging method, device, equipment and storage medium | |
| CN114090522B (en) | Electronic file identifier definition method, device and equipment | |
| CN111930349B (en) | Program package generation method and device, electronic equipment and storage medium |
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 |