Paper and electricity integrated borrowing collaboration method based on OPAC bidirectional hooking

Abstract

The invention discloses a paper and electricity integrated borrowing collaboration method based on OPAC two-way hitching, particularly relates to the field of library resource management and borrowing collaboration, and is used for solving the problem that collaboration allocation is out of order due to scattered appointment, repeated occupation and inconsistent assignment calibers of paper books and electronic books with the same name. Availability parameters are calculated in a unified mode and mapped into an allocatable opportunity queue and an opportunity list, joint reservation lists are generated and written into a unified reservation sequence, a matching index is established, and when opportunities are newly added or released and triggered, a computer abandons the frequency and the pressure of the first product of the queue and outputs an allocation tightening coefficient to limit a candidate joint reservation list set. After mutual exclusion verification and occupation verification are completed, a distribution instruction is generated, and a state record is written back.

Description

Technical Field

[0001] This invention relates to the field of library resource management and borrowing collaboration, and more specifically, to a paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage. Background Technology

[0002] In daily library services, both print and e-books are accessible to readers for searching and borrowing. Readers expect to check availability and reserve books on the OPAC search page, while simultaneously borrowing and reading e-books on the e-reading platform. Existing technologies fall into two categories: one focuses on streamlining the print circulation process, such as the State Intellectual Property Office's invention patent application "Self-service Book Borrowing and Returning System and Method" (application number 200710096300.4), which links self-service terminals with the library's automated system database to enable readers to borrow and return books independently and query borrowing information. The other category focuses on e-book borrowing management and catalog association, such as the State Intellectual Property Office's invention patent application "An E-book Borrowing Management System Based on OPAC Two-Way Linking" (application number 202510247064.X), which provides e-book borrowing management and links the search and display of metadata for print and electronic resources. Because these two technologies focus on different aspects, in practice, the print circulation system and the e-borrowing platform often operate independently, with separate rules for maintaining print collections and e-licensing.

[0003] When both print copies and electronically authorized copies of books exist, the print circulation system and the electronic lending platform calculate the available quantity and maintain reservation queues and occupancy status separately. Reservations made by the same reader for the same resource are difficult to be mutually recognized on both ends, which can easily lead to concurrent conflicts where one end is occupied while the other end still allows borrowing. Furthermore, the update rhythms of print circulation data and electronic authorization data are different, making it difficult to maintain consistency between the OPAC search display and the borrowable status displayed on the reading platform. The interpretation of reservation order and occupancy rules is also inconsistent.

[0004] When the print book reservation sequence and the electronic reservation sequence are run separately, reservation behaviors such as cancellation, rescheduling, and failure to pick up within the time limit are only effective within their respective sequences, and the other end cannot detect them in time, resulting in residual occupancy information and wasted opportunities. When the library releases copies of its collection or authorizes concurrent collection, the two ends cannot uniformly assign reservations to the same reader, resulting in an imbalance in the allocation of opportunities in print and electronic formats, with one end waiting in line while the other end has idle opportunities.

[0005] To reduce concurrency conflicts and residual occupancy, it is necessary to establish a unified availability metric, allocable opportunity queue, and joint reservation mechanism for the same type of resource. When an allocable opportunity queue is added or released, a compaction decision should be made based on the execution receipt to complete the consistent assignment and status write-back for both paper and electronic forms. Summary of the Invention

[0006] To overcome the aforementioned deficiencies of the prior art, embodiments of the present invention provide a paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage. This method calculates availability parameters uniformly and maps them to an allocable opportunity queue and opportunity list. It generates joint reservation orders, writes them into a unified reservation sequence, and establishes a matching index. When an opportunity is added or released, the computer calculates the discard frequency and queue head product pressure and outputs an allocation compaction coefficient to limit the candidate joint reservation order set. After completing mutual exclusion and occupancy checks, it generates allocation instructions and writes back the status record, thereby solving the problems mentioned in the background art.

[0007] To achieve the above objectives, the present invention provides the following technical solution: S1: Receive reader identifiers and resource identifiers, read the total amount and usage from paper circulation data and electronic authorization data respectively, and generate availability parameters according to the conventional borrowing calculation rules; S2: Convert the availability parameter into an allocable opportunity queue belonging to the same type of resource identifier, and generate an opportunity list after writing a morphological tag and occupancy verification condition for each allocable opportunity. S3: Generate a joint reservation order based on the opportunity list, which contains only the reader identifier, the same resource identifier and the form preference, and write the joint reservation order into the unified reservation sequence and the matching index corresponding to the allocable opportunity queue. S4: When adding or releasing an allocable opportunity queue, the number of abandonments is obtained based on the execution receipt, and the frequency of opportunity abandonment is calculated in conjunction with the pressure of the head of the queue. The allocation compaction coefficient is output and the set of candidate joint reservations is limited. After determining the head of the queue joint reservation, an allocation instruction is generated and a status write-back record is formed.

[0008] Furthermore, step S1 includes: Read the reader identifier and the same resource identifier, perform non-empty and non-completely blank checks, use the same resource identifier to search the collection of duplicate information set and copy information set, remove duplicates by the unique identifier of the duplicate to obtain the total amount of paper and the amount of paper in use, remove duplicates by the unique identifier of the authorized copy to obtain the total amount of electronic and the amount of electronic in use.

[0009] Furthermore, step S1 includes: The paper usage quantity is determined based on the paper non-distributable state mapping table, and the electronic usage quantity is determined based on the electronic non-distributable state mapping table. The total paper quantity and the paper usage quantity are used to form the paper book borrowable quantity and a non-negative constraint is applied. The total electronic quantity and the electronic usage quantity are used to form the electronic borrowable quantity and a non-negative constraint is applied. The availability parameter is output.

[0010] Furthermore, step S2 includes: Parse the availability parameters to obtain reader identifier, same resource identifier, number of paper books available for borrowing, and number of electronic books available for borrowing. Constrain the number of paper books available for borrowing and the number of electronic books available for borrowing to be non-negative integers. Create an empty queue of allocable opportunities and an opportunity list. Retain the same resource identifier as the queue primary key and ensure that the field name and value are consistent.

[0011] Furthermore, step S2 also includes: Based on the same resource identifier, the set of paper-based distributable copies and the set of electronic-based distributable authorized copies are screened. They are sorted by unique identifier of copy and unique identifier of authorized copy, respectively, and extracted to the paper-based borrowable quantity and the electronic-based borrowable quantity. Distributable opportunity identifiers are generated for the selected identifiers and written with morphological markers, occupancy verification conditions and version identifier snapshots to form an opportunity list and perform stable sorting on the distributable opportunity queue.

[0012] Furthermore, step S3 includes: Upon receiving a reservation request, the system executes a national cryptographic hash algorithm on the reservation intent string to generate a reservation intent key and retrieves the reservation intent key in the unified reservation sequence. If a match is found, the system updates the access timestamp and returns the joint reservation order identifier. If a match is not found, a joint reservation order identifier is generated and the joint reservation order record is written into the unified reservation sequence.

[0013] Furthermore, step S3 also includes: Read the opportunity list, limit the matching range of the form according to the form preference, traverse the opportunity list to filter the allocable opportunity identifiers that meet the form matching range to form a candidate opportunity set, remove duplicates from the candidate opportunity set according to the allocable opportunity identifier and sort it, generate a matching index record with fixed fields of joint reservation order identifier, same resource identifier, candidate opportunity set, unified reservation sequence position pointer and write it to the matching index storage area.

