公开(公告)号：US08494971B2

公开(公告)日：2013-07-23

申请号：US12422460

申请日：2009-04-13

申请人： Toshiyuki Hama

发明人： Toshiyuki Hama

IPC分类号： G06Q10/00

CPC分类号： G06Q10/06 ,  G06Q10/1093

摘要： A system, method, and computer program for editing a production schedule. The system includes: a storage unit storing master data; a receiving unit receiving the master data; a duplicating unit generating editing data; an editing operation unit generating preliminarily-edited data based on an editing command; an identification unit identifying an item edited in the preliminarily-edited data with respect to the master data; a determination unit determining whether the inputted editing command is valid or invalid, wherein tag information is appended to an item being the same as the edited item; and an updating unit generating the preliminarily-edited data in which the editing command determined to be valid is reflected and to which the tag information is appended and updating the master data by using the generated preliminarily-edited data. A method and computer program are also provided.

摘要翻译： 用于编辑生产计划的系统，方法和计算机程序。 该系统包括：存储单元，存储主数据; 接收单元，接收主数据; 生成编辑数据的复制单元; 编辑操作单元，基于编辑命令生成预编辑数据; 识别单元，其识别关于所述主数据的所述预编辑数据中编辑的项目; 确定单元，确定输入的编辑命令是有效还是无效，其中标签信息附加到与编辑的项目相同的项目; 以及更新单元，其生成其中确定为有效的编辑命令被反映并且附加了标签信息的预编辑数据，并且通过使用所生成的预先编辑的数据来更新主数据。 还提供了一种方法和计算机程序。

公开(公告)号：US07287144B2

公开(公告)日：2007-10-23

申请号：US10970857

申请日：2004-10-20

申请人： Toshiyuki Hama

发明人： Toshiyuki Hama

IPC分类号： G06F12/00

CPC分类号： G06F17/30902

摘要： Using a counter of the Web server 10, a leave probability p1, average value m and variance s2 of think time, and hit ratio r are calculated for a session data cache 12 involving a predetermined Web application. For a first reading of a group of reading plural session data proximate temporally, p1a, ma and s2a, and average value a of the number of data reading sessions in each group are defined. A computational expression setting means 21 sets a computational expression f(a)=a including p1, m, s2, r, p1a, ma and s2a, the computational expression for a fix point computing method having a variable a. A true value searching means 22 searches an almost true value of a by the fix point computing method based on the computational expression f(a)=a. An estimation means 23 estimates ra based on a searched value of a.

摘要翻译： 对于涉及预定Web应用的会话数据高速缓存12，使用Web服务器10的计数器，计算离开概率p 1，思考时间的平均值m和方差s 2以及命中率r。 对于在时间上读取多个会话数据的组的第一读取，p 1 a，ma和s 2 a，并且定义每组中的数据读取会话的数量的平均值a。 计算表达式设置装置21设置包括p 1，m，s 2，r，p 1 a，ma和s 2 a的计算表达式f（a）= a，具有变量a的定点计算方法的计算表达式 。 真值搜索装置22基于计算表达式f（a）= a，通过定点计算方法搜索几乎真实的a值。 估计装置23基于a的搜索值来估计ra。

公开(公告)号：US6160556A

公开(公告)日：2000-12-12

申请号：US168891

申请日：1998-10-09

申请人： Yohsuke Kinoe ,  Toshiyuki Hama ,  Minako Matsuda

发明人： Yohsuke Kinoe ,  Toshiyuki Hama ,  Minako Matsuda

IPC分类号： G06F3/048 ,  G06F15/00

CPC分类号： G06F3/04842 ,  G06F3/04845

摘要： A method and a system precisely selects a three-dimensional object hidden inside complex objects. A retrieval object is disposed in the proximity of a pointer to retrieve a three-dimensional object, all three-dimensional objects included within or touching the retrieval object are retrieved, a sub-window is displayed, an area in the sub-window is divided into a plurality of regions corresponding to the number of retrieved three-dimensional objects and, in response to the pointer being positioned within one of said plurality of regions within said sub-window, a corresponding three-dimensional object within a main window is displayed distinctively over other three-dimensional objects within said main window. After a desired object is selected, the selection is finalized by a click operation of the pointer, etc.

