专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

51. 发明授权

US08799310B2 Method and system for processing a uniform resource locator 有权
标题翻译：用于处理统一资源定位符的方法和系统
公开(公告)号：US08799310B2
公开(公告)日：2014-08-05
申请号：US12842434
申请日：2010-07-23
申请人： Evan R. Kirshenbaum
发明人： Evan R. Kirshenbaum
IPC分类号： G06F17/30
CPC分类号： G06Q30/0201
摘要： The present disclosure provides a computer-implemented method of processing a Uniform Resource Locator (URL). The method includes generating a plurality of lattice nodes based on a URL, wherein each of the plurality of lattice nodes includes a host component corresponding to a portion of the URL and a path component corresponding to a portion of the URL. The method also includes identifying one of the plurality of lattice nodes as a search node. The method also includes searching a pattern table database using the search node to find a matching pattern table entry, the pattern table database comprising a plurality of pattern table entries corresponding to known lattice nodes associated with previously encountered URLs. The method also includes processing the URL based on whether the matching pattern table entry was found in the pattern table database.
摘要翻译：本公开提供了一种处理统一资源定位符（URL）的计算机实现的方法。该方法包括基于URL生成多个格子节点，其中多个网格节点中的每一个包括与URL的一部分相对应的主机组件和对应于URL的一部分的路径组件。该方法还包括将多个格子节点之一识别为搜索节点。该方法还包括使用搜索节点搜索模式表数据库以找到匹配模式表条目，模式表数据库包括与先前遇到的URL相关联的已知网格节点对应的多个模式表条目。该方法还包括基于在模式表数据库中是否找到匹配模式表条目来处理该URL。

52. 发明申请

US20120023127A1 METHOD AND SYSTEM FOR PROCESSING A UNIFORM RESOURCE LOCATOR 有权
标题翻译：用于处理均匀资源定位器的方法和系统
公开(公告)号：US20120023127A1
公开(公告)日：2012-01-26
申请号：US12842434
申请日：2010-07-23
申请人： Evan R. Kirshenbaum
发明人： Evan R. Kirshenbaum
IPC分类号： G06F17/30
CPC分类号： G06Q30/0201
摘要： The present disclosure provides a computer-implemented method of processing a Uniform Resource Locator (URL). The method includes generating a plurality of lattice nodes based on a URL, wherein each of the plurality of lattice nodes includes a host component corresponding to a portion of the URL and a path component corresponding to a portion of the URL. The method also includes identifying one of the plurality of lattice nodes as a search node. The method also includes searching a pattern table database using the search node to find a matching pattern table entry, the pattern table database comprising a plurality of pattern table entries corresponding to known lattice nodes associated with previously encountered URLs. The method also includes processing the URL based on whether the matching pattern table entry was found in the pattern table database.
摘要翻译：本公开提供了一种处理统一资源定位符（URL）的计算机实现的方法。该方法包括基于URL生成多个格子节点，其中多个网格节点中的每一个包括与URL的一部分相对应的主机组件和对应于URL的一部分的路径组件。该方法还包括将多个格子节点之一识别为搜索节点。该方法还包括使用搜索节点搜索模式表数据库以找到匹配模式表条目，模式表数据库包括与先前遇到的URL相关联的已知网格节点对应的多个模式表条目。该方法还包括基于在模式表数据库中是否找到匹配模式表条目来处理该URL。

53. 发明申请

US20110060716A1 SYSTEMS AND METHODS FOR IMPROVING WEB SITE USER EXPERIENCE 有权
标题翻译：改进网站用户体验的系统和方法
公开(公告)号：US20110060716A1
公开(公告)日：2011-03-10
申请号：US12555638
申请日：2009-09-08
申请人： Geroge Forman , Evan R. Kirshenbaum
发明人： Geroge Forman , Evan R. Kirshenbaum
IPC分类号： G06F7/10 , G06F17/30 , G06N5/04
CPC分类号： G06F17/30873 , G06F17/30867
摘要： Methods, systems, and computer program products are provided for personalizing web sites. A model based on mining web usage data is accessed. The model defines associations between web sites. Interest associations extracted from web interactions are stored. The interest associations comprise interest indications and web sites associated with the interest indications. An interest indication from the interest associations is selected. The interest indication is associated with an associated web site. The associated web site has an association with a target web site as defined by the model. The interest indication is sent to the target web site.
摘要翻译：提供方法，系统和计算机程序产品用于个性化网站。访问基于挖掘Web使用数据的模型。该模型定义了网站之间的关联。存储从Web交互中提取的兴趣关联。利益协会包括与兴趣指示相关联的兴趣指示和网站。选择利益关联的兴趣指示。兴趣指示与相关联的网站相关联。相关网站与模型定义的目标网站有关联。兴趣指示被发送到目标网站。

