公开(公告)号：US06748574B2

公开(公告)日：2004-06-08

申请号：US09986917

申请日：2001-11-13

申请人： Fumiyoshi Sasagawa ,  Akio Shinagawa

发明人： Fumiyoshi Sasagawa ,  Akio Shinagawa

IPC分类号： G06F1750

CPC分类号： G06F17/509 ,  G06F17/5068

摘要： A uniform-density layout problem requires an optimal layout of multiple elements in a predetermined region under a set of conditions including a density-uniformization condition. The method determines an optimal solution to the problem and comprises the steps of: (a) obtaining an initial layout of the multiple elements in the predetermined region; (b) generating a linear combination of a first objective function, which represents the remaining conditions other than the density-uniformalization condition, and a second objective function, which represents the density-uniformalization condition, as a third objective function, which is assumed to represent the set of conditions of the problem; and (c) optimizing the third objective function by executing an iterative-improvement algorithm on the third objective function using the initial layout as an initial solution. The invention is especially useful to determine a layout of multiple circuit elements in designing LSI circuits and the like.

摘要翻译： 均匀密度布局问题需要在包括密度均匀化条件的一组条件下在预定区域中的多个元素的最佳布局。 该方法确定问题的最优解，包括以下步骤：（a）获得预定区域中的多个元素的初始布局; （b）将代表密度均一化条件的其余条件的第一目标函数和表示密度均一化条件的第二目标函数的线性组合作为第三目标函数，假定为 代表问题的一套条件; 并且（c）通过使用初始布局作为初始解决方案，对第三目标函数执行迭代改进算法来优化第三目标函数。 本发明在设计LSI电路等时确定多个电路元件的布局特别有用。

公开(公告)号：US06675155B2

公开(公告)日：2004-01-06

申请号：US09081604

申请日：1998-05-20

申请人： Fumiyoshi Sasagawa ,  Akio Shinagawa

发明人： Fumiyoshi Sasagawa ,  Akio Shinagawa

IPC分类号： G06F1518

CPC分类号： G06F17/5072

摘要： The invention provides an arrangement optimization problem processing apparatus for arranging a plurality of nodes in an optimum condition in a two- or more-dimensional space, by which an optimum arrangement of a plurality of nodes can be determined at a high speed even where a node arrangement optimization problem having a large problem scale is to be processed. The arrangement optimization problem processing apparatus includes a hyper node formation section for grouping the plurality of nodes to form a plurality of hyper nodes each formed from a set of nodes, a hyper node arrangement section for executing an optimization problem solution algorithm to determine solutions to a problem of arrangement of the plurality of hyper nodes formed by the hyper node formation section in the generation space and arranging the plurality of hyper nodes in the generation space based on one of the determined solutions.

摘要翻译： 本发明提供一种布置优化问题处理装置，用于在两维或更多维空间中以最佳状态布置多个节点，由此可以高速度地确定多个节点的最佳布置，即使在节点 要处理具有大问题尺度的排列优化问题。 布置优化问题处理装置包括超节点形成部分，用于对多个节点进行分组以形成由一组节点形成的多个超节点;超节点布置部分，用于执行优化问题解算法，以确定解 在生成空间中由超节点形成部形成的多个超节点的布置问题，并且基于确定的解决方案之一，将多个超节点排列在生成空间中。

公开(公告)号：US06412100B1

公开(公告)日：2002-06-25

申请号：US09358925

申请日：1999-07-23

申请人： Fumiyoshi Sasagawa ,  Akio Shinagawa

发明人： Fumiyoshi Sasagawa ,  Akio Shinagawa

IPC分类号： G06F1750

CPC分类号： G06F17/5072

摘要： The present invention relates to a technique relating to a method of processing a layout optimization problem. In connection with an element layout optimization problem in which it is requested to optimally arrange a plurality of elements within a space of two or more dimension, a first algorithm executing step is carried out. In this step, when information concerning the state of initial layout of the plurality of elements is available, a genetic algorithm is executed, thereby reducing non-uniformity in density of the plurality of elements staying in the initial layout. Subsequently, a second algorithm executing step is executed. In this step, when there are input data regarding the state of layout unbalance reduction halfway stage of the plurality of elements after reduction of non-uniformity in density in the first algorithm executing step, a local layout unbalance reducing algorithm is executed, thereby further reducing non-uniformity in density of the plurality of elements staying in the layout unbalance reduction halfway stage. As a result, the layout optimization problem of optimally arranging the plurality of elements in a space is processed. In this way, an element layout optimization problem of large scale is also processed.

摘要翻译： 本发明涉及一种与布局优化问题的处理方法有关的技术。 关于要求在两维或更多维的空间内最佳地布置多个元素的元素布局优化问题，执行第一算法执行步骤。 在该步骤中，当关于多个元素的初始布局的状态的信息可用时，执行遗传算法，从而降低保持在初始布局中的多个元素的密度的不均匀性。 随后，执行第二算法执行步骤。 在该步骤中，当在第一算法执行步骤中存在关于减少密度不均匀性之后的多个元素的布局不平衡减少中途状态的输入数据时，执行局部布局不平衡减小算法，从而进一步减少 多个元件的密度不均匀性保持在布局不平衡减少中途。 结果，处理在空间中最佳地布置多个元素的布局优化问题。 这样就可以处理大规模的元素布局优化问题。

