JP2012185706A - Contest judging server device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a contest judging server device used in a contest to which entry and voting can be done by access from a communication terminal through a network.SOLUTION: A contest judging server device comprises; an application program applying from a communication terminal; a vote program composed of a preliminary round and a final; and a CPU executing the application program and the vote program. The application program accepts user registration and application from the communication terminal, the vote program executes a vote for judging the preliminary round by each judging group unit with n persons generated from application data which is generated by the application program, and the CPU generates an order list for a consolation contest from score data of losers of a same level or a lower level using the vote program in the preliminary round. When application is started, applicant groups with prescribed n persons (for example, 9 persons) each are formed, and a higher judging group is automatically generated when a prescribed number of persons among an application group win.

Description

  The present invention relates to a contest screening server apparatus that automatically processes up to the final match for application / voting from a mobile terminal or PC terminal via a network.

  As a contest system for voting via a network using a server device, those listed in Patent Documents 1 to 3 are known.

  Patent Document 1 discloses a contest server via an Internet communication network, a packet processing unit for performing NTT DOCOMO's “i-mode” (registered trademark) communication via a packet communication network, a display for displaying images and characters, and character input. A contest system is disclosed that includes a mobile phone having an input unit for performing the above.

  In particular, in Patent Document 1, an audition applicant and voter operate the mobile phone to execute an audition application and voting program for access via the communication interface unit, and the voter operates. The mobile phone displays, on the display unit, a screen for simultaneously displaying images of all applicants who are a plurality of selected people in a format in which one image corresponds to one key button, There is a description that an image of a specific applicant is displayed on the display unit in an enlarged manner by selecting the image by a key button on the screen.

  Patent Document 2 collects the applicants selected in the low-level examinations by dividing the examination by voting at each stage of the audition as shown in FIG. 5 into examination groups consisting of multiple applicants. A program that leads to the final match by conducting a high-level screening, a program that prevents duplicate registration from the same mobile phone in the screening group unit by identifying the ID, and a high-level during the low-level screening A first-in first-out multiple voting program that continues high-level audits while the number of people making up the audit group for the next screening has gathered, and a program that excludes screening groups that have been audited from display There are descriptions to include.

  Patent Document 3 uses an application server connected to a network and a mobile phone provided with an ID, and the application server includes a CPU for executing an audition application and voting program. Dividing the screening by stage voting into screening groups consisting of multiple applicants, collecting the applicants selected in the low-level screening, conducting a high-level screening and leading to the final game, A program that prevents duplicate registration from the same mobile phone in the screening group unit by identifying the ID, and the number of people who constitute the screening group of the higher screening in the middle of the lower screening, The first-in, first-out multiple voting program, which continues the screening of the high-level screening, and the applicants who were not selected in the low-level screening There is a description that contains the consolation of programs incorporating the applicants selected from among the higher-order of examination.

JP 2010-157020 (Patent No. 431824) JP 2010-282313 (Patent No. 4338779) JP2010-282321

In the above Patent Documents 1 to 3, when one group displayed on the screen of a communication terminal such as a mobile phone is composed of n people and the total number of applicants is m, m is not necessarily a multiple of n. Since it is not limited, the last remaining group is not necessarily composed of n people, and there remains a problem in its processing.
In addition, when proceeding from a lower examination to a higher examination, it was not completed as a system because it was not possible to determine at which point the final match would be reached.

  In the present invention, when the number of members constituting each group is n, and the total number of applicants is m, it is possible to perform the final match with an automatic program even when m is not a multiple of n. It was.

  In order to solve the above-described problems, the contest screening server device according to the present invention is configured such that a communication terminal can enter and vote for a contest by accessing a predetermined server computer via a network. The server device has an application program for applying from a communication terminal, a voting program composed of qualifying and finals, and a CPU for executing the application program and the voting program. The application program is used from the communication terminal. The registration program and the application are accepted, and the voting program executes a qualifying examination vote for each n examination groups generated from the application data generated by the application program. The CPU uses the voting program in qualifying to generate a loser resurrection ranking list from the score data of the same or lower level losers. Furthermore, when the number of people making up each group is n when the preliminary screening at each examination level is completed, and the number of the first group that is selected in the examination vote and proceeds to the next examination level becomes n or less Will make a final round of the examination at the examination level, and if the number of people to be judged becomes (n + 1) or more, a qualifying group will be generated, and the qualifying examination will be executed at the next examination level. (N + 1) If the number of persons to be examined is not a multiple of n, n persons who have extracted the remaining shortage by dividing the number of persons to be examined by n and added them to the odds group. The next qualifying examination was executed.

  In addition, the program can be considered to stop accepting voting when the number of votes obtained by the most votes in each examination group reaches a predetermined number.

  In the present invention, the audition can be automatically completed using a computer system in accordance with the time calculated in advance, so that the applicant does not need to go to the audition venue even in the final match, and the winner is automatically selected. It becomes possible to decide.

