会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Distributing input events to multiple applications in an interactive media environment
    • 在交互式媒体环境中将输入事件分发到多个应用程序
    • US08108787B2
    • 2012-01-31
    • US11351374
    • 2006-02-10
    • James C. FingerJohn Andre YovinKhurshed MazharOlivier ColleArthur William James Freeman
    • James C. FingerJohn Andre YovinKhurshed MazharOlivier ColleArthur William James Freeman
    • G06F3/048
    • G06F9/542G06F2209/545H04L67/36
    • In an interactive media environment, input events are distributed to a plurality of applications where each application includes zero or more script components and zero or more markup files and has a Z order which corresponds to the position of the applications' visual elements on a display. An input event processing order is utilized where the application that has focus in an interactive media environment (by virtue of its receipt of user events) is provided with the first opportunity to consume the input event. If the focused application does not consume the input event, it is then delivered to the remaining applications in top down, inverse Z order. Each application is enabled with the ability to consume an input event, pass it on to lower Z ordered applications, hide it from lower Z ordered applications, or otherwise handle it. Input event processing stops when an application consumes the input event.
    • 在交互式媒体环境中,输入事件被分发到多个应用程序,其中每个应用程序包括零个或多个脚本组件和零个或多个标记文件,并且具有对应于应用程序在显示器上的视觉元素的位置的Z次序。 使用输入事件处理顺序,其中在交互式媒体环境(通过其接收用户事件)中具有焦点的应用被提供有消费输入事件的第一个机会。 如果聚焦的应用程序不消耗输入事件,那么它将以自上而下的逆Z顺序传递给其余的应用程序。 每个应用程序都能够使用输入事件,将其传递给较低的Z订单应用程序,将其从较低的Z订单应用程序隐藏,或以其他方式处理。 当应用程序消耗输入事件时,输入事件处理停止。
    • 3. 发明授权
    • Arrangement for anonymous API downloaded resources for advanced content
    • 安排匿名API下载资源的高级内容
    • US08086562B2
    • 2011-12-27
    • US12165616
    • 2008-06-30
    • James C. FingerPeter J. TorrAndrew J. ClinickJeffrey A. Davis
    • James C. FingerPeter J. TorrAndrew J. ClinickJeffrey A. Davis
    • G06F17/00
    • G06F17/30Y10S707/913
    • Provided are arrangements for downloading resources and managing downloaded resources. A file is requested from a HTTP server, the file associated with an original URI. The file is downloaded and assigned a handle. The file is then stored in a storage location such as a file cache or in a persistent storage location. Upon command of an advanced content playlist or sequence, the file is called by calling the handle of the file. The storing of the file may include storing the file in a location where the file is subject to an automatic removal operation. The file may be an image file or any other type of file, especially multimedia files. The automatic removal operation may occur upon a quitting or restarting of the application. If another request is made for another file, the prior downloaded file may be replaced.
    • 提供下载资源和管理下载的资源的安排。 从HTTP服务器请求一个与原始URI关联的文件。 该文件被下载并分配一个句柄。 然后将该文件存储在诸如文件高速缓存或永久存储位置的存储位置中。 在指定高级内容播放列表或序列时,通过调用文件的句柄来调用该文件。 文件的存储可以包括将文件存储在文件进行自动删除操作的位置。 该文件可以是图像文件或任何其他类型的文件,特别是多媒体文件。 自动移除操作可能会在退出或重新启动应用程序时发生。 如果另一个请求是针对另一个文件,则可能会替换以前下载的文件。
    • 6. 发明申请
    • SCALABLE SCHEDULING FOR DISTRIBUTED DATA PROCESSING
    • 用于分布式数据处理的可调度调度
    • US20130151707A1
    • 2013-06-13
    • US13325052
    • 2011-12-13
    • Eric BoutinJames C. FingerPavel Yatsuk
    • Eric BoutinJames C. FingerPavel Yatsuk
    • G06F9/46G06F15/173
    • G06F9/5027G06F9/5077
    • A multi-tier scheduling approach includes a first tier comprising virtual cluster allocators that receive scheduling requests from processes and aggregate those requests and provide them to a second tier, namely a single resource distributor for the entire set of computing devices. The resource distributor, based on the requests from virtual cluster allocators, and also from information received from the computing devices themselves, generates a flow graph to identify an optimal scheduling of the assignment of resources to specific ones of the virtual clusters. Each virtual cluster allocator then, based on the assignment of resources assigned to it by the resource distributor, solves its own flow graph to identify an optimal scheduling of processes on the resources assigned. The scheduling of processes is performed iteratively by initially assigning resources to those processes having a high priority, and then, in subsequent iterations, assigning opportunistic resources to those processes having a lower priority.
    • 多层次调度方法包括第一层,其包括接收来自进程的调度请求的虚拟群集分配器,并且将这些请求聚合并提供给第二层,即整个计算设备集合的单个资源分配器。 基于来自虚拟集群分配器的请求以及来自计算设备本身的信息的资源分配器生成流图以识别对特定虚拟集群的资源分配的最佳调度。 然后,每个虚拟集群分配器基于由资源分配器分配给它的资源的分配,解决其自己的流图以识别分配的资源上的过程的最优调度。 通过对具有高优先级的那些进程最初分配资源,然后在随后的迭代中,将具有较低优先级的那些进程分配机会资源,迭代地执行进程的调度。
    • 9. 发明授权
    • Shared memory pool allocation during media rendering
    • 在媒体渲染期间共享内存池分配
    • US07698528B2
    • 2010-04-13
    • US11823510
    • 2007-06-28
    • Arthur William James FreemanOlivier ColleJames C. Finger
    • Arthur William James FreemanOlivier ColleJames C. Finger
    • G06F12/00
    • H04N19/127G06F9/5016H04N19/423
    • Memory management techniques involve establishing a memory pool having an amount of sharable memory, and dynamically allocating the sharable memory to concurrently manage multiple sets of sequenced units of digital data. In an exemplary scenario, the sets of sequenced units of digital data are sets of time-ordered media samples forming clips of media content, and the techniques are applied when media samples from two or more clips are simultaneously presentable to a user as independently-controlled streams. Variable amounts of sharable memory are dynamically allocated for preparing upcoming media samples for presentation to the user. In one possible implementation, a ratio of average data rates of individual streams is calculated, and amounts of sharable memory are allocated to rendering each stream based on the ratio. Then, the sharable memory allocated to rendering individual streams is reserved as needed to prepare particular upcoming media samples for presentation to the user.
    • 存储器管理技术涉及建立具有可共享存储量的存储器池,以及动态分配可共享存储器以同时管理多组排序的数字数据单元。 在示例性场景中,数字数据的排序单元组是形成媒体内容剪辑的时间有序的媒体样本集合,并且当来自两个或多个剪辑的媒体样本可以独立控制地同时呈现给用户时,应用该技术 流。 动态地分配可变量的共享存储器以准备即将到来的媒体样本以呈现给用户。 在一个可能的实现中,计算各个流的平均数据速率的比率,并且基于该比率分配可共享存储器的量来渲染每个流。 然后,分配用于渲染各个流的可共享存储器根据需要被保留以准备特定的即将到来的媒体样本以呈现给用户。