54. 发明授权

US07856437B2 Storing nodes representing respective chunks of files in a data store 有权
标题翻译：将表示各个文件块的节点存储在数据存储中
公开(公告)号：US07856437B2
公开(公告)日：2010-12-21
申请号：US11888092
申请日：2007-07-31
申请人： Evan R. Kirshenbaum
发明人： Evan R. Kirshenbaum
IPC分类号： G06F7/00
CPC分类号： G06F17/30097
摘要： To provide a data store, nodes representing respective chunks of files are stored in a predefined structure that defines relationships among the nodes, where the files are divided into the chunks. The nodes are collected into plural groups stored in persistent storage, where some of the nodes are collected into a particular one of the groups according to a locality relationship of the some of the nodes.
摘要翻译：为了提供数据存储，表示各个文件块的节点被存储在预定义的结构中，该结构定义了节点之间的关系，其中文件被分成块。将节点收集到存储在持久存储器中的多个组中，其中根据一些节点的位置关系将一些节点收集到组中的特定组中。

55. 发明授权

US07797282B1 System and method for modifying a training set 有权
标题翻译：用于修改训练集的系统和方法
公开(公告)号：US07797282B1
公开(公告)日：2010-09-14
申请号：US11241082
申请日：2005-09-29
申请人： Evan R. Kirshenbaum , George H. Forman , Henri J. Suermondt
发明人： Evan R. Kirshenbaum , George H. Forman , Henri J. Suermondt
IPC分类号： G06F7/00
CPC分类号： G06F17/30705 , G06F17/30731
摘要： Information representing a hierarchy of categories is stored. An indication is received that a first case is either a positive case or a negative case for a first category in the hierarchy of categories. The first case is identified, by inference, as a positive case or negative case for a second category in the hierarchy based on relationship of the second category to the first category. A training set for the second category is modified based on the identification by reference.
摘要翻译：存储表示分类层次的信息。接收到指示，即第一种情况是类别层级中的第一类别的肯定情况或否定情况。根据第二类别与第一类别的关系，第一种情况通过推论确定为层次结构中的第二类别的肯定案例或否定案例。根据参考的识别修改第二类的训练集。

56. 发明申请

US20100082865A1 Access Grants 有权
标题翻译：获取赠款
公开(公告)号：US20100082865A1
公开(公告)日：2010-04-01
申请号：US12243896
申请日：2008-10-01
申请人： Evan R. Kirshenbaum
发明人： Evan R. Kirshenbaum
IPC分类号： G06F13/362
CPC分类号： G06F21/6218
摘要： Provided are, among other things, systems, methods, apparatuses and techniques for storing access grants. In one implementation, a blinding factor and access information for accessing a restricted object are obtained; blinded access information is generated for the restricted object based on the access information and the blinding factor; and an anchor node is stored into a data store, with the anchor node being accessible by submission of an identifier, the anchor node at least one of containing or referring to sufficient information to obtain access to the blinding factor and the blinded access information, and the identifier for the anchor node being independent of the blinding factor.
摘要翻译：除其他之外，提供用于存储访问授权的系统，方法，设备和技术。在一个实现中，获得用于访问受限制对象的盲目因素和访问信息; 基于访问信息和盲目因素为受限对象生成盲目的访问信息; 并且锚节点被存储到数据存储器中，通过提交标识符可以访问锚节点，锚节点至少包含或引用足够的信息以获得对盲人因素和盲目访问信息的访问，以及锚点节点的标识符与盲目因素无关。

57. 发明授权

