利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

14 条记录 (耗时 0.015 秒)

    PROVIDING LOCK-BASED ACCESS TO NODES IN A CONCURRENT LINKED LIST
    1.
    发明申请
    PROVIDING LOCK-BASED ACCESS TO NODES IN A CONCURRENT LINKED LIST 有权
    提供基于锁定的访问链接列表中的NODES

    公开(公告)号：US20120254139A1

    公开(公告)日：2012-10-04

    申请号：US13524665

    申请日：2012-06-15

    申请人： Chunyan Song ,  Joshua Phillips ,  John Duffy ,  Tim Harris ,  Stephen H. Toub ,  Boby George

    发明人： Chunyan Song ,  Joshua Phillips ,  John Duffy ,  Tim Harris ,  Stephen H. Toub ,  Boby George

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30362 ,  G06F9/526 ,  G06F17/30958

    摘要： A method of providing lock-based access to nodes in a concurrent linked list includes providing a plurality of striped lock objects. Each striped lock object is configured to lock at least one of the nodes in the concurrent linked list. An index is computed based on a value stored in a first node to be accessed in the concurrent linked list. A first one of the striped lock objects is identified based on the computed index. The first striped lock object is acquired, thereby locking and providing protected access to the first node.

    摘要翻译： 向并行链表中的节点提供基于锁的访问的方法包括提供多个条带锁定对象。 每个条带锁对象被配置为锁定并发链表中的至少一个节点。 基于存储在并发链表中要访问的第一节点的值来计算索引。 基于计算的索引来识别条带锁定对象中的第一个。 获取第一个条带锁定对象，从而锁定并提供对第一个节点的受保护的访问。

    VEHICLE HEADLIGHT DETECTING METHOD AND APPARATUS, AND REGION-OF-INTEREST SEGMENTING METHOD AND APPARATUS
    2.
    发明申请
    VEHICLE HEADLIGHT DETECTING METHOD AND APPARATUS, AND REGION-OF-INTEREST SEGMENTING METHOD AND APPARATUS 有权
    车辆头灯检测方法和装置，以及利益分配方法和装置

    公开(公告)号：US20090169105A1

    公开(公告)日：2009-07-02

    申请号：US12341193

    申请日：2008-12-22

    申请人： Chunyan Song ,  Wei Liu ,  Huai Yuan

    发明人： Chunyan Song ,  Wei Liu ,  Huai Yuan

    IPC分类号： G06K9/34 ,  G06K9/46

    CPC分类号： G06K9/3233 ,  G06K9/00785 ,  G06K9/00825

    摘要： A method and apparatus for detecting vehicle headlights and a region-of-interest (ROI) segmenting method and apparatus are disclosed. The ROI segmenting method includes: performing an edge extracting operation on a captured image to obtain edges of the captured image; selecting edges meeting predetermined criteria from the obtained edges, the predetermined criteria being the similarity between the region surrounded by the selected edges and the pattern formed by a vehicle headlight in physical reality at a position of the selected edges; determining the region surrounded by the selected edges within the captured image as a vehicle headlight pattern; and segmenting the ROI which potentially includes the vehicle pattern from the captured image based on the determined vehicle headlight pattern. With such a method and apparatus, the ROI of a vehicle may be acquired from the image without using the vehicle's bottom shadow.

    摘要翻译： 公开了一种用于检测车辆前灯和感兴趣区域（ROI）分割方法和装置的方法和装置。 ROI分割方法包括：对拍摄图像执行边缘提取操作以获得拍摄图像的边缘; 从所获得的边缘选择满足预定标准的边缘，所述预定标准是在所选边缘的位置处的物理现实中由所选边缘包围的区域与由车辆前灯形成的图案之间的相似度; 确定由拍摄图像内的所选边缘包围的区域作为车辆头灯图案; 以及基于所确定的车辆头灯图案，从捕获的图像分割潜在地包括车辆图案的ROI。 利用这种方法和装置，可以从图像中获取车辆的ROI，而不使用车辆的底部阴影。

    Vehicle headlight detecting method and apparatus, and region-of-interest segmenting method and apparatus
    4.
    发明授权
    Vehicle headlight detecting method and apparatus, and region-of-interest segmenting method and apparatus 有权
    车头灯检测方法和装置，以及利益分割方法和装置

    公开(公告)号：US08155381B2

    公开(公告)日：2012-04-10

    申请号：US12341193

    申请日：2008-12-22

    申请人： Chunyan Song ,  Wei Liu ,  Huai Yuan

    发明人： Chunyan Song ,  Wei Liu ,  Huai Yuan

    IPC分类号： G06K9/00

    CPC分类号： G06K9/3233 ,  G06K9/00785 ,  G06K9/00825

    摘要： A method and apparatus for detecting vehicle headlights and a region-of-interest (ROI) segmenting method and apparatus are disclosed. The ROI segmenting method includes: performing an edge extracting operation on a captured image to obtain edges of the captured image; selecting edges meeting predetermined criteria from the obtained edges, the predetermined criteria being the similarity between the region surrounded by the selected edges and the pattern formed by a vehicle headlight in physical reality at a position of the selected edges; determining the region surrounded by the selected edges within the captured image as a vehicle headlight pattern; and segmenting the ROI which potentially includes the vehicle pattern from the captured image based on the determined vehicle headlight pattern. With such a method and apparatus, the ROI of a vehicle may be acquired from the image without using the vehicle's bottom shadow.

    摘要翻译： 公开了一种用于检测车辆前灯和感兴趣区域（ROI）分割方法和装置的方法和装置。 ROI分割方法包括：对拍摄图像执行边缘提取操作以获得拍摄图像的边缘; 从所获得的边缘选择满足预定标准的边缘，所述预定标准是在所选边缘的位置处的物理现实中由所选边缘包围的区域与由车辆前灯形成的图案之间的相似度; 确定由拍摄图像内的所选边缘包围的区域作为车辆头灯图案; 以及基于所确定的车辆头灯图案，从捕获的图像分割潜在地包括车辆图案的ROI。 利用这种方法和装置，可以从图像中获取车辆的ROI，而不使用车辆的底部阴影。

    Maintaining a count for lock-free linked list structures
    5.
    发明授权
    Maintaining a count for lock-free linked list structures 有权
    维护无锁链表结构的计数

    公开(公告)号：US08312457B2

    公开(公告)日：2012-11-13

    申请号：US12637535

    申请日：2009-12-14

    申请人： Chunyan Song ,  Stephen H. Toub

    发明人： Chunyan Song ,  Stephen H. Toub

    IPC分类号： G06F9/46 ,  G06F13/00 ,  G06F7/00

    CPC分类号： G06F7/78 ,  G06F9/526 ,  G06F2205/064

    摘要： The present invention extends to methods, systems, and computer program products for maintaining a count for lock-free stack access. A numeric value representative of the total count of nodes in a linked list is maintained at the head node for the linked list. Commands for pushing and popping nodes appropriately update the total count at a new head node when nodes are added to and removed from the linked list. Thus, determining the count of nodes in a linked list is an order 1 (or O(1)) operation, and remains constant even when the size of a linked list changes.

    摘要翻译： 本发明扩展到用于维持无锁堆栈访问的计数的方法，系统和计算机程序产品。 表示链表中节点总数的数值在链表的头节点处被维护。 当节点被添加到链接列表中并从链接列表中删除时，用于推送和弹出节点的命令适当地更新新头节点处的总计数。 因此，确定链表中的节点数是1（或O（1））操作，即使当链表的大小发生变化时也保持不变。

    PROVIDING LOCK-BASED ACCESS TO NODES IN A CONCURRENT LINKED LIST
    6.
    发明申请
    PROVIDING LOCK-BASED ACCESS TO NODES IN A CONCURRENT LINKED LIST 有权
    提供基于锁定的访问链接列表中的NODES

    公开(公告)号：US20100274937A1

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

    申请号：US12428247

    申请日：2009-04-22

    申请人： Chunyan Song ,  Joshua Phillips ,  John Duffy ,  Tim Harris ,  Stephen H. Toub ,  Boby George

    发明人： Chunyan Song ,  Joshua Phillips ,  John Duffy ,  Tim Harris ,  Stephen H. Toub ,  Boby George

    IPC分类号： G06F12/14 ,  G06F17/30

    CPC分类号： G06F17/30362 ,  G06F9/526 ,  G06F17/30958

    摘要： A method of providing lock-based access to nodes in a concurrent linked list includes providing a plurality of striped lock objects. Each striped lock object is configured to lock at least one of the nodes in the concurrent linked list. An index is computed based on a value stored in a first node to be accessed in the concurrent linked list. A first one of the striped lock objects is identified based on the computed index. The first striped lock object is acquired, thereby locking and providing protected access to the first node.

    摘要翻译： 向并行链表中的节点提供基于锁的访问的方法包括提供多个条带锁定对象。 每个条带锁对象被配置为锁定并发链表中的至少一个节点。 基于存储在并发链表中要访问的第一节点的值来计算索引。 基于计算的索引来识别条带锁定对象中的第一个。 获取第一个条带锁定对象，从而锁定并提供对第一个节点的受保护的访问。

    MAINTAINING A COUNT FOR LOCK-FREE LINKED LIST STRUCTURES
    10.
    发明申请
    MAINTAINING A COUNT FOR LOCK-FREE LINKED LIST STRUCTURES 有权
    维护一个无锁链接列表结构的数据

    公开(公告)号：US20110145827A1

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

    申请号：US12637535

    申请日：2009-12-14

    申请人： Chunyan Song ,  Stephen H. Toub

    发明人： Chunyan Song ,  Stephen H. Toub

    IPC分类号： G06F9/46 ,  G06F7/00

    CPC分类号： G06F7/78 ,  G06F9/526 ,  G06F2205/064

    摘要： The present invention extends to methods, systems, and computer program products for maintaining a count for lock-free stack access. A numeric value representative of the total count of nodes in a linked list is maintained at the head node for the linked list. Commands for pushing and popping nodes appropriately update the total count at a new head node when nodes are added to and removed from the linked list. Thus, determining the count of nodes in a linked list is an order 1 (or O(1)) operation, and remains constant even when the size of a linked list changes

    摘要翻译： 本发明延伸到用于维持无锁堆栈访问的计数的方法，系统和计算机程序产品。 表示链表中节点总数的数值在链表的头节点处被维护。 当节点被添加到链接列表中并从链接列表中删除时，用于推送和弹出节点的命令适当地更新新头节点处的总计数。 因此，确定链表中的节点的数量是一个顺序1（或O（1））操作，并且即使当链表的大小改变时也保持不变