A 3D discrete FEM iterative algorithm for solving the water pipe cooling problems of massive

合集下载

a转换成膜a算法

a转换成膜a算法

a转换成膜a算法As technology continues to advance at a rapid pace, it is crucial for algorithms to evolve and adapt accordingly. One algorithm that has garnered significant attention in recent years is the "a to b" algorithm. This algorithm, which aims to convert 'a' into 'b', is essential for various applications in data processing and analysis.随着技术的快速发展,算法需要不断演变和适应。

最近几年受到广泛关注的一种算法是“a转换成b”算法。

这种算法旨在将'a'转换为'b',在数据处理和分析等各种应用中起着关键作用。

One of the primary requirements for the "a to b" algorithm is efficiency. The algorithm should be able to convert 'a' into 'b' quickly and accurately, without compromising the quality of the output. This efficiency is essential for applications where real-time processing and response are crucial.“a转换成b”算法的主要要求之一是效率。

尺度不变特征变换算法

尺度不变特征变换算法

尺度不变特征变换算法一、前言尺度不变特征变换算法(Scale-Invariant Feature Transform,SIFT)是一种用于图像处理和计算机视觉的算法,由David Lowe于1999年提出。

SIFT算法可以在不同尺度和旋转下找到图像中的关键点,并提取出这些关键点的局部特征描述符,从而实现对图像的匹配、识别等任务。

二、SIFT算法原理1. 尺度空间构建SIFT算法首先通过高斯滤波器构建尺度空间,以便在不同尺度下检测图像中的关键点。

高斯滤波器可以模拟人眼对图像的模糊效果,使得在不同尺度下能够检测到具有相似形状但大小不同的物体。

2. 关键点检测在构建好尺度空间后,SIFT算法通过DoG(差分高斯)金字塔来寻找关键点。

DoG金字塔是由相邻两层高斯金字塔之差得到的,它可以有效地检测出具有不同尺度和方向的局部极值点。

3. 方向分配为了使得特征描述子具有旋转不变性,在确定关键点位置后,SIFT算法还需要计算每个关键点的主方向。

它通过计算关键点周围像素的梯度方向直方图来确定主方向,从而使得特征描述子能够在不同角度下进行匹配。

4. 特征描述在确定了关键点位置和主方向之后,SIFT算法通过计算关键点周围像素的梯度幅值和方向来生成特征描述子。

这个过程中,SIFT算法使用了一个16×16的窗口,并将其分成4×4个小窗口,在每个小窗口中计算8个梯度方向的直方图,最终生成一个128维的特征向量。

5. 特征匹配在提取出两幅图像中所有关键点的特征描述子后,SIFT算法采用欧氏距离来计算两个特征向量之间的相似度,并使用比率测试来判断是否为匹配点。

如果两个特征向量之间的距离小于一定阈值,并且与次近邻之间距离比例大于一定比例,则认为是匹配点。

三、SIFT算法优缺点1. 优点:(1)尺度不变性:SIFT算法可以在不同尺度下检测到具有相似形状但大小不同的物体;(2)旋转不变性:SIFT算法可以计算每个关键点的主方向,从而使得特征描述子能够在不同角度下进行匹配;(3)鲁棒性:SIFT算法对于光照、视角、噪声等因素有较好的鲁棒性。

3D脑肿瘤分割的Dice损失函数的优化

3D脑肿瘤分割的Dice损失函数的优化

专 论FEATURES3D脑肿瘤分割的Dice损失函数的优化刘昊,王冠华,章强,李雨泽,陈慧军清华大学医学院生物医学工程系,北京 100084[摘 要] 脑肿瘤的精确诊断对于提高病人的生存率,提供积极有效的治疗方案有着重要的意义。

磁共振(MR)影像检查可提供脑肿瘤诊断结果并增加脑肿瘤诊断率,而精确分割三维脑肿瘤MR图像对于脑肿瘤的诊断,治疗以及术后追踪都有着非常重要的意义。

本文针对在三维MR图像上的脑肿瘤分割问题,提出了直接优化评价指标的新损失函数的深度神经网络算法,可直接优化全肿瘤区,肿瘤核心区和增强肿瘤区这三个重要临床所需的分割目标的Sorensen Dice系数。

最终测试集在全肿瘤区、肿瘤核心区和增强肿瘤区这三个目标区域的平均Sorensen Dice系数分别达到:0.875、0.829、0.695,全面优于传统的交叉熵损失函数,为脑肿瘤的精确分割提供了新的自动工具。

[关键词] 脑肿瘤分割;磁共振图像;损失函数;深度学习;多对比度Optimization of Dice Loss Function for 3D Brain Tumor SegmentationLIU Hao, WANG Guanhua, ZHANG Qiang, LI Yuze, CHEN HuijunCollege of Biomedical Engineer, School of Medical, Tsinghua University, Beijing 100084, ChinaAbstract: Precise diagnosis of brain tumors has important significance for improving the survival rate of patients and providing positive and effective treatment. Magnetic resonance (MR) imaging can provide the diagnosis of brain tumors and increase the rate of diagnosis of brain tumor. Accurate segmentation of 3D brain tumor MR images is of great significance for the diagnosis, treatment and postoperative tracking of brain tumors. In this paper, based on the brain tumor segmentation on 3D MR images, a deep neural network algorithm for directly optimizing the evaluation index’s (Sorensen Dice coefficient) new loss function was proposed, which could directly optimize the three important clinical requirements: whole tumor area, tumor core area and enhanced tumor area. The average Sorensen Dice coefficients of the final test set in the three target regions of the whole tumor area, the tumor core area, and the enhanced tumor area were 0.875, 0.829, and 0.695, respectively, which were better than the traditional cross entropy loss function. It provides new automated tools for the accurate segmentation of brain tumors.Key words: brain tumor segmentation; magnetic resonance image; loss function; deep learning; multi-contrast[中图分类号]TP391.41 [文献标识码] Adoi:10.3969/j.issn.1674-1633.2019.05.005 [文章编号] 1674-1633(2019)05-0020-04引言脑肿瘤是致命的疾病之一,全球每年发生原发性脑瘤的人数约为250000人,而脑瘤平均五年存活率为33%[1]。

一种用于三维重建的彩色Sift准稠密匹配算法

一种用于三维重建的彩色Sift准稠密匹配算法

Q ai e s t igb sdo oo i l rh fr eo s u t n u s— nema hn ae nc l Sf a oi m D rc nt ci d c r t g t o3 r o
Z HAO L —u ,GEN G o h a ul G u — u ,Z HOU Mi g q a n —u n ' ,W AN Xi of n G a — g e
第2 9卷 第 9期
2 in Re e r h o mp t  ̄ p l t s a c fCo u e c o
Vo . 9 No 9 12 . S p. 01 e 2 2

种 用 于 三 维 重 建 的 彩 色 Sf准 稠 密 匹 配 算 法 水 i t
B ln om lU i rt, ei 0 85,C ia e gN r a nv sy B in 10 7 i t e i jg hn )
A b t a t Th spa rp o os d aqu s— ns thig a g rt ba e n t e Kub l a M u k t e r o nc lb ae ma e , sr c : i pe r p e a ide e mac n lo hm s d o h i e k — n h o yf ru a ir td i g s i o rbu e o mo e a c ae 3 r c nsr t n. c us i lo i tc nti t d t r c ur t D e o tuci Be a e S f ag rt o t hm s ls a bl fma c n rc l ri g s u de wa e s c pa e o thig f o o ma e n r o

集成梯度特征归属方法-概述说明以及解释

集成梯度特征归属方法-概述说明以及解释

集成梯度特征归属方法-概述说明以及解释1.引言1.1 概述在概述部分,你可以从以下角度来描述集成梯度特征归属方法的背景和重要性:集成梯度特征归属方法是一种用于分析和解释机器学习模型预测结果的技术。

随着机器学习的快速发展和广泛应用,对于模型的解释性需求也越来越高。

传统的机器学习模型通常被认为是“黑盒子”,即无法解释模型做出预测的原因。

这限制了模型在一些关键应用领域的应用,如金融风险评估、医疗诊断和自动驾驶等。

为了解决这个问题,研究人员提出了各种机器学习模型的解释方法,其中集成梯度特征归属方法是一种非常受关注和有效的技术。

集成梯度特征归属方法能够为机器学习模型的预测结果提供可解释的解释,从而揭示模型对于不同特征的关注程度和影响力。

通过分析模型中每个特征的梯度值,可以确定该特征在预测中扮演的角色和贡献度,从而帮助用户理解模型的决策过程。

这对于模型的评估、优化和改进具有重要意义。

集成梯度特征归属方法的应用广泛,不仅适用于传统的机器学习模型,如决策树、支持向量机和逻辑回归等,也可以应用于深度学习模型,如神经网络和卷积神经网络等。

它能够为各种类型的特征,包括数值型特征和类别型特征,提供有益的信息和解释。

本文将对集成梯度特征归属方法的原理、应用优势和未来发展进行详细阐述,旨在为读者提供全面的了解和使用指南。

在接下来的章节中,我们将首先介绍集成梯度特征归属方法的基本原理和算法,然后探讨应用该方法的优势和实际应用场景。

最后,我们将总结该方法的重要性,并展望未来该方法的发展前景。

1.2文章结构文章结构内容应包括以下内容:文章的结构部分主要是对整篇文章的框架进行概述,指导读者在阅读过程中能够清晰地了解文章的组织结构和内容安排。

第一部分是引言,介绍了整篇文章的背景和意义。

其中,1.1小节概述文章所要讨论的主题,简要介绍了集成梯度特征归属方法的基本概念和应用领域。

1.2小节重点在于介绍文章的结构,将列出本文各个部分的标题和内容概要,方便读者快速了解文章的大致内容。

纹理物体缺陷的视觉检测算法研究--优秀毕业论文

纹理物体缺陷的视觉检测算法研究--优秀毕业论文

摘 要
在竞争激烈的工业自动化生产过程中,机器视觉对产品质量的把关起着举足 轻重的作用,机器视觉在缺陷检测技术方面的应用也逐渐普遍起来。与常规的检 测技术相比,自动化的视觉检测系统更加经济、快捷、高效与 安全。纹理物体在 工业生产中广泛存在,像用于半导体装配和封装底板和发光二极管,现代 化电子 系统中的印制电路板,以及纺织行业中的布匹和织物等都可认为是含有纹理特征 的物体。本论文主要致力于纹理物体的缺陷检测技术研究,为纹理物体的自动化 检测提供高效而可靠的检测算法。 纹理是描述图像内容的重要特征,纹理分析也已经被成功的应用与纹理分割 和纹理分类当中。本研究提出了一种基于纹理分析技术和参考比较方式的缺陷检 测算法。这种算法能容忍物体变形引起的图像配准误差,对纹理的影响也具有鲁 棒性。本算法旨在为检测出的缺陷区域提供丰富而重要的物理意义,如缺陷区域 的大小、形状、亮度对比度及空间分布等。同时,在参考图像可行的情况下,本 算法可用于同质纹理物体和非同质纹理物体的检测,对非纹理物体 的检测也可取 得不错的效果。 在整个检测过程中,我们采用了可调控金字塔的纹理分析和重构技术。与传 统的小波纹理分析技术不同,我们在小波域中加入处理物体变形和纹理影响的容 忍度控制算法,来实现容忍物体变形和对纹理影响鲁棒的目的。最后可调控金字 塔的重构保证了缺陷区域物理意义恢复的准确性。实验阶段,我们检测了一系列 具有实际应用价值的图像。实验结果表明 本文提出的纹理物体缺陷检测算法具有 高效性和易于实现性。 关键字: 缺陷检测;纹理;物体变形;可调控金字塔;重构
Keywords: defect detection, texture, object distortion, steerable pyramid, reconstruction
II

