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

1. 发明授权

US08516004B2 Method for processing K node count fields using an intensity variable 失效
标题翻译：使用强度变量处理K个节点计数字段的方法
公开(公告)号：US08516004B2
公开(公告)日：2013-08-20
申请号：US11384777
申请日：2006-03-20
申请人： Jane Campbell Mazzagatti
发明人： Jane Campbell Mazzagatti
IPC分类号： G06F17/30
CPC分类号： G06F17/30327
摘要： In a KStore having K nodes with respective K node counts a method for updating the K node counts includes processing a K node in accordance with a received particle to provide a processed K node and updating a node count in response to the processing. The processing of the processed K node includes building the processed K node in response to the received particle. A node count of a beginning of sequence node is updated. A beginning of sequence node includes a beginning of thought node. The received particle can be a particle of sensor data having a corresponding sensor node to provide a sensor node determination. A node count of the corresponding sensor node is updated in response to the sensor node determination. A subcomponent node is determined in response to the sensor determination and a K node count of the subcomponent node is updated.
摘要翻译：在具有K个具有相应的K个节点计数的K个节点的KStore中，用于更新K个节点计数的方法包括根据接收到的粒子来处理K个节点以提供经处理的K个节点并响应于该处理更新一个节点计数。处理的K节点的处理包括响应于所接收的粒子构建处理的K节点。序列节点开始的节点计数被更新。序列节点的开始包括思想开始节点。所接收的粒子可以是具有相应传感器节点的传感器数据的粒子，以提供传感器节点确定。响应于传感器节点确定更新相应传感器节点的节点数。响应于传感器确定确定子组件节点，并且更新子组件节点的K节点计数。

2. 发明授权

US07676330B1 Method for processing a particle using a sensor structure 有权
标题翻译：使用传感器结构处理颗粒的方法
公开(公告)号：US07676330B1
公开(公告)日：2010-03-09
申请号：US11436969
申请日：2006-05-16
申请人： Jane Campbell Mazzagatti , Steven L. Rajcan
发明人： Jane Campbell Mazzagatti , Steven L. Rajcan
IPC分类号： G01N31/00
CPC分类号： G06F17/30327
摘要： A method for processing KStore sensors for use by a KEngine in a KStore system to process a K includes providing a stream of particles, instantiating a KStore sensor structure, identifying particles to be included in a sensor set and processing said identified particles. The KStore sensor structure can provide a correspondence between a particle and a sensor K node. Furthermore, the KStore sensor structure can be a list of K nodes, an indexed array or a hash table.
摘要翻译：用于处理KStore传感器以在KStore系统中使用以处理K的方法包括提供粒子流，实例化KStore传感器结构，识别要包括在传感器组中的粒子并处理所述识别的粒子。 KStore传感器结构可以提供粒子和传感器K节点之间的对应关系。此外，KStore传感器结构可以是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. 发明授权

US07734571B2 Method for processing sensor data within a particle stream by a KStore 有权
标题翻译：通过KStore处理粒子流内的传感器数据的方法
公开(公告)号：US07734571B2
公开(公告)日：2010-06-08
申请号：US11384947
申请日：2006-03-20
申请人： Jane Campbell Mazzagatti
发明人： Jane Campbell Mazzagatti
IPC分类号： G06F17/00
CPC分类号： G06F17/30327 , G06F17/30625 , Y10S707/99943
摘要： A method for processing a particle stream in a KStore having a sensor level and a first level above the sensor level, including receiving a particle to provide a received particle and first determining a current K node to determine a partial sequence location. The method also includes second determining a match in accordance with the received particle and the current K node to provide a match determination and processing the current K node based upon the match determination. A new node is created if the second determining is negative. A current K node is set to the new node. A node count is incremented and a delimiter particle type of the received particle is determined. A match is determined between the delimiter and a Result node of an asCase node of the current K node to provide a delimiter match determination.
摘要翻译：一种用于处理具有传感器级别和高于传感器级别的第一级的KStore中的粒子流的方法，包括接收粒子以提供接收到的粒子，并且首先确定当前K节点以确定部分序列位置。该方法还包括根据接收到的粒子和当前K节点来确定匹配以便根据匹配确定来提供匹配确定并处理当前K节点。如果第二个确定为负，则创建一个新节点。当前的K节点设置为新节点。节点计数增加，并确定接收到的粒子的分隔符粒子类型。在当前K节点的asCase节点的分隔符和Result节点之间确定匹配以提供定界符匹配确定。

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. 发明授权

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节点的结果节点。

7. 发明授权

