Methods, systems and terminals for matching and scheduling technological achievements

Abstract

The present invention relates to a method, system, and terminal for matching and scheduling technological achievements. By inputting a set total input quantity, it retrieves the technological needs to be traded and information on technological achievements traded in previous years. Using a trained demand function model, it obtains one or more matching technological achievements. It calculates the text similarity and technological productivity similarity between the technological needs to be traded and their corresponding technological achievements, and calculates the corresponding comprehensive matching similarity. A technological achievement scheduling sequence is constructed, and the matching and scheduling results based on the scheduling sequence are displayed on the user's graphical interface. This invention is operable while ensuring high output and high system operating efficiency. It optimizes the technological achievement transaction queuing and scheduling algorithm, saving queuing and matching time. It can automatically match using a similarity algorithm to prevent human matching errors. Furthermore, during information system development, queuing can be solved using a computable scheduler, making queuing matching management convenient and controllable.

Description

Technical Field

[0001] This invention relates to the field of data processing, and in particular to a method, system, and terminal for matching and scheduling technological achievements. Background Technology

[0002] Technology transaction systems encompass technology demand posting, technology supply, and technology transaction matching. The process from posting to transaction requires significant human resources, involves numerous supply and demand analysis and matching steps, and is often inconvenient to use.

[0003] Existing technical trading systems lack intelligent matching capabilities, and the usability requirements of these systems ensure a high matching rate and a high transaction completion rate.

[0004] For example, publication number CN 110059979 A provides an analysis method for the success rate of urban resource endowment and scientific and technological achievement transformation, including the following steps: (1) element deconstruction of urban resource endowment; (2) analysis of influencing factors of scientific and technological achievements to be transformed; (3) calculation of the matching degree between urban resource endowment and scientific and technological achievements to be transformed, and obtaining the transformation success rate. This invention is based on big data technology, fully considers various factors of scientific and technological achievement transformation, and effectively utilizes the advantages of Internet data resources to visualize the feasibility of urban resource endowment and scientific and technological achievement transformation. Users can optimize relevant influencing factors according to the analysis results to ensure the improvement of the success rate of urban resource endowment and scientific and technological achievement transformation. The method of this invention first digitizes urban resource endowment, then quantifies the scientific and technological achievements to be transformed, then calculates the matching degree between urban resource endowment and scientific and technological achievements to be transformed, and finally obtains the transformation success rate based on the correlation between the matching degree and the success rate. The disadvantages or deficiencies of the above invention are as follows: the above calculation method analyzes on a city-by-city basis, and the granularity cannot be refined to a single scientific and technological achievement. This current approach cannot cover both the supply and demand sides of the full-factor market, nor does it fully utilize historical technology transaction prices. Therefore, the resulting matching degree and success rate cannot guide the automatic matching of technology achievement scheduling and technology transactions in terms of price and full-factor factors. This demonstrates that there are difficulties in matching the supply of achievements with the demand for transactions, with most of these difficulties stemming from the inability to price and thus prevent predictive adjustments. Because matching requires a high level of experience, service organizations or enterprises generally find it difficult to comprehensively consider the success of transaction matching; there is also a lack of research on the coordinated matching of various factor resources. Furthermore, research on factor-based approaches often fails to yield effective matching results, which in turn prevents the technology achievement scheduling from achieving its expected goals, contributing insufficiently to improving the accuracy of technology transaction matching, and even causing negative biases. The essence of these results lies in the fact that technology achievement holders cannot make accurate predictive judgments about the value of technology, making it impossible for enterprises to effectively match technology achievements with other enterprises. Under full-factor conditions, transaction demand cannot be met, and such transactions will disappear. Therefore, technology transaction matching for technology achievement scheduling remains an ongoing issue.

[0005] Announcement No. CN 211090322 U describes a server installation device for matching results. This device employs a pulley mechanism, lifting plate, rollers, cables, and a motor, eliminating the need for manual labor. The motor lifts the server, preventing accidents that could occur during manual handling. The telescopic support block design reinforces the installation, preventing tipping and damage, and ensuring cost-effectiveness. However, this method currently cannot cover graphics or fully utilize the user interface. Therefore, the obtained matching degree and success rate cannot be displayed in the scheduling process or the automatic matching results of technology transactions. There is no computer system capable of forming an interactive computational model, nor can it process technology transaction queuing information using scheduling algorithms and achieve automatic matching and transactions through similarity matching algorithms. Summary of the Invention

[0006] In view of the shortcomings of the prior art described above, the purpose of this invention is to provide a method for matching and scheduling technical achievements to solve the above-mentioned technical problems in the prior art.

[0007] To achieve the above and other related objectives, this invention provides a method for matching and scheduling technological achievements. The method includes: inputting a set total factor input quantity; wherein the total factor input quantity includes: input quantities corresponding to multiple input indicators; the types of input indicators include: land, technology, data, capital, and labor indicators; retrieving, based on the total factor input quantity, the technological needs to be traded and information on technological achievements traded in previous years; wherein the information on technological achievements traded in previous years includes: multiple traded technological needs and one or more corresponding traded technological achievements; training a demand function model using the information on technological achievements traded in previous years; based on the demand function model, obtaining one or more technological achievements that match the technological needs to be traded; calculating the text similarity and technological productivity similarity between the technological needs to be traded and their corresponding technological achievements, and calculating the corresponding comprehensive matching similarity; constructing a technological achievement scheduling sequence based on the comprehensive matching similarity between the technological needs to be traded and their corresponding technological achievements; and displaying the matching and scheduling results formed based on the technological achievement scheduling sequence on a user graphical interface.

