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

triangulation algorithm and program for two-dimensional domains of any shape

引用

Strength of Materials 1978年第6期10卷 700-704页

作者： Umanskii, S.E.

来源：评论

学校读者我要写书评

暂无评论

A MODIFIED triangulation algorithm TAILORED FOR THE SMOOTHED FINITE ELEMENT METHOD (S-FEM)

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL METHODS 2014年第1期11卷 1350069页

作者： Li, Y. Li, M. Liu, G. R. Taiyuan Univ Technol Coll Math Taiyuan Peoples R China Univ Cincinnati Sch Aerosp Syst Cincinnati OH 45221 USA

Meshing is one of the key tasks in using the finite element method (FEM), the smoothed finite element method (S-FEM), finite volume method (FVM), and many other discrete numerical methods. Linear triangular (T3) mesh is one of the most widely used mesh, because it can be generated and refined automatically for discrete domains of complicated geometry, and hence save significantly the time for model creation. This paper presents a modified triangulation algorithm based on the advancing front technique to provide a comprehensive linear triangular mesh generator with six connectivity lists, including element-node (Ele-N) connectivity, element-edge (Ele-Eg) connectivity, edge-node (EgN) connectivity, edge-element (Eg-Ele) connectivity, node-edge (N-Eg) connectivity and node-element (N-Ele) connectivity. These six connectivity lists are generated along the way when the T3 elements are created, and hence it is done in a most efficient fashion. The connectivity is recorded in the usual counter-clockwise convention for convenient utilization in various S-FEM models for effective analyses. In addition, an algorithm is developed for renumbering the nodes in the T3 mesh to obtain a minimized bandwidth of stiffness matrices for both FEM and S-FEM models.

关键词： Advancing front technique FEM S-FEM triangulation algorithm T3 mesh connectivity bandwidth

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approach of Convex Hull triangulation Based on Monotonic Chain

An Efficient Approach of Convex Hull Triangulation Based on ...

引用

International Conference on Information Technology and Management Innovation (ICITMI2012)

作者： Zhang, Yuping Deng, Zhaori Zhang, Ruiqi Shanghai Normal Univ Shanghai 200234 Peoples R China

ISBN: (纸本)9783037855744

The triangulation of convex hull has the characteristics of point-set and polygon triangulation. According to some relative definitions, this paper proposed a triangulation of convex hull based on a monotonic chain. This method is better than Delaunay algorithm and is more efficient than other convex polygon algorithms. It is a good algorithm.

关键词： Convex Hull Monotonic Chain triangulation algorithm Mesh Data

来源：评论

学校读者我要写书评

暂无评论

A split spectrum processing of noise-contaminated wave signals for damage identification

引用

SMART STRUCTURES AND SYSTEMS 2012年第3期10卷 253-269页

作者： Miao, X. T. Ye, Lin Li, F. C. Sun, X. W. Peng, H. K. Lu, Ye Meng, Guang Shanghai Jiao Tong Univ State Key Lab Mech Syst & Vibrat Shanghai 200240 Peoples R China Univ Sydney Sch Aerosp Mech & Mechatron Engn CAMT LSMS Sydney NSW 2006 Australia Shanghai Inst Satellite Engn Shanghai 200240 Peoples R China

A split spectrum processing (SSP) method is proposed to accurately determine the time-of-flight (ToF) of damage-scattered waves by comparing the instantaneous amplitude variation degree (IAVD) of a wave signal captured from a damage case with that from the benchmark. The fundamental symmetrical (So) mode in aluminum plates without and with a notch is assessed. The efficiency of the proposed SSP method and Hilbert transform in determining the ToF of damage-scattered So mode is evaluated for damage identification when the wave signals are severely contaminated by noise. Broadband noise can overwhelm damage-scattered wave signals in the time domain, and the Hilbert transform is only competent for determining the ToF of damage-scattered So mode in a noise-free condition. However, the calibrated IAVD of the captured wave signal is minimally affected by noise, and the proposed SSP method is capable of determining the ToF of damage-scattered So mode accurately even though the captured wave signal is severely contaminated by broadband noise, leading to the successful identification of damage (within an error on the order of the damage size) using a triangulation algorithm.

