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

31. 发明授权

US09466027B2 Using ontologies to comprehend regular expressions 有权
公开(公告)号：US09466027B2
公开(公告)日：2016-10-11
申请号：US14315017
申请日：2014-06-25
申请人： International Business Machines Corporation
发明人： Brian P. Byrne , Ivan M. Milman , Martin A. Oberhofer , Sushain Pandit
IPC分类号： G06F17/30 , G06N5/04 , G06F17/27 , G06N5/02
CPC分类号： G06F17/30734 , G06F17/2705 , G06F17/2785 , G06F17/30345 , G06F17/3053 , G06F17/30952 , G06F17/30985 , G06N5/022 , G06N5/04
摘要： Ontologies are used to comprehend regular expressions, by selecting, based on a context relating to a domain of a regular expression, an ontology and an assertion base, parsing the regular expression to identify at least one fragment of the regular expression, identifying one or more assertions in the assertion base corresponding to one of the identified fragments, identifying, for each identified assertion, an associated node in the ontology, and returning, based on the associated nodes, a concept in the ontology as representing the associated fragment of the regular expression.

32. 发明授权

US09460196B2 Conditional string search 有权
标题翻译：条件字符串搜索
公开(公告)号：US09460196B2
公开(公告)日：2016-10-04
申请号：US14474241
申请日：2014-09-01
申请人： Kevin Gerard Boyce
发明人： Kevin Gerard Boyce
IPC分类号： G06F17/30 , G06F17/27
CPC分类号： G06F17/30705 , G06F17/2765 , G06F17/30684 , G06F17/30985
摘要： A method and a system for efficient search of string patterns characterized by positional relationships in a character stream are disclosed. The method is based on grouping string patterns of a dictionary into at least two string sets and performing string search processes of a text of the character stream based on individual string sets with the outcome of a search process influencing a subsequent search process. A system implementing the method comprises a dictionary processor for generating string sets with corresponding text actions and search actions, a conditional search engine for locating string patterns belonging to at least one string set in a text according to a current search state, a text operator for producing an output text according to search results, and a search operator for determining a subsequent search state.
摘要翻译：公开了一种用于有效搜索由字符流中的位置关系表征的字符串模式的方法和系统。该方法基于将字典的字符串模式分组为至少两个字符串集合，并且基于具有影响后续搜索处理的搜索过程的结果的单独字符串集合来执行字符流的文本的字符串搜索处理。实现该方法的系统包括用于生成具有相应文本动作和搜索动作的字符串组的字典处理器，用于根据当前搜索状态定位属于文本中至少一个字符串的字符串模式的条件搜索引擎，用于根据搜索结果生成输出文本，以及用于确定后续搜索状态的搜索运算符。

33. 发明申请

US20160275205A1 REGULAR EXPRESSION MATCHING 审中-公开
标题翻译：常规表达匹配
公开(公告)号：US20160275205A1
公开(公告)日：2016-09-22
申请号：US15032851
申请日：2013-12-05
申请人： HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
发明人： David Lehavi , Omer Barkol
IPC分类号： G06F17/30 , G06F17/27
CPC分类号： G06F17/30985 , G06F17/2775 , G06F17/30
摘要： Example embodiments relate to regular expression matching. An example method may include generating a data structure based on a non-deterministic finite automaton (NFA) that represents a regular expression. The data structure may include a set of segments where each segment indicates a segment starting state of the NFA. Each segment may represent zero or more consecutive states of the NFA starting at the segment starting state. Different segments of the set of segments may be capable of indicating different segment starting states on the NFA. Each segment may represent a partial match of the regular expression to the string. The method may further include analyzing the string in relation to the NFA. The method may further include modifying the data structure as the string is analyzed. Such modification may include attempting to expand at least one of the segments in the set to represent additional states of the NFA.
摘要翻译：示例实施例涉及正则表达式匹配。示例性方法可以包括基于表示正则表达式的非确定性有限自动机（NFA）生成数据结构。数据结构可以包括一组段，其中每个段指示NFA的段起始状态。每个段可以表示从段开始状态开始的NFA的零个或多个连续状态。该组段的不同段可能能够指示NFA上不同段的起始状态。每个段可以表示正则表达式与字符串的部分匹配。该方法还可以包括分析与NFA相关的字符串。该方法还可以包括在分析字符串时修改数据结构。这种修改可以包括尝试扩展集合中的至少一个段以表示NFA的附加状态。

34. 发明授权