摘要翻译： 一种方法和系统精确地选择隐藏在复杂对象内的三维对象。 将检索对象设置在指示器附近以检索三维对象，检索包括在检索对象内或触摸检索对象内的所有三维对象，显示子窗口，子窗口中的区域被划分 进入与所检索的三维物体的数量对应的多个区域中，并且响应于指示器位于所述子窗口内的所述多个区域的一个之内，主窗口内的对应的三维物体被显着地显示 超过所述主窗口内的其他三维物体。 选择所需对象后，通过指针等的点击操作确定选择。

公开(公告)号：US20120078407A1

公开(公告)日：2012-03-29

申请号：US13320406

申请日：2010-05-06

申请人： Toshiyuki Hama ,  Takayuki Yoshizumi

发明人： Toshiyuki Hama ,  Takayuki Yoshizumi

IPC分类号： G06F19/00

CPC分类号： B22D11/12 ,  B21B13/22 ,  B21B37/00 ,  B22D11/1206 ,  B22D11/142 ,  G05B19/41865 ,  G05B2219/32298 ,  G05B2219/32336 ,  Y02P90/20

摘要： System, method and computer program product for combined scheduling of two different slab sequences by a rational technique. A two-dimensional grid graph having a direct slab sequence as a first dimension and an inventory slab sequence as a second dimension is prepared by processing of a computer as a data structure represented on a memory or a hard disk drive of the computer. A processing program of the computer generates two child nodes corresponding to a direct slab and an inventory slab, in each node of the two-dimensional graph according to a predetermined algorithm. By defining an appropriate weighting function, the processing program of the computer weights edges between nodes in the two-dimensional grid graph. After forming the weighted graph on a storage device of the computer such as the memory or the hard disk drive, the processing program of the computer calculates a path from a start point to an end point as a shortest path search problem.

摘要翻译： 通过合理的技术对两种不同板块序列进行组合调度的系统，方法和计算机程序产品。 通过将计算机作为在计算机的存储器或硬盘驱动器上表示的数据结构的处理来制备具有作为第一维的直接平板序列和作为第二维的库存板序列的二维网格图。 计算机的处理程序根据预定算法在二维图形的每个节点中生成对应于直接平板和库存板块的两个子节点。 通过定义适当的加权函数，计算机的处理程序在二维网格图中的节点之间加权边缘。 在诸如存储器或硬盘驱动器的计算机的存储设备上形成加权图之后，计算机的处理程序计算从起始点到终点的路径作为最短路径搜索问题。

公开(公告)号：US07890205B2

公开(公告)日：2011-02-15

申请号：US12038019

申请日：2008-02-27

申请人： Toshiyuki Hama ,  Takayuki Yoshizumi

发明人： Toshiyuki Hama ,  Takayuki Yoshizumi

IPC分类号： G06F19/00

CPC分类号： B21B37/00

摘要： A system for determining a processing sequence of steel plates includes a constraint storage unit for storing positional constraints that define ranges of positions into which each type of steel plate is to be inserted when the steel plates are arranged in the processing sequence; a selecting unit for preferentially selecting, as a position into which a new steel plate is to be inserted in an array of steel plates already arranged in the processing sequence, a position having a larger expectation value of the number of steel plates that can be further inserted into the array of steel plates after the insertion of the new steel plate while satisfying the positional constraints; and an inserting unit for inserting the new steel plate into the selected position and for outputting data indicating the array of steel plates after the insertion.

摘要翻译： 一种用于确定钢板的处理顺序的系统包括：约束存储单元，用于存储当以所述处理顺序排列所述钢板时限定要插入每种类型的钢板的位置范围的位置约束; 选择单元，用于优选地选择新的钢板插入到已经以处理顺序排列的钢板阵列中的位置，可以进一步选择具有较大钢板数量的期望值的位置 在插入新钢板同时满足位置约束的情况下插入钢板阵列中; 以及插入单元，用于将新钢板插入所选择的位置，并用于在插入之后输出指示钢板阵列的数据。

公开(公告)号：US20050268037A1