mfista算法

mfista算法

mfista算法MFISTA算法(Multifrontal Iterative Shrinkage-Thresholding Algorithm)是一种用于求解稀疏表示问题的迭代优化算法。

它在L1范数正则化的框架下,能够高效地求解具有稀疏性的信号重构问题。

稀疏表示问题是指在给定一组基函数的情况下,通过寻找最少的基函数线性组合来表示一个信号。

这个问题在信号处理、图像处理、机器学习等领域都有广泛的应用。

MFISTA算法的目标就是通过迭代的方式,找到一个最优的稀疏表示。

MFISTA算法的核心思想是通过将稀疏表示问题转化为一个优化问题,并采用了迭代收缩阈值的方式进行求解。

算法的具体步骤如下:1. 初始化:给定信号和基函数,初始化稀疏表示的值。

2. 迭代更新:通过迭代的方式不断更新稀疏表示的值,直至收敛。

在每一次迭代中,首先计算梯度,然后根据梯度信息进行更新。

3. 收缩阈值:在更新稀疏表示的过程中,需要进行阈值的选择。

MFISTA算法采用了一种自适应的阈值选择方法,称为FISTA步骤。

FISTA步骤通过计算两次迭代的差异来选择阈值,从而实现更好的收敛性能。

4. 结束条件:当稀疏表示的值不再发生显著变化时,算法收敛,可以得到最终的稀疏表示结果。

MFISTA算法相比于其他稀疏表示算法具有以下优点:1. 收敛速度快:MFISTA算法通过引入FISTA步骤,能够更快地收敛,提高算法的运行效率。

2. 稀疏性更好:MFISTA算法能够得到更加稀疏的稀疏表示结果,即使用更少的基函数来表示信号。

3. 适用性广:MFISTA算法在不同领域的稀疏表示问题中都有较好的应用效果,包括图像处理、压缩感知、信号恢复等。

4. 鲁棒性强:MFISTA算法对噪声和数据不完整性具有较好的鲁棒性,能够处理一些复杂的实际问题。

尽管MFISTA算法在稀疏表示问题中取得了较好的效果,但仍然存在一些局限性。

首先,算法的收敛性与初始化值有关,不同的初始化值可能导致不同的收敛结果。

颠覆传统建模!3D阿尔茨海默病体外模型诞生了!可巧妙模拟人脑,为痴呆治疗带来重大进步

颠覆传统建模!3D阿尔茨海默病体外模型诞生了!可巧妙模拟人脑,为痴呆治疗带来重大进步

颠覆传统建模!3D阿尔茨海默病体外模型诞生了!可巧妙模拟人脑,为痴呆治疗带来重大进步原创2018-06-28 订阅号APExBIO阿尔茨海默病(Alzheimer’s disease,简称AD) 是一种神经系统退行性疾病,临床上的表现特征为痴呆,主要表现为渐进性记忆障碍、认知功能障碍、人格改变及语言障碍等神经精神症状,以65岁为界分为早发性和晚发性。

阿尔茨海默病(AD)的特征在于β-淀粉样蛋白(beta-amyloid,Aβ)的积累,磷酸化tau的形成,神经胶质细胞的超活化和神经元的丢失。

然而人们对AD的病因及发病机制知之甚少,很大程度上是因为缺乏一种理想的AD模型。

对于体外模型,理想的情况是能够重演AD病理过程的三大点:Aβ的累积,磷酸化tau的聚集和神经炎性,即重演AD患者大脑中多级细胞间的相互作用。

然而,目前的AD神经元模型不包括由小神经胶质细胞介导的神经炎症变化。

近日,来自美国北卡罗来纳大学夏洛特分校的Park等人建立了一个3D的AD体外模型,这是一个微流体装置,里面装载了含人类神经元(neurons)、星形胶质细胞(astrocytes)和小胶质细胞(microglia)的3D培养物。

3D微流体模型呈现出与生理相关的大脑环境,可以重演AD的病理过程,揭示了神经退行性病变的潜在重要炎症机制。

该论文题目为“A 3D human triculture system modeling neurodegeneration and neu roinflammation in Alzheimer’s disease”,在线发表于《nature Neuroscience》杂志。

这个三重培养装置看起来像一个“圆盆”(见下图),神经元和星形胶质细胞在3D凝胶状培养物中生长,来模拟一个“微型大脑”。

淀粉样前体蛋白(amyloid precursor protein, APP)的突变会导致AD。

在这里,瑞典突变(K670/M671L)和伦敦突变(V717I)APP通过慢病毒感染在神经元和星形胶质细胞中表达,导致β-淀粉样蛋白(Aβ)的累积和tau的磷酸化——这是AD的两个病理标志。

基于深度学习的三维模型检索算法综述

基于深度学习的三维模型检索算法综述

ISSN1004-9037,CODEN SCYCE4Journal of Data Acquisition and Processing Vol.36,No.1,Jan.2021,pp.1一21 DOI:10.16337/j.1004-9037.2021.01.001©2021by Journal of Data Acquisition and ProcessingE-mail:sjcj@ Tel/Fax:十86-025-********基于深度学习的三维模型检索算法综述刘安安,李天宝,王晓雯,宋丹(天津大学电气自动化与信息工程学院,天津300072)摘要:近年来,深度学习被广泛应用于各个领域并取得了显著的进展,如何利用深度学习高效管理呈爆炸式增长的三维模型一直是一个研究热点。

本文介绍了发展至今主流的基于深度学习的三维模型检索算法,并根据实验得出的算法性能评估分析了其优缺点。

根据检索任务的不同,可将主要的三维模型检索算法分为两类:1)基于模型的三维模型检索方法,即检索对象与被检索对象都是三维模型,按照对三维模型的表示方式不同,可进一步分为基于体素、基于点云和基于视图的方法;2)基于二维图像的跨域三维模型检索方法,即检索对象是二维图像,被检索对象是三维模型,包括基于二维真实图像和基于二维草图的三维模型检索方法。

最后,对基于深度学习的三维模型检索算法目前存在的问题进行分析和讨论,并展望未来发展的新方向。

关键词:三维模型检索;深度学习;特征表示;度量学习;域适应中图分类号:TP391文献标志码:AReview of3D Model Retrieval Algorithms Based on Deep LearningLIU Anan,LI Tianbao,WANG Xiaowen,SONG Dan(School of Electrical and Information Engineering,Tianjin University,Tianjin300072,China)Abstract:In recent years,deep learning has been widely used and achieved significant development in various fields.How to utilize deep learning to effectively manage the explosive increasing3D models becomes a hot topic.This paper introduces the mainstream algorithms for deep learning based3D model retrieval and analyzes the advantages and disadvantages according to the experimental performance.In terms of the retrieval tasks,3D model retrieval algorithms are classified into two categories:(1)Model­based3D model retrieval algorithms require that both query and gallery are3D models.It can be further divided into voxel-based method,point cloud-based method and view-based method in regard of different representations of3D models.(2)For2D image-based cross-domain3D model retrieval algorithms,the query is2D image while the gallery is3D model.It can be classified to2D real image-based method and2D sketch-based method.Finally,we analyze and discuss existing issues of deep learning based3D model retrieval methods,and predict possible promising directions for this research topic.Key words:3D model retrieval;deep learning;feature representation;metric learning;domain adaptation基金项目:国家自然科学基金(61772359,61902277)资助项目;天津市新一代人工智能重大专项(19ZXZNGX00110, 18ZXZNGX00150)资助项目;中国博士后科学基金(2020M680884)资助项目。

An Improved Heuristic Algorithm for UAV Path Planning in 3D Environment

An Improved Heuristic Algorithm for UAV Path Planning in 3D Environment