[0008] In one embodiment of the present invention, the step of training the demand function model using the information on the traded technological achievements over the years includes: using the demand for each traded technology and the corresponding traded technological achievements, and using the multiple regression least squares fitting estimation method to train an empirical regression model to construct the demand function model.

[0009] In one embodiment of the present invention, the step of calculating the text similarity and technological productivity similarity between the technology requirements to be traded and their corresponding technological achievements, and calculating the corresponding comprehensive matching similarity, includes: calculating the text similarity between the technology requirements to be traded and each technological achievement based on the cosine similarity calculation method; calculating the technological productivity similarity between the technology requirements to be traded and each technological achievement based on the technological productivity calculated from the set total factor input and the technological productivity calculated for each technological achievement; and obtaining the comprehensive matching similarity between the technology requirements to be traded and each technological achievement based on the text similarity and technological productivity similarity between the technology requirements to be traded and each technological achievement.

[0010] In one embodiment of the present invention, the average of the text similarity and technological productivity similarity between the technology requirements to be traded and each technological achievement is calculated to obtain the comprehensive matching similarity between the technology requirements to be traded and each technological achievement.

[0011] In one embodiment of the present invention, the construction of a technology achievement scheduling sequence based on the comprehensive matching similarity between the technology requirement to be traded and its corresponding technological achievements includes: if the comprehensive matching similarity between the technology requirement to be traded and the technological achievement is 0, it is determined to be a complete mismatch, and the technological achievement is set as an achievement that does not need to be scheduled; if the comprehensive matching similarity between the technology requirement to be traded and the technological achievement is within a first threshold range, it is determined to be an incomplete match, and the technological achievement is added to a selectable matching scheduling sequence using a last-in-first-out (LIFO) algorithm; wherein, any value within the first threshold range is greater than 0; if the comprehensive matching similarity between the technology requirement to be traded and the technological achievement is within a second threshold range, it is determined to be a partial similarity match, and the technological achievement is added to a general matching scheduling sequence using a first-in-first-out (FIFO) algorithm. Wherein, any value within the second threshold range is greater than any value within the first threshold range; if the comprehensive matching similarity between the technology requirement to be traded and the technology achievement is within the third threshold range, it is determined to be a partial complete match, and the technology achievement is added to the priority matching scheduling sequence using the last-in-first-out algorithm; wherein, any value within the third threshold range is greater than any value within the second threshold range and less than 100; if the comprehensive matching similarity between the technology requirement to be traded and the technology achievement is 100, it is determined to be a complete match, and the technology achievement is added to the fully automatic matching scheduling sequence using the direct insertion algorithm; based on the constructed selectable matching scheduling sequence, general matching scheduling sequence, priority matching scheduling sequence, and fully automatic matching scheduling sequence and the comprehensive matching similarity of each technology achievement, the technology achievement scheduling sequence is constructed.

[0012] In one embodiment of the present invention, the construction of the scientific and technological achievement scheduling sequence based on the constructed optional matching scheduling sequence, general matching scheduling sequence, priority matching scheduling sequence, and fully automatic matching scheduling sequence and the comprehensive matching similarity of each scientific and technological achievement includes: based on the sequence arrangement rules, according to the optional matching scheduling sequence, general matching scheduling sequence, priority matching scheduling sequence, fully automatic matching scheduling sequence, and the scientific and technological achievement scheduling sequence obtained by arranging each scientific and technological achievement without scheduling results.

[0013] In one embodiment of the present invention, the sequence arrangement rule includes: arranging the corresponding technical achievements in the order of fully automatic matching scheduling sequence, priority matching scheduling sequence, general matching scheduling sequence, and optional matching scheduling sequence, and without requiring the scheduling achievement to be placed last.

[0014] In one embodiment of the present invention, the matching scheduling result includes: a scientific and technological achievement scheduling sequence and the comprehensive matching similarity corresponding to each scientific and technological achievement in the scientific and technological achievement scheduling sequence.

[0015] To achieve the above and other related objectives, this invention provides a technology achievement matching and scheduling system. The system includes: an input quantity setting module for inputting a set total factor input quantity; wherein the total factor input quantity includes: input quantities corresponding to multiple input indicators; the types of input indicators include: land, technology, data, capital, and labor indicators; a retrieval information module connected to the input quantity setting module for retrieving, based on the total factor input quantity, the technology demand to be traded and information on previously traded technology achievements; wherein the previously traded information includes: multiple traded technology demands and one or more corresponding traded technology achievements; and a model training module connected to the retrieval information module for training to obtain demand using the previously traded technology achievement information. The system comprises: a function model; an outcome matching module, connected to the model training module, used to obtain one or more technological outcomes matching the technological requirements to be traded based on the demand function model; a matching similarity calculation module, connected to the outcome matching module, used to calculate the text similarity and technological productivity similarity between the technological requirements to be traded and their corresponding technological outcomes, and to calculate the corresponding comprehensive matching similarity; a scheduling sequence construction module, connected to the matching similarity calculation module, used to construct a technology outcome scheduling sequence based on the comprehensive matching similarity between the technological requirements to be traded and their corresponding technological outcomes; and a matching scheduling result display module, connected to the scheduling sequence construction module, used to display the matching scheduling results formed based on the technology outcome scheduling sequence on the user's graphical interface.

