利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

40 条记录 (耗时 0.03 秒)

    Universal dock for context sensitive computing device
    5.
    发明授权
    Universal dock for context sensitive computing device 有权
    用于上下文敏感计算设备的通用基座

    公开(公告)号：US09542203B2

    公开(公告)日：2017-01-10

    申请号：US12960753

    申请日：2010-12-06

    申请人： Amer A. Hassan ,  Yatharth Gupta ,  Ravi Rao ,  Billy R. Anders, Jr.

    发明人： Amer A. Hassan ,  Yatharth Gupta ,  Ravi Rao ,  Billy R. Anders, Jr.

    IPC分类号： G06F1/30 ,  G06K17/00 ,  G06F13/00 ,  G06F1/16 ,  H04M1/02 ,  G06F9/445 ,  G06K7/00 ,  G06F13/40 ,  G06F1/26 ,  H04W84/18 ,  H04W12/04 ,  H04W84/12

    CPC分类号： G06F1/1632 ,  G06F1/1626 ,  G06F1/26 ,  G06F1/30 ,  G06F9/445 ,  G06F13/00 ,  G06F13/4081 ,  G06F13/409 ,  G06K7/00 ,  H04M1/0254 ,  H04W84/12

    摘要： A dock for interacting with a computing device. The computing device configures itself for operations based on its context, which may be determined form the dock by reading a value from a tag on the dock. The computing device may use low power transmissions such that receiving a value from the tag provides an indication of proximity to the dock. The value read provides an indication of a desired operation, and, in response to reading a value of the tag, the computing device may launch an application, pair with devices in the vicinity of the dock, or take other actions that configure the computing device. A universal dock, usable with computing devices of a plurality of form factors, may be implemented by providing an array of tags and, in some cases, a non-contact power supply.

    摘要翻译： 用于与计算设备交互的坞站。 计算设备基于其上下文来配置自身以进行操作，其可以通过从坞站上的标签读取值来从终端确定。 计算设备可以使用低功率传输，使得从标签接收值提供与码头接近的指示。 读取的值提供期望的操作的指示，并且响应于读取标签的值，计算设备可以启动应用程序，与停靠站附近的设备配对，或采取配置计算设备的其他动作 。 可以与多个形状因子的计算装置一起使用的通用码头可以通过提供标签阵列，并且在某些情况下提供非接触电源来实现。

    Efficient iterative, gridless, cost-based fine router for computer controlled integrated circuit design
    6.
    发明授权
    Efficient iterative, gridless, cost-based fine router for computer controlled integrated circuit design 有权
    高效的迭代，无栅格，基于成本的精细路由器，用于计算机控制的集成电路设计

    公开(公告)号：US06324675B1

    公开(公告)日：2001-11-27

    申请号：US09215467

    申请日：1998-12-18

    申请人： Robi Dutta ,  Ravi Rao ,  Ashok Vittal

    发明人： Robi Dutta ,  Ravi Rao ,  Ashok Vittal

    IPC分类号： G04F1760

    CPC分类号： G06F17/5077

    摘要： An efficient iterative, gridless, cost-based router for a computer controlled integrated circuit design. The fine routing process is used during the wire routing phase of an integrated circuit design and fabrication process. During the wire routing process, wires are routed between pins of nets. The routing process of the present invention is gridless and utilizes lanes that are defined based on the boundaries of objects. The cost-based router computes a cost for each wire path, and the cost is based on: (1) the manhattan wire distance: (2) the layers in which the wire runs; and (3) any overlap the wire has with soft obstacles (e.g., other wires, etc.); and (4) an estimated cost to the target. Cost computation is reduced by considering only obstacles within the layer in which a lane is run. The number of paths determined for a wire route is reduced by pruning possible paths based on the placement of obstacles within the integrated circuit. Further pruning is performed by picking the lowest cost child lane in cases when several lanes select the same lane. Paths are also pruned by stopping along any path whose work-in-progress cost estimation exceeds the final cost of a path already discovered. In multi-pin nets, the routing process selects that path (of equal cost paths) between a source pin and a target pin that also runs closer to another unconnected pin of the multi-pin net. When a source-target wire route is performed for a multi-pin net, the unconnected pin is treated as the target and the source is considered as the source-target wire route.

    摘要翻译： 一种用于计算机控制集成电路设计的高效迭代，无栅格，基于成本的路由器。 在集成电路设计和制造过程的线路布线阶段期间使用精细布线过程。 在电线布线过程中，电线在网的引脚之间布线。 本发明的路由过程是无栅格的并且利用基于对象边界定义的车道。 基于成本的路由器计算每个线路的成本，成本基于：（1）曼哈顿线距：（2）线路运行的层; 和（3）电线与软障碍物（例如其他电线等）的任何重叠; 和（4）目标的估计成本。 通过仅考虑运行车道的层内的障碍物来降低成本计算。 通过基于集成电路内的障碍物的布置修剪可能的路径来减少为有线路由确定的路径数量。 在多条车道选择同一车道的情况下，通过选择最低成本的儿童车道进行进一步修剪。 通过停止在工作进行中的成本估算超过已经发现的路径的最终成本的任何路径也修剪路径。 在多引脚网络中，路由过程选择源引脚和目标引脚之间的路径（相同的成本路径），该引脚也越靠近多引脚网的另一个未连接的引脚。 当针对多针网络执行源目标线路时，将未连接的引脚视为目标，并将源视为源 - 目标线路。

    CONTEXT DEPENDENT COMPUTER OPERATION
    7.
    发明申请
    CONTEXT DEPENDENT COMPUTER OPERATION 审中-公开
    背景相关的计算机操作

    公开(公告)号：US20120139690A1

    公开(公告)日：2012-06-07

    申请号：US12960730

    申请日：2010-12-06

    申请人： Yatharth Gupta ,  Amer A. Hassan ,  Ravi Rao ,  Billy R. Anders, JR.

    发明人： Yatharth Gupta ,  Amer A. Hassan ,  Ravi Rao ,  Billy R. Anders, JR.

    IPC分类号： G06F7/04 ,  H02J7/00

    CPC分类号： H04M1/72569 ,  H02J7/025 ,  H02J50/10 ,  H02J50/90 ,  H04M1/7253 ,  H04M2250/04 ,  H04W4/023 ,  H04W4/80

    摘要： A context dependent computing device. The computing device configures itself for operations based on its context. The computing device may determine its context by reading a value from a tag using low power transmissions such that receiving a value from the tag provides an indication of proximity to a location where the tag is affixed. The value read provides an indication of a desired operation. In response to reading a value of a tag, the computing device may identify an application to launch, identify devices with which to pair or take other actions that configure the computing device for its context.

    摘要翻译： 上下文相关计算设备。 计算设备根据其上下文配置自身的操作。 计算设备可以通过使用低功率传输从标签读取值来确定其上下文，使得从标签接收值提供与标签被贴附的位置的接近的指示。 读取的值提供了所需操作的指示。 响应于读取标签的值，计算设备可以标识要启动的应用程序，识别与其配对或采取为其上下文配置计算设备的其他动作的设备。

    Capturing contacts via people near me
    8.
    发明申请
    Capturing contacts via people near me 审中-公开
    通过我附近的人捕获联系

    公开(公告)号：US20070008987A1

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

    申请号：US11175951

    申请日：2005-07-06

    申请人： Todd Manion ,  Sandeep Singhal ,  Ravi Rao

    发明人： Todd Manion ,  Sandeep Singhal ,  Ravi Rao

    IPC分类号： H04J3/02

    CPC分类号： G06Q10/10 ,  H04L63/061 ,  H04L63/0823 ,  H04L67/104 ,  H04L67/24 ,  H04L67/36 ,  H04W12/06 ,  H04W84/18

    摘要： Users on a peer-to-peer network, particularly a local subnet or ad hoc wireless network, may publish first contact information to a graph or data store on the network. The first contact information may include a certificate with a public-key and a user identification, such as a peer name. Other users may discover the first contact information and use the first contact information to request additional information from the user. Data in the first contact information may also be “promoted” by adding the information to a trusted contacts database, allowing the user additional privileges. The user publishing the first contact information may be given the opportunity to approve or deny the request for additional information.

    摘要翻译： 对等网络，特别是本地子网或自组织无线网络上的用户可以将第一联系人信息发布到网络上的图形或数据存储。 第一联系人信息可以包括具有公开密钥的证书和诸如对等体名称的用户标识。 其他用户可以发现第一联系人信息并使用第一联系人信息来请求来自用户的附加信息。 通过将信息添加到可信联系人数据库中，允许用户附加特权，也可以“提升”第一联系人信息中的数据。 可以给出发布第一联系人信息的用户批准或拒绝对附加信息的请求的机会。