公开(公告)日：2005-12-01

申请号：US11131126

申请日：2005-05-17

申请人： Toshiyuki Hama ,  Ryo Hirade

发明人： Toshiyuki Hama ,  Ryo Hirade

IPC分类号： G06F12/08 ,  G06F3/06 ,  G06F12/00 ,  G06F12/12

CPC分类号： G06F11/3452 ,  G06F12/12 ,  G06F2201/88 ,  G06F2201/885

摘要： Determining a cache hit ratio of a caching device analytically and precisely. There is provided a cache hit ratio estimating apparatus for estimating the cache hit ratio of a caching device, caching access target data accessed by a requesting device, including: an access request arrival frequency obtaining section for obtaining an average arrival frequency measured for access requests for each of the access target data; an access request arrival probability density function generating section for generating an access request arrival probability density function which is a probability density function of arrival time intervals of access requests for each of the access target data on the basis of the average arrival frequency of access requests for the access target data; and a cache hit ratio estimation function generating section for generating an estimation function for the cache hit ratio for each of the access target data on the basis of the access request arrival probability density function for the plurality of the access target data.

摘要翻译： 分析和精确地确定缓存设备的缓存命中率。 提供了一种用于估计高速缓存设备的高速缓存命中率的缓存命中率估计装置，用于缓存请求设备访问的访问目标数据，包括：访问请求到达频率获取部分，用于获得对访问请求测量的平均到达频率 每个访问目标数据; 访问请求到达概率密度函数生成部，其基于访问请求的平均到达频率，生成访问请求到达概率密度函数，该访问请求到达概率密度函数是对于每个访问目标数据的访问请求的到达时间间隔的概率密度函数， 访问目标数据; 以及高速缓存命中率估计函数生成部，其基于所述多个所述访问对象数据的访问请求到达概率密度函数，生成所述访问对象数据中的每一个的所述高速缓存命中率的推定函数。

公开(公告)号：US08670856B2

公开(公告)日：2014-03-11

申请号：US13164339

申请日：2011-06-20

申请人： Andrew J. Davenport ,  Toshiyuki Hama ,  Jayant R. Kalagnanam ,  Chandrasekhara K. Reddy ,  Stuart A. Siegel

发明人： Andrew J. Davenport ,  Toshiyuki Hama ,  Jayant R. Kalagnanam ,  Chandrasekhara K. Reddy ,  Stuart A. Siegel

IPC分类号： G05B13/04

CPC分类号： G06Q50/04 ,  G05B13/04 ,  G06Q10/06 ,  Y02P90/30

摘要： A method and system for optimizing modules of a steel manufacturing process includes a plurality of manufacturing modules for a manufacturing process. Each of the modules have a plurality of steps. The plurality of modules include at least an upstream module, a casting module, and a downstream module. Each of the plurality of modules have parameters, and include at least one variable event. The variable event is adjustable for optimization of the manufacturing process while the parameters are being maintained for each of the plurality of modules. A communication system is used for exchanging information between the modules while the manufacturing process is occurring to adjust the at least one variable event for optimizing the manufacturing process.

摘要翻译： 用于优化钢铁制造过程的模块的方法和系统包括用于制造过程的多个制造模块。 每个模块具有多个步骤。 多个模块至少包括上游模块，铸造模块和下游模块。 多个模块中的每一个具有参数，并且包括至少一个可变事件。 变量事件是可调整的，以便在为多个模块中的每个模块维护参数的同时优化制造过程。 通信系统用于在制造过程发生时在模块之间交换信息，以调整至少一个可变事件以优化制造过程。

公开(公告)号：US07567852B2

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

申请号：US11710306

申请日：2007-02-23

申请人： Toshiyuki Hama ,  Hiroyuki Okano ,  Takayuki Yoshizumi

发明人： Toshiyuki Hama ,  Hiroyuki Okano ,  Takayuki Yoshizumi

IPC分类号： G06F19/00

CPC分类号： G05B19/41865 ,  G05B2219/32263 ,  G05B2219/32306 ,  G05B2219/32332 ,  Y02P90/20

