中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

41 records (took 0.022 seconds)

    Display device, backlight module of such display device, and method of fixing circuit board on such backlight module
    1.
    发明授权
    Display device, backlight module of such display device, and method of fixing circuit board on such backlight module 有权
    显示装置，这种显示装置的背光模块，以及将该电路板固定在这种背光模块上的方法

    公开(公告)号：US08047668B2

    公开(公告)日：2011-11-01

    申请号：US12392213

    申请日：2009-02-25

    Applicant: Chih-Jen Chang ,  Shun-Nan Chang

    Inventor： Chih-Jen Chang ,  Shun-Nan Chang

    IPC: G09F13/04 ,  G09F13/08

    CPC classification number: G02B6/0085 ,  G02B6/0083 ,  H05K3/0058

    Abstract: A backlight module includes at least one light source, a lamp cover and a circuit board. The lamp cover has a containing portion and at least one projection. The containing portion is arranged for containing the light source. The projection is located at an outer side of the containing portion on which the circuit board is placed so that at least one fixing portion of the circuit board is in contact with the projection for constraining movements of the circuit board relative to the lamp cover.

    Abstract translation: 背光模块包括至少一个光源，灯罩和电路板。 灯罩具有容纳部分和至少一个突起。 容纳部被配置为容纳光源。 突出部位于容纳部分的外侧，电路板放置在该外部，使得电路板的至少一个固定部分与突起接触，用于限制电路板相对于灯罩的运动。

    Techniques for Connecting an External Network Coprocessor to a Network Processor Packet Parser
    2.
    发明申请
    Techniques for Connecting an External Network Coprocessor to a Network Processor Packet Parser 有权
    将外部网络协处理器连接到网络处理器数据包解析器的技术

    公开(公告)号：US20130308653A1

    公开(公告)日：2013-11-21

    申请号：US13884664

    申请日：2011-12-19

    Applicant: Claude Basso ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Damon Philippe ,  Natarajan Vaidhyanathan ,  Colin B. Verrilli ,  Fabrice Jean Verplanken

    Inventor： Claude Basso ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Damon Philippe ,  Natarajan Vaidhyanathan ,  Colin B. Verrilli ,  Fabrice Jean Verplanken

    IPC: H04L29/06

    CPC classification number: H04L29/0653 ,  G06F9/3877 ,  G06F9/544 ,  G06F13/385 ,  G06F15/163 ,  H04L69/22

    Abstract: A network processor includes first communication protocol ports that each support ‘M’ minimum size packet data path traffic on ‘N’ lanes at ‘S’ Gigabits per second (Gbps) and traffic with different communication protocol units on ‘n’ additional lanes at ‘s’ Gbps. The first communication protocol ports support access to an external coprocessor using parsing logic located in each of the first communication protocol ports. The parsing logic, during a parsing period, is configured to send a request to the external coprocessor at reception of a ‘M’ size packet and to receive a response from the external coprocessor. The parsing logic sends a request maximum ‘m’ size byte word to the external coprocessor on one of the additional lanes and receives a response maximum ‘m’ size byte word from the external coprocessor on the one of the additional lanes while complying with the equation N×S/M=

    Abstract translation: 网络处理器包括第一通信协议端口，每个端口以“S”千兆位/秒（Gbps）在“N”通道上支持“M”个最小尺寸分组数据路径业务，并且在“n”个附加车道上以不同的通信协议单元的流量“ s Gbps 第一通信协议端口支持使用位于每个第一通信协议端口中的解析逻辑来访问外部协处理器。 解析逻辑在解析周期期间被配置为在接收到“M”大小的分组时向外部协处理器发送请求并且从外部协处理器接收响应。 解析逻辑在附加通道之一上向外部协处理器发送请求最大“m”字节字，并在附加通道之一上从外部协处理器接收响应最大“m”字节字，同时遵循等式 N×S / M =

    Split socket send queue apparatus and method with efficient queue flow control, retransmission and sack support mechanisms
    4.
    发明授权
    Split socket send queue apparatus and method with efficient queue flow control, retransmission and sack support mechanisms 失效
    拆分套接字发送队列设备和方法，具有高效的队列流控制，重传和备份支持机制

    公开(公告)号：US07818362B2

    公开(公告)日：2010-10-19

    申请号：US11418606

    申请日：2006-05-05

    Applicant: William Todd Boyd ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Douglas J. Joseph ,  Renato John Recio

    Inventor： William Todd Boyd ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Douglas J. Joseph ,  Renato John Recio

    IPC: G06F15/16 ,  G06F3/00

    CPC classification number: H04L47/10 ,  H04L47/193 ,  H04L69/12 ,  H04L69/16 ,  H04L69/161 ,  H04L69/162

    Abstract: A mechanism for offloading the management of send queues in a split socket stack environment, including efficient split socket queue flow control and TCP/IP retransmission support. An Upper Layer Protocol (ULP) creates send work queue entries (SWQEs) for writing to the send work queue (SWQ). The Internet Protocol Suite Offload Engine (IPSOE) is notified of a new entry to the SWQ and it subsequently reads this entry that contains pointers to the data that is to be transmitted. After the data is transmitted and acknowledgments are received, the IPSOE creates a completion queue entry (CQE) that is written into the completion queue (CQ). The flow control between the ULP and the IPSOE is credit based. The passing of CQ credits is the only explicit mechanism required to manage flow control of both the SWQ and the CQ between the ULP and the IPSOE.

    Abstract translation: 一种卸载分组套接字堆栈环境中发送队列管理的机制，包括高效的分裂套接字队列流控制和TCP / IP重传支持。 上层协议（ULP）创建用于写入发送工作队列（SWQ）的发送工作队列条目（SWQE）。 Internet协议套件卸载引擎（IPSOE）被通知一个新的条目到SWQ，它随后读取这个条目，其中包含指向要发送的数据的指针。 在发送数据并接收到确认之后，IPSOE创建写入完成队列（CQ）的完成队列条目（CQE）。 ULP和IPSOE之间的流量控制是基于信用的。 CQ信用证的通过是在ULP和IPSOE之间管理SWQ和CQ两者流量控制所需的唯一明确的机制。

    Split socket send queue apparatus and method with efficient queue flow control, retransmission and sack support mechanisms
    5.
    发明授权
    Split socket send queue apparatus and method with efficient queue flow control, retransmission and sack support mechanisms 失效
    拆分套接字发送队列设备和方法，具有高效的队列流控制，重传和备份支持机制

    公开(公告)号：US07519650B2

    公开(公告)日：2009-04-14

    申请号：US10235689

    申请日：2002-09-05

    Applicant: William Todd Boyd ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Douglas J. Joseph ,  Renato John Recio

    Inventor： William Todd Boyd ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Douglas J. Joseph ,  Renato John Recio

    IPC: G06F15/16

    CPC classification number: H04L47/10 ,  H04L47/193 ,  H04L69/12 ,  H04L69/16 ,  H04L69/161 ,  H04L69/162

    Abstract: A mechanism for offloading the management of send queues in a split socket stack environment, including efficient split socket queue flow control and TCP/IP retransmission support. As consumers initiate send operations, send work queue entries (SWQEs) are created by an Upper Layer Protocol (ULP) and written to the send work queue (SWQ). The Internet Protocol Suite Offload Engine (IPSOE) is notified of a new entry to the SWQ and it subsequently reads this entry that contains pointers to the data that is to be transmitted. After the data is transmitted and acknowledgments are received, the IPSOE creates a completion queue entry (CQE) that is written into the completion queue (CQ). After the CQE is written, the ULP subsequently processes the entry and removes it from the CQE, freeing up a space in both the SWQ and CQ. The number of entries available in the SWQ are monitored by the ULP so that it does not overwrite any valid entries. Likewise, the IPSOE monitors the number of entries available in the CQ, so as not overwrite the CQ. The flow control between the ULP and the IPSOE is credit based. The passing of CQ credits is the only explicit mechanism required to manage flow control of both the SWQ and the CQ between the ULP and the IPSOE.

    Abstract translation: 一种卸载分组套接字堆栈环境中发送队列管理的机制，包括高效的分裂套接字队列流控制和TCP / IP重传支持。 当消费者发起发送操作时，发送工作队列条目（SWQE）由上层协议（ULP）创建并写入发送工作队列（SWQ）。 互联网协议套件卸载引擎（IPSOE）被通知一个新条目到SWQ，它随后读取这个条目，其中包含指向要发送的数据的指针。 在发送数据并接收到确认之后，IPSOE创建写入完成队列（CQ）的完成队列条目（CQE）。 在编写CQE后，ULP随后处理该条目并将其从CQE中删除，从而释放了SWQ和CQ两者的空间。 SWQ中可用的条目数由ULP进行监视，以使其不会覆盖任何有效的条目。 同样，IPSOE监视CQ中可用条目的数量，以免覆盖CQ。 ULP和IPSOE之间的流量控制是基于信用的。 CQ信用证的通过是在ULP和IPSOE之间管理SWQ和CQ两者流量控制所需的唯一明确的机制。

    Assigning work from multiple sources to multiple sinks given assignment constraints
    7.
    发明授权
    Assigning work from multiple sources to multiple sinks given assignment constraints 失效
    给定分配约束将工作从多个源分配给多个汇点

    公开(公告)号：US08532129B2

    公开(公告)日：2013-09-10

    申请号：US12650120

    申请日：2009-12-30

    Applicant: Claude Basso ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Hubertus Franke ,  Terry L. Nelms, II ,  Fabrice Jean Verplanken

    Inventor： Claude Basso ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Hubertus Franke ,  Terry L. Nelms, II ,  Fabrice Jean Verplanken

    IPC: H04L12/28

    CPC classification number: H04L49/9047

    Abstract: Assigning work, such as data packets, from a plurality of sources, such as data queues in a network processing device, to a plurality of sinks, such as processor threads in the network processing device is provided. In a given processing period, sinks that are available to receive work are identified and sources qualified to send work to the available sinks are determined taking into account any assignment constraints. A single source is selected from an overlap of the qualified sources and sources having work available. This selection may be made using a hierarchical source scheduler for processing subsets of supported sources simultaneously in parallel. A sink to which work from the selected source may be assigned is selected from available sinks qualified to receive work from the selected source.

    Abstract translation: 提供了诸如数据分组的工作，诸如诸如网络处理设备中的数据队列的多个源到网络处理设备中的诸如处理器线程的多个接收器。 在给定的处理期间，确定可用于接收工作的接收器，并且考虑到任何分配约束来确定用于将工作发送到可用接收器的资源。 从具有可用工作的合格来源和源的重叠中选择单个来源。 可以使用用于并行同时处理所支持的源的子集的分级源调度器来进行该选择。 从可选择的来源可以分配工作的接收端从有资格从所选源接收工作的可用接收器中选择。

    Assignment Constraint Matrix for Assigning Work From Multiple Sources to Multiple Sinks
    8.
    发明申请
    Assignment Constraint Matrix for Assigning Work From Multiple Sources to Multiple Sinks 失效
    分配约束矩阵用于将工作从多个来源分配到多个接收器

    公开(公告)号：US20110158249A1

    公开(公告)日：2011-06-30

    申请号：US12650080

    申请日：2009-12-30

    Applicant: Claude Basso ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Hubertus Franke ,  Fabrice J. Verplanken ,  Colin B. Verrilli

    Inventor： Claude Basso ,  Jean L. Calvignac ,  Chih-Jen Chang ,  Hubertus Franke ,  Fabrice J. Verplanken ,  Colin B. Verrilli

    IPC: H04L12/56

    CPC classification number: H04L49/9047

    Abstract: An assignment constraint matrix method and apparatus used in assigning work, such as data packets, from a plurality of sources, such as data queues in a network processing device, to a plurality of sinks, such as processor threads in the network processing device. The assignment constraint matrix is implemented as a plurality of qualifier matrixes adapted to operate simultaneously in parallel. Each of the plurality of qualifier matrixes is adapted to determine sources in a subset of supported sources that are qualified to provide work to a set of sinks based on assignment constraints. The determination of qualified sources may be based sink availability information that may be provided for a set of sinks on a single chip or distributed on multiple chips.

    Abstract translation: 一种分配约束矩阵方法和装置，用于从网络处理设备中的多个源（诸如网络处理设备中的数据队列）将诸如数据分组的工作分配给诸如网络处理设备中的处理器线程的多个接收器。 分配约束矩阵被实现为适于同时并行操作的多个限定符矩阵。 多个限定符矩阵中的每一个适于确定被支持的源的子集中的源，所述源被限定为基于分配约束向一组接收器提供工作。 合格来源的确定可以是可以在单个芯片上提供用于一组接收器或分布在多个芯片上的接收器可用性信息。

    MALWARE PREVENTION METHOD AND SYSTEM IN A PEER-TO-PEER ENVIRONMENT
    9.
    发明申请
    MALWARE PREVENTION METHOD AND SYSTEM IN A PEER-TO-PEER ENVIRONMENT 审中-公开
    恶意环境中的恶意预防方法和系统

    公开(公告)号：US20100263048A1

    公开(公告)日：2010-10-14

    申请号：US12422989

    申请日：2009-04-14

    Applicant: Chih-Jen Chang ,  Shih-Wei Chien

    Inventor： Chih-Jen Chang ,  Shih-Wei Chien

    IPC: G06F21/00 ,  G06F12/14 ,  G06F17/30

    CPC classification number: H04L63/145 ,  G06F21/566 ,  H04L67/104

    Abstract: A computer-implemented method and system for malware prevention in a peer-to-peer (P2P) environment are disclosed. Specifically, one implementation of the embodiment sets forth a method, which includes the operations of obtaining a meta information of a data, prior to initiating downloading of the data, sending the meta information to a server, and initiating downloading of the data after having received confirmation from the server that the meta information is free from being associated with any known malware.

    Abstract translation: 公开了一种用于在对等（P2P）环境中防恶意软件的计算机实现的方法和系统。 具体地，本实施例的一个实现方案提出了一种方法，其包括在开始下载数据之前获得数据的元信息的操作，向服务器发送元信息，以及在接收到数据之后开始数据的下载 从服务器确认元信息与任何已知的恶意软件无关。

Patent Agency Ranking