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

1. 发明授权

US08108841B2 Minimizing interaction costs among components of computer programs 有权
标题翻译：最小化计算机程序组件之间的交互成本
公开(公告)号：US08108841B2
公开(公告)日：2012-01-31
申请号：US12037080
申请日：2008-02-25
申请人： Douglas Neil Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
发明人： Douglas Neil Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
IPC分类号： G06F9/44
CPC分类号： G06F11/3409 , G06F11/3447 , G06F11/3466 , G06F2201/865
摘要： A method for minimizing total cost of interaction among components of a computer program, each of the components being characterized by at least one implementation property includes steps of: a) carrying out at least a partial run of the program; b) monitoring the at least partial run of the program to measure an amount of interaction between each pair of components; c) determining a cost of interaction between each pair of interacting components; d) determining a choice of implementation properties which minimizes total cost of the at least partial run; and e) assigning that choice of implementation properties to the components for a subsequent at least partial run of the program.
摘要翻译：一种用于使计算机程序的组件之间的交互的总成本最小化的方法，每个组件的特征在于至少一个实现属性包括以下步骤：a）执行程序的至少部分运行; b）监视程序的至少部分运行以测量每对组件之间的相互作用量; c）确定每对相互作用的部件之间的交互成本; d）确定最小化至少部分跑步的总成本的实施属性的选择; 以及e）将所述实现属性的选择分配给所述组件以用于所述程序的后续至少部分运行。

2. 发明申请

US20080271055A1 PROTOCOL FOR COMMUNICATION OF DATA STRUCTURES 有权
标题翻译：数据结构通信协议
公开(公告)号：US20080271055A1
公开(公告)日：2008-10-30
申请号：US12147602
申请日：2008-06-27
申请人： Stephen J. Fink , Alan A. Donovan , Darrell Reimer , Mark N. Wegman
发明人： Stephen J. Fink , Alan A. Donovan , Darrell Reimer , Mark N. Wegman
IPC分类号： G06F9/44
CPC分类号： G06F9/546 , G06F9/54 , G06F17/30684 , G06Q30/0601 , G06Q30/0641
摘要： A system and method are provided for communicating information in a data structure between applications. According to the method, a description of a data structure is sent from a first application to a second application, and there is received from the second application an identification of at least one portion of the data structure that is requested by the second application. The first application marshals a subset of the data structure consisting of the at least one portion that was identified, and there is sent from the first application to the second application the marshalled subset of the data structure.
摘要翻译：提供了用于在应用之间的数据结构中传送信息的系统和方法。根据该方法，将数据结构的描述从第一应用发送到第二应用，并且从第二应用接收到由第二应用请求的数据结构的至少一部分的标识。第一个应用程序将数据结构的一个子集组成由被识别的至少一个部分组成，并且从第一个应用程序向第二个应用程序发送数据结构的编组子集。

3. 发明申请

US20080163163A1 MINIMIZING INTERACTION COSTS AMONG COMPONENTS OF COMPUTER PROGRAMS 有权
标题翻译：最小化计算机程序组件的交互成本
公开(公告)号：US20080163163A1
公开(公告)日：2008-07-03
申请号：US12037080
申请日：2008-02-25
申请人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
发明人： Douglas N. Kimelman , Vadakkedathu T. Rajan , Tova Roth , Vugranam C. Sreedhar , Mark N. Wegman
IPC分类号： G06F9/44
CPC分类号： G06F11/3409 , G06F11/3447 , G06F11/3466 , G06F2201/865
摘要： A method for minimizing total cost of interaction among components of a computer program, each of the components being characterized by at least one implementation property includes steps of: a) carrying out at least a partial run of the program; b) monitoring the at least partial run of the program to measure an amount of interaction between each pair of components; c) determining a cost of interaction between each pair of interacting components; d) determining a choice of implementation properties which minimizes total cost of the at least partial run; and e) assigning that choice of implementation properties to the components for a subsequent at least partial run of the program.
摘要翻译：一种用于使计算机程序的组件之间的交互的总成本最小化的方法，每个组件的特征在于至少一个实现属性包括以下步骤：a）执行程序的至少部分运行; b）监视程序的至少部分运行以测量每对组件之间的相互作用量; c）确定每对相互作用的部件之间的交互成本; d）确定最小化至少部分跑步的总成本的实现属性的选择; 以及e）将所述实现属性的选择分配给所述组件以用于所述程序的后续至少部分运行。

4. 发明授权