An Improved Heuristic Algorithm for UAV Path Planning in 3D Environment Zhang Qi1, Zhenhai Shao1, Yeo Swee Ping2, Lim Meng Hiot3, Yew Kong LEONG4 1School of Communication Engineering, University of Electronic Science and Technology of China2Microwave Research Lab, National University of Singapore3Intelligent Systems Center, Nanyang Technological University4Singapore Technologye-mail:beijixing2006@,zhenhai.shao@, eleyeosp@.sg,emhlim@.sg, leongyk@Abstract—Path planning problem is one of core contents of UAV technology. This paper presents an improved heuristic algorithm to solve 3D path planning problem. In this study the path planning model is built based on digital map firstly, and then the virtual terrain is introduced to eliminate a significant amount of search space, from 3-Dimensions to 2-Dimensions. Subsequently the improved heuristic A* algorithm is applied to generate UAV trajectory. The algorithm is featured with various searching steps and weighting factor for each cost component. The simulation results have been done to validate the effectiveness of this algorithm.Keywords-unmanned aerial vehicle (UAV); path planning; virtual terrain; heuristic A* algorithmI.I NTRODUCTIONPath planning is required for an unmanned aerial vehicle (UAV) to meet the objectives specified for any military or commercial application. The general purpose of path planning is to find the optimal path from a start point to a destination point subject to the different operational constraints (trajectory length, radar exposure, collision avoidance, fuel consumption, etc) imposed on the UAV for a particular mission; if, for example, the criterion is simply to minimize flight time, the optimization process is then reduced to a minimal cost problem.Over decades several path planning algorithms have been investigated. Bortoff [1] presented a two-step path planning algorithm based on Voronoi partitioning: a graph search method is first applied to generate a rough-cut path which is thereafter smoothed in accordance with his proposed virtual-force model. Anderson et al. [2] also employed Voronoi approaches to generate a family of feasible trajectories. Pellazar [3], Nikolos et al. [4] and Lim et al. [5] opted for genetic algorithms to navigate the UAV. The calculus-of-variation technique has been adopted in [6]-[7] to find an optimal path with minimum radar illumination.In this paper, an improved heuristic algorithm is presented for UAV path planning. The path planning environment is built in section II, and the algorithm is depicted in section III, the following section presents experimental results which can validate the effectiveness of the proposed algorithm.II.P ATH PLANNING MODELSeveral factors must be taken into account in path planning problem: terrain information, threat information, and UAV kinetics. These factors form flight constraints which must be handled in planning procedure.Many studies use the mathematical function to simulate terrain environment [4]. This method is quick and simple, but compared with the real terrain which UAV flying across, it lacks of reality and universality. In this study, terrain information is constructed by DEM (digital elevation model) data, which is released by USGS (U.S. Geological Survey) as the true terrain representation.Threat information is also considered in path planning. In modern warfare, almost all anti-air weapons need radar to track and lock air target. Here the main threat is radar illumination. Radar threat density can be represented by radar equation, because the intrinsic radar parameters are determined before path planning. The threat density can be regarded inversely proportional to R4, where R is the distance from the UAV’s current location to a particular radar site.For simplicity, UAV is modeled as a mass point traveling at a constant velocity and its minimum turning radius is treated as a fixed parameter.III.P ATH PLANNING A PPRO A CHA.Virtual terrain for three-dimensional path planningUnlike ground vehicle routing planning, UAV path planning is a 3D problem in real scenario. In 3D space, not only terrain and threat information is taken into account, but also UAV specifications, such as max heading angle, vertical angle, and turning radius are incorporated for comprehensive consideration.The straightforward method for UAV path planning is partitioning 3D space as 3D grid and then some algorithms are applied to generate path. However, for any algorithm the computational time is mainly dependent on the size of search space. Therefore, for efficiency consideration, a novel concept of constructing a 2D search space which is based on original 3D search space is proposed, which is called virtual terrain. The virtual terrain is constructed above the real terrain according to the required flight safety clearance2010 Second International Conference on Intelligent Human-Machine Systems and Cyberneticsheight, as it is shown in Figure 1. . A’B’C’D’ is the real terrain and ABCD is virtual terrain. H is the clearance height between two surfaces. Virtual terrain enables path planning in 2D surface instead of 3D grid and can reduce search spaceby an order of magnitude.Figure 1. virtual terrain above real terrainB. Path planning algorithmA* algorithm [8]-[9] is a well-known graph search procedure utilizing a heuristic function to guide its search. Given a consistent admissible condition, A* search is guaranteed to yield an optimal path [8]. At the core of the algorithm is a list containing all of the current states. At each iterative step, the algorithm expands and evaluates the adjacent states of all current states and decides whether any of them should be added to the list (if not in the list) or updated (if already in the list) based on the cost function:()()()f n g n h n =+ (1)where f(n) is the total cost at the current vertex, g(n)denotes the actual cost from the start point to the current point n , and h(n) refers to the pre-estimated cost from the current point n to the destination point. For applications that entail searching on a map, the heuristic function h(n) is assigned with Euclidean distance.UAV path planning is a multi criteria search problem. The actual cost g(n) in this study is composed by three items: distance cost D(n), climb cost C(n) and threat cost T(n). So g(n) can be described as follows:()()()()g n D n C n T n =++ (2) Usually, the three components of g(n) are not treatedequally during UAV task. One or two is preferred to the others. We can achieve this by introducing a weighting factor w in (2).123()()()()g n w D n w C n w T n =++ (3) w i is weighting factor and 11mi i w ==∑. For example, ifthreat cost T(n) is for greater concern in particular task, the value of w i should be increased respectively.C. The improvement of path planning strategyVirtual terrain in part A enhanced computational efficiency by transforming 3D path planning space into 2D search plane. The further improvement can be achieved by applying a new developed strategy. The path planner expands and evaluates next waypoint in virtual terrain by this developed strategy is shown in Fig. 2, 3. This planning strategy employs various searching steps by defining a searching window which can represent the information acquired by UAV on board sensors. It enables different searching steps to meet different threat cost distribution. After searching window is set, UAV performance limits is imposed in searching window based on virtual terrain. Here the UAV performance limits include turning radius, heading and vertical angle. In Fig. 3, the point P(x, y, z) is current state, and the arrow represents current speed vector. The gray points show available states which UAV can reach innext step under the limits imposed by UAV performance.Figure 2.Searching windowFigure 3. Available searching states at P(x, y, z)IV. SIMULATIONSimulation is implemented based on section II andsection III. In this simulation, terrain data is read from USGS1 degree DEM. The DEM has 3 arc-second interval alonglongitude and latitude respectively. Also five radar threats are represented according radar equation in simulation environment. Here clearance height h is set 200 to definevirtual terrain. UAV maximal heading angle and vertical angle is 20。

Geometric Modeling

Geometric Modeling

Geometric ModelingGeometric modeling is a crucial aspect of computer-aided design (CAD) and computer graphics. It involves the creation of digital representations of objects and environments using mathematical algorithms and geometric techniques. These models are used in various fields such as engineering, architecture, animation, and virtual reality. Geometric modeling plays a significant role in the design and visualization of complex structures, the simulation of physical phenomena, and the creation of realistic computer-generated imagery. One of the primary challenges in geometric modeling is achieving accuracy and precision in representing real-world objects and scenes. This requires the use of advanced mathematical concepts such as calculus, linear algebra, and differential geometry. Geometric modeling also involves the use of computational algorithms to generate and manipulate geometric shapes, surfaces, and volumes. These algorithms need to be efficient and robust to handle large-scale and intricate models while maintaining visualfidelity and integrity. Another important aspect of geometric modeling is the representation of 3D objects in a 2D space, which is essential for visualization and rendering. This process involves techniques such as projection, rasterization, and rendering, which are used to convert 3D geometric data into 2D images for display on screens or print. Achieving realistic and visually appealing representations requires careful consideration of lighting, shading, and texture mapping, which are fundamental in computer graphics and visualization. Inaddition to the technical challenges, geometric modeling also raises issuesrelated to usability and user experience. Designing intuitive and user-friendly interfaces for creating and manipulating geometric models is crucial for enabling efficient and effective design workflows. This involves considerations such as interactive manipulation, real-time feedback, and intuitive control mechanisms, which are essential for empowering users to express their creative ideas and concepts. Furthermore, geometric modeling has a significant impact on the manufacturing and production processes. The digital models created through geometric modeling are used for computer-aided manufacturing (CAM) and numerical control (NC) machining, enabling the production of precise and complex parts and assemblies. This integration of geometric modeling with manufacturing technologieshas revolutionized the way products are designed, prototyped, and manufactured, leading to advancements in efficiency, quality, and innovation. From an academic perspective, geometric modeling is a multidisciplinary field that draws from mathematics, computer science, and engineering. Researchers and educators in this field are constantly exploring new methods and techniques for geometric modeling, pushing the boundaries of what is possible in terms of representing and manipulating geometric data. This includes areas such as parametric modeling, geometric constraints, and procedural modeling, which are essential for enabling flexible and adaptable design processes. In conclusion, geometric modeling is a complex and multifaceted field with far-reaching implications for various industries and disciplines. It encompasses technical challenges related to accuracy, efficiency, and visualization, as well as considerations of usability, manufacturing, and academic research. As technology continues to advance, geometric modeling will play an increasingly critical role in shaping the way we design, create, and interact with the world around us.。

一种求解3-SAT问题的新方法

