在本系列文章的前几部分,我们已经了解在Delphi程序中利用SQL Server 2000 XML特性的数据查询技术。我们也研究了如何在Delphi数据敏感控件中使用XML数据源。作为系列文章的最后一部分,我们将探讨有关利用SQL ServerXML特性进行数据插...在本系列文章的前几部分,我们已经了解在Delphi程序中利用SQL Server 2000 XML特性的数据查询技术。我们也研究了如何在Delphi数据敏感控件中使用XML数据源。作为系列文章的最后一部分,我们将探讨有关利用SQL ServerXML特性进行数据插入、更新、删除的话题。展开更多
This paper proposes a fast initial construction method of the GBD-tree. The GDB tree has proper characteristics for management of large amount of 2 or 3 dimensional data. However, the GBD-tree needs long initial const...This paper proposes a fast initial construction method of the GBD-tree. The GDB tree has proper characteristics for management of large amount of 2 or 3 dimensional data. However, the GBD-tree needs long initial construction time by originally proposed one-by-one insertion method. A fast insertion method has been proposed, but it needs large size of buffer capable to hold index information of all entries. The paper proposes another fast initial construction method. The method requires only limited size of work space (buffer). The experimental results show the initial construction time reduces into a third or a quarter of the one-by-one insertion method. The memory efficiency and retrieval efficiency are also improved than the one-by-one insertion method.展开更多
公司名称:北京迈至科网络技术处理有限责任公司 主页地址:www.magicw3.com 更新频率:每日 维护人员数量:8人 开通时间:1996年3月 WWW服务器的硬、软件配置:双pentiuum pro CPU服务器 Windows NT 4.0 IIS 3.0 信息来源及权威性:由本公司...公司名称:北京迈至科网络技术处理有限责任公司 主页地址:www.magicw3.com 更新频率:每日 维护人员数量:8人 开通时间:1996年3月 WWW服务器的硬、软件配置:双pentiuum pro CPU服务器 Windows NT 4.0 IIS 3.0 信息来源及权威性:由本公司自己提供 注:由于涉及公司机密,站点访问率暂不公布。展开更多
A more recent branch of natural computing is DNA computing. At the theoretical level, DNA computing is powerful. This is due to the fact that DNA structure and processing suggest a series of new data structures and op...A more recent branch of natural computing is DNA computing. At the theoretical level, DNA computing is powerful. This is due to the fact that DNA structure and processing suggest a series of new data structures and operations, and to the fact of the massive parallelism. The insertion-deletion system （insdel system） is a DNA computing model based on two genetic operations： insertion and deletion which, working together, are very powerful, leading to characterizations of recursively enumerable lan- guages. When designing an insdel computer, it is natural to try to keep the underlying model as simple as possible. One idea is to use either only insertion operations or only deletion operations. By helping with a weak coding and a morphism, the family INS4^7DEL0^0 is equal to the family of recursively enumerable languages. It is an open problem proposed by Martin-Vide et al. on whether or not the parameters 4 and 7 appearing here can be replaced by smaller numbers. In this paper, our positive answer to this question is that INS2^4DEL0^0 can also play the same role as insertion and deletion. We suppose that the INS2^4DEL0^0 may be the least only-insertion insdel system in this situation. We will give some reasons supporting this conjecture in our paper.展开更多
文摘This paper proposes a fast initial construction method of the GBD-tree. The GDB tree has proper characteristics for management of large amount of 2 or 3 dimensional data. However, the GBD-tree needs long initial construction time by originally proposed one-by-one insertion method. A fast insertion method has been proposed, but it needs large size of buffer capable to hold index information of all entries. The paper proposes another fast initial construction method. The method requires only limited size of work space (buffer). The experimental results show the initial construction time reduces into a third or a quarter of the one-by-one insertion method. The memory efficiency and retrieval efficiency are also improved than the one-by-one insertion method.
文摘公司名称:北京迈至科网络技术处理有限责任公司 主页地址:www.magicw3.com 更新频率:每日 维护人员数量:8人 开通时间:1996年3月 WWW服务器的硬、软件配置:双pentiuum pro CPU服务器 Windows NT 4.0 IIS 3.0 信息来源及权威性:由本公司自己提供 注:由于涉及公司机密,站点访问率暂不公布。
文摘A more recent branch of natural computing is DNA computing. At the theoretical level, DNA computing is powerful. This is due to the fact that DNA structure and processing suggest a series of new data structures and operations, and to the fact of the massive parallelism. The insertion-deletion system （insdel system） is a DNA computing model based on two genetic operations： insertion and deletion which, working together, are very powerful, leading to characterizations of recursively enumerable lan- guages. When designing an insdel computer, it is natural to try to keep the underlying model as simple as possible. One idea is to use either only insertion operations or only deletion operations. By helping with a weak coding and a morphism, the family INS4^7DEL0^0 is equal to the family of recursively enumerable languages. It is an open problem proposed by Martin-Vide et al. on whether or not the parameters 4 and 7 appearing here can be replaced by smaller numbers. In this paper, our positive answer to this question is that INS2^4DEL0^0 can also play the same role as insertion and deletion. We suppose that the INS2^4DEL0^0 may be the least only-insertion insdel system in this situation. We will give some reasons supporting this conjecture in our paper.
