会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 42. 发明授权
    • Application program memory management system
    • 应用程序内存管理系统
    • US5189733A
    • 1993-02-23
    • US397075
    • 1989-08-22
    • John G. BennettAnders HejlsbergPeter Kukol
    • John G. BennettAnders HejlsbergPeter Kukol
    • G06F9/40
    • G06F9/4425
    • A computer system for executing application programs with limited available main memory capacity includes a main memory management system. The architecture of the stub vectors of a swappable code object and the protocol for referencing the stubs in active call frames reduces the overhead time of code object swapping. The stub vectors for a swappable code object are clustered together in memory; and each cluster comprises at least one entry stub and a return stub. A return stub vector is referenced in an active call frame only when its associated code object is not resident in main memory or when the code object has been placed on probation in contemplation of moving the object out of main memory. A linked list of resident code objects is employed in the selection of objects to be removed from main memory. A number of the least recently used code objects are put on probation in anticipation of the need to swap code between main memory and bulk memory. A call for or a return to an object on probation serves to remove the object from probation.
    • 用于执行具有有限可用主存储器容量的应用程序的计算机系统包括主存储器管理系统。 可交换代码对象的存根向量的结构和用于引用活动调用帧中的存根的协议减少了代码对象交换的开销时间。 可交换代码对象的存根向量聚集在内存中; 并且每个集群包括至少一个条目存根和返回存根。 只有当其关联的代码对象不驻留在主存储器中时,或者当代码对象已被放置在考虑将对象移出主存储器之后被放置在活动调用帧中时,返回存根向量才被引用。 在从主存储器中删除的对象的选择中采用驻留代码对象的链表。 预期在主存储器和大容量存储器之间交换代码的需要,许多最近使用的代码对象被放置在试用期中。 在试用期间呼叫或返回对象用于从缓刑中移除对象。
    • 43. 发明授权
    • System and methods for building spreadsheet applications
    • 用于构建电子表格应用程序的系统和方法
    • US5883623A
    • 1999-03-16
    • US841480
    • 1997-04-21
    • Istvan Cseri
    • Istvan Cseri
    • G06Q10/00G06F3/033G06F3/048G06F9/44G06F17/21G06F17/22G06F17/24G06F17/00
    • G06F8/38G06F17/21G06F17/211G06F17/218G06F17/22G06F17/246G06F3/0481G06F3/0483G06F9/4443Y10S715/973
    • An electronic spreadsheet system of the present invention includes a notebook interface having a plurality of notebook pages, each of which may contain a spread of information cells, or other desired page type (e.g., Graphs page). The system includes a spreadsheet application development module having a user interface (UI) builder. The UI builder provides "live" links between system objects. In particular, link commands are provided as statements a developer may attach to a control to indicate what should happen when an end-user activates or changes the control. Link commands usually specify three things: an event, an action, and an object. The event indicates what occurrence should trigger the link command; the action indicates what should happen. The object is what should be acted upon. One control can have many link commands. In operation, a link command can send a value to a cell in the notebook, run a macro, close a dialog box, change the zoom factor in the notebook, or the like.
    • 本发明的电子电子表格系统包括具有多个笔记本页面的笔记本接口,每个笔记本页面可以包含信息单元的扩展,或其它所需的页面类型(例如,图形页面)。 该系统包括具有用户界面(UI)构建器的电子表格应用程序开发模块。 UI构建器在系统对象之间提供“实时”链接。 特别地,链接命令作为开发者可以附加到控件的语句来提供,以指示当最终用户激活或改变控件时应该发生什么。 链接命令通常指定三件事情:事件,动作和对象。 该事件指示什么事件触发链接命令; 该行动表明应该发生什么。 对象是应该采取的行动。 一个控件可以有很多链接命令。 在操作中,链接命令可以将值发送到笔记本中的单元格,运行宏,关闭对话框,更改笔记本中的缩放因子等。
    • 44. 发明授权
    • Database system with methodology for notifying clients of any additions,
