公开(公告)号：US20130113518A1

公开(公告)日：2013-05-09

申请号：US13334355

申请日：2011-12-22

申请人： Hae-Rang Choi ,  Yong-Ju Kim ,  Oh-Kyong Kwon ,  Kang-Sub Kwak ,  Jun-Yong Song ,  Hyeon-Cheon Seol

发明人： Hae-Rang Choi ,  Yong-Ju Kim ,  Oh-Kyong Kwon ,  Kang-Sub Kwak ,  Jun-Yong Song ,  Hyeon-Cheon Seol

IPC分类号： H03K19/23

CPC分类号： H03K19/0813 ,  H03K19/23

摘要： A majority decision circuit includes: a majority decision unit configured to compare first data with second data to decide whether one of the first data and the second data has more bits with a first logical value; and an offset application unit configured to control the majority decision unit so that the majority decision unit decides, in a case when the number of bits with the first logical value among the first data is equal to the number of bits with the first logical value among the second data, that the first data have more bits with the first logical value if offset is a first setting value in a first phase and decides that the second data have more bits with the first logical value if the offset is a second setting value in a second phase.

摘要翻译： 多数决定电路包括：多数决定单元，被配置为将第一数据与第二数据进行比较，以确定第一数据和第二数据之一是否具有更多具有第一逻辑值的位; 以及偏移应用单元，被配置为控制多数决定单元，使得多数决定单元在第一数据中具有第一逻辑值的比特数等于具有第一逻辑值的比特数在 第二数据，如果偏移量是第一相位中的第一设定值，则第一数据具有具有第一逻辑值的更多位，并且如果偏移量是第二设定值，则判定第二数据具有第一逻辑值的更多位 第二阶段

公开(公告)号：US08476924B2

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

申请号：US13334355

申请日：2011-12-22

申请人： Hae-Rang Choi ,  Yong-Ju Kim ,  Oh-Kyong Kwon ,  Kang-Sub Kwak ,  Jun-Yong Song ,  Hyeon-Cheon Seol

发明人： Hae-Rang Choi ,  Yong-Ju Kim ,  Oh-Kyong Kwon ,  Kang-Sub Kwak ,  Jun-Yong Song ,  Hyeon-Cheon Seol

IPC分类号： H03K19/003 ,  H03K19/23

CPC分类号： H03K19/0813 ,  H03K19/23

摘要： A majority decision circuit includes: a majority decision unit configured to compare first data with second data to decide whether one of the first data and the second data has more bits with a first logical value; and an offset application unit configured to control the majority decision unit so that the majority decision unit decides, in a case when the number of bits with the first logical value among the first data is equal to the number of bits with the first logical value among the second data, that the first data have more bits with the first logical value if offset is a first setting value in a first phase and decides that the second data have more bits with the first logical value if the offset is a second setting value in a second phase.

公开(公告)号：US20070233720A1

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

申请号：US11611284

申请日：2006-12-15

申请人： Hae Young BAE ,  Young Hwan OH ,  Ho Seok KIM ,  Yong Il JANG ,  Byeong Seob YOU ,  Sang Hun EO ,  Dong Wook LEE ,  John Hyeon CHEON

发明人： Hae Young BAE ,  Young Hwan OH ,  Ho Seok KIM ,  Yong Il JANG ,  Byeong Seob YOU ,  Sang Hun EO ,  Dong Wook LEE ,  John Hyeon CHEON

IPC分类号： G06F7/00

CPC分类号： G06F16/2264 ,  G06F16/2246 ,  G06F16/29

摘要： The present invention relates to a lazy bulk insertion method for moving object indexing, which utilizes a hash-based data structure to overcome the disadvantages of an R-tree, and uses two buffers to simultaneously store operations in the buffers and process queries stored in the buffers, so that the overall update cost can be reduced. In the lazy bulk insertion method, a buffer is substituted and a state of the buffer is changed to a deactivated state if an input query cannot be stored in the buffer. Operations stored in the deactivated buffer are sequentially analyzed, information about objects corresponding to respective operations is obtained from a direct link to analyze the operations, and thus the operations are aligned on the basis of object IDs. Operations, aligned in ascending order of spatial objects, are identified depending on respective objects, effectiveness of the operations is determined, and thus the operations are realigned on the basis of terminal node IDs. The number of insert operations and the number of delete operations are counted for each terminal node, and variation in the number of empty spaces in the terminal node is obtained, thus splitting and merging of the terminal nodes is predicted. A processing sequence of queries is reorganized so as to reduce variation in the node on the basis of the predicted information.

摘要翻译： 本发明涉及一种用于移动对象索引的延迟批量插入方法，其利用基于散列的数据结构来克服R树的缺点，并且使用两个缓冲器来同时存储缓冲器中的操作和存储在 缓冲区，从而可以降低总体更新成本。 在惰性批量插入方法中，如果输入查询不能存储在缓冲区中，则替换缓冲区，并将缓冲区的状态更改为禁用状态。 顺序地分析存储在去激活缓冲器中的操作，从直接链接获得关于对应于各个操作的对象的信息，以分析操作，因此基于对象ID来对齐操作。 根据各个对象来识别按空间对象的升序排列的操作，确定操作的有效性，并且因此基于终端节点ID对操作进行重新排列。 对每个终端节点计数插入操作次数和删除次数，得到终端节点空闲空间数量的变化，从而预测终端节点的分裂和合并。 重新组织查询的处理顺序，以便基于预测信息来减少节点的变化。

公开(公告)号：US20070136033A1

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

申请号：US11338352

申请日：2006-01-24

申请人： Sang Kim ,  Dong Kwag ,  Hyeon Cheon ,  Jae Choi

发明人： Sang Kim ,  Dong Kwag ,  Hyeon Cheon ,  Jae Choi

IPC分类号： G06F17/10

CPC分类号： G06F17/50 ,  G06F2217/36 ,  G06F2217/78 ,  G06F2217/80 ,  H01B3/008

摘要： Disclosed herein is a method for designing an insulation thickness of a 22.9 kV high-temperature superconducting cable wherein conversion coefficients for use in the transmission of electric power. In the insulation thickness designing method, differently from a conventional design method wherein only AC insulation breakdown electric-field, impulse insulation breakdown electric-field, and partial discharge initiation electric-field characteristics of an insulation sheet sample are applied to cable insulation thickness design equations, conversion coefficients, which are obtained in consideration of the effects of shape, area, and thickness along with the respective electric-field values, to the cable insulation thickness design equations, thereby achieving an increase in the accuracy of the insulation thickness of the high-temperature superconducting cable to be manufactured.

摘要翻译： 本文公开了一种用于设计用于电力传输的转换系数的22.9kV高温超导电缆的绝缘厚度的方法。 在绝缘厚度设计方法中，与绝缘层样品的绝缘击穿电场，脉冲绝缘击穿电场和局部放电起始电场特性的传统设计方法不同的是，应用于电缆绝缘厚度设计方程式 ，考虑到形状，面积和厚度以及各自的电场值对电缆绝缘厚度设计方程的影响而获得的转换系数，从而实现了高的绝缘厚度的精度的提高 要制造的超导电缆。