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

1. 发明授权

US07418445B1 Method for reducing the scope of the K node construction lock 有权
标题翻译：减少K节点施工锁的范围的方法
公开(公告)号：US07418445B1
公开(公告)日：2008-08-26
申请号：US11185627
申请日：2005-07-20
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar , Steven L. Rajcan
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar , Steven L. Rajcan
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30985 , G06F17/30327 , G06F17/30362 , Y10S707/99938 , Y10S707/99942 , Y10S707/99943
摘要： A method for recording information in an interlocking trees datastore having a plurality of K paths includes receiving an input particle and building a new K node in accordance with the received input particle. A K node is locked in accordance with the building of the new K node to provide a locked node. The locked node can be the Case node of the new K node. The Case bi-directional link between the locked Case node and the new K node is completed while the locked Case node is locked. A pointer is added to the new K node to an asCase list of the locked Case node. The locked node is locked only while adding the pointer to the new K node to the asCase list of the locked Case node. The locked node can also be a Result node of the new K node.
摘要翻译：用于在具有多个K路径的互锁树数据存储区中记录信息的方法包括接收输入粒子并根据所接收的输入粒子建立新的K节点。 K节点根据新的K节点的建立进行锁定，以提供锁定的节点。锁定的节点可以是新的K节点的Case节点。锁定的Case节点被锁定之前，锁定的Case节点和新的K节点之间的Case双向链接完成。指针被添加到新的K节点到锁定的Case节点的asCase列表。只有将指向新的K节点的指针添加到锁定的Case节点的asCase列表时，锁定的节点才被锁定。锁定的节点也可以是新的K节点的结果节点。

2. 发明授权

US07409380B1 Facilitated reuse of K locations in a knowledge store 失效
标题翻译：便于在知识库中重新使用K个位置
公开(公告)号：US07409380B1
公开(公告)日：2008-08-05
申请号：US11100830
申请日：2005-04-07
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar , Timothy William Collins , Steven L. Rajcan
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar , Timothy William Collins , Steven L. Rajcan
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06N99/005 , Y10S707/99931
摘要： In learning for an interlocking trees datastore or KStore, the process is made more efficient by noting the (n-level) address within the KStore during the learning of each particle. In a pre-particle stream of data, which may be organized within or before the Learn Engine prior to this, “Marks” and “References” are inserted. Each Mark identifies where any number of References may start the learning process, enabling the avoidance of re-learning redundant data. Thus, in a field record data set, the redundant data fields (or even partial fields) can be skipped over and only the new data learned. The Marks and References are removed before processing into a particle stream. When particles are learned the K Engine returns the n-level address or pointer(s) which the Learn Engine uses to associate with the relevant Reference(s). The system can be implemented in hardware if desired to speed processing. No limit to the distribution or numbers of KStores, Learn Engines being used or K Engines being used is indicated.
摘要翻译：在学习联锁树数据库或KStore时，通过在学习每个粒子期间注意KStore内的（n级）地址，可以使该过程更有效率。在数据之前的粒子流中，可以在之前或之前组织学习引擎之前，插入“标记”和“参考”。每个标记识别任何数量的参考文献可以启动学习过程，从而避免重新学习冗余数据。因此，在现场记录数据集中，可以跳过冗余数据字段（或甚至部分字段），并且只能学习新的数据。标记和参考文献在加工成粒子流之前被去除。当学习粒子时，K引擎返回学习引擎使用的n级地址或指针与相关引用关联。如果需要加速处理，系统可以硬件实现。没有限制使用KStores，学习引擎或正在使用的K引擎的分布或数量。

3. 发明授权

