Compressing location data of moving objects
    233.
    发明授权
    Compressing location data of moving objects 失效
    压缩移动物体的位置数据

    公开(公告)号:US06983205B2

    公开(公告)日:2006-01-03

    申请号:US10729225

    申请日:2003-12-05

    CPC classification number: H03M7/30 Y10S707/99942

    Abstract: Provides methods, apparatus and system for compressing a large number of continuous location data of moving objects. A large number of continuous location data of moving objects sent from a mobile unit or a locating device are received, these location data are compressed and inserted the compressed location data into a database, so as to solve the problem that the data can not work under a high insertion frequency, and reduce the storage space of continuous locations while maintaining certain location query precision. An example apparatus for compressing the location data of moving objects, comprises: input interface for receiving current location data of a moving continuously; data compressing unit for compressing the location data received via said input interface; and output interface for outputting compressed location data of the moving object.

    Abstract translation: 提供用于压缩移动物体的大量连续位置数据的方法,装置和系统。 接收到从移动单元或定位设备发送的大量运动对象的连续位置数据,将这些位置数据进行压缩,并将压缩的位置数据插入到数据库中,以解决数据不能正常工作的问题 插入频率高,并且在保持一定的位置查询精度的同时减少连续位置的存储空间。 用于压缩移动物体的位置数据的示例性装置包括:用于接收连续移动的当前位置数据的输入接口; 数据压缩单元,用于压缩经由所述输入接口接收的位置数据; 以及用于输出移动物体的压缩位置数据的输出接口。

    Minimizing resynchronization time after backup system failures in an appliance-based business continuance architecture
    234.
    发明申请
    Minimizing resynchronization time after backup system failures in an appliance-based business continuance architecture 有权
    在基于设备的业务连续性体系结构中,在备份系统故障后最大限度地减少重新同步时间

    公开(公告)号:US20050273654A1

    公开(公告)日:2005-12-08

    申请号:US10834502

    申请日:2004-04-28

    CPC classification number: G06F11/2082 G06F11/1471 G06F11/2074

    Abstract: A system for minimizing downtime in an appliance-based business continuance architecture is provided. The system includes at least one primary data storage and least one primary host machine. The system includes an intercept agent to intercept primary host machine data requests, and to collect information associated with the intercepted data requests. Moreover, at least one business continuance appliance in communication with the primary host machine and in communication with a remote backup site is provided. The appliance receives information associated with the intercepted data requests from the intercept agent. In addition, a local cache is included within the business continuance appliance. The local cache maintains copies of primary data storage according to the information received. Furthermore, the remote site is provided with the intercepted data requests via the business continuance appliance, wherein the remote site maintains a backup of the primary data storage.

    Abstract translation: 提供了一种用于最小化基于设备的业务连续性架构中的停机时间的系统。 该系统包括至少一个主数据存储和至少一个主要主机。 该系统包括截取主机数据请求的拦截代理,并收集与拦截的数据请求相关的信息。 此外,提供了与主主机通信并与远程备份站点通信的至少一个业务连续性设备。 设备从拦截代理接收与拦截的数据请求相关联的信息。 此外,本地缓存包含在业务连续设备中。 本地缓存根据收到的信息维护主数据存储的副本。 此外,通过业务连续性设备向远程站点提供截获的数据请求,其中远程站点维护主数据存储的备份。

    Simultaneous optimal auctions using augmented lagrangian and surrogate optimization
    235.
    发明申请
    Simultaneous optimal auctions using augmented lagrangian and surrogate optimization 失效
    使用增强拉格朗日和替代优化的同时最佳拍卖

    公开(公告)号:US20050137959A1

    公开(公告)日:2005-06-23

    申请号:US10746970

    申请日:2003-12-23

    CPC classification number: G06Q30/08 G06Q20/102 G06Q40/00 G06Q40/04

    Abstract: A method for determining a market clearing price in an electricity market, subject to a plurality of constraints, comprising the steps of defining an objective function relating the MCP and constraints in terms of a nonlinear programming expression, applying Lagrangian relaxation to the nonlinear programming expression to form a Lagrangian dual function; adding penalty terms to the Lagrangian dual function to form an augmented Lagrangian dual function; resolving the augmented Lagrangian dual function using a surrogate optimization framework comprising repeating, until stopping criteria are satisfied, the steps of forming one or more supply sub-problems and an MCP sub-problem; optimizing the MCP sub-problem while keeping all other variables at their latest available values; optimizing at least one of the one or more supply sub-problems while keeping all other variables at their latest available values; updating multipliers used to relax constraints; determining the MCP in accordance with the resolved augmented Lagrangian dual function; and paying for electricity at the MCP. A system is also provided.

    Abstract translation: 一种用于确定电力市场中的市场清算价格的方法,其受到多个约束,包括以下步骤:根据非线性程序设计表达式定义与MCP和约束相关的目标函数,将拉格朗日松弛应用于非线性规划表达式 形成拉格朗日双重功能; 对拉格朗日双重功能增加惩罚条件,形成增强拉格朗日双重功能; 使用代理优化框架来解决增强的拉格朗日双重功能,包括重复直到停止标准满足形成一个或多个供应子问题和MCP子问题的步骤; 优化MCP子问题,同时将所有其他变量保留在其最新可用值; 优化所述一个或多个供应子问题中的至少一个,同时将所有其它变量保持在其最新可用值; 更新用于放宽约束的乘数; 根据分辨的增强拉格朗日双重功能确定MCP; 并在MCP支付电费。 还提供了一个系统。

    System and method for reducing data loss in disk arrays by establishing data redundancy on demand
    236.
    发明申请
    System and method for reducing data loss in disk arrays by establishing data redundancy on demand 审中-公开
    通过根据需要建立数据冗余来减少磁盘阵列数据丢失的系统和方法

    公开(公告)号:US20050091452A1

    公开(公告)日:2005-04-28

    申请号:US10695475

    申请日:2003-10-28

    CPC classification number: G06F11/1076 G06F2211/1054

    Abstract: Disclosed is a system and method for reducing data loss in a disk array comprising computing redundant data of the user data in the disk array, periodically storing the computed redundant data into data blocks located on at least one disk; monitoring the disks for a number of concurrent actual and predicted disk failures to occur; determining which portions of the redundant data have been altered since an immediate previous time the redundant data was stored; re-computing altered portions of the redundant data and updating the corresponding data blocks when said number of concurrent disk failures occur and less than a fraction of the redundant data has been altered, reconstructing data stored on a failed disk onto at least one replacement disk; and marking the recomputed redundant data in a directory, wherein the disk array comprises one of the standard RAID arrays.

    Abstract translation: 公开了一种用于减少磁盘阵列中的数据丢失的系统和方法,包括:计算磁盘阵列中用户数据的冗余数据,周期性地将计算出的冗余数据存储到位于至少一个磁盘上的数据块中; 监视磁盘发生若干并发实际和预测的磁盘故障; 确定冗余数据的哪些部分自从紧接在上一次存储冗余数据之后被改变; 重新计算所述冗余数据的改变部分,并且当所述并发磁盘故障数量发生并且少于所述冗余数据的一部分已被改变时,更新相应的数据块,将存储在故障盘上的数据重建到至少一个替换盘上; 以及在目录中标记重新计算的冗余数据,其中所述磁盘阵列包括所述标准RAID阵列之一。

    Rear and front clearance light system for a vehicle
    237.
    发明申请
    Rear and front clearance light system for a vehicle 审中-公开
    车辆前后间隙系统

    公开(公告)号:US20050073397A1

    公开(公告)日:2005-04-07

    申请号:US10678895

    申请日:2003-10-03

    CPC classification number: B60Q1/48

    Abstract: The current invention gives novel methods for a driver to determine the vehicle extremity clearance. Two types of methods are disclosed: the blockage and the equidistance types. In the blockage type, the rear or front clearance is determined by observing the ground patterns projected by the light beams of which the paths extend beyond the vehicle's extremity. Should the vehicle approach too closely to an object, the light paths are blocked by the object so that the projected ground patterns disappear and thus the driver is alerted. In the equidistance type, an angle rule is disclosed. According to the rule, the distance between the two patterns projected by the divergent light beams on the object is made to be the same as the distance between the vehicle and the object. Therefore, a driver knows the vehicle extremity safety distance simply by estimating the distance between the two projected patterns.

    Abstract translation: 本发明给出驾驶员确定车辆末端间隙的新颖方法。 公开了两种类型的方法:阻塞和等距类型。 在阻塞型中,通过观察由路径延伸超过车辆末端的光束投射的接地图来确定后部或前部间隙。 如果车辆接近物体的距离太近,则光路被物体阻挡,使得投影的地面图案消失,从而警告驾驶员。 在等距类型中,公开了角度规则。 根据规则,使物体上的发散光束投影的两个图案之间的距离与车辆与物体之间的距离相同。 因此,驾驶员通过估计两个投影图案之间的距离,就可以知道车辆的末端安全距离。

    Preparing somatic embryo by utilizing rabbit oocyte
    238.
    发明申请
    Preparing somatic embryo by utilizing rabbit oocyte 审中-公开
    用兔卵母细胞制备体细胞胚

    公开(公告)号:US20050066379A1

    公开(公告)日:2005-03-24

    申请号:US10494075

    申请日:2001-11-06

    CPC classification number: C12N15/8777 A01K2227/107

    Abstract: The present invention discloses a method for preparing nuclear transfer units (nt-units, which can be also referred to as somatic embryos), which comprises transplanting mammalian cells or cell nuclei into enucleate oocytes of a species different from the nuclear donor, preferably enucleated rabbit oocytes, so as to form nuclear transfer units, and developing such nuclear transfer units to various pre-implantation stages under suitable conditions; as well as the uses of the nt-units obtained by this method.

    Abstract translation: 本发明公开了一种制备核转移单位(也称为体细胞胚的nt单位)的方法,其包括将哺乳动物细胞或细胞核移植到与核供体不同的物种的去核卵母细胞中,优选去核的兔 卵母细胞,以便形成核转移单元,并在合适的条件下将这些核转移单元开发到各种预植入阶段; 以及通过该方法获得的nt单位的用途。

    Method and apparatus for improving write performance in a cluster-based file system
    239.
    发明授权
    Method and apparatus for improving write performance in a cluster-based file system 失效
    用于提高基于群集的文件系统中的写入性能的方法和装置

    公开(公告)号:US06675264B2

    公开(公告)日:2004-01-06

    申请号:US09851014

    申请日:2001-05-07

    CPC classification number: G06F12/0866 G06F12/0813 G06F12/0817 G06F2212/284

    Abstract: A method of writing to cache in a clustered environment. A first node in a storage cluster receives a request to write data from a user application. The first node determines if the data is owned by a remote node. If the data is owned by a remote node, the data in the remote node may be invalidated, if necessary. Such invalidation may not be necessary if a global cache directory is utilized. Thereafter, the data is written in a cache of the first node. Additionally, the data is written in a cache of a partner node of the first node. Confirmation of the cache write in the partner node is then received in the first node.

    Abstract translation: 在集群环境中写入缓存的方法。 存储集群中的第一个节点接收到从用户应用程序写入数据的请求。 第一个节点确定数据是否由远程节点拥有。 如果数据由远程节点拥有,则必要时远程节点中的数据可能无效。 如果使用全局缓存目录,则无效。 此后,将数据写入第一节点的高速缓存。 此外,数据被写入第一节点的伙伴节点的高速缓存中。 然后在第一个节点中接收对伙伴节点中缓存写入的确认。

Patent Agency Ranking