[0014] Furthermore, step S4 includes: When a new event or release event occurs in the allocable opportunity queue, load the opportunity list, unified reservation sequence, matching index, borrowing record set and mutual exclusion state mapping table, determine the statistics window and extract the abandonment count from the execution receipt within the statistics window, accumulate the effective opportunity product based on the queue state change record and form the opportunity abandonment frequency.

[0015] Furthermore, step S4 also includes: Based on the unified reservation sequence position pointer of the matching index, the queue head segment is scanned from the starting position of the unified reservation sequence. The queue head segment records satisfy the following conditions: the candidate opportunity set is not empty, the occupancy verification condition is true, and no successful execution receipt status has appeared. The accumulated waiting time of the queue head segment forms the queue head queue product time and forms the queue head product time pressure.

[0016] Furthermore, step S4 also includes: The frequency of opportunity abandonment and the pressure of the queue head product are input into the machine learning model to obtain the allocation compaction coefficient. The allocation compaction coefficient is mapped to the first compaction rule set, the second compaction rule set, and the third compaction rule set to limit the candidate joint reservation order set. After the candidate joint reservation order set is verified by the mutual exclusion state mapping table and the occupancy verification condition, an allocation instruction is generated and written to the state write-back record.

[0017] The technical effects and advantages of this invention's paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage are as follows: This invention unifies print and ebooks with the same title into a single collaborative link—allocable opportunities, unified reservation sequence, matching index, and assignment write-back—under the bidirectional connection of OPAC. This achieves consistency in approach and action from the retrieval entry point to the borrowing execution, avoiding situations where readers repeatedly make reservations at different entry points or the library repeatedly occupies positions on the print circulation side and the electronic authorization side. It also allows the queuing order, candidate opportunities, and execution results to be presented in alignment under the same view, thereby improving the coherence and understandability of cross-format borrowing services.

[0018] Meanwhile, the assignment phase is triggered by opportunity changes and comprehensively reflects the degree of fulfillment of occupancy and the tension of waiting at the front of the queue, forming an adaptive convergence of the candidate range. After mutual exclusion and occupancy verification, a one-time assignment and status write-back are completed, making the allocation process less prone to fluctuations such as those who are assigned but cannot borrow and those who do not borrow repeatedly releasing the books. This reduces the interference of invalid waiting and repeated operations on readers and the library, and achieves a collaborative borrowing experience that integrates paper and electronic books without changing the existing paper circulation and electronic authorization execution mechanism. Attached Figure Description

[0019] Figure 1 This is a flowchart illustrating the paper-electronic integrated borrowing collaboration method based on OPAC bidirectional connection according to the present invention. Detailed Implementation

[0020] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0021] Example 1: Figure 1 This invention presents a paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage, comprising: S1: Receives reader identifiers and resource identifiers, reads the total amount and usage from paper circulation data and electronic authorization data respectively, and generates availability parameters according to conventional borrowing calculation rules.

[0022] S2: Convert the availability parameter into an allocable opportunity queue belonging to the same type of resource identifier, and generate an opportunity list after writing a morphological tag and occupancy verification condition for each allocable opportunity.

[0023] S3: Based on the opportunity list, generate a joint reservation order for the reservation request that contains only the reader identifier, the same resource identifier, and the form preference, and write the joint reservation order into the unified reservation sequence and the matching index corresponding to the allocable opportunity queue.

[0024] S4: When adding or releasing an allocable opportunity queue, the number of abandonments is obtained based on the execution receipt, and the frequency of opportunity abandonment is calculated in conjunction with the pressure of the head of the queue. The allocation compaction coefficient is output and the set of candidate joint reservations is limited. After determining the head of the queue joint reservation, an allocation instruction is generated and a status write-back record is formed.

[0025] This invention addresses the borrowing scenario in libraries where the same title exists in both print and ebook formats. It unifies the two separate reservation and allocation processes, originally scattered across OPAC and ebook platforms, into a single collaborative allocation process that integrates print and ebooks. This avoids problems such as readers queuing repeatedly at two different entrances, occupying spaces on two different resource platforms, and librarians struggling to align their processing methods.

[0026] The idea is to first abstract both print and ebooks into the same type of allocable opportunity. The print circulation side and the ebook licensing side calculate their respective borrowable quantities, and then encapsulate them into a unified availability parameter. Subsequently, the borrowable quantities are assigned to individual opportunity entities, forming an allocable opportunity queue and opportunity list with the same resource identification dimension. Each opportunity has a form tag and occupancy verification conditions to ensure that the opportunity is still valid before assignment.

[0027] In the reader reservation process, this invention no longer creates separate paper reservations and electronic reservations. Instead, it converges a single reservation request into a joint reservation form. The joint reservation form retains only the reader identifier, the same resource identifier, and the form preference, and writes them into a unified reservation sequence. At the same time, a matching index is generated to align the joint reservation form with the candidate opportunity set in the opportunity list, so that subsequent assignments can directly locate the first record in the queue and the available opportunities, avoiding queue fragmentation caused by different entry points.

[0028] In the allocation process, this invention uses the addition or release of the allocable opportunity queue as a unified trigger point. Combining execution receipts and queue status change records, it calculates the frequency of unfulfilled opportunities after being occupied and the queue head time pressure, which reflects the degree of congestion at the queue head. Then, it outputs an allocation compaction coefficient through a machine learning model, maps the coefficient to a set of compaction rules, and forms a candidate joint reservation set for the queue head segment. Finally, it sequentially verifies the mutual exclusion occupancy constraints and occupancy verification conditions of the same resource within the candidate set, generates allocation instructions, routes them to the paper circulation execution unit or the electronic borrowing execution unit, and writes the results into the status write-back record for consistent display at both ends.

[0029] The overall solution can be summarized as follows: Use a unified standard to classify paper books and e-books as the same type of allocable opportunity; use a unified queue to handle reservations; use a matching index to achieve stable positioning; use abandonment and congestion signals to drive the allocation constraint strength; and finally, use mutual exclusion and occupancy checks to ensure that each assignment lands on only one valid opportunity and generates a traceable receipt. This approach maintains the basic fairness of first-come, first-served while reducing the coordination difficulties caused by duplicate reservations and invalid occupancy.

[0030] The paper-electronic integrated borrowing collaboration requires putting paper circulation data and electronic authorization data into the same allocation link. Subsequent queue construction and reservation merging rely on a unified standard of resource availability input. Because the recording structure and occupancy standard of the paper circulation side and the electronic authorization side are different, the entry stage needs to first converge the quantity information under the same resource identifier into comparable calculation results.

[0031] The same resource identifier is used to uniquely identify the aggregated object of the paper copy set and the electronic authorized copy set. Its value is derived from the unique OPAC bibliographic record number; if no unique number is provided, it is the concatenated string of the title and standard book number after character normalization. The unified clock source provides a consistent time reference for comparing the write timestamp and the receipt timestamp. Its value is derived from the library's time synchronization service or the network time protocol time synchronization service. The configuration data area stores the mutual exclusion state mapping table, the paper non-assignable state mapping table, the electronic non-assignable state mapping table, the boundary parameter set, the compaction rule set, machine learning model files, and version information.

[0032] S101 entrance element verification and positioning preparation.

[0033] The paper-to-electronic borrowing collaboration needs to align the borrowing meanings of the paper circulation side and the electronic authorization side. Otherwise, the availability of the same resource identifier presented at the two entry points cannot be compared, and it will be difficult to achieve consistent mapping of the subsequent allocable opportunity queues. Since the entry data often comes from different interfaces and interfaces, the validity constraints of the reader identifier and the same resource identifier must first be written into an executable check to avoid null values ​​and format drift from breaking the calculation chain.

