公开(公告)号：US20130345889A1

公开(公告)日：2013-12-26

申请号：US13533325

申请日：2012-06-26

申请人： Takayuki Osogami ,  Hiroki Yanagisawa

发明人： Takayuki Osogami ,  Hiroki Yanagisawa

IPC分类号： G06F1/26

CPC分类号： G05B15/02 ,  G05B2219/2614

摘要： A method of meeting a power demand of a power consumption unit is disclosed. A forecasted power demand for a power demand scenario for the power consumption unit is determined and a probability of occurrence of the power demand scenario is determined. An objective function for operating at least one power supply device is created that includes the forecasted power demand of the power demand scenario and the determined probability of occurrence of the power demand scenario. A substantial minimum of the objective function is located to determine a schedule for operating the at least one power supply device to meet the forecasted power demand. The at least one power supply device may be operated according to the determined schedule to meet the power demand of the power consumption unit.

公开(公告)号：US20090119632A1

公开(公告)日：2009-05-07

申请号：US12262275

申请日：2008-10-31

申请人： Makoto Kano ,  Akio Koide ,  Takayuki Osogami ,  Toshihiro Takahashi ,  Takeo Yoshizawa

发明人： Makoto Kano ,  Akio Koide ,  Takayuki Osogami ,  Toshihiro Takahashi ,  Takeo Yoshizawa

IPC分类号： G06F17/50

CPC分类号： G06Q10/06

摘要： A system and method which support determination of a design process order. The system includes: a storage device that stores constraint data indicating a strength of a constraint that is given to a respective design process from a respective of the other design processes; a detection unit that accesses the storage device to detect, from the constraint data, a loop of relationships concerning a design process receiving a constraint from another design process; a selection unit that accesses the storage device to select, from the detected loop, a pair capable of canceling the loop when the pair is deleted and having a minimum total constraint strength; and an output unit that deletes the selected constraint pair from the constraint data and outputs data indicating a constraint that is to be satisfied by each design process.

摘要翻译： 支持设计流程订单确定的系统和方法。 该系统包括：存储装置，其存储指示从相应的其他设计过程给予相应设计过程的约束的强度的约束数据; 检测单元，其访问所述存储设备，以从所述约束数据中检测关于从另一设计过程接收约束的设计过程的关系循环; 选择单元，其从所述检测到的环路访问所述存储装置，以便在所述对被删除并且具有最小的总约束强度时能够取消所述环路的对; 以及输出单元，其从约束数据中删除所选择的约束对，并输出指示每个设计处理要满足的约束的数据。

公开(公告)号：US09317022B2

公开(公告)日：2016-04-19

申请号：US13553404

申请日：2012-07-19

申请人： Takayuki Osogami ,  Hiroki Yanagisawa

发明人： Takayuki Osogami ,  Hiroki Yanagisawa

IPC分类号： G05F5/00 ,  G05B15/02

CPC分类号： G05B15/02 ,  G05B2219/2614

摘要： A method of meeting a power demand of a power consumption unit is disclosed. A forecasted power demand for a power demand scenario for the power consumption unit is determined and a probability of occurrence of the power demand scenario is determined. An objective function for operating at least one power supply device is created that includes the forecasted power demand of the power demand scenario and the determined probability of occurrence of the power demand scenario. A substantial minimum of the objective function is located to determine a schedule for operating the at least one power supply device to meet the forecasted power demand. The at least one power supply device may be operated according to the determined schedule to meet the power demand of the power consumption unit.

摘要翻译： 公开了一种满足功耗单元的电力需求的方法。 确定用于功率消耗单元的功率需求情景的预测功率需求并确定功率需求情景的发生概率。 创建用于操作至少一个电力供应装置的目标函数，其包括电力需求情景的预测电力需求和所确定的电力需求情景发生概率。 位于目标功能的实质上最小的是确定用于操作至少一个电源设备以满足预测的功率需求的时间表。 所述至少一个电源装置可以根据确定的时间表来操作以满足功耗单元的功率需求。

公开(公告)号：US08942962B2

公开(公告)日：2015-01-27

申请号：US13101281

申请日：2011-05-05

申请人： Takayuki Osogami ,  Shoko Suzuki

发明人： Takayuki Osogami ,  Shoko Suzuki

IPC分类号： G06G7/76 ,  G08G1/01

CPC分类号： G08G1/0112

摘要： A method, system and computer program product for measured value simulation. The method including the steps of: observing measured values of an event to provide observed values, where the step of observing starts at a predetermined observation time; concurrently running a plurality of simulations, where the simulations have behaviors that are characterized by different parameters and start at the predetermined observation time; producing a discrete distribution at a predetermined timing after the predetermined observation time, where the discrete distribution are based on distances between the measured values provided by the predetermined timing and calculation of the simulations; and producing a second plurality of simulations based on the discrete distribution.

