CN103336804A - Academic paper efficient allocation method - Google Patents
Academic paper efficient allocation method Download PDFInfo
- Publication number
- CN103336804A CN103336804A CN201310250302XA CN201310250302A CN103336804A CN 103336804 A CN103336804 A CN 103336804A CN 201310250302X A CN201310250302X A CN 201310250302XA CN 201310250302 A CN201310250302 A CN 201310250302A CN 103336804 A CN103336804 A CN 103336804A
- Authority
- CN
- China
- Prior art keywords
- paper
- responsible reader
- reader
- responsible
- entity
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an academic conference paper efficient allocation method, which comprises the following steps that an academic conference paper database is built; data is collected according to the entities and the attributes of the entities in the database; sub matrixes are obtained through the calculation according to the contents of the competitive tender degree of readers on the paper, the reader study directions, the paper direction, the interest conflict of the paper on the readers, the interest conflict of the readers on the paper, the conflict domain of the readers and the like in the database, and meanwhile, the natural restriction conditions that the readers cannot check and approve the self paper need to be added; the hot degree ranking is carried out on articles according to the sub matrixes, in addition, the heuristic algorithm is utilized for carrying out preferential allocation on the unpopular paper, if the condition of the same scores occurs, the consideration on the intention and the work load of the readers with the same scores needs to be added, and then, the selection is carried out; during the sub matrix traversal, the balanced allocation of the work load of each reader needs to be considered; and finally, the allocation results are reflected into the matrixes, and the editing task allocation results are intuitively reflected.
Description
Technical field
The technology of the present invention belongs to artificial intelligence field, is mainly used in sharing out the work of academic meeting paper, and different papers is distributed to only responsible reader, mates by field and paper theme with the responsible reader, realizes the automatic distribution function of paper efficiently.
Background technology
Academic conference is a kind of meeting that is the theme with academic topics such as the development that advances science, academic exchange, subject studies.There is Microsoft CRM in main flow meeting submission system, Easychair, ScholarOne and Openconf now.These conference systems all are to consider how to raise the efficiency when meeting paper is contributed, and distribute the stage that is in manual assignment for how carrying out high efficiency meeting paper responsible reader.But academic meeting paper is more and more in recent years, and academic conference has become the main path that vast Chinese scholars represents own academic research and academic aptitude.Because the rapid increase of scientific paper quantity, the number of members of checking the council is limited, and it is more and more heavier that academic meeting paper is checked the burden of work, even a large amount of papers can further reduce the efficient that academic meeting paper is checked work.Therefore, above system exists certain deficiency aspect the meeting paper responsible reader distributing expeditiously.The present invention improves the efficient that scientific paper distributes, and can regard a kind of assignment techniques as in essence, by the algorithm of artificial intelligence field, under the situation of certain constraint, realizes paper and responsible reader's automatic coupling.In this invention the responsible reader is regarded as target, add a series of constraint condition, efficiently scientific paper is distributed to corresponding responsible reader.The present invention has mainly adopted a kind of responsible reader's bidding mechanism, namely the responsible reader is carried out competitive bidding to paper in advance, and the more high explanation of competitive bidding mark responsible reader more wishes to check this paper.Whole allocation process is to finish automatically by algorithm earlier, and the council of checking can adjust allocation result on this basis.
Summary of the invention
The academic meeting paper distribution method of going over a manuscript or draft mainly contains following several stages:
1. database is set up
Because the quantity of academic meeting paper is more and more, so paper to be checked is a very huge set.For the huger data of such quantity, can make by database that going over a manuscript or draft shares out the work and become efficient, accurately.In database, need set up the relation between corresponding entity and entity and the entity, as paper entity, responsible reader's entity etc., could realize efficiently and accurately like this that academic meeting paper is gone over a manuscript or draft to share out the work.The structure of database is the master tool that provides storage and inquiry to support for two stages of back.When database is set up, not only to consider field and the affiliated field of responsible reader of paper, more need to consider to have with paper the conflict of interest and responsible reader's the purpose of going over a manuscript or draft, therefore need to set up corresponding showing and field, provide basic data for distributing the paper algorithm.
2. data are collected
In the academic meeting paper allocation algorithm, the responsible reader is to the competitive bidding degree of paper, responsible reader's research direction, the direction of paper, paper is to responsible reader's the conflict of interest, and the responsible reader is to the conflict of interest of paper, and related datas such as responsible reader's collision domain are the data bases of realizing this algorithm, therefore, these data all need be collected and put in order in advance.
The responsible reader refers to that to the competitive bidding degree of paper the responsible reader gives a mark to each piece paper in advance, and the more high expression of mark responsible reader more is ready to check this paper.The research direction of responsible reader and paper all is an attribute as database the inside responsible reader and two entities of paper.The conflict of interest between responsible reader and the paper exists as the relation between responsible reader in the database and two entities of paper.Responsible reader's collision domain also is an attribute of responsible reader's entity.
3. score matrix computations
The data that the matrix that counts the score needs have the responsible reader to the competitive bidding degree of paper, responsible reader's research direction, and the direction of paper, paper is to responsible reader's the conflict of interest, and the responsible reader is to the conflict of interest of paper, responsible reader's collision domain.These data all are to deposit in the database in advance, so, only need from database, to read to get final product.But, it should be noted that the responsible reader can not check the paper of oneself, need when counting the score matrix, add this constraint.
4. distribution paper
The paper that often occurs some theme in academic conference is many especially, and the paper of some theme is few especially.Therefore the present invention has taken into full account " cold and hot " degree of paper theme, namely passes through to such an extent that sub matrix defines " cold and hot " degree of paper theme, and then utilizes heuritic approach that " unexpected winner " paper is carried out priority allocation.Particularly, utilize the sub matrix that gets in the step 3 to obtain the ordering of paper " cold and hot " degree, carry out paper according to the order from the unexpected winner to the hot topic again and distribute.Responsible reader's selection is just to decide according to the mark that gets sub matrix, earlier high to score responsible reader's priority allocation.If the situation of mark arranged side by side should add the consideration to mark responsible reader's arranged side by side purpose and workload, select again.Carry out in the sub matrix traversal, need to consider every responsible reader's workload, avoid the responsible reader who has not have paper to examine, and the responsible reader who has has the situation of the paper pending trial that exceeds his workload.At last, the result who selects is reflected in the allocation result matrix, reflects the task allocation result of going over a manuscript or draft intuitively.
Description of drawings
Fig. 1 is general frame figure of the present invention;
Fig. 2 is for getting the computation process of sub matrix among the present invention;
Fig. 3 is the computation process of allocation matrix among the present invention.
Embodiment
The present invention at first will set up corresponding database, considers the conflict of interest and other constraint condition between responsible reader and the paper, carries out the distribution of meeting paper refereeing according to responsible reader's the purpose of going over a manuscript or draft, and concrete implementation step is as follows:
Step 1: the structure of database
Database is the instrument of the storage of academic meeting paper data and inquiry.A large amount of academic meeting papers be recorded and distribute, a kind of means are efficiently set up database exactly.Entity has meeting entity, paper entity, responsible reader's entity, competitive bidding entity in the used database of the present invention.It is as follows that each entity comprises field:
The meeting entity: the number of going over a manuscript or draft of meeting title, meeting URL, Session Topic, research direction, time zone, every piece of paper, responsible reader's maximum are gone over a manuscript or draft and are counted etc.
Paper entity: field (master), the affiliated field (inferior) of paper, paper collision domain under paper number, paper title, author information, the abstract of a thesis, paper keyword, the paper, paper conflict responsible reader.
Responsible reader's entity: responsible reader's numbering, responsible reader's title, responsible reader affiliated unit, responsible reader field.
Competitive bidding entity: paper number, responsible reader's numbering, competitive bidding degree.
Wherein the field of top overstriking is the data that allocation algorithm will use; The paper collision domain is mailbox suffix such as buaa.edu.cn, shows that the responsible reader of same unit can not check the paper of this unit; Field and responsible reader field are all from the research direction of setting in the conference entity under the paper; The competitive bidding degree is divided into three kinds: very be ready, can check and be unwilling, with the storage of numerical value form, corresponding score value is respectively 2,1,0 in database.In the database specific implementation process, also can require to transform according to reality, but need provide allocation algorithm needed basic data.
Step 2: data are collected
Next the data in the database are collected, i.e. overstriking field in the step 1.
Step 3: matrix counts the score
Sub matrix be the foundation that meeting paper distributes, it is the integer type matrix of the number of going over a manuscript or draft * paper number, is illustrated under the restraint condition responsible reader to the score situation of paper.
The mark that gets sub matrix comprises competitive bidding degree score, field score and other scores.Competitive bidding degree score is that the responsible reader is obtained on duty 2 of the competitive bidding degree of meeting paper.The branch rule of giving of field score is to carry out to dividing according to the matching degree of paper theme and responsible reader's research direction, if on paper primary territory and responsible reader's the research direction coupling, just add 2 fens, if paper time field and responsible reader's research direction coupling, just add 1 fen, add 2 fens most.Other scores mainly are to decide according to the conflict of interest between responsible reader and the paper.If between responsible reader and the paper conflict of interest is arranged, the mark that just will get sub matrix was set to-100 fens, showed that certain piece of paper extremely can not be checked by certain responsible reader.Idiographic flow is seen Fig. 2.
The score matrix column that finally obtains is represented all responsible readers to certain piece of score of waiting to check paper, and a certain position of the line display of this matrix responsible reader waits to check the score of paper to all.
Step 4: determine the paper allocation order
At allocation algorithm of the present invention, at first need to determine the allocation order of paper.To get sub matrix and vertically add up, wherein must not carry out addition for-100 element, obtain the allocation order vector.Value in the allocation vector is more little, shows relatively unexpected winner of this paper, distributes more earlier; Value in the allocation vector is more big, shows that the responsible reader relatively is fit to or more back distribution is checked in hope.
Step 5: distribute the task of going over a manuscript or draft
According to the allocation order of determining in the step 4, select one piece of paper (namely getting a certain row in the sub matrix), search out the highest responsible reader of score, judge whether this responsible reader reaches the maximum amount of going over a manuscript or draft; If this responsible reader does not reach the maximum amount of going over a manuscript or draft, this paper is distributed to this responsible reader, and upgrade responsible reader's assignment information, when certain responsible reader reaches the maximum amount of going over a manuscript or draft, with this responsible reader the value update all of being expert at of sub matrix is-100, show that this responsible reader no longer accepts new assign task; If this responsible reader reached the maximum amount of going over a manuscript or draft, then seek the high responsible reader of gradation, by that analogy, be assigned with the number of going over a manuscript or draft of meeting appointment up to this piece paper.Idiographic flow is seen Fig. 3.
Step 6: allocation result output
With the result of step 5, be organized into the 0-1 matrix of the number of going over a manuscript or draft * paper number, wherein 1 shows the paper of column is distributed to the responsible reader who is expert at.
The invention provides a kind of meeting efficiently allocation algorithm of going over a manuscript or draft, and in reality, use, obtain gratifying effect.Although embodiment of the present invention openly as above; but it is not limited only to listed utilization in instructions and the embodiment; it can be applied to various suitable the field of the invention fully; for those skilled in the art; can easily implement other modification, therefore, not deviate under the universal that claim and equivalency range limit; can also make some improvements and modifications, these improvements and modifications also should be considered as in the protection domain of the present invention.
Claims (6)
1. an academic meeting paper efficient allocation method is characterized in that, may further comprise the steps:
Step 1 is set up the academic meeting paper database, and entity has meeting entity, paper entity, responsible reader's entity, competitive bidding entity in the database; According to the entity in the database and attribute gather data thereof;
Step 2 is according to the entity in the database and attribute gather data thereof;
Step 3, according to the competitive bidding degree of the responsible reader in the database to paper, responsible reader's research direction, the direction of paper, paper is to responsible reader's the conflict of interest, the responsible reader is to the conflict of interest of paper, and contents such as responsible reader's the collision domain matrix that counts the score needs simultaneously to add that the responsible reader can not check the constraint condition of the paper of oneself;
Step 4, according to getting sub matrix article is carried out the ordering of " cold and hot " degree, and utilizing heuritic approach that " unexpected winner " paper is carried out priority allocation, responsible reader's selection is just to decide according to the mark that gets sub matrix, earlier high to score responsible reader's priority allocation;
Step 5 if the situation of mark arranged side by side should add the consideration to mark responsible reader's arranged side by side purpose and workload, is selected again; Carry out in the sub matrix traversal, need to consider every responsible reader's workload, avoid the responsible reader who has not have paper to examine, and the responsible reader who has has the situation of the paper pending trial that exceeds his workload;
Step 6 is reflected to the result who selects in the allocation result matrix, reflects the task allocation result of going over a manuscript or draft intuitively.
2. academic meeting paper efficient allocation method as claimed in claim 1 is characterized in that, in the described step 1 in the database entity meeting entity, paper entity, responsible reader's entity, competitive bidding entity are arranged.It is as follows that each entity comprises field:
The meeting entity: the number of going over a manuscript or draft of meeting title, meeting URL, Session Topic, research direction, time zone, every piece of paper, responsible reader's maximum are gone over a manuscript or draft and are counted etc.
Paper entity: field (master), the affiliated field (inferior) of paper, paper collision domain under paper number, paper title, author information, the abstract of a thesis, paper keyword, the paper, paper conflict responsible reader.
Responsible reader's entity: responsible reader's numbering, responsible reader's title, responsible reader affiliated unit, responsible reader field.
Competitive bidding entity: paper number, responsible reader's numbering, competitive bidding degree.
3. academic meeting paper efficient allocation method as claimed in claim 1, it is characterized in that, data of database derives from the data that academic conference is collected in advance, i.e. overstriking field in the described academic meeting paper efficient allocation of claim 2 method in the described step 2.
4. academic meeting paper efficient allocation method as claimed in claim 1 is characterized in that, in the described step 3, the mark that gets sub matrix comprises competitive bidding degree score, field score and other scores.Competitive bidding degree score is that the responsible reader is obtained on duty 2 of the competitive bidding degree of meeting paper.The branch rule of giving of field score is to carry out to dividing according to the matching degree of paper theme and responsible reader's research direction, if on paper primary territory and responsible reader's the research direction coupling, just add 2 fens, if paper time field and responsible reader's research direction coupling, just add 1 fen, add 2 fens most.Other scores mainly are to decide according to the conflict of interest between responsible reader and the paper.If between responsible reader and the paper conflict of interest is arranged, the mark that just will get sub matrix was set to-100 fens, showed that certain piece of paper extremely can not be checked by certain responsible reader.
5. academic meeting paper efficient allocation method as claimed in claim 1, it is characterized in that, in the described step 5, according to the allocation order of determining in the academic meeting paper efficient allocation method step four as claimed in claim 1, select one piece of paper (namely getting a certain row in the sub matrix), search out the highest responsible reader of score, judge whether this responsible reader reaches the maximum amount of going over a manuscript or draft; If this responsible reader does not reach the maximum amount of going over a manuscript or draft, this paper is distributed to this responsible reader, and upgrade responsible reader's assignment information, when certain responsible reader reaches the maximum amount of going over a manuscript or draft, with this responsible reader the value update all of being expert at of sub matrix is-100, show that this responsible reader no longer accepts new assign task; If this responsible reader reached the maximum amount of going over a manuscript or draft, then seek the high responsible reader of gradation, by that analogy, be assigned with the number of going over a manuscript or draft of meeting appointment up to this piece paper.
6. academic meeting paper efficient allocation method as claimed in claim 1 is characterized in that, with the result of described step 5, is organized into the 0-1 matrix of the number of going over a manuscript or draft * paper number, and wherein 1 shows the paper of column is distributed to the responsible reader who is expert at.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310250302XA CN103336804A (en) | 2013-06-21 | 2013-06-21 | Academic paper efficient allocation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310250302XA CN103336804A (en) | 2013-06-21 | 2013-06-21 | Academic paper efficient allocation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103336804A true CN103336804A (en) | 2013-10-02 |
Family
ID=49244969
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310250302XA Pending CN103336804A (en) | 2013-06-21 | 2013-06-21 | Academic paper efficient allocation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103336804A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111369202A (en) * | 2018-12-25 | 2020-07-03 | 中国石油天然气股份有限公司 | Manuscript submission method and manuscript collection and editing platform |
| CN114154478A (en) * | 2022-02-07 | 2022-03-08 | 杭州未名信科科技有限公司 | Paper reviewer determination method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1877632A (en) * | 2005-03-30 | 2006-12-13 | 株式会社日立制作所 | Digital content distribution system |
| CN101520868A (en) * | 2009-02-24 | 2009-09-02 | 上海大学 | Method for applying analytic hierarchy process to reviewer information database system |
| CN102012911A (en) * | 2010-11-19 | 2011-04-13 | 清华大学 | Constrained optimization-based expert matching method and system |
| CN102298647A (en) * | 2011-09-26 | 2011-12-28 | 重庆抛物线信息技术有限责任公司 | Inspection and allocation system and method of data file |
-
2013
- 2013-06-21 CN CN201310250302XA patent/CN103336804A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1877632A (en) * | 2005-03-30 | 2006-12-13 | 株式会社日立制作所 | Digital content distribution system |
| CN101520868A (en) * | 2009-02-24 | 2009-09-02 | 上海大学 | Method for applying analytic hierarchy process to reviewer information database system |
| CN102012911A (en) * | 2010-11-19 | 2011-04-13 | 清华大学 | Constrained optimization-based expert matching method and system |
| CN102298647A (en) * | 2011-09-26 | 2011-12-28 | 重庆抛物线信息技术有限责任公司 | Inspection and allocation system and method of data file |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111369202A (en) * | 2018-12-25 | 2020-07-03 | 中国石油天然气股份有限公司 | Manuscript submission method and manuscript collection and editing platform |
| CN114154478A (en) * | 2022-02-07 | 2022-03-08 | 杭州未名信科科技有限公司 | Paper reviewer determination method and system |
| CN114154478B (en) * | 2022-02-07 | 2022-07-05 | 杭州未名信科科技有限公司 | Paper reviewer determination method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gao et al. | Top-k team recommendation and its variants in spatial crowdsourcing | |
| CN108109013A (en) | A kind of shared member system | |
| Gao et al. | Top-k team recommendation in spatial crowdsourcing | |
| Coombes et al. | Business models and their relationship with marketing: A systematic literature review | |
| Frankenberg | Economic anthropology: one anthropologist's view | |
| Kara et al. | Balancing parallel assembly lines with precise and fuzzy goals | |
| Nax et al. | Evolutionary dynamics and equitable core selection in assignment games | |
| Lee et al. | A heuristic for vehicle fleet mix problem using tabu search and set partitioning | |
| CN101208692A (en) | Automatically moving multidimensional data between live datacubes of enterprise software systems | |
| CN102685246A (en) | Household design method and system based on cloud design | |
| Hamrick et al. | Assessing what distinguishes highly cited from less-cited papers published in interfaces | |
| Song et al. | Risk-return relationship in a complex adaptive system | |
| Vignesh Kumar et al. | Tolerance allocation of complex assembly with nominal dimension selection using Artificial Bee Colony algorithm | |
| Blume | New taxonomy for corporate open innovation initiatives | |
| CN102158533A (en) | Distributed web service selection method based on QoS (Quality of Service) | |
| Alami et al. | Making space for the new state capitalism, part II: Relationality, spatiotemporality and uneven development | |
| Peters et al. | Cooperative games with transferable utility | |
| CN103336804A (en) | Academic paper efficient allocation method | |
| CN106156971B (en) | Logistics resource collaborative relationship information processing method and device | |
| CN109345284A (en) | The determination method, apparatus and server for hiring coefficient are returned in businessman's marketing | |
| CN105786622B (en) | A kind of node selecting method calculated under cloud environment for real-time collaborative | |
| Tang et al. | Modelling and a tabu search solution for the slab reallocation problem in the steel industry | |
| Ho et al. | The design of a parallel zone-picking system with cooperation area between neighbouring zones and its cooperation methods | |
| Gavrilova et al. | Knowledge management trends in the digital economy age | |
| Heinrich et al. | An agent-based manufacturing management system for production and logistics within cross-company regional and national production networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20131002 |
|
| WD01 | Invention patent application deemed withdrawn after publication |