CN116860807B - Visual rule engine working method for service management - Google Patents

Visual rule engine working method for service management Download PDF

Info

Publication number
CN116860807B
CN116860807B CN202310947236.5A CN202310947236A CN116860807B CN 116860807 B CN116860807 B CN 116860807B CN 202310947236 A CN202310947236 A CN 202310947236A CN 116860807 B CN116860807 B CN 116860807B
Authority
CN
China
Prior art keywords
code
service
data
file
uploaded
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
CN202310947236.5A
Other languages
Chinese (zh)
Other versions
CN116860807A (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.)
Chongqing Planning And Natural Resources Information Center
Original Assignee
Chongqing Planning And Natural Resources Information Center
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 Chongqing Planning And Natural Resources Information Center filed Critical Chongqing Planning And Natural Resources Information Center
Priority to CN202310947236.5A priority Critical patent/CN116860807B/en
Publication of CN116860807A publication Critical patent/CN116860807A/en
Application granted granted Critical
Publication of CN116860807B publication Critical patent/CN116860807B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/242Query formulation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2458Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2462Approximate or statistical queries
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/26Visual data mining; Browsing structured data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Computational Linguistics (AREA)
  • Strategic Management (AREA)
  • Mathematical Physics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Probability & Statistics with Applications (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Fuzzy Systems (AREA)
  • Software Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a visual rule engine working method for service management, which comprises the following steps: s1, logging in a service management platform; s2, after logging in the service management platform, uploading the data to be uploaded to the service management platform; and S3, after receiving the uploading data uploaded by the login end, the service management platform performs service visualization display on the received uploading data. The invention realizes the display of visual information on the received data after logging in the service management platform.

Description

Visual rule engine working method for service management
Technical Field
The invention relates to the technical field of geographic data, in particular to a visual rule engine working method for service management.
Background
The geographic information system (Geographic Information System, abbreviated as GIS) is a computer technology system for acquiring, processing, displaying and applying geographic information, and in the time of no rule engine, some logic complex services are provided, and only if-else is continuously added to meet the complex service scene. After the rule engine is provided, the traditional development mode of giving the business rule to the developer is changed, and the mode of the business person in-use is changed. Meanwhile, the transparency of the business process is increased, rule parameters are easy to understand and configure, business online efficiency is improved, operation development cost is reduced, patent application number 2022115804452, named as a GIS-based area measurement method and system, discloses inputting map coordinates, and simultaneously obtains a coordinate array of current area measurement; performing different treatments according to the length of the current area measurement coordinate array, if the length of the current area measurement coordinate array is 0 or 1, adding the input map coordinates at the tail of the coordinate array, generating a point entity, and returning to input; if the length of the current area measurement coordinate array is 2, newly adding the input map coordinates at the tail of the coordinate array to generate a polygonal entity, and calculating the area of the polygonal entity; if the length of the current area measurement coordinate array is greater than 2, judging whether the coordinate array accords with the overlapping intersection rule, adding the input map coordinates into the coordinate array which is screened to accord with the rule, generating a polygonal entity, and calculating the area of the polygonal entity.
Disclosure of Invention
The invention aims at least solving the technical problems existing in the prior art, and particularly creatively provides a visual rule engine working method for service management.
In order to achieve the above object of the present invention, the present invention provides a method for operating a visualization rule engine for service management, comprising the steps of:
s1, logging in a service management platform;
S2, after logging in the service management platform, uploading the data to be uploaded to the service management platform;
and S3, after receiving the uploading data uploaded by the login end, the service management platform performs service visualization display on the received uploading data.
In a preferred embodiment of the present invention, in step S2, after logging in the service management platform, a platform operation is further included.
In a preferred embodiment of the invention, the platform operation comprises one or any combination of the following operations:
firstly, inquiring by using a project number, acquiring current time, holiday time and pause time limit, prescribing finishing time limit data, and judging whether the time limit exceeds the time limit according to a rule engine:
if the service number exceeds the term, marking the service corresponding to the project number with red;
If the service number does not exceed the term, marking the service corresponding to the project number green;
The rule engine is: time limit = a specified transaction completion time limit- (current time-start time) +holiday+pause time;
The time limit is a natural number indicating no expiration, and the time limit is a negative number indicating expiration.
Inquiring by using the project codes or the project numbers to acquire permanent basic farmland space data, and displaying the permanent basic farmland space view;
thirdly, inquiring by using the project code or the project number, acquiring ecological protection red line space data, and displaying an ecological protection red line space view of the ecological protection red line space data;
and fourthly, acquiring data query information corresponding to the serial number through the serial number query, wherein the data query information comprises complete completion, verification of the matched facilities and permission of the matched facilities, and displaying the results.
In a preferred embodiment of the present invention, the method for logging in the service management platform in step S1 comprises the steps of:
S11, judging whether a login trigger signal is received or not:
if a login trigger signal is received, acquiring an equipment ID number of a login end, wherein the equipment ID number is a CPU serial number of the login end;
if the login trigger signal is not received, returning to the step S11;
S12, performing equipment code calculation on the equipment ID number acquired in the step S11 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s13, sending the encryption equipment code obtained in the step S12 to a service management platform;
s14, after receiving the encryption equipment code sent by the login end, the service management platform decrypts the encryption equipment code by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s15, judging whether the service code exists in the service code set or not:
if the service code calculated in the step S14 exists in the service code set, the login terminal successfully logs in the service management platform;
If the service code calculated in the step S14 does not exist in the service code set, the login terminal fails to log in the service management platform;
Or, S1-1, judging whether a login trigger signal is received or not:
if a login trigger signal is received, acquiring an equipment ID number of a login end, wherein the equipment ID number is a CPU serial number of the login end;
If the login trigger signal is not received, returning to the step S1-1;
s1-2, performing equipment code calculation on the equipment ID number acquired in the step S1-1 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s1-3, the encryption equipment codes obtained in the step S1-2 are sent to a service management platform;
S1-4, after receiving the encryption equipment code sent by the login end, the service management platform decrypts the encryption equipment code by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s1-5, judging whether the service codes exist in a service code set or not:
if the service codes calculated in the step S1-4 exist in the service code set, executing the next step;
if the service codes calculated in the step S1-4 are not in the service code set, the login terminal fails to log in the service management platform;
s1-6, the service management platform randomly generates a random code, forms a check group by the generated random code and the service code, stores the check group in a check database, and sends the random code to a mobile phone number corresponding to the service code for subsequent use;
S1-7, judging whether a random code is input into a random code filling frame or not:
If the random code is input in the random code filling frame, executing the next step;
If the random code is not input in the random code filling frame, returning to the step S1-7;
S1-8, obtaining the equipment ID number of the login end and the filled random code;
S1-9, performing equipment code calculation on the equipment ID number acquired in the step S1-8 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s1-10, the random code obtained in the step S1-8 and the encryption equipment code obtained in the step S1-9 are sent to a service management platform together;
S1-11, after receiving the encryption equipment code and the random code sent by the login end, the service management platform decrypts by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s1-12, inquiring a check group corresponding to the random code in the check database by using the random code;
s1-13, judging whether the service codes in the check group are consistent with the service codes in the step S1-11 or not:
if the service code in the check group is consistent with the service code in the step S1-11, the login terminal successfully logs in the service management platform;
if the service code in the check group is inconsistent with the service code in the step S1-11, the login terminal fails to log in the service management platform. The random code is sent to the mobile phone of the user, so that the user can log in the service management platform when logging in successfully without inputting an account number and a password, and the method is quick and convenient to achieve.
In a preferred embodiment of the present invention, the method for calculating the device code in step S12 is as follows:
InfoNO=InformationNOMethod(DeviceIDcode),
Wherein InfoNO denotes a device code obtained by calculating the acquired device ID number by using a device code calculation method;
InformationNOMethod () represents a device code calculation method;
DeviceIDcode denotes the device ID number of the login side.
In a preferred embodiment of the present invention, the method for calculating the service code in step S14 is as follows:
Infocode=InformationcodeMethod(InfoNOrece),
Wherein Infocode represents a service code obtained by calculating the acquired decryption device code by using a service code calculation method;
InformationcodeMethod () represents a service code calculation method;
InfoNOrece denotes a decryption device code obtained by the service management platform by decrypting with a private key corresponding to the public key.
In a preferred embodiment of the present invention, the method for uploading data to be uploaded to the service management platform in step S2 includes the following steps:
S21, counting the number of files in the data to be uploaded, namely M, namely a1 st file, a2 nd file, a 3 rd file and an M-th file, wherein M is a positive integer greater than or equal to 1;
S22, judging the size of each file:
If the size of the mth file is larger than a preset uploading file size threshold, wherein M is a positive integer smaller than or equal to M, dividing the mth file into K m sub-data to be uploaded, and the size of each sub-data to be uploaded is smaller than or equal to the preset uploading file size threshold;
S23, the service management platform randomly generates unique W management codes, wherein W is the number of files of the data to be uploaded on the login end, and the W is the number of the files of the data to be uploaded, and comprises the sub data to be uploaded and the data to be uploaded which are smaller than or equal to a preset uploading file size threshold value; storing the management code in a management code database for subsequent use; the generated W management codes are sent to a login end;
s24, the login end distributes W management codes to data smaller than or equal to a preset uploading file size threshold value as file names of the data;
S25, uploading the data to the service management platform after distribution.
In a preferred embodiment of the present invention, in step S22, the method for dividing the mth file into K m sub-data to be uploaded is as follows:
K m represents the number of the m-th file divided into sub-data to be uploaded;
size () represents a size function for solving a file;
doc m represents an mth file;
u represents a preset uploading file size threshold;
representing a rounding-up algorithm;
int () represents an integer part value;
Representing that an mth file is divided into sub-data sets to be uploaded;
doc m,1 represents sub data to be uploaded located in the 1 st order after the mth file is divided;
Doc m,2 represents sub data to be uploaded located in the 2 nd order after the m-th file is divided;
doc m,3 represents sub data to be uploaded in the 3 rd order after the mth file is divided;
Representing sub data to be uploaded in the K m th order after the m-th file is divided;
doc m,1 represents sub data to be uploaded located in the 1 st order after the mth file is divided;
Doc m,2 represents sub data to be uploaded located in the 2 nd order after the m-th file is divided;
doc m,3 represents sub data to be uploaded in the 3 rd order after the mth file is divided;
Representing sub data to be uploaded in the K m th order after the m-th file is divided;
& represents a data merger;
doc m represents an mth file; m=1, 2, 3, … …, M;
wherein Doc m,i represents sub data to be uploaded in the ith order after the mth file is divided;
doc m,j represents sub data to be uploaded in the j-th order after the m-th file is divided;
Representing an empty set; i=1, 2,3, … …, K m,j=1、2、3、……、Km, j+.i.
In a preferred embodiment of the present invention, the method for receiving, by the service management platform, data sent by the login end in step S3 includes the following steps:
s31, the service management platform extracts the file name of the received data;
S32, judging whether the file name exists in a management code database:
If the file name exists in the management code database, the data is stored;
If the file name does not exist in the management code database, deleting the data;
S33, judging whether the management code database still has management codes:
if the management code does not exist in the management code database, executing the next step;
If the management code exists in the management code database, the platform requests the login end to send data corresponding to the management code;
S34, combining the plurality of sub-data which are needed to be combined into one file.
In a preferred embodiment of the present invention, the method of visual presentation in step S3 comprises the steps of:
S31, extracting geographic coordinate points in the data, and marking the extracted geographic coordinate points on a map to form marking points;
s32, forming a minimum closed non-crossing pattern by all the marked points;
S33, when the graph is selected, displaying data information of the graph, wherein the data information comprises one of the number of buildings, the occupied area and the occupied perimeter.
In a preferred embodiment of the present invention, the method for calculating the floor area in step S33 is as follows:
wherein Edgearea represents the floor space of the corresponding graphic when the graphic is selected;
q represents the number of pixel points in the graph when the corresponding graph is selected;
point q represents the area size value of the q-th pixel point; q=1, 2, 3, … …, Q;
wherein EDGELENGTH represents the land occupation circumference of the corresponding graphic when the graphic is selected;
r represents the number of pixel points on the line of the graph, which is surrounded by the corresponding graph when the graph is selected;
pointlength r denotes a line length value at the R-th pixel point, r=1, 2, 3, … …, R.
In a preferred embodiment of the present invention, step S33 is followed by step S34, and if an export selection pattern is received, the pattern is exported.
In summary, by adopting the technical scheme, the method and the device realize the display of the visual information of the received data after logging in the service management platform, improve the service efficiency and reduce the operation development cost.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the invention will become apparent and may be better understood from the following description of embodiments taken in conjunction with the accompanying drawings in which:
fig. 1 is a schematic block diagram of a flow of the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative only and are not to be construed as limiting the invention.
The invention provides a visual rule engine working method for service management, as shown in figure 1, comprising the following steps:
s1, logging in a service management platform;
S2, after logging in the service management platform, uploading the data to be uploaded to the service management platform;
and S3, after receiving the uploading data uploaded by the login end, the service management platform performs service visualization display on the received uploading data.
In a preferred embodiment of the present invention, in step S2, after logging in the service management platform, a platform operation is further included.
In a preferred embodiment of the invention, the platform operation comprises one or any combination of the following operations:
firstly, inquiring by using a project number, acquiring current time, holiday time and pause time limit, prescribing finishing time limit data, and judging whether the time limit exceeds the time limit according to a rule engine:
if the service number exceeds the term, marking the service corresponding to the project number with red;
If the service number does not exceed the term, marking the service corresponding to the project number green;
The rule engine is: time limit = a specified transaction completion time limit- (current time-start time) +holiday+pause time;
The time limit is a natural number indicating no expiration, and the time limit is a negative number indicating expiration.
Inquiring by using the project codes or the project numbers to acquire permanent basic farmland space data, and displaying the permanent basic farmland space view;
thirdly, inquiring by using the project code or the project number, acquiring ecological protection red line space data, and displaying an ecological protection red line space view of the ecological protection red line space data;
and fourthly, acquiring data query information corresponding to the serial number through the serial number query, wherein the data query information comprises complete completion, verification of the matched facilities and permission of the matched facilities, and displaying the results.
The following rule engine operations are also included: checking whether the parking spaces meet the requirements or not, and inquiring the results of complete completion, the number of the allowed parking spaces, the number of the parking spaces and the like of the license through a built-in data view serial number of the rule engine. Making rule decisions for determining whether the card has been completed, if not, returning a result (the card has not been completed.)
The number of parking spaces > = the number of allowed parking spaces, returning a result (verifying that the number of parking spaces is the number of parking spaces, planning the number of allowed parking spaces is the number of allowed parking spaces, namely, the number of parking spaces meets the requirement);
The number of the parking spaces is less than the number of the allowed parking spaces, and a result is returned (the number of the parking spaces is verified to be the number of the parking spaces, the number of the planned allowed parking spaces is the number of the allowed parking spaces, namely, the number of the parking spaces does not meet the requirement);
Calculating whether the completion check volume area and engineering permit error are reasonable, inquiring the reasonable error area by the built-in data view serial number of the rule engine, the complete completion of the license, planning permit area, error proportion, more than forty-thousand interval reasonable error area, more than forty-thousand interval error area, completion check area
For the completion of the card to determine whether the card has been completed, if not, the result is returned (the card has not been completed);
For verifying the total building area value to determine whether the total building area value exists or not, if not, returning the result (verifying that the total building area is not filled and the total building area is { # planning permission area } square meter);
For permitting the total building area to judge whether the result exists or not, if not, returning the result (permitting the total building area to be unfilled, verifying the total building area to be { # completion verification area } square meter);
10000 square meters or less:
Calculating a reasonable error area: reasonable error area = planning licensed area + planning licensed area 0.01;
calculating the error area: error area = return absolute value (completion verification area-planning approval area);
Judging: the allowable area is not exceeded, and the allowable area is within a reasonable error range and is not within the reasonable error range;
10000-40000 square meters (including 40000 square meters):
Calculating a reasonable error area: reasonable error area= (plan allowed area-10000) 0.005+100+ plan allowed area
Calculating the error area: error area = return absolute value (plan permit area-completion verification area)
Judging: the allowable area is not exceeded, and is within a reasonable error range and is not within a reasonable error range.
40000 Square meters or more:
calculating the error area of more than forty thousands of intervals: more than forty thousand interval error areas= (planning permission area-40000) ×0.003;
Calculating the error area: error area = return absolute value (plan allowed area-completion verification area);
the error area of the interval of more than forty thousands is more than 250 square meters:
Calculating more than forty thousands of reasonable error areas in intervals: more than forty thousands of interval reasonable error areas = 250;
Calculating a reasonable error area: reasonable error area = planning allowed area +100+150+ forty-thousand or more intervals reasonable error area;
judging: the allowable area is not exceeded, and is within a reasonable error range and is not within a reasonable error range.
More than forty thousand interval error areas are less than or equal to 250 square meters:
calculating more than forty thousands of reasonable error areas in intervals: more than forty thousands of interval reasonable error areas= (planning permission area-40000) ×0.003;
Calculating a reasonable error area: reasonable error area = planning allowed area +100+150+ forty-thousand or more intervals reasonable error area;
judging: the allowable area is not exceeded, and is within a reasonable error range and is not within a reasonable error range.
In a preferred embodiment of the present invention, the method for logging in the service management platform in step S1 comprises the steps of:
S11, judging whether a login trigger signal is received or not:
if a login trigger signal is received, acquiring an equipment ID number of a login end, wherein the equipment ID number is a CPU serial number of the login end;
if the login trigger signal is not received, returning to the step S11;
S12, performing equipment code calculation on the equipment ID number acquired in the step S11 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s13, sending the encryption equipment code obtained in the step S12 to a service management platform;
s14, after receiving the encryption equipment code sent by the login end, the service management platform decrypts the encryption equipment code by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s15, judging whether the service code exists in the service code set or not:
if the service code calculated in the step S14 exists in the service code set, the login terminal successfully logs in the service management platform;
If the service code calculated in the step S14 does not exist in the service code set, the login terminal fails to log in the service management platform;
Or, S1-1, judging whether a login trigger signal is received or not:
if a login trigger signal is received, acquiring an equipment ID number of a login end, wherein the equipment ID number is a CPU serial number of the login end;
If the login trigger signal is not received, returning to the step S1-1;
s1-2, performing equipment code calculation on the equipment ID number acquired in the step S1-1 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s1-3, the encryption equipment codes obtained in the step S1-2 are sent to a service management platform;
S1-4, after receiving the encryption equipment code sent by the login end, the service management platform decrypts the encryption equipment code by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s1-5, judging whether the service codes exist in a service code set or not:
if the service codes calculated in the step S1-4 exist in the service code set, executing the next step;
if the service codes calculated in the step S1-4 are not in the service code set, the login terminal fails to log in the service management platform;
s1-6, the service management platform randomly generates a random code, forms a check group by the generated random code and the service code, stores the check group in a check database, and sends the random code to a mobile phone number corresponding to the service code for subsequent use;
S1-7, judging whether a random code is input into a random code filling frame or not:
If the random code is input in the random code filling frame, judging whether the random code is input in the random code filling frame, wherein the general random code number is six, if the six-bit character is input in the random code filling frame, the character is 0-9, one of capital letters A-Z and lowercase letters a-Z, and the random code is considered to be input in the random code filling frame, executing the next step;
If the random code is not input in the random code filling frame, returning to the step S1-7;
S1-8, obtaining the equipment ID number of the login end and the filled random code;
S1-9, performing equipment code calculation on the equipment ID number acquired in the step S1-8 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s1-10, the random code obtained in the step S1-8 and the encryption equipment code obtained in the step S1-9 are sent to a service management platform together;
S1-11, after receiving the encryption equipment code and the random code sent by the login end, the service management platform decrypts by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s1-12, inquiring a check group corresponding to the random code in the check database by using the random code;
s1-13, judging whether the service codes in the check group are consistent with the service codes in the step S1-11 or not:
if the service code in the check group is consistent with the service code in the step S1-11, the login terminal successfully logs in the service management platform;
if the service code in the check group is inconsistent with the service code in the step S1-11, the login terminal fails to log in the service management platform. The random code is sent to the mobile phone of the user, so that the user can log in the service management platform when logging in successfully without inputting an account number and a password, and the method is quick and convenient to achieve.
In a preferred embodiment of the present invention, the method for calculating the device code in step S12 is as follows:
InfoNO=InformationNOMethod(DeviceIDcode),
Wherein InfoNO denotes a device code obtained by calculating the acquired device ID number by using a device code calculation method;
InformationNOMethod () represents a device code calculation method, preferably adopts an MD5 algorithm, which is an existing mature algorithm, is difficult to reversely deduce a device ID number through a device code, and ensures the safety of the device ID number;
DeviceIDcode denotes the device ID number of the login side.
In a preferred embodiment of the present invention, the method for calculating the service code in step S14 is as follows:
Infocode=InformationcodeMethod(InfoNOrece),
Wherein Infocode represents a service code obtained by calculating the acquired decryption device code by using a service code calculation method;
InformationcodeMethod () represents a service code calculation method, preferably using MD5 algorithm;
InfoNOrece denotes a decryption device code obtained by the service management platform by decrypting with a private key corresponding to the public key. The methods for calculating the device code and the service code in step S12, step S1-2, step S1-9, step S14, step S1-4 and step S1-11 are the same, and are all MD5 algorithms, wherein the private key and the public key are a pair of asymmetric keys.
In a preferred embodiment of the present invention, the method for uploading data to be uploaded to the service management platform in step S2 includes the following steps:
S21, counting the number of files in the data to be uploaded, namely M, namely a1 st file, a2 nd file, a 3 rd file and an M-th file, wherein M is a positive integer greater than or equal to 1;
S22, judging the size of each file:
If the size of the mth file is larger than a preset uploading file size threshold, wherein M is a positive integer smaller than or equal to M, dividing the mth file into K m sub-data to be uploaded, and the size of each sub-data to be uploaded is smaller than or equal to the preset uploading file size threshold;
S23, the service management platform randomly generates unique W management codes, wherein W is the number of files of the data to be uploaded on the login end, and the W is the number of the files of the data to be uploaded, and comprises the sub data to be uploaded and the data to be uploaded which are smaller than or equal to a preset uploading file size threshold value; storing the management code in a management code database for subsequent use; the generated W management codes are sent to a login end;
s24, the login end distributes W management codes to data smaller than or equal to a preset uploading file size threshold value as file names of the data;
S25, uploading the data to the service management platform after distribution.
In a preferred embodiment of the present invention, in step S22, the method for dividing the mth file into K m sub-data to be uploaded is as follows:
K m represents the number of the m-th file divided into sub-data to be uploaded;
size () represents a size function for solving a file;
doc m represents an mth file;
u represents a preset uploading file size threshold;
representing a rounding-up algorithm;
int () represents an integer part value;
Representing that an mth file is divided into sub-data sets to be uploaded; doc m,1 represents sub data to be uploaded located in the 1 st order after the mth file is divided;
Doc m,2 represents sub data to be uploaded located in the 2 nd order after the m-th file is divided;
doc m,3 represents sub data to be uploaded in the 3 rd order after the mth file is divided;
Representing sub data to be uploaded in the K m th order after the m-th file is divided;
doc m,1 represents sub data to be uploaded located in the 1 st order after the mth file is divided;
Doc m,2 represents sub data to be uploaded located in the 2 nd order after the m-th file is divided;
doc m,3 represents sub data to be uploaded in the 3 rd order after the mth file is divided;
Representing sub data to be uploaded in the K m th order after the m-th file is divided;
& represents a data merger;
doc m represents an mth file; m=1, 2, 3, … …, M;
wherein Doc m,i represents sub data to be uploaded in the ith order after the mth file is divided;
doc m,j represents sub data to be uploaded in the j-th order after the m-th file is divided;
Representing an empty set; i=1, 2,3, … …, K m,j=1、2、3、……、Km, j+.i.
In a preferred embodiment of the present invention, the method for receiving, by the service management platform, data sent by the login end in step S3 includes the following steps:
s31, the service management platform extracts the file name of the received data;
S32, judging whether the file name exists in a management code database:
If the file name exists in the management code database, the data is stored;
If the file name does not exist in the management code database, deleting the data;
S33, judging whether the management code database still has management codes:
if the management code does not exist in the management code database, executing the next step;
If the management code exists in the management code database, the platform requests the login end to send data corresponding to the management code;
S34, combining the plurality of sub-data which are needed to be combined into one file.
In a preferred embodiment of the present invention, the method of visual presentation in step S3 comprises the steps of:
S31, extracting geographic coordinate points in the data, and marking the extracted geographic coordinate points on a map to form marking points;
S32, forming a minimum closed non-crossing pattern by all the marked points; the method for forming the minimum closed non-intersecting pattern by all the marked points comprises the following steps:
the first step, determining the number of marking points, namely U, namely a 1 st marking point, a 2 nd marking point, a 3 rd marking point and a U th marking point;
Step two, taking any point on the map as a reference point;
thirdly, calculating distance values between the U marking points and the reference points, sequentially arranging the distance values in sequence from large to small, and taking the marking point corresponding to the 1 st distance value as a starting point;
And fourthly, starting to include all the marked points in the graph or on the graph lines formed by the starting points, and finally returning to the starting points.
The calculation method of the distance value in the second step is as follows:
wherein D d represents the distance value between the D-th mark point and the reference point, d=1, 2, 3, … …, U;
(x 0,y0) represents the coordinates of the reference point;
(x d,yd) represents the coordinates of the d-th mark point;
S33, when the graph is selected, displaying data information of the graph, wherein the data information comprises one of the number of buildings, the occupied area and the occupied perimeter.
In a preferred embodiment of the present invention, the method for calculating the floor area in step S33 is as follows:
wherein Edgearea represents the floor space of the corresponding graphic when the graphic is selected;
q represents the number of pixel points in the graph when the corresponding graph is selected;
point q represents the area size value of the q-th pixel point; q=1, 2, 3, … …, Q;
wherein EDGELENGTH represents the land occupation circumference of the corresponding graphic when the graphic is selected;
r represents the number of pixel points on the line of the graph, which is surrounded by the corresponding graph when the graph is selected;
pointlength r denotes a line length value at the R-th pixel point, r=1, 2, 3, … …, R.
In a preferred embodiment of the present invention, step S33 is followed by step S34, and if an export selection pattern is received, the pattern is exported.
While embodiments of the present invention have been shown and described, it will be understood by those of ordinary skill in the art that: many changes, modifications, substitutions and variations may be made to the embodiments without departing from the spirit and principles of the invention, the scope of which is defined by the claims and their equivalents.

Claims (8)

1. A method of operating a visualization rules engine for business management, comprising the steps of:
s1, logging in a service management platform; the method for logging in the service management platform comprises the following steps:
S11, judging whether a login trigger signal is received or not:
if a login trigger signal is received, acquiring an equipment ID number of a login end;
if the login trigger signal is not received, returning to the step S11;
S12, performing equipment code calculation on the equipment ID number acquired in the step S11 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s13, sending the encryption equipment code obtained in the step S12 to a service management platform;
s14, after receiving the encryption equipment code sent by the login end, the service management platform decrypts the encryption equipment code by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s15, judging whether the service code exists in the service code set or not:
if the service code calculated in the step S14 exists in the service code set, the login terminal successfully logs in the service management platform;
If the service code calculated in the step S14 does not exist in the service code set, the login terminal fails to log in the service management platform;
Or, S1-1, judging whether a login trigger signal is received or not:
if a login trigger signal is received, acquiring an equipment ID number of a login end;
If the login trigger signal is not received, returning to the step S1-1;
s1-2, performing equipment code calculation on the equipment ID number acquired in the step S1-1 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s1-3, the encryption equipment codes obtained in the step S1-2 are sent to a service management platform;
S1-4, after receiving the encryption equipment code sent by the login end, the service management platform decrypts the encryption equipment code by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s1-5, judging whether the service codes exist in a service code set or not:
if the service codes calculated in the step S1-4 exist in the service code set, executing the next step;
if the service codes calculated in the step S1-4 are not in the service code set, the login terminal fails to log in the service management platform;
S1-6, the service management platform randomly generates a random code, forms a check group by the generated random code and the service code, stores the check group in a check database, and sends the random code to a mobile phone number corresponding to the service code;
S1-7, judging whether a random code is input into a random code filling frame or not:
If the random code is input in the random code filling frame, executing the next step;
If the random code is not input in the random code filling frame, returning to the step S1-7;
S1-8, obtaining the equipment ID number of the login end and the filled random code;
S1-9, performing equipment code calculation on the equipment ID number acquired in the step S1-8 to acquire an equipment code; encrypting the obtained equipment code by using a public key sent by a service management platform to obtain an encrypted equipment code;
s1-10, the random code obtained in the step S1-8 and the encryption equipment code obtained in the step S1-9 are sent to a service management platform together;
S1-11, after receiving the encryption equipment code and the random code sent by the login end, the service management platform decrypts by using a private key corresponding to the public key to obtain a decryption equipment code, and calculates the service code of the decryption equipment code to obtain the service code;
s1-12, inquiring a check group corresponding to the random code in the check database by using the random code;
s1-13, judging whether the service codes in the check group are consistent with the service codes in the step S1-11 or not:
if the service code in the check group is consistent with the service code in the step S1-11, the login terminal successfully logs in the service management platform;
If the service codes in the check group are inconsistent with the service codes in the step S1-11, the login terminal fails to log in the service management platform;
s2, after logging in the service management platform, uploading the data to be uploaded to the service management platform; the method for uploading the data to be uploaded to the service management platform comprises the following steps:
S21, counting the number of files in the data to be uploaded, namely M, namely a1 st file, a2 nd file, a 3 rd file and an M-th file, wherein M is a positive integer greater than or equal to 1;
S22, judging the size of each file:
If the size of the mth file is larger than a preset uploading file size threshold, wherein M is a positive integer smaller than or equal to M, dividing the mth file into K m sub-data to be uploaded, and the size of each sub-data to be uploaded is smaller than or equal to the preset uploading file size threshold;
S23, the service management platform randomly generates unique W management codes, wherein W is the number of files of the data to be uploaded on the login end, and the W is the number of the files of the data to be uploaded, and comprises the sub data to be uploaded and the data to be uploaded which are smaller than or equal to a preset uploading file size threshold value; storing the management code in a management code database for subsequent use; the generated W management codes are sent to a login end;
s24, the login end distributes W management codes to data smaller than or equal to a preset uploading file size threshold value as file names of the data;
s25, uploading the data to a service management platform after distribution;
S3, after receiving the uploading data uploaded by the login end, the service management platform performs service visualization display on the received uploading data; the service management platform executes the following steps for the data sent by the login terminal:
s31, the service management platform extracts the file name of the received data;
S32, judging whether the file name exists in a management code database:
If the file name exists in the management code database, the data is stored;
If the file name does not exist in the management code database, deleting the data;
S33, judging whether the management code database still has management codes:
if the management code does not exist in the management code database, executing the next step;
If the management code exists in the management code database, the platform requests the login end to send data corresponding to the management code;
S34, combining the plurality of sub-data which are needed to be combined into one file.
2. The method of claim 1, further comprising a platform operation after logging into the service management platform in step S2.
3. The method of operation of a visualization rules engine for traffic management of claim 2, wherein the platform operations comprise one or any combination of the following operations:
firstly, inquiring by using a project number, acquiring current time, holiday time and pause time limit, prescribing finishing time limit data, and judging whether the time limit exceeds the time limit according to a rule engine:
if the service number exceeds the term, marking the service corresponding to the project number with red;
If the service number does not exceed the term, marking the service corresponding to the project number green;
The rule engine is: time limit = a specified transaction completion time limit- (current time-start time) +holiday+pause time;
the time limit is a natural number and indicates no expiration, and the time limit is a negative number and indicates expiration;
inquiring by using the project codes or the project numbers to acquire permanent basic farmland space data, and displaying the permanent basic farmland space view;
thirdly, inquiring by using the project code or the project number, acquiring ecological protection red line space data, and displaying an ecological protection red line space view of the ecological protection red line space data;
and fourthly, acquiring data query information corresponding to the serial number through the serial number query, wherein the data query information comprises complete completion, verification of the matched facilities and permission of the matched facilities, and displaying the results.
4. The method for operating a visualization rules engine for traffic management according to claim 1, wherein in step S22, the method for dividing the mth file into K m sub-data to be uploaded is as follows:
K m represents the number of the m-th file divided into sub-data to be uploaded;
size () represents a size function for solving a file;
doc m represents an mth file;
u represents a preset uploading file size threshold;
representing a rounding-up algorithm;
int () represents an integer part value;
Representing that an mth file is divided into sub-data sets to be uploaded;
doc m,1 represents sub data to be uploaded located in the 1 st order after the mth file is divided;
Doc m,2 represents sub data to be uploaded located in the 2 nd order after the m-th file is divided;
doc m,3 represents sub data to be uploaded in the 3 rd order after the mth file is divided;
Representing sub data to be uploaded in the K m th order after the m-th file is divided;
doc m,1 represents sub data to be uploaded located in the 1 st order after the mth file is divided;
Doc m,2 represents sub data to be uploaded located in the 2 nd order after the m-th file is divided;
doc m,3 represents sub data to be uploaded in the 3 rd order after the mth file is divided;
Representing sub data to be uploaded in the K m th order after the m-th file is divided;
& represents a data merger;
doc m represents an mth file; m=1, 2, 3, … …, M;
wherein Doc m,i represents sub data to be uploaded in the ith order after the mth file is divided;
doc m,j represents sub data to be uploaded in the j-th order after the m-th file is divided;
Representing an empty set; i=1, 2,3, … …, K m,j=1、2、3、……、Km, j+.i.
5. The method of operation of a visualization rules engine for traffic management of claim 1, wherein the method of visual presentation in step S3 comprises the steps of:
S31, extracting geographic coordinate points in the data, and marking the extracted geographic coordinate points on a map to form marking points;
s32, forming a minimum closed non-crossing pattern by all the marked points;
S33, when the graph is selected, displaying data information of the graph, wherein the data information comprises one of the number of buildings, the occupied area and the occupied perimeter.
6. The method of claim 5, wherein the method of calculating the floor space in step S33 is as follows:
wherein Edgearea represents the floor space of the corresponding graphic when the graphic is selected;
q represents the number of pixel points in the graph when the corresponding graph is selected;
Point q represents the area size value of the q-th pixel point; q=1, 2, 3, … …, Q.
7. The method for operating a visualization rules engine for traffic management according to claim 5, wherein the calculation method of the land occupation circumference in step S33 is as follows:
wherein EDGELENGTH represents the land occupation circumference of the corresponding graphic when the graphic is selected;
r represents the number of pixel points on the line of the graph, which is surrounded by the corresponding graph when the graph is selected;
pointlength r denotes a line length value at the R-th pixel point, r=1, 2, 3, … …, R.
8. The method according to claim 5, further comprising step S34, after step S33, of exporting the graphic if the export selection graphic is received.
CN202310947236.5A 2023-07-31 2023-07-31 Visual rule engine working method for service management Active CN116860807B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310947236.5A CN116860807B (en) 2023-07-31 2023-07-31 Visual rule engine working method for service management

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310947236.5A CN116860807B (en) 2023-07-31 2023-07-31 Visual rule engine working method for service management

Publications (2)

Publication Number Publication Date
CN116860807A CN116860807A (en) 2023-10-10
CN116860807B true CN116860807B (en) 2024-04-19

Family

ID=88234112

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310947236.5A Active CN116860807B (en) 2023-07-31 2023-07-31 Visual rule engine working method for service management

Country Status (1)

Country Link
CN (1) CN116860807B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117274063A (en) * 2023-10-31 2023-12-22 重庆市规划和自然资源信息中心 Working method for building central line layer construction of building

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101837664B1 (en) * 2017-07-21 2018-04-19 주식회사 부린 River Smart Management System and Method
KR102041081B1 (en) * 2019-05-10 2019-11-06 안경만 Data linked enterprise resource planning system
CN112948421A (en) * 2021-03-30 2021-06-11 重庆市规划和自然资源信息中心 Mobile query method for planning natural resources
CN113572834A (en) * 2021-07-21 2021-10-29 广东科诺勘测工程有限公司 Patrol data uploading method, device and system and storage medium
CN113626801A (en) * 2021-08-13 2021-11-09 重庆市规划和自然资源信息中心 Unified cooperative scheduling method for fine-grained distributed service resources
CN113645203A (en) * 2021-07-27 2021-11-12 重庆市规划和自然资源信息中心 Real estate registration and bank deep fusion method
KR102391674B1 (en) * 2022-02-22 2022-04-28 와이드유즈 주식회사 Logistics dedicated rpa system
CN114491187A (en) * 2022-01-20 2022-05-13 重庆市规划和自然资源调查监测院 Intelligent natural resource monitoring integrated system
CN114650285A (en) * 2022-03-21 2022-06-21 重庆市规划和自然资源信息中心 Method for carrying out multi-dimensional full-factor monitoring on real estate registration service
CN115357674A (en) * 2022-07-27 2022-11-18 上海杰狮信息技术有限公司 Planning space information service platform based on GIS
WO2022241961A1 (en) * 2021-05-20 2022-11-24 四川省林业和草原调查规划院(四川省林业和草原生态环境监测中心) Method for detecting spatial data change in territorial spatial planning, application system, and cloud platform

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113656661B (en) * 2021-08-13 2022-08-19 重庆市规划和自然资源信息中心 Mobile government affair system based on natural language recognition

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101837664B1 (en) * 2017-07-21 2018-04-19 주식회사 부린 River Smart Management System and Method
KR102041081B1 (en) * 2019-05-10 2019-11-06 안경만 Data linked enterprise resource planning system
CN112948421A (en) * 2021-03-30 2021-06-11 重庆市规划和自然资源信息中心 Mobile query method for planning natural resources
WO2022241961A1 (en) * 2021-05-20 2022-11-24 四川省林业和草原调查规划院(四川省林业和草原生态环境监测中心) Method for detecting spatial data change in territorial spatial planning, application system, and cloud platform
CN113572834A (en) * 2021-07-21 2021-10-29 广东科诺勘测工程有限公司 Patrol data uploading method, device and system and storage medium
CN113645203A (en) * 2021-07-27 2021-11-12 重庆市规划和自然资源信息中心 Real estate registration and bank deep fusion method
CN113626801A (en) * 2021-08-13 2021-11-09 重庆市规划和自然资源信息中心 Unified cooperative scheduling method for fine-grained distributed service resources
CN114491187A (en) * 2022-01-20 2022-05-13 重庆市规划和自然资源调查监测院 Intelligent natural resource monitoring integrated system
KR102391674B1 (en) * 2022-02-22 2022-04-28 와이드유즈 주식회사 Logistics dedicated rpa system
CN114650285A (en) * 2022-03-21 2022-06-21 重庆市规划和自然资源信息中心 Method for carrying out multi-dimensional full-factor monitoring on real estate registration service
CN115357674A (en) * 2022-07-27 2022-11-18 上海杰狮信息技术有限公司 Planning space information service platform based on GIS

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
南平市县级土地利用规划管理信息系统建设与应用;卢昌茂;;福建地质;20170615(02);全文 *
基于权重优先业务规则引擎的行政许可管理应用;余军阳;侯寒黎;刘艳;林诗璇;;杭州师范大学学报(自然科学版);20180531(03);全文 *
福州市规划综合应用平台设计与实现;陈旭日;;城市勘测;20200630(03);全文 *

Also Published As

Publication number Publication date
CN116860807A (en) 2023-10-10

Similar Documents

Publication Publication Date Title
CN116860807B (en) Visual rule engine working method for service management
US5020105A (en) Field initialized authentication system for protective security of electronic information networks
US20060054695A1 (en) Dynamic bar code display apparatus, dynamic bar code generation method, and storage medium generation dynamic bar code
CN112988788B (en) Method for checking mutation of spatial data in territorial space planning, application system and cloud platform
CN111314069B (en) Block chain-based shaking system and method, electronic device and storage medium
WO1989003143A1 (en) Field initialized authentication system for protective security of electronic information networks
CN106162804A (en) For providing the method and apparatus of the access information of wireless access focus
CN102123033A (en) Identity authentication method and system of dynamic password token as well as mobile terminal of dynamic password token
CN103973711B (en) A kind of verification method and device
CN102663549A (en) Entrance ticket management system with high security and entrance ticket management method thereof
CN110060403B (en) One-person multi-ticket electronic voting method and system based on block chain
CN106600734A (en) Processing method and system for card swiping for attendance, as well as mobile end and server
CN105844846B (en) A kind of method for safety monitoring based on Ibeacon technologies, apparatus and system
CN105406965A (en) Clear-text password encryption method
CN105790952A (en) Verification system and verification method of user information
CN106533680A (en) Quantum neighbor query method capable of protecting location privacy
CN111489164A (en) Electric power transaction method and device based on Internet of things identification and block chain and electronic equipment
CN109714169B (en) Data credible circulation platform based on strict authorization and circulation method thereof
CN113902135A (en) Sample data volume joint expansion method, device, equipment, system and storage medium
CN105760915A (en) Anti-fake image generation method and device
CN114006743A (en) Method for extracting and querying land use state in real time based on big data
CN109214798A (en) A kind of method and device for realizing business handling based on Third-party payment platform
CN107798125A (en) Access decision method, system, equipment and storage medium based on cohesion model
CN106600282A (en) Data processing method and device for fingerprint payment
CN110765226A (en) Goods owner matching method, device, equipment and 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
GR01 Patent grant
GR01 Patent grant