US09407463B2 Systems and methods for providing a spam database and identifying spam communications 有权
标题翻译：提供垃圾邮件数据库和识别垃圾邮件通信的系统和方法
公开(公告)号：US09407463B2
公开(公告)日：2016-08-02
申请号：US13179863
申请日：2011-07-11
申请人： Rakesh Nigam , Santhosh Baramasagara Chandrasekharappa , Sivakumar Ekambaram , James Sargent , Jean-Jacques Moortgat , Senthil Kumar Sellaiya Selvaraj
发明人： Rakesh Nigam , Santhosh Baramasagara Chandrasekharappa , Sivakumar Ekambaram , James Sargent , Jean-Jacques Moortgat , Senthil Kumar Sellaiya Selvaraj
IPC分类号： G06F17/30 , G06F15/16 , H04L12/58
CPC分类号： H04L12/585 , G06F17/30985 , H04L51/12 , H04L51/16
摘要： Systems and methods are provided for identifying unsolicited or unwanted electronic communications, such as spam. The disclosed embodiments also encompass systems and methods for selecting content items from a content item database. Consistent with certain embodiments, computer-implemented systems and methods may use a clustering based statistical content matching anti-spam algorithm to identify and filter spam. Such a anti-spam algorithm may be implemented to determine a degree of similarity between an incoming e-mail with a collection of one or more spam e-mails stored in a database. If the degree of similarity exceeds a predetermined threshold, the incoming e-mail may be classified as spam. Further, in accordance with other embodiments, systems and methods may be provided to determine a degree of similarity between a query or search string from a user and content items stored in a database. If the degree of similarity exceeds a predetermined threshold, the content item from the database may be identified as a content item that matches the query or search string provided by the user.
摘要翻译：提供系统和方法来识别非请求或不需要的电子通信，例如垃圾邮件。所公开的实施例还包括用于从内容项数据库中选择内容项的系统和方法。与某些实施例一致，计算机实现的系统和方法可以使用基于聚类的统计内容匹配反垃圾邮件算法来识别和过滤垃圾邮件。可以实施这样的反垃圾邮件算法以确定进入的电子邮件与存储在数据库中的一个或多个垃圾电子邮件的集合之间的相似程度。如果相似度超过预定阈值，则该入站电子邮件可被分类为垃圾邮件。此外，根据其他实施例，可以提供系统和方法来确定来自用户的查询或搜索字符串与存储在数据库中的内容项之间的相似度。如果相似度超过预定阈值，则可以将来自数据库的内容项目识别为与用户提供的查询或搜索字符串匹配的内容项目。

35. 发明申请

US20160188751A1 Rapid Searching and Matching of Data to a Dynamic Set of Signatures Facilitating Parallel Processing and Hardware Acceleration 有权
公开(公告)号：US20160188751A1
公开(公告)日：2016-06-30
申请号：US14746340
申请日：2015-06-22
申请人： International Business Machines Corporation
发明人： Dakshi Agrawal , Rashed Z. Bhatti , Francis N. Parr
IPC分类号： G06F17/30 , G06F17/27
CPC分类号： G06F17/30424 , G06F17/2705 , G06F17/30339 , G06F17/30864 , G06F17/30952 , G06F17/30985
摘要： A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.

36. 发明申请

US20160188664A1 Rapid Searching and Matching of Data to a Dynamic Set of Signatures Facilitating Parallel Processing and Hardware Acceleration 有权
标题翻译：快速搜索和匹配数据到一组动态的签名，促进并行处理和硬件加速
公开(公告)号：US20160188664A1
公开(公告)日：2016-06-30
申请号：US14584516
申请日：2014-12-29
申请人： International Business Machines Corporation
发明人： Dakshi Agrawal , Rashed Z. Bhatti , Francis N. Parr
IPC分类号： G06F17/30
CPC分类号： G06F17/30424 , G06F17/2705 , G06F17/30339 , G06F17/30864 , G06F17/30952 , G06F17/30985
摘要： A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.
摘要翻译：在数据处理系统中提供一种机制，用于将数据与动态签名集合进行匹配。该机制基于一组签名创建状态转换，结果和掩码（STR＆M）表。该机构并行地在多个硬件设备中的每一个中执行扫描器代码以形成多个匹配引擎。该机制将STR＆M表加载到多个匹配引擎中的每一个中。响应于接收多个输入记录，机构从多个匹配引擎中的多个输入记录中分配输入字符串，并从多个匹配引擎接收签名集匹配结果。

37. 发明申请

US20160171077A1 SYSTEMS AND METHODS FOR MULTIRESOLUTION PARSING 审中-公开
标题翻译：用于多分辨率分析的系统和方法
公开(公告)号：US20160171077A1
公开(公告)日：2016-06-16
申请号：US14883294
申请日：2015-10-14
申请人： Reservoir Labs, Inc.
发明人： Jordi Ros-Giralt , Alan Commike , Richard A. Lethin
IPC分类号： G06F17/30
CPC分类号： H04L63/1408 , G06F17/30985
摘要： A multiresolution parser (MRP) can selectively extract one or more information units from a dataset based on the available processing capacity and/or the arrival rate of the dataset. Should any of these parameters change, the MRP can adaptively change the information units to be extracted such that the benefit or value of the extracted information is maximized while minimizing the cost of extraction. This tradeoff is facilitated, at least in part, by an analysis of the spectral energy of the datasets expected to be processed by the MRP. The MRP can also determine its state after a processing iteration and use that state information in subsequent iterations to minimize the required computations in such subsequent iterations, so as to improve processing efficiency.
摘要翻译：多分辨率解析器（MRP）可以基于数据集的可用处理能力和/或到达速率从数据集中选择性地提取一个或多个信息单元。如果这些参数中的任何一个变化，则MRP可以自适应地改变要提取的信息单元，使得提取的信息的利益或价值最大化，同时最小化提取的成本。至少部分地通过对期望由MRP处理的数据集的光谱能量的分析来促进这种折衷。 MRP还可以在处理迭代之后确定其状态，并在随后的迭代中使用该状态信息以最小化在这样的后续迭代中所需的计算，以便提高处理效率。