US07340471B2 Saving and restoring an interlocking trees datastore 失效
标题翻译：保存和恢复互锁树数据存储
公开(公告)号：US07340471B2
公开(公告)日：2008-03-04
申请号：US10759466
申请日：2004-01-16
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
IPC分类号： G06F17/00
CPC分类号： G06F17/30327 , Y10S707/99944 , Y10S707/99945
摘要： A tree-based datastore comprising a forest of interconnected trees that can be generated and/or accessed may require specialized saving and restoring processes to ensure that all the links are properly maintained whether it will be restored in full or in part. The processes act on known features of the trees based datastore to generate a file of metadata and packetize each of the nodes of the structure, carefully saving the links and lists of links with old memory addresses accounted for. When restoring the full or partial save to a new memory, a translation table is used to convert the addresses of the nodes and their links to appropriately matched locations in the new memory so that the structure of the data store can be reconstructed in the new location and ensuring that there is sufficient protected memory for the structure as the restore is accomplished.
摘要翻译：包含可生成和/或访问的互连树林的基于树的数据存储区可能需要专门的保存和恢复过程，以确保所有链接是否被适当地维护，无论其全部还是部分恢复。这些过程对基于树的数据存储区的已知特征进行操作，以生成元数据文件，并对结构的每个节点进行打包，仔细地保存链接以及占用的旧存储器地址的链接列表。当将全部或部分保存恢复到新的存储器时，使用转换表将节点及其链接的地址转换为新存储器中适当匹配的位置，以便可以在新位置重构数据存储的结构并确保在还原完成时，为结构提供足够的受保护的内存。

4. 发明授权

US07908240B1 Facilitated use of column and field data for field record universe in a knowledge store 有权
标题翻译：便于在知识库中使用列和字段数据进行现场记录
公开(公告)号：US07908240B1
公开(公告)日：2011-03-15
申请号：US10975223
申请日：2004-10-28
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30595
摘要： Typically, field names are saved separately from tables as metadata in modern databases. Databases did not traditionally get built into interlocking trees datastores that recorded the data as events. However, in cases where one may wish to do that, thus avoiding the need for saving separate metadata from the table data of the data base, a need was found to establish an identity for particular columns or fields when working with databases or sources of data that provide table data in field/record format. So, to build interlocking trees datastores from such records a mechanism to record such data was created, adding a column ID, preferably to each field within each record or sequence that is to be recorded. Putting the column ID or identifier is inserted into the record during particlization between each column variable. In preferred embodiments a delimiter was included between the column ID or field name and the field variable. Appropriate hardware and software systems were employed to implement the invention.
摘要翻译：通常，现代数据库中的字段名称作为元数据与表分开保存。数据库传统上并没有将记录数据的联锁树数据存储为事件。然而，在可能希望这样做的情况下，因此避免了从数据库的表数据中保存单独的元数据的需要，发现在使用数据库或数据源时为特定列或字段建立身份的需求它以字段/记录格式提供表格数据。因此，为了从这样的记录建立互锁树数据存储，创建了一种记录这样的数据的机制，最好添加列ID，每个字段应该被记录在每个记录或序列中。将列ID或标识符放在每个列变量之间的特定化过程中插入到记录中。在优选实施例中，在列ID或字段名称和字段变量之间包括分隔符。采用适当的硬件和软件系统实现本发明。

5. 发明授权

