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

61. 发明授权

US06596030B2 Identifying changes in on-line data repositories 有权
标题翻译：用于跟踪和查看网络上的变化的方法和装置
公开(公告)号：US06596030B2
公开(公告)日：2003-07-22
申请号：US10077444
申请日：2002-02-15
申请人： Thomas J. Ball , Frederick Douglis
发明人： Thomas J. Ball , Frederick Douglis
IPC分类号： G06F1700
CPC分类号： G06F17/30899
摘要： A system for accessing documents contained in a remote repository, which change in content from version-to-version. The system allows users to specify lists of documents of interest. Based on the lists, the system maintains an archive, which contains a copy of one version of each listed document, and material from which the other versions can be reconstructed. The system periodically compares the archive with current versions of the documents located in the repository, and updates the archive, thereby maintaining the ability to reconstruct current versions. The system also monitors access to the versions by each user. When a user calls for a current version, the system presents the current version, and indicates what parts of the current version have not been previously accessed by the user.
摘要翻译：用于访问远程存储库中包含的文档的系统，内容从版本到版本更改。系统允许用户指定感兴趣的文档列表。基于列表，系统维护一个存档，其中包含每个列出的文档的一个版本的副本以及可以从其重建其他版本的材料。系统会定期将存档与位于存储库中的文档的当前版本进行比较，并更新存档，从而保留重建当前版本的能力。该系统还监控每个用户对版本的访问。当用户呼叫当前版本时，系统显示当前版本，并指示当前版本的哪些部分以前未被用户访问过。

62. 发明授权

US06487596B1 Adaptive modem connection lifetimes 失效
标题翻译：自适应调制解调器连接寿命
公开(公告)号：US06487596B1
公开(公告)日：2002-11-26
申请号：US09327342
申请日：1999-06-05
申请人： Frederick Douglis , Thomas Joseph Killian
发明人： Frederick Douglis , Thomas Joseph Killian
IPC分类号： G06F1516
CPC分类号： H04L12/2898 , H04L12/2856
摘要： In an arrangement where users are connected to an ISP through a bank of modems, a time-out threshold is then selected for the user based on the user's connection pattern. The threshold is varied dynamically in response to access patterns, in an attempt to trade the benefit accrued by using the ISP's modem and phone line for a shorter period of time, against the inconvenience to the user from having to reestablish a connection to the ISP. Specifically, the time interval between the last disconnection by the user and the time of reconnection is evaluated, and when this time interval is shorter than a preselected threshold, then the time-out threshold is increased. When this time interval is longer than the preselected threshold, then the time-out threshold is decreased. Typically, when the time-out threshold is decreased, it is decreased by a significantly smaller amount that the amount by which it is increased, when it is increased.
摘要翻译：在用户通过调制解调器组连接到ISP的布置中，然后基于用户的连接模式为用户选择超时阈值。该阈值响应于访问模式而动态地变化，以便在较短的时间段内交换使用ISP的调制解调器和电话线所产生的收益，从而不利于用户重新建立到ISP的连接。具体地说，评估用户的最后断开与重新连接时间之间的时间间隔，并且当该时间间隔比预选阈值短时，则超时阈值增加。当该时间间隔大于预选阈值时，超时阈值降低。通常，当超时阈值降低时，当其增加时，其减少量显着减小其增加的量。

63. 发明授权

US5860071A Querying and navigating changes in web repositories 失效
标题翻译：查询和浏览Web存储库中的更改
公开(公告)号：US5860071A
公开(公告)日：1999-01-12
申请号：US797756
申请日：1997-02-07
申请人： Thomas J. Ball , Yih-Farn Robin Chen , Frederick Douglis , Eleftherios Koutsofios
发明人： Thomas J. Ball , Yih-Farn Robin Chen , Frederick Douglis , Eleftherios Koutsofios
IPC分类号： G06F17/30
CPC分类号： G06F17/30899 , Y10S707/99943
摘要： A system and method is provided for identifying if a document linked from a base document has changed over time. A first time and a later second time are identified. A link in a base document is recursively identified, where the link refers to a linked document. A version repository is searched to determine if the repository stores versions of the linked document associated with the first and second times. An indication is provided to the user if it is determined that a version associated with the first time and a version associated with the second time are stored in the repository.
摘要翻译：提供了一种用于识别从基本文档链接的文档是否随时间而改变的系统和方法。确定了第一次和第二次。递归地标识基本文档中的链接，链接指链接的文档。搜索版本存储库以确定存储库是否存储与第一次和第二次相关联的链接文档的版本。如果确定与第一次相关联的版本和与第二次相关联的版本存储在存储库中，则向用户提供指示。

64. 发明授权

