JP4111376B2 - Applicant lottery system, applicant lottery method and program for causing computer to execute the method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a candidate lottery system, a candidate lottery method, and a program for causing a computer to execute the method for selecting a student who has taken each class from a plurality of applicants who wish to take a plurality of classes.
[0002]
[Prior art]
The various classes offered at the university are basically free to attend based on the individual student's will, except for required courses that are required to be taken. However, from the viewpoint of resources such as the number of seats in the classroom and the number of laboratory equipment, the number of students who can actually take the course is naturally limited.
[0003]
As shown in Fig. 22, there are several courses offered at universities, such as "English I" and "Introduction to Economics", and one course has multiple classes (classes) on different days of the week and different courses. ing. For example, for “English I”, there are three classes: the first class on Monday, instructed by Instructor Suzuki, the second class on Monday, instructed by Instructor Tanaka, and the first class on Monday, instructed by Instructor Sato. The course is open.
[0004]
Conventionally, for classes where the number of applicants exceeds the capacity, (1) the students who attended the first round of the class will draw lots on the spot, or (2) all students on a specific lottery date. (Or all students of the same grade) were gathered together and the order of each student was determined by lottery on the spot, and the classes to be taken in order from the student with the earlier order were selected.
[0005]
[Problems to be solved by the invention]
However, in the case of (1) above, the burden on the instructor at the time of the first class becomes large. As a student, even if there are other classes of interest on the same day of the week and the same class (hereinafter referred to as “same piece”), they cannot even participate in the lottery of the class. For example, in the example of Fig. 22, if you participate in Dr. Suzuki's "English I" lottery on Monday 1st, you will have to give up Dr. Sato's "English I" and Dr. Yamamoto's "Introduction to Economics" lottery. become.
[0006]
In addition, since only one class per subject is recognized as a graduation unit, students such as “English I” of Instructor Suzuki in the first frame of Monday and “English I” of Instructor Tanaka in the second frame of Monday, for example, If, by mistake, you wish to win more than one class with the same subject, you must cancel the rest, leaving one. And it is desirable to make a lottery again among students who have missed the lottery by using the vacant space generated by this, but it is not actually carried out because the work is complicated.
[0007]
On the other hand, in the case of (2) above, students who have assigned a young number can take any lesson almost as they wish, but the lesser the desired lesson becomes, the later the order becomes, the degree of satisfaction between students will increase. There is a problem that the variation becomes large (the feeling of unfairness becomes strong).
[0008]
Furthermore, the problems common to both (1) and (2) above are: how many students are interested in each class, what is the competition rate, which classes exceed the capacity, and which classes Because we were unable to obtain data such as whether or not we were less than that, we could not plan to meet the needs of all students in the next class, and could not make effective use of resources such as classrooms and teachers.
[0009]
Although it may be possible to have each student submit a form such as a registration notice in advance, the actual situation in the field is that there are only a few days from a briefing session for students (orientation about the course) to the actual opening of the course. There was a problem that the contents of the large amount of registrations submitted in could not be entered into the computer system. In addition, there are often mistakes in documents created by students themselves, such as double registration (registration of registration requests in a combination that cannot be physically taken, such as multiple classes in the same frame).
[0010]
In order to solve the above-described problems caused by the prior art, the present invention determines the students who will take each class fairly and efficiently from a large number of applicants according to the enthusiasm of each student's desire to take classes. It is an object of the present invention to provide a candidate lottery system, a candidate lottery method, and a program for causing a computer to execute the method.
[0011]
[Means for Solving the Problems]
In order to solve the above-mentioned problems and achieve the purpose, this The applicant lottery system according to the invention is a applicant lottery system for selecting students who have taken each class from a plurality of applicants who wish to take a plurality of classes. , An input means for inputting desired course data indicating what priority order of classes among the plurality of classes is desired, and the same lesson among the desired course data input by the input means Extraction means for extracting those who wish to take courses with the same priority, and the number of desired course data extracted by the extraction means is the number of vacancies in classes that are desired to be taken with the desired course data. A determination means for determining whether or not the number of desired data is not less than or equal to the number of vacant capacity is determined by the determination means; A selection means for selecting as many data as there are vacant numbers from the desired data, and a candidate who wishes to register with the desired data selected by the selection means. And a determination means for determining as a student of a class for which a course is desired.
[0012]
this According to the invention, if there is a desire to take a class that exceeds the capacity, there will be no candidates who have a relatively high degree of desire to take the class, and those who have the same degree will not be selected by lottery. Applicants who have been selected for work will be allocated sequentially as students of the class.
[0013]
Also, this The applicant lottery system according to the invention is: the above In addition, for each of the applicants, an error determination unit that determines whether there is no same class in a plurality of classes determined as a student by the determination unit, and the error determination unit Canceling means for canceling the determination as a student made by the determining means for the remaining classes except for one of the plurality of classes when it is determined that there are the same class in a plurality of classes , Provided.
[0014]
this According to the invention, while a certain applicant wins a class that cannot be taken in practice, there is no waste that other applicants fail to take the class due to a lottery.
[0015]
Also, this The applicant lottery system according to the invention is: the above In the invention of the above, regarding the class in which a new vacant capacity has occurred as a result of the cancellation of the decision as a student by the cancellation means, it was not selected by the selection means among the registration request data desired to take the class A candidate who wishes to register with the second selection means for selecting the desired number of classes for the number of new vacant numbers, and the desired data selected by the second selection means. And a second determination means for determining as a student who has taken a class that is desired to be registered based on the desired data.
[0016]
this According to the invention, the students who have missed the previous lottery are re-drawn using the new vacancy generated by the cancellation of the winning of the class that cannot be taken.
[0017]
Also, this The applicant lottery system according to the invention is: the above In the invention, the selection means and / or the second selection means generates a random number for each of the desired registration data, and the number of the empty quorum or the number of the new vacant quorum in ascending order of the random number. It is characterized by selecting the desired data.
[0018]
this According to the invention, if there is a desire to take a class that exceeds the capacity, a candidate who has a relatively high degree of desire to take the class uses a random number among those who have the same degree. Applicants who are randomly selected by the lottery will be allocated sequentially as students of the class.
[0019]
Also, this The applicant lottery method according to the present invention is a applicant lottery method for selecting a student who has taken each class from a plurality of applicants who wish to take a plurality of classes. Of the plurality of classes, an input process for inputting desired course data indicating which priority level is desired, and an identical class among the desired course data input in the input process The number of students who want to take the courses with the same priority and the number of desired course data extracted in the extraction process A determination step for determining whether or not the number is less than or equal to the number of vacant capacity data in the determination step; A selection process for selecting the desired number of courses as many as the number of available vacancies, and applicants who wish to take courses based on the desired course data selected in the selection process are requested to take courses with the desired course data. And a determination process for determining as a student of the class.
[0020]
this According to the invention, if there is a desire to take a class that exceeds the capacity, there will be no candidates who have a relatively high degree of desire to take the class, and those who have the same degree will not be selected by lottery. Applicants who have been selected for work will be allocated sequentially as students of the class.
[0021]
Also, this The applicant lottery method according to the invention is: the above In the invention, for each of the applicants, an error determination step of determining whether there is no same class in a plurality of classes determined as students in the determination step, and the error determination step A cancellation step of canceling the determination as a student made in the determination step for the remaining lessons except for one of the plurality of lessons when it is determined that a plurality of lessons are of the same class , Including.
[0022]
this According to the invention, while a certain applicant wins a class that cannot be taken in practice, there is no waste that other applicants fail to take the class due to a lottery.
[0023]
Also, this The applicant lottery method according to the invention is: the above In the invention of the above, regarding the class in which a new vacant capacity has occurred as a result of the cancellation of the decision as a student in the cancellation process, it was not selected in the selection process among the data desired to register for the class A candidate who wishes to take courses based on the second selection process for selecting the desired number of classes for the number of new vacancies from the list, and the course selection data selected in the second selection process. And a second determination step for determining as a student who has taken a course that is desired to be registered based on the desired data.
[0024]
this According to the invention, the students who have missed the previous lottery are re-drawn using the new vacancy generated by the cancellation of the winning of the class that cannot be taken.
[0025]
Also, this The applicant lottery method according to the invention is: the above In the present invention, in the selection step and / or the second selection step, a random number is generated for each desired data, and the number of vacant capacity or the number of new vacant capacity is increased in descending order of the random number. It is characterized by selecting the desired data.
[0026]
this According to the invention, if there is a desire to take a class that exceeds the capacity, a candidate who has a relatively high degree of desire to take the class uses a random number among those who have the same degree. Applicants who are randomly selected by the lottery will be allocated sequentially as students of the class.
[0027]
Also, this According to the program according to the invention, the above The method described in any one of the above is executed by a computer.
[0028]
DETAILED DESCRIPTION OF THE INVENTION
Exemplary embodiments of a applicant lottery system, a candidate lottery method, and a program for causing a computer to execute the method will be described below in detail with reference to the accompanying drawings.
[0029]
(System configuration)
FIG. 1 is an explanatory diagram showing a system configuration of a applicant lottery system according to an embodiment of the present invention. First, reference numeral 100 denotes a client of the Web server 101 to be described later, specifically, a personal computer held by each student at home or the like. The client 100 is connected to the Internet via an ISP (not shown), reads a Web page held by the Web server 101, receives input from the operator for the form on the page, and transmits the input content to the Web server 101. To do.
[0030]
Reference numeral 101 denotes a Web server connected to the Internet, which holds various Web pages for course registration as will be described later, and transmits the data to the client 100 that has requested the page. Further, the Web server 101 transfers the input contents (study request data) of each student to the Web page transmitted from the client 100 to the lottery PC 102 described later.
[0031]
Reference numeral 102 denotes a lottery PC, which summarizes each student's enrollment wishes for each class, and for those classes where the applicant exceeds the capacity, the students are selected according to the procedure described below and the lottery results are output to a file. Or output to a printer. The Web server 101 and the lottery PC 102 are connected by a LAN within the university campus.
[0032]
(System hardware configuration)
Next, the hardware configuration of the client 100, the Web server 101, and the lottery PC 102, which are components of the system, will be described. For convenience of explanation, it is assumed that these computers have the same configuration, but the three parties do not necessarily have the same configuration. Further, the configuration described below is an example, and other configurations may be used.
[0033]
FIG. 2 is an explanatory diagram illustrating an example of a hardware configuration of the client 100, the Web server 101, or the lottery PC 102. In the figure, 201 indicates a CPU that controls the entire apparatus, 202 indicates a ROM that stores basic input / output programs, and 203 indicates a RAM that is used as a work area of the CPU 201.
[0034]
Reference numeral 204 denotes an HDD (hard disk drive) that controls reading / writing of data with respect to the HD (hard disk) 205 under the control of the CPU 201, and 205 denotes an HD that stores data written according to the control of the HDD 204. Yes. Reference numeral 206 denotes an FDD (flexible disk drive) that controls reading / writing of data with respect to the FD (flexible disk) 207 according to the control of the CPU 201, and 207 denotes a removable FD that stores data written according to the control of the FDD 206. Respectively.
[0035]
Reference numeral 208 denotes a cursor, menu, window, or display for displaying various data such as characters and images. Reference numeral 209 is connected to a network such as a LAN or WAN via a communication cable 210 and serves as an interface between the network and the CPU 201. Each functioning network I / F is shown.
[0036]
Reference numeral 211 denotes a keyboard having a plurality of keys for inputting characters, numerical values, various instructions, and 212 denotes a mouse for selecting and executing various instructions, selecting a processing target, moving a mouse pointer, etc. Show. Reference numeral 213 denotes a CD-RW that is a removable recording medium, 214 denotes a CD-RW drive that controls reading / writing of data with respect to the CD-RW 213, and 200 denotes a bus or cable for connecting the above-described units. Each is shown.
[0037]
(Functional configuration of the system)
Next, FIG. 3 is an explanatory view functionally showing the configuration of the applicant lottery system according to the embodiment of the present invention. In the figure, 300x is a client 100, 301x is a Web server 101, and 302x is a functional part of the lottery PC 102. The details of the function of each part will be described mainly in the flowchart described later, and only the outline will be described here.
[0038]
The communication unit 300a of the client 100 is a functional unit that controls transmission / reception of data to / from the Web server 101 (a communication unit 301a described later). The input unit 300 b is a functional unit that receives input of various commands and data from the operator of the client 100. The display unit 300c is a functional unit that displays data received by the communication unit 300a, data received by the input unit 300b, and the like on a display screen.
[0039]
The communication unit 301a of the Web server 101 is a functional unit that controls data transmission / reception with the client 100 (the communication unit 300a) and the lottery PC 102 (the communication unit 302a described later). The web page management unit 301b inserts data in various tables, which will be described later, into the web page data held in advance as necessary, thereby enabling various webs such as a course selection screen, a class selection screen, which will be described later. It is a functional part that creates pages. The error check unit 301c is a functional unit that checks whether a plurality of lessons selected by the client 100 include the same frame and the same priority (the priority will be described later).
[0040]
As shown in FIG. 4, the subject table 301d is a table that holds the subject code and subject name of each subject to be offered in association with each other. As shown in FIG. 5, the lesson table 301e holds detailed information such as a subject code, a lesson code, a lesson name, a lesson code, a day of the week, a lesson time, etc., for each lesson held under an individual subject. It is a table. As shown in FIG. 6, the classroom table 301f is a table that holds the classroom codes and capacity of each classroom in association with each other. As shown in FIG. 7, the student register table 301g is a table that holds personal information such as the student number, department, grade, and name of each student.
[0041]
Returning to FIG. 3, the communication unit 302 a of the lottery PC 102 is a functional unit that controls transmission and reception of data with the Web server 101 (the communication unit 301 a). The student determination unit 302b is a functional unit that determines whether or not each student can take a course in each class with reference to a class request table 302e and a capacity table 302f, which will be described later. The lottery section 302c is a functional section that selects students by lottery when there are more students who want to attend the class. The error check unit 302d is a functional unit that checks whether or not there is an error such as overlapping or conflicting classes in the content determined by the student determination unit 302b.
[0042]
As shown in FIG. 8, the registration request table 302e has a student number of the applicant, a subject and class that the applicant desires to take, a priority order (the priority order will be described later), and a day on which the class is opened.・ It is a table that holds detailed information about each course you wish to take, such as during classes. This table is provided with a “study provisional decision” field and a “deletion” field for writing a work result by the student determination unit 302b, and both are blank in the initial state.
[0043]
As shown in FIG. 9, the capacity table 302 f is a table that holds the class code, class code, class name, capacity limit, and the like for each class for each class. Note that the subject code, lesson code, and lesson name are copied from the lesson table 301e in FIG. 5 held by the Web server 101, and the upper limit of the capacity is further obtained by referring to the lesson table 301f in FIG. It is what was done. The capacity table 302f is provided with a “current capacity” field for writing a work result by the student determination unit 302b. In an initial state, an initial value “0” is set in any record. .
[0044]
The functional units 300a to 300c, 301a to 301c, and 302a to 302d described above are realized by the CPU 201 executing instruction processing in accordance with program instructions read from the HD 205 or the like to the RAM 203. is there. This program can be distributed by being stored in various recording media such as the FD 207, CD-ROM or MO in addition to the HD 205, or can be distributed via a network. Further, the tables 301d to 301g, 302e and 302f are specifically held in the HD 205.
[0045]
(Course registration processing)
Next, FIG. 10 is a flow chart showing the procedure of registration processing for each student's desire to register in the applicant lottery system according to the embodiment of the present invention.
[0046]
When the client 100 receives an instruction to start registration desired registration from the input unit 300b, specifically, an instruction to read a predetermined Web page (a class selection screen described later) on the Web server 101, the communication unit 300a The web server 101 is requested to transmit the data of the web page (step S1001).
[0047]
The Web server 101 that has received this by the communication unit 301a returns the data of the page held in the Web page management unit 301b from the communication unit 301a to the client 100 (step S1002). The client 100 that has received the data at the communication unit 300a then displays a course selection screen (a top screen for registration request registration) as shown in FIG. 11 on the display unit 300c (step S1003).
[0048]
When the input unit 300b detects that the operator has pressed the “Register” button 1100 on the screen of FIG. 11, the client 100 then uses the communication unit 300a to select all subjects selected when the button is pressed. The name (that is, the names of all subjects whose check boxes are checked) is transmitted to the Web server 101 (step S1004). Here, it is assumed that “sports”, “English I”, and “economic introduction” are selected as subjects that the operator wishes to take.
[0049]
Since each subject has a payout year (for example, it can only be taken in the second year or higher), the Web server 101 refers to the student table 301g based on the student number of the operator of the client 100, and determines the grade. At the same time, select and select one of the course selection screens that are held by the student for the grade level. However, the same course selection screen may be returned for all grades, and the dividend target year may be specified on the screen.
[0050]
The Web server 101 that has received the subject name submitted above by the communication unit 301a acquires the subject code of each subject by referring to the subject table 301d of FIG. 4 by the Web page management unit 301b. Further, the class table 301e shown in FIG. 5 is searched by using the subject code, and details of each class to be offered for each subject, such as the instructor, the opening day of the week, the class time, and the like are taken out. Then, by setting these detailed information in a list box in the Web page held in advance, a class selection screen described later is created (step S1005).
[0051]
Thereafter, the web server 101 transmits the data of the page created by the web page management unit 301b from the communication unit 301a to the client 100 (step S1006). The client 100 that has received the data at the communication unit 300a then displays a class selection screen as shown in FIG. 12 on the display unit 300c (step S1007).
[0052]
In the screen of FIG. 12, for each subject selected on the screen of FIG. 11, which lesson is desired to be taken among a plurality of lessons to be offered is selected. For example, when the down arrow button 1200 in the “first choice” column of “English I” is pressed, a list box 1300 as shown in FIG. 13 appears, and one of the three classes offered for “English I” is displayed. One can be selected as the first choice. However, as for “Sports” in FIG. 12, for a subject that is originally offered only one lesson per subject, the only lesson is selected in advance as the first choice.
[0053]
Here, it is assumed that the desire to register for each class is input in a combination as shown in FIG. Then, when the input unit 300b detects that the operator has pressed the “confirm” button 1400 on the screen shown in the figure, the input data (data indicating which student wants which class in which order) It passes to the error check unit 301c of the Web server 101 via the communication units 300a and 301a (step S1008).
[0054]
In response to this, the error check unit 301c checks whether or not a plurality of classes are selected for the same frame with the same priority in the above data. Here, the priority order is a priority order for the applicant. For example, the priority order of the lesson selected as the first choice is expressed by a numerical value “10”. Similarly, the priority of the second desired class is “20”, the priority of the third desired class is “30”, and so on. The 1's place is represented by a 2-digit value of 0.
[0055]
FIG. 15A is an example of data desired to be taken (initial data before correction of priority order described later) submitted from the client 100 to the Web server 101 in step S1008 in the selection example shown in FIG. As shown in FIG. 5 (b), the day of the week / lecture field read from the lesson table 301e in FIG. 5 is added to this data. Further, as shown in FIG. As a result, it can be seen that, for example, one frame on Monday, “English I” in charge of Prof. Suzuki and “Introduction to Economics” in charge of Prof. Yamamoto are both selected with the first choice (priority = 10).
[0056]
When such a priority conflict (error) is found in the error check unit 301c (step S1009: Yes), the web server 101 creates a later-described priority order correction screen by the web page management unit 301b. At the same time (step S1010), the data of the Web page is transmitted from the communication unit 301a to the client 100 (step S1011).
[0057]
The client 100 that has received the data at the communication unit 300a then displays a priority order correction screen as shown in FIG. 16 on the display unit 300c (step S1012). The operator selects, for example, “English I” from among a plurality of classes having the same frame and the same priority, for example, a value between 11 and 19 (meaning the middle between the first and second hopes). When the “confirm” button 1600 is pressed, the corrected priority is given to the error check unit 301c of the Web server 101 via the communication unit 300a / 301a from the input unit 300b that has accepted this operation. It is transmitted (step 1013).
[0058]
In the Web server 101, as a result of the error check similar to the above by the error check unit 301c, if the priority order conflict is resolved, that is, if the priorities of the classes selected in the same frame are different from each other, (Step S1009: No), the desired course data received in Step S1008 is corrected with the corrected priority received in Step S1013, and transmitted from the communication unit 301a to the lottery PC 102 (Step S1014).
[0059]
The lottery PC 102 that has received this by the communication unit 302a stores the data in the registration request table 302e. FIG. 15 (d) shows the desired course data when the priority of Prof. Suzuki's "English I", which conflicts with Prof. Yamamoto's "Introduction to Economy" on Monday, is changed from 10 to 15. Yes. By sequentially storing the corrected data, the registration request table 302e shown in FIG. 8 is completed.
[0060]
Further, in parallel with the data transfer to the lottery PC 102 (step S1014), the Web server 101 uses the Web page management unit 301b to create a registration request list screen to be described later based on the corrected registration request data (step S1014). S1015). Then, the data of the Web page is transferred to the display unit 300c of the client 100 via the communication units 301a and 300a (step S1016) and displayed on the screen as shown in FIG. 17 (step S1017). In the figure, for classes for which a plurality of classes are selected (for example, one frame on Monday), all selected classes are displayed in the remarks column 1700 at the bottom of the screen.
[0061]
(Student decision processing)
Next, FIG. 18 and FIG. 19 are flowcharts showing the procedure of the determination process of students who take each class in the applicant lottery system according to the embodiment of the present invention. This process is executed when the registration deadline of the course registration notified in advance has passed and the course registration data for all students has been accumulated in the course registration table 302e.
[0062]
First, the student determination unit 302b of the lottery PC 102 selects the “tentative registration determination” field and the “deletion” field of the registration request table 302e shown in FIG. 8, and the “current capacity” of the capacity table 302f shown in FIG. Each field is initialized (step S1801 in FIG. 18). Thereafter, the student is provisionally determined for each class according to the procedure shown in FIG. 19 (step S1802).
[0063]
First, one lesson of one subject is selected (step S1901 in FIG. 19), and all the desires for the lesson are taken out from the course request table 302e to a temporary work table (step S1902). Further, the records extracted in the temporary table are rearranged in ascending order of priority values (step S1903), and one set of records having the same priority is extracted in order from the top (step S1904).
[0064]
The number of records in the set, that is, the number of students who wish to take the class with the same priority, is determined from the capacity table 302f. The remaining capacity of the class (= “capacity limit” − “current limit”) “Capacity”) (step S1905: Yes), a predetermined value indicating the fact that the course has already been decided is set in the “tentative provisional decision” field of each record extracted in step S1904, and the desired course table 302e is set. Write back (step S1906).
[0065]
Further, the number of applicants whose course has been provisionally determined, that is, the number of records written back in step S1906 is added to the “current capacity” field of the capacity table 302f (step S1907).
[0066]
After that, if there is still an unprocessed applicant for the class, that is, if there is a record that has not been written back to the registration request table 302e among the records extracted in the temporary table in step S1902 (step S1908: Yes), again. A set of records having the same priority is taken out (step S1904), and the student's provisional decision is repeated until the class capacity is filled (step S1905).
[0067]
If there are no more records in the temporary table before the limit is exceeded, all students who wish to take the class will be able to take the class as desired, but at some point until there are no more records. In other words, if the set of records with the same priority order of interest includes records that exceed the remaining capacity ascertained from the capacity table 302f (step S1905: No), the lottery PC 102 next The lottery section 302c draws students among applicants with the same priority (step S1909).
[0068]
Specifically, for example, a random number is generated for each applicant with the same priority (for each record with the same priority), and the students are assigned to the above classes in order from the student with the smallest random number until the capacity is reached. To do. However, at this time, students in the final year will be treated more favorably than students in other years. That is, random numbers are generated once for students in the first to third years, but for students in the fourth year, random numbers are generated five times for each person, and the minimum value is stored by the student. And When a record corresponding to the remaining capacity is selected in ascending order of random numbers, the lottery unit 302c notifies the student determination unit 302b of the selection result (lottery result).
[0069]
Upon receipt of this, the student determination unit 302b sets a predetermined value indicating the fact that the student has been tentatively determined in the “student tentatively determined” field of the record selected above, that is, the record of the student slipped into the capacity. Then, it is written back to the registration request table 302e. On the other hand, there are records of students who could not enter the capacity due to a large random number even with the same priority, and records of students who wish to have the above classes with a lower priority that still remain in the temporary table above. Then, it is written back to the registration request table 302e as it is (step S1910). It should be noted that only the number of applicants whose courses have been provisionally determined is added to the “current capacity” field of the capacity table 302f (step S1911).
[0070]
Then, after tentatively deciding all or a part of the applicants for a class, the same processing as above is repeated for other classes (returning to step S1901), and all classes are all When the above process is completed for the lesson (step S1912: No), the student temporary process according to this flowchart is terminated, and the process returns to step S1803 in FIG.
[0071]
Next, the lottery PC 102 uses the error check unit 302d to check for each student whether or not there is an error such as a collision or a contradiction in the temporary determination result by the student determination unit 302b with reference to the registration request table 302e. Specifically, there are two types of errors checked here.
[0072]
(1) Multiple classes are provisionally decided for the same class
It is physically impossible to take multiple classes on the same day of the week.
(2) Multiple classes have been provisionally decided for the same subject
One class is recognized as a necessary unit for graduation.
[0073]
In any case, except for one of the classes, the provisional decision once taken must be canceled (although (2) above is acceptable unless there are other applicants) This is because even if it does not become a graduation unit, it is safe to take the course at the individual's will). Here, only the class with the highest priority is left, and other classes are treated as cancellations.
[0074]
The error checking unit 302d checks the presence or absence of the above error for each student, and if an error is found (step S1803: Yes), the highest priority among the plurality of conflicting records (the value is the lowest) A predetermined value indicating that the provisional determination of the course has been canceled is written in the “delete” field of the remaining records excluding (step S1804).
[0075]
When the check is completed, the error check unit 302d refers to the updated registration request table 302e as described above, and determines the current capacity (number of applicants whose registration is provisionally determined) for each class in each subject. The data is counted and written in the “current capacity” field of the capacity table 302f (step S1805).
[0076]
At this point, in the registration request table 302e,
(1) Records that have a mark only in the “Temporary Registration” field (set to a predetermined value) are accepted as-is
(2) Records with marks in both the “Temporary Registration” and “Delete” fields were not accepted, but instead another class in the same subject or another lesson in the same class Accepted course requests
(3) A record that does not have a mark in both the “Tentative Registration” and “Deleted” fields will not be selected by lottery, and you will not be able to take another class in the same subject or another class in the same class.
It is.
[0077]
Among the above, for (1) and (2), the student's wishes are satisfied completely or in another form, so all the records in the registration request table 302e are of the type (1) or (2). If there is (step S1806: Yes), the processing according to this flowchart may be terminated as it is.
[0078]
However, normally, as shown in (3), an unsatisfied enrollment request remains in the enrollment request table 302e (step S1806: No). Within the range of the new vacant capacity, the tentative determination of the student shown in FIG. 19 is performed again (step S1802).
[0079]
Then, an error check is again performed by the error check unit 302d, and whether all of the enrollment hopes are satisfied as desired (step S1806: Yes) or until there is no error and no new empty capacity is generated (step S1803: No) Repeat the provisional decision and cancellation of the student.
[0080]
According to the embodiment described above, it is possible to specify in detail which class and which class is desired in what priority order, and there is a possibility of winning a lower class even if it fails to draw a higher class. Because it is left behind, there is no risk of becoming all-or-nothing depending on which class draws at the time of class opening. In addition, it is possible to eliminate the unfair feeling that only the students who have drawn the young numbers in the lottery can take the desired class and those who do not have only the leftovers, and to suppress the occurrence of large variations in the satisfaction of each student. .
[0081]
In addition, students who take each class are charged in order from the applicant with the highest priority, so students who are willing to take courses will not be able to draw, while students who are not willing to win will not win. First, it is possible to most efficiently allocate the educational capabilities of the university to motivated students. Furthermore, since the applicants are allocated using all cancellations caused by double registration, resources such as classrooms and laboratory equipment can be utilized to the maximum.
[0082]
In addition, since data such as which classes are popular with students and which classes do not exist remains on the university side, when creating the next curriculum, the basics such as determining the number of classes to be offered and assigning classrooms to each class It can be a document. As a result, it is possible to organize a curriculum that better meets student needs.
[0083]
In the above-described embodiment, the university is assumed as the installation destination of this system, but in addition to this, there are various courses such as various school corporations or a culture center for general public. In any organization where lots of applicants need to be drawn, the introduction of this system can improve business efficiency.
[0084]
In the above-described embodiment, registration of a course registration is performed exclusively online, but a paper registration report is submitted offline, and these are registered as OMR (Optical Mark Reader) or OCR (Optical Mark Reader). The data desired by each student may be input to the system by reading with an optical character reader (optical character reader).
[0085]
In addition, in the case of online registration, there are students who do not have a personal PC. Therefore, a dedicated terminal may be installed on the campus so that each student can freely register their desired course. Alternatively, course registration may be made using a mobile phone that can be connected to the Internet. FIG. 20 shows a configuration example of the present system when various registration methods such as online and offline are used together. FIG. 21 shows an example of a screen when registering for course registration from a mobile phone.
[0086]
【The invention's effect】
As explained above this The present invention provides a lottery system for selecting applicants for each class from a plurality of applicants who wish to take a plurality of classes. Of the input means for entering the desired course data indicating the priority of which class to take, and among the desired course data entered by the input means, the same priority is given to the same class. Extraction means for extracting what is desired in the rank, and whether or not the number of desired course data extracted by the extraction means is equal to or less than the number of available classes in the class desired to be taken in the desired course data And determining means for determining whether the number of desired data to be taken is not less than or equal to the number of vacant capacity by the determining means from among the desired data extracted by the extracting means A selection method that selects only the number of qualifications required for the number of vacancies, and a class in which the applicants who wish to register with the selection data selected by the selection method are requested to register with the data. If a student wishes to take a class that exceeds the capacity, a candidate who has a relatively high degree of desire to take the class, Applicants who are randomly selected by a lottery among the same applicants will be allocated sequentially as students of the class, so that each student can take courses according to their enthusiasm for each class. There is an effect that a lottery system for applicants can be obtained which can determine a person from a large number of applicants fairly and efficiently.
[0087]
Also, this The invention the above In addition, for each of the applicants, an error determination unit that determines whether there is no same class in a plurality of classes determined as a student by the determination unit, and the error determination unit Canceling means for canceling the determination as a student made by the determining means for the remaining classes except for one of the plurality of classes when it is determined that there are the same class in a plurality of classes Therefore, while a candidate wishes to win a class that cannot be taken in practice, there is no waste that other applicants will not be able to take the class due to a lottery. In accordance with the enthusiasm for enrollment in each of the classes, there is an effect that a lottery system for applicants can be obtained that can efficiently determine students among many applicants.
[0088]
Also, this The invention the above In the invention of the above, regarding the class in which a new vacant capacity has occurred as a result of the cancellation of the decision as a student by the cancellation means, it was not selected by the selection means among the registration request data desired to take the class A candidate who wishes to register with the second selection means for selecting the desired number of classes for the number of new vacant numbers, and the desired data selected by the second selection means. And a second determination means for determining as a student of a class that is desired to be registered based on the desired data, using a new vacancy generated by the cancellation of the elected class that cannot be registered, For those who missed the previous lottery, the students will be re-drawn, so that each student can be selected from a large number of applicants according to their enthusiasm for each class. An effect that applicants lottery system that can slide into the rate-determined is obtained.
[0089]
Also, this The invention the above In the invention, the selection means and / or the second selection means generates a random number for each of the desired registration data, and the number of the empty quorum or the number of the new vacant quorum in ascending order of the random number. If a student wishes to take a class that exceeds the maximum number of students, the applicant who has a relatively high degree of desire to take the class and between those who have the same degree In this case, random applicants selected by random lottery will be assigned as students in the class, and students will be assigned to each class according to their enthusiasm for each class. There is an effect that a lottery system for applicants can be obtained which can be determined fairly and efficiently from a large number of applicants.
[0090]
Also, this The invention relates to a method for lottery selection of a plurality of applicants who wish to take a plurality of classes, wherein among the plurality of applicants, which one of the plurality of applicants Of the input process to enter the desired course data indicating what priority level of the class you want to take, and the desired course data entered in the input process, the same priority is given to the same class The extraction process for extracting what is desired in the rank, and whether or not the number of desired course data extracted in the extraction process is less than or equal to the number of available classes in the desired course data Determining the number of vacant capacity from the desired data extracted in the extracting step when it is determined in the determining step that the number of desired data is not less than the vacant capacity Min The selection process for selecting the desired course data and the applicants who wish to take courses based on the desired course data selected in the selection process are determined as the students who wish to take courses based on the desired course data. When there is a desire to take a class that exceeds the capacity, there is a relatively high degree of hope for the class, and between those who have the same degree. In this case, applicants randomly selected by lottery will be allocated sequentially as students of the class, so that each student will have a large number of applicants according to their enthusiasm for each class. There is an effect that a candidate lottery method that can be determined fairly and efficiently from among the above is obtained.
[0091]
Also, this The invention the above In the invention, for each of the applicants, an error determination step of determining whether there is no same class in a plurality of classes determined as students in the determination step, and the error determination step A cancellation step of canceling the determination as a student made in the determination step for the remaining lessons except for one of the plurality of lessons when it is determined that a plurality of lessons are of the same class , So that one applicant will be elected to a class that cannot be taken in practice, while other applicants will not be able to take the class due to a lack of lottery. In accordance with the enthusiasm for enrollment in each of the classes, there is an effect that a lottery method for applicants can be obtained that can efficiently determine students among a large number of applicants.
[0092]
Also, this The invention the above In the invention of the above, regarding the class in which a new vacant capacity has occurred as a result of the cancellation of the decision as a student in the cancellation process, it was not selected in the selection process among the data desired to register for the class A candidate who wishes to take courses based on the second selection process for selecting the desired number of classes for the number of new vacancies from the list, and the course selection data selected in the second selection process. And a second determination process for determining as a student of a class that is desired to be registered based on the desired data, using the new vacancy generated by the cancellation of the elected class that cannot be registered, For students who missed the previous lottery, the students will be re-drawn, and this will make it easier for students to choose among the many applicants according to their enthusiasm for each class. Decision Seekers lottery method capable of Yuku is an effect that can be obtained.
[0093]
Also, this The invention the above In the present invention, in the selection step and / or the second selection step, a random number is generated for each desired data, and the number of vacant capacity or the number of new vacant capacity is increased in descending order of the random number. If a student wishes to take a class that exceeds the maximum number of students, the applicant who has a relatively high degree of desire to take the class and between those who have the same degree In this case, random applicants selected by random lottery will be assigned as students in the class, and students will be assigned to each class according to their enthusiasm for each class. There is an effect that a candidate lottery method that can be determined fairly and efficiently from a large number of applicants is obtained.
[0094]
Also, this According to the invention, the above It is possible to obtain a program capable of causing a computer to execute the method described in any one of the above.
[Brief description of the drawings]
FIG. 1 is an explanatory diagram showing a system configuration of a applicant lottery system according to an embodiment of the present invention.
FIG. 2 is an explanatory diagram showing a hardware configuration of the client 100, the Web server 101, or the lottery PC 102 according to the embodiment of the present invention.
FIG. 3 is an explanatory diagram functionally showing the configuration of the applicant lottery system according to the embodiment of the present invention.
FIG. 4 is an explanatory diagram showing an example of a subject table 301d according to the embodiment of the present invention.
FIG. 5 is an explanatory diagram showing an example of a lesson table 301e according to the embodiment of the present invention.
FIG. 6 is an explanatory diagram showing an example of a classroom table 301f according to the embodiment of the present invention.
FIG. 7 is an explanatory diagram showing an example of a student register table 301g according to the embodiment of the present invention.
FIG. 8 is an explanatory diagram showing an example of a registration request table 302e according to the embodiment of the present invention.
FIG. 9 is an explanatory diagram showing an example of a capacity table 302f according to the embodiment of the present invention.
FIG. 10 is a flowchart showing a registration processing procedure for each student who wishes to take courses in the applicant lottery system according to the embodiment of the present invention;
FIG. 11 is an explanatory diagram showing an example of a course selection screen according to the embodiment of the present invention.
FIG. 12 is an explanatory diagram showing an example of a class selection screen according to the embodiment of the present invention.
FIG. 13 is an explanatory diagram showing another example of a class selection screen according to an embodiment of the present invention.
FIG. 14 is an explanatory diagram showing another example of a class selection screen according to an embodiment of the present invention.
FIG. 15 is an explanatory view schematically showing a state of correction of desired data in the error check unit 301c according to the embodiment of the present invention.
FIG. 16 is an explanatory diagram showing an example of a priority order correction screen according to the embodiment of the present invention.
FIG. 17 is an explanatory diagram showing an example of a registration request list screen according to the embodiment of the present invention.
FIG. 18 is a flowchart showing a procedure for determining a student who has taken each class in the applicant lottery system according to the embodiment of the present invention;
FIG. 19 is a flowchart showing a procedure for a provisional determination process for a student in step S1802 of FIG.
FIG. 20 is an explanatory diagram showing a system configuration of a candidate lottery system when various methods such as online and offline are used together for registration of a course request.
FIG. 21 is an explanatory diagram showing an example of a registration request screen when a mobile phone is adopted as the client.
FIG. 22 is an explanatory diagram schematically showing the relationship between subjects offered at a university, classes, and days of the week and classes.
[Explanation of symbols]
100 clients
101 Web server
102 PC for lottery
200 Bus or cable
201 CPU
202 ROM
203 RAM
204 HDD
205 HD
206 FDD
207 FD
208 display
209 Network I / F
210 Communication cable
211 keyboard
212 mouse
213 CD-RW
214 CD-RW drive
300a Communication Department
300b input section
300c display section
301a communication unit
301b Web page management unit
301c Error check section
301d subject table
301e class table
301f classroom table
301g student register table
302a communication unit
302b Participants Determining Department
302c lottery club
302d Error check part
302e Course Registration Table
302f capacity table

