公开(公告)号：EP2040170A4

公开(公告)日：2012-05-23

申请号：EP07767357

申请日：2007-06-21

Applicant: IBM

Inventor： OSOGAMI TAKAYUKI ,  KATO SEI

IPC: G06F11/34

CPC classification number: G06F11/3452 ,  G06F11/3495 ,  G06F2201/80 ,  G06F2201/875

公开(公告)号：JP2013053987A

公开(公告)日：2013-03-21

申请号：JP2011193609

申请日：2011-09-06

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation

Inventor： OSOGAMI TAKAYUKI ,  MIKAEL ONSJOE

IPC: G01C21/34

CPC classification number: G01C21/3446

Abstract: PROBLEM TO BE SOLVED: To provide a method, an apparatus and a computer program which avoid frequent route changes during driving, efficiently select an optimal route, and selectively display a route preferable to a driver.SOLUTION: A dynamic strategy which depends on time required to reach each intersection that can be passed through between a departure place and a destination place is computed. A probability distribution of the required time for each intersection and a driving direction to be selected dependently on the required time are computed in accordance with the computed dynamic strategy. Driving directions having the highest probability of the required time are sequentially selected to determine intersections to be passed through on the way to the destination. For each intersection, the probability of the required time for each driving direction may be added to sequentially select driving directions that have the highest total probability among the results of the additions.

Abstract translation: 要解决的问题：提供一种在驾驶期间避免频繁路线改变的方法，装置和计算机程序，有效地选择最佳路线，并且选择性地显示优于驾驶员的路线。

解决方案：计算取决于到达可以在出发地点和目的地地点之间通过的每个交叉点所需的时间的动态策略。 根据计算出的动态策略计算每个交叉点所需时间和要选择的行驶方向的概率分布，这取决于所需时间。 依次选择具有所需时间概率最高的驾驶方向，以确定要在目的地途中通过的交叉路口。 对于每个交叉点，可以添加每个行驶方向所需时间的概率，以便在添加结果之间依次选择总概率最高的驾驶方向。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：DE102013205819B4

公开(公告)日：2020-04-02

申请号：DE102013205819

申请日：2013-04-03

Applicant: IBM

Inventor： RUDY RAYMOND HARRY ,  OSOGAMI TAKAYUKI ,  KOYANAGI TERUO

IPC: G06F40/12 ,  G06F17/18 ,  H04L45/748

Abstract: Die vorliegende Erfindung bezieht sich auf ein Verfahren, eine Einheit und ein Computerprogramm für das effiziente Identifizieren von Elementen mit einer hohen Auftrittshäufigkeit innerhalb von Elementen, die in einem umfangreichen Textdatenstrom enthalten sind.Identifizierungsdaten zum Identifizieren eines Elements und eines Zählwerts von Elementen werden in einer höheren Speicherebene gespeichert, und lediglich Identifizierungsdaten werden in einer tieferen Speicherebene unterhalb der höheren Speicherebene gespeichert. Eine Textdatenstrom-Eingabe wird empfangen, das Inkrement des Zählwerts eines Elements wird als Reaktion auf das Speichern von Identifizierungsdaten für ein Element, das in einem Intervall enthalten ist, der von der empfangenen Textdatenstrom-Eingabe getrennt ist, in dem Speicher einer höheren Ebene erhöht, die Identifizierungsdaten für das Element werden gemeinsam mit dem anfänglichen Zählwert als Reaktion auf das Speichern in der tieferen Speicherebene in die höhere Speicherebene übertragen, und die Identifizierungsdaten für das Element werden gemeinsam mit dem anfänglichen Zählwert als Reaktion darauf, dass sie in keiner Ebene gespeichert sind, in der höheren Speicherebene neu gespeichert.

公开(公告)号：JP2013077157A

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

申请号：JP2011216500

申请日：2011-09-30

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation

Inventor： ISHO TOSHIO ,  ITO TAKASHI ,  OSOGAMI TAKAYUKI

IPC: G06K9/03

CPC classification number: G06K9/03