一种求解3-SAT问题的新方法
S am t zsrb sd o o a tc at e rh srtg ( rs otMB O) h u r a x e me ts o h tMB S w r Opi ie ae n lc lso h si sac t e y f h r mi c a o PS . e n me c le p r n h w ta P O T i i
摘 要 可满足性 问题 (a sait Pol S T) 计算科 学的典 型问题之 一 , S tf bly rbe A 是 i i i m, 目前 有 D P算法 、A 1 ST. 3算法和 遗传 算 法等 多种求解方法。文章根据 K n ey和 E ehr提 出的二进制粒子群优化算法 (iay P rc w r pi i r)基 en d b rat Bnr at l S am O t z s 。 ie m e 于局部随机搜索策略 , 出了一种求解 3 S T问题的新方法 : 于局部 随机搜 索的改进 二进制粒子群优化 算法( df 给 -A 基 Mo id e
A w e h d f r S l i g 3 S Ne M t o o o v n - AT Pr b e s o lm
He Yih o W a g Ya q Ko n z a ca n n i u Yl g h n
( fr ainPoetDeat n,hj zun i ri fE oo c,h izun 5 0 1 I om t r c pr tS iah agUnv syo cnmi Siah ag00 3 ) n o j me i e t s j
维普资讯

种 求解 3 S T 问题 的新 方法 -A
贺 毅朝 王彦 棋 寇 应展
( 家庄 经 济 学院信 息 工程 系, 家庄 0 0 3 ) 石 石 50 1 ( 军械 工程 学 院计 算机 工程 系, 家庄 0 00 ) 石 50 3

堆叠自动编码器的稀疏表示方法(Ⅲ)

堆叠自动编码器的稀疏表示方法(Ⅲ)

堆叠自动编码器的稀疏表示方法自动编码器是一种无监督学习的神经网络模型,它通过学习数据的内部表示来提取特征。

堆叠自动编码器则是由多个自动编码器叠加而成的深层网络模型。

在实际应用中,堆叠自动编码器通过学习更加抽象的特征表示,可以用于特征提取、降维和生成数据等多个领域。

在这篇文章中,我们将探讨堆叠自动编码器的稀疏表示方法,以及其在深度学习中的重要性。

稀疏表示是指在特征提取过程中,只有少数单元才被激活。

在堆叠自动编码器中,通过引入稀疏表示方法,可以让网络学习到更加鲁棒和有意义的特征。

稀疏表示可以有效地降低特征的冗余性,提高网络的泛化能力,使得网络能够更好地适应未见过的数据。

同时,稀疏表示还可以减少模型的计算复杂度,提高模型的训练效率。

因此,稀疏表示在深度学习中具有重要的意义。

在堆叠自动编码器中,稀疏表示的方法有很多种,其中最常用的方法之一是使用稀疏编码器。

稀疏编码器是一种特殊的自动编码器,它通过引入稀疏约束来学习稀疏表示。

在训练过程中,稀疏编码器会对每个隐藏单元引入稀疏性约束,使得只有少数隐藏单元被激活。

这样可以有效地提高特征的鲁棒性和泛化能力。

同时,稀疏编码器还可以使用稀疏性约束来降低特征的冗余性,提高特征的表达能力。

除了稀疏编码器,堆叠自动编码器还可以通过正则化方法来实现稀疏表示。

正则化是一种常用的方法,它可以通过引入额外的惩罚项来控制模型的复杂度。

在堆叠自动编码器中,可以通过引入L1正则化项来推动隐藏单元的稀疏性。

L1正则化项可以使得很多隐藏单元的激活值为0,从而实现稀疏表示。

通过正则化方法实现稀疏表示的堆叠自动编码器具有较好的鲁棒性和泛化能力,同时可以减少模型的计算复杂度,提高模型的训练效率。

另外,堆叠自动编码器还可以通过引入降噪自动编码器来实现稀疏表示。

降噪自动编码器是一种特殊的自动编码器,它可以通过在输入数据上添加噪声来训练模型。

在实际应用中,通过引入随机噪声,可以有效地降低模型对输入数据的敏感度,提高网络的鲁棒性。

A survey of content based 3d shape retrieval methods

A survey of content based 3d shape retrieval methods

A Survey of Content Based3D Shape Retrieval MethodsJohan W.H.Tangelder and Remco C.VeltkampInstitute of Information and Computing Sciences,Utrecht University hanst@cs.uu.nl,Remco.Veltkamp@cs.uu.nlAbstractRecent developments in techniques for modeling,digitiz-ing and visualizing3D shapes has led to an explosion in the number of available3D models on the Internet and in domain-specific databases.This has led to the development of3D shape retrieval systems that,given a query object, retrieve similar3D objects.For visualization,3D shapes are often represented as a surface,in particular polygo-nal meshes,for example in VRML format.Often these mod-els contain holes,intersecting polygons,are not manifold, and do not enclose a volume unambiguously.On the con-trary,3D volume models,such as solid models produced by CAD systems,or voxels models,enclose a volume prop-erly.This paper surveys the literature on methods for con-tent based3D retrieval,taking into account the applicabil-ity to surface models as well as to volume models.The meth-ods are evaluated with respect to several requirements of content based3D shape retrieval,such as:(1)shape repre-sentation requirements,(2)properties of dissimilarity mea-sures,(3)efficiency,(4)discrimination abilities,(5)ability to perform partial matching,(6)robustness,and(7)neces-sity of pose normalization.Finally,the advantages and lim-its of the several approaches in content based3D shape re-trieval are discussed.1.IntroductionThe advancement of modeling,digitizing and visualizing techniques for3D shapes has led to an increasing amount of3D models,both on the Internet and in domain-specific databases.This has led to the development of thefirst exper-imental search engines for3D shapes,such as the3D model search engine at Princeton university[2,57],the3D model retrieval system at the National Taiwan University[1,17], the Ogden IV system at the National Institute of Multimedia Education,Japan[62,77],the3D retrieval engine at Utrecht University[4,78],and the3D model similarity search en-gine at the University of Konstanz[3,84].Laser scanning has been applied to obtain archives recording cultural heritage like the Digital Michelan-gelo Project[25,48],and the Stanford Digital Formae Urbis Romae Project[75].Furthermore,archives contain-ing domain-specific shape models are now accessible by the Internet.Examples are the National Design Repos-itory,an online repository of CAD models[59,68], and the Protein Data Bank,an online archive of struc-tural data of biological macromolecules[10,80].Unlike text documents,3D models are not easily re-trieved.Attempting tofind a3D model using textual an-notation and a conventional text-based search engine would not work in many cases.The annotations added by human beings depend on language,culture,age,sex,and other fac-tors.They may be too limited or ambiguous.In contrast, content based3D shape retrieval methods,that use shape properties of the3D models to search for similar models, work better than text based methods[58].Matching is the process of determining how similar two shapes are.This is often done by computing a distance.A complementary process is indexing.In this paper,indexing is understood as the process of building a datastructure to speed up the search.Note that the term indexing is also of-ten used for the identification of features in models,or mul-timedia documents in general.Retrieval is the process of searching and delivering the query results.Matching and in-dexing are often part of the retrieval process.Recently,a lot of researchers have investigated the spe-cific problem of content based3D shape retrieval.Also,an extensive amount of literature can be found in the related fields of computer vision,object recognition and geomet-ric modelling.Survey papers to this literature have been provided by Besl and Jain[11],Loncaric[50]and Camp-bell and Flynn[16].For an overview of2D shape match-ing methods we refer the reader to the paper by Veltkamp [82].Unfortunately,most2D methods do not generalize di-rectly to3D model matching.Work in progress by Iyer et al.[40]provides an extensive overview of3D shape search-ing techniques.Atmosukarto and Naval[6]describe a num-ber of3D model retrieval systems and methods,but do not provide a categorization and evaluation.In contrast,this paper evaluates3D shape retrieval meth-ods with respect to several requirements on content based 3D shape retrieval,such as:(1)shape representation re-quirements,(2)properties of dissimilarity measures,(3)ef-ficiency,(4)discrimination abilities,(5)ability to perform partial matching,(6)robustness,and(7)necessity of posenormalization.In section2we discuss several aspects of3D shape retrieval.The literature on3D shape matching meth-ods is discussed in section3and evaluated in section4. 2.3D shape retrieval aspectsIn this section we discuss several issues related to3D shape retrieval.2.1.3D shape retrieval frameworkAt a conceptual level,a typical3D shape retrieval frame-work as illustrated byfig.1consists of a database with an index structure created offline and an online query engine. Each3D model has to be identified with a shape descrip-tor,providing a compact overall description of the shape. To efficiently search a large collection online,an indexing data structure and searching algorithm should be available. The online query engine computes the query descriptor,and models similar to the query model are retrieved by match-ing descriptors to the query descriptor from the index struc-ture of the database.The similarity between two descriptors is quantified by a dissimilarity measure.Three approaches can be distinguished to provide a query object:(1)browsing to select a new query object from the obtained results,(2) a direct query by providing a query descriptor,(3)query by example by providing an existing3D model or by creating a3D shape query from scratch using a3D tool or sketch-ing2D projections of the3D model.Finally,the retrieved models can be visualized.2.2.Shape representationsAn important issue is the type of shape representation(s) that a shape retrieval system accepts.Most of the3D models found on the World Wide Web are meshes defined in afile format supporting visual appearance.Currently,the most common format used for this purpose is the Virtual Real-ity Modeling Language(VRML)format.Since these mod-els have been designed for visualization,they often contain only geometry and appearance attributes.In particular,they are represented by“polygon soups”,consisting of unorga-nized sets of polygons.Also,in general these models are not“watertight”meshes,i.e.they do not enclose a volume. By contrast,for volume models retrieval methods depend-ing on a properly defined volume can be applied.2.3.Measuring similarityIn order to measure how similar two objects are,it is nec-essary to compute distances between pairs of descriptors us-ing a dissimilarity measure.Although the term similarity is often used,dissimilarity corresponds to the notion of dis-tance:small distances means small dissimilarity,and large similarity.A dissimilarity measure can be formalized by a func-tion defined on pairs of descriptors indicating the degree of their resemblance.Formally speaking,a dissimilarity measure d on a set S is a non-negative valued function d:S×S→R+∪{0}.Function d may have some of the following properties:i.Identity:For all x∈S,d(x,x)=0.ii.Positivity:For all x=y in S,d(x,y)>0.iii.Symmetry:For all x,y∈S,d(x,y)=d(y,x).iv.Triangle inequality:For all x,y,z∈S,d(x,z)≤d(x,y)+d(y,z).v.Transformation invariance:For a chosen transforma-tion group G,for all x,y∈S,g∈G,d(g(x),g(y))= d(x,y).The identity property says that a shape is completely similar to itself,while the positivity property claims that dif-ferent shapes are never completely similar.This property is very strong for a high-level shape descriptor,and is often not satisfied.However,this is not a severe drawback,if the loss of uniqueness depends on negligible details.Symmetry is not always wanted.Indeed,human percep-tion does not alwaysfind that shape x is equally similar to shape y,as y is to x.In particular,a variant x of prototype y,is often found more similar to y then vice versa[81].Dissimilarity measures for partial matching,giving a small distance d(x,y)if a part of x matches a part of y, do not obey the triangle inequality.Transformation invariance has to be satisfied,if the com-parison and the extraction process of shape descriptors have to be independent of the place,orientation and scale of the object in its Cartesian coordinate system.If we want that a dissimilarity measure is not affected by any transforma-tion on x,then we may use as alternative formulation for (v):Transformation invariance:For a chosen transforma-tion group G,for all x,y∈S,g∈G,d(g(x),y)=d(x,y).When all the properties(i)-(iv)hold,the dissimilarity measure is called a metric.Other combinations are possi-ble:a pseudo-metric is a dissimilarity measure that obeys (i),(iii)and(iv)while a semi-metric obeys only(i),(ii)and(iii).If a dissimilarity measure is a pseudo-metric,the tri-angle inequality can be applied to make retrieval more effi-cient[7,83].2.4.EfficiencyFor large shape collections,it is inefficient to sequen-tially match all objects in the database with the query object. Because retrieval should be fast,efficient indexing search structures are needed to support efficient retrieval.Since for query by example the shape descriptor is computed online, it is reasonable to require that the shape descriptor compu-tation is fast enough for interactive querying.2.5.Discriminative powerA shape descriptor should capture properties that dis-criminate objects well.However,the judgement of the sim-ilarity of the shapes of two3D objects is somewhat sub-jective,depending on the user preference or the application at hand.E.g.for solid modeling applications often topol-ogy properties such as the numbers of holes in a model are more important than minor differences in shapes.On the contrary,if a user searches for models looking visually sim-ilar the existence of a small hole in the model,may be of no importance to the user.2.6.Partial matchingIn contrast to global shape matching,partial matching finds a shape of which a part is similar to a part of another shape.Partial matching can be applied if3D shape mod-els are not complete,e.g.for objects obtained by laser scan-ning from one or two directions only.Another application is the search for“3D scenes”containing an instance of the query object.Also,this feature can potentially give the user flexibility towards the matching problem,if parts of inter-est of an object can be selected or weighted by the user. 2.7.RobustnessIt is often desirable that a shape descriptor is insensitive to noise and small extra features,and robust against arbi-trary topological degeneracies,e.g.if it is obtained by laser scanning.Also,if a model is given in multiple levels-of-detail,representations of different levels should not differ significantly from the original model.2.8.Pose normalizationIn the absence of prior knowledge,3D models have ar-bitrary scale,orientation and position in the3D space.Be-cause not all dissimilarity measures are invariant under ro-tation and translation,it may be necessary to place the3D models into a canonical coordinate system.This should be the same for a translated,rotated or scaled copy of the model.A natural choice is tofirst translate the center to the ori-gin.For volume models it is natural to translate the cen-ter of mass to the origin.But for meshes this is in gen-eral not possible,because they have not to enclose a vol-ume.For meshes it is an alternative to translate the cen-ter of mass of all the faces to the origin.For example the Principal Component Analysis(PCA)method computes for each model the principal axes of inertia e1,e2and e3 and their eigenvaluesλ1,λ2andλ3,and make the nec-essary conditions to get right-handed coordinate systems. These principal axes define an orthogonal coordinate sys-tem(e1,e2,e3),withλ1≥λ2≥λ3.Next,the polyhe-dral model is rotated around the origin such that the co-ordinate system(e x,e y,e z)coincides with the coordinatesystem(e1,e2,e3).The PCA algorithm for pose estimation is fairly simple and efficient.However,if the eigenvalues are equal,prin-cipal axes may switch,without affecting the eigenvalues. Similar eigenvalues may imply an almost symmetrical mass distribution around an axis(e.g.nearly cylindrical shapes) or around the center of mass(e.g.nearly spherical shapes). Fig.2illustrates the problem.3.Shape matching methodsIn this section we discuss3D shape matching methods. We divide shape matching methods in three broad cate-gories:(1)feature based methods,(2)graph based meth-ods and(3)other methods.Fig.3illustrates a more detailed categorization of shape matching methods.Note,that the classes of these methods are not completely disjoined.For instance,a graph-based shape descriptor,in some way,de-scribes also the global feature distribution.By this point of view the taxonomy should be a graph.3.1.Feature based methodsIn the context of3D shape matching,features denote ge-ometric and topological properties of3D shapes.So3D shapes can be discriminated by measuring and comparing their features.Feature based methods can be divided into four categories according to the type of shape features used: (1)global features,(2)global feature distributions,(3)spa-tial maps,and(4)local features.Feature based methods from thefirst three categories represent features of a shape using a single descriptor consisting of a d-dimensional vec-tor of values,where the dimension d isfixed for all shapes.The value of d can easily be a few hundred.The descriptor of a shape is a point in a high dimensional space,and two shapes are considered to be similar if they are close in this space.Retrieving the k best matches for a3D query model is equivalent to solving the k nearest neighbors -ing the Euclidean distance,matching feature descriptors can be done efficiently in practice by searching in multiple1D spaces to solve the approximate k nearest neighbor prob-lem as shown by Indyk and Motwani[36].In contrast with the feature based methods from thefirst three categories,lo-cal feature based methods describe for a number of surface points the3D shape around the point.For this purpose,for each surface point a descriptor is used instead of a single de-scriptor.3.1.1.Global feature based similarityGlobal features characterize the global shape of a3D model. Examples of these features are the statistical moments of the boundary or the volume of the model,volume-to-surface ra-tio,or the Fourier transform of the volume or the boundary of the shape.Zhang and Chen[88]describe methods to com-pute global features such as volume,area,statistical mo-ments,and Fourier transform coefficients efficiently.Paquet et al.[67]apply bounding boxes,cords-based, moments-based and wavelets-based descriptors for3D shape matching.Corney et al.[21]introduce convex-hull based indices like hull crumpliness(the ratio of the object surface area and the surface area of its convex hull),hull packing(the percentage of the convex hull volume not occupied by the object),and hull compactness(the ratio of the cubed sur-face area of the hull and the squared volume of the convex hull).Kazhdan et al.[42]describe a reflective symmetry de-scriptor as a2D function associating a measure of reflec-tive symmetry to every plane(specified by2parameters) through the model’s centroid.Every function value provides a measure of global shape,where peaks correspond to the planes near reflective symmetry,and valleys correspond to the planes of near anti-symmetry.Their experimental results show that the combination of the reflective symmetry de-scriptor with existing methods provides better results.Since only global features are used to characterize the overall shape of the objects,these methods are not very dis-criminative about object details,but their implementation is straightforward.Therefore,these methods can be used as an activefilter,after which more detailed comparisons can be made,or they can be used in combination with other meth-ods to improve results.Global feature methods are able to support user feed-back as illustrated by the following research.Zhang and Chen[89]applied features such as volume-surface ratio, moment invariants and Fourier transform coefficients for 3D shape retrieval.They improve the retrieval performance by an active learning phase in which a human annotator as-signs attributes such as airplane,car,body,and so on to a number of sample models.Elad et al.[28]use a moments-based classifier and a weighted Euclidean distance measure. Their method supports iterative and interactive database searching where the user can improve the weights of the distance measure by marking relevant search results.3.1.2.Global feature distribution based similarityThe concept of global feature based similarity has been re-fined recently by comparing distributions of global features instead of the global features directly.Osada et al.[66]introduce and compare shape distribu-tions,which measure properties based on distance,angle, area and volume measurements between random surface points.They evaluate the similarity between the objects us-ing a pseudo-metric that measures distances between distri-butions.In their experiments the D2shape distribution mea-suring distances between random surface points is most ef-fective.Ohbuchi et al.[64]investigate shape histograms that are discretely parameterized along the principal axes of inertia of the model.The shape descriptor consists of three shape histograms:(1)the moment of inertia about the axis,(2) the average distance from the surface to the axis,and(3) the variance of the distance from the surface to the axis. Their experiments show that the axis-parameterized shape features work only well for shapes having some form of ro-tational symmetry.Ip et al.[37]investigate the application of shape distri-butions in the context of CAD and solid modeling.They re-fined Osada’s D2shape distribution function by classifying2random points as1)IN distances if the line segment con-necting the points lies complete inside the model,2)OUT distances if the line segment connecting the points lies com-plete outside the model,3)MIXED distances if the line seg-ment connecting the points lies passes both inside and out-side the model.Their dissimilarity measure is a weighted distance measure comparing D2,IN,OUT and MIXED dis-tributions.Since their method requires that a line segment can be classified as lying inside or outside the model it is required that the model defines a volume properly.There-fore it can be applied to volume models,but not to polyg-onal soups.Recently,Ip et al.[38]extend this approach with a technique to automatically categorize a large model database,given a categorization on a number of training ex-amples from the database.Ohbuchi et al.[63],investigate another extension of the D2shape distribution function,called the Absolute Angle-Distance histogram,parameterized by a parameter denot-ing the distance between two random points and by a pa-rameter denoting the angle between the surfaces on which two random points are located.The latter parameter is ac-tually computed as an inner product of the surface normal vectors.In their evaluation experiment this shape distribu-tion function outperformed the D2distribution function at about1.5times higher computational costs.Ohbuchi et al.[65]improved this method further by a multi-resolution ap-proach computing a number of alpha-shapes at different scales,and computing for each alpha-shape their Absolute Angle-Distance descriptor.Their experimental results show that this approach outperforms the Angle-Distance descrip-tor at the cost of high processing time needed to compute the alpha-shapes.Shape distributions distinguish models in broad cate-gories very well:aircraft,boats,people,animals,etc.How-ever,they perform often poorly when having to discrimi-nate between shapes that have similar gross shape proper-ties but vastly different detailed shape properties.3.1.3.Spatial map based similaritySpatial maps are representations that capture the spatial lo-cation of an object.The map entries correspond to physi-cal locations or sections of the object,and are arranged in a manner that preserves the relative positions of the features in an object.Spatial maps are in general not invariant to ro-tations,except for specially designed maps.Therefore,typ-ically a pose normalization is donefirst.Ankerst et al.[5]use shape histograms as a means of an-alyzing the similarity of3D molecular surfaces.The his-tograms are not built from volume elements but from uni-formly distributed surface points taken from the molecular surfaces.The shape histograms are defined on concentric shells and sectors around a model’s centroid and compare shapes using a quadratic form distance measure to compare the histograms taking into account the distances between the shape histogram bins.Vrani´c et al.[85]describe a surface by associating to each ray from the origin,the value equal to the distance to the last point of intersection of the model with the ray and compute spherical harmonics for this spherical extent func-tion.Spherical harmonics form a Fourier basis on a sphere much like the familiar sine and cosine do on a line or a cir-cle.Their method requires pose normalization to provide rotational invariance.Also,Yu et al.[86]propose a descrip-tor similar to a spherical extent function and a descriptor counting the number of intersections of a ray from the ori-gin with the model.In both cases the dissimilarity between two shapes is computed by the Euclidean distance of the Fourier transforms of the descriptors of the shapes.Their method requires pose normalization to provide rotational in-variance.Kazhdan et al.[43]present a general approach based on spherical harmonics to transform rotation dependent shape descriptors into rotation independent ones.Their method is applicable to a shape descriptor which is defined as either a collection of spherical functions or as a function on a voxel grid.In the latter case a collection of spherical functions is obtained from the function on the voxel grid by restricting the grid to concentric spheres.From the collection of spher-ical functions they compute a rotation invariant descriptor by(1)decomposing the function into its spherical harmon-ics,(2)summing the harmonics within each frequency,and computing the L2-norm for each frequency component.The resulting shape descriptor is a2D histogram indexed by ra-dius and frequency,which is invariant to rotations about the center of the mass.This approach offers an alternative for pose normalization,because their method obtains rotation invariant shape descriptors.Their experimental results show indeed that in general the performance of the obtained ro-tation independent shape descriptors is better than the cor-responding normalized descriptors.Their experiments in-clude the ray-based spherical harmonic descriptor proposed by Vrani´c et al.[85].Finally,note that their approach gen-eralizes the method to compute voxel-based spherical har-monics shape descriptor,described by Funkhouser et al.[30],which is defined as a binary function on the voxel grid, where the value at each voxel is given by the negatively ex-ponentiated Euclidean Distance Transform of the surface of a3D model.Novotni and Klein[61]present a method to compute 3D Zernike descriptors from voxelized models as natural extensions of spherical harmonics based descriptors.3D Zernike descriptors capture object coherence in the radial direction as well as in the direction along a sphere.Both 3D Zernike descriptors and spherical harmonics based de-scriptors achieve rotation invariance.However,by sampling the space only in radial direction the latter descriptors donot capture object coherence in the radial direction,as illus-trated byfig.4.The limited experiments comparing spherical harmonics and3D Zernike moments performed by Novotni and Klein show similar results for a class of planes,but better results for the3D Zernike descriptor for a class of chairs.Vrani´c[84]expects that voxelization is not a good idea, because manyfine details are lost in the voxel grid.There-fore,he compares his ray-based spherical harmonic method [85]and a variation of it using functions defined on concen-tric shells with the voxel-based spherical harmonics shape descriptor proposed by Funkhouser et al.[30].Also,Vrani´c et al.[85]accomplish pose normalization using the so-called continuous PCA algorithm.In the paper it is claimed that the continuous PCA is better as the conventional PCA and better as the weighted PCA,which takes into account the differing sizes of the triangles of a mesh.In contrast with Kazhdan’s experiments[43]the experiments by Vrani´c show that for ray-based spherical harmonics using the con-tinuous PCA without voxelization is better than using rota-tion invariant shape descriptors obtained using voxelization. Perhaps,these results are opposite to Kazhdan results,be-cause of the use of different methods to compute the PCA or the use of different databases or both.Kriegel et al.[46,47]investigate similarity for voxelized models.They obtain a spatial map by partitioning a voxel grid into disjoint cells which correspond to the histograms bins.They investigate three different spatial features asso-ciated with the grid cells:(1)volume features recording the fraction of voxels from the volume in each cell,(2) solid-angle features measuring the convexity of the volume boundary in each cell,(3)eigenvalue features estimating the eigenvalues obtained by the PCA applied to the voxels of the model in each cell[47],and a fourth method,using in-stead of grid cells,a moreflexible partition of the voxels by cover sequence features,which approximate the model by unions and differences of cuboids,each containing a number of voxels[46].Their experimental results show that the eigenvalue method and the cover sequence method out-perform the volume and solid-angle feature method.Their method requires pose normalization to provide rotational in-variance.Instead of representing a cover sequence with a single feature vector,Kriegel et al.[46]represent a cover sequence by a set of feature vectors.This approach allows an efficient comparison of two cover sequences,by compar-ing the two sets of feature vectors using a minimal match-ing distance.The spatial map based approaches show good retrieval results.But a drawback of these methods is that partial matching is not supported,because they do not encode the relation between the features and parts of an object.Fur-ther,these methods provide no feedback to the user about why shapes match.3.1.4.Local feature based similarityLocal feature based methods provide various approaches to take into account the surface shape in the neighbourhood of points on the boundary of the shape.Shum et al.[74]use a spherical coordinate system to map the surface curvature of3D objects to the unit sphere. By searching over a spherical rotation space a distance be-tween two curvature distributions is computed and used as a measure for the similarity of two objects.Unfortunately, the method is limited to objects which contain no holes, i.e.have genus zero.Zaharia and Prˆe teux[87]describe the 3D Shape Spectrum Descriptor,which is defined as the histogram of shape index values,calculated over an en-tire mesh.The shape index,first introduced by Koenderink [44],is defined as a function of the two principal curvatures on continuous surfaces.They present a method to compute these shape indices for meshes,byfitting a quadric surface through the centroids of the faces of a mesh.Unfortunately, their method requires a non-trivial preprocessing phase for meshes that are not topologically correct or not orientable.Chua and Jarvis[18]compute point signatures that accu-mulate surface information along a3D curve in the neigh-bourhood of a point.Johnson and Herbert[41]apply spin images that are2D histograms of the surface locations around a point.They apply spin images to recognize models in a cluttered3D scene.Due to the complexity of their rep-resentation[18,41]these methods are very difficult to ap-ply to3D shape matching.Also,it is not clear how to define a dissimilarity function that satisfies the triangle inequality.K¨o rtgen et al.[45]apply3D shape contexts for3D shape retrieval and matching.3D shape contexts are semi-local descriptions of object shape centered at points on the sur-face of the object,and are a natural extension of2D shape contexts introduced by Belongie et al.[9]for recognition in2D images.The shape context of a point p,is defined as a coarse histogram of the relative coordinates of the re-maining surface points.The bins of the histogram are de-。