[0016] To achieve the above and other related objectives, the present invention provides a technology achievement matching and scheduling terminal, comprising: a memory for storing computer programs; and a processor for executing the technology achievement matching and scheduling method.

[0017] As described above, the present invention provides a method, system, and terminal for matching and scheduling technological achievements, which has the following beneficial effects: The present invention, by inputting a set total input quantity, retrieves the technological requirements to be traded and information on technological achievements traded in previous years, and uses training to obtain a demand function model to obtain one or more matching technological achievements. It then calculates the text similarity and technological productivity similarity between the technological requirements to be traded and their corresponding technological achievements, and calculates the corresponding comprehensive matching similarity. A technological achievement scheduling sequence is constructed, and the matching and scheduling results based on the technological achievement scheduling sequence are displayed on the user's graphical interface. The present invention is operable, and the system's usability requirements ensure high output and high system operating efficiency. It optimizes the technological achievement transaction queuing and scheduling algorithm, saving queuing and matching time, and can automatically match using a similarity algorithm to prevent human matching errors. Furthermore, during information system development, queuing can be solved using a computable scheduler, making queuing matching management convenient and controllable. Attached Figure Description

[0018] Figure 1 The diagram shown is a flowchart illustrating a method for matching and scheduling technical achievements according to an embodiment of the present invention.

[0019] Figure 2 The diagram shown is a schematic diagram of the construction logic of the demand function model in one embodiment of the present invention.

[0020] Figure 3 The diagram shown is a schematic diagram of technical productivity calculation in one embodiment of the present invention.

[0021] Figure 4 The diagram shown is a schematic diagram of the construction of a scientific and technological achievement scheduling sequence in one embodiment of the present invention.

[0022] Figure 5 The diagram shown is a flowchart illustrating a method for matching and scheduling technical achievements according to an embodiment of the present invention.

[0023] Figure 6 The diagram shown is a structural schematic of a technology achievement matching and scheduling system according to an embodiment of the present invention.

[0024] Figure 7 The diagram shown is a structural schematic of a technology achievement matching and scheduling terminal according to an embodiment of the present invention. Detailed Implementation

[0025] The following specific examples illustrate the implementation of the present invention. Those skilled in the art can easily understand other advantages and effects of the present invention from the content disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that, unless otherwise specified, the following embodiments and features described therein can be combined with each other.

[0026] It should be noted that in the following description, reference is made to the accompanying drawings, which illustrate several embodiments of the invention. It should be understood that other embodiments may also be used, and changes in mechanical composition, structure, electrical system, and operation may be made without departing from the spirit and scope of the invention. The following detailed description should not be considered limiting, and the scope of the embodiments of the invention is defined only by the claims of the published patents. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the invention. Spatially related terms, such as “upper,” “lower,” “left,” “right,” “below,” “below,” “lower part,” “above,” “upper part,” etc., may be used herein to illustrate the relationship between one element or feature shown in the figures and another element or feature.

[0027] Throughout this specification, when it is said that a part is "connected" to another part, this includes not only "direct connection" but also "indirect connection" by placing other elements in between. Furthermore, when it is said that a part "includes" a certain constituent element, unless otherwise stated otherwise, this does not exclude other constituent elements, but rather means that other constituent elements may also be included.

[0028] The terms "first," "second," and "third," etc., used herein are for the purpose of describing various parts, components, regions, layers, and / or segments, but are not limiting. These terms are used only to distinguish one part, component, region, layer, or segment from others. Therefore, the "first part," "component," "region," "layer," or "segment" described below may refer to a "second part," "component," "region," "layer," or "segment" without departing from the scope of this invention.

[0029] Furthermore, as used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless the context indicates otherwise. It should be further understood that the terms “comprising,” “including,” indicate the presence of the stated feature, operation, element, component, item, kind, and / or group, but do not preclude the presence, occurrence, or addition of one or more other features, operations, elements, components, items, kinds, and / or groups. The terms “or” and “and / or” as used herein are interpreted as inclusive, or mean any one or any combination thereof. Thus, “A, B, or C” or “A, B, and / or C” means “any one of: A; B; C; A and B; A and C; B and C; A, B, and C.” Exceptions to this definition arise only when combinations of elements, functions, or operations are inherently mutually exclusive in some manner.

[0030] This invention provides a method for matching and scheduling technological achievements. By inputting a set total input quantity, it retrieves the technological needs to be traded and information on technological achievements traded in previous years. Using a trained demand function model, it obtains one or more matching technological achievements. It calculates the text similarity and technological productivity similarity between the technological needs to be traded and their corresponding technological achievements, and calculates the corresponding comprehensive matching similarity. A technological achievement scheduling sequence is constructed, and the matching and scheduling results based on the scheduling sequence are displayed on the user's graphical interface. This invention is operable, and the system's usability requires high output and high system operating efficiency. It optimizes the technological achievement transaction queuing and scheduling algorithm, saving queuing and matching time. It can automatically match using a similarity algorithm to prevent human matching errors, and the queuing process in information system development can be solved by a computable scheduler, making queuing matching management convenient and controllable.

