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

1. 发明申请

US20180329880A1 ENABLING RHETORICAL ANALYSIS VIA THE USE OF COMMUNICATIVE DISCOURSE TREES 审中-公开
公开(公告)号：US20180329880A1
公开(公告)日：2018-11-15
申请号：US15975685
申请日：2018-05-09
申请人： Oracle International Corporation
发明人： Boris Galitsky
IPC分类号： G06F17/27 , G06F17/28 , G06F17/30 , G06K9/62 , G06N3/08
CPC分类号： G06F17/279 , G06F17/271 , G06F17/2818 , G06F17/2854 , G06F17/2872 , G06F17/30625 , G06F17/30654 , G06K9/6201 , G06N3/08
摘要： Systems, devices, and methods of the present invention calculate a rhetorical relationship between one or more sentences. In an example, a computer-implemented method accesses a sentence comprising a plurality of fragments. At least one fragment includes a verb and a words. Each word includes a role of the words within the fragment. Each fragment is an elementary discourse unit. The method generates a discourse tree that represents rhetorical relationships between the sentence fragments. The discourse tree includes nodes including nonterminal and terminal nodes, each nonterminal node representing a rhetorical relationship between two of the sentence fragments, and each terminal node of the nodes of the discourse tree is associated with one of the sentence fragments. The method matches each fragment that has a verb to a verb signature, thereby creating communicative discourse tree.

2. 发明授权

US09984064B2 Reduction of memory usage in feature generation 有权
公开(公告)号：US09984064B2
公开(公告)日：2018-05-29
申请号：US14938040
申请日：2015-11-11
申请人： International Business Machines Corporation
发明人： Ken Kumagai , Akihiro Nakayama
IPC分类号： G06F17/20 , G06F17/27 , G06F17/30 , G06F17/22
CPC分类号： G06F17/278 , G06F17/2217 , G06F17/227 , G06F17/2735 , G06F17/277 , G06F17/2785 , G06F17/30625
摘要： An alignment of attributes is extracted from a pair of mentions in an annotated corpus. An annotated document is read from the annotated corpus. Three character string arrays (A, B, and C) are stored into a first TRIE. The character string arrays include character string representations of attributes of one or more first tokens, second tokens, and neighborhood tokens of mentions of the annotated document, respectively. The storing into the first TRIE obtains partial integer arrays (K, L, and M) that include identifiers corresponding to the attributes of the mentions. The partial integer arrays are stored into a second TRIE. The storing into the second TRIE obtains an identifier array (X) that includes three identifiers. The identifier array is stored into a third TRIE. The storing into the TRIE obtains one identifier of the alignment of attributes.

3. 发明授权

US09971834B2 Recommendation system and method for search input 有权
公开(公告)号：US09971834B2
公开(公告)日：2018-05-15
申请号：US14411091
申请日：2013-05-15
申请人： BEIJING QIHOO TECHNOLOGY COMPANY LIMITED
发明人： Yi Hu
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/30625 , G06F17/30669
摘要： The present invention discloses a recommendation system and method for search input. It relates to the field of search engine. The system comprises: a keyword acquisition unit configured to obtain a keyword according to a user input; a search tree storage unit configured to store Chinese characters in a tree data structure, wherein each data node in the tree stores one Chinese character and the address information of the recommended word(s) containing the Chinese character; a recommended word database configured to store the recommended words; an address acquisition unit configured to query the search tree storage unit according to the search keyword to acquire the address information of the recommended word(s); and a suggesting unit configured to query the recommended word database according to the address information to acquire the recommended word(s) and then suggest the recommended word(s) to the user.

4. 发明授权

US09922084B2 Events sets in a visually distinct display format 有权
公开(公告)号：US09922084B2
公开(公告)日：2018-03-20
申请号：US14610710
申请日：2015-01-30
申请人： SPLUNK, INC.
发明人： Marc Vincent Robichaud
IPC分类号： G06F17/30
CPC分类号： G06F17/30448 , G06F17/30064 , G06F17/30377 , G06F17/30551 , G06F17/30616 , G06F17/30625 , G06F17/30696 , G06F17/3087
摘要： A request is received to display at least a portion of a first events set and at least a portion of a second events set in an interleaved and visually distinct display format, where, in the interleaved and visually distinct display format, the at least a portion of the first events set is displayed in a visually distinct manner from the at least a portion of the second events set, and data from the at least a portion of the first events set is interleaved with data from the at least a portion of the second events set. In response to receiving the request, display is caused, on a user interface, of the at least a portion of the first events set and the at least a portion of the second events set in the interleaved and visually distinct display format.