text-to-3d_with_classifier_score_distillation_概述说明

text-to-3d_with_classifier_score_distillation_概述说明

text-to-3d with classifier score distillation 概述说明1. 引言1.1 概述本文旨在介绍"text-to-3d with classifier score distillation"的概念和应用。

"text-to-3d"是一种技术,可以将文本信息转换为三维场景或模型,通过深度学习算法实现。

而"classifier score distillation"则是一种方法,用于提取分类器的得分信息并进行蒸馏处理。

本文将详细介绍这两个技术及其原理、应用领域和实现方法。

1.2 文章结构本文共分为五个部分:引言、正文、text-to-3d、classifier score distillation 和结论。

在正文部分,将详细介绍"text-to-3d"技术的原理、应用领域和实现方法;而在"classifier score distillation"部分,则会针对分类器得分蒸馏的相关内容进行阐述。

最后,在结论中总结主要发现,并探讨研究意义及未来展望。

1.3 目的本文的目的是通过对"text-to-3d with classifier score distillation"这一技术的全面介绍,使读者对这一领域有一个清晰的认识和了解。

同时,希望能够展示该技术在不同领域中的潜在应用价值,并为相关研究提供启示和指导。

通过本文的阐述,读者将能够掌握"text-to-3d"技术的原理、实现以及与"classifier score distillation"相结合的应用方法,为进一步研究和开展相关工作提供基础和支持。

