CuO-based materials for thermochemical redox cycles: the influence of the formation of a CuO percolation network on oxygen release and oxidation kinetics.

CuO-based materials for thermochemical redox cycles: the influence of the formation of a CuO percolation network on oxygen release and oxidation kinetics.
复制标题

用于热化学氧化还原循环的 CuO 基材料:CuO 渗滤网络的形成对氧释放和氧化动力学的影响。

DOI:
10.1007/978-3-319-46049-9_13
复制
发表时间:
2022
期刊:
Discover chemical engineering
影响因子:
--
通讯作者:
Imtiaz Q
Imtiaz Q
中科院分区:
--
文献类型:
--
作者:
Imtiaz Q

文献摘要

相似文献

我们认为,动态和在线的2D模式之间的模式匹配的变体anpattern和antext。我们给出的所有算法都是随机的,并且至少以恒定的概率给出正确的输出。对于更新改变文本中单个符号的动态二维精确匹配,我们证明了更新可以及时执行,查询可以及时执行。然后我们考虑了一个模型,其中更新是一个新的二维模式,查询是文本中的一个位置。对于这种设置,我们表明可以及时回答海明距离查询,其中He是相关的海明距离。将这项工作扩展到允许近似,我们给出了一个高效的算法,该算法可以及时返回给定位置的海明距离的近似值。最后,我们考虑一个不同的设置,其灵感来自于之前关于局部敏感哈希(LSH)的工作。给定一个阈值k,在建立二维文本索引和接收二维查询模式后,只要存在一个汉明距离最大的位置,就必须输出一个汉明距离最大的位置。对于LSH启发的二维索引问题,文本可以及时预处理成大小随查询时间变化的数据结构。
We consider dynamic and online variants of 2D pattern matching between anpattern and antext. All the algorithms we give are randomised and give correct outputs with at least constant probability.For dynamic 2D exact matching where updates change individual symbols in the text, we show updates can be performed intime and queries intime.We then consider a model where an update is a new 2D pattern and a query is a location in the text. For this setting we show that Hamming distance queries can be answered intime, whereHis the relevant Hamming distance.Extending this work to allow approximation, we give an efficient algorithm which returns aapproximation of the Hamming distance at a given location intime.Finally, we consider a different setting inspired by previous work on locality sensitive hashing (LSH). Given a thresholdkand after building the 2D text index and receiving a 2D query pattern, we must output a location where the Hamming distance is at mostas long as there exists a location where the Hamming distance is at mostk.For our LSH inspired 2D indexing problem, the text can be preprocessed intime into a data structure of sizewith query time.