5. 发明授权

US09916359B2 Indexing dynamic hierarchical data 有权
公开(公告)号：US09916359B2
公开(公告)日：2018-03-13
申请号：US14727177
申请日：2015-06-01
申请人： SAP SE
发明人： Jan Finis , Robert Brunel
IPC分类号： G06F17/30
CPC分类号： G06F17/30504 , G06F17/30327 , G06F17/30333 , G06F17/30589 , G06F17/30613 , G06F17/30619 , G06F17/30625 , G06F17/30631 , G06F17/30961
摘要： A system includes storage of data of a hierarchy, where each node of the hierarchy is represented by a row, and each row includes a level of its respective node, a pointer to a lower bound entry of an order index structure associated with the hierarchy, and a pointer to an upper bound entry of the order index structure associated with the hierarchy, reception of a pointer l, and determination of an entry e of the order index structure to which the received pointer l points.

6. 发明授权

US09805079B2 Executing constant time relational queries against structured and semi-structured data 有权
公开(公告)号：US09805079B2
公开(公告)日：2017-10-31
申请号：US14720481
申请日：2015-05-22
申请人： Xcalar, Inc.
发明人： Vikram Joshi , Jerene Yang , Brent Lim Tze Hao , Michael Brown
IPC分类号： G06F17/30 , G06F3/0484
CPC分类号： G06F17/30336 , G06F3/04842 , G06F17/30321 , G06F17/30398 , G06F17/30448 , G06F17/30545 , G06F17/30554 , G06F17/30566 , G06F17/30622 , G06F17/30625 , G06F17/30628 , G06F17/30631 , G06F17/30911
摘要： Techniques are described herein for performing database operations against location and access transparent metadata units called fat pointers organized into globally distributed data structures. The fat pointers are created by extracting values corresponding to a particular key and paring each value with a reference to the local location and server that has the native format record containing the value. The fat pointers may be transferred to any server in the cluster, even if the server is different from the server that has the native format record. In general, most operations are performed against fat pointers rather than the native format records. This allows the cluster to perform work against arbitrary types of data efficiently and in a constant amount of time despite the variable sizes and structures of records.

7. 发明申请

US20170293675A1 SYSTEM AND METHOD FOR AUTOMATIC CONTENT AGGREGATION GENERATION 审中-公开
公开(公告)号：US20170293675A1
公开(公告)日：2017-10-12
申请号：US15236275
申请日：2016-08-12
申请人： Pearson Education, Inc.
发明人： Sean York , Tim Stewart , David Strong , Scott Hellman , William Murray
IPC分类号： G06F17/30 , G06F17/27
CPC分类号： G06N5/04 , G06F17/271 , G06F17/30625 , G06F17/30684 , G06F17/30696 , G06F17/30702 , G06N3/02 , G06N5/003 , G06N5/02 , G06N7/005 , G06N99/005 , G06Q30/02 , G06Q30/0224 , G06Q30/0269 , H04L12/407 , H04L12/4641 , H04L41/145 , H04L41/5051 , H04L43/16 , H04L45/7457 , H04L47/10 , H04L65/1069 , H04L67/02 , H04L67/06 , H04L67/10 , H04L67/146 , H04L67/22 , H04L67/306 , H04L67/322 , H04W88/02
摘要： Systems and methods for content aggregation creation are disclosed herein. The system can include memory having a content database and an aggregation database. The system can include a user device having a first network interface and a first I/O subsystem. The system can include a server that can: provide content to the user device via a first electrical signal; receive a selection of a portion of the provided content from the user device via a second electrical signal; automatically extract sentences from the selected portion of the provided content via a natural language processor; automatically generate a parse tree for one of the automatically extracted sentences; identify noun phrases from the part of speech tags within the parse tree; place content associated with one of the noun phrase in a content aggregation; and output the content aggregation to the user device.

8. 发明授权