deletions, or modifications occurring at the database server which
affect validity of a range of data records cached in local memory
buffers of clients
    • 数据库系统,具有通知客户端在数据库服务器上发生的任何增加,删除或修改的影响的方法,这些修改会影响缓存在客户端的本地内存缓冲区中的一系列数据记录的有效性
    • US5826253A
    • 1998-10-20
    • US635133
    • 1996-04-19
    • David Bredenberg
    • David Bredenberg
    • G06F12/08G06F17/30
    • G06F12/0815G06F17/30368Y10S707/99931Y10S707/99932Y10S707/99937Y10S707/99938
    • Client/server system and methods are described for providing a "cache range" to database clients. When one or more records in a cache range of a client change, a server in connection with the client sends a notification that the cache range has changed. Instead of the client taking a lock out for updating a record, the client simply indicates to the server which records it is interested in (e.g., via registering an event alerter request), whereupon the server manages its resources as necessary to notify the client of a change in one of the records which is of interest to the client. The server can simply take out "interest" locks on the corresponding records; these are not locks which exclude the resource from other clients. Other clients are not prevented from accessing this resource (i.e., the records which are of interest). The interest lock is employed in conjunction with the registered event alerter for notifying the client when a range of records of interest is updated by another client. In this manner, the server undertakes action to indicate to the client when the client local buffer might be stale, thereby providing improved local record buffer management in a client/server database context.
    • 描述了客户端/服务器系统和方法,用于向数据库客户端提供“缓存范围”。 当客户端的缓存范围中的一个或多个记录更改时,与客户端相关联的服务器发送高速缓存范围已更改的通知。 客户端不是为了更新记录而锁定一个锁,而是向服务器简单地向服务器指示哪个记录是有兴趣的(例如,通过注册事件警报器请求),服务器根据需要管理其资源以通知客户端 对客户感兴趣的其中一个记录进行更改。 服务器可以简单地取出相应记录上的“兴趣”锁定; 这些不是从其他客户端排除资源的锁。 其他客户端不能阻止访问该资源(即,感兴趣的记录)。 兴趣锁与注册的事件警报器结合使用,以在通过另一客户端更新感兴趣的记录范围时通知客户端。 以这种方式,当客户端本地缓冲区可能过时时,服务器采取行动来向客户端指示,从而在客户端/服务器数据库上下文中提供改进的本地记录缓冲器管理。
    • 48. 发明授权
    • System and methods for quickly detecting shareability of symbol and type