公开(公告)号：US07167847B2

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

申请号：US11064027

申请日：2005-02-23

申请人： Fumiyoshi Sasagawa

发明人： Fumiyoshi Sasagawa

IPC分类号： G06N5/00

CPC分类号： G06N3/123 ,  B82Y10/00

摘要： A DNA computer for carrying out computations using DNAs is provided with a dividing part for dividing a problem that is to be solved into a plurality of partial problems, and an operation part for obtaining a DNA sequence corresponding to a solution to the problem, by combining DNA sequences corresponding to solutions of the plurality of partial problems.

摘要翻译： 使用DNA进行计算的DNA计算机具有用于将要解决的问题划分为多个部分问题的分割部分和用于获得与问题解决方案相对应的DNA序列的操作部分，通过组合 对应于多个部分问题的解决方案的DNA序列。

公开(公告)号：US20090276274A1

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

申请号：US12458348

申请日：2009-07-08

申请人： Fumiyoshi Sasagawa

发明人： Fumiyoshi Sasagawa

IPC分类号： G06Q10/00 ,  G06Q50/00 ,  G06F17/30

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

摘要： A workflow extractor generates workflow information having the set names of data sets arranged in chronological order, oldest first, for each business process. A transition information generator specifies a transition relation between two continuously updated data sets to generate transition information. An important update extractor extracts update information indicating updates of important data items, . . . , and specifies a correspondence relation between a data set and an updated value. An impact level calculator calculates an impact level of each transition relation on business based on the number of appearances of the transition relation and the updated values corresponding to the data sets of the transition source and the transition destination, and outputs impact level information.

摘要翻译： 工作流提取器生成工作流信息，其具有按照时间顺序排列的数据集的集名称，对于每个业务流程来说是最早的。 转移信息生成器指定两个连续更新的数据集之间的转换关系以产生转换信息。 重要的更新提取器提取指示重要数据项的更新的更新信息。 。 。 ，并指定数据集与更新值之间的对应关系。 影响级别计算器基于过渡关系的出现次数和对应于转换源和转换目的地的数据集的更新值，计算出每个过渡关系对业务的影响级别，并输出冲击级别信息。

公开(公告)号：US20070233712A1

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

申请号：US11425795

申请日：2006-06-22

申请人： Jun Arima ,  Fumiyoshi Sasagawa ,  Terunobu Kume ,  Takahiro Saito ,  Akira Kawamura ,  Hiromi Kusumoto

发明人： Jun Arima ,  Fumiyoshi Sasagawa ,  Terunobu Kume ,  Takahiro Saito ,  Akira Kawamura ,  Hiromi Kusumoto

IPC分类号： G06F7/00

CPC分类号： G06Q10/10

摘要： A recording medium causing computer to execute a checklist management program for managing a checklist comprised of a plurality of operation items to be checked, which generates attribute information specifying if the operation item is conducted for each of the operation items, obtains frequency distribution about an evaluation value corresponding to the generated attribute information based on a relationship which is prepared between the attribute information and the evaluation value, and sets an evaluation degree corresponding to the generated attribute information based on a frequency corresponding to an evaluation value that is equal to or greater than a prescribed threshold value in the frequency distribution. The generated attribute information comprises first attribute information obtained by setting t one of the operation items, which are not conducted among input attribute information, to be conducted. An evaluation degree obtained for the first attribute information is set as a priority.

摘要翻译： 一种使计算机执行用于管理由要检查的多个操作项目组成的检查表的清单管理程序的记录介质，其生成指定是否为每个操作项目执行操作项目的属性信息，获得关于评估的频率分布 基于在所述属性信息和所述评估值之间准备的关系来生成属性信息的值，并且基于与所述属性信息和所述评估值之间的评估值相对应的频率来设置与所生成的属性信息相对应的评估度 频率分布中规定的阈值。 所生成的属性信息包括通过设置不进行的输入属性信息之间的操作项目之一而获得的第一属性信息。 将第一属性信息获得的评价度设定为优先。

公开(公告)号：US20060121493A1

公开(公告)日：2006-06-08

申请号：US11064027

申请日：2005-02-23

申请人： Fumiyoshi Sasagawa

发明人： Fumiyoshi Sasagawa

IPC分类号： C12Q1/68 ,  G06F19/00

CPC分类号： G06N3/123 ,  B82Y10/00

摘要： A DNA computer for carrying out computations using DNAs is provided with a dividing part for dividing a problem that is to be solved into a plurality of partial problems, and an operation part for obtaining a DNA sequence corresponding to a solution to the problem, by combining DNA sequences corresponding to solutions of the plurality of partial problems.

摘要翻译： 使用DNA进行计算的DNA计算机具有用于将要解决的问题划分为多个部分问题的分割部分和用于获得与问题解决方案相对应的DNA序列的操作部分，通过组合 对应于多个部分问题的解决方案的DNA序列。