38. 发明申请

US20160162132A1 DYNAMICALLY ORGANIZING APPLICATIONS BASED ON A CALENDAR EVENT 有权
公开(公告)号：US20160162132A1
公开(公告)日：2016-06-09
申请号：US15040863
申请日：2016-02-10
申请人： International Business Machines Corporation
发明人： Janani Janakiraman , Dany R. Madden , Meenakshi Sripal
IPC分类号： G06F3/0482 , G06F3/0484 , H04L29/08 , G06F3/0481
CPC分类号： G06F3/0482 , G06F3/04817 , G06F3/04842 , G06F17/30985 , G06Q10/06311 , G06Q10/06314 , G06Q10/107 , G06Q10/109 , G06Q10/1093 , H04L67/02 , Y10S707/951
摘要： A method for dynamically organizing applications based on a calendar event includes presenting a plurality of icons on an electronic display of a mobile device. Each icon of the plurality of icons represents an application configured to execute on the mobile device. The method further includes identifying an upcoming calendar event on a calendar linked to the mobile device and determining if there is a correlation between the application and the calendar event by comparing one or more characteristics of the application to one or more characteristics of the calendar event. The method also includes positioning the plurality of icons on the electronic display according to the determined correlation between the application and the calendar event such that icons representing applications having a positive correlation to the calendar event are positioned to be more visible than icons representing applications that do not have a positive correlation to the calendar event.

39. 发明授权

US09342592B2 Method for systematic mass normalization of titles 有权
标题翻译：标题系统大规模归一化的方法
公开(公告)号：US09342592B2
公开(公告)日：2016-05-17
申请号：US13953444
申请日：2013-07-29
申请人： Workday, Inc.
发明人： Vladimir Giverts , Jonathan Goldman , Adeyemi Ajao , Barzel Segal , Phil Monroe , Kristy Gateley , Jan Prach , Tarek Rabbani , Efraim Feinstein , Anuranjita Tewary , Lucian Lita
IPC分类号： G06F17/30 , G06F17/27
CPC分类号： G06F17/30303 , G06F17/2715 , G06F17/278 , G06F17/30091 , G06F17/30528 , G06F17/3053 , G06F17/30598 , G06F17/30705 , G06F17/3071 , G06F17/30985 , G06Q50/01
摘要： A method for normalizing raw titles to canonical titles is described. The method includes designating a set of canonical titles, generating a set of n-grams for each canonical title, assigning a set of attributes to each n-gram, assigning a set of labels to each of the attributes, and storing the labeled canonical title and labeled n-grams in a database. In some examples, a new title may be mapped to an existing canonical title in the database by generating a set of n-grams for the new title, looking up the n-grams in the database of canonical titles, retrieving the set of labels assigned to n-grams in the database that match n-grams from the new title, and assigning those labels to the corresponding attributes of the new title. The new title may then be mapped to a canonical title on the basis of similarly labeled attributes.
摘要翻译：描述了将原始标题规范化为规范标题的方法。该方法包括指定一组规范标题，为每个规范标题生成一组n-gram，为每个n-gram分配一组属性，为每个属性分配一组标签，并将标记的规范标题并在数据库中标记为n-gram。在一些示例中，新标题可以被映射到数据库中的现有规范标题，通过生成用于新标题的一组n-gram，查找规范标题数据库中的n-gram，检索分配的标签集在数据库中与新标题匹配n-gram的n-gram，并将这些标签分配给新标题的相应属性。然后可以基于类似标记的属性将新标题映射到规范标题。

40. 发明授权

US09323994B2 Multi-level hierarchical routing matrices for pattern-recognition processors 有权
标题翻译：用于模式识别处理器的多级分层路由矩阵
公开(公告)号：US09323994B2
公开(公告)日：2016-04-26
申请号：US12638759
申请日：2009-12-15
申请人： Harold B Noyes , David R. Brown
发明人： Harold B Noyes , David R. Brown
IPC分类号： G06F9/02 , G06F13/00 , G06F19/24 , G06K9/00 , G06F17/30
CPC分类号： G06F15/80 , G06F17/30985 , G06K9/00986 , G06N5/003
摘要： Multi-level hierarchical routing matrices for pattern-recognition processors are provided. One such routing matrix may include one or more programmable and/or non-programmable connections in and between levels of the matrix. The connections may couple routing lines to feature cells, groups, rows, blocks, or any other arrangement of components of the pattern-recognition processor.
摘要翻译：提供了用于模式识别处理器的多级分层路由矩阵。一个这样的路由矩阵可以包括在矩阵的层内和之间的一个或多个可编程和/或不可编程的连接。这些连接可以将路由线路耦合到特征单元，组，行，块或模式识别处理器的任何其他组件的布置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式