US08238351B2 Method for determining a most probable K location 有权
标题翻译：确定最可能的K位置的方法
公开(公告)号：US08238351B2
公开(公告)日：2012-08-07
申请号：US11397097
申请日：2006-04-04
申请人： Jane Campbell Mazzagatti
发明人： Jane Campbell Mazzagatti
IPC分类号： H04L12/40 , G10L15/06 , G06F7/00
CPC分类号： G06F17/30327
摘要： The process of traversing a K may involve determining a match between a root node and a Result node of a node on the asCase list of a current K node. When learning is off and a match is not found, the procedure may ignore the particle being processed. An alternative solution determines which node on the asCase list is the most likely to be the next node. While the K Engine is traversing and events are being recorded into a K structure, a count field may be added to each K node to contain a record of how many times each K path has been traversed. The count field may be updated according to the processes traversing the K. Typically, the count is incremented only for learning functions. This count field may be used in determining which node may be the most (or least) probable.
摘要翻译：遍历K的过程可以涉及确定当前K节点的asCase列表上的节点的根节点和Result节点之间的匹配。当学习关闭并且没有找到匹配项时，该过程可能会忽略被处理的粒子。一个替代解决方案确定asCase列表中哪个节点最有可能是下一个节点。当K引擎正在遍历并且事件被记录到K结构中时，可以向每个K节点添加计数字段以包含每个K路径被遍历多少次的记录。计数字段可以根据遍历K的过程进行更新。通常，计数只对学习功能增加。该计数字段可以用于确定哪个节点可能是最（或最少）可能的。

8. 发明授权

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或字段名称和字段变量之间包括分隔符。采用适当的硬件和软件系统实现本发明。

9. 发明授权

US07424480B2 System and method for storing and accessing data in an interlocking trees datastore 有权
标题翻译：用于在互锁树数据存储中存储和访问数据的系统和方法
公开(公告)号：US07424480B2
公开(公告)日：2008-09-09
申请号：US11239177
申请日：2005-09-29
申请人： Jane Campbell Mazzagatti
发明人： Jane Campbell Mazzagatti
IPC分类号： G06F1/00 , G06F17/00
CPC分类号： G06F17/30327 , Y10S707/956 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： A tree-based datastore comprising a forest of interconnected trees is generated and/or accessed. The tree-based datastore comprises a first tree that depends from a first root node and may include a plurality of branches. Each of the branches of the first tree ends in a leaf node. Each leaf node may represent an end product, as described more fully below. A second root of the same tree-based datastore is linked to each leaf node representing an end product. Hence, the second root is essentially a root to an inverted order of the first tree, but the first tree is not duplicated. Finally, the tree-based datastore comprises a plurality of trees in which the root node of each of these trees is an elemental node, as described more fully below. The root node of each of these trees may be linked to one or more nodes in one or more branches of the first tree. The nodes of the tree-based datastore contain only pointers to other nodes in the tree-based datastore. The roots of the trees in the forest of trees comprising the tree-based datastore may be linked to data.
摘要翻译：生成和/或访问包含互连树的林的基于树的数据存储区。基于树的数据存储区包括从第一根节点依赖的第一树，并且可以包括多个分支。第一树的每个分支都以叶节点结束。每个叶节点可以表示最终产品，如下面更充分描述的。相同的基于树的数据存储区的第二个根链接到表示最终产品的每个叶节点。因此，第二根本质上是第一棵树的倒排顺序的根，但第一棵树不重复。最后，基于树的数据存储区包括多个树，其中每个树的根节点是元素节点，如下面更全面地描述的。这些树中的每一个的根节点可以链接到第一树的一个或多个分支中的一个或多个节点。基于树的数据存储的节点只包含指向基于树的数据存储区中其他节点的指针。包含基于树状数据库的树林中的树根可能与数据相关联。

10. 发明申请

US20070288496A1 K engine - process count after build in threads 审中-公开
标题翻译： K引擎 - 构建线程后的进程计数
公开(公告)号：US20070288496A1
公开(公告)日：2007-12-13
申请号：US11449092
申请日：2006-06-08
申请人： Jane Campbell Mazzagatti , Steven L. Rajcan , Robert R. Buckwalter
发明人： Jane Campbell Mazzagatti , Steven L. Rajcan , Robert R. Buckwalter
IPC分类号： G06F7/00
CPC分类号： G06F16/2246
摘要： In a KStore having a plurality of K nodes with count fields a method for updating count fields, receiving a particle to provide a received particle, updating selected node counts of the plurality of nodes counts in response to the received particle to provide first updated K node count fields, and saving selected K node count fields for later updating to provide second updated count fields are recited. The K nodes include elemental root nodes and the second updated K node count fields include elemental root nodes of the plurality of elemental root nodes. The second updated K node count fields include only elemental root nodes of the plurality of elemental root nodes. The first updated K node count fields include no elemental root nodes. The second updated K node count fields include K nodes pointed to by the Result pointers of the first updated K node count fields.
摘要翻译：在具有多个具有计数字段的K个节点的KStore中，用于更新计数字段的方法，接收粒子以提供接收到的粒子，响应于所接收的粒子更新多个节点的选定节点计数，以提供第一更新的K节点计数字段和保存所选择的K个节点计数字段以供稍后更新以提供第二更新的计数字段。 K个节点包括元素根节点，并且第二更新的K个节点计数字段包括多个基本根节点的基本根节点。第二更新的K节点计数字段仅包括多个基本根节点的基本根节点。第一个更新的K节点计数字段不包括元素根节点。第二个更新的K个节点计数字段包括由第一个更新的K个节点计数字段的Result指针指向的K个节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式