[0034] The reader identifier and the same resource identifier serve as the entry inputs. The reader identifier is limited to a non-empty and non-completely blank string, and the same resource identifier is also limited to a non-empty and non-completely blank string. Furthermore, the same resource identifier must satisfy a one-to-many query condition, allowing association with multiple paper copy records and multiple electronic authorization records. If the reader identifier and the same resource identifier fail the verification, the number of paper books that can be borrowed and the number of electronic books that can be borrowed are set to zero, and an availability parameter is generated as the output. If the verification passes, the process proceeds to the next sub-step while keeping the original values ​​of the reader identifier and the same resource identifier unchanged, which are then used as index keys for subsequent steps.

[0035] S102 Information Acquisition and Standardization of Paper Circulation Side Collection Copies

[0036] The calculation of borrowable data on the paper circulation side usually relies on the status of duplicate copies. When duplicate records are repeated, status fields are inconsistent, or the meaning of status is not fixed, it will directly cause fluctuations in the total amount of paper and the amount of paper in use. Since the paper circulation data often undergoes repeated imports and asynchronous write-backs during long-term operation within the library, the unique identifier of the duplicate copy and the status mapping table must be written into the calculation logic as a hard basis.

[0037] Using the same resource identifier as the query key, the system retrieves a set of duplicate information from the paper circulation side. This duplicate information includes at least a unique duplicate identifier and a duplicate status field. The system then performs deduplication on the duplicate information based on the unique duplicate identifier, retaining the most recently written duplicate record and discarding all other duplicates. Finally, it retrieves a set of unallocable statuses from a pre-configured unallocable status mapping table. This table is stored in the configuration data area and can be maintained by the library. The status set includes borrowed occupancy and reserved occupancy. The status categories of paper in use include: in-transit, inventory freeze, etc., which block borrowing and allocation. When the copy status field matches the set of unallocable statuses, it is included in the paper in use; otherwise, it is not included. The total paper quantity is calculated based on the number of duplicate records after deduplication, and the paper in use is calculated based on the number of duplicate records that match the set of unallocable statuses. The value range is limited to non-negative integers, and the paper in use is not allowed to exceed the total paper quantity. If the paper in use still exceeds the total paper quantity after deduplication, the paper in use is truncated based on the total paper quantity.

[0038] S103 Electronic Authorization Side Copy Information Acquisition and Standardization.

[0039] The calculation of borrowable electronic licenses usually depends on the occupancy status of licensed copies. When license records are duplicated, occupancy status receipts are inconsistent, or the meaning of occupancy status is not fixed, it will directly cause the total amount of electronic licenses and the amount of electronic licenses in use to drift. Since electronic licenses are often maintained by the platform side and may have states such as reserved occupancy and frozen occupancy, it is necessary to use a unique identifier of the licensed copy and a mapping table of electronic unallocable status to ensure that the caliber can be reproduced.

[0040] Using the same resource identifier as the query key, a set of copy information is read from the electronic authorization side. The copy information includes at least a unique identifier for the authorized copy and an authorization status field. The copy information is deduplicated according to the unique identifier for the authorized copy. The deduplication rule is to retain the most recently written authorization record and discard the remaining duplicate records. The set of unallocable statuses is read from a pre-set electronic unallocable status mapping table. The electronic unallocable status mapping table is stored in the configuration data area and can be maintained by the library. The status set includes status categories such as borrowing occupancy, reserved occupancy, and frozen occupancy, which prevent reallocation. When the authorization status field matches the unallocable status set, it is included in the electronic usage quantity; otherwise, it is not included in the electronic usage quantity. The total electronic quantity is calculated based on the number of authorized records after deduplication, and the electronic usage quantity is calculated based on the number of authorized records that match the unallocable status set. The value range is limited to non-negative integers, and the electronic usage quantity is not allowed to exceed the total electronic quantity. If the electronic usage quantity still exceeds the total electronic quantity after deduplication, the electronic usage quantity is truncated based on the total electronic quantity.

[0041] S104 Calculation expression and boundary handling of paper and electronic borrowable quantities.

[0042] The subsequent steps map the available borrowing quantity to an allocable opportunity queue, requiring that the available borrowing quantity of paper books and electronic books adopt the same opportunity dimension, so that paper book copies and electronic authorized copies can be uniformly scheduled as allocable opportunities under the same resource identifier; since the total quantity minus the usage quantity may result in a negative value in abnormal write-back scenarios, the order of operations and the handling of negative values ​​must be written into clear rules.

[0043] The number of paper books available for borrowing is calculated in the following order: first, obtain the total amount of paper; then, obtain the amount of paper in use; then, subtract the amount of paper in use from the total amount of paper to obtain the difference; if the difference is negative, the number of paper books available for borrowing is set to zero; if the difference is zero or positive, the number of paper books available for borrowing is set to the difference. The range of the number of paper books available for borrowing is limited to non-negative integers and does not exceed the total amount of paper.

[0044] The amount of electrons available for borrowing is obtained in the following order of operations: first, obtain the total amount of electrons; then, obtain the amount of electrons currently in use; then, subtract the amount of electrons currently in use from the total amount of electrons to obtain the difference; when the difference is negative, the amount of electrons available for borrowing is set to zero; when the difference is zero or positive, the amount of electrons available for borrowing is set to the difference. The range of the amount of electrons available for borrowing is limited to non-negative integers and does not exceed the total amount of electrons.

[0045] Example: For the same resource identifier, there are three paper copy records, two of which have copy statuses that match the paper unallocable status set, and one of which does not match the paper unallocable status set. The total paper quantity is three, the paper quantity in use is two, and the paper book borrowable quantity is one (three minus two). For the same resource identifier, there are two electronic authorization records, one of which has an authorization status that matches the electronic unallocable status set, and one of which does not match the electronic unallocable status set. The total electronic quantity is two, the electronic quantity in use is one, and the electronic borrowable quantity is one (two minus one).

[0046] S105 Availability Parameter Generation and Output Structure Constraints.

[0047] The availability parameter is the only upstream input of S2. The field composition and index key must be clearly defined and kept in accordance with the rules. Otherwise, the allocation opportunity queue mapping will result in missing fields or inconsistent references. Since the field naming habits of the paper circulation side and the electronic authorization side are different, the output structure must be fixed to the same set of fields and the names must remain unchanged.

[0048] The availability parameter is defined as a structured output that includes both the number of print books and the number of electronic books available for borrowing. It is associated with the same record level as the reader identifier and the same resource identifier. The output field set is fixed as: reader identifier; same resource identifier; number of print books available for borrowing; number of electronic books available for borrowing. The reader identifier and the same resource identifier keep their original values ​​unchanged, and the number of print books available for borrowing and the number of electronic books available for borrowing keep the results of the previous calculations unchanged. The value range is non-negative integers. The availability parameter is directly referenced as the upstream input of S2 and is used to map the number of print books available for borrowing and the number of electronic books available for borrowing to the allocatable opportunity queue under the same resource identifier.

[0049] Step S1 uses reader identifiers and similar resource identifiers as inputs to read the total amount and usage of paper circulation data and electronic authorization data, respectively, and generates the number of paper books available for borrowing and the number of electronic books available for borrowing according to the conventional borrowing calculation rules. Finally, it forms the same availability parameter and maintains the binding relationship with reader identifiers and similar resource identifiers.

[0050] Reservation and assignment cannot rely solely on order-of-magnitude information. Pre-execution verification and mutual exclusion determination require each opportunity entity as a carrier. Because the occupancy status of paper and electronic forms changes frequently, the allocation object needs to have the ability to distinguish forms and verify occupancy in order to form a stable set of candidate opportunities in a unified queue.