It is a figure of the contest screening server apparatus which concerns on this invention. It is a figure which shows the time series process of a contest system. It is a figure which shows the screening process in case the total number of applications m is 111. It is a figure which shows the flowchart of loser resurrection. It is a figure which shows the example of the conventional audition voting system.

  The best mode for carrying out the present invention will be described below in detail with reference to the drawings. In the following description, components having the same function are denoted by the same reference numerals, and repeated description thereof is omitted.

  FIG. 1 is a diagram of a contest screening server device according to the present invention. The contest judged by the contest judging server device 1 is composed of a qualifying and a final match.

  The contest screening server device 1 includes an access terminal ID detection function, a time management function, and a loser resurrection ranking list creation function, and can automatically screen up to the final game.

In the following, in the contest screening, one group consists of n persons, and A person is selected from each group. Assuming that the total number of applications is m, if there are B groups of n people among m people and the remainder less than n is α people, the following formula is established.
m = n × B + α (1)

  The contest screening server device 1 executes an application program for applying from a communication terminal using the CPU of the application server 5 and a voting program composed of a qualifying and a final match.

  The application program accepts user registration and application from the communication terminal after authenticating the ID of the access terminal.

  The contest screening server device 1 is composed of a network 2, a base station 3 of a mobile phone having a base station antenna, and an application server 5 on the network 2 having a database 6 having storage means for contest related information. A communication terminal 4 is connected to the base station 3.

  The communication terminal 4 includes a mobile phone 4a, a mobile terminal 4b, a smartphone, a desktop computer 4c, a notebook computer 4d, and the like.

  A general-purpose server computer can be used as the hardware of the application server 5 which is a main component of the contest screening server device 1, and includes a CPU, ROM, RAM, HDD (hard disk), BIOS, and communication interface unit (COM I / F). And an input unit such as a keyboard KB and a mouse MS, and a display DSP. Of these, ROM, RAM, HDD (hard disk), BIOS, and communication interface unit (COM I / F) are connected to the CPU via a bus, and the keyboard KB and mouse MS are connected via a human interface HI / F. It is connected to the CPU.