摘要翻译： 一种用于测量值模拟的方法，系统和计算机程序产品。 该方法包括以下步骤：观察事件的测量值以提供观察值，其中观察步骤在预定观察时间开始; 同时运行多个模拟，其中模拟具有由不同参数表征并且在预定观察时间开始的行为; 在预定观察时间之后的预定定时产生离散分布，其中离散分布基于由预定定时提供的测量值与模拟计算之间的距离; 以及基于离散分布产生第二多个模拟。

公开(公告)号：US08914795B2

公开(公告)日：2014-12-16

申请号：US13359825

申请日：2012-01-27

申请人： Takayuki Osogami ,  Raymond H. Rudy

发明人： Takayuki Osogami ,  Raymond H. Rudy

IPC分类号： G06F9/455 ,  G06F9/46 ,  G06F15/173 ,  G06F9/50

CPC分类号： G06F9/45558 ,  G06F9/5066 ,  G06F9/5077 ,  G06F2009/4557 ,  G06F2209/5019

摘要： An information processing apparatus having a prediction section that determines the predicted peak usage amount of physical resources for each time interval for individual clusters each including a plurality of virtual machines having the same function; a setting section sets a constraint that ensures that, for individual combinations of a first physical machine, a second physical machine, and a time interval, the total predicted peak usage amount of a physical resource predicted for the first physical machine if the second physical machine stops during the time interval does not exceed a physical resource amount prepared for the first physical machine; and an allocation-configuration deriving section derives an allocation configuration by calculating, in accordance with the constraint, a solution to an optimization problem for minimizing, as an objective function, the sum total of the physical resource amounts of all of physical machines to which the virtual machines are allocated.

摘要翻译： 一种信息处理装置，具有：预测部，其对于每个包含具有相同功能的多个虚拟机的各个簇确定每个时间间隔的物理资源的预测峰值使用量; 设置部分设置一个约束，其确保对于第一物理机器，第二物理机器和时间间隔的单独组合，如果第二物理机器预测的第一物理机器预测的物理资源的总预测峰值使用量 在时间间隔期间停止不超过为第一物理机准备的物理资源量; 并且分配配置导出部分通过根据约束计算优化问题的解决方案来导出分配配置，以使作为目标函数的所有物理机器的物理资源量的总和最小化为 分配虚拟机。

公开(公告)号：US20120330884A1

公开(公告)日：2012-12-27

申请号：US13603459

申请日：2012-09-05

申请人： Mikael F. Onsjö ,  Takayuki Osogami

发明人： Mikael F. Onsjö ,  Takayuki Osogami

IPC分类号： G06N5/02

CPC分类号： G06N7/005 ,  G06Q40/00

摘要： A method and system for deciding an optimal action in consideration of risk. The method includes the steps of: generating sequentially, by way of a Markov decision process based on a Monte Carlo method, a series of data having states on a memory of a computer; computing a risk measure of a present data by tracking generated data from opposite order to generation order, where the risk measure is calculated from a value at risk or an exceedance probability that is derived from risk measures of a plurality of states transitionable from a state of the present data; and executing the step of computing the risk measure while tracking back to starting data, where at least one of the steps is carried out using a computer device.

摘要翻译： 考虑风险决定最佳行为的方法和系统。 该方法包括以下步骤：通过基于蒙特卡罗方法的马尔科夫决定过程顺序生成一系列在计算机的存储器上具有状态的数据; 通过跟踪从生成顺序的相反顺序生成的数据来计算当前数据的风险度量，其中风险度量是根据风险值计算的，或者是从多个状态的风险度量中得出的超出概率，该多个状态可以从 现有数据; 以及执行在跟踪回到开始数据的同时计算风险度量的步骤，其中使用计算机设备执行至少一个步骤。

公开(公告)号：US20120239453A1

公开(公告)日：2012-09-20

申请号：US13416275

申请日：2012-03-09

申请人： Takayuki Osogami

发明人： Takayuki Osogami

IPC分类号： G06Q10/06

CPC分类号： G06Q50/06 ,  G06Q10/04 ,  G06Q10/06 ,  G06Q30/0283

摘要： Apparatus and method use a Markov decision process (MDP) to reduce the cost of variations in electric power usage. The user notifies a power company of a predicted value for a period. The period is divided into subsections. For each subsection, on the basis of a MDP including a state that depends on an electric power usage amount error, charge amount, and set target, the amount of charging and discharging of a storage battery as an action at any given time is optimally decided depending on the electric power usage amount error, charge amount, time, and set target at that time. A predetermined time in a subsection is a target setting time, at which a future target is further set as the action. The action includes deciding the charging and discharging amount in that subsection and deciding a future target in a subsection whose target should be set.

摘要翻译： 装置和方法使用马尔可夫决策过程（MDP）来降低电力使用变化的成本。 用户通知电力公司一段时间内的预测值。 期间分为小段。 对于每个小节，基于包括依赖于电力使用量误差，充电量和设定目标的状态的MDP，作为任何给定时间的动作的蓄电池的充放电量被最佳地确定 取决于当时的电力使用量误差，充电量，时间和设定目标。 子部分中的预定时间是目标设定时间，在将来目标进一步设定为动作。 该行动包括决定该款的充电和放电量，并确定应设定其目标的小节中的未来目标。