[0051] S201 Availability Parameter Analysis and Structural Constraints.

[0052] The availability parameters output in step S1 include reader identifier, similar resource identifier, number of paper books available for borrowing, and number of electronic books available for borrowing. Step S2 needs to map the order-of-magnitude input into individual opportunity entities in order to assign subsequent reservation requests to verifiable and assignable objects.

[0053] Read the availability parameters and parse them to obtain the reader identifier, the same resource identifier, the number of paper books available for borrowing, and the number of electronic books available for borrowing. The range of values ​​for the number of paper books available for borrowing and the range of values ​​for the number of electronic books available for borrowing are limited to non-negative integers. When an availability parameter field is missing, set the corresponding value of the missing field to zero and keep the original values ​​of the other fields unchanged. The allocable opportunity queue is initialized to an empty sequence and the opportunity list is initialized to an empty sequence. The paper book form counter is initialized to zero and the electronic form counter is initialized to zero.

[0054] S202 paper book format can allocate opportunities for generation and write occupancy verification conditions.

[0055] The number of paper books available for allocation represents the number of paper copies that are eligible for allocation under the same resource identifier. The allocation opportunity for paper books needs to be bound to a unique identifier of the copy and a snapshot of the copy version identifier in order to verify changes in the copy status and prevent duplicate assignments before execution.

[0056] Using the previously disclosed acquisition method in step S1, the set of library copy information and the mapping table of unallocable paper status are obtained; the set of library copy information is deduplicated according to the unique identifier of the copy, and the deduplication rule is fixed to retain the most recently written record; the copy records whose status does not match the mapping table of unallocable paper status form the set of paper-allocable copies; the set of paper-allocable copies is sorted in ascending lexicographical order according to the unique identifier of the copy; the unique identifier of the copy is taken sequentially from the starting position of the sorting result, the number of values ​​is equal to the number of paper books that can be borrowed, and the set is truncated within the length range of the set of paper-allocable copies.

[0057] For each unique identifier of a copy, the paper form counter increments once, and a paper form allocable opportunity record is generated and written to the opportunity list and allocable opportunity queue. The fields of the paper form allocable opportunity record are fixed as follows: allocable opportunity identifier, form marker, occupancy verification condition, and copy version identifier snapshot. The allocable opportunity identifier is generated using a fixed splicing rule, and the splicing order is fixed as same resource identifier, separator, unique copy identifier, separator, and paper form counter. The splicing result is then subjected to fixed transcoding to generate an immutable string. The form marker value is fixed as paper form. The copy version identifier snapshot value is derived from the version field of the copy record, and the collection time is fixed as the time when the paper form allocable opportunity record is generated.

[0058] The occupancy check condition is defined as a Boolean predicate. The predicate consists of two checks and is ANDed. The first check is that the copy status still does not match the paper unallocable status mapping table. The second check is that the copy version identifier is equal to the copy version identifier snapshot. The value range of the predicate is limited to true or false.

[0059] Example: The same resource identifier corresponds to multiple copy records. The copy status has two categories: borrowed and occupied, and on the shelf. The paper unallocable status mapping table determines the borrowed and occupied status as unallocable. After filtering, the copy records in the on the shelf status are retained and sorted by the unique copy identifier. The paper form allocable opportunity record is written into the copy version identifier snapshot. When the copy status is subsequently changed to reserved, the occupancy verification condition returns a false value and blocks the assignment.

[0060] S203 electronic form can be allocated opportunities for generation and occupancy verification condition writing.

[0061] Electronic borrowable quantity represents the number of authorized copies eligible for allocation under the same resource identifier. Electronic allocation opportunities need to be bound to the unique identifier of the authorized copy and the snapshot of the authorized version identifier in order to verify the changes in the authorization status and prevent duplicate occupation before execution.

[0062] Using the previously disclosed acquisition method in step S1, a set of replica information and an electronically unallocable state mapping table are obtained. The set of replica information is deduplicated according to the unique identifier of the authorized replica, and the deduplication rule is fixed to retain the latest written record. The authorized records whose authorized states do not match the electronically unallocable state mapping table form an electronically allocable authorized replica set. The electronically allocable authorized replica set is sorted in ascending lexicographical order according to the unique identifier of the authorized replica. Starting from the beginning of the sorting result, the unique identifier of the authorized replica is taken sequentially, and the number of values ​​is equal to the electronic borrowable quantity, and truncated within the length range of the electronically allocable authorized replica set.

[0063] For each unique identifier of an authorized copy obtained, the electronic form counter increments once, and an electronic form allocable opportunity record is generated and written to the opportunity list and allocable opportunity queue. The fields of the electronic form allocable opportunity record are fixed as follows: allocable opportunity identifier, form marker, occupancy verification condition, and authorized version identifier snapshot. The allocable opportunity identifier is generated using a fixed concatenation rule, with the concatenation order being fixed as same resource identifier, separator, unique identifier of authorized copy, separator, and electronic form counter. The concatenation result is then subjected to fixed transcoding to generate an immutable string. The form marker value is fixed as electronic form. The authorized version identifier snapshot value is derived from the version field of the authorized record, and the collection time is fixed as the time when the electronic form allocable opportunity record is generated.

[0064] The occupancy check condition is defined as a Boolean predicate. The predicate consists of two checks and is ANDed. The first check is that the authorized status has not yet been matched with the electronic unallocatable status mapping table. The second check is that the authorized version identifier is equal to the authorized version identifier snapshot. The value range of the predicate is limited to true or false.

[0065] S204 Allocable opportunity queue sorting and opportunity list solidification.

[0066] The unified appointment sequence relies on the matching index to locate candidate opportunities. The opportunity order and field structure need to be fixed in order to maintain consistent presentation during multiple refreshes and multiple entry point jumps.

[0067] The allocable opportunity queue is sorted stably using a two-level key. The first-level key is the form marker, specifying that paper form precedes electronic form. The second-level key is the allocable opportunity identifier, sorted lexicographically in ascending order. After sorting, the allocable opportunity queue is obtained and associated with the identifiers of the same type of resource. The opportunity list is solidified into a record sequence, with the following fixed fields: allocable opportunity identifier, form marker, occupancy verification condition, and version identifier snapshot. The form marker value is limited to either paper or electronic form, the occupancy verification condition value is limited to either true or false, and the version identifier snapshot value is limited to a non-empty string.

[0068] Based on availability parameters, the available paper and electronic books are mapped to an allocatable opportunity queue under the same resource identifier. A form tag and occupancy verification condition are written for each allocatable opportunity, generating an opportunity list and establishing a connection with the same resource identifier to form the alignment basis for subsequent joint reservation orders and matching indexes.

[0069] When paper-based reservations and electronic authorization reservations coexist, repeated submissions by readers through different entry points will create dual queues and duplicate slots. Subsequent assignments will face the problems of incomparable queue order and difficulty in aligning candidate opportunities. Therefore, the reservation stage needs to converge a single reservation intention into a unified structure and enter the same sorting space.

[0070] S301 Reservation Request Standardization and Field Constraints.

[0071] When the OPAC entry point and the e-book platform entry point trigger reservation requests under the same resource identifier, the unified reservation sequence needs to receive a joint reservation order with the same structure. Field drift will cause the matching index to be unable to stably align with the opportunity list.

