公开(公告)号：US07194532B2

公开(公告)日：2007-03-20

申请号：US10338840

申请日：2003-01-09

申请人： Shinichi Sazawa ,  Yuichi Sato

发明人： Shinichi Sazawa ,  Yuichi Sato

IPC分类号： G06F12/00

CPC分类号： H04L63/0428 ,  G06F17/30067 ,  H04L63/10 ,  H04L67/104 ,  H04L67/1097

摘要： In a management information generating step, management information of disks opened by a plurality of peers connected through a network is generated. In an access request step, another peer which opens a disk is selected from the management information, and a file is requested to be stored or read. In an access execution step, the file is stored or read in response to the storage request or the read request from the other peer.

摘要翻译： 在管理信息生成步骤中，生成由通过网络连接的多个对等体打开的磁盘的管理信息。 在访问请求步骤中，从管理信息中选择打开磁盘的另一对等体，并且请求存储或读取文件。 在访问执行步骤中，响应于来自另一个对等体的存储请求或读取请求来存储或读取该文件。

公开(公告)号：US20120054574A1

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

申请号：US13067301

申请日：2011-05-23

申请人： Shinichi Sazawa ,  Yuichi Sato ,  Hiroaki Kameyama

发明人： Shinichi Sazawa ,  Yuichi Sato ,  Hiroaki Kameyama

IPC分类号： H03M13/05 ,  G06F11/10

CPC分类号： H04L1/0009 ,  H04L1/0018

摘要： A data transfer method transfers data encoded with a loss correction code by using a protocol having no error correction function. The method includes acquiring a data size of transfer target data; acquiring a relationship between a code length of the loss correction code and a transfer time for the acquired data size of the transfer target data; determining an optimum code length of the loss correction code for encoding the transfer target data based on the acquired relationship between the code length and the transfer time for the acquired data size; and encoding the target data with the loss correction code having the optimum code length.

摘要翻译： 数据传输方法通过使用不具有纠错功能的协议来传送用丢失校正码编码的数据。 该方法包括获取传送目标数据的数据大小; 获取所述损失校正码的代码长度与所获取的所述转移目标数据的数据大小的传送时间之间的关系; 基于所获取的所述数据大小的所述代码长度和所述传送时间之间的关系，确定用于对所述传送目标数据进行编码的所述损失校正码的最佳码长; 并用具有最佳代码长度的损失校正码对目标数据进行编码。

公开(公告)号：US07813302B2

公开(公告)日：2010-10-12

申请号：US11043122

申请日：2005-01-27

申请人： Yosuke Senta ,  Shinichi Sazawa ,  Yuichi Sato

发明人： Yosuke Senta ,  Shinichi Sazawa ,  Yuichi Sato

IPC分类号： H04L12/28

CPC分类号： H04L12/185

摘要： When each of a plurality of peers mutually connected through a network receives connection of a new peer, each peer forms group information in which the new peer has been grouped on the basis of comparison of distances on the network among three peers of the own peer, a representative peer of an existing group, and the new peer. When the data is transmitted from the own peer, path information in which destination information of each group which has been grouped on the basis of the group information and the own peer have been registered is formed and transmitted together with the data to the representative peer of each group. When distribution information is relayed from another peer, if the own peer is included in the destination information, the reception data is fetched and the own peer is deleted, thereafter, distribution information in which the destination information of each group which has been grouped on the basis of the group information and the own peer have been registered is formed and transmitted together with the data to the representative peer of each group.

摘要翻译： 当通过网络相互连接的多个对等体中的每一个接收新对等体的连接时，基于在对等体的三个对等体之间的网络上的距离的比较，每个对等体形成其中新对等体已经被分组的组信息， 现有集团的代表同行和新的同行。 当从自身的对等体发送数据时，形成基于组信息和自己的对等体已经被分组的每个组的目的地信息的路径信息，并与该数据一起发送到代表对等体 每组。 当分发信息从另一个对等方中继时，如果自己的对等体被包含在目的地信息中，则获取接收数据并删除自己的对等体，此后分发信息，其中分组在每个对等体的目的地信息 已经登记的组信息和自己的对等体的基础与数据一起形成并发送到每个组的代表性对等体。

公开(公告)号：US20080201581A1

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

申请号：US12068976

申请日：2008-02-13

申请人： Hiroaki Kameyama ,  Yuichi Sato ,  Shinichi Sazawa

发明人： Hiroaki Kameyama ,  Yuichi Sato ,  Shinichi Sazawa

IPC分类号： H04L9/06

CPC分类号： G06F21/6227 ,  G06F2221/2107 ,  H04L9/0894

