Synchronized Web Browsing Histories: Processing Deletions and Limiting Communications to Server
    2.
    发明申请
    Synchronized Web Browsing Histories: Processing Deletions and Limiting Communications to Server 审中-公开
    同步的Web浏览历史:处理删除和限制通信到服务器

    公开(公告)号:US20150347614A1

    公开(公告)日:2015-12-03

    申请号:US14500174

    申请日:2014-09-29

    Applicant: Apple Inc.

    CPC classification number: G06F16/957 G06F16/2365

    Abstract: Deletion of synchronized web browsing history is enabled. A deletion filter record that specifies synchronized web browsing history to be deleted is received from a first client. The deletion filter record is stored in association with an identifier of the first client. A check-in message is received from a second client. Responsive to the check-in message, a determination is made that the stored deletion filter record is relevant to the second client. The stored deletion filter record is sent to the second client. Separately, a client's communications to a server are limited. A request is received to communicate with the server. A throttling policy is accessed. The throttling policy includes multiple ordered policy sections. A policy section indicates that all messages sent from the client to the server, up to the number of messages, must be separated by at least the time period.

    Abstract translation: 已启用删除同步的网页浏览历史记录。 从第一客户端接收指定要删除的同步网页浏览历史的删除过滤器记录。 删除过滤器记录与第一客户端的标识符相关联地存储。 从第二个客户端收到一个签到信息。 响应于登记消息,确定存储的删除过滤记录与第二客户端相关。 存储的删除过滤器记录被发送到第二个客户端。 另外,客户端与服务器的通信是有限的。 接收到与服务器通信的请求。 访问节流策略。 限制策略包括多个有序的策略部分。 策略部分指出,从客户端发送到服务器的所有消息,直到消息数量必须至少被分隔一段时间。

    PRIORITY-BASED MANAGING OF WINDOW PROCESSES IN A BROWSER APPLICATION
    6.
    发明申请
    PRIORITY-BASED MANAGING OF WINDOW PROCESSES IN A BROWSER APPLICATION 有权
    浏览器应用程序中基于优先级的窗口过程管理

    公开(公告)号:US20150347179A1

    公开(公告)日:2015-12-03

    申请号:US14727703

    申请日:2015-06-01

    Applicant: Apple Inc.

    CPC classification number: G06F9/4818 G06F9/4881 G06F9/5011 G06F17/30899

    Abstract: The method for managing a plurality of windows of a browser application on an electronic device includes assigning a priority level to each process, including the browser application, running on the device, and distributing computing resources based on priority level. In response to receiving an action to open a window, the browser application starts the execution of a process for opening the window, associates the process with the window, and assigns a priority level to the process associated with the window. The browser application then monitors an activity level of each process associated with its windows. If the activity level decreases, the browser application assigns the process with the decreased activity level to a lower priority level. If requested computing resources exceed a maximum threshold, a process is selected from the lowest priority level processes, and the selected process is suspended.

    Abstract translation: 用于管理电子设备上的浏览器应用程序的多个窗口的方法包括:为包括在设备上运行的浏览器应用程序,以及基于优先级分配计算资源的每个进程分配优先级。 响应于接收到打开窗口的动作,浏览器应用程序开始执行打开窗口的进程,将进程与窗口相关联,并为与窗口相关联的进程分配优先级。 然后,浏览器应用程序监视与其窗口相关联的每个进程的活动级别。 如果活动级别降低,则浏览器应用程序将具有降低的活动级别的进程分配到较低优先级。 如果请求的计算资源超过最大阈值,则从最低优先级级别进程中选择一个进程,并且暂停所选择的进程。

    Runtime optimization using meta data for dynamic programming languages
    7.
    发明授权
    Runtime optimization using meta data for dynamic programming languages 有权
    运行时优化使用元数据进行动态编程语言

    公开(公告)号:US09027010B2

    公开(公告)日:2015-05-05

    申请号:US13725281

    申请日:2012-12-21

    Applicant: Apple Inc.

    Abstract: A method and an apparatus that optimize operations for a key among a collection of key indexed data structures using meta data describing properties of the key with respect to the collection of data structures are described. The meta data may correspond to a cache dynamically updated to indicate invariants which are true for the key in a current state of the collection of data structures. Expensive calculations to search through the collection of data structures for the key may be avoided. For example, costly lookup operations over a collection of data structures may not be required at all if a key is known to always (or to never) reference certain specific values, or for these values to have certain meta-properties, in any of the collection of data structure globally throughout a system at a current state.

    Abstract translation: 描述了使用描述关于数据结构的集合的属性的元数据的关键索引数据结构的集合中的密钥优化操作的方法和装置。 元数据可以对应于动态更新的高速缓存,以指示在数据结构的收集的当前状态中对于密钥是真实的不变量。 可以避免用于搜索密钥数据结构收集的昂贵的计算。 例如,如果已知密钥总是(或从不)引用某些特定值,或者对于这些值具有某些元属性,则可以根本不需要对数据结构集合进行昂贵的查找操作 在当前状态下在整个系统中全局收集数据结构。

    BROWSER-DRIVEN POWER SAVING
    8.
    发明申请
    BROWSER-DRIVEN POWER SAVING 审中-公开
    BROWSER驱动节电

    公开(公告)号:US20140365794A1

    公开(公告)日:2014-12-11

    申请号:US14298801

    申请日:2014-06-06

    Applicant: Apple Inc.

    Abstract: The embodiments disclosed herein describe ways that a browser application or other process can reduce power usage by a computing device. Methods include the process suspending one or more plug-ins on a web page by replacing them with a snapshot taken from the plug-in, and reducing processing on non-media plug-ins and non-visible portions of web pages running in the browser, but not currently in focus, such as when a tab is in the background behind a different tab, when a browser window is minimized, or when the web page is entirely or partially occluded.

    Abstract translation: 本文公开的实施例描述了浏览器应用或其他过程可以减少计算设备的功率使用的方式。 方法包括过程通过使用从插件获取的快照替换网站上的一个或多个插件来暂停一个或多个插件,并减少对非媒体插件的处理以及在浏览器中运行的网页的不可见部分 ,但是当前没有关注焦点,例如当标签位于不同标签后面的背景中,当浏览器窗口最小化时,或者当网页被完全或部分遮挡时。

    RUNTIME OPTIMIZATION USING META DATA FOR DYNAMIC PROGRAMMING LANGUAGES
    9.
    发明申请
    RUNTIME OPTIMIZATION USING META DATA FOR DYNAMIC PROGRAMMING LANGUAGES 有权
    使用META数据进行动态编程语言的运行时优化

    公开(公告)号:US20130205286A1

    公开(公告)日:2013-08-08

    申请号:US13725281

    申请日:2012-12-21

    Applicant: Apple Inc.

    Abstract: A method and an apparatus that optimize operations for a key among a collection of key indexed data structures using meta data describing properties of the key with respect to the collection of data structures are described. The meta data may correspond to a cache dynamically updated to indicate invariants which are true for the key in a current state of the collection of data structures. Expensive calculations to search through the collection of data structures for the key may be avoided. For example, costly lookup operations over a collection of data structures may not be required at all if a key is known to always (or to never) reference certain specific values, or for these values to have certain meta-properties, in any of the collection of data structure globally throughout a system at a current state.

    Abstract translation: 描述了使用描述关于数据结构的集合的属性的元数据的关键索引数据结构的集合中的密钥优化操作的方法和装置。 元数据可以对应于动态更新的高速缓存,以指示在数据结构的收集的当前状态中对于密钥是真实的不变量。 可以避免用于搜索密钥数据结构收集的昂贵的计算。 例如,如果已知密钥总是(或从不)引用某些特定值,或者对于这些值具有某些元属性,则可能不需要对数据结构集合进行昂贵的查找操作 在当前状态下在整个系统中全局收集数据结构。

    Browser cache management
    10.
    发明授权

    公开(公告)号:US10440140B2

    公开(公告)日:2019-10-08

    申请号:US15098231

    申请日:2016-04-13

    Applicant: Apple Inc.

    Abstract: Disclosed herein is a technique for storing and managing a number of resources and sub-resources associated with web pages in a cache implemented by a web browser. Metadata associated with the sub-resources is captured and stored in the cache. The metadata can include relationship or dependency information associated with a main resource and the sub-resources associated with the main resource. The previously captured metadata is used to predict any sub-resources that will be needed to properly display the web page and the predicted sub-resources are requested from the web server concurrently with a request for the main resource associated with the web page.

Patent Agency Ranking