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

1. 发明申请

US20060230432A1 Policy algebra and compatibility model 有权
公开(公告)号：US20060230432A1
公开(公告)日：2006-10-12
申请号：US11102848
申请日：2005-04-08
申请人： Alfred Lee , Ashok Malhotra , Elliot Waingold , Jeffrey Schlimmer , Stephen Millet
发明人： Alfred Lee , Ashok Malhotra , Elliot Waingold , Jeffrey Schlimmer , Stephen Millet
IPC分类号： H04L9/00
CPC分类号： G06F17/3089
摘要： The present invention provide for an algebraic mapping of a policy expression from a compact to a normalized form, both in Boolean and set formulations. The policy algebra is defined in such a way that policy alternatives within the normalized expression will be the same across equivalent compact expressions—regardless of how the assertions are arbitrarily constrained or what operators are used to constrain such equivalent expressions. Moreover, the present invention also provides a model for identifying alternatives that are equivalent by comparing only the root element names or QName of each assertion within an alternative. In addition, embodiments as described herein can utilize the identification of equivalent alternatives in order to create an intersection policy expression to limit alternatives of admissible behavior to those in common across both endpoints.

2. 发明授权

US07584499B2 Policy algebra and compatibility model 有权
标题翻译：政策代数和兼容性模型
公开(公告)号：US07584499B2
公开(公告)日：2009-09-01
申请号：US11102848
申请日：2005-04-08
申请人： Alfred M. Lee , Ashok Malhotra , Elliot Lee Waingold , Jeffery C. Schlimmer , Stephen J. Millet
发明人： Alfred M. Lee , Ashok Malhotra , Elliot Lee Waingold , Jeffery C. Schlimmer , Stephen J. Millet
IPC分类号： H04L9/00 , G06F17/00
CPC分类号： G06F17/3089
摘要： The present invention provide for an algebraic mapping of a policy expression from a compact to a normalized form, both in Boolean and set formulations. The policy algebra is defined in such a way that policy alternatives within the normalized expression will be the same across equivalent compact expressions—regardless of how the assertions are arbitrarily constrained or what operators are used to constrain such equivalent expressions. Moreover, the present invention also provides a model for identifying alternatives that are equivalent by comparing only the root element names or QName of each assertion within an alternative. In addition, embodiments as described herein can utilize the identification of equivalent alternatives in order to create an intersection policy expression to limit alternatives of admissible behavior to those in common across both endpoints.
摘要翻译：本发明提供了布尔和集合公式中的策略表达式从契约到归一化形式的代数映射。策略代数被定义为使得归一化表达式中的策略替换在等价的紧凑表达式之间将是相同的，而不论断言如何被任意约束，或者使用什么运算符来约束这样的等价表达式。此外，本发明还提供了用于通过仅比较替代方案中的每个断言的根元素名称或QName来识别等价的替代方案的模型。此外，如本文所述的实施例可以利用等效替代方案的识别，以便创建交叉策略表达式以将允许行为的替代方案限制在跨越两个端点的共同行为。

3. 发明授权

US5918052A Multiple inheritance mechanism for an object oriented programming environment 失效
标题翻译：面向对象编程环境的多重继承机制
公开(公告)号：US5918052A
公开(公告)日：1999-06-29
申请号：US341333
申请日：1994-11-16
申请人： Vincent Joseph Kruskal , Ashok Malhotra , Steven Jay Munroe
发明人： Vincent Joseph Kruskal , Ashok Malhotra , Steven Jay Munroe
IPC分类号： G06F9/44 , G06F9/06 , G06F9/42 , G06F12/00 , G06F9/40
CPC分类号： G06F9/443
摘要： The data structures, apparatus, methods, and mechanisms of the present invention cooperate to provide the user with a flexible multiple inheritance OOP environment. OOP environments comprise composite data structures and internal mechanisms for manipulating those structures. The structures are used to allow a user to realize the power of OOP. Hence, the layout of these structures, the way in which the structures inter-relate, and the manner in which they are built and used are all critical to the utility of a particular OOP environment. It is no surprise, then, that manufacturers and suppliers of OOP environments are constantly striving to design composite data structures and internal mechanisms which maximize user productivity. The composite data structures and organization of the MOM OOP environment provide significant benefits that are not provided by the multiple inheritance environments of the prior art. Of particular significance is the ability to add method programs to a class definition without the need to recompile the majority of the code base.
摘要翻译：本发明的数据结构，装置，方法和机制协同提供用户灵活的多继承OOP环境。 OOP环境包括用于操纵这些结构的复合数据结构和内部机制。这些结构用于允许用户实现OOP的功能。因此，这些结构的布局，结构相互联系的方式以及它们的构建和使用方式对于特定OOP环境的效用至关重要。因此，OOP环境的制造商和供应商一直在努力设计复合数据结构和内部机制，从而最大限度地提高用户生产力，这并不奇怪。 MOM OOP环境的复合数据结构和组织提供了现有技术的多重继承环境不提供的显着优点。特别重要的是能够将方法程序添加到类定义中，而无需重新编译大多数代码库。

4. 发明授权