US09843802B1 Method and system for dynamic compression module selection 有权
公开(公告)号：US09843802B1
公开(公告)日：2017-12-12
申请号：US13436641
申请日：2012-03-30
申请人： Grant R. Wallace , Philip N. Shilane , Frederick Douglis , Jianqiang Luo
发明人： Grant R. Wallace , Philip N. Shilane , Frederick Douglis , Jianqiang Luo
IPC分类号： G06K9/36 , H04N19/10 , H04L12/811
CPC分类号： H04N19/10 , H03M7/30 , H03M7/50 , H03M7/607 , H04L47/38
摘要： A computer-implemented method for compressing a data set, the method comprising receiving a first data block of the data set, selecting automatically by a compression management module a compression module from a plurality of compression modules to apply to the first data block based on projected compression efficacy or resource utilization, and compressing the first data block with the selected compression module to generate a first compressed data block.

65. 发明授权

US09389965B1 System and method for improving performance of backup storage system with future access prediction 有权
标题翻译：用于提高备份存储系统性能的系统和方法
公开(公告)号：US09389965B1
公开(公告)日：2016-07-12
申请号：US13460728
申请日：2012-04-30
申请人： Frederick Douglis , Windsor W. Hsu , Hangwei Qian
发明人： Frederick Douglis , Windsor W. Hsu , Hangwei Qian
IPC分类号： G06F12/02 , G06F11/14
CPC分类号： G06F3/0641 , G06F11/1453 , G06F12/0269 , G06F12/0276 , G06F12/0866 , G06F12/0871 , G06F12/121 , G06F12/123
摘要： A request is received to read a portion of a file from the storage system. In response to the request, future requests to the file are predicted based in part on the received request and metadata of the file. Access of a subsequent portion of the file is optimized based on the predicted future requests and the data contained in the portion of the file is then returned.
摘要翻译：接收到从存储系统读取文件的一部分的请求。响应于该请求，部分地基于接收的请求和文件的元数据来预测对文件的未来请求。基于预测的未来请求优化文件的后续部分的访问，然后返回包含在文件部分中的数据。

66. 发明授权

US09110792B1 System and method for cache replacement using bloom filter lookahead approach 有权
标题翻译：使用bloom filter lookahead方法进行高速缓存替换的系统和方法
公开(公告)号：US09110792B1
公开(公告)日：2015-08-18
申请号：US13460722
申请日：2012-04-30
申请人： Frederick Douglis , Windsor W. Hsu , Hangwei Qian
发明人： Frederick Douglis , Windsor W. Hsu , Hangwei Qian
IPC分类号： G06F12/02
CPC分类号： G06F3/0641 , G06F11/1453 , G06F12/0269 , G06F12/0276 , G06F12/0866 , G06F12/0871 , G06F12/121 , G06F12/123
摘要： Data objects of a file are cached in a cache memory of a storage system, where the data objects of the file are accessed sequentially via access windows in a chain. It is estimated whether a next access of a data object of the file likely occurs in which of the access windows using respective bloom filters associated with the access windows. In response to a request for cache space reclamation, a data object is evicted from the cache memory that will be likely accessed in a farthest access window in the chain from a current access window based on the estimation.
摘要翻译：文件的数据对象被缓存在存储系统的高速缓冲存储器中，其中通过链中的访问窗口顺序地访问文件的数据对象。估计是否可能发生文件的数据对象的下一次访问，其中哪个访问窗口使用与访问窗口相关联的相应的布隆过滤器。响应于缓存空间回收的请求，数据对象从高速缓冲存储器中被逐出，该数据对象将可能基于估计从当前访问窗口在链中最远的访问窗口中访问。

67. 发明授权

US09020904B2 Methods, systems and products for generating web pages 有权
标题翻译：用于生成网页的方法，系统和产品
公开(公告)号：US09020904B2
公开(公告)日：2015-04-28
申请号：US12576285
申请日：2009-10-09
申请人： Frederick Douglis , Sonia Jain , John C. Klensin , Michael Rabinovich
发明人： Frederick Douglis , Sonia Jain , John C. Klensin , Michael Rabinovich
IPC分类号： G06F7/00 , G06F9/44
CPC分类号： G06F9/4443 , G06F9/451 , Y10S707/99933
摘要： Methods, systems, and products generate web pages using elidable links to additional content. When a link is selected in a web page, elision is used to automatically remove a URL and its associated content from the web page, thus reducing previously visited material. When a user selects an elision-enabled link, the link is not displayed during subsequent displaying of the same web page.
摘要翻译：方法，系统和产品使用可追溯到其他内容的链接生成网页。当在网页中选择链接时，使用elision自动从网页中删除URL及其相关内容，从而减少以前访问的素材。当用户选择启用了启用浏览功能的链接时，在同一网页的后续显示期间不会显示该链接。

68. 发明授权

