会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Method and data structure for performing regular expression searches in a fixed length word language
    • 用固定长度的单词语言执行正则表达式搜索的方法和数据结构
    • US06996562B2
    • 2006-02-07
    • US10207423
    • 2002-07-29
    • Amit Finkelstein
    • Amit Finkelstein
    • G06F17/30
    • G06F17/30616Y10S707/99934Y10S707/99936Y10S707/99943
    • Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the “?” sign (any single character), the method of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The method may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the method of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.
    • 给定一个具有固定长度的所有单词的语言,以及仅由语言字母表中的字符组成的一组正则表达式或“?” 符号(任何单个字符),本发明的方法定义了用于有效地找到给定查询词的匹配正则表达式的集合的数据结构。 可以通过适当地选择控制变量来调整该方法,以改变所需的存储空间和完成查询所需的搜索时间。 具体地说,本发明的方法提供本发明的数据结构所需的存储空间与搜索这些数据结构以确定正则表达式的匹配集合的时间量之间的空间对时间权衡。
    • 12. 发明授权
    • Transparently extensible firewall cluster
    • 透明的可扩展防火墙集群
    • US08353020B2
    • 2013-01-08
    • US11453778
    • 2006-06-14
    • Amit FinkelsteinAvihai LifschitzYosef DinersteinZiv Caspi
    • Amit FinkelsteinAvihai LifschitzYosef DinersteinZiv Caspi
    • H04L29/06
    • H04L63/0227
    • A generic master-slave mechanism enables a single processor of a cluster of firewall processors to define the behavior of the other processors in the cluster for a specific logical connection. The cluster of firewall processors utilizes virtual adapters representing physical adapters on other processors in the firewall cluster. This virtualization allows each cluster member to act as though it is a standalone machine that owns all local IP addresses of the entire cluster. When traffic is received by a firewall processor, the firewall processor determines if there is a master associated with the logical connection for the traffic. If so, the traffic is routed to the master. If no master is associated, in an example configuration, the receiving firewall processor becomes the master. A message traffic logical connection has a single master. A master remains the master of a logical connection until the connection is terminated.
    • 通用主从机制使得防火墙处理器群集的单个处理器可以定义集群中其他处理器的特定逻辑连接的行为。 防火墙处理器集群利用虚拟适配器代表防火墙集群中其他处理器上的物理适配器。 这种虚拟化允许每个集群成员就像是拥有整个集群的所有本地IP地址的独立机器一样。 当防火墙处理器接收到流量时,防火墙处理器确定是否存在与流量的逻辑连接相关联的主机。 如果是,则流量被路由到主服务器。 如果没有与主机相关联,则在示例配置中,接收防火墙处理器成为主设备。 消息流量逻辑连接具有单个主服务器。 在连接终止之前,主器件保持逻辑连接的主器件。
    • 14. 发明授权
    • Method and data structure for performing regular expression searches in a fixed length word language
    • 用固定长度的单词语言执行正则表达式搜索的方法和数据结构
    • US07412443B2
    • 2008-08-12
    • US11196157
    • 2005-08-03
    • Amit Finkelstein
    • Amit Finkelstein
    • G06F17/30
    • G06F17/30616Y10S707/99934Y10S707/99936Y10S707/99943
    • Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the “?” sign (any single character), the method of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The method may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the method of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.
    • 给定一个具有固定长度的所有单词的语言,以及仅由语言字母表中的字符组成的一组正则表达式或“?” 符号(任何单个字符),本发明的方法定义了用于有效地找到给定查询词的匹配正则表达式的集合的数据结构。 可以通过适当地选择控制变量来调整该方法,以改变所需的存储空间和完成查询所需的搜索时间。 具体地说,本发明的方法提供本发明的数据结构所需的存储空间与搜索这些数据结构以确定正则表达式的匹配集合的时间量之间的空间对时间权衡。
    • 15. 发明申请
    • Transparently extensible firewall cluster
    • 透明的可扩展防火墙集群
    • US20070294754A1
    • 2007-12-20
    • US11453778
    • 2006-06-14
    • Amit FinkelsteinAvihai LifschitzYosef DinersteinZiv Caspi
    • Amit FinkelsteinAvihai LifschitzYosef DinersteinZiv Caspi
    • G06F15/16
    • H04L63/0227
    • A generic master-slave mechanism enables a single processor of a cluster of firewall processors to define the behavior of the other processors in the cluster for a specific logical connection. The cluster of firewall processors utilizes virtual adapters representing physical adapters on other processors in the firewall cluster. This virtualization allows each cluster member to act as though it is a standalone machine that owns all local IP addresses of the entire cluster. When traffic is received by a firewall processor, the firewall processor determines if there is a master associated with the logical connection for the traffic. If so, the traffic is routed to the master. If no master is associated, in an example configuration, the receiving firewall processor becomes the master. A message traffic logical connection has a single master. A master remains the master of a logical connection until the connection is terminated.
    • 通用主从机制使得防火墙处理器群集的单个处理器可以定义集群中其他处理器的特定逻辑连接的行为。 防火墙处理器集群利用虚拟适配器代表防火墙集群中其他处理器上的物理适配器。 这种虚拟化允许每个集群成员就像是拥有整个集群的所有本地IP地址的独立机器一样。 当防火墙处理器接收到流量时,防火墙处理器确定是否存在与流量的逻辑连接相关联的主机。 如果是,则流量被路由到主服务器。 如果没有与主机相关联,则在示例配置中,接收防火墙处理器成为主设备。 消息流量逻辑连接具有单个主服务器。 在连接终止之前,主器件保持逻辑连接的主器件。
    • 17. 发明申请
    • Method and data structure for performing regular expression searches in a fixed length word language
    • 用固定长度的单词语言执行正则表达式搜索的方法和数据结构
    • US20050267905A1
    • 2005-12-01
    • US11196157
    • 2005-08-03
    • Amit Finkelstein
    • Amit Finkelstein
    • G06F7/00G06F17/30
    • G06F17/30616Y10S707/99934Y10S707/99936Y10S707/99943
    • Given a language with all words in a fixed length, and a set of regular expressions composed only from characters in the alphabet of the language or the “?” sign (any single character), the method of the invention defines a data structure that is used to efficiently find the set of matching regular expressions for a given query word. The method may be adjusted by appropriate selection of a control variable to vary the storage space required and the search time necessary to complete the query. Specifically, the method of the present invention provides a space versus time trade-off between the storage space required for the data structures of the present invention and the amount of time to search those data structures to determine the matching set of regular expressions.
    • 给定一个具有固定长度的所有单词的语言,以及仅由语言字母表中的字符组成的一组正则表达式或“?” 符号(任何单个字符),本发明的方法定义了用于有效地找到给定查询词的匹配正则表达式的集合的数据结构。 可以通过适当地选择控制变量来调整该方法,以改变所需的存储空间和完成查询所需的搜索时间。 具体地说,本发明的方法提供本发明的数据结构所需的存储空间与搜索这些数据结构以确定正则表达式的匹配集合的时间量之间的空间对时间权衡。