Catalyzed decomposing foam for encapsulating space-based kinetic objects
    1.
    发明授权
    Catalyzed decomposing foam for encapsulating space-based kinetic objects 有权
    催化分解泡沫用于封装基于空间的动力学物体

    公开(公告)号:US07506841B2

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

    申请号:US10969724

    申请日:2004-10-20

    IPC分类号: B64G1/36

    摘要: A high energy, e.g., ultraviolet (UV) catalyzed decomposing foam encapsulating kinetic media forms a payload to be boosted in space and provides an ultra-light weight means for intercepting an incoming missile or other target. The decomposed foam releases the kinetic media (at designed rates so as to preserve a required density of media on target) to intercept a target and destroy it. The use of the decomposing foam significantly lowers the weight and cost and improves the probability of success of destroying the target.

    摘要翻译: 包含动能介质的高能量例如紫外线(UV)催化的分解泡沫形成有效载荷以在空间中增强,并提供用于拦截进入的导弹或其它目标的超轻重量装置。 分解的泡沫释放动力介质(以设计的速率,以便在目标上保持所需的介质密度)来拦截目标并将其破坏。 分解泡沫的使用显着降低了重量和成本,并提高了破坏目标的成功概率。

    Method for reducing packet data delay variation in an internet protocol network
    2.
    发明授权
    Method for reducing packet data delay variation in an internet protocol network 有权
    一种用于减少因特网协议网络中的分组数据延迟变化的方法

    公开(公告)号:US06765905B2

    公开(公告)日:2004-07-20

    申请号:US10124948

    申请日:2002-04-18

    IPC分类号: H04L1228

    CPC分类号: H04L47/2458

    摘要: Network nodes (10, 15, 20, 25, 30 40) of a communication network (100) determine whether the queue position (56, 57) of a data packet (60) exceeds a threshold (55). Data packets which are placed in a queue that has a depth greater than the threshold, and therefore will experience increased delay at this node, are remarked to a higher priority for expedited handling at the next hop. The next hop network node which handles that data packet will put it in a higher priority queue (51) such that it will experience less delay at the that node. In this way, a negative correlation in node-to-node delay is achieved and overall delay variation is reduced.

    摘要翻译: 通信网络(100)的网络节点(10,15,20,25,30,40)确定数据分组(60)的队列位置(56,​​57)是否超过阈值(55)。 放置在队列中的深度大于阈值并且因此将在该节点处经历增加的延迟的数据分组被标记为更高的优先级,以在下一跳处加速处理。 处理该数据包的下一跳网络节点将其置于较高优先级队列(51)中,以使其在该节点处经历更少的延迟。 以这种方式,实现节点到节点延迟的负相关,并且减小总体延迟变化。