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

1. 发明授权

US08165413B1 Optimizing bounds checking in neighborhood processes 有权
标题翻译：优化邻域进程检查的边界
公开(公告)号：US08165413B1
公开(公告)日：2012-04-24
申请号：US11641853
申请日：2006-12-20
申请人： Steven L. Eddins
发明人： Steven L. Eddins
IPC分类号： G06K9/40
CPC分类号： G06T5/20
摘要： A computer-implemented method for optimizing bounds checking in a structured lattice having a regular pattern of neighboring nodes, includes the steps of: visiting a node in the lattice in a determined order, including bounds checking the node and performing a neighborhood process on the node; when said node is an interior node, calculating a distance k to a specified node in the determined order; visiting the next k nodes in the determined order without performing bounds checking and performing a neighborhood process on each of the next k nodes; and at least one of displaying or storing a result of the neighborhood process for the node.
摘要翻译：一种用于优化具有相邻节点的规则模式的结构化网格中的边界检查的计算机实现的方法包括以下步骤：以确定的顺序访问网格中的节点，包括边界检查节点并在节点上执行邻域过程 ; 当所述节点是内部节点时，以确定的顺序计算到指定节点的距离k; 以确定的顺序访问下一个k个节点，而不对每个下一个k个节点执行边界检查和执行邻域过程; 以及显示或存储节点的邻域处理结果中的至少一个。

2. 发明授权

US08751480B1 Virtual arrays in an array-based language 有权
标题翻译：基于数组的语言中的虚拟数组
公开(公告)号：US08751480B1
公开(公告)日：2014-06-10
申请号：US12363236
申请日：2009-01-30
申请人： Nausheen B. Moulana , Vadim Teverovsky , Steven L. Eddins
发明人： Nausheen B. Moulana , Vadim Teverovsky , Steven L. Eddins
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30091
摘要： A generalized input/output application programming interface (API) may provide an interface to file related operations. As a result of using this API, users of the array-based programming language may be able to manipulate stored data as though the data were a virtual array loaded into memory. Users do not need to memorize a different API in order to access data which may be stored in different file or data formats. In addition, using this API simplifies the task of working with large data sets by giving users seamless access to the sections of data they want to operate on when the entire data is too large to be loaded into memory.
摘要翻译：通用输入/输出应用编程接口（API）可以提供与文件相关操作的接口。作为使用该API的结果，基于阵列的编程语言的用户可能能够操纵存储的数据，就像数据是加载到存储器中的虚拟阵列一样。用户不需要记住不同的API，以访问可能以不同文件或数据格式存储的数据。此外，使用此API简化了处理大型数据集的任务，因为当整个数据太大而无法加载到内存中时，通过给用户无缝访问他们想要操作的数据部分。

3. 发明授权

US08650542B1 Hierarchical, self-describing function objects 失效
标题翻译：分层，自描述功能对象
公开(公告)号：US08650542B1
公开(公告)日：2014-02-11
申请号：US13072165
申请日：2011-03-25
申请人： Steven L. Eddins
发明人： Steven L. Eddins
IPC分类号： G06F9/44
CPC分类号： G06F8/73 , G06F8/20
摘要： A self-describing function object may be dynamically created based on a set of user provided parameters. In an implementation, a device may receive a request to create the function object based on one or more parameters and determine a number of ordered and hierarchical operations that correspond to the function object. The device may determine textual descriptions corresponding to what is performed by at least one of the ordered and hierarchical operations. The device may output documentation of the ordered and hierarchical operations included in the function object, the documentation including the textual descriptions arranged based on the determined order of the plurality of ordered and hierarchical operations.
摘要翻译：可以基于一组用户提供的参数动态地创建自描述功能对象。在实现中，设备可以基于一个或多个参数接收创建功能对象的请求，并且确定与功能对象相对应的有序和分层操作的数量。设备可以确定对应于由有序和分层操作中的至少一个执行的内容的文本描述。该设备可以输出包括在功能对象中的有序和分层操作的文档，该文档包括基于多个有序和分层操作的确定顺序排列的文本描述。

4. 发明授权

US08538185B1 Optimizing bounds checking in neighborhood processes 有权
标题翻译：优化邻域进程检查的边界
公开(公告)号：US08538185B1
公开(公告)日：2013-09-17
申请号：US13411164
申请日：2012-03-02
申请人： Steven L. Eddins
发明人： Steven L. Eddins
IPC分类号： G06K9/40
CPC分类号： G06T5/20
摘要： A computer-implemented method for optimizing bounds checking in a structured lattice having a regular pattern of neighboring nodes, includes the steps of: visiting a node in the lattice in a determined order, including bounds checking the node and performing a neighborhood process on the node; when said node is an interior node, calculating a distance k to a specified node in the determined order; visiting the next k nodes in the determined order without performing bounds checking and performing a neighborhood process on each of the next k nodes; and at least one of displaying or storing a result of the neighborhood process for the node.
摘要翻译：一种用于优化具有相邻节点的规则模式的结构化网格中的边界检查的计算机实现的方法包括以下步骤：以确定的顺序访问网格中的节点，包括边界检查节点并在节点上执行邻域过程 ; 当所述节点是内部节点时，以确定的顺序计算到指定节点的距离k; 以确定的顺序访问下一个k个节点，而不对每个下一个k个节点执行边界检查和执行邻域过程; 以及显示或存储节点的邻域处理结果中的至少一个。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式