Claims (5)

In the applicant lottery system for selecting students who have taken each class from a plurality of applicants who wish to take a plurality of classes,
A capacity table that correlates course codes, class codes, capacity limits, and current capacity,
A course preference table with a provisional decision field and a deletion field;
A class table in which subject codes, class codes, days of the week and lecture times are associated,
An input means for inputting desired course data indicating which priority among the plurality of desired applicants is desired in what priority among the plurality of classes;
Extraction means for extracting the desired course data with the same priority among the desired course data input by the input means;
By searching the capacity table, the number of vacant classes in the class is obtained based on the class code and the class code that are desired to be registered in the desired class data. A judging means for judging whether or not the number is equal to or less than a vacant number of classes desired to be taken in the desired course data;
When it is determined by the determination means that the number of data desired to be taken is not less than or equal to the vacant capacity , a random number is generated for each desired data and the vacant capacity or the new number in the order of the smaller random numbers. Selecting means for selecting the desired number of data corresponding to the number of vacant capacity from the desired data of classes extracted by the extracting means by selecting the desired data for the number of vacant capacity; and
By writing a predetermined value indicating the fact that the course has been decided in the course provisional decision field of the course hope table, the applicant who wants to take courses with the course preference data selected by the selection means is registered. A decision means to decide as a student of a class that is desired to be taken in the desired data;
By searching the lesson table, for each of the applicants, an error determination unit that determines whether there is no thing of the same frame among a plurality of lessons determined as a student by the determination unit;
When it is determined by the error determination means that there are the same class in the plurality of classes, the deletion field of the remaining records excluding the highest priority stored in the registration request table, Canceling means for canceling the determination as a student made by the determining means for the remaining classes other than one of the plurality of classes by writing a predetermined value indicating that the provisional determination of the course has been canceled ,
For classes in which a new vacant capacity has occurred as a result of the cancellation of the decision as a student by the cancellation means , a random number is generated for each desired data, and the vacant capacity or the new By selecting the number of students who want to register for the number of available vacancies, the data for the number of vacancies that are not selected by the selection means among the data desired to be taken in the class will be selected. A second selection means for selecting only the desired data,
Those who wish to take courses with the course preference data selected by the second selection means by writing a predetermined value indicating the fact that the course has already been decided in the course provisional decision field of the course preference table A second determination means for determining as a student of a class for which registration is desired based on the desired data,
A lottery system for applicants, characterized by comprising: If the priority conflict is found, an error check means for creating a priority correction screen and transmitting the data of the screen to the applicant;
  The applicant lottery system according to claim 1, further comprising: A class table, a class table, a class code, a class limit, an upper limit and the current capacity, and a provisional decision field for selecting students from each class among a plurality of applicants who wish to take a plurality of classes A course request table provided with a deletion field, a class table in which subject codes, class codes, day of the week and class hours are associated, input means, extraction means, determination means, selection means, determination means, In the applicant lottery method using a computer comprising an error determination means, a cancellation means, a second selection means, and a second determination means ,