关键词： split spectrum processing (SSP) instantaneous amplitude variation degree (IAVD) time of flight (ToF) guided waves broadband noise triangulation algorithm

来源：评论

学校读者我要写书评

暂无评论

A sufficiently fast algorithm for finding close to optimal clique trees

引用

ARTIFICIAL INTELLIGENCE 2001年第1-2期125卷 3-17页

作者： Becker, A Geiger, D Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

We offer an algorithm that finds a clique tree such that the size of the largest clique is at most (2 alpha + 1)k where k is the size of the largest clique in a clique tree in which this size is minimized and or is the approximation ratio of an alpha -approximation algorithm for the 3-way vertex cut problem. When alpha = 4/3, our algorithm's complexity is O(2(4.67k)n . poly(n)) and it errs by a factor of 3.67 where poly(n) is the running time of linear programming. This algorithm is extended to find clique trees in which the state space of the largest clique is bounded. When k = O(log n), our algorithm yields a polynomial inference algorithm for Bayesian networks. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： clique tree algorithm triangulation algorithm Bayesian networks 3-way vertex cut problem

来源：评论

学校读者我要写书评

暂无评论

Variable ferry routing algorithm for sparse wireless sensor networks

引用

INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS 2016年第2-3期8卷 196-205页

作者： Tong Ning Zhang Xue Wang ChunShuang Hun Jiexu Dalian Jiaotong Univ Software Technol Inst 216 Xingfa Rd Dalian 116051 Liaoning Peoples R China Dalian Jiaotong Univ Sch Foreign Languages 794 Huanghe Rd Dalian 116028 Liaoning Peoples R China

In this paper, a ferry-based sparse wireless sensor network is considered, in which information is transferred between ferries and sensors. And a triangulation algorithm and triangular mesh colouring strategy for constructing a ferry route are presented. A moving ferry, while moving along the predetermined route, can cover the entire network, and the related theorems are presented. We propose a variable ferry routing scheme (VFR) in order to reduce the energy consumption of ferries. Through theoretical analysis, the relationship is discussed between key parameters of the system, including message generation interval, message delivery probability and the number of ferries. During the routing process, the number of active ferries is adjusted. Compared to other existing routing algorithms, the simulation results of our scheme demonstrate that VFR minimises the message delivery delay and the overhead radio. Moreover, VFR reduces the energy consumption of ferries.

关键词： wireless sensor networks WSNs ferry routing algorithm triangulation algorithm energy consumption queuing theory

来源：评论

学校读者我要写书评

暂无评论

Establishment of the Complete Closed Mesh Model of Rail-Surface Scratch Data for Online Repair

引用

SENSORS 2020年第17期20卷 4736.-4736.页

作者： Guo, Yanbin Huang, Lulu Liu, Yingbin Liu, Jun Wang, Guoping Huazhong Univ Sci & Technol Coll Life Sci & Technol Dept Biomed Engn Hubei Bioinformat & Mol Imaging Key Lab Wuhan 430074 Peoples R China Wuhan Univ Sch Power & Mech Engn Wuhan 430072 Peoples R China

Rail surface scratching occurs with increasing frequency, seriously threatening the safety of vehicles and humans. Online repair of rail-surface scratches on damaged rails with scratch depths >1 mm is of increased importance, because direct rail-replacement has the disadvantages of long operation time, high manpower and high material costs. Advanced online repair of rail-surface scratch using three-dimensional (3D) metal printing technology such as laser cladding has become an increasing trend, desperately demanding a solution for the fast and precise establishment of a complete closed mesh model of rail-surface scratch data. However, there have only been limited studies on the topic so far. In this paper, the complete closed mesh model is well established based on a novel triangulation algorithm relying on the topological features of the point-cloud model (PCM) of scratch-data, which is obtained by implementing a scratch-data-computation process following a rail-geometric-feature-fused algorithm of random sample consensus (RANSAC) performed on the full rail-surface PCM constructed by 3D laser vision. The proposed method is universal for all types of normal-speed rails in China. Experimental results show that the proposed method can accurately acquire the complete closed mesh models of scratch data of one meter of 50 Kg/m-rails within 1 min.