US08914330B2 Bulk deletion through segmented files 有权
标题翻译：通过分段文件批量删除
公开(公告)号：US08914330B2
公开(公告)日：2014-12-16
申请号：US11156842
申请日：2005-06-20
申请人： Edward Gustav Chron , Frederick Douglis , Stephen Paul Morgan
发明人： Edward Gustav Chron , Frederick Douglis , Stephen Paul Morgan
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30117
摘要： A mechanism is provided that aggregates data in a way that permits data to be deleted efficiently, while minimizing the overhead necessary to support bulk deletion of data. A request is received for automatic deletion of segments in a container and a waterline is determined for the container. A determination is made if at least one segment in the container falls below the waterline. Finally, in response to one segment falling below the waterline, the segment from the container is deleted. Each object has an associated creation time, initial retention value, and retention decay curve (also known as a retention curve). At any point, based on these values and the current time, the object's current retention value may be computed. The container system continually maintains a time-varying waterline: at any point, objects with a retention value below the waterline may be deleted.
摘要翻译：提供了一种机制，可以以允许数据有效删除的方式聚合数据，同时最大限度地减少支持批量删除数据所需的开销。收到容器中段的自动删除请求，并确定容器的水线。如果容器中的至少一个部分落在水线以下，则确定。最后，为了响应一条落在水线以下的段，容器中的段被删除。每个对象都具有相关联的创建时间，初始保留值和保留衰减曲线（也称为保留曲线）。在任何时候，基于这些值和当前时间，可以计算对象的当前保留值。集装箱系统不断维护时变水线：任何时候，保留值低于水线的对象可能会被删除。

69. 发明授权

US08656403B2 Negotiation management in data processing systems 失效
标题翻译：数据处理系统中的谈判管理
公开(公告)号：US08656403B2
公开(公告)日：2014-02-18
申请号：US12112142
申请日：2008-04-30
申请人： Bo An , Frederick Douglis , Bradley William Fawcett , Anton V. Riabov , Fan Ye
发明人： Bo An , Frederick Douglis , Bradley William Fawcett , Anton V. Riabov , Fan Ye
IPC分类号： G06F9/46
CPC分类号： G06F9/5038 , G06F2209/5014 , G06F2209/506
摘要： Techniques are disclosed for optimizing schedules used in implementing plans for performing tasks in data processing systems. For example, an automated method of negotiating for resources in a data processing system, wherein the data processing system comprises multiple sites, comprises a negotiation management component of a computer system at a given one of the sites performing the following steps. One or more tasks from at least one source of one or more plans are obtained. Each plan is annotated with one or more needed resources and one or more potential resource providers at one or more sites in the data processing system. An optimized resource negotiation schedule based on the one or more obtained tasks is computed. The schedule comprises an order in which resources are negotiated. In accordance with the optimized resource negotiation schedule, a request for each needed resource is sent to the one or more potential resource providers such that a negotiation process is performed between the negotiation management component and at least one of the potential resource providers.
摘要翻译：公开了用于优化用于在数据处理系统中执行任务的计划中使用的计划的技术。例如，在数据处理系统中协商资源的自动化方法，其中所述数据处理系统包括多个站点，包括在执行以下步骤的给定一个站点处的计算机系统的协商管理组件。获得来自一个或多个计划的至少一个来源的一个或多个任务。每个计划在数据处理系统中的一个或多个站点上用一个或多个所需资源和一个或多个潜在资源提供者进行注释。计算基于一个或多个获得的任务的优化的资源协商调度。时间表包括协商资源的顺序。根据优化的资源协商进度，向所述一个或多个潜在资源提供者发送对每个所需资源的请求，使得在协商管理组件和潜在资源提供者中的至少一个之间执行协商过程。

70. 发明授权

US08478874B2 System and method for composition of stream processing service environments 失效
标题翻译：流处理服务环境的组成系统和方法
公开(公告)号：US08478874B2
公开(公告)日：2013-07-02
申请号：US11971327
申请日：2008-01-09
申请人： Michael John Branson , Frederick Douglis , Parijat Dube , Zachary A. Garbow
发明人： Michael John Branson , Frederick Douglis , Parijat Dube , Zachary A. Garbow
IPC分类号： G06F15/173
CPC分类号： G06Q10/00
摘要： A system and method for composing a stream servicing environment which considers all stakeholders includes identifying service component requirements needed for processing a data stream, and determining available service elements for processing the stream. Feasible service environments are constructed based upon the available service elements and the service component requirements. Efficiency measures are computed for each feasible service environment considering all stakeholders. A best service environment is determined based upon the efficiency measures.
摘要翻译：用于构成流服务环境的系统和方法，其考虑所有利益相关者包括识别处理数据流所需的服务组件要求，以及确定用于处理流的可用服务元素。可行的服务环境是基于可用的服务元素和服务组件要求构建的。考虑所有利益相关者，为每个可行的服务环境计算效率措施。基于效率措施确定最佳服务环境。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式