利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

14 条记录 (耗时 0.051 秒)

    Contextual search interface for business directory services
    6.
    发明授权
    Contextual search interface for business directory services 有权
    业务目录服务的上下文搜索界面

    公开(公告)号：US07162470B2

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

    申请号：US10457830

    申请日：2003-06-09

    申请人： Jayant Sharma ,  Ping Wang ,  Liujian Qian ,  Ji Yang

    发明人： Jayant Sharma ,  Ping Wang ,  Liujian Qian ,  Ji Yang

    IPC分类号： G06F17/00 ,  G06F17/30

    CPC分类号： G06F17/30395 ,  G06F17/30241 ,  G06F17/30528 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99935

    摘要： Business directory services allow definitions of custom category hierarchies and different search methods, such as, for example, search by location, distance from an addressable location, partial or complete business name, and category. A stepwise refinement search interface provides capability for searching within search results using different search methods or categories. Thus, a user does not have to refine and re-enter search criteria in order to get a progressively selective search. This is particularly useful for mobile phone or hand-held device users who would prefer not to have to re-enter the criteria on each search but rather incrementally refine the search criteria.

    摘要翻译： 业务目录服务允许自定义类别层次结构和不同搜索方法的定义，例如按位置搜索，距离可寻址位置的距离，部分或完整的业务名称和类别。 逐步细化搜索界面提供了使用不同搜索方法或类别在搜索结果内进行搜索的功能。 因此，为了获得渐进的选择性搜索，用户不必改进并重新输入搜索条件。 这对于不想在每个搜索上重新输入标准的移动电话或手持设备用户来说特别有用，而是逐步改进搜索条件。

    Buffering a hierarchical index of multi-dimensional data
    7.
    发明授权
    Buffering a hierarchical index of multi-dimensional data 有权
    缓冲多维数据的分层索引

    公开(公告)号：US06470344B1

    公开(公告)日：2002-10-22

    申请号：US09384648

    申请日：1999-08-27

    申请人： Ravi Kothuri ,  Siva Ravada ,  Jayant Sharma ,  Jayanta Banerjee ,  Ambuj Singh

    发明人： Ravi Kothuri ,  Siva Ravada ,  Jayant Sharma ,  Jayanta Banerjee ,  Ambuj Singh

    IPC分类号： G06F1730

    CPC分类号： G06F17/30327 ,  G06F17/30333 ,  G06F17/30592 ,  Y10S707/957 ,  Y10S707/99945

    摘要： Methods are provided for buffering nodes of a hierarchical index (e.g., R-tree, bang file, hB-tree) during operations on multi-dimensional data represented by the index. The methods are particularly suited for query operations, and a different method may be more suitable for one pattern of queries than another. Where queries are distributed in a relatively uniform manner across the domain or dataspace of an index, a node-area buffering method is provided. In this method nodes are cached or buffered in order of their respective areas (e.g., their minimum bounding areas), and a node having a smaller area will be replaced in cache before a node having a larger area. When, however, queries are not uniformly distributed, then a least frequently accessed buffering technique may be applied. According to this method statistics are maintained concerning the frequency with which individual index nodes are accessed. Those accessed less frequently are replaced in cache before those accessed more frequently. Yet another, generic, buffering strategy is provided that is suitable for all patterns of query distribution. In accordance with this method, whenever a node must be removed from cache in order to make room for a newly accessed node, cached nodes are compared to each other to determine which provides the least caching benefit and may therefore be ejected. A comparison may involve three factors—the difference in the nodes' areas, the difference in the frequency with which they have been accessed and the difference between their latest access times. These factors may be weighted to give them more or less effect in relation to each other.

    摘要翻译： 提供了用于在由索引表示的多维数据的操作期间缓冲分层索引（例如，R-tree，bang文件，hB-树）的节点的方法。 这些方法特别适用于查询操作，并且不同的方法可能比另一种更适合于一种查询模式。 在索引的域或数据空间中以相对均匀的方式分布查询的情况下，提供了节点区域缓冲方法。 在这种方法中，节点按照它们各自的区域（例如，它们的最小边界区域）的顺序进行缓存或缓冲，并且具有较小区域的节点将在具有较大面积的节点之前在高速缓存中被替换。 然而，当查询不是均匀分布时，则可以应用最不频繁访问的缓冲技术。 根据该方法，关于访问各个索引节点的频率来维持统计。 访问次数较少的用户在更频繁访问的缓存中被替换。 提供了另一种适用于所有查询分发模式的通用缓冲策略。 根据该方法，每当节点必须从高速缓存中移除以便为新访问的节点腾出空间时，将缓存的节点彼此进行比较，以确定哪个节点提供最小的缓存优点并且因此可以被弹出。 比较可能涉及三个因素 - 节点区域的差异，访问频率的差异以及其最新访问时间之间的差异。 这些因素可能被加权，以使他们或多或少相互影响。

    Nearest neighbor query processing in a linear quadtree spatial index
    9.
    发明授权
    Nearest neighbor query processing in a linear quadtree spatial index 有权
    线性四叉树空间索引中的最近邻查询处理

    公开(公告)号：US06879980B1

    公开(公告)日：2005-04-12

    申请号：US09893550

    申请日：2001-06-29

    申请人： Ravi Kanth V. Kothuri ,  Siva Ravada ,  Jayant Sharma

    发明人： Ravi Kanth V. Kothuri ,  Siva Ravada ,  Jayant Sharma

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30333 ,  G06F17/30241 ,  G06F17/30327 ,  G06F17/30483 ,  G06F17/30592 ,  Y10S707/955 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99945

    摘要： A method for locating neighbor objects of a query object in a database. A query tile set is defined including a plurality of tiles that define an initial query radius that the query object is grouped within. Neighbor objects are located within the initial query radius. A number of neighbor objects within the initial query radius is determined. The query radius is expanded beyond the initial query radius by defining an expanded query tile set beyond the query tile set if the number of neighbor objects is less than a target number. Neighbor objects are located within the expanded query radius. It is determined whether a number of neighbor objects within the expanded radius corresponds to a target number. The query radius is expanded and neighbor objects located within the expanded radius until the number of neighbor objects equals or exceeds the target number.

    摘要翻译： 用于定位数据库中查询对象的邻居对象的方法。 定义查询块集合，其包括定义查询对象分组在其中的初始查询半径的多个块。 邻居对象位于初始查询半径内。 确定初始查询半径内的多个邻居对象。 如果邻居对象的数量小于目标数量，则将查询半径扩展到超过初始查询半径的范围，方法是定义扩展查询图块集超过查询图块集。 邻居对象位于扩展查询半径内。 确定扩展半径内的多个邻居对象是否对应于目标数。 扩展的查询半径和扩展半径内的邻居对象，直到邻居对象的数量等于或超过目标数。

    Apparatus for dispensing a flavorable material
    10.
    发明授权
    Apparatus for dispensing a flavorable material 失效
    用于分配可流动材料的装置

    公开(公告)号：US5316195A

    公开(公告)日：1994-05-31

    申请号：US768804

    申请日：1991-09-30

    申请人： Stephen L. Moksnes ,  Jayant Sharma ,  Ronald D. Olson ,  Ronald S. Tump ,  James M. Kocher ,  Terrance J. Pausch

    发明人： Stephen L. Moksnes ,  Jayant Sharma ,  Ronald D. Olson ,  Ronald S. Tump ,  James M. Kocher ,  Terrance J. Pausch

    IPC分类号： G01G13/02 ,  B67D5/62

    CPC分类号： G01G13/026

    摘要： A material feeder for dispensing batches of material which includes a refrigerated enclosure, a material feeder, a feeder drive arrangement, a scale and a controller. The feeder is housed within the refrigerated enclosure, and is removably coupled to the drive arrangement such that the complete feeder arrangement which is exposed to the material (e.g., foodstuffs such as shredded cheese) may be removed from the enclosure for cleaning at a location separate from the enclosure such as a dishwasher. The scale is connected to a container which catches the material dispensed by the feeder and produces a weight signal such is applied to the control unit. The control unit operates the drive unit which rotates a plurality of feed screws in the feeder at two speeds. In particular, the feed screws are driven at a first speed to dispense material at a high rate until a first weight of material is dispensed into the container, and a second speed is used to rotate the feed screws just prior to obtaining the desired weight in the container. This two speed arrangement prevents undesirably overshooting the desired weight for the material to be dispensed in the container. Upon reaching the set point weight, the drive unit is turned off by the control unit.

    摘要翻译： 用于分配材料的材料馈送器，其包括冷藏外壳，材料馈送器，馈送器驱动装置，秤和控制器。 进料器被容纳在冷藏的外壳内，并且可拆卸地联接到驱动装置上，使得暴露于材料（例如，食物如切碎的干酪）的完整进料器装置可以从外壳中移除，以在单独的位置清洁 从外壳如洗碗机。 标尺连接到捕获由馈送器分配的材料的容器，并产生施加到控制单元的重量信号。 控制单元操作驱动单元，其以两个速度旋转进给器中的多个进给螺杆。 特别地，进料螺杆以第一速度被驱动以高速率分配材料，直到材料的第一重量被分配到容器中，并且使用第二速度在刚好获得所需重量之前旋转进料螺杆 容器 这种两速布置防止了不期望地超过待分配在容器中的材料的所需重量。 当达到设定点重量时，驱动单元被控制单元关闭。