In the above configuration, a ROM (Read Only Memory) is a read-only storage device that stores a system program. The ROM stores an ID detection program for an access terminal, a time management program, a first-in first-out winning contest program, and a loser resurrection rank list creation program.
Here, the first-in first-out winning contest program is a unit screening group for the second qualifying (higher screening) according to the number of winners (number of works) in the first qualifying (lower screening) in conducting the tournament-type contest. The second screening (high-level screening) will be started when is configured.

  Basically, it is desirable to store the program in a local server and execute it on the application server 5, but in the case of distributed processing or cloud computing processing, the program may be distributed or linked.

  The ID detection program of the access terminal is a program that obtains identification information from a communication terminal such as an access source mobile phone or a personal computer.

  For example, the mobile phone 4a and the mobile terminal 4b contain a SIM card. Since the SIM card stores a unique ID number for identifying the telephone number of a mobile phone of a system such as GSM or W-CDMA, if the command is sent from the outside to the SIM card, the ID number is Sent out.

  In the case of the desktop computer 4c, the smartphone, and the notebook computer 4d, the user is specified by the ID or password.

  A CPU (Central Processing Unit) is activated by a system program stored in a BIOS or ROM, and has a function of executing various processes according to a program (application program) developed in a RAM (Random Access Memory).

  The CPU also has a function of causing the display to display the calculation result of the system program, etc., using a signal from the input unit as a trigger.

  The RAM has a function of appropriately storing programs and data necessary for the CPU to execute various processes.

  The communication interface manages the input / output of the hard disk, the communication unit interface unit, the input unit 18, and the display.

  The display DSP is composed of a CRT, LCD, or the like, and has a function of displaying CPU calculation results and external input data under the control of the CPU.

  The CPU, ROM, RAM, hard disk, communication interface unit, input unit such as a keyboard and mouse, and display are connected to each other around the CPU via a bus.

  The mobile phone base station 3 is a facility installed for the purpose of wirelessly connecting to the mobile phone 4a, the communication terminal 4b, and the like, and is managed by a mobile phone operator. The mobile station 4a and the communication terminal 4b in the cell (micro cell in the case of PHS) covered by the base station 3 serve to transmit information to each other by wireless communication.

  The server 5 is a component that executes processing related to audition application reception and voting. The server 5 also functions as a WWW server that provides a Web site (hereinafter referred to as a “contest site”) that provides a Web page for executing functions according to various means or steps of the present invention on the Internet WWW. .

  The mobile phone 4 of the audition applicant and voter includes a connection interface unit with a network, a mail transmission / reception unit, a display unit, a character input unit, and a transmission / reception unit.

  The mobile phone 4 has a communication function with the base station 3 of the mobile phone, an SSL communication function for browsing a browser and sending / receiving mail via the network 2, and a function for receiving screen information of the audition site and displaying it on the screen. , It has a selection means when voting by audition.

  FIG. 2 is a diagram showing a time series process of the contest system. Unlike normal auditions, when an application is started, an applicant group is formed for each n people (for example, 9 people), and a high-level screening group is automatically generated when a given number of people wins from this application group. Therefore, there is a feature of the automatic examination system according to the present invention in that the examination time of the low-order examination group and the examination time of the high-order examination group are not so different.

  In the automatic judging system in the present embodiment, four qualifying rounds and one final round are held, but as will be described later, each voting vote is carried out in units of n judging groups. It is determined by the numbers of n and A and the total number of applications, and is not limited to four times.

  The voting program executes a qualifying screening vote for each n screening groups generated from the application data generated by the application program.

  The CPU uses the voting program in qualifying to generate a loser resurrection ranking list from the same or lower level loser database.

  When the number of persons subject to examination at the next examination level becomes n or less at the time of qualifying examination at each examination level, the examination at the examination level is regarded as the final match. Here, n = 1 is not possible. When n = 1, it means that the previous vote is the final match.

  When the number of screening subjects is (n + 1) or more, the preliminary screening is executed at the next screening level, and the final match is executed after the preliminary screening is repeated until the screening level is less than n.

  In the above, if the number of subjects to be examined of (n + 1) or more is not a multiple of n, the insufficient number of people obtained by dividing the number of subjects to be examined by n is extracted from the loser resurgence ranking list to be a half number group. The next qualifying examination will be performed with the added n people. If the number of people to be examined becomes n or less at the end of this examination, the final round will be voted for.

  However, if the number of people to be examined is still (n + 1) or more, the qualifying is repeated until the number of people to be examined becomes n or less. When the number of people to be examined becomes n or less, Perform a review vote.

  FIG. 3 is a diagram showing a screening process when the total number of applicants is 111. The predetermined number n of members of the examination group of the present invention can be arbitrarily set. In the following, it is assumed that a group of nine applicants is formed.

  If the application deadline for the first examination is t1, the actual number of examinations for the first examination after t1 must be a multiple of 9, so 6 out of 3 people who divided 111 people by 9 The first examination can be substantially completed by executing the process by reviving the loser.

  The 2nd screening is a total of 12 people selected from 12 groups, which is the quotient 12 of 111 people divided by 9 people, and 3 people selected from the group of 9 people who recovered the losers. 39 people will be judged.

  In the second screening, groups of 39 to 9 people can be created, 4 groups G1 to G4, but the remaining 3 people G4 cannot form a group of 9 people. A total of 9 people will be revived from the judging loser resurrection order list, and the group G5 will be judged.

