Animations
    51.
    发明申请
    Animations 有权
    动画

    公开(公告)号:US20080165210A1

    公开(公告)日:2008-07-10

    申请号:US11620723

    申请日:2007-01-07

    IPC分类号: G09G5/00

    摘要: At least certain embodiments of the present disclosure include a method for animating a display region, windows, or views displayed on a display of a device. The method includes starting at least two animations. The method further includes determining the progress of each animation. The method further includes completing each animation based on a single timer.

    摘要翻译: 本公开的至少某些实施例包括用于动画化显示在设备的显示器上的显示区域,窗口或视图的方法。 该方法包括启动至少两个动画。 该方法还包括确定每个动画的进度。 该方法还包括基于单个定时器完成每个动画。

    System for reducing the number of programs necessary to render an image
    52.
    发明申请
    System for reducing the number of programs necessary to render an image 有权
    用于减少呈现图像所需的程序数量的系统

    公开(公告)号:US20060125839A1

    公开(公告)日:2006-06-15

    申请号:US11305763

    申请日:2005-12-15

    申请人: John Harper

    发明人: John Harper

    IPC分类号: G09G5/00

    CPC分类号: G06T1/20

    摘要: Disclosed is as system for reducing memory and computational requirements of graphics operations. The system provides techniques for combining otherwise individual operations to apply filters to images. The combined filter emerging from the combination spares the processor time and the creation of an entire intermediary image. The system further provides for application of these techniques in many contexts including where the operations are fragment programs in for a programmable GPU.

    摘要翻译: 公开了一种用于减少图形操作的内存和计算需求的系统。 该系统提供了组合其他单独操作以将过滤器应用于图像的技术。 从组合中出现的组合过滤器将处理器的时间和整个中间图像的创建。 该系统进一步提供了这些技术在许多上下文中的应用,包括操作是用于可编程GPU的片段程序。

    System for reducing the number of programs necessary to render an image

    公开(公告)号:US20060125838A1

    公开(公告)日:2006-06-15

    申请号:US11305762

    申请日:2005-12-15

    申请人: John Harper

    发明人: John Harper

    IPC分类号: G09G5/00

    CPC分类号: G06T1/20

    摘要: Disclosed is as system for reducing memory and computational requirements of graphics operations. The system provides techniques for combining otherwise individual operations to apply filters to images. The combined filter emerging from the combination spares the processor time and the creation of an entire intermediary image. The system further provides for application of these techniques in many contexts including where the operations are fragment programs in for a programmable GPU.

    Method and system for accelerating route calculation in link state routing protocols
    54.
    发明授权
    Method and system for accelerating route calculation in link state routing protocols 失效
    在链路状态路由协议中加速路由计算的方法和系统

    公开(公告)号:US07058016B1

    公开(公告)日:2006-06-06

    申请号:US09687009

    申请日:2000-10-12

    申请人: John Harper

    发明人: John Harper

    IPC分类号: G01R31/08

    CPC分类号: H04L45/00

    摘要: A method for performing route calculations in a link state routing protocol at a node within a computer network. The method includes evaluating existing routes of the node when new route information is received and recalculating routes for the node only when the new route information improves at least one of the existing routes or at least one of the existing routes is made worse or lost. A system for performing route calculations is also disclosed.

    摘要翻译: 一种用于在计算机网络内的节点处的链路状态路由协议中执行路由计算的方法。 该方法包括:当新的路由信息​​被接收时,评估节点的现有路由,并且仅当新的路由信息​​改善至少一个现有路由或至少一个现有路由变得更糟或丢失时才重新计算该节点的路由。 还公开了一种用于执行路线计算的系统。

    Methods and apparatus for generating network topology information
    55.
    发明授权
    Methods and apparatus for generating network topology information 有权
    生成网络拓扑信息的方法和装置

    公开(公告)号:US07016313B1

    公开(公告)日:2006-03-21

    申请号:US09896416

    申请日:2001-06-28

    申请人: John Harper

    发明人: John Harper

    IPC分类号: H04J1/16

    CPC分类号: H04L45/02

    摘要: According to a specific embodiment of the present invention, methods and apparatus are disclosed for generating network topology information. A first link state packet associated with a first node is identified. A second link state packet associated with a second node is identified. Network topology information associated with the first node is generated using information from the first link state packet. Verification of two-way connectivity between the first node and the second node is deferred until analysis of the second link state packet is initiated for generating network topology information associated with the second node.

    摘要翻译: 根据本发明的具体实施例,公开了用于生成网络拓扑信息的方法和装置。 识别与第一节点相关联的第一链路状态分组。 识别与第二节点相关联的第二链路状态分组。 使用来自第一链路状态分组的信息来生成与第一节点相关联的网络拓扑信息。 延迟第一节点和第二节点之间的双向连接的验证,直到第二链路状态分组的分析被启动以生成与第二节点相关联的网络拓扑信息。

    Gaussian blur approximation suitable for GPU
    56.
    发明申请
    Gaussian blur approximation suitable for GPU 有权
    高斯模糊近似适用于GPU

    公开(公告)号:US20050286794A1

    公开(公告)日:2005-12-29

    申请号:US10876039

    申请日:2004-06-24

    IPC分类号: G06K9/32 G06K9/40 G06T5/00

    CPC分类号: G06T5/002 G06T5/20

    摘要: A Gaussian blur approximation is applied to an image by repeated down-sampling operations followed by an up-sample operation. By using a truncated Gaussian filter as the down-sample filter, the frequency spectrum removed during down-sampling operations closely approximates the frequency spectrum lost during a true Gaussian blur operation. While any “good” up-sample filter may be used, up-sampling via linear interpolation may be especially beneficial in systems having a dedicated graphics processing unit. One benefit of the described technique is that it is computationally less costly to implement than a Gaussian blur. Another benefit is that this computational benefit increases as the size of the blur increases—becoming significant even for small blurs. Yet another benefit of the invention is that a judicious selection of pixel address to convolve with the filter leads to substantially reduced number of texture lookups required to effect a convolution.

    摘要翻译: 高斯模糊近似通过重复的下采样操作随后进行上采样操作来应用于图像。 通过使用截断高斯滤波器作为下采样滤波器,在下采样操作期间去除的频谱与真正的高斯模糊操作期间的频谱损失密切相近。 虽然可以使用任何“良好”的抽样滤波器,但通过线性插值的上采样在具有专用图形处理单元的系统中尤其有利。 所描述的技术的一个好处是,与高斯模糊相比,在计算上成本较低。 另一个好处是,随着模糊大小的增加,这种计算效益即使对于小的模糊也变得显着。 本发明的另一个好处是,与滤波器卷积的像素地址的明智选择导致实现卷积所需的纹理查找的数量大大减少。

    Display-wide visual effects for a windowing system using a programmable graphics processing unit
    57.
    发明申请
    Display-wide visual effects for a windowing system using a programmable graphics processing unit 审中-公开
    使用可编程图形处理单元的窗口系统的显示器视觉效果

    公开(公告)号:US20050285866A1

    公开(公告)日:2005-12-29

    申请号:US10877358

    申请日:2004-06-25

    IPC分类号: G06F13/00 G09G5/37

    CPC分类号: G09G5/14 G06F9/451

    摘要: Techniques to effect arbitrary visual effects using fragment programs executing on a programmable graphics processing unit are described. In a first technique, visual effects are applied to a buffered window system's assembly buffer prior to compositing a target window. In a second technique, visual effects are applied to a target window as it is being composited into the system's assembly buffer. In a third technique, visual effects are applied to a system's assembly buffer after compositing a target window. Finally, in a fourth technique, visual effects are applied to the system's assembly buffer as it is transmitted to the system's frame-buffer.

    摘要翻译: 描述使用在可编程图形处理单元上执行的片段程序来实现任意视觉效果的技术。 在第一种技术中,在合成目标窗口之前,将视觉效果应用于缓冲窗口系统的装配缓冲器。 在第二种技术中,视觉效果被应用于目标窗口,因为它被合成到系统的汇编缓冲区中。 在第三种技术中,在合成目标窗口之后,将视觉效果应用于系统的汇编缓冲区。 最后,在第四种技术中,当系统的汇编缓冲区被传输到系统的帧缓冲器时,视觉效果被应用于系统的汇编缓冲器。

    Multiple protocol routing
    59.
    发明授权
    Multiple protocol routing 失效
    多协议路由

    公开(公告)号:US5251205A

    公开(公告)日:1993-10-05

    申请号:US577437

    申请日:1990-09-04

    IPC分类号: H04L12/56 H04L29/06 H04J3/26

    摘要: A method for connecting a network so that TCP/IP and OSI 8473 packets may be routed in the same domain. The independence of the addresses is maintained: one device in the network may be assigned only a TCP/IP address, and another device may be assigned only a ISO 8473 address. Furthermore, all of the routers share link state information by using a common link state packet format (such as the ISO 10589 format); thus routes through the network may be computed without regard for the protocols supported by the routers along the route. Where necessary, packets are encapsulated and forwarded through routers which are not capable in the protocol of the packet. In some disclosed embodiments, all of the routers in a given area support a given protocol (or, in fact, have identical capabilities, in which case encapsulation is not required). In these embodiments, the encapsulation is performed by suitable modifications to each router's packet forwarding procedures. In other disclosed embodiments, these topological restrictions are removed, and the network is expanded to support additional protocols. In these embodiments, the Dijkstra algorithm is also modified to generate information on how to encapsulate and forward packets through the network.

    摘要翻译: 一种用于连接网络的方法,使得TCP / IP和OSI 8473分组可以在相同的域中路由。 维护地址的独立性:网络中的一个设备只能分配一个TCP / IP地址,另一个设备只能分配一个ISO 8473地址。 此外,所有路由器通过使用公共链路状态分组格式(例如ISO 10589格式)来共享链路状态信息; 因此可以不考虑路由器沿路由器支持的协议来计算通过网络的路由。 必要时,数据包通过路由器进行封装​​和转发,路由器不能在报文的协议中。 在一些公开的实施例中,给定区域中的所有路由器支持给定的协议(或实际上具有相同的能力,在这种情况下不需要封装)。 在这些实施例中,通过对每个路由器的分组转发过程的适当修改来执行封装。 在其他公开的实施例中,这些拓扑限制被去除,并且网络被扩展以支持附加协议。 在这些实施例中,还修改Dijkstra算法以生成关于如何通过网络封装和转发分组的信息。