[0072] The set of business fields for the joint reservation order is fixed as reader identifier, same resource identifier, and form preference. The joint reservation order identifier is written into the unified reservation sequence as the association key, and the reservation intent key, write timestamp, and access timestamp fields are used as management fields for the unified reservation sequence.

[0073] S302 Reservation Intent Key Generation and Idempotency Merging Rules.

[0074] Two-way redirects and repeated page submissions can generate reservation requests with the same content. A unified reservation sequence needs to merge reservations with the same intention into one record to avoid duplicate reservations under the same reader identifier and the same resource identifier.

[0075] The process involves concatenating reader identifiers, resource identifiers, and morphological preferences in a fixed order, using a fixed delimiter and escaping it to obtain a reservation intent string. A national cryptographic hash algorithm is then applied to this string to generate a reservation intent key, whose value is limited to a fixed-length hexadecimal string. The reservation intent key is then searched within a unified reservation sequence. If a match is found, new joint reservation orders are prohibited; existing joint reservation order identifiers are retained, and the access timestamp field is updated. The access timestamp field is not involved in the sorting or placement within the unified reservation sequence. If no match is found, the process proceeds to the next sub-step to generate a joint reservation order identifier and write it.

[0076] Example: After the OPAC page initiates a reservation request, it redirects to the e-book platform page. When the reader clicks the reservation button again, the reader identifier, the same resource identifier, the form preference are consistent, and the reservation intent key is consistent. The unified reservation sequence retains a joint reservation order record. The access timestamp field changes, but the position of the unified reservation sequence does not change.

[0077] S303 Joint Reservation Order Identifier Generation and Unified Reservation Sequence Writing Rules.

[0078] A unified reservation sequence requires fixed placement rules to ensure the consistency of first-come, first-served semantics for the same resource identifier dimension. Idempotent merging needs to be independent of the placement rules to avoid updating fields from affecting the order.

[0079] A joint reservation order identifier is generated, which is fixedly composed of a reservation intent key and a same-resource identifier dimension sequence number. The two are concatenated using a fixed separator and their character sets are normalized. The character set is limited to numbers and uppercase and lowercase letters, and the separator uses symbols that cannot appear in the character set. The same-resource identifier dimension sequence number is limited to positive integers and represented as a decimal string. The same-resource identifier dimension sequence number is taken from the end-incrementing counter of the same-resource identifier dimension. The unified reservation sequence record field set is fixed as the joint reservation order identifier, reservation intent key, reader identifier, same-resource identifier, morphological preference, and write timestamp. The write timestamp is taken from a unified clock source and written to the unified reservation sequence record. The unified reservation sequence placement rule is fixed as appending to the end. When multiple concurrent writes occur at the same write timestamp, they are appended in ascending order of the reservation intent key lexicographical order.

[0080] S304 Candidate Opportunity Set Construction and Matching Index Generation Rules.

[0081] Step S4 locates the first segment of the queue from the unified reservation sequence and filters the candidate joint reservation order set through the matching index. The matching index needs to be bound to the candidate opportunity set, and the candidate opportunity set needs to be filtered from the opportunity list and maintain a stable order.

[0082] Read the opportunity list and allocable opportunity queue output from step S2. The opportunity list records fixed fields are allocable opportunity identifier, form marker, occupancy verification condition, and version identifier snapshot. When the form preference is paper book priority, the form matching range is limited to paper book form; when the form preference is electronic priority, the form matching range is limited to electronic form; when the form preference is any form, the form matching range is limited to paper book form and electronic form. Traverse the opportunity list and filter records whose form markers fall within the form matching range, extract the allocable opportunity identifier to form a candidate opportunity set; perform deduplication on the candidate opportunity set, based on the allocable opportunity identifier; sort the candidate opportunity set in ascending order of the allocable opportunity identifier lexicographical order; the unified reservation sequence position pointer value is the sequence number of the joint reservation order identifier in the unified reservation sequence, and the value range of the unified reservation sequence position pointer is limited to positive integers; the matching index record field set is fixed as joint reservation order identifier, same resource identifier, candidate opportunity set, and unified reservation sequence position pointer, and the matching index record is written to the matching index storage area.

[0083] Example: The opportunity list includes records of paper and electronic forms. When the form preference is paper books first, only the allocatable opportunity identifiers of paper book form records are extracted and added to the candidate opportunity set. After the candidate opportunity set is sorted, it is written into the matching index record. The matching index record and the unified reservation sequence record correspond one-to-one through the joint reservation order identifier.

[0084] S305 Consistency Verification and Output Object Fixing.

[0085] Step S4 relies on the joint reservation order identifier to locate the unified reservation sequence record and read the candidate opportunity set. Missing fields or name drift will prevent the candidate joint reservation order set from being formed.

[0086] Perform a consistency check. The consistency check covers the following fields: the joint reservation order field set is fixed as reader identifier, same resource identifier, and form preference; the unified reservation sequence record field set is fixed as joint reservation order identifier, reservation intent key, reader identifier, same resource identifier, form preference, and write timestamp; and the matching index record field set is fixed as joint reservation order identifier, same resource identifier, candidate opportunity set, and unified reservation sequence position pointer. All elements of the candidate opportunity set come from the allocatable opportunity identifiers in the opportunity list. If the consistency check fails, roll back the current write and return a failure status. If the consistency check passes, output the unified reservation sequence and matching index as input objects for step S4.

[0087] Based on the opportunity list, a joint reservation order is generated from the reservation request. The fields of the joint reservation order are fixed as reader identifier, same resource identifier and form preference. It is written into a unified reservation sequence according to the arrival order, and at the same time, the matching index corresponding to the allocable opportunity queue is written, so that the joint reservation order can stably locate the candidate opportunity set in the same resource identifier dimension.

[0088] The assignment action needs to be triggered when the supply of opportunities changes to avoid invalid occupation and the uncertainty of waiting for the head of the queue. Assigning simply according to the queue order is prone to repeated abandonment and mutual exclusion conflicts. Assigning simply according to the number of opportunities is prone to weakening the fairness of the head of the queue. Therefore, the assignment phase needs to use the evidence and the pressure of the head of the queue to jointly constrain the candidate range and complete the consistent write-back.

[0089] Step S4 selects opportunity abandonment frequency and queue head accumulation pressure as the only two parameters involved in the processing. This is because they respectively cover the two most critical and frequently conflicting factual constraints in the paper-electronic integrated allocation: opportunity abandonment frequency comes directly from the execution receipt and is normalized to the effective opportunity accumulation time, characterizing the density of allocable opportunities being occupied and released before borrowing under the same resource identification dimension, reflecting the uncertainty of supply-side allocation; queue head accumulation pressure is normalized to the effective opportunity accumulation time by the queue head accumulation time, characterizing the waiting congestion level at the beginning of the unified reservation sequence, reflecting the urgency of fair allocation on the demand side. The simultaneous introduction of both can incorporate supply reliability and queue head congestion into the same decision-making framework without increasing the input dimensions, avoiding repeated abandonment due to queue order alone, and avoiding long-term queue head stagnation due to available quantity alone. By allocating a compaction coefficient to select a compaction rule set, a stable constraint on the candidate joint reservation set is achieved, thereby reducing the risk of invalid allocation and duplicate occupancy and maintaining the auditable consistency of the unified queue.

[0090] S401 trigger event recognition and input object loading.

[0091] The sources of opportunity supply for paper books and electronic books are different. The dispersed trigger entry points will cause duplicate assignments of the same resource identifier and inconsistencies in state write-back. The triggering event needs to be a queue state change event of the same resource identifier dimension.