摘要： According to an aspect of an embodiment, a method comprises providing a matrix comprising m rows and n columns, each of the rows and columns comprising elements of zero and one, dividing data into n data blocks, associating each of the data blocks with each of the columns, calculating an exclusive-OR of selected data blocks in reference to one of the rows, the selected data blocks being determined by the element of one in the associated columns in the one of the rows, repeating the calculating in other rows and storing separately the calculated data resulting from the exclusive-OR of data blocks in association with the associated rows, respectively.

摘要翻译： 根据实施例的一个方面，一种方法包括提供包括m行和n列的矩阵，每个行和列包括零和一个元素，将数据划分为n个数据块，将每个数据块与每个 列，参考所述行中的一行计算所选择的数据块的异或，所选择的数据块由所述一行中的相关列中的一个元素确定，重复其他行中的计算并存储 分别计算与相关联的行相关联的数据块的异或产生的计算数据。

公开(公告)号：US20050195755A1

公开(公告)日：2005-09-08

申请号：US11043122

申请日：2005-01-27

申请人： Yosuke Senta ,  Shinichi Sazawa ,  Yuichi Sato

发明人： Yosuke Senta ,  Shinichi Sazawa ,  Yuichi Sato

IPC分类号： G06F13/00 ,  H04L12/18 ,  H04L12/28 ,  H04L12/701 ,  H04L12/733

CPC分类号： H04L12/185

摘要： When each of a plurality of peers mutually connected through a network receives connection of a new peer, each peer forms group information in which the new peer has been grouped on the basis of comparison of distances on the network among three peers of the own peer, a representative peer of an existing group, and the new peer. When the data is transmitted from the own peer, path information in which destination information of each group which has been grouped on the basis of the group information and the own peer have been registered is formed and transmitted together with the data to the representative peer of each group. When distribution information is relayed from another peer, if the own peer is included in the destination information, the reception data is fetched and the own peer is deleted, thereafter, distribution information in which the destination information of each group which has been grouped on the basis of the group information and the own peer have been registered is formed and transmitted together with the data to the representative peer of each group.

摘要翻译： 当通过网络相互连接的多个对等体中的每一个接收新对等体的连接时，基于在对等体的三个对等体之间的网络上的距离的比较，每个对等体形成其中新对等体已经被分组的组信息， 现有集团的代表同行和新的同行。 当从自身的对等体发送数据时，形成基于组信息和自己的对等体已经被分组的每个组的目的地信息的路径信息，并与该数据一起发送到代表对等体 每组。 当分发信息从另一个对等方中继时，如果自己的对等体被包含在目的地信息中，则取出接收数据并删除自己的对等体，之后，分发信息，其中分组在每个对等体的目的地信息 已经登记的组信息和自己的对等体的基础与数据一起形成并发送到每个组的代表性对等体。

公开(公告)号：US08812866B2

公开(公告)日：2014-08-19

申请号：US12068976

申请日：2008-02-13

申请人： Hiroaki Kameyama ,  Yuichi Sato ,  Shinichi Sazawa

发明人： Hiroaki Kameyama ,  Yuichi Sato ,  Shinichi Sazawa

IPC分类号： G06F11/30 ,  G11C7/00

CPC分类号： G06F21/6227 ,  G06F2221/2107 ,  H04L9/0894

摘要： According to an aspect of an embodiment, a method comprises providing a matrix comprising m rows and n columns, each of the rows and columns comprising elements of zero and one, dividing data into n data blocks, associating each of the data blocks with each of the columns, calculating an exclusive-OR of selected data blocks in reference to one of the rows, the selected data blocks being determined by the element of one in the associated columns in the one of the rows, repeating the calculating in other rows and storing separately the calculated data resulting from the exclusive-OR of data blocks in association with the associated rows, respectively.

摘要翻译： 根据实施例的一个方面，一种方法包括提供包括m行和n列的矩阵，每个行和列包括零和一个元素，将数据划分为n个数据块，将每个数据块与每个 列，参考所述行中的一行计算所选择的数据块的异或，所选择的数据块由所述一行中的相关列中的一个元素确定，重复其他行中的计算并存储 分别计算与相关联的行相关联的数据块的异或产生的计算数据。

公开(公告)号：US08504899B2

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

申请号：US13067301

申请日：2011-05-23

申请人： Shinichi Sazawa ,  Yuichi Sato ,  Hiroaki Kameyama

发明人： Shinichi Sazawa ,  Yuichi Sato ,  Hiroaki Kameyama

IPC分类号： G11C29/00 ,  G01R31/28

CPC分类号： H04L1/0009 ,  H04L1/0018

摘要： A data transfer method transfers data encoded with a loss correction code by using a protocol having no error correction function. The method includes acquiring a data size of transfer target data; acquiring a relationship between a code length of the loss correction code and a transfer time for the acquired data size of the transfer target data; determining an optimum code length of the loss correction code for encoding the transfer target data based on the acquired relationship between the code length and the transfer time for the acquired data size; and encoding the target data with the loss correction code having the optimum code length.

