METHOD OF CONTEXT AWARE DATA-CENTRIC STORAGE FOR WIRELESS SENSOR NETWORKS
    1.
    发明申请
    METHOD OF CONTEXT AWARE DATA-CENTRIC STORAGE FOR WIRELESS SENSOR NETWORKS 有权
    无线传感器网络的背景知识数据中心存储方法

    公开(公告)号:US20130159357A1

    公开(公告)日:2013-06-20

    申请号:US13338759

    申请日:2011-12-28

    IPC分类号: G06F17/30 H04W8/00

    CPC分类号: H04W4/38 H04W84/18

    摘要: There is provided a method of context aware data-centric storage for dynamically changing a data storage range comprising: collecting data from entire sensor nodes, after establishing a data storage range of an entire sensor network, dividing areas, and transmitting a message of data storage range information to the entire sensor nodes by a base station; storing the collected data in a storage sensor node by determining whether there is a node responsible for storing the collected data to carry out operation depending on the determination result; determining whether the data storage has not been carried out for a period of time longer than a specified time in each sensor node after storing the data; and to determining whether the scale of invalid range is not smaller than Γ.

    摘要翻译: 提供了一种用于动态改变数据存储范围的上下文感知数据中心存储的方法,包括:在建立整个传感器网络的数据存储范围,分割区域和传送数据存储器的消息之后,从整个传感器节点收集数据 由基站向整个传感器节点提供范围信息; 通过确定是否存在负责存储收集的数据的节点,以根据确定结果来执行操作来将收集的数据存储在存储传感器节点中; 在存储数据之后,确定数据存储器是否在每个传感器节点中比指定时间长的时间段内未被执行; 并确定无效范围是否不小于Gamma。

    Metal oxide coated phosphor for plasma display panel and manufacturing method thereof
    5.
    发明申请
    Metal oxide coated phosphor for plasma display panel and manufacturing method thereof 审中-公开
    用于等离子体显示面板的金属氧化物涂覆的荧光体及其制造方法

    公开(公告)号:US20060210791A1

    公开(公告)日:2006-09-21

    申请号:US10546214

    申请日:2004-02-19

    IPC分类号: B05D7/00 B32B19/00 C09K11/59

    摘要: The present invention relates to a phosphor for a plasma display panel and a method for producing the same. The phosphor is formed by coating a metallic oxide having a high polarity to a surface of a green phosphor Zn2SiO4:Mn with a thickness 10 nm to 0.5 μm. The concentration of a metallic oxide is in a range of 1 to 50 weight % with respect to the green phosphor. According to the green phosphor for the plasma display panel of the present invention, which is made with coating, a metallic oxide having a positive polarity to a surface of a phosphor can be adjusted, thereby enhancing the discharge characteristics when the panel is driven.

    摘要翻译: 等离子体显示面板用荧光体及其制造方法技术领域本发明涉及等离子体显示面板用荧光体及其制造方法。 通过将具有高极性的金属氧化物涂覆到厚度为10nm至0.5μm的绿色荧光体Zn 2 SiO 4·Mn:Mn的表面上来形成荧光体。 金属氧化物的浓度相对于绿色荧光体为1〜50重量%。 根据本发明的等离子体显示面板的绿色荧光体,其通过涂布形成,可以调节与荧光体的表面具有正极性的金属氧化物,从而在驱动面板时提高放电特性。

    Method of context aware data-centric storage for wireless sensor networks
    7.
    发明授权
    Method of context aware data-centric storage for wireless sensor networks 有权
    用于无线传感器网络的上下文感知以数据为中心的存储方法

    公开(公告)号:US08521924B2

    公开(公告)日:2013-08-27

    申请号:US13338759

    申请日:2011-12-28

    IPC分类号: G06F13/00 G06F3/00

    CPC分类号: H04W4/38 H04W84/18

    摘要: There is provided a method of context aware data-centric storage for dynamically changing a data storage range comprising: collecting data from entire sensor nodes, after establishing a data storage range of an entire sensor network, dividing areas, and transmitting a message of data storage range information to the entire sensor nodes by a base station; storing the collected data in a storage sensor node by determining whether there is a node responsible for storing the collected data to carry out operation depending on the determination result; determining whether the data storage has not been carried out for a period of time longer than a specified time in each sensor node after storing the data; and to determining whether the scale of invalid range is not smaller than Γ.

    摘要翻译: 提供了一种用于动态改变数据存储范围的上下文感知数据中心存储的方法,包括:在建立整个传感器网络的数据存储范围,分割区域和传送数据存储器的消息之后,从整个传感器节点收集数据 由基站向整个传感器节点提供范围信息; 通过确定是否存在负责存储收集的数据的节点,以根据确定结果来执行操作来将收集的数据存储在存储传感器节点中; 在存储数据之后,确定数据存储器是否在每个传感器节点中比指定时间长的时间段内未被执行; 并确定无效范围是否不小于Gamma。

    Efficient recovery method for high-dimensional index structure employing reinsert operation
    8.
    发明授权
    Efficient recovery method for high-dimensional index structure employing reinsert operation 有权
    采用重新插入操作的高维索引结构的有效恢复方法

    公开(公告)号:US06631385B2

    公开(公告)日:2003-10-07

    申请号:US09497136

    申请日:2000-02-03

    IPC分类号: G06F1730

    摘要: A recovery method for a high-dimensional index structure is disclosed, in which a reinsert operation is employed based on ARIES (algorithm for recovery and isolation exploiting semantics) and a page-oriented redo and a logical undo. Further, a recording medium on which a program for carrying out the above method is recorded is disclosed, the program being readable by a computer. The recovery method for a high-dimensional index structure employing a reinsert operation according to the present invention includes the following steps. At a first step, an entry is inserted into a node, a minimum bounding region is adjusted, an overflow is processed, and a log record is stored. At a second step, the log record thus stored is recovered.

    摘要翻译: 公开了一种高维度索引结构的恢复方法,其中基于ARIES(用于恢复和隔离开发语义的算法)和面向页面的重做和逻辑撤销来采用重新插入操作。 此外,公开了记录有用于执行上述方法的程序的记录介质,该程序可由计算机读取。 根据本发明的采用重新插入操作的高维索引结构的恢复方法包括以下步骤。 在第一步,将条目插入节点,调整最小边界区域,处理溢出,并存储日志记录。 在第二步,恢复如此存储的日志记录。

    Bulk loading method for a high-dimensional index structure

    公开(公告)号:US06622141B2

    公开(公告)日:2003-09-16

    申请号:US09865362

    申请日:2001-05-25

    IPC分类号: G06F1730

    摘要: A bulk loading method, for use in a high-dimensional index structure using some parts of dimensions based on an unbalanced binarization scheme, accelerates an index construction and improves a search performance. For the purpose, the bulk loading method calculates a topology of the index by recognizing information for the index to be constructed using a given data set, splits the given data set into sub-sets of data by repeatedly performing an establishment of a split strategy and a binarization based on the calculated topology of the index, if a leaf node is derived from the sub-sets of data divided through a top-down recursive split process, reflects a minimum bounding region of the leaf node on a higher node, and, if a non-leaf node is generated, repeatedly performing the above processes for another sub-set of data to thereby produce a final root node.

    Efficient concurrency control method for high dimensional index structures
    10.
    发明授权
    Efficient concurrency control method for high dimensional index structures 有权
    高维度索引结构的高效并发控制方法

    公开(公告)号:US06480849B1

    公开(公告)日:2002-11-12

    申请号:US09409814

    申请日:1999-09-30

    IPC分类号: G06F1730

    摘要: A concurrency control method for a high dimensional index structure that provides efficient concurrency control method for a high dimensional index structure, which performs reinsertion of certain objects to cope with node overflow. The concurrency controlled searching method includes the following steps. First, an entry is obtained from a queue storing the root node and an object relating to the entry is selected. Second, whether a logic sequence number (LSN) of a lower level node is larger than an expected LSN stored in the upper node is determined. Third, the process moves to a neighbor node of the lower level node if the LSN is bigger than an expected LSN stored in the upper node in the second step, selects a relating object, and performs from the second step repeatedly. Fourth, an object of a node of a level corresponding to the lower level node in a reinsertion table is selected when a search on an index tree is finished if the LSN is not bigger than the expected LSN stored in the upper node in the second step.

    摘要翻译: 一种用于高维度索引结构的并发控制方法,为高维度索引结构提供有效的并发控制方法,该方法执行某些对象的重新插入以应对节点溢出。 并发控制搜索方法包括以下步骤。 首先,从存储根节点的队列中获得条目,并且选择与该条目相关的对象。 第二,确定较低级节点的逻辑序列号(LSN)是否大于存储在上级节点中的预期LSN。 第三,如果在第二步中LSN大于存储在上层节点中的预期LSN,则该过程移动到下级节点的邻居节点,选择相关对象,并从第二步重复执行。 第四,当在第二步骤中如果LSN不大于存储在上层节点中的预期LSN的情况下,当索引树上的搜索完成时,选择与重新插入表中的较低级节点相对应的级别的节点的对象 。