US06631513B1 Methods for laying out memories bidirectionally for object oriented applications 有权
标题翻译：为面向对象的应用程序双向布局存储器的方法
公开(公告)号：US06631513B1
公开(公告)日：2003-10-07
申请号：US09425709
申请日：1999-10-22
申请人： Joseph Gil , Peter F. Sweeney , Mark N. Wegman
发明人： Joseph Gil , Peter F. Sweeney , Mark N. Wegman
IPC分类号： G06F9445
CPC分类号： G06F9/4492
摘要： There is provided a method for laying out objects corresponding to an object-oriented application. The method including the step of determining whether any two given objects have opposing directionalities. A virtual function table pointer is shared between the two given objects, and the directionalities of the two given objects are changed to mixed, when the two given objects have opposing directionalities.
摘要翻译：提供了一种用于布置与面向对象应用相对应的对象的方法。该方法包括确定任何两个给定对象是否具有相反的方向性的步骤。虚拟函数表指针在两个给定对象之间共享，并且当两个给定对象具有相反的方向性时，两个给定对象的方向性变为混合。

5. 发明授权

US6041179A Object oriented dispatch optimization 失效
标题翻译：面向对象调度优化
公开(公告)号：US6041179A
公开(公告)日：2000-03-21
申请号：US723058
申请日：1996-10-03
申请人： David Francis Bacon , Mark N. Wegman , Frank Kenneth Zadeck
发明人： David Francis Bacon , Mark N. Wegman , Frank Kenneth Zadeck
IPC分类号： G06F9/42 , G06F9/45 , G06F13/00
CPC分类号： G06F8/4434 , G06F9/4431
摘要： An object oriented dispatch optimization method determines statically which body of code will be executed when a method is dispatched. The program code is examined to identify all procedure bodies that can be invoked for a given class and a given method. An identified procedure body is analyzed to determine whether a method invocation on a pointer can invoke only one procedure body. Based on this analysis, either the procedure body or the invocation mechanism is changed so a unique procedure is directly called without a test or dispatch being used.
摘要翻译：一种面向对象的调度优化方法，当调度方法时，静态地确定将执行哪个代码体。检查程序代码以识别可以为给定类和给定方法调用的所有过程体。分析识别的过程体，以确定指针上的方法调用是否只能调用一个过程体。基于这种分析，过程体或调用机制被改变，所以在不使用测试或调度的情况下直接调用唯一的过程。

6. 发明授权

US4588985A Polynomial hashing 失效
标题翻译：多项式散列
公开(公告)号：US4588985A
公开(公告)日：1986-05-13
申请号：US567199
申请日：1983-12-30
申请人： John L. Carter , Mark N. Wegman
发明人： John L. Carter , Mark N. Wegman
IPC分类号： G06F12/08 , G06F17/30 , H03M7/00
CPC分类号： G06F17/30949 , G06F12/0864
摘要： Elements x in a domain A are hashed into a range B by selecting any one of a plurality of hashing functions which collectively form an almost universal.sub.2 class of functions. The data element to be hashed is separated into individual sub-strings x.sub.1 through x.sub.n of no more than log.sub.2 (b) bits in length, where b is an integer, and the hashing algorithm is a polynomial of the form f.sub.y (x)=(y.sup.0 x.sub.1 +y.sup.1 x.sub.2 + . . . +y.sup.n-1 x.sub.n) (mod b). In general, for a finite field of b=p.sup.k elements, where k is a positive integer, there will be a hash function defined by the formula f.sub.y (x)=y.sup.0 x.sub.1 +y.sup.1 x.sub.2 + . . . +y.sup.n-1 x.sub.n, where the addition and multiplication operations are those defined by the finite field and y is an element of the field. In a second embodiment, the hashing is a two-stage process defined by g.sub.z (f.sub.y (x)), where f.sub.y (x) is defined as above and g.sub.z is a function selected from a known universal.sub.2 class of hash functions.
摘要翻译：域A中的元素x通过选择共同形成几乎通用的2类功能的多个散列函数中的任何一个来散列到范围B中。要散列的数据元素被分成长度不大于log2（b）位的各个子串x1到xn，其中b是整数，并且散列算法是fy（x）=（ y0x1 + y1x2 + ...。+ yn-1xn）（mod b）。通常，对于b = pk元素的有限域，其中k是正整数，将存在由公式fy（x）= y0x1 + y1x2 +定义的散列函数。的。的。 + yn-1xn，其中加法和乘法运算是由有限域定义的，y是场的元素。在第二实施例中，散列是由gz（fy（x））定义的两阶段过程，其中fy（x）如上定义，并且gz是从已知的通用2类哈希函数中选择的函数。

7. 发明授权

