CN114037576A - System and method for allocating academic resources - Google Patents
System and method for allocating academic resources Download PDFInfo
- Publication number
- CN114037576A CN114037576A CN202111559096.1A CN202111559096A CN114037576A CN 114037576 A CN114037576 A CN 114037576A CN 202111559096 A CN202111559096 A CN 202111559096A CN 114037576 A CN114037576 A CN 114037576A
- Authority
- CN
- China
- Prior art keywords
- application
- target
- school
- academic
- admission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000009826 distribution Methods 0.000 claims abstract description 66
- 230000007246 mechanism Effects 0.000 claims abstract description 24
- 238000012550 audit Methods 0.000 claims description 16
- 230000006870 function Effects 0.000 claims description 15
- 238000012795 verification Methods 0.000 claims description 12
- 230000008520 organization Effects 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 7
- 238000012552 review Methods 0.000 claims description 6
- 230000004048 modification Effects 0.000 claims description 5
- 238000012986 modification Methods 0.000 claims description 5
- 239000013589 supplement Substances 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 34
- 238000007726 management method Methods 0.000 description 15
- 239000000463 material Substances 0.000 description 14
- 230000008859 change Effects 0.000 description 10
- 238000013468 resource allocation Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000013439 planning Methods 0.000 description 3
- 239000002699 waste material Substances 0.000 description 3
- 238000013475 authorization Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000001105 regulatory effect Effects 0.000 description 2
- 238000009827 uniform distribution Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 239000000047 product Substances 0.000 description 1
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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/20—Education
- G06Q50/205—Education administration or guidance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
- G06F21/31—User authentication
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Health & Medical Sciences (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Educational Technology (AREA)
- Educational Administration (AREA)
- Bioethics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a system and a method for allocating academic resources. Wherein, this system includes: the alliance chain is used for receiving an application request of a target user for entrance, calling the intelligent contract unit, receiving a return result of the intelligent contract unit and storing the return result in each node, wherein the alliance chain is composed of at least one academic degree distribution supervisor and a node where a target school is located, and the return result at least comprises: the result of the target user's admission; and the intelligent contract unit is used for analyzing the request of the target user for the application of learning according to a preset academic degree distribution mechanism and determining a logging result, wherein the logging result is used for indicating whether the target school distributes the academic degree for the target user. The technical problems that in the related art, due to the fact that a centralized academic degree distribution system is used, the assignment process caused by academic degree resource assignment in a manual mode is complex, the assignment process is opaque, the assignment process cannot be disclosed, and data safety cannot be guaranteed are solved.
Description
Technical Field
The present application relates to the field of academic resource allocation, and in particular, to a system and a method for allocating academic resources.
Background
In the compulsory education stage, how to reasonably distribute the academic degree is a problem which needs to be solved urgently. In the related art, assignment of academic resources is usually performed manually based on a centralized assignment system, and the assignment formula mainly has the following problems:
firstly, the efficiency of academic degree distribution is low, and links such as auditing and verifying a large amount of data, point calculation, registration, admission and the like are involved in the academic degree distribution process, and the links usually involve manpower, are complex in process, and easily cause waste of time and energy.
Secondly, the academic degree distribution process is not open and transparent enough, materials and integrals are easy to counterfeit, the data tampering cost is low, the admission process is lack of supervision, the distribution process cannot be disclosed, and the academic degree distribution rationality is greatly influenced.
Thirdly, the centralized distribution system is prone to safety and reliability problems, and once the centralized distribution system is attacked or fails, the development of work is seriously affected, data loss is easily caused, and the safety of the data cannot be guaranteed.
Therefore, the academic degree distribution mode in the related technology at least has the problems of complicated flow, low efficiency, opaque distribution process, poor data security and the like.
In view of the above problems, no effective solution has been proposed.
Disclosure of Invention
The embodiment of the application provides a system and a method for allocating academic resources, and the system and the method are used for at least solving the technical problems that the allocation process is complicated, the allocation process is opaque, the allocation process cannot be disclosed and the data security cannot be guaranteed because the academic resource allocation system based on centralization in the related technology is used for allocating the academic resources in a manual mode.
According to an aspect of an embodiment of the present application, there is provided a system for allocating academic resources, including: the alliance chain is used for receiving an application request of a target user for entrance, calling the intelligent contract unit, receiving a return result of the intelligent contract unit and storing the return result in a preset node, wherein the alliance chain is composed of at least one academic degree distribution supervisor and a node where a target school is located, and the return result at least comprises: the result of the target user's admission; and the intelligent contract unit is used for analyzing the request of the target user for the application of learning according to a preset academic degree distribution mechanism and determining a logging result, wherein the logging result is used for indicating whether the target school distributes the academic degree for the target user.
Optionally, the intelligent contract unit comprises: an initialization module, wherein the initialization module is configured with an initialization function, the initialization function is used for setting basic parameters, and the basic parameters at least include: two types of parameters; the first type of parameters are at least used for defining names of schools, admission limits and school district ranges; the second type of parameters at least are used for defining the starting period of the admission application, the deadline and the publicity date of the admission result; the third type of parameter is used for defining the attribute of the user structure.
Optionally, the intelligent contract unit comprises: the admission application module is used for submitting the admission application of the user to each node of the alliance chain, adding the admission application into a pending queue to wait for the review of a degree distribution supervisor; the admission application module is also used for receiving a modification instruction of a user, modifying the admission application, and submitting the modified admission application to a pending queue to wait for review by a credit allocation director.
Optionally, the node where the academic degree distribution director is located audits the application for entrance by the following method: and at least after the node where the academic degree distribution main organization is located determines that the application for entrance is approved, the application for entrance is moved out of the pending queue, and meanwhile, the academic degree distribution module is called to distribute the academic degrees.
Optionally, at least after the node where the academic degree distribution competent organization is located determines that the application for entrance passes the audit, moving the application for entrance out of the pending queue includes: calling an API (application programming interface) of the third-party auditing platform; auditing the application for entrance based on an API (application programming interface) of a third party auditing platform; and after the academic degree distribution supervisor and the third-party auditing platform both determine that the application for entrance is approved, removing the application for entrance from the pending queue.
Optionally, wherein the preset academic degree allocation mechanism includes: the point goes into the system of learning, random position of party goes into the system of learning, and intelligent contract unit still includes: the system comprises a credit allocation module, a credit acquisition module and a credit acquisition module, wherein the credit allocation module is used for allocating credits to a target user according to a credit acquisition system under the condition that an admission application passes an audit; and the academic degree distribution module is also used for distributing the academic degrees of the target users according to the random position-allocation academic system under the condition that the application for entrance to school passes the audit.
Optionally, the assigning the degree to the target user according to the point learning system includes: reading all users which are not in the preset alignment; obtaining the integral corresponding to each user in all the users, and sequencing according to the numerical value of the integral to obtain a ranking result, wherein the larger the integral is, the more the bit sequence number in the ranking result is, the ranking result comprises: the target bit order number of the target user; acquiring a threshold value of the admission number of a target school; and determining the target school to take the target user under the condition that the target bit sequence number of the target user is smaller than the threshold value.
Optionally, the assigning the degree to the target user according to the point learning system further includes: reading all users which are not in the preset alignment; determining a first user set taking a target school as a first volunteer in all users; under the condition that the target user is determined to belong to the first user set, acquiring the integral of each user in the first user set; and sequencing according to the numerical value of the integral to obtain a ranking result, wherein the larger the integral is, the more the bit sequence number in the ranking result is, the ranking result comprises the following steps: the target bit order number of the target user; acquiring a threshold value of the admission number of a target school; determining the target school to take the target user under the condition that the target bit sequence number of the target user is smaller than the threshold value; and after the first volunteer is recorded, if the user is not recorded, the first volunteer is redistributed according to the second volunteer, if the second volunteer is not recorded, the second volunteer is redistributed according to the third volunteer, and if the user is not recorded, the user which is not recorded is dispatched to an office or a civil school with the rest academic position.
Optionally, the assigning the degree to the target user according to the random-position-assignment degree, includes: acquiring random number intervals corresponding to schools, wherein the random number intervals comprise: a target random number interval corresponding to a target school; and under the condition that the first random number belongs to the target random number interval, determining the target school to take the target user.
Optionally, the obtaining of the random number interval corresponding to each school includes: acquiring the threshold of the number of recorded people corresponding to each school; determining a head population threshold of the admission population thresholds of all schools; and determining a random number interval according to the threshold value of the admission number corresponding to at least one school in each school and the ratio of the threshold value of the total number of people.
Optionally, the intelligent contract unit further comprises: the result query module is used for generating a query result according to the type of the calling object and the query instruction of the calling object; under the condition that the calling object is a target user node, displaying the admission application state of the current time of the target user and the admission list of the target school according to the query instruction of the target user, wherein the admission application state comprises the following steps: whether the admission application is passed or not and whether the target user needs to supplement personal data or not, wherein the admission list comprises: names, points and ranks of all students enrolled by the target school; under the condition that the calling object is a scholarly allocation supervisor node, displaying at least one of the following information according to the query instruction of the scholarly allocation supervisor: any user's request for entrance, application record and any school's admission list in any time period.
Optionally, the method further comprises: and the certificate issuing module is at least used for registering an account according to the identity information of the user and issuing a digital certificate and a public and private key pair for the account.
Optionally, the method further comprises: and the MSP module is at least used for configuring operation authority to the account corresponding to the target user after the verification of the digital certificate of the account and the public and private key pair is passed.
According to another aspect of the embodiments of the present application, there is also provided a method for allocating academic resources, where the method is applied to a federation block chain, and includes: receiving a request for application of learning of a target user forwarded by a alliance chain, wherein the alliance chain comprises at least one academic degree distribution supervisor and a node where a target school is located; analyzing a request for applying for entrance of a target user according to a preset academic degree distribution mechanism, and determining an admission result, wherein the admission result is used for indicating whether the target school distributes academic degrees for the target user or not; and returning the result of the enrollment to the federation chain.
According to another aspect of the embodiments of the present application, there is also provided a processor, configured to execute a program, where the program executes the assignment method of the academic aptitude resource.
In this embodiment of the present application, a mode of assigning a degree by using a league chain and an intelligent contract unit is adopted, and the league chain is used for receiving a request for an application for entrance of a target user, invoking the intelligent contract unit, receiving a return result of the intelligent contract unit, and storing the return result in a predetermined node, where the league chain is composed of at least one degree assignment authority and a node where a target school is located, and the return result at least includes: the result of the target user's admission; the intelligent contract unit is used for analyzing the request of the target user for the application of learning according to a preset academic degree allocation mechanism and determining an admission result, wherein the admission result is used for indicating whether the target school allocates the academic degree for the target user or not, and the goal of allocating academic degree resources transparently by calling the academic degree allocation mechanism in the intelligent contract based on the alliance chain is achieved, so that the operation process of allocating the academic degree resources is simplified, the whole allocation process can be transparently opened, and the technical effects that the data of the allocation result cannot be falsified are achieved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a schematic diagram of an alternative assignment system for academic resources according to an embodiment of the present application;
FIG. 2 is a schematic structural diagram of an alternative academic degree assignment system based on federation chain intelligence and contracts according to an embodiment of the present application;
FIG. 3 is a schematic flow chart of an alternative assignment of credits according to an embodiment of the present application;
fig. 4 is a flowchart illustrating an alternative assignment method of academic degree resources according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
For the convenience of better understanding of the embodiments related to the present application, technical terms or partial terms that may be referred to in the embodiments of the present application are explained as follows:
1. the score admission is divided into two admission methods of single school score and college district filling volunteers. The single school zone, namely the single shared school zone, is characterized in that parents of children who are in proper age for entering a school upload own certified materials such as household registers, housing estates, social security and the like to relevant departments in a network or field handling mode and report names to corresponding schools, after the students are checked by the departments such as building, leasing, social security, family planning and the like after the students are checked for the first time, then points and ranking are calculated, then the students are uniformly recorded from high to low according to the points until the points are full, and the unregistered students are dispatched to other public schools or civil schools. The college district filled-in volunteering refers to that the university district where the celebrity is located contains a plurality of schools, each child with the proper age can report at most three volunteers, the children are recorded according to the sequence of the first volunteers, the second volunteers and the third volunteers, and the students which are not recorded in the same way are dispatched to other public schools or civil schools.
2. The computer random allocation of the multi-school scribing to enter school means that in the multi-school schools in the school district, each declared child of the proper age meeting the conditions of entering school can decide which school to go by randomly shaking the number by the computer, and the number shaking process is completely black, so that the open transparency is lacked. But compared with the method of integrating the score into the study by single school, the method weakens the connection between the house property and the academic degree and promotes the equalization of educational resources to a certain extent.
Pending queue: the method is characterized in that a user submits an application for a preset queue to be determined, the queue is stored in each node of a alliance chain, but the queue cannot participate in further academic degree distribution, and after being audited and checked by a relevant academic degree governing department, the queue can be moved out, and the academic degree distribution process is continued.
In accordance with an embodiment of the present application, there is provided an embodiment of a system for allocation of academic resources, it should be noted that the steps illustrated in the flowchart of the drawings may be performed in a computer system such as a set of computer-executable instructions, and that while a logical order is illustrated in the flowchart, in some cases the steps illustrated or described may be performed in an order different than here.
Fig. 1 is a system for allocating academic resources according to an embodiment of the present application, and as shown in fig. 1, the system includes:
a federation chain 10, configured to receive an application request for entrance to study of a target user, invoke an intelligent contract unit, receive a return result of the intelligent contract unit, and store the return result in a predetermined node, where the federation chain is composed of at least one academic degree allocation administrator and a node where a target school is located, and the return result at least includes: the result of the target user's admission;
and the intelligent contract unit 20 is configured to analyze the request for application of entering school of the target user according to a preset academic degree allocation mechanism, and determine a result of admission, where the result of admission is used to indicate whether the target school allocates academic degrees for the target user.
In the system for allocating academic degree resources, a league chain 10 is used for receiving an application request for entrance of a target user, calling an intelligent contract unit, receiving a return result of the intelligent contract unit, and storing the return result in a predetermined node, wherein the league chain is composed of at least one academic degree allocation supervisor and a node where a target school is located, and the return result at least comprises: the result of the target user's admission; the intelligent contract unit 20 is configured to analyze an admission application request of a target user according to a preset academic degree allocation mechanism, and determine an admission result, where the admission result is used to indicate whether a target school allocates an academic degree for the target user, so as to achieve the purpose of invoking the academic degree allocation mechanism in the intelligent contract to transparently allocate academic degree resources based on a federation chain, thereby achieving the technical effects of simplifying the operation process of academic degree resource allocation, enabling the whole allocation process to be transparently disclosed, and enabling allocation result data not to be tampered, and further solving the technical problems that the allocation process is tedious, the allocation process is opaque, the allocation process cannot be disclosed, and data security cannot be guaranteed due to manual allocation of academic degree resources based on a centralized academic degree allocation system in the related art.
In some embodiments of the present application, the intelligent contract unit includes: an initialization module, wherein the initialization module is configured with an initialization function, the initialization function is used for setting basic parameters, and the basic parameters at least include: two types of parameters; the first type of parameters are at least used for defining names of schools, admission limits and school district ranges; the second type of parameters at least are used for defining the starting period of the admission application, the deadline and the publicity date of the admission result; the third type of parameter is used for defining the attribute of the user structure.
In some optional embodiments of the present application, the intelligent contract unit includes: the admission application module is used for submitting the admission application of the user to a node where the school position distribution master authority is located in the alliance chain, and adding the admission application into a pending queue to wait for the school position distribution master authority to check; the admission application module is also used for receiving a modification instruction of a user, modifying the admission application, and submitting the modified admission application to a pending queue to wait for review by a credit allocation director.
In some embodiments of the present application, the node where the academic institution is located may audit the application for entrance in the following manner, specifically, at least after the node where the academic institution is located determines that the application for entrance passes the audit, the application for entrance is moved out of the pending queue, and the academic institution allocation module is called to perform academic institution.
In some optional implementations of the present application, at least after the node where the academic degree distribution director is located determines that the application for entrance passes the audit, moving the application for entrance out of the pending queue includes: calling an API (application programming interface) of the third-party auditing platform; auditing the application for entrance based on an API (application programming interface) of a third party auditing platform; and after the academic degree distribution supervisor and the third-party auditing platform both determine that the application for entrance is approved, removing the application for entrance from the pending queue. It should be noted that the API interface of the third party auditing platform includes, but is not limited to: API interfaces of departments of building, leasing, social security, family planning and the like.
In some embodiments of the present application, the predetermined degree assignment mechanism includes, but is not limited to: the points enter the scholaring system, and the random position is assigned to enter the scholaring system, wherein, the intelligent contract unit further comprises: the system comprises a credit allocation module, a credit acquisition module and a credit acquisition module, wherein the credit allocation module is used for allocating credits to a target user according to a credit acquisition system under the condition that an admission application passes an audit; and the academic degree distribution module is also used for distributing the academic degrees of the target users according to the random position-allocation academic system under the condition that the application for entrance to school passes the audit.
Specifically, the assignment of the degree to the target user according to the point learning system can be realized by the following steps: reading all users which are not in the preset alignment; obtaining the integral corresponding to each user in all the users, and sequencing according to the numerical value of the integral to obtain a ranking result, wherein the larger the integral is, the more the bit sequence number in the ranking result is, the ranking result comprises: the target bit order number of the target user; acquiring a threshold value of the admission number of a target school; and determining the target school to take the target user under the condition that the target bit sequence number of the target user is smaller than the threshold value. Specifically, if the single school scribing system is implemented in the school district where the user is located, all users applying for each school in the non-pending queue are read by the intelligent contract, the users are ranked from high to low according to the scores, the users are recorded with the ranking smaller than the recording limit of the school, the non-recorded students are dispatched to other unfilled offices or civil schools according to the principle of nearby places, and the ranking is intelligently combined after the recording is completed, so that the assignment result of the academic degree is written into the alliance chain.
Specifically, the assignment of the degree to the target user according to the point learning system can be realized by the following steps: reading all users which are not in the preset alignment; determining a first user set taking a target school as a first volunteer in all users; under the condition that the target user is determined to belong to the first user set, acquiring the integral of each user in the first user set; and sequencing according to the numerical value of the integral to obtain a ranking result, wherein the larger the integral is, the more the bit sequence number in the ranking result is, the ranking result comprises the following steps: the target bit order number of the target user; acquiring a threshold value of the admission number of a target school; and under the condition that the sequence number of the target position of the target user is smaller than the threshold value, determining the target user to be logged by the target school, after the first volunteer is logged, if other users are not logged, redistributing according to a second volunteer, if the second volunteer is not logged, redistributing according to a third volunteer, and if not logged, regulating the users which are not logged to the office or the civil school with the remaining academic positions. If the college district where the users are located carries out a college district volunteer filling and entering system, the intelligent contract firstly reads all users taking schools as first volunteers in the non-pending queue, the users are sorted according to the height of the score, and the users whose ranking is less than or equal to the school admission limit are admitted. After the first batch of admission is finished, all users taking the school as a second volunteer which is not fully admitted are read in the non-admitted queue by the intelligent contract, the users are sorted according to the height of the score, the intelligent contract is admitted with the ranking less than or equal to the rest denomination of the school, and the third volunteer has the same reason. After the third batch of recording is finished, the students which are not recorded yet are dispatched to other office or civil schools which are not fully recorded according to the principle of nearby, and the intelligent dating is performed after the recording is finished, and the assignment result of the academic degree is written into the alliance chain.
Specifically, the assignment of the degree to the target user according to the random-position-assignment learning system can be realized by the following steps: acquiring random number intervals corresponding to schools, wherein the random number intervals comprise: a target random number interval corresponding to a target school; and under the condition that the first random number belongs to the target random number interval, determining the target school to take the target user.
In some embodiments of the present application, obtaining a random number interval corresponding to each school includes: acquiring the threshold of the number of recorded people corresponding to each school; determining a head population threshold of the admission population thresholds of all schools; and determining a random number interval according to the threshold value of the admission number corresponding to at least one school in each school and the ratio of the threshold value of the total number of people.
For example, suppose that the schoolA, schoolB, schoolC schools have college degrees available for random distribution in the school district of a plurality of schools, and the admission limit is
The intelligent contract is to be for each applicant
In a uniform distribution over the interval of (a) to extract a random number
The distribution mode is as follows:
in the formula
Refers to the applicant
The name of the school that was enrolled;
after the completion of the distribution, the user may,
and
the contract is stored in the alliance chain, and the intelligent contract is executed.
In some implementations of the present application, the intelligent contract unit further includes: the result query module is used for generating a query result according to the type of the calling object and the query instruction of the calling object; under the condition that the calling object is a target user node, displaying the admission application state of the current time of the target user and the admission list of the target school according to the query instruction of the target user, wherein the admission application state comprises the following steps: whether the admission application is passed or not and whether the target user needs to supplement personal data or not, wherein the admission list comprises: names, points and ranks of all students enrolled by the target school; under the condition that the calling object is a scholarly allocation supervisor node, displaying at least one of the following information according to the query instruction of the scholarly allocation supervisor: any user's request for entrance, application record and any school's admission list in any time period.
In other optional embodiments of the present application, the system further comprises: and the certificate issuing module is at least used for registering an account according to the identity information of the user and issuing a digital certificate and a public and private key pair for the account. That is, after a user registers an account with an identification number, a digital certificate and a public and private key pair are obtained, it should be noted that the public and private key pair is mainly used for asymmetric encryption, the private key generates a digital signature of the user, and the public key is used for signature verification
In some implementations of the present application, the system further includes: and the MSP module is at least used for configuring operation authority to the account corresponding to the target user after the verification of the digital certificate of the account and the public and private key pair is passed.
Fig. 2 is an exemplary illustration of an optional system for assigning academic degree based on federation chain intelligence and contracts according to an exemplary embodiment of the present application, as shown in fig. 2, the system includes: the system comprises a alliance chain, a certificate issuing module, an MSP module and an intelligent contract.
Specifically, the federation chain in the embodiment of the present application is a block chain with an admission mechanism, which is established by a plurality of academic degree distribution authorities (such as district and county education bureaus) or third-party authorization units (such as schools, related public institutions, and the like), a user needs to query related information or invoke related functions according to authority, and each institution can establish a plurality of common nodes and sequencing nodes according to authorization, which are used for checking, sequencing, storing block data and executing intelligent contracts.
The certificate issuing module mainly comprises a digital certificate generating tool (such as OpenSSL), a user can register an account number by using an identity card number to obtain a digital certificate and a public and private key pair, the public and private key pair is mainly used for asymmetric encryption, the private key generates a digital signature of the user, and the public key is used for signature verification.
The MSP module is composed of two parts, namely, authorized Identities and authority setting (Policy providers), and is used for setting the Identities (such as nodes, users and the like) of registered users or organizations in a federation chain and granting corresponding authorities to the registered users or organizations according to the Identities. The user's rights include: (1) submitting or modifying personal information and an application for entrance, but the premise is that double digital signatures of the person and a management organization in a study area are required to be obtained; (2) the method is used for inquiring the own application for entrance and the application change record or the admission list of a certain school, and the intelligent contract inquiry can be directly invoked without the endorsement of a management organization in the inquiry operation. Rights of nodes of other organizations include: (1) verifying whether the record in the block is valid; (2) and querying the admission application and application change records of any person in the alliance chain and a school admission list.
Illustratively, the intelligent contract unit consists of four secondary modules, including an initialization module, an application module for entering school, a degree distribution module and a result query module.
For example, the initialization module may be an initialization function init edge () that is executed while the smart contract is installed, and it should be noted that the initialization function mainly sets some important basic parameters, including but not limited to: (1) the name, admission limit, school zone range, etc. of each school; (2) the start date, expiration date, publication date, etc. of the submission of the application for admission; (3) the definition and initialization of variables such as user information atterp, history HistoryQueryResult and the like, user ranking rank, user score, whether a user is in a waiting confirmation queue pending and the like.
It should be noted that the admission application module is mainly used for the user to submit or modify the admission application and confirm whether the user application is approved by the management organization. After a user submits an application to a node, the node adds the application into a pending queue, and the application is removed from the pending queue only after the application is approved by a management organization, so that a multiple signature mechanism is formed, the conditional city can also realize on-line automatic audit through API interfaces of departments such as building, leasing, social security, family planning and the like, and the approval efficiency is further improved.
Illustratively, the academic degree allocation module is mainly used for realizing various academic degree allocation mechanisms, including a credit entrance list school record system, a credit entrance university district volunteer filling system and a random position assignment academic system, the allocation modes are embodied in an intelligent contract in the form of codes, and corresponding allocation strategies are automatically executed after application time is over, so that the public and transparent academic degree allocation process and the accurate and efficient allocation strategies are ensured, the error probability is effectively reduced, the allocation result is more popular, the waste of time and energy is avoided, and the system efficiency is improved.
The function of the result query module is different according to different calling objects, and the query authority of the user is as follows: (1) inquiring the own entrance application, wherein the function is mainly used for inquiring the current state of the own entrance application by a user, such as whether materials need to be supplemented or not; (2) inquiring change records of the personal study application; (3) the admission list of a school is inquired, any user can call the interface during the period of admission result disclosure, and the admission list contains main information such as names, points, ranks and the like of all students admitted by the school, so that the assignment result of the academic degree is more open and transparent, the admission process can be supervised in the whole process, and the open transparency and the rationality of the assignment result are guaranteed. And the inquiry authority of the node of the director comprises the following steps: (1) inquiring any person for an application for entrance; (2) inquiring the application change record of any person; (3) the school's admission list may be queried at any time. Due to the characteristics that the block chain is not falsifiable and traceable, and the function that any node can check the application records and the recording results at any time, the material data counterfeiting cost is greatly increased.
It is easy to notice that this distribution system can effectively promote the operating efficiency of academic degree distribution system, reduces the waste of manpower and material resources to because the public, transparent, the traceable characteristic of alliance chain, the record is difficult to be tampered with, can the effective data be tampered with, in addition based on many centers, distributed system's advantage, can also to a great extent promote system's security and reliability.
For example, fig. 3 is a schematic flowchart of an optional academic degree assignment according to an embodiment of the present application, and as shown in fig. 3, the flowchart mainly includes:
a user applies for an account to obtain a digital certificate and a public and private key pair; MSP provides identity authentication, sets account number authority, then, a user can submit or modify an application for entrance, and submits required materials to relevant institutions (such as district and county education bureau) through a client, after the institutions audit the materials are qualified, a management institution can send a digital signature approval application to an intelligent contract, and the assigned entrance is randomly assigned according to a computer or the accumulated entrance (including single school entrance or college volunteer filled entrance), and after the assignment of the academic degree is completed, an assignment result can be written into a alliance chain; in the event that the institution reviews the material as being unacceptable, the user may again modify the material. It can be understood that the user can inquire the application of the user, the change record of the application of the user, the admission list of a certain school, call the intelligent contract interface and return the inquiry result.
For example, in an optional embodiment, the assignment method of the academic degree resource may be implemented by the following steps:
s1: the user applies for an account: the user needs to input information such as an identity card number and the like to register an account number in the first step, after application is successful, the user can obtain a digital certificate issued by a digital certificate generating tool (such as OpenSSL) and a public key and a private key required by signature, the identity card number and the public key form a key value pair, and the identity card number is the ID of the user.
S2: the alliance chain authenticates the user account and sets account authority: the step is the most important difference between the alliance chain and the public chain, the alliance chain authenticates and defines the identity of the acquired digital certificate through an MSP (Membership Service provider) module, sets account number authority according to configuration information in a creating Block (Genesis Block), and can perform the next operation only if the authenticated account number is acquired.
S3.1: filing or amending the application for admission:
s3.1.1 user submits application: if the user submits the application for entering into the school for the first time, the personal basic information (such as identity card number, account information, family address, social security information, declaration school and the like) is required to be summarized according to the requirement of the management organization of the school district, the attep parameter is input faithfully, and then the intelligent contract is called to apply for the interface for entering into the school. If the user needs to modify the application for entry or re-applies because the application material is unqualified, the attriP parameter is modified according to the requirements and the actual situation, and the intelligent contract is called again to submit the application for entry. The user calls the intelligent contract to apply for the entrance interface according to the self requirement
(attriP, pkP, hashP, sign p), where the parameter attriP is the basic information of the user, the parameter pkP is the public key of the user, the parameter hashP is the hash digest of the basic information attriP of the user, and the parameter sign p is the private key sk used by the user to perform hash on hashPA signed digital signature. After receiving the request, the intelligent contract firstly uses the Hash function to obtain the Hash abstract of the attep and compares the Hash abstract with the Hash P, if the Hash abstract is consistent with the Hash P, then uses the public key pkP to verify the digital signature signP, if the verification is passed, the intelligent contract writes the attep into the alliance chain and applies for
Add pending queue.
S3.1.2 regulatory authorities approve: the user submits various materials required for applying for entering or modifying the application to the management institution of the school district according to the local management strategy, and the management institution sends the calling application to the intelligent contract of the alliance chain after receiving the materials and verifying the materials without errors
(attig, pkG, hashG, signG), smart contract receipt
After the request, the Hash function is used for verifying the authenticity of atterg and hashG, the public key of a management mechanism is used for verifying the digital signature signG after the verification is passed, the intelligent contract reads the information in the pending queue according to the user ID after the verification is passed, the atteP and atterg are compared, if the attemper and attemperG are consistent, the verification is passed, and the application is carried out to apply for the attemper
The pending queue is removed and the smart contract will automatically execute the follow-up process. If not, the verification is not passed and the user needs to modify the material and resubmit the application.
S3.1.3 performs a degree assignment: the intelligent contract academic degree distribution module comprises two methods of point entrance and computer random position distribution, and different choices are made according to the academic district management strategy of the applicant.
S3.1.3.1 implements the points-to-study management strategy: after the application passes the inspection, the intelligent contract calculates the user points according to the user atterip fields in step S3.1.2 and according to the management strategy, writes the user points into the alliance chain, and automatically ranks after the application time is up. The user places in the school district to implement a single school score marking system, an intelligent contract reads all users applying for each school in the non-pending queue, the users are ranked from high to low according to points, the users are recorded when the ranking is smaller than the school recording limit, the students which are not recorded are dispatched to other office or civil schools which are not recorded fully according to the principle of nearby, and the students intelligently match the dates to write the academic rank distribution result into the alliance chain after recording is completed. If the college district where the users are located carries out a college district volunteer filling and entering system, the intelligent contract firstly reads all users taking schools as first volunteers in the non-pending queue, the users are sorted according to the height of the score, and the users whose ranking is less than or equal to the school admission limit are admitted. After the first batch of admission is finished, all users taking the school as a second volunteer which is not fully admitted are read in the non-admitted queue by the intelligent contract, the users are sorted according to the height of the score, the intelligent contract is admitted with the ranking less than or equal to the rest denomination of the school, and the third volunteer has the same reason. After the third batch of recording is finished, the students which are not recorded yet are dispatched to other office or civil schools which are not fully recorded according to the principle of nearby, and the intelligent dating is performed after the recording is finished, and the assignment result of the academic degree is written into the alliance chain.
S3.1.3.2 executing a computer random placement management policy:
suppose that the schoolA, schoolB and schoolC schools have college degrees available for random distribution in the school district with multiple schools and the admission limit is
The intelligent contract is to be for each applicant
In a uniform distribution over the interval of (a) to extract a random number
The distribution mode is as follows:
in the formula
Refers to the applicant
The name of the school that was enrolled;
after the completion of the distribution, the user may,
and
the contract is stored in the alliance chain, and the intelligent contract is executed.
S3.2: inquiring the application of the person, inquiring the change record of the application of the person and inquiring an admission list of a school: after the user registers the account and passes the authentication, the inquiry module of the intelligent contract can be called without the signature of a management mechanism, and the inquiry module mainly comprises three types of inquiry.
The first is to inquire the current application state of the person and call an inquiry application interface ReadApplication (pyto [ ] byte, pk public key) (. Student, error) to inquire. Where crypto is a signature generated by encrypting the public key pk with the user private key sk. After receiving the request, the intelligent contract firstly verifies the signature crypto according to the public key pk of the user, and if the verification is passed, the latest state information of the application for learning of the user corresponding to the public key in the alliance chain is returned.
The second is to inquire the history of the change of the information of the personal study application, and the user can call an intelligent contract inquiry history interface GetApplicationHistory (crypto [ ] byte, pk PublicKey) ([ ] HistoryQueryResult, error) to inquire the related information. The input parameters are consistent with the query application interface ReadApplication (), and are not described again. If the verification is passed, the intelligent contract returns the information of all data change records, change time, changers and the like corresponding to the user's application for entrance from submission to application.
The third is to inquire the enrollment list of a school, and the user can call the intelligent contract query by school (school running) interface to inquire the enrollment public list of any school in the public period (the public period is set when the intelligent contract is initialized), wherein the school parameter is the name of the school to be inquired. The list returned by the query result contains the names, school districts, scores or ranks and other information of all the admission students of the queried school.
Fig. 4 is a method for allocating academic resources according to an embodiment of the present application, and as shown in fig. 4, the method is applied to a federation block chain and includes the following steps:
step S102, receiving a request for application of learning of a target user forwarded by a alliance chain, wherein the alliance chain comprises at least one academic degree distribution supervisor and a node where a target school is located;
step S104, analyzing the request of the target user for application of learning according to a preset academic degree distribution mechanism, and determining a result of admission, wherein the result of admission is used for indicating whether the target school distributes academic degrees for the target user;
and step S106, returning the result of the recording to the alliance chain.
In the assignment method of the academic degree resources, an application request for entrance to study of a target user forwarded by a alliance chain is received, wherein the alliance chain comprises at least one academic degree assignment supervisor and a node where a target school is located; then, analyzing the request of the target user for application of learning according to a preset academic degree distribution mechanism, and determining a result of admission, wherein the result of admission is used for indicating whether the target school distributes academic degrees for the target user; and finally, the admission result is returned to the alliance chain, so that the purpose of transparently allocating the academic resources based on the alliance chain by calling an academic allocation mechanism in the intelligent contract is achieved, the operation process of academic resource allocation is simplified, the whole allocation process can be transparently disclosed, and the technical effects that the allocation result data cannot be falsified are achieved, so that the technical problems that the allocation process is complicated, the allocation process is opaque, the allocation process cannot be disclosed, and the data security cannot be guaranteed due to the fact that the academic resource allocation is performed in a manual mode based on a centralized academic allocation system in the related technology are solved.
It is easy to note that the present application has the following beneficial effects compared to the related art: first, the academic degree distribution of the obligation education stage can be realized in an intelligent contract mode, no matter the academic degree is entered or the academic degree is randomly assigned, the specific processes of credit, ranking, shaking number, recording and the like can be fixed in a code mode through the intelligent contract, and the intelligent contract is installed and disclosed on each node of a block chain.
Secondly, the intelligent contract is based on the alliance chain instead of the public chain, the alliance chain is provided with an admission mechanism, the nodes and the users with permission can use and access the system, the auditing mechanism participates in distribution and auditing as the nodes, and the supervising responsibility in the course of assigning the academic degree is continuously undertaken, so that the risk brought by anonymity is avoided, the public transparency of the academic degree assignment process is improved, the supervision and privacy protection to a certain degree is provided, and the practicability is higher.
Thirdly, based on the characteristics of transparent disclosure, non-falsification, traceability and the like of the alliance chain, the data and the logging result of each applicant can be stored on each node, and the logging result, the attribute data and the change history thereof can be inquired, so that the cost and the cost of falsification of the data are greatly increased, and the endorsement of the alliance chain can effectively reduce the trust cost of a user on the academic degree distribution system.
Fourthly, the system is distributed and provided with a plurality of central nodes, and has certain fault-tolerant capability, so that the stability of the whole system is greatly improved, and the system is safer and more reliable.
According to another aspect of the embodiments of the present application, there is also provided a processor, configured to execute a program, where the program executes the assignment method of the academic aptitude resource.
Specifically, the processor is configured to call a program instruction in the memory, and implement the following functions:
receiving a request for application of learning of a target user forwarded by a alliance chain, wherein the alliance chain comprises at least one academic degree distribution supervisor and a node where a target school is located; analyzing a request for applying for entrance of a target user according to a preset academic degree distribution mechanism, and determining an admission result, wherein the admission result is used for indicating whether the target school distributes academic degrees for the target user or not; and returning the result of the enrollment to the federation chain.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units may be a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.
Claims (15)
1. A system for allocating academic resources, comprising:
the alliance chain is used for receiving an application request for entrance of a target user, calling an intelligent contract unit, receiving a return result of the intelligent contract unit and storing the return result in a preset node, wherein the alliance chain is composed of at least one academic degree distribution supervisor and a node where a target school is located, and the return result at least comprises: the target user's admission result;
and the intelligent contract unit is used for analyzing the request of the target user for application for entrance according to a preset academic degree distribution mechanism and determining the admission result, wherein the admission result is used for indicating whether the target school distributes the academic degree for the target user.
2. The system of claim 1, wherein the intelligent contract unit comprises:
an initialization module, wherein the initialization module is configured with an initialization function, the initialization function is used for setting basic parameters, and the basic parameters at least include: two types of parameters;
the first type of parameters are at least used for defining names of schools, admission limits and school district ranges; the second type of parameters at least are used for defining the starting period of the admission application, the deadline and the publicity date of the admission result; the third type of parameter is used for defining the attribute of the user structure.
3. The system of claim 1, wherein the intelligent contract unit comprises:
the admission application module is used for submitting the admission application of the user to each node of the alliance chain, adding the admission application into a pending queue to wait for the review of a degree distribution supervisor;
the admission application module is further configured to receive a modification instruction of a user, modify the admission application, and submit the modified admission application to a pending queue to wait for review by a degree allocation director.
4. The system of claim 3, wherein the node at which the academic degree distribution authority is located audits the request for entrance by:
and at least after the node where the academic degree distribution main organization is located determines that the application for entrance passes the audit, moving the application for entrance out of the pending queue, and calling a academic degree distribution module to distribute the academic degrees.
5. The system according to claim 4, wherein removing the inbound application from the pending queue at least after the node where the degree assignment authority is located determines that the inbound application passes the audit comprises:
calling an API (application programming interface) of the third-party auditing platform;
auditing the admission application based on an API (application programming interface) of the third party auditing platform;
and after the academic degree distribution supervisor and the third-party auditing platform both determine that the application for entrance is approved, removing the application for entrance from the pending queue.
6. The system of claim 4, wherein the predetermined credit allocation mechanism comprises: the point goes into the system of learning, random party goes into the system of learning, intelligent contract unit still includes:
the academic degree distribution module is used for carrying out academic degree distribution on the target user according to the point academic system under the condition that the application for entrance passes the audit;
and the academic degree distribution module is also used for carrying out academic degree distribution on the target user according to the randomly-assigned academic system under the condition that the application for entrance passes the audit.
7. The system of claim 6, wherein assigning a degree to the target user according to the point entrance system comprises:
reading all users which are not in the preset alignment;
obtaining the integral corresponding to each user in all the users, and sorting according to the numerical value of the integral to obtain a ranking result, wherein the larger the integral is, the more the bit sequence number in the ranking result is, the ranking result comprises: the target bit sequence number of the target user;
acquiring a threshold value of the admission number of the target school;
and determining the target school to take the target user when the target bit sequence number of the target user is smaller than the threshold value.
8. The system of claim 6, wherein assigning a degree to the target user according to the point entrance system further comprises:
reading all users which are not in the preset alignment;
determining a first set of users of the total users who have the target school as a first volunteer;
under the condition that the target user is determined to belong to the first user set, acquiring the integral of each user in the first user set;
and sequencing according to the numerical value of the integral to obtain a ranking result, wherein the larger the integral is, the more the bit sequence number in the ranking result is, the ranking result comprises: the target bit sequence number of the target user;
acquiring a threshold value of the admission number of the target school;
determining that the target user is logged into by the target school when the target bit sequence number of the target user is smaller than the threshold value;
and after the first volunteer is recorded, if the user is not recorded, the first volunteer is redistributed according to the second volunteer, if the second volunteer is not recorded, the second volunteer is redistributed according to the third volunteer, and if the user is not recorded, the user which is not recorded is dispatched to an office or a civil school with the rest academic position.
9. The system of claim 6, wherein assigning the target user a degree according to the randomly-assigned degree of entrance comprises:
acquiring random number intervals corresponding to the schools, wherein the random number intervals include: a target random number interval corresponding to the target school;
randomly generating a first random number for the target user;
determining that the target school has taken the target user when it is determined that the first random number belongs to the target random number interval.
10. The system of claim 9, wherein obtaining the random number interval corresponding to each school comprises:
acquiring the threshold of the number of recorded people corresponding to each school;
determining a head population threshold of the admission population thresholds of the schools;
and determining the random number interval according to the threshold value of the number of the recorded people corresponding to at least one school in each school and the ratio of the threshold value of the total number of people.
11. The system of claim 1, wherein the intelligent contract unit further comprises:
the result query module is used for generating a query result according to the type of the calling object and the query instruction of the calling object;
under the condition that the calling object is the target user node, displaying a study application state of the current time of the target user and an admission list of the target school according to a query instruction of the target user, wherein the study application state comprises: whether the request for entrance is passed or not and whether the target user needs to supplement personal data or not, wherein the admission list comprises: the names, points and ranks of all students logged by the target school;
under the condition that the calling object is the academic distribution supervisor node, displaying at least one of the following information according to the query instruction of the academic distribution supervisor: any user's request for entrance, application record and any school's admission list in any time period.
12. The system of claim 1, further comprising:
and the certificate issuing module is at least used for registering an account according to the identity information of the user and issuing a digital certificate and a public and private key pair for the account.
13. The system of claim 12, further comprising:
and the MSP module is at least used for configuring operation authority to the account corresponding to the target user after the verification of the digital certificate of the account and the public and private key pair is passed.
14. A method for allocating academic resources is applied to a federation block chain and comprises the following steps:
receiving a request for application of learning of a target user forwarded by a alliance chain, wherein the alliance chain comprises at least one academic degree distribution supervisor and a node where a target school is located;
analyzing the request for application of the target user for entrance according to a preset academic degree distribution mechanism, and determining an admission result, wherein the admission result is used for indicating whether the target school distributes academic degrees for the target user;
and returning the admission result to the alliance chain.
15. A processor configured to execute a program, wherein the program executes to perform the assignment method of academic resources described in claim 14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111559096.1A CN114037576A (en) | 2021-12-20 | 2021-12-20 | System and method for allocating academic resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111559096.1A CN114037576A (en) | 2021-12-20 | 2021-12-20 | System and method for allocating academic resources |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114037576A true CN114037576A (en) | 2022-02-11 |
Family
ID=80140895
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111559096.1A Pending CN114037576A (en) | 2021-12-20 | 2021-12-20 | System and method for allocating academic resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114037576A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114693177A (en) * | 2022-05-18 | 2022-07-01 | 成都秦川物联网科技股份有限公司 | Smart city study management method, system, device and medium based on Internet of things |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108171631A (en) * | 2018-01-03 | 2018-06-15 | 天津工业大学 | A kind of random place allocation system for education enrollment |
| CN110245843A (en) * | 2019-05-24 | 2019-09-17 | 深圳市元征科技股份有限公司 | A kind of method and relevant apparatus of the information management based on block chain |
| CN110597906A (en) * | 2019-09-10 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain-based entrance integral generation method, device, equipment and storage medium |
| CN111461738A (en) * | 2020-03-13 | 2020-07-28 | 潍坊高新区信息化建设运维有限公司 | Platform for entering study and giving notice for obligation education enrollment |
| CN112651864A (en) * | 2020-12-28 | 2021-04-13 | 北京工业大学 | Compulsory education position-assigning entrance method based on random number generation of computer system |
-
2021
- 2021-12-20 CN CN202111559096.1A patent/CN114037576A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108171631A (en) * | 2018-01-03 | 2018-06-15 | 天津工业大学 | A kind of random place allocation system for education enrollment |
| CN110245843A (en) * | 2019-05-24 | 2019-09-17 | 深圳市元征科技股份有限公司 | A kind of method and relevant apparatus of the information management based on block chain |
| CN110597906A (en) * | 2019-09-10 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain-based entrance integral generation method, device, equipment and storage medium |
| CN111461738A (en) * | 2020-03-13 | 2020-07-28 | 潍坊高新区信息化建设运维有限公司 | Platform for entering study and giving notice for obligation education enrollment |
| CN112651864A (en) * | 2020-12-28 | 2021-04-13 | 北京工业大学 | Compulsory education position-assigning entrance method based on random number generation of computer system |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114693177A (en) * | 2022-05-18 | 2022-07-01 | 成都秦川物联网科技股份有限公司 | Smart city study management method, system, device and medium based on Internet of things |
| CN114693177B (en) * | 2022-05-18 | 2022-10-11 | 成都秦川物联网科技股份有限公司 | Smart city learning management method, system, device and medium based on Internet of things |
| US11854104B1 (en) | 2022-05-18 | 2023-12-26 | Chengdu Qinchuan Iot Technology Co., Ltd. | Methods and systems for managing school attendance of smart city based on the Internet of Things |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ocheja et al. | Managing lifelong learning records through blockchain | |
| US10705801B2 (en) | Data processing systems for identity validation of data subject access requests and related methods | |
| CN106600405B (en) | Block chain-based data rights and interests protection method | |
| Soltani et al. | A new approach to client onboarding using self-sovereign identity and distributed ledger | |
| US20210357927A1 (en) | Transaction authentication system and related methods | |
| CN109450638A (en) | Electronic component data management system and method based on block chain | |
| CN108681966A (en) | A kind of information monitoring method and device based on block chain | |
| KR20230064354A (en) | Blockchain-based authentication audit data sharing and integrity verification system, device and method thereof | |
| Awaji et al. | Blockchain-based trusted achievement record system design | |
| CN109743321A (en) | Block chain, application program, the user authen method of application program and system | |
| Sayed | Potential of blockchain technology to solve fake diploma problem | |
| Abreu et al. | A blockchain-based architecture for query and registration of student degree certificates | |
| Rustiana et al. | Adoption computerized certificate transparency and confidentiality | |
| Mansoor et al. | A review of blockchain approaches for kyc | |
| CN114037576A (en) | System and method for allocating academic resources | |
| Reno et al. | Securing certificate management system using hyperledger based private blockchain | |
| CN111931230A (en) | Data authorization method and device, storage medium and electronic device | |
| Proença et al. | Blockchain Based Residential Smart Rent | |
| CN115345634A (en) | Academic degree authentication management system based on block chain | |
| Skelaney et al. | Government Applications and Standards to Use Blockchain | |
| KR102450412B1 (en) | SLA-Based Sharing Economy Service with Smart Contract for Resource Integrity in the Internet of Things | |
| Spears et al. | Is security requirements identification from conceptual models in systems analysis and design: The Fun & Fitness, Inc. case | |
| Pattiyanon et al. | Analysis and Enhancement of Self-sovereign Identity System Properties Compiling Standards and Regulations. | |
| Tumati | SBTCert: Soulbound Token Certificate Verification System | |
| Zhang | Internet of things supervision system and supply chain financial supervision methods based on blockchain technology |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220211 |