Here, as a general rule, the revival of the loser is restored from one examination lower than the examination, but in the case of the first examination, there is no examination lower than this.
Therefore, in this example, when the primary examination is closed, the total number of people is known, and as a result, the number of people missing in the final examination group of the secondary examination is also known. In addition, the recovery of the losers of the first and second rounds was selected and selected from the winners of the first round.
Specifically, if there are 3 shortages in the final screening group of the 2nd screening and 6 shortages in the final screening group of the 1st screening, the top 3 people on the list of losers in the primary screening are Allocating to the shortage of the final examination group of the final examination, the 6th person from the top 4 to the 9th in the list of lost losers of the primary examination is assigned to the shortage of the final examination group of the primary examination.

  In the 3rd screening, 15 people are selected from 5 groups of the 2nd screening, so this group of 15 to 9 people can make only one group G101. Therefore, the remaining 6 people and the 3 people from the list of losers in the secondary examination form another group G102 to vote.

  In the third screening, three people from two groups, six people in total, will be selected and less than n people, so these six people will vote for the final match and decide the winner and runner-up.

  FIG. 4 is a diagram showing a flowchart of the present application. In the case where n persons are selected for the number of persons constituting one examination group, examination is started in step S01, and examination is started for each predetermined n persons. The predetermined number n is 9, for example. The examination is performed in parallel, and the three candidates who satisfy the predetermined condition proceed to the next secondary examination.

  In step S02, voting is automatically executed in order from the first screening, and a process of selecting a predetermined number of persons from a predetermined number of screenings and proceeding to the next screening stage is repeated.

  In step S03, the number of people (x) constituting the last group at the time of application deadline for the primary examination is x ≦ n.

  In step S04, it is determined whether x = n. If x = n, the process proceeds to the second qualifying without making up for the shortage. If x = n, the shortage is made up from the loser recovery list in steps S05 and S06.

  In step S07, a secondary examination is performed in the same manner as described above. When the number of persons who advance to the next examination level becomes n or less, a final game is conducted, and a selection result is announced in step S08.

  Here, as the number of contest entries and voting increases, the processing capacity of the server becomes a problem, and it is usually necessary to scale up to a server with a large capacity. But real-time programs like contests don't stop.

  The above example is an example of a contest for people such as a beauty contest, and the examination group is n people. For example, in the case of a haiku contest, the application unit is “phrase” instead of “people”. Yes, in the case of a photo contest, “sheet” is the unit, and various contests can be targeted by replacing the unit of this embodiment.

  By using screen listing on mobile phones with a high penetration rate and conducting multiple stages of screening simultaneously, all contests with short examination time are automatically processed from qualifying to the final round, saving labor. Can contribute.

DESCRIPTION OF SYMBOLS 1 ... Contest screening server apparatus, WEB server 2 ... Network 3 ... Mobile phone base station 4 ... Communication terminal 4a ... Mobile phone 4b ... Mobile terminal 4c ... Desktop computer 4d ... Notebook computer 5 ... Application server 6 ... Database ( file server)
7 ... load balancer 8 ... server group

Claims (1)

In a server device configured such that a communication terminal can enter and vote for a contest by accessing a predetermined server computer via a network,
Each examination in the contest is a group examination, and one examination group other than the final game is composed of n persons, and a predetermined number of persons are selected from each group.
The server device has an application program for applying from a communication terminal, a voting program composed of a qualifying and a final game, and a CPU for executing the application program and the voting program,
The application program accepts user registration and application from the communication terminal,
The voting program executes a qualifying examination vote for each n examination groups generated from the application data generated by the application program,
The CPU uses the voting program in qualifying to generate a loser resurrection ranking list from the score data of the same level or lower level losers,
At the end of the preliminary screening at each screening level,
If the number of people who are selected in the examination ballot and proceed to the next examination level is less than n, the examination at that examination level will be the final match,
If the number of screening subjects is (n + 1) or more, a preliminary screening is performed at the next screening level, and if the number of screening subjects of (n + 1) or more is not a multiple of n, A contest screening server device in which the next preliminary screening is executed by n persons who are extracted from the loser resurrection rank list and added to the odd number group by extracting a surplus number of persons obtained by dividing the number of screening objects by n.

Images