利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

56 条记录 (耗时 0.038 秒)

    Multiple fuel system for internal combustion engines
    3.
    发明申请
    Multiple fuel system for internal combustion engines 失效
    用于内燃机的多燃料系统

    公开(公告)号：US20090242038A1

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

    申请号：US12316030

    申请日：2008-12-09

    申请人： Bhaskar Sengupta ,  Krishnan Kumaran ,  Walter Weissman ,  Randall D. Partridge

    发明人： Bhaskar Sengupta ,  Krishnan Kumaran ,  Walter Weissman ,  Randall D. Partridge

    IPC分类号： G05D11/00

    CPC分类号： F02D41/0025 ,  F02M37/0064 ,  F02M37/0088 ,  Y02T10/36 ,  Y10T137/2509 ,  Y10T137/27

    摘要： A fuel management system mounted on a vehicle is operative to feed individually or a mixture of grades of relatively low, intermediate, and high autoignition temperature fuels to an associated internal combustion engine. The system includes an on board separation unit (OBS unit) for receiving and separating intermediate autoignition temperature (IAT) fuel into low and high autoignition temperature fuels, LAT and HAT, respectively. The production rate of the LAT and HAT fuels by the OBS unit is controlled to substantially match the consumption requirements of the engine at any given time for the LAT and HAT fuels.

    摘要翻译： 安装在车辆上的燃料管理系统可操作以将相对低的，中等的和高的自燃温度燃料的等级的单独的或混合物供给到相关联的内燃机。 该系统包括用于分别将中间自燃温度（IAT）燃料接收和分离成低和高自燃温度燃料LAT和HAT的船上分离单元（OBS单元）。 控制OBS装置的LAT和HAT燃料的生产率在任何给定的时间基本匹配了发动机对LAT和HAT燃料的消耗要求。

    Sensor network design and inverse modeling for reactor condition monitoring
    4.
    发明授权
    Sensor network design and inverse modeling for reactor condition monitoring 有权

    公开(公告)号：US10401164B2

    公开(公告)日：2019-09-03

    申请号：US14037953

    申请日：2013-09-26

    申请人： Limin Song ,  Krishnan Kumaran ,  Bhaskar Sengupta ,  Jingbo Wang

    发明人： Limin Song ,  Krishnan Kumaran ,  Bhaskar Sengupta ,  Jingbo Wang

    IPC分类号： G01B21/20 ,  G05B23/02

    摘要： Methods and systems for detecting a condition within a component of a process plant, including obtaining a first and second set of parameter measurements from a first and second plurality of sensor locations along a first dimension of an outside surface of a component, processing the first and second set of parameter measurements to develop a continuous surface condition profile of the component using a predetermined model. The predetermined model includes a forward solution to an equation describing the condition and is linearly separable in at least two dimensions corresponding to the first and second dimension. The model includes an inverse solution to the equation to provide a set of coefficients corresponding to a set of basis functions of the forward solution based on the first and second set of parameter measurements.

    Detection of Features in Seismic Images
    8.
    发明申请
    Detection of Features in Seismic Images 有权
    地震图像特征检测

    公开(公告)号：US20100254219A1

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

    申请号：US12741133

    申请日：2008-10-31

    申请人： Krishnan Kumaran ,  Jingbo Wang

    发明人： Krishnan Kumaran ,  Jingbo Wang

    IPC分类号： G01V1/36 ,  G01V1/28

    CPC分类号： G01V1/288

    摘要： A computer implemented method for the detection of features such as faults or channels in seismic images. First, edges are detected in a smoothed seismic image (106). To detect a fault line, an image intensity of the edges is projected in multiple spatial directions, for example by performing a Radon transform (118). The directions of maximum intensity are used to define a fault line (124c). To detect channels, smooth curves are identified within the detected edges (810). Sets of parallel smooth curves (812a) are then identified and used to define channels (812).

    摘要翻译： 一种用于检测地震图像中的故障或通道等特征的计算机实现方法。 首先，在平滑的地震图像中检测边缘（106）。 为了检测故障线，例如通过执行Radon变换（118），沿多个空间方向投影边缘的图像强度。 最大强度的方向用于定义断层线（124c）。 为了检测通道，在检测到的边缘内识别平滑曲线（810）。 然后识别并行平滑曲线组（812a）并用于定义通道（812）。

    Method for partitioning mobile stations of a wireless network between an overlay and an underlay
    9.
    发明授权
    Method for partitioning mobile stations of a wireless network between an overlay and an underlay 有权
    用于分割覆盖层和底层之间的无线网络的移动站的方法

    公开(公告)号：US06405046B1

    公开(公告)日：2002-06-11

    申请号：US09369687

    申请日：1999-08-06

    申请人： Krishnan Kumaran ,  Philip Alfred Whiting

    发明人： Krishnan Kumaran ,  Philip Alfred Whiting

    IPC分类号： H04Q722

    CPC分类号： H04W16/10 ,  H04W16/32 ,  H04W36/04

    摘要： A method is described for partitioning the mobile stations occupying each of a plurality of cells of a wireless communication network between an overlay and an underlay. Within each cell, each of that cell's mobile stations is assigned to the overlay if the mobile station's corresponding path loss exceeds a path-loss threshold, and to the underlay if its corresponding path loss lies below the path-loss threshold. The path-loss threshold for each cell is determined according to a procedure that seeks to drive network capacity up while satisfying a rule that relates to intercell interference.

    摘要翻译： 描述了一种划分占用覆盖层和底层之间的无线通信网络的多个小区中的每一个的移动站的方法。 在每个小区内，如果移动站的对应路径损耗超过路径损耗阈值，则该小区的移动站中的每一个被分配给覆盖，如果其对应的路径损耗低于路径损耗阈值，则将其分配给覆盖。 根据在满足与小区间干扰有关的规则的同时提高网络容量的过程来确定每个小区的路径损耗阈值。

    Method for operating a wireless telecommunications system
    10.
    发明授权
    Method for operating a wireless telecommunications system 失效

    公开(公告)号：US6094584A

    公开(公告)日：2000-07-25

    申请号：US48443

    申请日：1998-03-26

    申请人： Sanjeev Khanna ,  Krishnan Kumaran

    发明人： Sanjeev Khanna ,  Krishnan Kumaran

    IPC分类号： H04B7/26 ,  H04W16/10 ,  H04B7/00 ,  H04Q7/20

    CPC分类号： H04W16/10 ,  H04W28/16

    摘要： A method for operating a wireless telecommunications system whereby communication channels are efficiently allocated to cells of the system is provided. In accordance with an illustrative embodiment of the present method, call demand information is obtained for each cell in the wireless system and converted to a channel demand. Once the channel demand for each cell is known, a tentative channel allocation is performed. Call demand information can be obtained as frequently as desired to update channel allocation throughout the wireless system. In some embodiments, the method for channel allocation described herein can be used alone to allocate channels. In other embodiments, the present method for channel allocation can be used on an hourly, daily, or other temporal basis, as appropriate, to provide a channel allocation which is then updated on a substantially continuous basis by any conventional dynamic channel allocation scheme. To allocate channels, an "interference graph" that relates interfering cells to one another is defined. When nearest-cell interference is considered, an initial step is performed wherein three channels are iteratively allocated to all cells in the system to remove all groupings within the interference graph comprising three mutually-interfering cells. During the initial step, the allocation of three channels reduces channel demand by one in every cell. Once the interference graph is free of such three-membered groupings, channel demand is reduced more efficiently wherein no more than five channels are allocated to satisfy two units of channel demand. To do so, a decomposition/reconstruction operation is performed wherein the interference graph is segregated into groupings of cells to which channels are allocated. The operation for allocating channels to cells when nearest- and next-to-nearest-cell interference is considered does not use the initial step of allocating three channels. It does, however, proceed in a manner analogous to the decomposition/reconstruction process mentioned above, although the operation is performed on a cell-by-cell basis, rather than with groupings of cells.