[0031] The present invention will now be described in detail with reference to the accompanying drawings, so that those skilled in the art can readily implement it. The present invention can be embodied in many different forms and is not limited to the embodiments described herein.

[0032] like Figure 1 The diagram shown illustrates the flowchart of the technical achievement matching and scheduling method in an embodiment of the present invention.

[0033] The process includes:

[0034] Step S11: Input the set total input amount for all elements.

[0035] The proposed total factor input includes: the proposed input corresponding to multiple proposed input indicators; the types of proposed input indicators include: land, technology, data, capital and labor indicators;

[0036] The proposed investment includes the total amount of land, capital, labor, technology, and data.

[0037] Step S12: Based on the proposed input of all elements, retrieve the technology requirements to be traded and information on technology achievements traded in previous years.

[0038] The transaction information over the years includes: multiple transactional technology requirements and one or more corresponding transactional technology achievements.

[0039] In one embodiment, a data search is performed in a historical database based on the proposed total input of all factors, and information on traded scientific and technological achievements and pending technology requirements are obtained through big data technology.

[0040] Step S13: Use the information on the technological achievements traded over the years to train and obtain the demand function model.

[0041] In one embodiment, training the demand function model using the information on technological achievements traded over the years includes:

[0042] like Figure 2 As shown, by utilizing the various traded technology requirements and their respective matched traded technology achievements, an empirical regression model is trained using the multiple regression least squares fitting estimation method to construct the demand function model of the matched technology requirements on the traded technology achievements.

[0043] Step S14: Based on the demand function model, obtain one or more technological achievements that match the technology requirements to be traded.

[0044] Specifically, the technical requirements to be traded are input into the demand function model to obtain one or more matching technical achievements.

[0045] Step S15: Calculate the text similarity and technological productivity similarity between the technology requirements to be traded and their corresponding technological achievements, and calculate the corresponding comprehensive matching similarity.

[0046] In one embodiment, the step of calculating the text similarity and technological productivity similarity between the technology requirements to be traded and their corresponding technological achievements, and calculating the corresponding comprehensive matching similarity, includes:

[0047] Based on the cosine similarity calculation method, the text similarity between the technical requirements to be traded and each technical achievement is calculated.

[0048] The similarity of technological productivity between the technology demand to be traded and the technological productivity of each technological achievement is calculated based on the technological productivity obtained from the set total factor inputs and the technological productivity calculated for each technological achievement; specifically, such as Figure 3As shown, the methods for calculating technological productivity include: Technological Productivity = Technology Input / (Land Input + Capital Input + Labor Input + Technology Input + Data Input);

[0049] The comprehensive matching similarity between the technology requirements to be traded and each technological achievement is obtained based on the textual similarity and technological productivity similarity between them.

[0050] In one embodiment, the average of the text similarity and technological productivity similarity between the technology requirements to be traded and each technological achievement is calculated to obtain the comprehensive matching similarity between the technology requirements to be traded and each technological achievement.

[0051] Step S16: Construct a technology achievement scheduling sequence based on the comprehensive matching similarity between the technology requirements to be traded and their corresponding technological achievements.

[0052] In one embodiment, constructing a technology achievement scheduling sequence based on the comprehensive matching similarity between the technology requirements to be traded and their corresponding technological achievements includes:

[0053] If the overall matching similarity between the technology requirements and the technology achievement to be traded is 0, it is determined to be a complete mismatch, and the technology achievement is set as an achievement that does not need to be scheduled.

[0054] If the overall similarity between the technology requirement and the technology achievement to be traded is within the first threshold range, it is determined to be an incomplete match, and the technology achievement is added to the optional matching scheduling sequence using the first-in-last-out algorithm; wherein, any value within the first threshold range is greater than 0;

[0055] If the overall similarity between the technology requirement and the technology achievement to be traded is within the second threshold range, it is determined to be a partial similarity match, and the technology achievement is added to the general matching scheduling sequence using the first-in-first-out algorithm; wherein, any value within the second threshold range is greater than the value within the first threshold range;

[0056] If the overall similarity between the technology requirement and the technology achievement to be traded is within the third threshold range, it is determined to be a partial complete match, and the technology achievement is added to the priority matching scheduling sequence using the last-in-first-out algorithm; wherein, any value within the third threshold range is greater than the value within the second threshold range and less than 100;

[0057] If the overall similarity between the technology requirement and the technology achievement to be traded is 100, it is determined to be a perfect match, and the technology achievement is added to the fully automatic matching scheduling sequence using the direct insertion algorithm.

[0058] Based on the constructed optional matching scheduling sequence, general matching scheduling sequence, priority matching scheduling sequence, and fully automatic matching scheduling sequence, and the comprehensive matching similarity of each scientific and technological achievement, the scientific and technological achievement scheduling sequence is constructed.

[0059] In one embodiment, such as Figure 4 As shown, if the overall similarity between the technology requirement and the technology achievement to be traded is 0, then there is no match at all, and the technology achievement is determined to be unnecessary to schedule, with a matching degree of 0. If the overall similarity between the two is between 0 and 50, then there is an incomplete match, and the technology achievement is determined to be eligible for a matching scheduling sequence, or can be manually selected to enter the matching program, with the matching degree being the average of the two similarity values. If the overall similarity between the two is between 50 and 80, then there is a partial similarity match, and the technology achievement is determined to automatically enter the general matching scheduling sequence, with the matching degree being the average of the two similarity values. If the overall similarity between the two is between 80 and 100, then there is a partial complete match, and the technology achievement is determined to automatically enter the priority matching scheduling sequence, with the matching degree being the average of the two similarity values. If the similarity between the two is 100, then there is a complete match, and the technology achievement is determined to automatically enter the fully automatic matching scheduling sequence, with the matching degree being the average of the two similarity values.