这样便清晰地描述了“1. 引言”部分的内容。

2. 正文在本文中,我们将介绍text-to-3d技术和classifier score distillation方法,并探讨它们的原理、应用领域以及实现方法。

离散元,machine learning

离散元,machine learning

离散元,machine learning
离散元(Discrete Element Method,DEM)是一种用于模拟颗粒、颗粒组合体和颗粒流动行为的数值模拟方法。

它将颗粒视为离散的个体,通过建立颗粒之间的力学联系和运动规则,模拟颗粒的运动和相互作用。

离散元模拟可以应用于多个领域,如岩土工程、颗粒材料、化工等,用于分析颗粒的力学行为、碰撞、堆积等。

机器学习(Machine Learning,ML)是一种通过计算机算法和模型,使计算机能够从数据中自动学习和改进的方法。

它关注如何通过数据和经验提高计算机的性能和表现。

机器学习涉及到统计学、人工智能和模式识别等领域,可以用于分类、回归、聚类、推荐系统等任务。

离散元和机器学习是两种不同的方法和技术,但也可以结合应用。

比如,在颗粒流动的研究中,可以利用离散元模拟得到的大量数据,通过机器学习方法进行数据挖掘和分析,提取出颗粒流动的规律和特征,从而更好地理解和预测颗粒流动的行为。

另外,也可以利用机器学习方法优化离散元模拟的参数和模型,提高模拟的准确性和效率。

Radar Imaging Based on Iterative Algorithms

Radar Imaging Based on Iterative Algorithms

Radar Imaging Based on Iterative Algorithms佚名【期刊名称】《系统工程与电子技术:英文版》【年(卷),期】1991(000)002【摘要】It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.【总页数】9页(P91-99)【关键词】雷达成像计算机断层扫描离散模型迭代重建算法代数重建技术。

三维点云特征描述算法

三维点云特征描述算法

三维点云特征描述算法
三维点云特征描述算法是对三维点云数据进行提取和描述其特征的算法。

常见的三维点云特征描述算法有以下几种:
1. 点云特征描述算法:其中一个比较经典的算法是PFH
(Point Feature Histogram),它通过计算每个点的法线方向和
周围邻域点的相对位置关系来描述点的特征。

还有其他的一些方法,比如FPFH(Fast Point Feature Histogram)等。

2. 局部特征描述算法:这类算法把点云分成小的局部区域,然后对每个局部区域进行特征提取和描述,比如SHOT (Signature of Histograms of Orientations)算法。

3. 深度学习特征描述算法:随着深度学习在计算机视觉领域的广泛应用,也有一些基于深度学习的点云特征描述算法被提出。

这些算法一般通过深度学习网络对点云进行特征提取和特征描述。

4. 结构化特征描述算法:这类算法主要是针对特定的点云结构进行特征描述,比如面片、网格等。

常见的算法有Spin Image、Shape Context等。

总的来说,三维点云特征描述算法的目标是提取和描述点云中的局部结构和全局性质,以便于后续的识别、分类、配准等任务的处理。

不同的算法适用于不同的应用场景,选择合适的算法对于点云数据的处理非常重要。

人工智能核心算法考试模拟题与参考答案

人工智能核心算法考试模拟题与参考答案

人工智能核心算法考试模拟题与参考答案一、单选题(共44题,每题1分,共44分)RS属于哪种特征选择方法(___)A、包裹式B、启发式C、嵌入式D、过滤式正确答案:C2.信息熵是度量样本集合(___)最常用的一种指标。

A、精确度B、准确率C、召回率D、纯度正确答案:D3.阅读以下文字:假设我们拥有一个已完成训练的、用来解决车辆检测问题的深度神经网络模型,训练所用的数据集由汽车和卡车的照片构成,而训练目标是检测出每种车辆的名称(车辆共有10种类型)。

现在想要使用这个模型来解决另外一个问题,问题数据集中仅包含一种车(福特野马)而目标变为定位车辆在照片中的位置。

()A、除去神经网络中的最后一层,冻结所有层然后重新训练B、对神经网络中的最后几层进行微调,同时将最后一层(分类层)更改为回归层C、使用新的数据集重新训练模型D、所有答案均不对正确答案:B4.用Tensorflow处理图像识别任务时,若输入数据的形状为[64,224,224,3],下面说法正确的是A、每一张图片都是二值图片B、每一张图片都是三通道图片C、模型一次处理224张图片(batchsize为224)D、以上选项均不正确正确答案:B5.半监督学习包括。

A、聚类学习B、直推学习C、主动学习D、回归学习正确答案:B6.深度神经网络的运行过程是由三个算法依次运行组成,下面不属于这三个算法中的是A、归一化B、梯度下降C、正向传播D、反向传播正确答案:A7.下列关于核函数的表述正确的是A、多项式核函数只是将原始特征映射,并没有升维B、使用线性核函数的SVM是非线性分类器C、核函数即特征的映射关系D、高斯核函数将特征映射到无穷维正确答案:D8.以下关于集成的描述,错误的是(___)。

A、随着集成中个体分类器(相互独立)数目T的增大,集成的错误率将指数级下降,最终趋向于零B、集成学习通过构建并结合多个学习器来完成学习任务,也称为多分类器系统、基于委员会的学习等C、集成中只包含同种类型的个体学习器,如“决策树集成”,“神经网络集成”等,这样的集成是“同质”的D、集成中同时包含多种类型的个体学习器,这样的集成是“异质”的,异质集成的个体学习器一般称为基学习器正确答案:D9.常用的图像特征包括A、形状特征B、纹理特征C、颜色特征D、像素特征正确答案:DN不具有以下那个特性。

  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