US5454106A Database retrieval system using natural language for presenting understood components of an ambiguous query on a user interface 失效
标题翻译：使用自然语言的数据库检索系统，用于在用户界面上呈现模糊查询的理解组件
公开(公告)号：US5454106A
公开(公告)日：1995-09-26
申请号：US62502
申请日：1993-05-17
申请人： Luanne M. Burns , Ashok Malhotra
发明人： Luanne M. Burns , Ashok Malhotra
IPC分类号： G06F17/30
CPC分类号： G06F17/30392 , G06F17/30401 , Y10S707/99934 , Y10S707/99935
摘要： Information is retrieved from a database using natural language (NL) queries and graphical interfaces and displays. A query is separated into tokens which are parsed into elements. The parsed elements are matched to a list of database names. If all the parsed elements can be uniquely matched to database names, a database query is constructed and used to query the database to retrieve information and to present to a user. However, when an ambiguous query is encountered, i.e. all of whose elements cannot be uniquely matched with database names, the understood components of the ambiguous query, i.e., those elements matching database names, are presented the user along with relationships of the elements to other names in the database so that the user can use an interface to explore the database by accessing and displaying this database information and these relationships. The interface can take the form of views on a graphical interface. Using the displayed information, the user can create associations between database names and components not understood in the query. In other words, database names can be associated with the natural language words or phrases. These associations are added to the system knowledge and used to respond to future queries. In this way, the system learns, i.e., by using the added associations the system is able to respond to queries that it was unable to respond in a satisfactory manner before the association was added.
摘要翻译：使用自然语言（NL）查询和图形界面和显示从数据库检索信息。一个查询被分成令牌，被分解成元素。已解析的元素与数据库名称列表匹配。如果所有解析的元素都可以与数据库名称唯一匹配，则构建数据库查询并用于查询数据库以检索信息并向用户呈现。然而，当遇到一个模糊的查询，即所有的元素都不能与数据库名称唯一匹配时，模糊查询的所了解的组件，即匹配数据库名称的那些元素，以及元素与其他元素的关系呈现给用户数据库中的名称，以便用户可以通过访问和显示此数据库信息和这些关系来使用界面来探索数据库。该界面可以在图形界面上呈现视图的形式。使用显示的信息，用户可以在数据库名称和查询中不理解的组件之间创建关联。换句话说，数据库名称可以与自然语言单词或短语相关联。这些关联被添加到系统知识中，并用于响应未来的查询。以这种方式，系统学习，即通过使用添加的关联，系统能够响应于在添加关联之前无法以令人满意的方式响应的查询。

5. 发明授权

US5832270A System having automatic insertion of hooks into object-oriented software for visualizing execution thereof 失效
标题翻译：系统具有将钩子自动插入到面向对象的软件中用于可视化其执行
公开(公告)号：US5832270A
公开(公告)日：1998-11-03
申请号：US824673
申请日：1997-03-26
申请人： Johannes Christiaan Laffra , Ashok Malhotra
发明人： Johannes Christiaan Laffra , Ashok Malhotra
IPC分类号： G06F9/06 , G06F9/44 , G06F11/32 , G06F11/36 , G06F9/45
CPC分类号： G06F11/3664 , G06F11/323 , G06F8/20
摘要： Object-oriented system methods are automatically instrumented with method hooks that are capable of generating graphical information that can be visualized on a graphical interface. When a method hook is run, it can indicate the occurrence of: an object instance being created, and object instance being destroyed, an method being entered or a method being exited. In the event of one of these occurrences, the method hooks initiate execution of a monitoring function that uses the graphical information and a visualization script with rules to update a visualization shown on the graphical interface. The update will conform with the current state of the object instances visualized. The rules can be changed, to modify the visualization, without recompiling or relinking the application programs. Constraints also can be used by the monitoring function to modify the visualization.
摘要翻译：面向对象的系统方法被自动测试，方法钩子能够生成可以在图形界面上可视化的图形信息。当方法钩子运行时，它可以指示出现：正在创建的对象实例，被销毁的对象实例，正在输入的方法或正在退出的方法。在发生这些事件之一时，方法钩子启动使用图形信息的监视功能的执行，以及具有规则的可视化脚本来更新图形界面上显示的可视化。该更新将符合可视化对象实例的当前状态。可以更改规则，以修改可视化，而无需重新编译或重新链接应用程序。监视功能也可以使用约束来修改可视化。

6. 发明授权

US5504887A Storage clustering and packing of objects on the basis of query workload ranking 失效
标题翻译：在查询工作量排序的基础上对对象的存储集群和打包
公开(公告)号：US5504887A
公开(公告)日：1996-04-02
申请号：US120102
申请日：1993-09-10
申请人： Ashok Malhotra , Kenneth J. Perry
发明人： Ashok Malhotra , Kenneth J. Perry
IPC分类号： G06F17/30
CPC分类号： G06F17/3046 , G06F17/30705 , Y10S707/99956
摘要： An apparatus and method is disclosed for efficiently clustering program objects on a unit of storage in a secondary memory, e.g., a page of memory on a disc. The objects are clustered so that a set of queries (query set) can access the stored objects with a minimum number of page transfers from secondary storage to main memory. To determine how the objects are clustered together on each memory page, queries in the query set and the objects that they access are identified. The queries are ranked by a number of factors including the query weight, the memory space required to store objects accessed by a query, and the number of objects a query has in common with other queries. The objects accessed by the query set are clustered on secondary memory pages according to the query ranking. Partially packed memory pages can be combined to minimize the cost of the query set accessing the stored objects.
摘要翻译：公开了一种用于在次要存储器（例如盘上的存储器页）上的存储单元上有效地聚类程序对象的装置和方法。这些对象是聚类的，因此一组查询（查询集）可以使用从辅助存储器到主内存的最少页面传输访问存储的对象。要确定对象在每个内存页面上如何聚类在一起，查询集中的查询和访问对象都会被识别。这些查询由多个因素排列，包括查询权重，存储查询所访问对象所需的内存空间以及查询与其他查询相同的对象数。查询集所访问的对象根据查询排名聚类在辅助内存页面上。可以组合部分打包的内存页面以最小化访问存储对象的查询集的成本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式