[0060] In one embodiment, constructing the scientific and technological achievement scheduling sequence based on the comprehensive matching similarity of the constructed selectable matching scheduling sequence, general matching scheduling sequence, priority matching scheduling sequence, and fully automatic matching scheduling sequence with each scientific and technological achievement includes:

[0061] Based on sequence arrangement rules, the scientific and technological achievement scheduling sequence is generated from the arrangement of various technical achievements according to selectable matching scheduling sequences, general matching scheduling sequences, priority matching scheduling sequences, fully automatic matching scheduling sequences, and no scheduling results required.

[0062] In one embodiment, the corresponding technical achievements are arranged in the order of fully automatic matching scheduling sequence, priority matching scheduling sequence, general matching scheduling sequence, and optional matching scheduling sequence, and no scheduling achievement needs to be placed last.

[0063] For example, the fully automatic matching scheduling sequence arranges the corresponding technical achievements according to the order of its own scheduling technical achievements, then the priority matching scheduling sequence arranges the corresponding technical achievements according to the order of its own scheduling technical achievements and places them after the technical achievements of the fully automatic matching scheduling sequence, then the general matching scheduling sequence arranges the corresponding technical achievements according to the order of its own scheduling technical achievements and places them after the technical achievements of the priority matching scheduling sequence, then the optional matching scheduling sequence arranges the corresponding technical achievements according to the order of its own scheduling technical achievements and places them after the technical achievements of the general matching scheduling sequence, and finally, the achievements that do not require scheduling.

[0064] Step S17: Display the matching scheduling results based on the scheduling sequence of the scientific and technological achievements in the user graphical interface.

[0065] In one embodiment, the matching and scheduling result includes: a scientific and technological achievement scheduling sequence and the comprehensive matching similarity corresponding to each scientific and technological achievement appearing in the sequence in sequence.

[0066] In one embodiment, the user graphical interface is interactive and features a graphical user interface display. After the above calculations are completed, the user graphical interface function is invoked to enter the automatic matching interface for technology achievement scheduling and technology transactions. In the graphical interface, the matching of technical requirements and technical achievements is completed, and the schedulable content is displayed synchronously. For matching results that cannot form a complete match, a partially complete match, or a partially similar match, manual scheduling of the technology achievements is required, such as incomplete matching. The technology achievements are then embedded into the matching program for pairing. For completely mismatched technical requirements and technical achievements, a completely mismatch result is displayed, and the matching process ends.

[0067] The graphical user interface (GUI) for transaction information enables the input and recognition of transaction outcome information and the exchange of transaction data. The GUI for technology transaction information enables the input and recognition of technology transaction outcome information and the exchange of technology transaction information. A scheduler facilitates the output recognition of technology transaction outcome information and the matching of technology transactions. The GUI for matching information enables the input recognition of matching information and the exchange of matching information with a scheduler. Through the scheduler's queue management, the output recognition of matching information and the automatic matching process are achieved.

[0068] In one embodiment, the user operates and manages the matching results through a graphical interface, and expands the management, supervision, and prediction functions.

[0069] Specifically, matching result management includes managing different types of scientific and technological achievements, such as incomplete matching, complete matching, partially complete matching, and partially similar matching. Matching supervision involves monitoring the matching efficiency and success rate of technology transactions through matching similarity. Transaction prediction utilizes matching sequences to analyze tradable technological achievements and their corresponding technological needs.

[0070] To better describe the method for matching and scheduling technological achievements, the following specific embodiments are provided for illustration;

[0071] Example 1: A method for matching and scheduling technological achievements; Figure 5 This is a flowchart illustrating the process in this embodiment.

[0072] The method includes:

[0073] First, based on the proposed investment in the enterprise's technology needs, the total factor input amount is set, and the proposed input indicators include five factors: land, technology, data, capital, and labor. Data search is conducted on the technology needs to be traded, and information on technology achievements that have been traded in previous years and those to be traded is obtained through big data technology.

[0074] Secondly, further information is obtained through queries, including land, technology, data, capital, and labor related to the scientific and technological achievements found, and the productivity of the technological factors of the scientific and technological achievements to be matched for transaction is calculated.

[0075] Next, we analyze the traded technological achievements and matched technological demands over the years, and use multiple regression least squares fitting estimation to generate an empirical regression model of matched technological demands on the traded technological achievements, which is the demand function model we want to estimate.

[0076] Then, based on the proportion of the total current technology demand input, the productivity of technology factors is calculated, and the productivity of technology (scientific and technological achievements) factors that may be traded is calculated using the demand function model obtained above.