[0092] Read the opportunity list and allocable opportunity queue output in step S2, and read the unified reservation sequence and matching index output in step S3; monitor the queue status change records of the same resource identifier dimension. The queue status change record includes allocable opportunity identifier, form marker, status value, and change timestamp; the new event is determined when a new allocable opportunity identifier that did not exist before is added to the status change record and the status value is available; the release event is determined when the status value of the same allocable opportunity identifier in the status change record changes from occupied to available.

[0093] The set of borrowing records required to load the mutual exclusion constraint of the same resource is included. The set of borrowing records includes the reader identifier, the same resource identifier, and the borrowing status. The set of valid borrowing statuses is read from the mutual exclusion status mapping table. The mutual exclusion status mapping table is stored in the configuration data area and can be maintained by the library. Each status in the mutual exclusion status mapping table indicates that the occupancy is established and further borrowing is blocked.

[0094] S402: Extraction of abandonment counts, determination of statistical windows, and accumulation of effective opportunity time.

[0095] The frequency of opportunity abandonment needs to be limited to the same statistical window for the number of abandonments and the effective opportunity product time; otherwise, the abandonment frequency of the same resource identifier will be incomparable under different trigger frequencies.

[0096] The start and end points of the statistical window are determined. The end point of the statistical window is the change timestamp of the current triggered event, and the start point of the statistical window is the change timestamp of the previous triggered event of the same resource identifier dimension. If the previous triggered event does not exist, the timestamp of the first joint reservation order written in the unified reservation sequence is used. The statistical window uses a unified clock source, and the timestamp unit remains consistent throughout the entire link.

[0097] Discarded records are extracted from paper circulation execution unit receipts and electronic borrowing execution unit receipts. The criteria for determining a discarded record are fixed as follows: both the allocation confirmation receipt and the occupancy end receipt must appear, and no borrowing completion receipt must appear between the allocation confirmation receipt and the occupancy end receipt. The occupancy validity period is determined by either the occupancy expiration timestamp in the execution unit receipt or the occupancy expiration timestamp carried in the allocation instruction; if both exist, the execution unit receipt takes precedence. Discarded records are limited to the statistics window, specifically by the occupancy end receipt timestamp falling within the statistics window. The receipt chain integrity filtering rule is fixed as the simultaneous presence of the allocation confirmation receipt, the occupancy start receipt, and the occupancy end receipt; records lacking any one of these receipts are not counted as discarded records. The discard count is the number of discarded records, and the discard count is a non-negative integer.

[0098] The cumulative effective opportunity time is determined by the fixed rule of summing the time length of time that each allocatable opportunity identifier is in an available state within the statistical window. The available state time length of each allocatable opportunity identifier is determined by the queue state change record, taking the difference between two adjacent change timestamps and the time period when the state value is available. The effective opportunity time is a positive real number with the dimension of time. When the effective opportunity time is zero, the minimum time resolution of the unified clock source is taken, and the minimum time resolution comes from the unified clock source configuration parameters.

[0099] The frequency of opportunity abandonment is obtained in the following order of operations: first, obtain the number of abandonments, then obtain the effective opportunity product, and finally divide the number of abandonments by the effective opportunity product to obtain the frequency of opportunity abandonment. The unit of opportunity abandonment frequency is number per time, and the value range of opportunity abandonment frequency is a non-negative real number.

[0100] Example: After the same resource identifier triggers a release event, the statistics window covers the time period between the last trigger and the current trigger. The execution receipt shows that there is an allocation confirmation receipt and an occupation end receipt, but no borrowing completion receipt appears. The abandonment count is taken as one. The effective opportunity time is obtained by accumulating the available status time periods of the two allocatable opportunity identifiers in the statistics window. The opportunity abandonment frequency is obtained by the ratio of the abandonment count to the effective opportunity time.

[0101] S403 queuing head section positioning, queuing head time accumulation and queuing head time pressure calculation.

[0102] Reader complaints usually focus on the fact that the first record in the queue has not been allocated for a long time. The first segment of the queue needs to be positioned as a continuous executable record segment at the beginning of the unified reservation sequence to avoid truncation errors caused by an empty candidate opportunity set in the middle.

[0103] The unified reservation sequence position pointer is read based on the matching index, and the head segment is located. The head segment is defined as a continuous record segment obtained by continuously scanning backward from the starting position of the unified reservation sequence. Each record in the continuous record segment must simultaneously meet three conditions: the number of candidate opportunity set elements in the matching index is greater than zero, at least one allocable opportunity identifier in the candidate opportunity set has an occupancy verification condition that evaluates to true, and the joint reservation order has not shown a successful execution receipt status. The continuous scanning stops when any of the conditions are not met, and records after the stop position are not included in the head segment.

[0104] The queue head time is calculated in the following order: First, read the write timestamp of each joint reservation order in the queue head segment; then, read the change timestamp of the current triggering event as the calculation time point; then, subtract the write timestamp from the calculation time point for each joint reservation order to obtain the waiting time; finally, sum all the waiting times in the queue head segment to obtain the queue head time. The waiting time is measured in units of time and its value range is non-negative time length, and the queue head time is measured in units of time and its value range is non-negative real number.

[0105] The pressure of the first queue is obtained in the following order of operations: first, the queue time is obtained, then the effective chance time is obtained, and then the queue time is divided by the effective chance time to obtain the pressure of the first queue. The pressure of the first queue is dimensionless and its value range is non-negative real numbers.

[0106] Example: At the starting position of the unified reservation sequence, there are two joint reservation orders. The matching index shows that the candidate opportunity sets of the two joint reservation orders both contain the available opportunity identifier for paper book format. The occupancy verification condition in the opportunity list is true. The candidate opportunity set of the third joint reservation order is empty. The first two joint reservation orders are taken in the queue head segment. The queue head queuing time is obtained by adding the two waiting times. The queue head queuing time pressure is obtained by the ratio of the queue head queuing time to the effective opportunity time.

[0107] The S404 machine learning model infers the mapping between the allocation of compaction coefficients and the compaction rule set.

[0108] Opportunity abandonment frequency reflects the density of unfinished borrowings after being occupied, while queue head accumulation pressure reflects the tension between queue head waiting and opportunity supply. Combining the two can bring the allocation constraint strength down to the same resource identification dimension. The compaction rule set is used to convert the allocation compaction coefficient into a clear candidate joint reservation set screening condition.

[0109] The machine learning model uses a tree model, and the training samples come from historical execution receipts and unified reservation sequence records. The model input features are fixed as opportunity abandonment frequency and head-of-queue product pressure, and the model output is the allocation compaction coefficient. The allocation compaction coefficient is limited to a closed interval from zero to one. When the model output exceeds the closed interval, interval pruning is performed. The interval pruning rule is fixed as zero for values ​​less than zero and one for values ​​greater than one.

[0110] In one embodiment, the machine learning model uses an extreme random tree classification model. The input only includes the frequency of opportunity abandonment and the pressure of the head-of-the-queue product. The output is an allocation compaction coefficient used to select the first compaction rule set, the second compaction rule set, and the third compaction rule set. The training samples are constructed with queue state change events of the same resource identifier dimension as the granularity: each new event or release event forms a sample record. Feature 1 is the frequency of opportunity abandonment within the statistical window corresponding to the event, and feature 2 is the pressure of the head-of-the-queue product within the statistical window corresponding to the event. Samples with abnormal feature values ​​are removed according to the timestamp order verified by a unified clock source. Samples with zero features are retained and marked as scenarios where the available state is continuously insufficient for training coverage boundaries. The supervision labels are automatically generated using a playback annotation method, and are applied to the first compaction rule set respectively. The first, second, and third compaction rule sets are used to perform a replay assignment. The replay assignment locks the first joint reservation order in the queue based on the unified reservation sequence position pointer. The candidate opportunity set is read based on the matching index. The occupancy verification condition evaluation result is read based on the opportunity list and false value opportunities are filtered out. Then, mutual exclusion verification is performed on the borrowing record set based on the mutual exclusion state mapping table. The execution result of the replay assignment is based on the execution receipt status and status write-back record. The label selection follows the lexicographical decision criterion: mutual exclusion conflicts are considered invalid assignments and are excluded first; abandoned records are considered strong negative events and are excluded first; successful execution receipt status is retained first; and increased waiting time is considered a secondary negative event used to distinguish the remaining candidates. Finally, the name of the optimal rule set is written into the training label field and corresponds one-to-one with feature one and feature two.

