会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明专利
    • Data writing method in tape drive, and program
    • 磁带驱动器中的数据写入方法和程序
    • JP2013191259A
    • 2013-09-26
    • JP2012058202
    • 2012-03-15
    • Internatl Business Mach Corp インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation
    • OISHI YUTAKAFUJIWARA SHINOBU
    • G11B20/10G11B15/18G11B15/20
    • G06F3/0608G06F3/061G06F3/0643G06F3/0656G06F3/0682H04N7/18
    • PROBLEM TO BE SOLVED: To improve a data transfer speed during reading by a new data writing method to a tape.SOLUTION: A tape drive for recording data while making a tape reciprocatingly running includes (a) a step for storing data received from each of at least two data sources or more in a buffer, (b) a step for writing the data received from each of the two data sources or more and stored in the buffer in a specific area of a lap in each data source at predetermined length of the first lap in a predetermined order, and (c) a step for moving a head to a second lap of the tape when arriving at an end edge of a first lap of the tape, and writing data of each data source in a specific area of the lap in each data source at predetermined length of the second lap in an inverse order of the predetermined order of the first lap while making the tape running in the opposite direction from the writing to the first lap.
    • 要解决的问题:提高在通过新的数据写入方法读取磁带的数据传输速度。解决方案:一种用于在磁带往复运行的同时记录数据的磁带驱动器包括:(a)用于存储从每个 在缓冲器中的至少两个数据源或更多个数据源,(b)用于将从两个数据源中的每一个接收的数据或更多数据并将其存储在每个数据源中的每个数据源的特定区域中的预定长度的步骤 以预定顺序进行第一圈,以及(c)当到达磁带的第一圈的端部边缘时将磁头移动到磁带的第二圈的步骤,以及将每个数据源的数据写入特定区域 在第一圈的预定顺序与第一圈的预定顺序相反的顺序,在第二圈的预定长度的每个数据源中的搭接部分的圈数在使得带沿着从写入到第一圈的相反方向延伸。
    • 16. 发明专利
    • Tape storage device
    • 磁带存储设备
    • JP2013140653A
    • 2013-07-18
    • JP2012000308
    • 2012-01-05
    • Internatl Business Mach Corp インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation
    • TOSAKA EIJINODA TAKESHI
    • G11B20/10
    • G11B19/28G11B5/00813G11B5/09G11B19/04G11B20/10G11B20/10527G11B2020/10981
    • PROBLEM TO BE SOLVED: To provide a tape storage device capable of dissolving or reducing complicated tape travel control or head position movement control.SOLUTION: In the tape storage device including a R/W head, a data buffer, a motor driver controlling a motor for travelling a tape, and a controller, the controller performs control for: (i) writing the data stored in a buffer, subsequently writing an interval marker without interruption after the buffer is empty of the stored data, and writing next data subsequently to the interval marker when the next data is stored in the buffer in first round writing in a single track in the tape, (ii) writing data stored in the buffer in an area of the interval marker in second round writing in the single track, and (iii) writing data stored in the buffer in the area in which no data is written of the interval marker in third and subsequent rounds writing in the single track, while making the tape travel at a constant speed.
    • 要解决的问题:提供能够解决或减少复杂的磁带行驶控制或磁头位置移动控制的磁带存储装置。解决方案:在包括R / W磁头,数据缓冲器,控制电动机的电机驱动器的磁带存储装置中 用于旅行磁带和控制器时,控制器执行以下控制:(i)写入存储在缓冲器中的数据,随后在缓冲器为空的存储数据之后不间断地写入间隔标记,然后将下一个数据写入到 当在磁带中的单个轨道中的第一轮写入中将下一数据存储在缓冲器中时,间隔标记,(ii)将存储在缓冲器中的数据写入间隔标记的区域中,以在第二循环中写入单个轨道,以及( iii)在使磁带以恒定的速度行进的同时,在第三次和随后的循环中写入间隔标记的数据的区域中存储在缓冲器中的数据写入单个磁道。
    • 19. 发明专利
    • System for verifying whether character string is accepted by automaton or not
    • 用于验证自动机是否接受字符的系统
    • JP2013128175A
    • 2013-06-27
    • JP2011276303
    • 2011-12-16
    • Internatl Business Mach Corp インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation
    • WATANABE YUJITATEISHI TAKAAKI
    • H04L9/32G06F17/30
    • H04L9/28H04L9/008H04L2209/34
    • PROBLEM TO BE SOLVED: To verify whether a character string is accepted by an automaton or not.SOLUTION: There is provided a server which is connectable to a client for receiving a character string as input, has an automaton whose state transits depending on a received character, and is for determining whether or not the automaton transits to a final state by the character string. The server receives a cipher sequence, in which a factor corresponding to each character included in the character string is made to be a value obtained from encrypting a non-unit element using a first encryption system having homomorphism and a factor except the factor corresponding to the character is made to be a value obtained from encrypting a unit element using the first encryption system, from the client; generates exchange data obtained from encrypting a post-state key using the first encrypting system on the basis of the cipher sequence, correspondingly to each state of a plurality of pre-states of the automaton, depending on the reception of the cipher sequence; and encrypts the exchange data by a corresponding pre-state key to transmit the data to the client.
    • 要解决的问题:验证字符串是否被自动机接受。 解决方案:提供了一种可连接到客户端的服务器,用于接收字符串作为输入,具有其状态根据接收到的字符转移的自动机,并且用于确定自动机是否转换到最终状态 由字符串。 服务器接收密码序列,其中将与字符串中包含的每个字符相对应的因子设为从使用具有同态的第一加密系统加密非单元元素获得的值,以及除了与 使用第一加密系统从客户端加密单元获得的值; 根据密码序列的接收,根据密码序列,根据自动机的多个前置状态的各状态生成使用第一加密系统对后状态密钥进行加密而获得的交换数据; 并通过相应的前置状态密钥对交换数据进行加密,以将数据发送给客户端。 版权所有(C)2013,JPO&INPIT