[0077] Finally, cosine similarity is used to compare the text similarity of the scientific and technological achievement with that of the technological requirement, as well as their technological productivity similarity. The average of these two similarity values ​​is then calculated. If the similarity is 0, there is no match, and the scientific and technological achievement is determined to require no scheduling, with a matching degree of 0. If the similarity is between 0 and 50, there is an incomplete match, and the scientific and technological achievement can be selected for a matching scheduling sequence or manually selected to enter the matching program, with a matching degree of the average of the two similarity values. If the similarity is between 50 and 80, there is a partial similarity match, and the scientific and technological achievement is determined to automatically enter the general matching scheduling sequence, with a matching degree of the average of the two similarity values. If the similarity is between 80 and 100, there is a partial complete match, and the scientific and technological achievement is determined to automatically enter the priority matching scheduling sequence, with a matching degree of the average of the two similarity values. If the similarity is 100, there is a complete match, and the scientific and technological achievement is determined to automatically enter the fully automatic matching scheduling sequence, with a matching degree of the average of the two similarity values.

[0078] After the above calculations are completed, the user graphical interface is invoked to enter the automatic matching interface for technology achievement scheduling and technology transactions. In the graphical interface, the matching of technology requirements and technology achievements is completed, and the schedulable content is displayed simultaneously. For matching results that cannot form a complete match, a partially complete match, or a partially similar match, manual scheduling of the technology achievements is required via the user graphical interface. The technology achievements are then inserted into the matching program for pairing. For completely mismatched technology requirements and technology achievements, a completely mismatch result is displayed, and the matching process ends.

[0079] This embodiment determines the scientific and technological achievements and technology demand information based on the information of completed technology transactions. It uses a regression model to fit and generate the optimal demand function model, and then inputs the technology demand to be matched into it to calculate the information of the scientific and technological achievements to be traded. Then, it uses the cosine similarity algorithm to construct a similarity matrix, and puts the results into the technology achievement scheduling sequence according to different levels. The queue information is processed by the scheduler to obtain the corresponding output queue information. The output information is then transmitted to the matching scheduling management module. At the same time, automatic matching is performed and the graph is updated and displayed to the user interface for operation recognition and confirmation. Finally, it displays that the technology transaction matching is successful.

[0080] The automatic matching process is convenient and easy to operate, increases the number of schedulable results, increases the matching result degree, and improves the efficiency of automated matching. The overall matching process is achieved by constructing a computational model and establishing a computer system based on the computational model of schedulable queuing management of technological results and matching of technological transactions. Different scheduling algorithms (first-in-first-out, last-in-first-out, and last-see-first-out) are used to process the scheduling information of technological results, and the cosine similarity matching algorithm is used to realize the automated matching of technological transactions.

[0081] Similar to the principles of the above embodiments, the present invention provides a technology achievement matching and scheduling system.

[0082] The following specific embodiments are provided in conjunction with the accompanying drawings:

[0083] like Figure 6 A schematic diagram of the structure of a technology achievement matching and scheduling system according to an embodiment of the present invention is shown.

[0084] The system includes:

[0085] The input setting module 61 is used to input the set total factor input; wherein, the total factor input includes: the input corresponding to multiple input indicators; the types of the input indicators include: land, technology, data, capital and labor indicators;

[0086] The information retrieval module 62 is connected to the input setting module 61 and is used to retrieve the technology requirements to be traded and the information on the technology achievements traded in previous years based on the proposed input of all elements; wherein, the information on the technology achievements traded in previous years includes: multiple technology requirements that have been traded and one or more technology achievements that have been traded in each of them.

[0087] Model training module 63, connected to the retrieval information module 62, is used to train and obtain a demand function model using the information on traded technological achievements over the years;

[0088] The result matching module 64 is connected to the model training module 63 and is used to obtain one or more technical results that match the technical requirements to be traded based on the demand function model.

[0089] The matching similarity calculation module 65 is connected to the result matching module 64 and is used to calculate the text similarity and technical productivity similarity between the technical requirements to be traded and their corresponding technical results, and to calculate the corresponding comprehensive matching similarity.

[0090] The scheduling sequence construction module 66 is connected to the matching similarity calculation module 65 and is used to construct a scientific and technological achievement scheduling sequence based on the comprehensive matching similarity between the technical requirements to be traded and their corresponding technical achievements.

[0091] The matching scheduling result display module 67 is connected to the scheduling sequence construction module 66 and is used to display the matching scheduling result formed based on the scientific and technological achievement scheduling sequence on the user's graphical interface.

[0092] It should be noted that, as should be understood Figure 6 The division of modules in the system embodiment is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, these units can be implemented entirely in software through processing element calls; they can be implemented entirely in hardware; or some units can be implemented by processing element calls to software, while others are implemented in hardware.

[0093] Since the implementation principle of the matching and scheduling system for this technological achievement has been described in the foregoing embodiments, it will not be repeated here.

[0094] like Figure 7 A schematic diagram of the structure of the technical achievement matching and scheduling terminal 70 in an embodiment of the present invention is shown.

[0095] The technology achievement matching and scheduling terminal 70 includes: a memory 71 and a processor 72. The memory 71 is used to store computer programs; the processor 72 runs the computer programs to implement, for example, Figure 1 The method for matching and scheduling technological achievements.

[0096] Optionally, the number of memories 71 can be one or more, and the number of processors 72 can be one or more. Figure 7 Each example is taken as an instance.