[0111] In one embodiment, feature preprocessing employs monotonic transformation and boundary pruning to maintain interpretability and avoid variance-type statistics: For opportunity abandonment frequency and head-of-the-queue product stress, upper bound pruning is first performed. The upper bound is taken from the feature boundary parameter set of the configuration data area and is independent of the same resource identifier. Then, logarithmic compression is performed. Before compression, a minimum positive offset is added to zero values ​​to avoid incomputability. The minimum positive offset is taken as the reciprocal of the minimum time resolution of the unified clock source and stored in the configuration data area. Data partitioning uses time-ordered segmentation. The training set takes samples of earlier triggered events, and the validation set takes samples of later triggered events. The segment boundaries are taken as timestamps of the unified clock source and stored in the configuration data area, ensuring that the same triggered event falls into only one data segment. Model parameter settings use candidate set search and are selected by the validation set. The candidate set includes the number of trees, maximum depth, and minimum sample size of leaf nodes. The size of the feature subset during splitting is limited to either single or double feature values ​​to match the input dimension. During training, multiple trees are constructed using bootstrap sampling, and candidate split points are randomly selected at each split node. For class imbalance, downsampling is used while maintaining consistent distribution of the same resource identifiers. During the inference phase, three sets of rule scores are output. The score vectors are converted into allocation compaction coefficients through a pre-set mapping table. The first set of compaction rules is mapped to the interval near the zero end of the closed interval, the second set of compaction rules is mapped to the middle interval of the closed interval, and the third set of compaction rules is mapped to the interval near one end of the closed interval. When the allocation compaction coefficient falls outside the closed interval, interval pruning is performed and the allocation compaction coefficient is written. The model file, feature boundary parameter set, and mapping table version number are written together into the configuration data area, and the version number is recorded back with the status for review and traceability.

[0112] The compaction rule set is pre-set into three mutually exclusive rule sets: a first compaction rule set, a second compaction rule set, and a third compaction rule set. The mapping boundary parameters are taken from the compaction boundary parameter set, which is stored in the configuration data area and maintained by the library. The compaction boundary parameter set satisfies that the first boundary parameter is less than the second boundary parameter. When the allocated compaction coefficient falls before the first boundary parameter, the first compaction rule set is selected; when the allocated compaction coefficient falls between the first and second boundary parameters, the second compaction rule set is selected; and when the allocated compaction coefficient falls after the second boundary parameter, the third compaction rule set is selected.

[0113] The first set of tightening rules indicates that the risk of allocation and redemption is prominent. Allocation actions should prioritize suppressing repeated abandonment to avoid repeated fluctuations at the head of the queue caused by releasing after allocation. The corresponding candidate joint reservation order set is limited as follows: joint reservation orders within the head of the queue must meet the following conditions: the morphological preference and the morphological markers in the candidate opportunity set must be strictly consistent; the candidate opportunity set must have at least one allocable opportunity identifier whose corresponding occupancy verification condition evaluates to true; and joint reservation order identifiers are entered into the candidate joint reservation order set in ascending order according to the unified reservation sequence position pointer.

[0114] The second set of tightening rules indicates that the risk of allocation and fulfillment coexist with the pressure of waiting at the front of the queue. Screening needs to strike a balance between form preference and opportunity supply to reduce stagnation at the front of the queue due to excessive form constraints. The corresponding candidate joint reservation set is limited to: joint reservations within the front of the queue satisfying the form preference of any form, or the candidate opportunity set simultaneously containing both paper and electronic forms, and at least one allocable opportunity identifier corresponding to an occupancy verification condition that evaluates to true. Joint reservation identifiers are entered into the candidate joint reservation set in ascending order of their unified reservation sequence position pointers.

[0115] The third set of tightening rules corresponds to the following prompt: The pressure at the front of the queue is prominent; therefore, the allocation of actions should prioritize restoring the pace of progress to reduce the experience disruption caused by prolonged stagnation at the front of the queue. The corresponding candidate joint reservation set is limited to: joint reservations within the front of the queue segment that satisfy the requirement that at least one allocable opportunity identifier in the candidate opportunity set has a true value corresponding to the occupancy verification condition; morphological preferences are not used as candidate selection criteria; and joint reservation identifiers are entered into the candidate joint reservation set in ascending order of their unified reservation sequence position pointers.

[0116] The constraints of the candidate joint reservation set are given by the selected set of compaction rules. Field references remain consistent, and the constraints only use: morphological preference, candidate opportunity set, occupancy check condition evaluation result, and unified reservation sequence position pointer. When the candidate joint reservation set is output, it is sorted in ascending order according to the unified reservation sequence position pointer.

[0117] Example: When the frequency of opportunity abandonment is high and the pressure of the first-in-line product is low, the machine learning model outputs the allocation compaction coefficient, which falls into the second compaction rule set interval. The candidate joint reservation set is limited to joint reservations with any form preference and the candidate opportunity set includes joint reservations in both paper and electronic forms. The joint reservations with the unified reservation sequence position pointer at the front enter the candidate joint reservation set first.

[0118] The S405 can perform joint reservation order confirmation, allocation instruction generation, and status write-back record writing.

[0119] The candidate joint reservation set only completes the screening. The final assignment needs to meet both the occupancy verification condition and the mutual exclusion constraint of the same resource. The assignment result is written into the status write-back record for query and display on the paper circulation side and the electronic authorization side.

[0120] Select joint reservation order identifiers from the candidate joint reservation order set in ascending order of the unified reservation sequence position pointer. Read the corresponding candidate opportunity set from the matching index and traverse it in ascending order of the lexicographical order of the allocable opportunity identifiers. For each allocable opportunity identifier, read the occupancy verification condition in the opportunity list and evaluate it. If the evaluation result is true, proceed to mutual exclusion verification. Mutual exclusion verification is performed according to the following judgment rules: search for reader identifiers and the same type of resource identifiers in the borrowing record set. If the borrowing status matches the mutual exclusion status mapping table, determine mutual exclusion conflict. If mutual exclusion conflict is established, skip the current joint reservation order identifier and proceed to the next joint reservation order identifier. If mutual exclusion conflict is not established, lock the joint reservation order identifier and the allocable opportunity identifier as the assignee.

[0121] The system generates allocation instructions, with fixed fields including: joint reservation order identifier, reader identifier, same-resource identifier, allocable opportunity identifier, form marker, version identifier snapshot, and assignment timestamp. When the form marker is a paper book, the allocation instruction is submitted to the paper circulation execution unit; when the form marker is an electronic book, the allocation instruction is submitted to the electronic borrowing execution unit. The system receives execution receipt status and generates status write-back records, with fixed fields including: joint reservation order identifier, same-resource identifier, allocable opportunity identifier, form marker, execution receipt status, write-back timestamp, and version identifier snapshot. The status write-back records are written to the write-back storage area, which provides query interfaces to OPAC and the e-book platform.

