公开(公告)号：US20250061170A1

公开(公告)日：2025-02-20

申请号：US18787013

申请日：2024-07-29

Applicant: Fujitsu Limited

Inventor： Kazuhiro MATSUMOTO

IPC: G06F18/211

Abstract: A recording medium stores a program for causing a computer to execute processing including: generating rules that indicates an answer pattern to questions included in questions, based on questionnaire data that indicates answers of respondents to each of the questions in a conducted questionnaire survey; specifying a respondent who has provided a correct answer that is same as an answer pattern to a question indicated in a rule, for each of the rules, based on the questionnaire data; and determining a first rule selection pattern, based on the number of questions included in selected rules, from among rule selection patterns that satisfy a first constraint condition that each of the respondents is specified as the respondent who has provided the correct answer by any one of the single or the selected rules, among rule selection patterns generated by selecting the single or the rules from among the rules.

公开(公告)号：US20160171571A1

公开(公告)日：2016-06-16

申请号：US14940812

申请日：2015-11-13

Applicant: FUJITSU LIMITED

Inventor： Yuhei UMEDA ,  Yoshinobu MATSUI ,  Kazuhiro MATSUMOTO ,  Hirokazu ANAI ,  Isamu WATANABE

IPC: G06Q30/06

CPC classification number: G06Q30/0605

Abstract: A planning method for planning to order a product, the planning method being executed by a computer, the planning method includes: generating a predicted value of a demand of the product at each plurality of prices based on a selling price and a number of sales in association with each other for each past sale date; calculating an order quantity that yields a highest profit, for each of the plurality of prices, using the predicted value of the demand of the product at the plurality of prices; storing, for the plurality of prices, the calculated order quantity and a profit in association with each other into a memory; and identifying a combination of a price and an order quantity that yields the highest profit, with reference to the memory.

Abstract translation: 一种计划订购产品的计划方法，由计算机执行的规划方法，所述规划方法包括：基于销售价格和销售数量，在每个多个价格中生成产品的需求的预测值 每个过去的销售日期彼此关联; 使用所述多个价格的所述产品的需求的预测值来计算对于所述多个价格中的每一个产生最高利润的订单数量; 将多个价格中的计算出的订单数量和利润相关联地存储到存储器中; 并且参考记忆来确定产生最高利润的价格和订单数量的组合。

公开(公告)号：US20240233169A1

公开(公告)日：2024-07-11

申请号：US18611148

申请日：2024-03-20

Applicant: FUJITSU LIMITED

Inventor： Kazuhiro MATSUMOTO ,  Hiroyuki HIGUCHI ,  Shun KOHATA ,  Katsumi HOMMA ,  Fumiyasu MAKINOSHIMA

IPC: G06T7/70 ,  G06V10/764 ,  G06V20/50 ,  G06V20/70

CPC classification number: G06T7/70 ,  G06V10/764 ,  G06V20/50 ,  G06V20/70 ,  G06T2207/20081 ,  G06T2207/20084 ,  G06T2207/30184 ,  G06T2207/30196 ,  G06V2201/08

Abstract: A non-transitory computer-readable recording medium storing a water inundation depth determination program for causing a computer to execute processing including: detecting a first type of a target and a first submersion position of the target included in a first captured image; and outputting a first submersion depth corresponding to the first type and the first submersion position by referring to depth information in which a depth is associated with a pair of a type and a submersion position.

公开(公告)号：US20230129842A1

公开(公告)日：2023-04-27

申请号：US17891137

申请日：2022-08-19

Applicant: FUJITSU LIMITED

Inventor： Kazuhiro MATSUMOTO ,  Masatoshi OGAWA ,  Hitoshi YANAMI ,  Noriyasu ASO ,  Hiromitsu SONEDA ,  Katsumi HOMMA ,  Natsuki ISHIKAWA ,  Hayato Dan

IPC: G06Q30/02

Abstract: A non-transitory computer-readable recording medium stores a program for causing a computer to execute a process, the process includes generating a plurality of causal relationship candidates each including a pair of a first answer candidate to each of at least some of first questions and a second answer candidate to one of second questions based on questionnaire result data, and searching for a solution of a combinatorial optimization problem that minimizes or maximizes a value of an objective function of which the value changes according to causal relationship candidates to be combined, under a constraint condition such that a predetermined ratio of respondents or more of the plurality of respondents have answers that are same as the pair of the first answer candidate and the second answer candidate of any one of the causal relationship candidates to be combined.