检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

3,133 篇 会议
289 册 图书

馆藏范围

3,370 篇 电子文献
110 种 纸本馆藏

日期分布

学科分类号

1,560 篇 工学
- 1,475 篇 计算机科学与技术...
- 558 篇 电气工程
- 177 篇 软件工程
- 38 篇 力学（可授工学、理...
- 33 篇 信息与通信工程
- 26 篇 控制科学与工程
- 26 篇 生物医学工程（可授...
- 21 篇 生物工程
- 16 篇 化学工程与技术
- 15 篇 机械工程
- 14 篇 动力工程及工程热...
- 11 篇 电子科学与技术（可...
- 9 篇 光学工程
- 7 篇 材料科学与工程（可...
729 篇 理学
- 679 篇 数学
- 52 篇 物理学
- 34 篇 系统科学
- 32 篇 统计学（可授理学、...
- 30 篇 生物学
- 12 篇 化学
60 篇 管理学
- 39 篇 管理科学与工程(可...
- 25 篇 图书情报与档案管...
- 19 篇 工商管理
24 篇 医学
- 21 篇 基础医学(可授医学...
- 20 篇 临床医学
- 14 篇 药学(可授医学、理...
- 13 篇 公共卫生与预防医...
9 篇 法学
- 7 篇 社会学
8 篇 教育学
- 7 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
4 篇 农学
1 篇 哲学
1 篇 军事学
1 篇 艺术学

主题

109 篇 computer science
105 篇 computational mo...
102 篇 social network s...
91 篇 educational inst...
88 篇 computer network...
84 篇 computer archite...
83 篇 protocols
78 篇 algorithm design...
76 篇 wireless sensor ...
70 篇 hardware
68 篇 mathematical mod...
67 篇 data mining
66 篇 security
65 篇 servers
64 篇 humans
61 篇 computational ma...
58 篇 cloud computing
57 篇 computational sc...
56 篇 monitoring
56 篇 feature extracti...

机构

32 篇 qingdao binhai u...
14 篇 university of os...
11 篇 univ colorado de...
11 篇 college of compu...
10 篇 univ coll dublin...
9 篇 univ cologne mat...
8 篇 south china univ...
8 篇 univ geneva sect...
8 篇 beijing wuzi uni...
8 篇 ludong univ sch ...
8 篇 universiti malay...
8 篇 telkom universit...
8 篇 univ paris 13 la...
8 篇 beijing wuzi uni...
8 篇 school of electr...
7 篇 shanghai jiao to...
7 篇 univ geneva gene...
7 篇 penn state univ ...
7 篇 chinese acad sci...
7 篇 shijiazhuang tie...

作者

40 篇 gander martin j.
27 篇 cao ning
24 篇 hans petter lang...
14 篇 michael griebel
13 篇 halpern laurence
12 篇 cai xiao-chuan
11 篇 xingang liu
11 篇 rheinbach oliver
10 篇 higgs russell
10 篇 dolean victorita
10 篇 klawonn axel
9 篇 li bo
9 篇 naixue xiong
9 篇 zhang hui
8 篇 zhou li
8 篇 olof widlund
8 篇 krause rolf
8 篇 kwok felix
8 篇 laurence t. yang
8 篇 hans-joachim bun...

语言

3,374 篇 英文
48 篇 中文

检索条件"丛书名=Computational Science & Engineering"

共 3422 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Refining Simplex Points for Scalable Estimation of the Lebesgue Constant

Refining Simplex Points for Scalable Estimation of the Lebes...

引用

International Meshing Roundtable Workshop (IMR)

作者： Jimenez-Ramos, Albert Gargallo-Peiro, Abel Roca, Xevi Barcelona Supercomputing Ctr Barcelona Spain

ISBN: (纸本)9783031405969;9783031405945;9783031405938

To estimate the Lebesgue constant, we propose a point refinement method on the d-dimensional simplex. The proposed method features a smooth gradation of the point resolution, neighbor queries based on neighbor-aware coordinates, and a point refinement that algebraically scales as d+1d. Remarkably, by using neighbor-aware coordinates, the point refinement method is ready to automatically stop using a Lipschitz criterion. For different polynomial degrees and point distributions, we show that our automatic method efficiently reproduces the literature estimations for the triangle and the tetrahedron. Moreover, we efficiently estimate the Lebesgue constant in higher dimensions. Accordingly, up to six dimensions, we conclude that the point refinement method is well-suited to efficiently estimate the Lebesgue constant on simplices. In perspective, for a given polynomial degree, the proposed point refinement method might be relevant to optimize a set of simplex points that guarantees a small interpolation error. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ground Truth Crossfield Guided Mesher-Native Box Imprinting for Automotive Crash Analysis

Ground Truth Crossfield Guided Mesher-Native Box Imprinting ...

引用

International Meshing Roundtable Workshop (IMR)

作者： Mukherjee, Nilanjan SIEMENS Meshing & Abstract Simulat & Test Solut Siemens Digital Ind Software 2000 Eastman Dr Milford OH 45150 USA

ISBN: (纸本)9783031405969;9783031405945;9783031405938

This paper proposes a meshing strategy and a series of related algorithms of both computation and process used to imprint box shapes around washer holes for automotive carbody crash analysis. A uniquely lightweight, mesher-native, two-dimensional imprinting methodology is described. This imprinting methodology is mesh size and definition sensitive and does not alter or even interrogate geometry or surface triangulation. Two other methods are proposed for face axis determination, namely a minimum oriented bounding box (MOBB) approach and one based on a ground truth frame/crossfield (GTFF/GTCF). Box shapes around washer holes are oriented according to these direction fields. Virtual face decomposition is used to multiblock surfaces into box-with-hole and their boolean mesh areas. While a templatized mesh generator is used for the box-with-hole faces, a hybrid multizone mesher and along with loop-paver are used for the latter. An exhaustively complex mesh quality analysis for automotive body panels clearly justifies the strength of the present approach. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Crossfield Framefield Ground truth Multizone Shape imprinting Unified modeling language

来源：评论

学校读者我要写书评

暂无评论

Curvilinear Mesh Generation for the High-Order Virtual Element Method (VEM)

Curvilinear Mesh Generation for the High-Order Virtual Eleme...

引用

International Meshing Roundtable Workshop (IMR)

作者： Kirilov, Kaloyan Peiro, Joaquim Green, Mashy Moxey, David da Veiga, Lourenco Beirao Dassi, Franco Russo, Alessandro Imperial Coll London Dept Aeronaut London England Kings Coll London Dept Engn London England Univ Milano Bicocca Dept Math & Applicat Milan Italy

ISBN: (纸本)9783031405969;9783031405945;9783031405938

We present a proof-of-concept methodology for generating curvilinear polygonal meshes suitable for high-order discretizations by the Virtual Element Method (VEM). A VEM discretization requires the definition of a set of boundary and internal points that are used to interpolate the approximation functions and to evaluate integrals by means of suitable quadratures. The procedure to locate these points on the boundary borrows ideas from previous work on a posteriori high-order mesh generation in which the geometrical inquiries to a B-rep of the computational domain are performed via an interface to CAD libraries. Here we describe the steps of the procedure that transforms a straight-sided polygonal mesh, generated using third-party software, into a curvilinear boundary-conforming mesh. We discuss criteria for ensuring and verifying the validity of the mesh. Finally, using the Laplace equation with Dirichlet boundary conditions as a model problem, we show that VEM discretizations on such meshes achieve the expected rates of convergence as the mesh resolution is increased. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Tetrahedralization of Hexahedral Mesh

Tetrahedralization of Hexahedral Mesh

引用

International Meshing Roundtable Workshop (IMR)

作者： Timalsina, Aman Knepley, Matthew Purdue Univ W Lafayette IN 47907 USA Univ Buffalo Buffalo NY USA

ISBN: (纸本)9783031405969;9783031405945;9783031405938

Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to tetrahedral elements, the existing algorithms for tetrahedralization of a hexahedral complex limit pre-selection of face divisions. We generalize a procedure for tetrahedralizing triangular prisms to tetrahedralizing cubes, and combine it with certain other triangulation techniques to design an algorithm that can triangulate any hexahedra. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Formal Definition of Hexahedral Blocking operations Using n-G-Maps

Formal Definition of Hexahedral Blocking operations Using n-...

引用

International Meshing Roundtable Workshop (IMR)

作者： Postat, Valentin Le Goff, Nicolas Calderan, Simon Ledoux, Franck Hutzler, Guillaume Univ Paris Saclay CEA LIHPC Paris France CEA DAM DIF F-91297 Arpajon France Univ Evry Val Essonne IBISC COSMO Paris France

ISBN: (纸本)9783031405969;9783031405945;9783031405938

Nowadays for real study cases, the generation of full block structured hexahedral meshes is mainly an interactive and very-time consuming process realized by highly-qualified engineers. To this purpose, they use interactive software where they handle and modify complex block structures with operations like block removal, block insertion, O-grid insertion, propagation of block splitting, propagation of meshing parameters along layers of blocks and so on. Such operations are error-prone and modifying or adding an operation is a very tedious work. In this work, we propose to formally define hexahedral block structures and main associated operations in the model of n-dimensional generalized map. This model provides topological invariant and a systematic handling of geometric data that allows us to ensure the expected robustness. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Quadrilateral Mesh of Non-simply Connected Domain and Non-planar Surfaces From a Given Cross-Field

Quadrilateral Mesh of Non-simply Connected Domain and Non-pl...

引用

International Meshing Roundtable Workshop (IMR)

作者： Dotse, Kokou M. Mouysset, Vincent Pernet, Sebastien Off Natl Etud & Rech Aerosp 2 Ave Edouard Belin F-31000 Toulouse France

ISBN: (纸本)9783031405969;9783031405945;9783031405938

In this paper, we present a method for constructing a quad mesh from an initial cross-field given by the user. The idea of this approach is to provide a framework to process any cross-field in order to generate a quad mesh and thus benefit from the properties of the field in the resulting mesh. With this point of view, we handle the case of non-simply connected domains and we also address the notion of singular point placement on the edge, which allows us to handle geometries of arbitrary index. Finally, we give an extension of the method to non-planar surface manifolds. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Efficient KD-Tree Based Mesh Redistribution for Data Remapping Algorithms

Efficient KD-Tree Based Mesh Redistribution for Data Remappi...

引用

International Meshing Roundtable Workshop (IMR)

作者： Ray, Navamita Shevitz, Daniel Li, Yipeng Garimella, Rao Herring, Angela Kikinzon, Evgeny Lipnikov, Konstantin Rakotoarivelo, Hoby Velechovsky, Jan Los Alamos Natl Lab Computat & Stat Sci CCS 7 Los Alamos NM 12830 USA SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY USA Los Alamos Natl Lab Theoret Div T 5 Los Alamos NM USA Los Alamos Natl Lab X Computat Phys XCP 4 Los Alamos NM USA

ISBN: (纸本)9783031405969;9783031405945;9783031405938

In this paper, we present a new mesh redistribution algorithm developed for the parallel data remapping library Portage. During distributed memory parallel remapping, source and target meshes are partitioned independently of each other, requiring a mesh redistribution so that all cells on the target mesh partition are covered by source mesh partition cells. Our new algorithm uses a KD-tree data structure to capture the general shape of the target mesh and find an improved overlap between source and target mesh partitions so as to redistribute fewer cells. We present numerical results showing that the KD-tree method reduces memory storage requirements for the redistributed mesh on each partition and is faster than the old bounding box method. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Methods in Grid Based Meshing

Combinatorial Methods in Grid Based Meshing

引用

International Meshing Roundtable Workshop (IMR)

作者： Stromberg, Henrik Mayer-Eichberger, Valentin Lohrengel, Armin Inst Maschinenwesen Robert Koch Str 32 D-38678 Clausthal Zellerfeld Germany Inst Comp Sci Bahn 2 D-14476 Potsdam Germany

ISBN: (纸本)9783031405969;9783031405945;9783031405938

This paper describes a novel method of generating hex-dominant meshes using pre-computed optimal subdivisions of the unit cube in a grid-based approach. Our method addresses geometries that are standard in mechanical engineering and often must comply with the restrictions of subtractive manufacturability. A central component of our method is the set of subdivisions we pre-compute with Answer Set Programming. Despite being computationally expensive, we obtain optimal meshes of up to 35 nodes available to our method in a template fashion. The first step in our grid-based method generates a coarse Precursor Mesh for meshing complete parts representing the bar stock. Then, the resulting mesh is generated in a subtractive manner by inserting and fitting the pre-generated subdivisions into the Precursor Mesh. This step guarantees that the elements are of good quality. In the final stage, the mesh nodes are mapped to geometric entities of the target geometry to get an exact match. We demonstrate our method with multiple examples showing the strength of this approach. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Integrable Cross-Field Generation Based on Imposed Singularity Configuration-The 2D Manifold Case

Integrable Cross-Field Generation Based on Imposed Singulari...

引用

International Meshing Roundtable Workshop (IMR)

作者： Jezdimirovic, Jovana Chemin, Alexandre Remacle, Jean-Francois Siemens Digital Ind Software Interleuvenlaan 68 B-3001 Leuven Belgium Catholic Univ Louvain Ave Georges Lemaitre B-1348 Louvain La Neuve Belgium

ISBN: (纸本)9783031405969;9783031405945;9783031405938

This work presents the mathematical foundations for the generation of integrable cross-field on 2D manifolds based on user-imposed singularity configuration. In this paper, we either use singularities that appear naturally by solving a non-linear problem, or use as an input user-defined singularity pattern, possibly with high valence singularities that typically do not appear in cross-field computations. This singularity set is under the constraint of Abel-Jacobi’s conditions for valid singularity configurations. The main contribution of the paper is the development of a formulation that allows computing, when possible, an integrable isotropic 2D cross-field from a given set of singularities through the resolution of only two linear PDEs. To address the issue of possible suboptimal singularities’ distribution, we also present the mathematical setting for the generation of an integrable anisotropic 2D cross-field based on a user-imposed singularity pattern. The developed formulations support both an isotropic and an anisotropic block-structured quad mesh generation. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Anisotropy

来源：评论

学校读者我要写书评

暂无评论

Towards a Volume Mesh Generator Tailored for NEFEM

Towards a Volume Mesh Generator Tailored for NEFEM

引用

International Meshing Roundtable Workshop (IMR)

作者： Zou, Xi Lo, Sui Bun Sevilla, Ruben Hassan, Oubay Morgan, Kenneth Swansea Univ Zienkiewicz Inst Modelling Data & AI Fac Sci & Engn Swansea SA1 8EN W Glam Wales

ISBN: (纸本)9783031405969;9783031405945;9783031405938

The conversion of digital models from computer-aided design (CAD) to meshes for computer-aided engineering (CAE) is a well-known bottleneck, because of the amount of human intervention required in the cumbersome de-featuring process. This paper introduces the strategy to address this issue by generating the geometric-persistent volume mesh tailored for the NURBS-enhanced finite element method (NEFEM). The NEFEM has been developed to decouple the geometry representation and the numerical approximation to address this issue. NEFEM uses CAD data, the non-uniform rational B-spline (NURBS) that describe the boundary representation (B-rep), to describe the geometry of the computational domain, and it adopts polynomial shape functions for the numerical approximation of the unknown solution. The need for de-featuring is avoided by NEFEM, and the geometric error is completely removed. As a dedicated NEFEM mesh generator is crucial for problems involving complex geometries, this paper introduces the strategy devised to generate volume meshes tailored for NEFEM solvers. The proposed approach is based on previously developed NEFEM surface mesh generation method, and new requirements for validity checks are imposed for the volume mesh generation. A layer of NEFEM volume elements is firstly created, followed by the interior volume mesh which can be obtained from a standard mesh generator. The resulting mesh maintains the exact geometric B-rep, and the element sizes are fully dominated by the user-defined spacing and not by the presence of small geometric features. Examples are presented for an illustrative demonstration of the proposed technique. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Computer aided design

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共343页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：