会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Data versioning in solid state memory
    • 固态存储器中的数据版本控制
    • US09135162B2
    • 2015-09-15
    • US13615867
    • 2012-09-14
    • Gokul B. KandirajuHubertus FrankeDavid Craft
    • Gokul B. KandirajuHubertus FrankeDavid Craft
    • G06F12/02
    • G06F12/0246G06F2212/7201G06F2212/7207
    • One or more embodiments are directed a solid state storage device for maintaining versions of data. The solid state storage device comprises a processor and a solid state memory communicatively coupled to the processor. A flash translation layer is configured to perform a method comprising creating at least one data structure associated with at least one logical page of the solid state memory. The logical page is associated with at least one physical page in a data block of the solid state memory. A first set of information associated with the logical page is stored in the data structure. A second set of information associated with the physical page is stored in the data structure. The second set of information comprises at least versioning information identifying which version of the logical page is represented by a dataset stored within the physical page.
    • 一个或多个实施例涉及用于维护数据版本的固态存储设备。 固态存储设备包括通信地耦合到处理器的处理器和固态存储器。 闪存转换层被配置为执行包括创建与固态存储器的至少一个逻辑页面相关联的至少一个数据结构的方法。 逻辑页面与固态存储器的数据块中的至少一个物理页面相关联。 与逻辑页面相关联的第一组信息被存储在数据结构中。 与物理页面相关联的第二组信息被存储在数据结构中。 第二组信息至少包括版本信息,识别逻辑页面的哪个版本由存储在物理页面内的数据集表示。
    • 5. 发明授权
    • Request controlling
    • 请求控制
    • US08856461B2
    • 2014-10-07
    • US13217398
    • 2011-08-25
    • Xiao Tao ChangHubertus FrankeXiaolu MeiKun WangHao Yu
    • Xiao Tao ChangHubertus FrankeXiaolu MeiKun WangHao Yu
    • G06F12/00G06F9/38G06F15/167G06F3/00G06F13/00
    • G06F15/167G06F3/00G06F9/3877G06F13/00
    • This invention provides a request controlling apparatus, processor and method. The request controlling apparatus is connected to a request storage unit and includes: a queue unit storing flag recording region configured to record a storing flag corresponding to a queue unit in the request storage unit, a comparing means configured to judge whether a incoming first queue unit corresponds to a same message as an already existing queue unit, where the already existing queue unit is in the request storage unit and a flag setting means is configured to set the storing flag corresponding to the already existing queue unit in the queue unit storing flag recording region, to indicate that a message state related to the already existing queue unit will not be stored if the first queue unit corresponds to the same message as in the already existing queue unit.
    • 本发明提供了一种请求控制装置,处理器和方法。 所述请求控制装置连接到请求存储单元,包括:队列单元,存储标记记录区域,被配置为在所述请求存储单元中记录与队列单元对应的存储标志;比较装置,被配置为判断进入的第一队列单元 对应于与现有的队列单元相同的消息,其中已经存在的队列单元在请求存储单元中,并且标志设置装置被配置为将对应于已经存在的队列单元的存储标志设置在队列单元存储标志记录中 指示如果第一队列单元对应于与已经存在的队列单元相同的消息,则与现有队列单元相关的消息状态将不被存储。
    • 6. 发明授权
    • Network intrusion protection
    • 网络入侵保护
    • US08677473B2
    • 2014-03-18
    • US12273142
    • 2008-11-18
    • David Allen DennerlineHubertus FrankeDavid Paul LaPotinTerry Lee Nelms, IIHao Yu
    • David Allen DennerlineHubertus FrankeDavid Paul LaPotinTerry Lee Nelms, IIHao Yu
    • G06F9/00H04L29/06
    • H04L63/0227H04L43/026H04L43/16H04L63/0254H04L63/1416H04L63/1433
    • Improved techniques are disclosed for use in an intrusion prevention system or the like. For example, a method comprises the following steps performed by a computing element of a network. A packet of a flow is received, the flow comprising a plurality of packets, wherein the plurality of packets represents data in the network. A network intrusion analysis cost-benefit value is determined representing a benefit for analyzing the received packet for intrusions in relation to a cost for analyzing the received packet for intrusions. The method compares the network intrusion analysis cost-benefit value to a network intrusion analysis cost-benefit threshold to determine whether analyzing the received packet for intrusions before forwarding the received packet is warranted. Responsive to a determination that analyzing the received packet for intrusions before forwarding the received packet is not warranted, the received packet is forwarded, an indication is made that subsequent packets of the flow should be forwarded, and a determination is made whether the received packet indicates an intrusion after forwarding the received packet.
    • 公开了用于入侵防御系统等的改进的技术。 例如,一种方法包括由网络的计算元件执行的以下步骤。 接收到流的分组,所述流包括多个分组,其中所述多个分组表示网络中的数据。 确定网络入侵分析成本效益值,其代表用于分析入侵的接收分组相对于用于分析所接收的分组的入侵成本的成本的益处。 该方法将网络入侵分析成本效益值与网络入侵分析成本效益阈值进行比较,以确定在转发接收到的分组之前是否分析接收到的攻击包的数据包。 响应于在转发接收到的分组之前分析入侵的接收分组的确定是不合理的,所接收的分组被转发,指示应该转发流的后续分组,并且确定接收到的分组是否指示 转发接收到的数据包后的入侵。
    • 7. 发明申请
    • ENCODED DATA PROCESSING
    • 编码数据处理
    • US20140019472A1
    • 2014-01-16
    • US13545522
    • 2012-07-10
    • Hubertus FrankeBalakrishna R. IyerHong MinTerence P. PurcellGuogen Zhang
    • Hubertus FrankeBalakrishna R. IyerHong MinTerence P. PurcellGuogen Zhang
    • G06F17/30
    • G06F17/30286G06F17/30076G06F17/30339H03M7/30
    • Techniques for encoded data processing which allow for continuous data processing as encoded data changes. Data is decomposed into one or more blocks with each block containing at least one data record. At least one data record within a given block is encoded with a first encoding process selected from one or more encoding processes. The first encoding process is associated with the given data block. Techniques evaluate whether or not to implement an encoding change for a given block when updating a given data record in the given block. Responsive to the evaluation, the given block is re-encoded with a second encoding process. Responsive to the re-encoding, the association of the given block is updated. A map is formed to convert the given data record encoded with the first encoding process to the second encoding process so as to preserve comparative relationships of the given data record.
    • 用于编码数据处理的技术,其允许作为编码数据的连续数据处理改变。 数据被分解为一个或多个块,每个块包含至少一个数据记录。 使用从一个或多个编码过程中选择的第一编码过程对给定块内的至少一个数据记录进行编码。 第一编码过程与给定的数据块相关联。 技术评估在给定块中更新给定数据记录时是否实现给定块的编码更改。 响应于评估,给定的块用第二编码过程重新编码。 响应于重新编码,给定块的关联更新。 形成地图以将用第一编码处理编码的给定数据记录转换为第二编码处理,以便保持给定数据记录的比较关系。