Abstract: PROBLEM TO BE SOLVED: To provide a system, method and program for supporting proof reading of text data generated through optical character recognition.SOLUTION: A system includes: a first proof reading tool for performing carpet proof reading on text data; a second proof reading tool for performing side-by-side proof reading on the text data; a storage unit configured to store a log of proof reading operations having been performed by using the first and second proof reading tools; and an analysis unit configured to determine, for each attribute serving as units in which carpet proof reading is performed with the first proof reading tool, whether or not to use the first proof reading tool in proof reading of the attribute, by comparing a first estimated value of time taken when proof reading is performed by using the first proof reading tool with a second estimated value of time taken when proof reading is performed by using the second proof reading tool without using the first proof reading tool, the first and second estimated values being calculated on the basis of the log.

Abstract translation: 要解决的问题：提供用于支持通过光学字符识别产生的文本数据的校对读取的系统，方法和程序。 解决方案：一种系统包括：用于对文本数据进行地毯识别读取的第一校验读取工具; 用于对文本数据执行并排验证读取的第二证明阅读工具; 存储单元，被配置为存储已经通过使用所述第一和第二证明读取工具执行的证明读取操作的日志; 以及分析单元，其被配置为，通过比较第一估计值和第一估计值，确定作为用第一证明读取工具执行地毯证明读取的单元的每个属性是否使用第一证明读取工具进行证明读取的属性 通过使用第一校样读取工具执行校样读取时所用的时间的值，其中使用第二校样读取工具执行校样读取时所花费的时间的第二估计值，而不使用第一校样读取工具，第一和第二估计值 根据日志计算。 版权所有（C）2013，JPO＆INPIT

公开(公告)号：JP2012168767A

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

申请号：JP2011029660

申请日：2011-02-15

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： OSOGAMI TAKAYUKI ,  MICHAEL ONFAIT

IPC: G06Q40/04

CPC classification number: G06N7/005 ,  G06Q40/00

Abstract: PROBLEM TO BE SOLVED: To provide technique for selecting an action which approximately minimizes a repetitive risk index by using a Monte Carlo method in a Markov decision process of which scale cannot be precisely optimized.SOLUTION: Based on a Markov decision process, a queue of states (S,S,...,S) is sequentially generated by sampling. Then, in reverse order of the generated queue (S,...,S,S), values (provisional values of repetitive risk indexes) of respective states (V(S),...,V(S),V(S)) are updated. At this time, a value V(S) of each state Sis updated according to a value of a risk index of a probability variable (particularly calculated by using Value at Risk, an excess probability or a part of them) which is defined by a transition probability p(S|S) and a value of a transition destination V(S) of each of the destination states (S,S,...,S) which can be reached by one transition from each state S.

Abstract translation: 要解决的问题：提供用于选择在马尔可夫决策过程中使用蒙特卡罗方法近似最小化重复风险指数的动作的技术，其中规模不能被精确地优化。

解决方案：基于马尔可夫决策过程，状态队列（S 1 ，S 2 ，... ，S n ）。 然后，按照生成队列的相反顺序（S n ，...，S 2 ，S n ），...，V（S 2 ），V（S 1 ））更新。 此时，根据风险指数的值更新各状态S i 的值V（S i ） 通过转移概率p（S i + 1 （j）¾S i ）和转换目的地V的值（S i + 每个目的地状态的SB> （j））（S i + 1 1），S i + 1 （2），...，S i + 1 （m）），可以从每个状态S i 进行一次转换。 版权所有（C）2012，JPO＆INPIT

公开(公告)号：JP2009295102A

公开(公告)日：2009-12-17

申请号：JP2008150724

申请日：2008-06-09

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： OSOGAMI TAKAYUKI

IPC: G06Q10/00 ,  G06Q10/04 ,  G06Q50/00 ,  G06Q50/10

