String matching algorithms play an important role in computer science. However, there is no uniform mathematical model to describe these algorithms. Thus, read-head-Skippable DFA (SDFA) is put forward, which is an ext...String matching algorithms play an important role in computer science. However, there is no uniform mathematical model to describe these algorithms. Thus, read-head-Skippable DFA (SDFA) is put forward, which is an extension of two-way DFA. It is proved that SDFA is equivalent to DFA. Furthermore, SDFA is a more natural mathematical model for string matching algorithms. After that, four types of the movement of the read head of string matching are analyzed and modeled by SDFA. Finally, the SDFA model of BMA string matching algorithms is given.展开更多
More and more out of core problems that involve solving large amounts of data are researched by scientists. The computational grid provides a wide and scalable environment for those large scale computations. A new met...More and more out of core problems that involve solving large amounts of data are researched by scientists. The computational grid provides a wide and scalable environment for those large scale computations. A new method supporting out of core computations on grids is presented in this paper. The framework and the data storage strategy are described, based on which an easy and efficient out of core programming interface is provided for the programmers.展开更多
基金中国高科技研究与发展项目，the Defence Pre-research Project of the Tenth Five-Year Plan of China
文摘String matching algorithms play an important role in computer science. However, there is no uniform mathematical model to describe these algorithms. Thus, read-head-Skippable DFA (SDFA) is put forward, which is an extension of two-way DFA. It is proved that SDFA is equivalent to DFA. Furthermore, SDFA is a more natural mathematical model for string matching algorithms. After that, four types of the movement of the read head of string matching are analyzed and modeled by SDFA. Finally, the SDFA model of BMA string matching algorithms is given.
文摘More and more out of core problems that involve solving large amounts of data are researched by scientists. The computational grid provides a wide and scalable environment for those large scale computations. A new method supporting out of core computations on grids is presented in this paper. The framework and the data storage strategy are described, based on which an easy and efficient out of core programming interface is provided for the programmers.