US10372423B2 System and method for managing resources using a compositional programming model 有权
公开(公告)号：US10372423B2
公开(公告)日：2019-08-06
申请号：US13216798
申请日：2011-08-24
申请人： Bruce David Lucas , John Field , Rafah A. Hosn , Maria-Cristina V. Marinescu , Mark N. Wegman , Charles Francis Wiecha
发明人： Bruce David Lucas , John Field , Rafah A. Hosn , Maria-Cristina V. Marinescu , Mark N. Wegman , Charles Francis Wiecha
IPC分类号： G06F9/445 , G06F8/30 , G06F8/72
摘要： A model is provided for managing resources in a programming environment. A first construct is triggered to update mutable entities in response to changes to related data associated with the mutable entities. In accordance with the updated mutable entities, at least one of a second construct and a third construct is triggered to respectively create a new mutable entity and update a data relationship.

8. 发明授权

US10310819B2 Method and apparatus for providing symbolic mode checking of business application requirements 有权
公开(公告)号：US10310819B2
公开(公告)日：2019-06-04
申请号：US12544933
申请日：2009-08-20
申请人： Bard Bloom , Ian D. Simmonds , Paul T. Keyser , Mark N. Wegman
发明人： Bard Bloom , Ian D. Simmonds , Paul T. Keyser , Mark N. Wegman
IPC分类号： G06F8/10 , G06Q10/06
摘要： A system and method for providing symbolic mode checking of business application requirements. A language allows for building a model for the business process, the model comprising a plurality of actions, with each action having a precondition and a postcondition or outcome. Specifications are constructed for the properties of the business applications with the specifications describing both the states of the business process and the order in which they may occur. Finally, the model and the specifications are analyzed to determine if the model satisfies the specifications. If the model fails to satisfy the specifications, a problem may be indicated in the business application. The process can be automated to permit the system to make assumptions for conducting a thorough analysis of selected potential problem areas in the application.

9. 发明授权

US09159088B2 Generating a location-aware preference and restriction-based customized menu 有权
标题翻译：生成位置感知偏好和基于限制的自定义菜单
公开(公告)号：US09159088B2
公开(公告)日：2015-10-13
申请号：US13173765
申请日：2011-06-30
申请人： Tawanna R. Dillahunt , Peter K. Malkin , Mark N. Wegman
发明人： Tawanna R. Dillahunt , Peter K. Malkin , Mark N. Wegman
IPC分类号： G06Q30/00 , G06Q30/02 , G06Q30/08
CPC分类号： G06Q30/0281 , G06Q30/0261
摘要： Location-aware preference and restriction based customized menu may be generated, for example, by obtaining a list of preferences and restrictions, tracking a dietary intake, determining a list of foods available at current location, and generating a list of recommended foods from the current location based on the list of preferences and restrictions, and the tracked dietary intake.
摘要翻译：可以产生基于位置感知偏好和限制的定制菜单，例如通过获得偏好和限制的列表，跟踪饮食摄入，确定当前位置可用食物的列表，以及从当前产生推荐食物的列表基于偏好和限制列表的位置，以及追踪的饮食摄入量。

10. 发明授权

US08413004B2 Lengthening life of a limited life memory 有权
标题翻译：延长生命有限的生活记忆
公开(公告)号：US08413004B2
公开(公告)日：2013-04-02
申请号：US13408407
申请日：2012-02-29
申请人： Michele Franceschini , John Peter Karidis , Luis A. Lastras-Montano , Thomas Mittelholzer , Mark N. Wegman
发明人： Michele Franceschini , John Peter Karidis , Luis A. Lastras-Montano , Thomas Mittelholzer , Mark N. Wegman
IPC分类号： G08C25/02 , H04L1/18 , H04H40/00 , H04W4/00 , H04W24/00 , H04B7/00 , G11C11/34 , G11C16/04 , G06M3/00
CPC分类号： G11C13/0069 , G06F11/1012 , G11C13/0002 , G11C2207/104
摘要： A phase-change memory (PCM) includes a matrix of storage cells, including at least a first group with at least one cell. Each cell includes a phase change material having at least a first resistance value and a second resistance value, such that the first group can have an identical message encoded therein in at least a first way and a second way. The memory also includes a controller configured to encode the identical message in the at least first group the first or second way, based on which way causes the least amount of writing cost, given current levels of the group. Another embodiment of memory includes a matrix of storage cells. Each of the storage cells has at least two levels, such that each of the storage cells can have an identical message encoded therein in at least a first way and a second way.
摘要翻译：相变存储器（PCM）包括存储单元矩阵，至少包括具有至少一个单元的第一组。每个单元包括具有至少第一电阻值和第二电阻值的相变材料，使得第一组可以以至少第一种方式和第二种方式在其中编码相同的消息。所述存储器还包括控制器，所述控制器被配置为在所述至少第一组中对所述第一或第二方式的相同消息进行编码，基于哪种方式，给出所述组的当前级别的最小写入成本量。存储器的另一实施例包括存储单元矩阵。每个存储单元具有至少两个级别，使得每个存储单元可以以至少第一种方式和第二种方式在其中编码相同的消息。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式