US09727635B2 Combined code searching and automatic code navigation 有权
公开(公告)号：US09727635B2
公开(公告)日：2017-08-08
申请号：US13760775
申请日：2013-02-06
申请人： ABB Research Ltd.
发明人： David Carroll Shepherd , Brian P. Robinson
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30625 , G06F17/30864 , G06F17/30867
摘要： Software code changes are facilitated by receiving as input a user query specifying a search term and automatically generating a ranked list of connected call trees based on the search term. Each connected call tree identifies subroutines that contain an identifier matching at least part of the search term or that are linked to a subroutine that contains an identifier matching at least part of the search term. The ranked list of connected call trees is displayed as a diagram.

9. 发明授权

US09589005B2 Method, system and computer program product for storing a decision tree 有权
标题翻译：用于存储决策树的方法，系统和计算机程序产品
公开(公告)号：US09589005B2
公开(公告)日：2017-03-07
申请号：US13439013
申请日：2012-04-04
申请人： Goksel Dedeoglu
发明人： Goksel Dedeoglu
IPC分类号： G06F12/02 , G06F17/30
CPC分类号： G06F17/30327 , G06F12/0207 , G06F17/30625 , G06F17/30961
摘要： At least first nodes and second nodes of a decision tree are stored within a memory of an information handling system. The first nodes include a first parent node and first remaining nodes that descend from the first parent node. The second nodes include a second parent node and second remaining nodes that descend from the second parent node. The first nodes are grouped into a first packed node stored in first physically contiguous locations of the memory. The first nodes are sequenced in the first physically contiguous locations according to respective depth levels of the first nodes within the decision tree. The second nodes are grouped into a second packed node stored in second physically contiguous locations of the memory. The second nodes are sequenced in the second physically contiguous locations according to respective depth levels of the second nodes within the decision tree.
摘要翻译：决策树的至少第一节点和第二节点存储在信息处理系统的存储器内。第一节点包括第一父节点和从第一父节点下降的第一剩余节点。第二节点包括从第二父节点下降的第二父节点和第二剩余节点。第一节点被分组为存储在存储器的第一物理连续位置中的第一打包节点。第一个节点根据决策树中第一个节点的相应深度级别在第一个物理连续的位置进行排序。第二节点被分组成存储在存储器的第二物理连续位置中的第二打包节点。根据决策树内第二个节点的相应深度级别，第二个节点在第二个物理连续的位置进行排序。

10. 发明申请

US20170061331A1 Methods and systems for automatic selection of classification and regression trees having preferred consistency and accuracy 有权
标题翻译：自动选择分类和回归树的方法和系统具有优选的一致性和准确性
公开(公告)号：US20170061331A1
公开(公告)日：2017-03-02
申请号：US15350061
申请日：2016-11-13
申请人： HEALTH CARE PRODUCTIVITY, INC
发明人： Dan Steinberg , Nicholas Scott Cardell
IPC分类号： G06N99/00 , G06N5/02 , G06Q20/40 , G06F17/30 , G06Q30/02
CPC分类号： G06F17/30961 , G06F17/30327 , G06F17/30339 , G06F17/30371 , G06F17/3053 , G06F17/30625 , G06F2216/03 , G06K9/6282 , G06N5/022 , G06N99/005 , G06Q20/4016 , G06Q30/0254 , G06Q40/08
摘要： Methods and systems for automatically identifying and selecting preferred classification and regression trees are disclosed. Embodiments of the disclosed invention may be used to identify a specific decision tree or group of preferred trees that are predictively consistent across train and test samples evaluated against at least one node-specific constraint imposed by the decision-maker, while also having high predictive performance accuracy. Specifically, for a tree to be identified as preferred by embodiments of the disclosed invention, the train and test samples when evaluated node-by-node must agree on at least one key measure of predictive consistency. In addition to this node-by-node criterion, the decision-maker may adjust selection constraints to permit selection of a tree having a small number of node-by-node consistency disagreements, but with high overall tree predictive performance accuracy.
摘要翻译：公开了用于自动识别和选择优选分类和回归树的方法和系统。所公开的发明的实施例可以用于识别针对由决策者施加的至少一个特定于节点的约束而对列车和测试样本进行预测一致的优选树的特定决策树或组，同时还具有高预测性能准确性。具体来说，对于通过所公开的发明的实施例来确定为优选的树，当逐个节点评估时，列车和测试样本必须对预测一致性的至少一个关键度量达成一致。除了该逐个节点标准之外，决策者可以调整选择约束以允许选择具有小数量的逐个节点一致性不一致的树，但是具有高的整体树预测性能精度。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式