It said input means, an input step of any seeker of the plurality of seeker enters the course desired data indicating wants to take any class among the plurality of classes at how much priority,
An extraction step for extracting the desired course data input in the input step and extracting the same class with the same priority, the extraction means,
The determination means searches the capacity table to obtain a vacant number of classes based on the class codes and class codes that are desired to be registered in the desired class data, and is extracted in the extraction step. A determination step of determining whether or not the number of desired data is less than or equal to the number of available classes in the class desired to be registered in the desired data;
When the selection means determines that the number of desired data to be taken is not less than or equal to the number of available qualifications in the determination step, the selection means generates a random number for each desired data to be taken, and the vacant capacity in order of the smaller random numbers. By selecting the number of desired course data corresponding to the number of new vacancies or the number of new vacancies, the desired data corresponding to the number of vacant capacity is selected from the desired course data extracted in the extraction process. A selection process;
The determination means writes in a predetermined value indicating the fact that the course has already been decided in the course provisional decision field of the course hope table, so that the student desires to take the course with the course desired data selected in the selection process. A decision process in which the applicant is determined as a student of a class that is desired to be registered based on the desired data;
An error determination step in which the error determination means determines whether there is no same class in a plurality of classes determined as students in the determination step for each of the applicants by searching a lesson table. When,
If it is determined in the error determination step that the same class is in the plurality of classes , the cancellation means includes the remaining records except the highest priority stored in the registration request table. By writing a predetermined value indicating that the provisional decision of the course has been cancelled in the deletion field, the decision as a student made in the decision step is made for the remaining lessons except for one of the plurality of lessons. Canceling process to cancel,
The second selection means generates a random number for each desired data for classes in which a new vacant capacity has occurred as a result of cancellation of the decision as a student in the cancellation process, and in order of increasing random numbers. By selecting the desired amount of data for the number of vacancies or the number of new vacancies , among the data desired for the class, those not selected in the selection process, A second selection process for selecting the desired data for the number of new vacancies,
The second decision means writes the predetermined value indicating the fact that the course has already been decided in the course provisional decision field of the course choice table, so that the desired course data selected in the second selection step is used. A second determination step of determining a candidate who wishes to take a course as a student of a class desired to take course based on the desired course data;
Is executed by the computer. In the case where the priority conflict is found, an error check step of creating a priority correction screen and transmitting the data of the screen to the applicant,
  The method according to claim 3, wherein the computer is executed. The program which makes a computer perform the method described in the said Claim 3 or 4 .

Images