[0122] Example: The first record in the candidate joint reservation set has a preference for paper books. The candidate opportunity set contains an allocable opportunity identifier for paper book format. The occupancy verification condition is true. No mutually exclusive state hit record is found in the borrowing record set. The allocation instruction is submitted to the paper circulation execution unit. The execution receipt status returns allocation confirmation. The status write-back record is written to the write-back storage area and includes a snapshot of the paper book format mark and version identifier.

[0123] The system identifies the loading opportunity list, allocable opportunity queue, unified reservation sequence, matching index, and borrowing record set. It extracts the number of abandoned opportunities within the statistical window and accumulates the effective opportunity product time to form the opportunity abandonment frequency. It scans the front segment to form the front queue product time and combines it with the effective opportunity product time to form the front queue product time pressure. The machine learning model outputs the allocation compaction coefficient and maps it to the compaction rule set to limit the candidate joint reservation order set. Finally, it locks the joint reservation order identifier and the allocable opportunity identifier to generate an allocation instruction and writes it into the status write-back record.

[0124] When adding or releasing an allocable opportunity queue, the number of abandonments is extracted based on the execution receipt to form the opportunity abandonment frequency. At the same time, the head-of-queue pressure is formed based on the unified reservation sequence and the matching index. The opportunity abandonment frequency and the head-of-queue pressure are input into the discrimination model or the evidence fusion model to obtain the allocation compaction coefficient. The compaction rule set is selected to limit the candidate joint reservation order set. Then, the mutual exclusion occupancy constraints and occupancy verification conditions of the same resource are verified to generate allocation instructions and form a status write-back record.

[0125] Specifically, the above are merely preferred embodiments of the present invention and are not intended to limit the present invention.

[0126] The parameters preset in the paper can be pre-calibrated through offline simulation testing, or set to fixed values ​​according to the on-site operating procedures.

[0127] In the description of this specification, references to terms such as "an embodiment," "an example," and "a specific example" indicate that a particular feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of the invention. In this specification, illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples.

[0128] The preferred embodiments of the present invention disclosed above are merely illustrative of the invention. These preferred embodiments do not exhaustively describe all details, nor do they limit the invention to any specific implementation. Clearly, many modifications and variations can be made based on the content of this specification. This specification selects and specifically describes these embodiments to better explain the principles and practical applications of the invention, thereby enabling those skilled in the art to better understand and utilize the invention. The invention is limited only by the claims and their full scope and equivalents.

Claims

1. A paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage, characterized in that, Including the following steps: S1: Receive reader identifiers and resource identifiers, read the total amount and usage from paper circulation data and electronic authorization data respectively, and generate availability parameters according to the conventional borrowing calculation rules; S2: Convert the availability parameter into an allocable opportunity queue belonging to the same type of resource identifier, and generate an opportunity list after writing a morphological tag and occupancy verification condition for each allocable opportunity. S3: Generate a joint reservation order based on the opportunity list, which contains only the reader identifier, the same resource identifier and the form preference, and write the joint reservation order into the unified reservation sequence and the matching index corresponding to the allocable opportunity queue. S4: When adding or releasing an allocable opportunity queue, the number of abandonments is obtained based on the execution receipt, and the frequency of opportunity abandonment is calculated in conjunction with the pressure of the head of the queue. The allocation compaction coefficient is output and the set of candidate joint reservations is limited. After determining the head of the queue joint reservation, an allocation instruction is generated and a status write-back record is formed.

2. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 1, characterized in that, Step S1 includes: Read the reader identifier and the same resource identifier, perform non-empty and non-completely blank checks, use the same resource identifier to search the collection of duplicate information set and copy information set, remove duplicates by the unique identifier of the duplicate to obtain the total amount of paper and the amount of paper in use, remove duplicates by the unique identifier of the authorized copy to obtain the total amount of electronic and the amount of electronic in use.

3. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 2, characterized in that, Step S1 includes: The paper usage quantity is determined based on the paper non-distributable state mapping table, and the electronic usage quantity is determined based on the electronic non-distributable state mapping table. The total paper quantity and the paper usage quantity are used to form the paper book borrowable quantity and a non-negative constraint is applied. The total electronic quantity and the electronic usage quantity are used to form the electronic borrowable quantity and a non-negative constraint is applied. The availability parameter is output.

4. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 3, characterized in that, Step S2 includes: Parse the availability parameters to obtain reader identifier, same resource identifier, number of paper books available for borrowing, and number of electronic books available for borrowing. Constrain the number of paper books available for borrowing and the number of electronic books available for borrowing to be non-negative integers. Create an empty queue of allocable opportunities and an opportunity list. Retain the same resource identifier as the queue primary key and ensure that the field name and value are consistent.

5. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 4, characterized in that, Step S2 also includes: Based on the same resource identifier, the set of paper-based distributable copies and the set of electronic-based distributable authorized copies are screened. They are sorted by unique identifier of copy and unique identifier of authorized copy, respectively, and extracted to the paper-based borrowable quantity and the electronic-based borrowable quantity. Distributable opportunity identifiers are generated for the selected identifiers and written with morphological markers, occupancy verification conditions and version identifier snapshots to form an opportunity list and perform stable sorting on the distributable opportunity queue.

6. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 5, characterized in that, Step S3 includes: Upon receiving a reservation request, the system executes a national cryptographic hash algorithm on the reservation intent string to generate a reservation intent key and retrieves the reservation intent key in the unified reservation sequence. If a match is found, the system updates the access timestamp and returns the joint reservation order identifier. If a match is not found, a joint reservation order identifier is generated and the joint reservation order record is written into the unified reservation sequence.

7. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 6, characterized in that, Step S3 also includes: Read the opportunity list, limit the matching range of the form according to the form preference, traverse the opportunity list to filter the allocable opportunity identifiers that meet the form matching range to form a candidate opportunity set, remove duplicates from the candidate opportunity set according to the allocable opportunity identifier and sort it, generate a matching index record with fixed fields of joint reservation order identifier, same resource identifier, candidate opportunity set, unified reservation sequence position pointer and write it to the matching index storage area.

8. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 7, characterized in that, Step S4 includes: When a new event or release event occurs in the allocable opportunity queue, load the opportunity list, unified reservation sequence, matching index, borrowing record set and mutual exclusion state mapping table, determine the statistics window and extract the abandonment count from the execution receipt within the statistics window, accumulate the effective opportunity product based on the queue state change record and form the opportunity abandonment frequency.

9. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 8, characterized in that, Step S4 also includes: Based on the unified reservation sequence position pointer of the matching index, the queue head segment is scanned from the starting position of the unified reservation sequence. The queue head segment records satisfy the following conditions: the candidate opportunity set is not empty, the occupancy verification condition is true, and no successful execution receipt status has appeared. The accumulated waiting time of the queue head segment forms the queue head queue product time and forms the queue head product time pressure.

10. The paper-electronic integrated borrowing collaboration method based on OPAC bidirectional linkage according to claim 9, characterized in that, Step S4 also includes: The frequency of opportunity abandonment and the pressure of the queue head product are input into the machine learning model to obtain the allocation compaction coefficient. The allocation compaction coefficient is mapped to the first compaction rule set, the second compaction rule set, and the third compaction rule set to limit the candidate joint reservation order set. After the candidate joint reservation order set is verified by the mutual exclusion state mapping table and the occupancy verification condition, an allocation instruction is generated and written to the state write-back record.

Images