公开(公告)号：US20070282578A1

公开(公告)日：2007-12-06

申请号：US11443571

申请日：2006-05-31

申请人： Takayuki Osogami ,  Toshinari Itoko

发明人： Takayuki Osogami ,  Toshinari Itoko

IPC分类号： G06G7/48

CPC分类号： G06F9/44505 ,  G06F11/3452

摘要： A better configuration for a computerized system is determined by performing a first stage and a second stage. In the first stage, the performance of each system configuration, including candidate configurations and a standard configuration, is evaluated, and the number of scenarios needed in the second stage is determined. In the second stage, the performance of each scenario of the standard configuration is evaluated, and the mean thereof is determined. For each candidate configuration, the performance of each scenario of the candidate configuration is evaluated, and the mean thereof is determined. Where the candidate configuration's mean is greater than the standard configuration's mean by a threshold, it is selected as the better configuration. Where no candidate configuration's mean is greater than the standard configuration's mean by the threshold, the standard configuration is selected as the better configuration.

摘要翻译： 通过执行第一阶段和第二阶段来确定计算机化系统的更好的配置。 在第一阶段，评估每个系统配置的性能，包括候选配置和标准配置，并确定第二阶段所需的场景数量。 在第二阶段中，评估标准配置的每个场景的性能，并且确定其平均值。 对于每个候选配置，评估候选配置的每个场景的性能，并且确定其平均值。 在候选配置的平均值大于标准配置的平均值阈值的情况下，将其选为更好的配置。 如果候选配置的平均值不超过标准配置的平均值阈值，则选择标准配置作为更好的配置。

公开(公告)号：US08914797B2

公开(公告)日：2014-12-16

申请号：US13590651

申请日：2012-08-21

申请人： Takayuki Osogami ,  Raymond H. Rudy

发明人： Takayuki Osogami ,  Raymond H. Rudy

IPC分类号： G06F9/455 ,  G06F9/46 ,  G06F15/173 ,  G06F9/50

CPC分类号： G06F9/45558 ,  G06F9/5066 ,  G06F9/5077 ,  G06F2009/4557 ,  G06F2209/5019

摘要： A computer-executable method for determining an allocation configuration for allocating virtual machines to physical machines. The method includes the steps of determining a predicted peak usage amount of physical resources for each time interval for individual clusters wherein the clusters include a plurality of virtual machines; setting a constraint that ensures the total predicted peak usage amount of the physical resource predicted for the first physical machine does not exceed the physical resource amount for the first physical machine; and deriving an allocation configuration by calculating, in accordance with the constraint, a solution to an optimization problem for minimizing, as an objective function, the sum total of the physical resource amounts of the plurality of physical machines to which the virtual machines are allocated.

摘要翻译： 一种用于确定用于将虚拟机分配给物理机器的分配配置的计算机可执行方法。 该方法包括以下步骤：确定每个群集的每个时间间隔的物理资源的预计峰值使用量，其中，群集包括多个虚拟机; 设置一个约束，确保为第一物理机预测的物理资源的总预测峰值使用量不超过第一物理机的物理资源量; 以及通过根据所述约束计算解决最优化问题来导出分配配置，以使作为目标函数的虚拟机被分配到的多个物理机的物理资源量的总和最小化。

公开(公告)号：US20130085974A1

公开(公告)日：2013-04-04

申请号：US13589407

申请日：2012-08-20

申请人： Takayuki Osogami ,  Raymond H. Rudy

发明人： Takayuki Osogami ,  Raymond H. Rudy

IPC分类号： G06N5/02

CPC分类号： G06N7/005 ,  G06N99/005

摘要： A method for determining an optimum policy by using a Markov decision process in which T subspaces each have at least one state having a cyclic structure includes identifying, with a processor, subspaces that are part of a state space; selecting a t-th (t is a natural number, t≦T) subspace among the identified subspaces; computing a probability of, and an expected value of a cost of, reaching from one or more states in the selected t-th subspace to one or more states in the t-th subspace in a following cycle; and recursively computing a value and an expected value of a cost based on the computed probability and expected value of the cost, in a sequential manner starting from a (t −1)-th subspace.

摘要翻译： 一种用于通过使用马尔可夫决策过程来确定最佳策略的方法，其中T个子空间各自具有至少一个具有循环结构的状态，包括用处理器识别属于状态空间的子空间的子空间; 在所识别的子空间中选择第t（t是自然数，t＆nlE; T）子空间; 计算在所选择的第t个子空间中的一个或多个状态到下一周期中的第t个子空间中的一个或多个状态的成本的概率和期望值; 并且以从第（t-1）个子空间开始的顺序方式，以计算出的成本的概率和预期值递归地计算成本的值和期望值。