information in header files
    • 用于快速检测头文件中符号和类型信息的共享性的系统和方法
    • US5680622A
    • 1997-10-21
    • US269399
    • 1994-06-30
    • Lindsay Wayne Even
    • Lindsay Wayne Even
    • G06F9/45
    • G06F8/427
    • A development system having a compiler, a linker, and an interface is described. The compiler, which generates or "compiles" source listings into object modules, includes a parser for parsing information. Parsed information, which is initially stored in a parse tree, is further processed. A hash table is initialized for storing a unique address or signature for a particular data object (or set) of the tree. The nodes of the parse tree are processed in a "preorder" traversal. If a node under examination is not stored in the hash table, it is installed in the table and its address (hash address) is returned for storage in the tree. Other nodes of the tree are (recursively) processed in a similar manner. Two identical trees encountered in a parse will hash to the same address and thus need only be stored once. If two trees differ by only a small amount, only the difference and the left edge of the second tree will be stored in addition to the first. In this manner, the compiler may efficiently store parse trees that have duplicated nodes, such as those produced when a text file is included more than once in a program. The memory storage required is dramatically decreased because the approach eliminates storage of redundant information.
    • 描述具有编译器,链接器和接口的开发系统。 将源列表生成或“编译”到对象模块中的编译器包括用于解析信息的解析器。 最初存储在解析树中的解析信息被进一步处理。 初始化哈希表用于存储树的特定数据对象(或集合)的唯一地址或签名。 解析树的节点以“预订”遍历进行处理。 如果正在检查的节点未存储在散列表中,则将其安装在表中,并将其地址(哈希地址)返回以存储在树中。 (递归地)以类似的方式处理树的其他节点。 在解析中遇到的两个相同的树将散列到相同的地址,因此只需要存储一次。 如果两棵树只有很小的差异,除了第一棵树之外,只有第二棵树的差异和左边缘将被存储。 以这种方式,编译器可以有效地存储具有重复节点的解析树,例如当在程序中多次包括文本文件时产生的解析树。 所需的存储器存储大大减少,因为该方法消除了冗余信息的存储。
    • 49. 发明授权
    • Driver query and substitution for format independent native data access
    • 驱动程序查询和替代格式独立的本地数据访问
    • US5680618A
    • 1997-10-21
    • US561740
    • 1995-11-22
    • Gregor Paul Freund
    • Gregor Paul Freund
    • G06F17/30
    • G06F17/30348Y10S707/99931Y10S707/99937
    • A data access system of the present invention includes an interface (client), a data engine having a common application programming interface layer, and data drivers. Through the drivers, the data engine (responding to client requests) accesses foreign data objects, which may include information tables, files, and other data objects of a foreign format. In this manner, the system provides a virtual interface between a client (e.g., database manager) and individual foreign data objects (e.g., database files). Regardless of the format of the individual database files, all files can be shared without the need to make copies.
    • 本发明的数据访问系统包括接口(客户机),具有通用应用编程接口层的数据引擎和数据驱动器。 通过驱动程序,数据引擎(响应客户端请求)访问外部数据对象,其中可能包括外部格式的信息表,文件和其他数据对象。 以这种方式,系统在客户端(例如,数据库管理器)和各个外部数据对象(例如,数据库文件)之间提供虚拟接口。 无论单个数据库文件的格式如何,所有文件都可以共享,无需复制。
    • 50. 发明授权
    • System and methods for improved sorting with national language support
    • 用国家语言支持改进排序的系统和方法
    • US5675818A
    • 1997-10-07
    • US490364
    • 1995-06-12
    • Robin David Kennedy
    • Robin David Kennedy
    • G06F17/30G06F17/28
    • G06F17/30985Y10S707/99937
    • A Database Management System having a Collation Engine with improved methods for sorting information with National Language Support (NLS) is described. The Collation Engine includes an improved method for comparing text strings with a culturally predictable result. In an exemplary embodiment, the Collation Engine includes a Collation Table storing primary, secondary, and tertiary weightings. The weightings are employed, in a method of the present invention, for accounting for locale-dependent factors or rules other than those taken into account by conventional primary and secondary weightings. Additional rules include, for instance, local-specific sorting rules specifying that the case of a character be taken into consideration, or that the expansion of an expanding character (e.g., "" which expands to "AE") be taken into consideration. A preferred method for examining weightings is described, so that the system may uncover differences between characters which would otherwise be ignored by conventional systems. In this manner, comparison operations of text strings (e.g., during sorting) may be performed in a manner appropriate for a given locale (e.g., German DIN sorting rules).
    • 描述了具有整理引擎的数据库管理系统,其具有用于使用国家语言支持(NLS)排序信息的改进方法。 整理引擎包括一种用于将文本字符串与文化可预测结果进行比较的改进方法。 在示例性实施例中,整理引擎包括存储初级,次级和第三级加权的归类表。 在本发明的方法中,采用权重来计算除通过常规的初级和次级权重考虑的那些因素之外的区域依赖因素或规则。 另外的规则包括例如特定排序规则,指定要考虑字符的情况,或者考虑扩展字符的扩展(例如扩展为“AE”的“+ Z”) 。 描述了用于检查加权的优选方法,使得系统可以揭示否则将被常规系统忽略的字符之间的差异。 以这种方式,文本串的比较操作(例如,在排序期间)可以以适合给定区域的方式(例如,德国DIN排序规则)来执行。