Back to results
US 2020/0349526 A1Published application
Method for arranging meeting agenda and computer device employing the same
AssigneeNanning Fugui Precision Industrial Co., Ltd.
InventorsYOU-WEI TENG, KO-LO CHEN
Life of this patent
Estimating the term…
Abstract
A method applied in a computing device for arranging a meeting agenda includes obtaining combinations of m agenda items by applying permutations and combinations to the m agenda items. Partial combinations from all combinations of the m agenda items are determined. Once score values of each of the partial combinations are calculated, and combinations are selected from the partial combinations, the selected combinations are output as the meeting agenda. The present disclosure can optimize the arrangement of the meeting agenda to save time for participants of a meeting.
Claims20
A method for arranging a meeting agenda applied to a computer device, the method comprising:
- determining meeting related information in response to user input, wherein the meeting related information comprises m agenda items of a meeting;
- obtaining combinations of the m agenda items by permutations and combinations of the m agenda items;
- selecting X number of combinations from all combinations of the m agenda items;
- calculating a first score value of each combination of the X number of combinations according to the meeting related information, and obtaining X number of first score values;
- calculating a total score value of the X number of first score values;
- calculating a probability value P of each combination of the X number of combinations according to the first score value of the each of the X number of combinations and the total score value, and obtaining X number of probability values P;
- selecting two combinations from the X number of combinations according to the probability value P of each combination of the X number of combinations, and obtaining two selected combinations;
- processing the two selected combinations using a predetermined algorithm, and obtaining two processed combinations;
- selecting two agenda items from the m agenda items of one combination of the two processed combinations, interchanging positions of the two agenda items in the one combination, and obtaining a further processed combination;
- selecting two agenda items from the m agenda items of another combination of the two processed combinations, interchanging positions of the two agenda items in the another combination, and obtaining another further processed combination, such that two further processed combinations are obtained;
- obtaining X number of further processed combinations, wherein X is a multiple of 2;
- calculating a second score value of each combination of the X number of further processed combinations based on the meeting related information, thereby X number of second score values are obtained;
- determining a maximum score value from the X number of second score values, and obtaining the maximum score value from the X number of second score values;
- outputting the combination of the m agenda items corresponding to each of Y number of maximum score values that are consecutively obtained, wherein each of the Y number of maximum score values is same.
11 more elements
A computer device comprising:
- a storage device;
- at least one processor;
- and
- the storage device storing one or more programs, which when executed by the at least one processor, cause the at least one processor to:
- determine meeting related information in response to user input, wherein the meeting related information comprises m agenda items of a meeting;
- obtain combinations of the m agenda items by permutations and combinations of the m agenda items;
- select X number of combinations from all combinations of the m agenda items;
- calculate a first score value of each combination of the X number of combinations according to the meeting related information, and obtain X number of first score values;
- calculate a total score value of the X number of first score values;
- calculate a probability value P of each combination of the X number of combinations according to the first score value of the each of the X number of combinations and the total score value, and obtaining X number of probability values P;
- select two combinations from the X number of combinations according to the probability value P of each combination of the X number of combinations, and obtain two selected combinations;
- process the two selected combinations using a predetermined algorithm, and obtain two processed combinations;
- select two agenda items from the m agenda items of one combination of the two processed combinations, interchange positions of the two agenda items in the one combination, and obtain a further processed combination;
- select two agenda items from the m agenda items of another combination of the two processed combinations, interchange positions of the two agenda items in the another combination, and obtain another further processed combination, such that two further processed combinations are obtained;
- obtain X number of further processed combinations, wherein X is a multiple of 2;
- calculate a second score value of each combination of the X number of further processed combinations based on the meeting related information, thereby X number of second score values are obtained;
- determine a maximum score value from the X number of second score values, and obtaining the maximum score value from the X number of second score values;
- output the combination of the m agenda items corresponding to each of Y number of maximum score values that are consecutively obtained, wherein each of the Y number of maximum score values is same.
15 more elements
A non-transitory storage medium having instructions stored thereon, when the instructions are executed by a processor of a computer device, the processor is configured to perform a method of arranging a meeting agenda, wherein the method comprises:
- determining meeting related information in response to user input, wherein the meeting related information comprises m agenda items of a meeting;
- obtaining combinations of the m agenda items by permutations and combinations of the m agenda items;
- selecting X number of combinations from all combinations of the m agenda items;
- calculating a first score value of each combination of the X number of combinations according to the meeting related information, and obtaining X number of first score values;
- calculating a total score value of the X number of first score values;
- calculating a probability value P of each combination of the X number of combinations according to the first score value of the each of the X number of combinations and the total score value, and obtaining X number of probability values P;
- selecting two combinations from the X number of combinations according to the probability value P of each combination of the X number of combinations, and obtaining two selected combinations;
- processing the two selected combinations using a predetermined algorithm, and obtaining two processed combinations;
- selecting two agenda items from the m agenda items of one combination of the two processed combinations, interchanging positions of the two agenda items in the one combination, and obtaining a further processed combination;
- selecting two agenda items from the m agenda items of another combination of the two processed combinations, interchanging positions of the two agenda items in the another combination, and obtaining another further processed combination, such that two further processed combinations are obtained;
- obtaining X number of further processed combinations, wherein X is a multiple of 2;
- calculating a second score value of each combination of the X number of further processed combinations based on the meeting related information, thereby X number of second score values are obtained;
- determining a maximum score value from the X number of second score values, and obtaining the maximum score value from the X number of second score values;
- outputting the combination of the m agenda items corresponding to each of Y number of maximum score values that are consecutively obtained, wherein each of the Y number of maximum score values is same.
11 more elements
Dependencies are inferred from the claim text.