US07593923B1 Functional operations for accessing and/or building interlocking trees datastores to enable their use with applications software 有权
标题翻译：用于访问和/或构建互锁树数据存储的功能操作，以使其能够与应用软件一起使用
公开(公告)号：US07593923B1
公开(公告)日：2009-09-22
申请号：US10879329
申请日：2004-06-29
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar , Tony T. Phan
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar , Tony T. Phan
IPC分类号： G06F17/30
CPC分类号： G06N5/022 , G06F17/30327 , Y10S707/99933
摘要： A set of mechanisms handles communication with a Knowledge Store and its K Engine(s). The Knowledge Store (Kstore) does not need indexes or tables to support it but instead is formed by the construction of interlocking trees of pointers in nodes of the interlocking trees. The K Engine builds and is used to query a KStore by using threads that use software objects together with a K Engine to learn particlized events, thus building the KStore, and these or other software objects can be used to make queries and get answers from the KStore, usually with the help of a K Engine. Under some circumstances, information can be obtained directly from the KStore, but is generally only available through the actions of the K Engine. The mechanisms provide communications pathways for users and applications software to build and/or query the KStore. Both these processes can proceed simultaneously, and in multiple instances. There can be a plurality of engines operating on a KStore essentially simultaneously. Additionally a mechanism for providing triggers allows for automatic reporting of events, conditions and occurrences to users and applications.
摘要翻译：一组机制处理与知识库及其K引擎的通信。知识库（Kstore）不需要索引或表来支持它，而是通过在互锁树的节点中构建指针的互锁树形成。 K引擎构建并用于通过使用与K引擎一起使用软件对象的线程来查询KStore来学习特定事件，从而构建KStore，并且可以使用这些或其他软件对象进行查询并从 KStore，通常在K引擎的帮助下。在某些情况下，可以直接从KStore获得信息，但通常只能通过K Engine的操作获得。这些机制为用户和应用软件提供了构建和/或查询KStore的通信路径。这两个过程可以同时进行，并且在多个情况下。基本上可以同时在KStore上操作多个引擎。另外，提供触发器的机制允许自动报告用户和应用程序的事件，状况和事件。

6. 发明申请

US20080275842A1 Method for processing counts when an end node is encountered 审中-公开
标题翻译：处理结束节点时的计数方法
公开(公告)号：US20080275842A1
公开(公告)日：2008-11-06
申请号：US11384704
申请日：2006-03-20
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
IPC分类号： G06F17/30
CPC分类号： G06F16/2246
摘要： A method for processing a particle stream in a KStore having a current sequence of nodes includes receiving at least one particle within the particle stream to provide a received particle and determining whether the current sequence is complete in accordance with the received particle to provide a sequence complete determination. Processing a completed sequence indicator in accordance with the sequence complete determination is also set forth. A determination is made whether the received particle is a delimiter to provide a delimiter determination and a received delimiter. A determination is made whether a Result node of an asCase node of the current K node matches the received delimiter to provide a match determination. A new K node is created in accordance with the match determination. The new K node can be an end product node. The current K node is set to the end product node.
摘要翻译：用于处理具有当前节点序列的KStore中的粒子流的方法包括：接收粒子流内的至少一个粒子以提供接收的粒子，并根据所接收的粒子确定当前序列是否完整以提供序列完整决心。还阐述了根据顺序完成确定处理完成的序列指示符。确定接收到的粒子是否是分隔符以提供定界符确定和接收的定界符。确定当前K节点的asCase节点的结果节点是否与接收到的分隔符匹配以提供匹配确定。根据匹配确定创建新的K节点。新的K节点可以是最终产品节点。当前的K节点设置为最终产品节点。

7. 发明授权

US07213041B2 Saving and restoring an interlocking trees datastore 有权
公开(公告)号：US07213041B2
公开(公告)日：2007-05-01
申请号：US10958830
申请日：2004-10-05
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , Y10S707/99953 , Y10S707/99955
摘要： A tree-based datastore comprising a forest of interconnected trees that can be generated and/or accessed may require specialized saving and restoring processes to ensure that all the links are properly maintained whether it will be restored in full or in part. A previous process acted on known features of the trees based datastore to generate a file of metadata and packetize each of the nodes of the structure, carefully saving the links and lists of links with old memory addresses accounted for. This shows how to build a save file without saving all links, using a new restore process to restore the links instead.

8. 发明申请

