Large-scale Geometric Data Decomposition, Processing and Structured Mesh Generation

Mesh generation is a fundamental and critical problem in geometric data modeling and processing. In most scientific and engineering tasks that involve numerical computations and simulations on 2D/3D regions or on curved geometric objects, discretizing or approximating the geometric data using a polygonal or polyhedral meshes is always the first step of the procedure. The quality of this tessellation often dictates the subsequent computation accuracy, efficiency, and numerical stability. When compared with unstructured meshes, the structured meshes are favored in many scientific/engineering tasks due to their good properties. However, generating high-quality structured mesh remains challenging, especially for complex or large-scale geometric data. In industrial Computer-aided Design/Engineering (CAD/CAE) pipelines, the geometry processing to create a desirable structural mesh of the complex model is the most costly step. This step is semi-manual, and often takes up to several weeks to finish. Several technical challenges remains unsolved in existing structured mesh generation techniques. This dissertation studies the effective generation of structural mesh on large and complex geometric data. We study a general geometric computation paradigm to solve this problem via model partitioning and divide-and-conquer. To apply effective divide-and-conquer, we study two key technical components: the shape decomposition in the divide stage, and the structured meshing in the conquer stage. We test our algorithm on vairous data set, the results demonstrate the efficiency and effectiveness of our framework. The comparisons also show our algorithm outperforms existing partitioning methods in final meshing quality. We also show our pipeline scales up efficiently on HPC environment

Another Look at the Cost of Cryptographic Attacks

This paper makes the case for considering the cost of cryptographic attacks as the main measure of their efficiency, instead of their time complexity. This allows, in our opinion, a more realistic assessment of the "risk" these attacks represent. This is half-and-half a position and a technical paper. Cryptographic attacks described in the literature are rarely implemented. Most exist only "on paper", and their main characteristic is that their estimated time complexity is small enough to break a given security property. However, when a cryptanalyst actually considers implementing an attack, she soon realizes that there is more to the story than time complexity. For instance, Wiener has shown that breaking the double-DES costs 2 6n/5 , asymptotically more than exhaustive search on n bits. We put forward the asymptotic cost of cryptographic attacks as a measure of their practicality. We discuss the shortcomings of the usual computational model and propose a simple abstract cryptographic machine on which it is easy to estimate the cost. We then study the asymptotic cost of several relevant algorithm: collision search, the three-list birthday problem (3XOR) and solving multivariate quadratic polynomial equations. We find that some smart algorithms cost much more than what their time complexity suggest, while naive and simple algorithms may cost less. Some algorithms can be tuned to reduce their cost (this increases their time complexity). Foreword A celebrated High Performance Computing paper entitled "Hitting the Memory Wall: Implications of the Obvious" [47] opens with these words: This brief note points out something obvious-something the authors "knew" without really understanding. With apologies to those who did understand, we offer it to those others who, like us, missed the point. We would like to do the same-but this note is not so short

Symmetric Tori connected Torus Network

A Symmetric Tori connected Torus Network (STTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we present the architecture of the STTN, addressing of node, routing of message, and evaluate the static network performance of STTN, TTN, TESH, mesh, and torus networks. It is shown that the STTN possesses several attractive features, including constant degree, small diameter, low cost, small average distance, moderate bisection width, and high fault tolerant performance than that of other conventional and hierarchical interconnection networks

Analyse de forme appliquée à des modèles CAO B-Rep pour extraire des symétries locales et globales

Symmetry properties of objects described as B-Rep CAD models are analyzed locally as well as globally through an approach of type divide-and-conquer. The boundary of the object is defined using canonical surfaces frequently used when shaping mechanical components. Then, the first phase consists in generating maximal faces and edges that are independent from the object modelling process but that preserve its symmetry properties. These faces and edges form infinite sets of points that are processed globally. The second phase is the division one that creates candidate symmetry planes and axes attached to the previous maximal edges and faces. Finally, comes the propagation step of these candidate symmetry planes and axes forming the conquer phase that determines the local as well as the global symmetries of the object while characterizing its asymmetric areas.Les propriétés de symétrie d'un objet représenté sous la forme d'un modèle B-Rep CAO sont analysées localement et globalement à travers une approche de type diviser pour conquérir. La surface frontière de l'objet est décrite à partir de surfaces canoniques fréquemment utilisées dans les formes de composants mécaniques. La première phase de l'analyse consiste en la génération de faces et d'arêtes maximales indépendantes du processus de modélisation de l'objet mais préservant ses propriétés de symétrie. Ces faces et arêtes constituent des ensembles infinis de points traités globalement. La seconde phase est l'étape de division consistant en la création de plan et axes de symétrie de candidats pour les faces et arêtes maximales générées précédemment. Enfin, suit l'étape de propagation de ces plans et axes de symétrie représentant la phase de conquête et déterminant les propriétés de symétrie locales et globales de l'objet et caractérisant ses zones non-symétriques