See discussions, stats, and author profiles for this publication at: /publication/280874377 A 3D discrete FEM iterative algorithm for solving the water pipe cooling problems of massive concrete structuresARTICLE in INTERNATIONAL JOURNAL FOR NUMERICAL AND ANALYTICAL METHODS IN GEOMECHANICS · JULY 2015Impact Factor: 1.38 · DOI: 10.1002/nag.2409READS84 AUTHORS, INCLUDING:Zhao LanhaoHohai University32 PUBLICATIONS 15 CITATIONSSEE PROFILEA 3D discrete FEM iterative algorithm for solving the water pipe cooling problems of massive concrete structuresJing Cheng*,†,T.C.Li,Xiaoqing Liu and L.H.Zhao1College of Water Conservancy and Hydropower Engineering,Hohai University,Nanjing,210098,ChinaSUMMARYWater pipe cooling has been widely used for the temperature control and crack prevention of massive con-crete structures such as high dams.Because both under-cooling and over-cooling may reduce the ef ficiency of crack prevention,or even lead to great harm to structures,we need an accurate and robust numerical tool for the prediction of cooling effect.Here,a 3D discrete FEM Iterative Algorithm is introduced,which can simulate the concrete temperature gradient near the pipes,as well as the water temperature rising along the pipes.On the basis of the heat balance between water and concrete,the whole temperature field of the problem can be computed exactly within a few iteration steps.Providing the pipe meshing tool for building the FE model,this algorithm can take account of the water pipe distribution,the variation of water flow,water temperature,and other factors,while the traditional equivalent algorithm based on semi-theoretical solutions can only solve problems with constant water flow and water temperature.The validation and convergence are proved by comparing the simulated results and analytical solutions of two standard second-stage cooling problems.Then,a practical concrete block with different cooling schemes is analyzed and the in fluences of cooling factors are investigated.In the end,detailed guidance for pipe system optimization is provided.Copyright ©2015John Wiley &Sons,Ltd.Received 16May 2014;Revised 15February 2015;Accepted 5June 2015KEY WORDS:numerical methods;iterative algorithm;water pipe cooling;transient heat transfer;thermal stress1.INTRODUCTIONMassive concrete structures such as hydraulic dams,sluices,pumping stations,and nuclear plant foundation always suffer crack problems.Research on crack formation and relevant prevention measures remains an important topic for civil engineers.Despite the fact that dry shrinkage,poor material quality,and many other factors may contribute to the cracking,thermal stress is considered as the toughest to treat with for massive concrete structures.Normally,the cement hydration lasts several days for common concrete or weeks for RCC,during which the core temperature will rise signi ficantly without controlling measures [1,2].However,because of the inherent poor heat conductivity of concrete,it may take several years for core temperature to fall down to steady or quasi-steady state in accordance with natural conditions.During the early age after construction,the core temperature is much higher than the surface temperature,and the inner expansion will cause surface cracks.After years of heat emission,the core temperature drops signi ficantly,and then,the inner shrinkage crack may occur under the constraints of surrounding parts.Apparently,to prevent these two major kinds of thermal cracks,the key issue is to control the temperature rising and the inner-surface temperature difference.Many measures have been taken such as cement reduction,aggregate pre-cooling,placing *Correspondence to:J.Cheng,College of Water Conservancy and Hydropower Engineering,Hohai University,Nanjing,210098,China.†E-mail:mscj042@INTERNATIONAL JOURNAL FOR NUMERICAL AND ANALYTICAL METHODS IN GEOMECHANICS Int.J.Numer.Anal.Meth.Geomech.(2015)Published online in Wiley Online Library ().DOI:10.1002/nag.2409J.CHENG ET AL.temperature controlling,and block surface protection[3].Among them,the water pipe cooling proves to be the most efficient and economic.Dating from the1930s,the water pipe cooling technique wasfirst used by the Bureau of Reclamation in Hoover Dam,of which the thin-walled metal pipes were embedded in the concrete block during construction period[1].Since then,it spread over the world from common concrete to roller-compacted concrete(RCC), and from dams to sluices and other structures[4–6].In the1970s,a high-density polyethylene(HDPE)pipe with high thermal conductivity arose and soon took over metal pipe in hydraulic projects,such as Sayano–Shushenskaya Dam and Ertan Dam,because of its greatflexibility for shaping[6].Figure1(a)shows the configuration of Jinping-I Arch Dam with26sections divided by temporary transverse joints.Each dam section was placed layer by layer at a vertical interval of3m.The cooling pipes were usually embedded in horizontal section planes like an S curve shown in Figure1(b),with both vertical and horizontal pipe spacing of about1.2–3.0m.To keep the effectiveness,the pipe length should better not exceed250m. For those huge concrete structures like arch dams,which arefirst built by several parts and then joined together to meet their uneven deformations,the cooling process generally includes two stages.Thefirst-stage cooling begins several hours after the concrete placement,aiming to suppress the maximum concrete temperature rising.Before the joint grouting between neighboring parts,a second-stage cooling is carried out to make the inner temperature decrease till it gets near its static state.There are three essential categories of computation methods for pipe cooling problems:the analytical methods,the equivalentfinite element method(FEM),and the discrete FEM.In1949,the US Bureau of Reclamation obtained thefirst analytical solution in series for second-stage cooling problems via the method of separation of variables,with the following assumptions:(1)both the temperature andflow of cooling water were constant;(2)pipes were equally spaced;and(3)exothermal heating was complete and the concrete temperature was evenly distributed at the start of pipe cooling[7].Another solution in series was given out by Zhu in1956using the Laplace transform method,with amuchFEM ITERATIVE ALGORITHM FOR WATER PIPE COOLING PROBLEMS OF CONCRETEhigher convergence rate.After that,Zhu proposed analytical solutions forfirst-stage cooling problems with metal pipes in1957[8]and non-metal pipes in1999[9].Analytical solutions provide quantitative insight into the cooling effect,but it lacks practical utilization.With these analytical solutions,an equivalent FEM was developed for cooling problems,of which the cooling effect was considered as a negative heat source in an average meaning[10,11].This brought great convenience for the application of FEM.Though without obtaining the real temperature gradient and stress near the pipes,the equivalent algorithm remains to be the most widely used method in engineering practice.The discrete FEM directly simulates the pipes with elements;thus,the inner heat sources and surface convection along interior pipe wall could be considered simultaneously.By the early1990s, three methods were used for the computation of water temperature along the pipes,the simple method,the iteration method,and the prediction method[10].However,requirements for small element size near pipes and consequent large element number made it difficult for practical use.In recent years,great progress has been achieved in the controlling of pipe cooling on account of the informationization of construction and the digitalization of dam data.For this new pipe cooling system often denoted as‘intelligent water-pipe cooling’,the real-time information of concrete temperature, water temperature,waterflow,and other indexes are collected automatically,and the cooling process can be adjusted freely[12].Accordingly,the executive cooling criteria extends from a single maximum allowable temperature to a temperature history curve based on material properties and structure features,and the optimization of cooling scheme can bring benefit in millions of dollars for high dams. With the faintness of traditional semi-theoretical FEM for these innovations,many efforts have been made to provide much more accurate and robust numerical tools for the prediction of cooling effect. Xie et ed a3Dfinite element relocating mesh method to simulate the temperature distribution for different pipe cooling schemes of RCC arch dams during construction and operation period[5]. Kim et al.developed a line element to model the pipe,and the internalflow theory was adopted for calculating the temperature variation of pipe water[13].Yazdi et al.developed a temperature simulation model usingfinite volume method[14].On the basis of the heat balance between concrete and cooling water,Liu proposed a direct algorithm for metal pipe cooling problems,of which the fully coupled finite element equations were established with both the piped water temperature and the concrete temperature as unknown.Thus,the water temperature can be solved directly without iteration[15].In2003,Zhu et al.proposed an FEM that uses the discretefinite element to model the pipes,and the water temperature can be calculated by iterations[16].To distinguish this method from other approaches based on FEM,we call it a‘discrete FEM iteration algorithm’.Without any assumptions,almost all factors can be simulated easily,including pipe cooling parameters,concrete material parameters,and complex boundary conditions.However,this method did not attract much attention until recently when the great progress was achieved in the digitalization of dam data and high performance computing.In this paper,the kernel idea of the3D discrete FEM iterative algorithm for pipe cooling problems of massive concrete is presented.The key items,including the discretization of matrix equation,the calculation of water temperature along the pipe,the iterative algorithm for temperaturefield simulation,and the incremental method for thermal stress calculation,are described,respectively.For those practical problems with complex embedded pipes,a very useful and novel pipe meshing tool is developed on the basis of coarse mesh and pipe distribution information.Then,the two standard second-stage pipe cooling problems are simulated for the verification of the algorithm and its convergence evaluation.Finally,a practical application is provided as an instruction for the proposed method and for the practical design of pipe cooling system.2.THEORY AND METHODOLOGY2.1.Discretized matrix equation of heat conductionTo solve the pipe cooling problems of massive concrete structures above,the3D transient heat conduction governing equation is involved.In the given domainΩincluding the structure and its basement within a certain range,it can be expressed as[17,18]∂∂xλx∂T∂xþ∂∂yλy∂T∂yþ∂∂zλz∂T∂zþQÀc cρ∂T∂t¼0(1)where T=T(x,y,z,t)denotes the temperaturefield at time t;λx,λyλz denote the thermal conductivity in the x,y,and z directions,and for homogenous material,λx=λy=λz=λ;The heat source term Q here has the following form for newly placed concrete:Q¼c cρ∂θ∂t(2)whereθ=θ(t)denotes the adiabatic temperature rise of concrete due to hydration heat;This partial differential equation can be solved with the following initial and boundary conditions, which is known or specified:T¼T0x;y;zðÞ;when t¼t0initial condition(3)T¼T b x;y;z;tðÞonΓT;essential boundary(4)Àλ∂T∂n¼βTÀT aðÞonΓq;convection boundary(5)where T b(x,y,z,t)is the known boundary temperature function or specified function,∂T/∂n is the temperature gradient along the n direction,and for3D problems,it can be expressed as follows:∂T ∂n ¼∂T∂x n xþ∂T∂y n yþ∂T∂z n z(6)and n x,n y,and n z are the direction cosines of the external normal to the boundary.Generally,ΓT includes the bottom of rock-base model where the temperature is specified according to geological information,whileΓq includes the surface in contact with water or air.The above problem can be discretized into elements and solved in the following matrix form using standard FEMs[17]:C_dþKd¼P(7)where C and K are the global specific heat matrix and heat conductivity matrix,P is the load vector, and d and_d are the node temperature vector and its time derivative,respectively.C¼∫Ωc cρN T N dΩ(8)K¼∫Ωλ∂N∂xT∂N∂xþ∂N∂yT∂N∂yþ"∂N∂zT∂N∂z#dΩþ∫Γ3βN T N dΓ(9) P¼∫Ωc cρ∂θ∂t NT dΩþ∫Γ2N T q dΓþ∫Γ3N TβT a dΓ(10)d¼T1T2…T nf g T n is the total node number(11) N is the shape function described in the FEM method.J.CHENG ET AL.Using the weighted residual approximation for temperature field within the time interval Δt =t n+1Àt n ,Eq.7can be written asC =Δt þK ϕðÞd n þ1þÀC =Δt þK 1ÀϕðÞ½ d n ¼P (12)This is the well-known θalgorithm or θmethod for solving the first-order equations.To avoid confusion with the previous mentioned heat generation,here,the weighting parameter ϕis used instead.Different values of φlead to various time difference approximations:(1)ϕ=0,forward-difference approximation (or Euler difference approximation);(2)ϕ=1/2,central-difference approximation (Crank –Nicholson difference approximation);(3)ϕ=2/3,Galerkin difference approximation;;and (4)ϕ=1,backward-difference approximation.Then,the solution of Eq.12yields the following:C =Δt þK ϕðÞd n þ1¼P ÀÀC =Δt þK 1ÀϕðÞ½ d n ¼P þC =Δt þK ϕÀ1ðÞ½ d n(13)It can be written as follows:K C 1d n þ1¼P þK C 2d n(14)where K C1and K C2are working matrices:K C 1¼C =Δt þK ϕ;K C 2¼C =Δt þK ϕÀ1ðÞ(15)The load vector can be calculated as follows:P ¼P n 1ÀϕðÞþP n þ1ϕ(16)Here,ϕ=1is retained in the simulation of this paper.2.2.Calculation of water temperature along the pipe`On the early stage of arti ficial pipe cooling,the temperature difference between concrete and water is comparatively large,which leads to the signi ficant rising of water temperature along the pipes.The water temperature in the inlet of the pipe is preset from refrigeration plant or just from the river because of its source;thus,for solving the pipe cooling problems de fined by Eq.1under conditions Eqs.3–5,the only left to be calculated is the water temperature increase along the pipe.For a typical vertical section of the concrete block in Figure 2(a),the pipes are distributed at a spacing of S H ×S V ,and each pipe only effects a certain part approximating to a column or prism in Figure 2(b,c).As a type of convection boundary de fined in Eq.5,the heat transferfrom Figure 2.Physical model for concrete block embedded with cooling pipe.FEM ITERATIVE ALGORITHM FOR WATER PIPE COOLING PROBLEMS OF CONCRETEconcrete to water can be denoted as follows:q¼Àλ∂T∂n(17)The water temperature increase between two neighboring sections S1and S2of the column is denoted asΔT S.During a very small time interval d t,1.The heat transferred from concrete to water through the inner surfaceΓp of the pipe betweenSection S1and S2can be expressed as follows:d Q p¼∬Γp q i d s d t¼Àλ∬Γp∂Td s d t(18)2.The heat energy of the waterflowing through the inlet section S1isd Q S1¼c wρw q w T S1d t(19)3.The heat energy of the waterflowing through the outlet section S2isd Q S2¼c wρw q w T S2d t(20)In Eqs.19and20,T S1and T S2are the water temperatures in Sections S1and S2.4.The change of the heat energy of the water between S1and S2is as follows:d Q w¼∫S2S1c wρw∂T S∂t d tA p d l(21)where A p is the area of the pipe section,T s denotes the water temperature in any section S,and d l is the distance between S1and S2.According to the heat equilibrium,we haved Q S2¼d Q S1þd Q PÀd Q w(22)Substituting Eqs.18–21into Eq.22,the water temperature increase between S1and S2can be expressed as follows:ΔT S¼T S2ÀT S1¼Àλc wρw q w∬Γp∂T∂n d s d tÀA pq w∫S2S1∂T S∂t d td l(23)Considering that both the volume and temperature increase of water are very small within d l, d Q w is a higher order trace relative to d Q p and can be omitted;thus,Eq.23can be written as follows:ΔT S¼Àλc wρw q w∬Γp∂T∂n d s d t(24)Providing the concrete temperaturefield is known,the above integral can be executed easily on Γp.Because the inlet water temperature T w0is known,we can calculate the water temperature inJ.CHENG ET AL.any section S i by dividing the pipe into m sections and accumulating the temperature increase along the pipe as follows:T S i ¼T w0þ∑i j ¼1ΔT S j ;i ¼1;2;3;…;m (25)2.3.Iterative algorithm for temperature fieldFrom Eq.24,it can be seen that the increase of water temperature along the pipe is in fluenced by the axial temperature gradient of the concrete.Note that the water temperature and the structural concrete temperature interact with each other;we adopt the following iterative algorithm to solve this nonlinear boundary problem.1.At the first step,the water temperature along the pipe at time t =t i is assumed to be constant as equal to the inlet water temperature T w0;then,a temporary transient temperature field T 0(x ,y ,z ,t i )can be calculated.2.On the basis of the computed results T 0,the radial concrete temperature gradient along the pipe (∂T /∂n)0is obtained,as well as the water temperature along the pipe T S 0using Eqs.24and 25.3.With the updated water temperature T S 0,the transient temperature T 1(x ,y ,z ,t i )can be calculated,which is much more close to the real temperature than T (x ,y ,z ,t i ).4.By repeating steps (2)and (3),we can obtain a series of (T S k ,T k (x ,y ,z ,t i ),k =0,1,2,…).When two neighboring series are close enough to ful fill the following condition,stop the iteration,max T k þ1Si ÀT k SiÀÁ<ε;i ¼1;2;3;…;m ;ε>0(26)where k is the iteration times and εis the speci fied tolerance,which can be set as 0.01°C.Normally,2–3iterations will be enough.2.4.Pipe meshing toolThe meshing for discrete FEM algorithm is very time consuming.Here,an effective meshing tool PipeMeshF is developed to create the pipe-embedded mesh model on the basis of a coarse FEM model and the pipe distribution information including inlet elements,corner elements,and outlet paring a coarse model and its associated pipe-embedded model in Figure 3,we can observe the following:1.With the PipeMeshF tool,only those elements that pipes go through are remeshed;thus,the total element number is not enlarged somuch.Figure 3.Finite element meshing for pipe-embedded model using PipeMeshF .FEM ITERATIVE ALGORITHM FOR WATER PIPE COOLING PROBLEMS OF CONCRETE2.Thefine mesh model with embedded pipes can be easily created from a coarse model by any pop-ularfinite element meshing packages,provided that those elements pipes go through are hexahe-dron elements.3.Because most parts of the two models keep the same,the results from discrete algorithm withpipe embedded model and equivalent algorithm with coarse model can be compared conveniently.4.The element density around the pipes can be easily changed,depending on the accuracyrequirement.2.5.Thermal stress calculation for massive concreteBecause thefinal purpose of cooling is to control the stress of massive concrete,here,we briefly introduce the theory used for thermal stress calculation.On the basis of the common FEM approach for mechanical problems,the main idea of time-dependent thermal stress calculation is executed by introducing the following relationship between stress and temperature strain:Δσf g¼DΔεÀΔεTf g(27) where{Δσ}is the stress increment,{Δε}the total strain increment,{ΔεT}the total strain increment, and D the elasticity matrix.Concrete creep and time-dependent elastic modulus are the two fundamental features to distinguish thermal stress of concrete structures from that of others.The modulus of elasticity can be expressed by one of the following two equations:EτðÞ¼E01ÀeÀAτBEτðÞ¼E0τHþτ(28)and the unit creep(creep produced under the action of unit stress)Cr(t,τ)is expressed asCr t;τðÞ¼∑n ci¼1ψi1ÀeÀr i tÀτðÞh i(29)ψi¼f iþg iτÀp i(30) where E0,A,B,H,f i,g i,p i,r i,and n c in Eqs.28–30are material constants.With these two factors considered,we call the thermal stress as elasto-creeping or viscoelastic.To reduce the large memory requirement for recording the stress history in the process of creep strain computation,B.F.Zhu proposed an implicit incremental method with unequal time intervals as shown in Figure 4.For this method,the relation between stress increment vector andstrainFigure4.Incremental method for stress calculation.J.CHENG ET AL.increment vector for complex stress state is derived:Δσn f g ¼D n ÂÃΔεn f g Àηn f g ÀΔεT nÈÉÀÁ(31)where D n ÂüE n Q ½ À1;E n ¼E τn ðÞ1þE τn ðÞC t n ;;τn ðÞ;τn ¼τn À1þτn ðÞ=2(32)and ηn is an intermediate variable for calculation the creep strain:ηn ¼∑n c i 1Àe Àr i Δτn ÀÁωi ;n ÈÉωi ;n Èɼωi ;n À1ÈÉe Àr i Δτn À1þQ ½ Δσn À1f g ψi τn À1ðÞe À0:5r i Δτn À1ωi ;1ÈɼQ ½ Δσ0f g ψi τ0ðÞ(33)Here,only the main formulas are collected to save space;more detail about matrix [D],[Q],[Q]À1and the deduction of the implicit method can be found in Reference [6].3.METHOD VERIFICATION AND DISCUSSIONAs indicated in Section 2.2,the concrete region controlled by each pipe can be approximated to a column or prism.Here,a second-stage arti ficial cooling problem for a single concrete column is analyzed by the proposed method to investigate its performance.The problem ful fills the three assumptions mentioned in the third paragraph of introduction,and the column section is shown in Figure 5(a).With an isolated external boundary and without heat source,it possesses analytical solutions for both conditions of metal pipes and HDPE pipes.The initial temperature difference between the concrete and cooling water is de fined as T 0.Other parameters are taken as c =0.016and b /c =100.For the numerical implementation based on the proposed method,four schemes (named as M1T1,M1T2,M2T1,and M2T2,respectively)with different mesh models (named as Mesh1and Mesh2)and time marching schemes (named as TList1and TList2)are computed and compared.Both mesh models are created in a way that the element size d increases along the axis with a constant ratio.As shown in Figure 5(b,c),N Div means the division number of the radius,d max the maximum element size along the axis,and d min the maximum element size along the axis.Two time marching schemes are set asfollows:Figure 5.A single concrete column embedded with cooling pipe.(a)Schematic of section plane;(b)Mesh1,N Div =20,d max /d min =10,d min =0.0198m;(c)Mesh2,N Div =40,d max /d min =20,d min =0.00614m.FEM ITERATIVE ALGORITHM FOR WATER PIPE COOLING PROBLEMS OF CONCRETETList1:0.05,0.15,0.25,0.5,1,1.5,2,2.5,3,4,5,6,8,10,12,14,17,20,25,30,35,40,50,60,70,80,90,100;(unit:day)TList2:0.01,0.02,0.03,0.04,0.05,0.075,0.1,0.125,0.15,0.175,0.2,0.225,0.25,0.3,0.35,0.4,0.45,0.5,0.75,1,1.25,1.5,1.75,2,2.25,2.5,2.75,3,3.5,4,4.5,5,5.5,6,7,8,9,10,11,12,13,14,16,18,20,24,28,32,36,40,45,50,55,60,65,70,75,80,85,90,95,100;(unit:day)Thus,M1T1means the combined scheme with Mesh1and TList1,and similarly M1T2with Mesh1and TList2.The numerical solutions are compared and analyzed for metal pipes and HDPE pipes,respectively.3.1.Second-stage arti ficial cooling with metal pipesWhen the pipe in Figure 5(a)is made of metal,the internal boundary for the concrete column is almost equal to the water temperature because of the high conductivity coef ficient of metal.Analytical solution of temperature field is given by [6]via the Laplace transform method:T r ;τðÞ¼T 0∑∞n ¼12e Àα2n b 2a τ=b 2αn b ÁJ 1αn b ðÞY 0αn r ðÞÀY 1αn b ðÞJ 0αn r ðÞR αn b ðÞ(34)Figure 7.Analytical temperature solution along the radius at different times (N order =5,e T r =2.64e À2).Figure 6.Analytical temperature solution along the radius at different times (N order =3;e T r =3.91e À2).R αn b ðÞ¼c =b ðÞJ 1αn b ðÞY 1αn c ðÞÀJ 1αn c ðÞY 1αn b ðÞ½þJ 0αn c ðÞY 0αn b ðÞÀJ 0αn b ðÞY 0αn c ðÞ½ (35)where both the temperature field T (r ,τ)at t =τand initial temperature T 0at t =0are de fined on a relative temperature coordinate with water temperature as the origin;J 0and J 1are the first and second orders of the Bessel function of the first kind;Y 0and Y 1are the first and second orders of the Bessel function of the second kind;and αn b is the root of the following characteristic equation:J 1αn b ðÞY 0αn c ðÞÀJ 0αn c ðÞY 1αn b ðÞ¼0(36)Note that the analytical solutions in Eq.34are given in series and that the different numbers of order N order we retain may greatly in fluence their accuracy.The solutions with N order =3,5,and 10for this problem are shown in Figures 6–9where a normalized temperature T /T 0,distance r x /b and time a τ/D 2are used for ing the following relative error notation,e Tr ¼T =T 0ðÞmax À1(37)we obtain the relative error of analytical solutions with N order =1,2,3,4,5,10,and 20as e Tr =5.51e À2,4.19e À2,3.91e À2,3.29e À2,2.64e À2,1.66e À3,and 9.3e À7.It can be seen that N order has great effecton Figure 9.Analytical temperature history for different points along the radius.(N order =10).Figure 8.Analytical temperature solution along the radius at different times (N order =10;e T r =1.66e À3).the accuracy of the temperature especially when the time a τ/D 2is small.Because N order >10,the relative error e Tr is less than 0.167%,which can be enough for engineering purposes.Here analytical solutions with N order =20are taken for comparison with the numerical results in Sections3.1and 3.2.The temperature results at three time points for different computation schemes are compared in Figures 10–12,as well as the relative error,which is de fined as follows:e T ¼T =T 0ðÞsim ÀT =T 0ðÞana (38)where the subscript ‘sim ’means simulation results and ‘ana ’means analytical solutions with N order =20.We can conclude the following:(1)simulated results for all schemes are close to analytical solutions,which proves the ef ficiency of the proposed algorithm;(2)for a certain time step list,when the mesh is re fined,the results become much more accurate and closer to the analytical solutions;and (3)for a certain mesh model,when the time step is decreased,the results become much farther from the analytical solutions.This phenomenon of convergence seems strange but can be clari fied well as follows.Remark 1Errors of numerical methods generally include two parts:one due to mesh model and the other from time marching schemes.Here,for the second-stage cooling problem and for the backward-difference approximation (ϕ=1),Eq.12can be deduced asFigure 10.Temperature along the radius and its relative error.(a τ/D 2=0.0781).Figure 11.Temperature along the radius and its relative error (a τ/D 2=0.3906).。

相关文档
最新文档