US07593904B1 Effecting action to address an issue associated with a category based on information that enables ranking of categories 有权
标题翻译：根据能够对类别进行排序的信息来处理与类别相关的问题的行动
公开(公告)号：US07593904B1
公开(公告)日：2009-09-22
申请号：US11172187
申请日：2005-06-30
申请人： Evan R. Kirshenbaum , Henri J. Suermondt , George H. Forman , Thomas M. Tripp
发明人： Evan R. Kirshenbaum , Henri J. Suermondt , George H. Forman , Thomas M. Tripp
IPC分类号： G06F15/18
CPC分类号： G06N99/005 , G06Q10/10
摘要： A categorizer is trained for plural categories according to a machine-learning algorithm. The categorizer classifies cases in a set of cases into the plural categories. One or more quantification measures regarding cases in the data set are computed based on output from the categorizer, and information is provided to enable ranking of the categories based on the one or more quantification measures. Action is effected to address an issue associated with at least one of the categories based on the provided information.
摘要翻译：根据机器学习算法，分类器被训练用于多个类别。分类器将一组案例中的案例分为多个类别。基于分类器的输出来计算关于数据集中的情况的一个或多个量化措施，并且提供信息以使得能够基于一个或多个量化措施对类别进行排名。根据所提供的信息，采取行动解决与至少一个类别有关的问题。

58. 发明申请

US20090037500A1 Storing nodes representing respective chunks of files in a data store 有权
标题翻译：将表示各个文件块的节点存储在数据存储中
公开(公告)号：US20090037500A1
公开(公告)日：2009-02-05
申请号：US11888092
申请日：2007-07-31
申请人： Evan R. Kirshenbaum
发明人： Evan R. Kirshenbaum
IPC分类号： G06F17/30
CPC分类号： G06F17/30097
摘要： To provide a data store, nodes representing respective chunks of files are stored in a predefined structure that defines relationships among the nodes, where the files are divided into the chunks. The nodes are collected into plural groups stored in persistent storage, where some of the nodes are collected into a particular one of the groups according to a locality relationship of the some of the nodes.
摘要翻译：为了提供数据存储，表示各个文件块的节点被存储在预定义的结构中，该结构定义了节点之间的关系，其中文件被分成块。将节点收集到存储在持久存储器中的多个组中，其中根据一些节点的位置关系将一些节点收集到组中的特定组中。

59. 发明授权

US06584401B2 Automatic gathering and analysis of data on commute paths 有权
标题翻译：自动收集和分析通勤路径上的数据
公开(公告)号：US06584401B2
公开(公告)日：2003-06-24
申请号：US09995349
申请日：2001-11-27
申请人： Evan R. Kirshenbaum , Kave Eshghi , Henri Jacques Suemondt
发明人： Evan R. Kirshenbaum , Kave Eshghi , Henri Jacques Suemondt
IPC分类号： G01C2126
CPC分类号： G08G1/20 , G01C21/26
摘要： A method and apparatus for automatically gathering data on paths taken by a number of commuters and then analyzed to provide recommendations for improving the commute experience. Data may be gathered by recording time and position data from a global positioning system (GPS) receiver the commuter carries, recording time and position data from a mobile phone the commuter carries, departure or arrival indications, or a commute log. Commute data may be augmented with a likely route generated based on a start point, an end point, and a map. Commute data may be analyzed by determining a subset of the commuters whose paths are similar. For example, they have a similar start point, a similar end point, a similar start point and a similar end point, a start point similar to a particular point, an end point similar to a particular point, or similar start and end points.
摘要翻译：一种方法和装置，用于自动收集由多名通勤者采取的路径的数据，然后进行分析，以提供改善通勤体验的建议。可以通过记录来自全球定位系统（GPS）接收器的通勤者携带的时间和位置数据来收集数据，记录来自移动电话的通勤者携带，离开或到达指示或通勤日志的时间和位置数据。可以使用基于起始点，终点和地图生成的可能路线来增加通勤数据。可以通过确定其路径相似的通勤者的子集来分析通勤数据。例如，它们具有类似的起始点，类似的终点，类似的起始点和类似的终点，类似于特定点的起始点，类似于特定点的终点或类似的起点和终点。

60. 发明授权

US08463787B2 Storing nodes representing respective chunks of files in a data store 有权
公开(公告)号：US08463787B2
公开(公告)日：2013-06-11
申请号：US12911007
申请日：2010-10-25
申请人： Evan R. Kirshenbaum
发明人： Evan R. Kirshenbaum
IPC分类号： G06F17/30
CPC分类号： G06F17/30097
摘要： To provide a data store, nodes representing respective chunks of files are stored in a predefined structure that defines relationships among the nodes, where the files are divided into the chunks. The nodes are collected into plural groups stored in persistent storage, where some of the nodes are collected into a particular one of the groups according to a locality relationship of the some of the nodes.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式