US20100153439A1 Utilities for Deriving Values and Information From Within an Interlocking Trees Data Store 审中-公开
标题翻译：从联锁树数据存储中提取值和信息的实用程序
公开(公告)号：US20100153439A1
公开(公告)日：2010-06-17
申请号：US12640656
申请日：2009-12-17
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
IPC分类号： G06F17/30
CPC分类号： G06F16/00
摘要： A method for accessing a KStore including at least one K path having at least one subcomponent node and at least one root node includes providing a utility routine and accessing the KStore using the utility routine. The accessing may include traversing the at least one K path. The at least one K path includes a further node and bidirectional links between the at least one subcomponent node and the further node. The method includes traversing between the at least one subcomponent node and the further node by way of the bidirectional links. The further node can be a beginning of thought node, an end of thought node, root node, or a subcomponent node. A location may be determined within the KStore. The K Store may be queried. Searches for information within the KStore may be performed. The KStore may be traversed to constrain and focus the KStore. The KStore may be updated.
摘要翻译：一种用于访问包括至少一个具有至少一个子组件节点和至少一个根节点的至少一个K路径的KStore的方法包括提供实用程序并使用所述实用程序访问所述KStore。访问可以包括遍历至少一个K路径。所述至少一个K路径包括所述至少一个子组件节点和所述另外的节点之间的另外的节点和双向链路。该方法包括通过双向链路在至少一个子组件节点和另一节点之间穿越。另一节点可以是思想开始节点，思想结束节点，根节点或子组件节点。可以在KStore内确定位置。 K商店可能被查询。可以执行搜索KStore内的信息。 KStore可以遍历以限制和集中KStore。 KStore可能会更新。

9. 发明授权

US07716241B1 Storing the repository origin of data inputs within a knowledge store 有权
标题翻译：将数据输入的存储库原始存储在知识库中
公开(公告)号：US07716241B1
公开(公告)日：2010-05-11
申请号：US10975332
申请日：2004-10-27
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30327
摘要： An effective means for building an interlocking trees datastore from multiple data sources that contained within the datastore the knowledge of the origin of the data was needed, and is thus described herein. Should it be desired or necessary to identify the different sources of data within the Kstore data structure, the present invention teaches how an additional field for the origin of the data is created, how the origin of the data is stored in that newly created field, and how the interlocking trees data store takes that field and creates nodes within the structure, therefore embedding the origin information within the knowledge contained in the Kstore data structure.
摘要翻译：从数据存储中包含数据源的知识的多个数据源构建互锁树数据库的有效手段，因此在此被描述。如果需要或需要识别Kstore数据结构内的不同数据源，则本发明教导如何创建数据的来源的附加字段，数据的来源如何存储在该新创建的字段中，以及联锁树数据存储如何占用该字段并在结构内创建节点，因此将原始信息嵌入到Kstore数据结构中所包含的知识内。

10. 发明授权

US07676477B1 Utilities for deriving values and information from within an interlocking trees data store 有权
标题翻译：用于从互锁树数据存储中导出值和信息的实用程序
公开(公告)号：US07676477B1
公开(公告)日：2010-03-09
申请号：US11258293
申请日：2005-10-24
申请人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
发明人： Jane Campbell Mazzagatti , Jane Van Keuren Claar
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30
摘要： A method for accessing a KStore including at least one K path having at least one subcomponent node and at least one root node includes providing a utility routine and accessing the KStore using the utility routine. The accessing may include traversing the at least one K path. The at least one K path includes a further node and bidirectional links between the at least one subcomponent node and the further node. The method includes traversing between the at least one subcomponent node and the further node by way of the bidirectional links. The further node can be a beginning of thought node, an end of thought node, root node, or a subcomponent node. A location may be determined within the KStore. The K Store may be queried. Searches for information within the KStore may be performed. The KStore may be traversed to constrain and focus the KStore. The KStore may be updated.
摘要翻译：一种用于访问包括至少一个具有至少一个子组件节点和至少一个根节点的至少一个K路径的KStore的方法包括提供实用程序并使用所述实用程序访问所述KStore。访问可以包括遍历至少一个K路径。所述至少一个K路径包括所述至少一个子组件节点和所述另外的节点之间的另外的节点和双向链路。该方法包括通过双向链路在至少一个子组件节点和另一节点之间遍历。另一节点可以是思想开始节点，思想结束节点，根节点或子组件节点。可以在KStore内确定位置。 K商店可能被查询。可以执行搜索KStore内的信息。 KStore可以遍历以限制和集中KStore。 KStore可能会更新。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式