Abstract: PROBLEM TO BE SOLVED: To provide a method, program, and system for estimating a queueing time. SOLUTION: The method, program, and system efficiently estimate a waiting time of a customer by using a recurrence formula for calculating probability distribution of a waiting time of a customer or the like included in a queue and an approximation to the recurrent formula. Development into a high-order polynomial is avoided, an increase of a space of a storage medium necessary for storing a calculation amount and counting is thus avoided, and probability distribution is obtained more quickly than a method for directly performing numerical evaluation of integral for giving probability, so that a result is more efficiently obtained when estimation of the queue is applied to a large amount of data, such as POS data. A manager or the like of a distribution sales business obtains information for designing and evaluating a shop, a distribution system, and the like. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供用于估计排队时间的方法，程序和系统。 解决方案：方法，程序和系统通过使用递归公式有效地估计客户的等待时间，以计算包括在队列中的顾客等待时间的概率分布和对于经常性公式的近似 。 因此避免了开发成高阶多项式，从而避免了存储计算量和计数所需的存储介质的空间的增加，并且比直接执行用于给出的积分的数值评估的方法更快地获得概率分布 概率，使得当对诸如POS数据的大量数据应用队列的估计时，更有效地获得结果。 分销销售业务的经理等获得用于设计和评估商店，分发系统等的信息。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2013222337A

公开(公告)日：2013-10-28

申请号：JP2012094026

申请日：2012-04-17

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation

Inventor： RUDY RAYMOND HARRY PUTRA ,  KOYANAGI MITSUO ,  OSOGAMI TAKAYUKI

IPC: G06F17/30 ,  G06F12/00

CPC classification number: G06F12/08 ,  G06F17/18 ,  G06F17/30619 ,  H04L43/022 ,  H04L43/16

Abstract: PROBLEM TO BE SOLVED: To provide a method, device and computer program for efficiently identifying items having a high frequency of occurrence among items included in a large-volume text data stream.SOLUTION: Identification information for identifying an item and a count for the item are stored in a memory of a higher level, and only identification information is stored in a memory of a level lower than said higher level. When text data stream input is received: if identification information for an item included in a bucket resulted from division of the received text data stream input is stored in the higher-level memory, the count for the item is incremented; when stored in the lower-level memory, the identification information for the item is transferred with an initial count to the higher-level memory; and, when not stored in any level, the identification information for the item is newly stored with the initial count in the higher-level memory.

Abstract translation: 要解决的问题：提供一种方法，装置和计算机程序，用于有效地识别包含在大容量文本数据流中的项目之间具有高频率发生的项目。解决方案：用于识别项目的识别信息和项目的计数 被存储在更高级别的存储器中，并且只有识别信息被存储在低于所述较高级别的级别的存储器中。 当接收到文本数据流输入时：如果由接收到的文本数据流输入的分割而产生的包含在桶中的项目的识别信息被存储在上级存储器中，则该项目的计数被递增; 当存储在下级存储器中时，用于初始计数的项目的识别信息被传送到较高级别的存储器; 并且当不存储在任何级别时，在上层存储器中以初始计数新存储该项目的识别信息。

公开(公告)号：JP2013148390A

公开(公告)日：2013-08-01

申请号：JP2012007329

申请日：2012-01-17

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation

Inventor： OSOGAMI TAKAYUKI

IPC: G01C21/34

CPC classification number: G01C21/00 ,  G01C21/3484

Abstract: PROBLEM TO BE SOLVED: To provide a method, an apparatus and a computer program for estimating a personality of a driver in route selection that are capable of estimating the personality of each driver, building a route selection model for each driver, and performing a traffic simulation close to reality.SOLUTION: Information concerning a departure point and an arrival point and information concerning a route from the departure point to the arrival point are acquired, and a plurality of basic routes are generated. Information concerning a route actually selected is acquired, and a parameter of an evaluation function that yields the actually selected route as an optimum route is calculated. A new route is generated using the calculated parameter, and it is determined whether or not the generated new route is identical to the actually selected route. When the two routes do not agree with each other, the generated new route is added to the basic routes, a parameter of the evaluation function is calculated again, generation of a new route is repeated, and the generated new route is compared with the actually selected route. When the two routes agree with each other, the parameter at the time of the agreement is stored as a parameter of the evaluation function.

Abstract translation: 要解决的问题：提供一种方法，装置和计算机程序，用于估计路由选择中的驾驶员的个性，其能够估计每个驾驶员的个性，为每个驾驶员建立路线选择模型，并执行交通 模拟接近现实。解决方案：获取关于出发点和到达点的信息以及关于从出发点到到达点的路线的信息，并且生成多条基本路线。 获取关于实际选择的路线的信息，并且计算产生实际选择的路线作为最佳路线的评估函数的参数。 使用所计算的参数生成新的路线，并且确定所生成的新路线是否与实际选择的路线相同。 当两条路由不一致时，将生成的新路由添加到基本路由，再次计算评估函数的参数，重复生成新路由，生成的新路由与实际的路由进行比较 选择路线。 当两条路线彼此一致时，协议时的参数被存储为评估函数的参数。