[0097] Optionally, the processor 72 in the technology achievement matching and scheduling terminal 70 will perform the following according to... Figure 1 The steps described involve loading one or more instructions corresponding to the process of an application into memory 71, and having the processor 72 run the application stored in the first memory 71, thereby achieving the following: Figure 3 The various functions in the technology achievement matching and scheduling method.

[0098] Optionally, the memory 71 may include, but is not limited to, high-speed random access memory and non-volatile memory. For example, one or more disk storage devices, flash memory devices, or other non-volatile solid-state storage devices; the processor 72 may include, but is not limited to, a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0099] Optionally, the processor 72 may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0100] The present invention also provides a computer-readable storage medium storing a computer program, wherein the computer program, when executed, implements as follows: Figure 1 The illustrated method for matching and scheduling technological achievements. The computer-readable storage medium may include, but is not limited to, floppy disks, optical disks, CD-ROMs (Read-Only Optical Disk Memory), magneto-optical disks, ROMs (Read-Only Memory), RAMs (Random Access Memory), EPROMs (Erasable Programmable Read-Only Memory), EEPROMs (Electrically Erasable Programmable Read-Only Memory), magnetic cards or optical cards, flash memory, or other types of media / machine-readable media suitable for storing machine-executable instructions. The computer-readable storage medium may be a product not connected to a computer device or a component used in a computer device.

[0101] In summary, the technology achievement matching and scheduling method, system, and terminal of this invention, by inputting a set total input quantity, retrieves the technology demand to be traded and information on technology achievements traded in previous years, and uses training to obtain a demand function model to obtain one or more matching technology achievements. It then calculates the text similarity and technology productivity similarity between the technology demand to be traded and its corresponding technology achievements, and calculates the corresponding comprehensive matching similarity. A technology achievement scheduling sequence is constructed, and the matching and scheduling results based on the scheduling sequence are displayed on the user's graphical interface. This invention is operable, and the system's usability requirements ensure high output and high system operating efficiency. It optimizes the technology achievement transaction queuing and scheduling algorithm, saving queuing and matching time, and can automatically match using a similarity algorithm to prevent human matching errors. Furthermore, during information system development, queuing can be solved using a computable scheduler, making queuing matching management convenient and controllable. Therefore, this invention effectively overcomes the various shortcomings of the prior art and has high industrial application value.

[0102] The above embodiments are merely illustrative of the principles and effects of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or alter the above embodiments without departing from the spirit and scope of the present invention. Therefore, all equivalent modifications or alterations made by those skilled in the art without departing from the spirit and technical concept disclosed in the present invention should still be covered by the claims of the present invention.

Claims

1. A technology achievement matching and scheduling method, characterized in that, The method comprises: inputting a set of total factor tentative input; wherein the total factor tentative input comprises tentative input corresponding to a plurality of tentative input indexes; the types of the tentative input indexes comprise land, technology, data, capital, and labor indexes; based on the total factor tentative input, retrieving technical demand to be traded and historical traded technical achievement information; wherein the historical traded information comprises a plurality of traded technical demands and one or more traded technical achievements respectively matched thereto; training a demand function model using the historical traded technical achievement information; based on the demand function model, obtaining one or more technical achievements matched to the technical demand to be traded according to the technical demand to be traded; respectively calculating text similarity and technical productivity similarity between the technical demand to be traded and each technical achievement corresponding thereto, and calculating a respective comprehensive matching similarity; based on the comprehensive matching similarity between the technical demand to be traded and each technical achievement corresponding thereto, constructing a scientific and technological achievement scheduling sequence, comprising: if the comprehensive matching similarity between the technical demand to be traded and the technical achievement is 0, determining that the technical demand to be traded and the technical achievement are completely unmatched, and setting the technical achievement as an achievement that does not need to be scheduled; if the comprehensive matching similarity between the technical demand to be traded and the technical achievement is within a first threshold range, determining that the technical demand to be traded and the technical achievement are not completely matched, and adding the technical achievement to a selectable matching scheduling sequence using an advanced-out algorithm; wherein any value within the first threshold range is greater than 0; if the comprehensive matching similarity between the technical demand to be traded and the technical achievement is within a second threshold range, determining that the technical demand to be traded and the technical achievement are partially similar, and adding the technical achievement to a general matching scheduling sequence using a first-in-first-out algorithm; wherein any value within the second threshold range is greater than a value within the first threshold range; if the comprehensive matching similarity between the technical demand to be traded and the technical achievement is within a third threshold range, determining that the technical demand to be traded and the technical achievement are partially completely matched, and adding the technical achievement to a preferential matching scheduling sequence using a last-in-first-out algorithm; wherein any value within the third threshold range is greater than a value within the second threshold range and less than 100; if the comprehensive matching similarity between the technical demand to be traded and the technical achievement is 100, determining that the technical demand to be traded and the technical achievement are completely matched, and adding the technical achievement to an automatic matching scheduling sequence using a direct insertion algorithm; based on the selectable matching scheduling sequence, the general matching scheduling sequence, the preferential matching scheduling sequence, and the automatic matching scheduling sequence constructed and the comprehensive matching similarity of each scientific and technological achievement, constructing the scientific and technological achievement scheduling sequence; displaying a matching scheduling result formed based on the scientific and technological achievement scheduling sequence on a user interface called.

2. The technology outcome matching and scheduling method of claim 1, wherein, The training of the demand function model using the historical traded technical achievement information comprises: using the plurality of traded technical demands and one or more traded technical achievements respectively matched thereto, training an empirical regression model using a multivariate regression least squares fitting estimation method to construct the demand function model.