摘要翻译： 数据传输方法通过使用不具有纠错功能的协议来传送用丢失校正码编码的数据。 该方法包括获取传送目标数据的数据大小; 获取所述损失校正码的代码长度与所获取的所述转移目标数据的数据大小的传送时间之间的关系; 基于所获取的所述数据大小的所述代码长度和所述传送时间之间的关系，确定用于对所述传送目标数据进行编码的所述损失校正码的最佳码长; 并用具有最佳代码长度的损失校正码对目标数据进行编码。

公开(公告)号：US20130083057A1

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

申请号：US13605367

申请日：2012-09-06

申请人： Hiroki KOBAYASHI ,  Yuichi Sato ,  Masayoshi Hashima ,  Shinichi Sazawa ,  Hiroaki Kameyama ,  Hideki Abe ,  Sachio Kobayashi

发明人： Hiroki KOBAYASHI ,  Yuichi Sato ,  Masayoshi Hashima ,  Shinichi Sazawa ,  Hiroaki Kameyama ,  Hideki Abe ,  Sachio Kobayashi

IPC分类号： G09G5/377 ,  G09G5/00

CPC分类号： G09G5/377 ,  G06K7/10009 ,  G06K19/0723 ,  G06Q10/063 ,  G06Q10/20 ,  G09G5/00 ,  H02G1/00

摘要： A system stores identification information for identification of a part associated with installation information for designation of a position where the part is installed in a first apparatus; receives the identification information about the part to be read and transmits it by a second apparatus; and retrieves the received identification information from the storage unit, and generates a first composite image by combining installation information corresponding to the retrieved identification information with an image of the first apparatus.

摘要翻译： 系统存储用于识别与用于指定安装在第一装置中的位置的安装信息相关联的部件的识别信息; 接收关于要读取的部分的识别信息，并由第二装置发送; 并且从所述存储单元检索所接收的识别信息，并且通过将与所检索的识别信息相对应的安装信息与所述第一装置的图像组合来生成第一合成图像。

公开(公告)号：US07739579B2

公开(公告)日：2010-06-15

申请号：US11443201

申请日：2006-05-31

申请人： Hiroaki Kameyama ,  Shinichi Sazawa ,  Yuichi Sato

发明人： Hiroaki Kameyama ,  Shinichi Sazawa ,  Yuichi Sato

IPC分类号： G11C29/00

CPC分类号： G06F11/1076

摘要： A storage apparatus composed of a plurality of magnetic disk devices are provided. An encoding unit generates, after dividing original data, a plurality pieces of encoded data equal to or more than the number of division by use of a code of which redundancy is variable. A redundancy control unit varies the redundancy in the encoding unit in accordance with the importance of the original data. A distribution processing unit distributes and stores the plurality of encoded data to and in the plurality of magnetic disk devices. A decoding unit retrieves the encoded data corresponding to, at least, the division number of the original data from the magnetic disk devices so as to decode the original data.

摘要翻译： 提供由多个磁盘装置构成的存储装置。 编码单元在分割原始数据之后，通过使用冗余是可变的代码，生成等于或大于划分数的多条编码数据。 冗余控制单元根据原始数据的重要性改变编码单元中的冗余度。 分发处理单元将多个编码数据分配并存储在多个磁盘装置中。 解码单元至少从磁盘装置检索与原始数据的分割数相对应的编码数据，以解码原始数据。

公开(公告)号：US07636310B2

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

申请号：US11287318

申请日：2005-11-28

申请人： Yosuke Senta ,  Shinichi Sazawa ,  Yuichi Sato

发明人： Yosuke Senta ,  Shinichi Sazawa ,  Yuichi Sato

IPC分类号： H04L12/26

CPC分类号： H04L1/1678 ,  H04L1/0002 ,  H04L47/10 ,  H04L47/283 ,  H04L69/16 ,  H04L69/163

摘要： In a communication control system a reception-side terminal sends back transmission time information included in a transmission packet as an acknowledgment to a transmission-side terminal. The transmission-side terminal determines whether a response time, obtained from the transmission time information, is shorter than a threshold. When the response time is shorter, the transmission-side terminal controls so as to transmit to the reception-side terminal a larger number of packets than the number of packets upon transmission of the transmission packet, or to transmit the same number of packets as the number of packets upon transmission of the transmission packet.

摘要翻译： 在通信控制系统中，接收侧终端将包含在发送分组中的发送时间信息作为确认发送回发送侧终端。 发送侧终端确定从传输时间信息获得的响应时间是否短于阈值。 当响应时间较短时，发送方终端控制发送方，从而向接收侧终端发送比发送分组的发送时的分组数更多的分组，或者发送与发送侧终端相同数量的分组 传输数据包的数据包数。