会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • System and Method for Avoiding Loops in Automatic Message Processing
    • 在自动消息处理中避免循环的系统和方法
    • US20150195231A1
    • 2015-07-09
    • US13179289
    • 2011-07-08
    • Nahush MahajanJeffrey B. StewartDarick M. Tong
    • Nahush MahajanJeffrey B. StewartDarick M. Tong
    • H04L12/58
    • H04L51/18
    • Loop avoidance information is added to messages to determine whether a messaging application had previously processed a message. Loop avoidance information can be added to messages as they are received in an added header field (such as a message identifier and user identifier) prior to storage. The information can be signed by the inserting application. If the application sees the information in the header of a subsequently received message, appropriate action may be taken to abort processing of the message. This is particularly useful in downloading from POP accounts. Similar loop avoidance information (which might include the destination address) can be added as a message is being automatically forwarded. In a subsequent forwarding, the application could determine that it had previously forwarded the message and should abort the current forwarding. The loop avoidance information can be stored locally for subsequent fast look up.
    • 循环回避信息被添加到消息中以确定消息应用程序是否先前已经处理了消息。 循环回避信息可以在存储之前在添加的报头字段(例如消息标识符和用户标识符)中被接收时添加到消息中。 信息可以通过插入应用程序进行签名。 如果应用程序看到随后接收到的消息的报头中的信息,则可以采取适当的动作来中止消息的处理。 这在从POP帐户下载中特别有用。 随着消息被自动转发,可以添加类似的循环回避信息(可能包括目标地址)。 在随后的转发中,应用程序可以确定它先前转发了消息,并且应该中止当前的转发。 循环回避信息可以在本地存储以便后续快速查找。
    • 3. 发明授权
    • Automatic deletion of temporary files
    • 自动删除临时文件
    • US08380676B1
    • 2013-02-19
    • US12473035
    • 2009-05-27
    • Paul C. EasthamNahush Mahajan
    • Paul C. EasthamNahush Mahajan
    • G06F17/00G06F7/00
    • G06F17/30085
    • Methods, systems, and apparatus, including computer program products feature selecting a file in a distributed file system. The file is associated with a time to live derived from a path name for the file. The file is divided into a plurality of chunks that are distributed among a plurality of servers. Each chunk has a respective modification time indicating when the chunk was last modified. A latest respective modification time among the respective modification times of each of the plurality of chunks is selected. A determination is made as to whether an elapsed time based on the latest modification time is equal to or exceeds the time to live. Each of the chunks of the file is deleted responsive to the determination. Other embodiments of this aspect include corresponding systems, apparatus, and computer program products.
    • 包括计算机程序产品在内的方法,系统和装置特征在于在分布式文件系统中选择文件。 该文件与从文件的路径名派生的时间相关联。 该文件被分成多个分布在多个服务器之间的块。 每个块具有相应的修改时间,指示该块最后被修改的时间。 选择多个块中的每一个的各个修改时间之间的最新的相应修改时间。 确定基于最近修改时间的经过时间是否等于或超过生存时间。 响应于确定,删除文件的每个块都被删除。 该方面的其他实施例包括相应的系统,装置和计算机程序产品。
    • 4. 发明授权
    • Systems and methods for detecting a memory condition and providing an alert
    • 用于检测内存条件并提供警报的系统和方法
    • US07499996B1
    • 2009-03-03
    • US11292906
    • 2005-12-01
    • Paul T. BuchheitNahush MahajanKeith J. Coleman
    • Paul T. BuchheitNahush MahajanKeith J. Coleman
    • G06F15/173
    • G06F17/30902H04L67/02H04L67/28H04L67/2852
    • The invention detects a full browser cache using multiple requests for the same page from a known URL. A request to the URL returns a page with a randomly or pseudo-randomly generated number. A request and then a re-request is made for the same page. If the cache is operating normally, the page for the re-request will be obtained from the browser cache and the number in the first request response will match the number from the re-request response. If the cache is not properly storing pages, the page will be fetched from the URL and contain a different randomly generated number, and therefore, the number in the two responses will not match. The user is notified and may be pointed to information explaining how to empty the cache.
    • 本发明使用已知URL对同一页面的多个请求来检测完整的浏览器高速缓存。 对URL的请求返回具有随机或伪随机生成的数字的页面。 对同一页面进行请求,然后重新请求。 如果缓存正常运行,将从浏览器缓存中获取重新请求的页面,并且第一个请求响应中的数字将与重新请求响应中的数字相匹配。 如果缓存不正确地存储页面,则该页面将从URL中获取并包含不同的随机生成的数字,因此两个响应中的数字将不匹配。 通知用户并且可以指出说明如何清空缓存的信息。