关键词： automatic rail-surface-scratch recognition and computation triangulation algorithm complete closed mesh model online rail-repair

来源：评论

学校读者我要写书评

暂无评论

A Flexible Facial Feature Replacement System

A Flexible Facial Feature Replacement System

引用

7th International Conference on MEMS, NANO and Smart Systems (ICMENS 2011)

作者： Yeh, Jih Pin Kao, Chen Yu Chen, Chung Yung Lin, Hwei Jen Department of Multimedia and Entertainment Science Asian-Pacific Institute of Creativity Taiwan Department of Computer Science and Information Engineering Taiwan

ISBN: (纸本)9783037853122

In this study, we propose a facial feature replacement system, which uses the triangulation algorithm to perform facial feature replacement in each segmented triangular region associated with control points. The experimental results show that our system provides quite natural composite images. In addition, the system is flexible and has no limit in the shape, size, and plane rotation of the faces which are processed.

关键词： active appearance model (AAM) triangulation algorithm facial feature pasting linear interpolation blending and seamless processing

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTATION OF ACHEAP AND PORTABLE THREE-DIMENSIONAL SCANNER SYSTEM 13

IMPLEMENTATION OF ACHEAP AND PORTABLE THREE-DIMENSIONAL SCAN...

引用

International Conference on Machine Learning and Cybernetics

作者： Chen, Haichao Huang, Quanyong Bi, Sheng Yao, Xiang Guo, Nuoya South China Univ Technol Sch Comp Sci & Engn Guangzhou 511400 Guangdong Peoples R China

ISBN: (纸本)9781479942152

A low-cost and portable three-dimensional scanner system is designed in this paper, including hardware and software systems. A common camera and a linear laser emitter are used to detect the distance of the object by using triangulation algorithm. Meanwhile, 3D point cloud data is generated. Then by using QuickHull algorithm or MeshLab software, the object's surface can be recovered. To verify the methods mentioned in this paper, a cup is measured using the scanner system. The experimental results show that the system has the following advantages: low cost, lightweight and high accuracy.

关键词： Three-dimensional scanner system triangulation algorithm Point cloud data

来源：评论

学校读者我要写书评

暂无评论

Triangulating Rebound Attack on AES-like Hashing 42nd

Triangulating Rebound Attack on AES-like Hashing

引用

42nd Annual International Cryptology Conference (CRYPTO)

作者： Dong, Xiaoyang Guo, Jian Li, Shun Pham, Phuong Tsinghua Univ Inst Adv Study BNRist Beijing Peoples R China Nanyang Technol Univ Sch Phys & Math Sci Singapore Singapore Natl Financial Cryptog Res Ctr Beijing Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China

ISBN: (纸本)9783031158018;9783031158025

The rebound attack was introduced by Mendel et al. at FSE 2009 to fulfill a heavy middle round of a differential path for free, utilizing the degree of freedom from states. The inbound phase was extended to 2 rounds by the Super-Sbox technique invented by Lamberger et al. at ASIACRYPT 2009 and Gilbert and Peyrin at FSE 2010. In ASIACRYPT 2010, Sasaki et al. further reduced the requirement of memory by introducing the non-full-active Super-Sbox. In this paper, we further develop this line of research by introducing Super-Inbound, which is able to connect multiple 1-round or 2-round (non-full-active) Super-Sbox inbound phases by utilizing fully the degrees of freedom from both states and key, yet without the use of large memory. This essentially extends the inbound phase by up to 3 rounds. We applied this technique to find classic or quantum collisions on several AES-like hash functions, and improved the attacked round number by 1 to 5 in targets including AES-128 and SKINNY hashing modes, Saturnin-Hash, and Gr Ost 1-512. To demonstrate the correctness of our attacks, the semi-free-start collision on 6-round AES-128-MMO/MP with estimated time complexity 2(24) in classical setting was implemented and an example pair was found instantly on a standard PC.

关键词： Triangulating Rebound Quantum Attack Collision Attacks Rebound Attacks triangulation algorithm Super-Inbound

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：