关键词： 智能模型   岩土参数   遗传算法  

摘要： 结合数值计算方法与遗传算法,并依靠现代工程岩石勘探侦测技术,可以得到工程岩石的重要参数,再对其进行模型化处理,进而可以得到工程岩石的智能等效模型,通过将这种智能等效模型应用到实际工程勘探中,并将这种理论分析结果与实际检测结果进行对比分析,从而发现两者有较好的对应性。由此可以得出,通过理论分析与计算机模拟所得到的智能等效模型能够很好的推算岩土工程的参数,这就为煤矿井下复杂岩土参数的选择提供了新的方法。

关键词： Levenshtein edit distance   linear representation   Mathematical expression recognition   performance evaluation  

摘要： In this paper, we have addressed the problem of automated performance evaluation of Mathematical Expression (ME) recognition. Automated evaluation requires that recognition output and ground truth in some editable format like [InlineMediaObject not available: see fulltext.], MathML, etc. have to be matched. But standard forms can have extraneous symbols or tags. For example, tag is added for an operator in MathML and \begin{array} is used to encoded matrices in [InlineMediaObject not available: see fulltext.]. These extraneous symbols are also involved in matching that is not intuitive. For that, we have proposed a novel structure encoded string representation that is independent of any editable format. Structure encoded strings retain the structure (spatial relationships like superscript, subscript, etc.) and do not contain any extraneous symbols. As structure encoded strings give the linear representation of MEs, Levenshtein edit distance is used as a measure for performance evaluation. Therefore, in our approach, recognition output and ground truth in [InlineMediaObject not available: see fulltext.] form are converted to their corresponding structure encoded strings and Levenshtein edit distance is computed between them. [ABSTRACT FROM AUTHOR]

关键词： Formalisation of mathematics   computational algebraic topology   program verification  

摘要： The Eilenberg-Zilber algorithm is one of the central components of the computer algebra system called Kenzo, devoted to computing in Algebraic Topology. In this article we report on a complete formal proof of the underlying Eilenberg-Zilber theorem, using the ACL2 theorem prover. As our formalization is executable, we are able to compare the results of the certified programme with those of Kenzo on some universal examples. Since the results coincide, the reliability of Kenzo is reinforced. This is a new step in our long-term project towards certified programming for Algebraic Topology.

关键词： X-ray tomography   SART   AGA   Fluidized bed  

摘要： The performance of two tomographic reconstruction algorithms, Simultaneous Algebraic Reconstruction Technique (SART) and Adaptive Genetic Algorithm (AGA), is evaluated based on synthetic data mimicking X-ray computed tomography of a bubbling fluidized bed. The simulations are based on a high speed X-ray tomography system, consisting of 3 X-ray sources and 32 detectors for each source. The comparison between SARI and AGA is made for image resolutions ranging from 20 x 20 to 50 x 50 pixels, for the cases of 2 phantoms (artificial voids) and 3 phantoms in a 23 cm diameter column. The influence of noise on the reconstructions for both algorithms is also considered. It is found that AGA provides better reconstructions than SART at low resolutions. At high resolutions, the reconstruction quality is comparable, but the calculation times for AGA are much longer. AGA is better at finding the phantom position as it is less sensitive to measurement noise. (C) 2013 Elsevier B.V. All rights reserved.

关键词： function algebra   polynomials over integers   completeness   time and space algorithm complexity  

摘要： The function algebra of first-degree polynomials over ring Z is analysed. The algorithm for completeness recognition in this algebra is described, its time and space complexity are estimated. The algorithm is applied to some other problems: recognition properties of polynomials and completeness of their special sets.

关键词： Parametrizing bimodule   Homogeneous module   Canonical tubular algebra   Universal extension   Derivation   Weighted projective line   Coherent sheaf   Algorithm  

摘要： We give an algorithmic description of matrix bimodules parametrizing all indecomposable homogeneous I >-modules with a fixed slope q over a tubular canonical algebra I >, for all possible slopes q (Main Theorem 3.3). A crucial role in this description is played by universal extensions of bimodules and their nice properties (Theorems 3.1 and 3.2).

关键词： Mathematical expression recognition   performance evaluation   linear representation   Levenshtein edit distance  

摘要： In this paper, we have addressed the problem of automated performance evaluation of Mathematical Expression (ME) recognition. Automated evaluation requires that recognition output and ground truth in some editable format like LATEX, MathML, etc. have to be matched. But standard forms can have extraneous symbols or tags. For example, < mo > tag is added for an operator in MathML and \begin{array} is used to encoded matrices in LATEX. These extraneous symbols are also involved in matching that is not intuitive. For that, we have proposed a novel structure encoded string representation that is independent of any editable format. Structure encoded strings retain the structure (spatial relationships like superscript, subscript, etc.) and do not contain any extraneous symbols. As structure encoded strings give the linear representation of MEs, Levenshtein edit distance is used as a measure for performance evaluation. Therefore, in our approach, recognition output and ground truth in LATEX form are converted to their corresponding structure encoded strings and Levenshtein edit distance is computed between them.

关键词： QUANTUM theory   SPECTRUM analysis   QUBITS   MATHEMATICAL analysis   SCALING laws (Statistical physics)   ALGORITHMS  

摘要： When a probe qubit is coupled to a quantum register that represents a physical system, the probe qubit will exhibit a dynamical response only when it is resonant with a transition in the system. Using this principle, we propose a quantum algorithm for solving discrete mathematical problems based on the circuit model. Our algorithm has favorable scaling properties in solving some discrete mathematical problems.

关键词： 三维分组   切片变换   收缩函数   纹理图像   去噪算法  

摘要： 图像去噪可以被描述为从一幅被噪声污染过的图像到一幅清晰图像的映射过程，图像去噪中一个重要的挑战就是如何在保留良好的纹理结构的同时去除噪声。然而众多优秀的图像去噪算法，针对于像树皮和砖瓦这样的具有随机结构特点的纹理图像，经常会过度平滑纹理细节部分。本文致力于找到一个尽可能完美的映射模型来还原出真实图像，通过改进当前最先进的BM3D算法和对三维小波系数的多频带收缩函数学习的方法，得到一系列映射模型，利用这些映射模型对其他噪声图像进行去噪。本文算法主要分为两个阶段，第一个阶段是线下学习，即在少量的训练图片集上利用相似块匹配算法将小波域图像块“堆砌”为三维图像分组，然后划分频带并学习出收缩函数映射模型;第二个阶段则是完整去噪，即应用收缩函数将噪声图像的三维小波系数映射为新的估计值。新的三维分组中的图像块需要恢复到原来的图像位置，由于这些块是重叠的，因此每个像素都会得到多次估计值，利用带权值的聚合算法得到基本去噪图像，最后再在基本去噪图像的基础上进行一次协作维纳滤波得到最终去噪图像。本文的实验结果建立在麻省理工学院纹理图像数据集上，使用MEX混合编程技术，与BM3D算法和GHP算法比较而言，在改善了峰值信噪比和结构相似度等经典评价指标的同时，也保证了良好的计算效率。