公开(公告)号：JP2008299531A

公开(公告)日：2008-12-11

申请号：JP2007143969

申请日：2007-05-30

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： OSOGAMI TAKAYUKI

IPC: G05B19/418 ,  G06F17/50 ,  G06Q50/00 ,  G06Q50/04

CPC classification number: G06F9/4881

Abstract: PROBLEM TO BE SOLVED: To determine a processing order of processes so as to minimize the time required for correction processing of a result of a process completed in processing based on a result of a process to be processed subsequently. SOLUTION: The system comprises a storage device which stores, for each set of processes, an expected value of required time for correction processing that is generated, when the other process is processed after one process, to match the result of the one process to the result of the other process; a first check part which checks whether each of second processes processable after a first process satisfies the condition that the required time for correction processing is shorter when the first process is processed prior to the second process than when the first process is processed after the second process based on each expected value read from the storage device; a first determination part which determines, when the condition is satisfied, to process the first process prior to each of the second processes; and a schedule part which determines the processing order of the other processes without departing from the processing order determined by the first determination part. COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：确定处理的处理顺序，以便基于随后处理的处理结果，最小化在处理中完成的处理结果的校正处理所需的时间。 解决方案：该系统包括：存储装置，用于对于每组处理，当在一个处理之后处理其他处理时，存储所生成的校正处理所需时间的期望值，以匹配一个 过程到另一个过程的结果; 第一检查部件，其检查在第一处理之后可处理的第二处理中的每一个是否满足当在第二处理之前处理第一处理时所需的校正处理时间比在第二处理之后处理第一处理时更短的条件 基于从存储设备读取的每个期望值; 第一确定部，其在满足条件的情况下，确定在每个第二处理之前处理第一处理; 以及调度部，其在不脱离由第一确定部确定的处理顺序的情况下确定其他处理的处理顺序。 版权所有（C）2009，JPO＆INPIT

公开(公告)号：JP2008040522A

公开(公告)日：2008-02-21

申请号：JP2006209593

申请日：2006-08-01

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： TAKAHASHI RIKIYA ,  OSOGAMI TAKAYUKI

IPC: G06Q40/00 ,  G06Q40/02 ,  G06Q40/04 ,  G06Q40/06

Abstract: PROBLEM TO BE SOLVED: To obtain probabilistic measures to minimize the risks of cumulative remuneration to be obtained from a plurality of objects undergoing status transition. SOLUTION: The transition probability of the status transition of an agent and a parameter showing the probability distribution of remuneration to be obtained in each status transition as the result of action taken by a user to a plurality of agents in each status are stored. Then, the input of measures to determine action probability for taking an action to each agent in each status is accepted. Then, a recurrence expression for searching the parameter showing the probability distribution of cumulative remuneration to be obtained in current and following terms from the plurality of agents based on the parameter showing the probability distribution of the cumulative remuneration to be obtained in the next and following terms is generated, and the parameter of the probability distribution is calculated by solving such an equation that the parameter of the probability distribution of the cumulative remuneration is converged into the same valve when the initial statuses are the same in the current and following terms and in the next and following terms in the recurrence expression. COPYRIGHT: (C)2008,JPO&INPIT

Abstract translation: 要解决的问题：采取概率措施，尽量减少从经历状态转换的多个对象获得的累积报酬风险。

解决方案：存储代理的状态转换的转移概率和表示在每个状态转换中获得的报酬的概率分布的参数作为用户对每个状态中的多个代理所采取的动作的结果被存储 。 然后，接受输入措施，以确定在每种状态下对每个代理人采取行动的行动概率。 然后，根据显示在下一个和后续条件中获得的累积报酬的概率分布的参数来搜索表示根据当前和后续条件从多个代理获得的累积报酬的概率分布的参数的递归表达式 并且通过求解这样的方程来计算概率分布的参数，即当初始状态在当前和后续条件下相同时，累积报酬的概率分布的参数被收敛在相同的阀中 递归表达式中的下一个和后续条款。 版权所有（C）2008，JPO＆INPIT