摘要： A method and system for determining an array sequence of processing operations to maximize the efficiency of steel plate processing. Between two processing operations, a first sequence constraint based on a first attribute of each processing operation and a second sequence constraint based on a second attribute of each processing operation are defined. A system selects, as a cluster, at least one of processing operations having a common attribute value of the first attribute, and arranged in a sequence satisfying the second sequence constraint. The system regards the first sequence constraint as a sequence constraint between a plurality of clusters, and arranges the plurality of clusters in a sequence maximizing the efficiency of processing.

摘要翻译： 一种用于确定加工操作的阵列序列以最大化钢板加工效率的方法和系统。 在两个处理操作之间，定义基于每个处理操作的第一属性的第一序列约束和基于每个处理操作的第二属性的第二序列约束。 系统作为集群选择具有第一属性的公共属性值的处理操作中的至少一个，并且以满足第二序列约束的顺序排列。 该系统将第一序列约束视为多个簇之间的序列约束，并且以最大化处理效率的序列来排列多个簇。

公开(公告)号：US20080320480A1

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

申请号：US12193308

申请日：2008-08-18

申请人： TOSHIYUKI HAMA ,  HIROYUKI OKANO ,  TAKAYUKI YOSHIZUMI

发明人： TOSHIYUKI HAMA ,  HIROYUKI OKANO ,  TAKAYUKI YOSHIZUMI

IPC分类号： G06F9/46

CPC分类号： G05B19/41865 ,  G05B2219/32263 ,  G05B2219/32306 ,  G05B2219/32332 ,  Y02P90/20

摘要： A method and system for determining an array sequence of processing operations to maximize the efficiency of steel plate processing. Between two processing operations, a first sequence constraint based on a first attribute of each processing operation and a second sequence constraint based on a second attribute of each processing operation are defined. A system selects, as a cluster, at least one of processing operations having a common attribute value of the first attribute, and arranged in a sequence satisfying the second sequence constraint. The system regards the first sequence constraint as a sequence constraint between a plurality of clusters, and arranges the plurality of clusters in a sequence maximizing the efficiency of processing.

摘要翻译： 一种用于确定加工操作的阵列序列以最大化钢板加工效率的方法和系统。 在两个处理操作之间，定义基于每个处理操作的第一属性的第一序列约束和基于每个处理操作的第二属性的第二序列约束。 系统作为集群选择具有第一属性的公共属性值的处理操作中的至少一个，并且以满足第二序列约束的顺序排列。 该系统将第一序列约束视为多个簇之间的序列约束，并且以最大化处理效率的序列来排列多个簇。

公开(公告)号：US20080082199A1

公开(公告)日：2008-04-03

申请号：US11710306

申请日：2007-02-23

申请人： Toshiyuki Hama ,  Hiroyuki Okano ,  Takayuki Yoshizumi

发明人： Toshiyuki Hama ,  Hiroyuki Okano ,  Takayuki Yoshizumi

IPC分类号： B21B37/00 ,  G06F19/00 ,  G06Q50/00

CPC分类号： G05B19/41865 ,  G05B2219/32263 ,  G05B2219/32306 ,  G05B2219/32332 ,  Y02P90/20

摘要： A method and system for determining an array sequence of processing operations to maximize the efficiency of steel plate processing. Between two processing operations, a first sequence constraint based on a first attribute of each processing operation and a second sequence constraint based on a second attribute of each processing operation are defined. A system selects, as a cluster, at least one of processing operations having a common attribute value of the first attribute, and arranged in a sequence satisfying the second sequence constraint. The system regards the first sequence constraint as a sequence constraint between a plurality of clusters, and arranges the plurality of clusters in a sequence maximizing the efficiency of processing.

摘要翻译： 一种用于确定加工操作的阵列序列以最大化钢板加工效率的方法和系统。 在两个处理操作之间，定义基于每个处理操作的第一属性的第一序列约束和基于每个处理操作的第二属性的第二序列约束。 系统作为集群选择具有第一属性的公共属性值的处理操作中的至少一个，并且以满足第二序列约束的顺序排列。 该系统将第一序列约束视为多个簇之间的序列约束，并以最大化处理效率的序列排列多个簇。