3. The technology outcome matching and scheduling method of claim 1, wherein, The text similarity and the technical productivity similarity between the technical demand to be traded and each technical achievement are calculated respectively, and a corresponding comprehensive matching similarity is calculated. The text similarity between the technical demand to be traded and each technical achievement is calculated based on a cosine similarity calculation method. The technical productivity similarity between the technical demand to be traded and each technical achievement is calculated based on the technical productivity calculated from the set total factor quasi-input and the technical productivity corresponding to each technical achievement. The comprehensive matching similarity between the technical demand to be traded and each technical achievement is obtained according to the text similarity and the technical productivity similarity between the technical demand to be traded and each technical achievement.

4. The technology outcome matching and scheduling method of claim 3, wherein, The comprehensive matching similarity between the technical demand to be traded and each technical achievement is obtained by averaging the text similarity and the technical productivity similarity between the technical demand to be traded and each technical achievement.

5. The technology outcome matching and scheduling method as claimed in claim 1, wherein, The technology achievement scheduling sequence is constructed based on the constructed selectable matching scheduling sequence, general matching scheduling sequence, priority matching scheduling sequence, full-automatic matching scheduling sequence, and the comprehensive matching similarity of each technology achievement. The technology achievement scheduling sequence is generated by arranging each technology achievement based on the sequence arrangement rule according to the selectable matching scheduling sequence, general matching scheduling sequence, priority matching scheduling sequence, full-automatic matching scheduling sequence, and the technology achievement that does not need to be scheduled.

6. The technology outcome matching and scheduling method of claim 5, wherein, The sequence arrangement rule includes: arranging the corresponding technology achievements in the order of full-automatic matching scheduling sequence, priority matching scheduling sequence, general matching scheduling sequence, and selectable matching scheduling sequence, and arranging the technology achievement that does not need to be scheduled at the last.

7. The technology outcome matching and scheduling method of claim 1, wherein, The matching scheduling result includes: the technology achievement scheduling sequence and the comprehensive matching similarity corresponding to each technology achievement in the technology achievement scheduling sequence.

8. A technology achievement matching and dispatching system, characterized in that, The system includes: An input quantity setting module for inputting a set total factor quasi-input; wherein the total factor quasi-input includes quasi-input quantities corresponding to multiple quasi-input indicators; the types of the quasi-input indicators include land, technology, data, capital, and labor indicators; A search information module connected to the input quantity setting module, for searching and obtaining a technical demand to be traded and historical traded technology achievement information based on the total factor quasi-input; wherein the historical traded information includes multiple traded technical demands and one or more traded technology achievements respectively matched with each corresponding technical demand; A model training module connected to the search information module, for training and obtaining a demand function model using the historical traded technology achievement information; An achievement matching module connected to the model training module, for obtaining one or more technology achievements matched with the technical demand to be traded based on the demand function model and the technical demand to be traded; A matching similarity calculation module connected to the achievement matching module, for calculating the text similarity and the technical productivity similarity between the technical demand to be traded and each corresponding technology achievement, and calculating the corresponding comprehensive matching similarity respectively. The scheduling sequence construction module is connected with the matching similarity calculation module, and is configured to construct a technology achievement scheduling sequence based on the comprehensive matching similarity between the technology demand to be traded and each technology achievement corresponding to the technology demand, including: if the comprehensive matching similarity between the technology demand to be traded and the technology achievement is 0, determining that the technology demand and the technology achievement are completely unmatched, and setting the technology achievement as an achievement that does not need to be scheduled; if the comprehensive matching similarity between the technology demand to be traded and the technology achievement is within a first threshold range, determining that the technology demand and the technology achievement are not completely matched, and adding the technology achievement to a selectable matching scheduling sequence using a last-in first-out algorithm; any value within the first threshold range is greater than 0; if the comprehensive matching similarity between the technology demand to be traded and the technology achievement is within a second threshold range, determining that the technology demand and the technology achievement are partially similar, and adding the technology achievement to a general matching scheduling sequence using a first-in first-out algorithm; any value within the second threshold range is greater than a value within the first threshold range; if the comprehensive matching similarity between the technology demand to be traded and the technology achievement is within a third threshold range, determining that the technology demand and the technology achievement are partially completely matched, and adding the technology achievement to a preferential matching scheduling sequence using a last-in first-out algorithm; any value within the third threshold range is greater than a value within the second threshold range and less than 100; if the comprehensive matching similarity between the technology demand to be traded and the technology achievement is 100, determining that the technology demand and the technology achievement are completely matched, and adding the technology achievement to an automatic matching scheduling sequence using a direct insertion algorithm; and constructing the technology achievement scheduling sequence based on the selectable matching scheduling sequence, the general matching scheduling sequence, the preferential matching scheduling sequence, the automatic matching scheduling sequence, and the comprehensive matching similarity of each technology achievement. The matching scheduling result display module is connected with the scheduling sequence construction module, and is configured to display a matching scheduling result formed based on the technology achievement scheduling sequence on a called user graphical interface.

9. A technology achievement matching and dispatching terminal, characterized in that, The system comprises: a memory configured to store a computer program; a processor configured to execute the technology achievement matching and scheduling method in any one of claims 1 to 7.

Images