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

An adaptable and extensible geometry kernel

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2007年第1-2期38卷 16-36页

作者： Hert, Susan Hoffmann, Michael Kettner, Lutz Pion, Sylvain Seel, Michael INRIA Sophia Antipolis F-06902 Sophia Antipolis France Serials Solut Seattle WA USA ETH Inst Theoret Comp Sci CH-8092 Zurich Switzerland Max Planck Inst Informat D-66123 Saarbrucken Germany SAP AG Walldorf Germany

Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constant-size geometric objects and operations on these representations. This paper describes how such a geometry kernel can be designed and implemented in C++, having special emphasis on adaptability, extensibility and efficiency. We achieve these goals following the generic programming paradigm and using templates as our tools. These ideas are realized and tested in CGAL, the Computational Geometry Algorithms Library, see http://***/. (c) 2007 Elsevier B.V. All rights reserved.

关键词： computational geometry software library generic programming

来源：评论

学校读者我要写书评

暂无评论

Associated type synonyms

引用

ACM SIGPLAN NOTICES 2005年第9期40卷 241-253页

作者： Chakravarty, MMT Keller, G Jones, SP Univ New S Wales Kensington NSW 2033 Australia Microsoft Res Ltd Cambridge England

Haskell programmers often use a multi-parameter type class in which one or more type parameters are functionally dependent on the first. Although such functional dependencies have proved quite popular in practice, they express the programmer's intent somewhat indirectly. Developing earlier work on associated data types, we propose to add functionally-dependent types as type synonyms to type-class bodies. These associated type synonyms constitute an interesting new alternative to explicit functional dependencies.

关键词： type classes type functions associated types type inference generic programming

来源：评论

学校读者我要写书评

暂无评论

generic downwards accumulations

引用

SCIENCE OF COMPUTER programming 2000年第1-3期37卷 37-65页

作者： Gibbons, J Oxford Brookes Univ Sch Comp & Math Sci Oxford OX3 0BP England

A downwards accumulation is a higher-order operation that distributes information downwards through a data structure, from the root towards the leaves. The concept was originally introduced in an ad hoc way for just a couple of kinds of tree. We generalize the concept to an arbitrary regular datatype;the resulting definition is co-inductive. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： trees higher-order operations accumulations scans generic programming polytypic programming corecursion

来源：评论

学校读者我要写书评

暂无评论

Distributed data structure templates for data-intensive remote sensing applications

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2013年第12期25卷 1784-1797页

作者： Ma, Yan Wang, Lizhe Liu, Dingsheng Yuan, Tao Liu, Peng Zhang, Wanfeng Chinese Acad Sci Ctr Earth Observat & Digital Earth Beijing 100864 Peoples R China Chinese Acad Sci Inst Elect Beijing 100864 Peoples R China Chinese Acad Sci Grad Univ Beijing 100864 Peoples R China

The remotely sensed images continuously acquired by satellite and airborne sensors are increasing dramatically. Remote sensing applications are overwhelmed with tons of remote sensing data with complex data structures. Efficient programming in parallel systems for data-intensive applications like massive remote sensing data processing will be a challenge. We propose a generic data-structure oriented programming template to support massive remote sensing data processing in high-performance clusters. These templates provide distributed abstractions for large remote sensing image data with complex data structure and allow these distributed data to be accessed as a global one. Through data serialization and one-sided message passing primitives provided by message passing interface, the distributed remote sensing data template whose sliced data blocks are scattered among nodes could offer a simple and effective way to distribute and communicate massive remote sensing data. Efficient parallel input/output directly to and from the distributed data structure will also be offered to address the input/output bottleneck caused by massive image data. Developers can take the advantage of our templates to program efficient parallel remote sensing algorithms without dealing with data slicing and communication through low-level message passing interface APIs. Through experiments on remote sensing applications, we confirmed that our templates were productive and efficient. Copyright (c) 2012 John Wiley & Sons, Ltd.

关键词： parallel programming generic programming data-intensive computing remote sensing image processing

来源：评论

学校读者我要写书评

暂无评论

generic Sensitivity: generics-Guided Context Sensitivity for Pointer Analysis

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2024年第5期50卷 1144-1162页

作者： Li, Haofeng Tan, Tian Li, Yue Lu, Jie Meng, Haining Cao, Liqing Huang, Yongheng Li, Lian Gao, Lin Di, Peng Lin, Liang Cui, Chenxi Chinese Acad Sci Inst Comp Technol SKLP Beijing 100049 Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Peoples R China Univ Chinese Acad Sci Beijing 101408 Peoples R China Zhongguancun Lab Beijing Peoples R China TianqiSoft Inc Beijing 100142 Peoples R China Ant Grp Hangzhou 310013 Peoples R China Alibaba Grp Beijing 100012 Peoples R China

generic programming has found widespread application in object-oriented languages like Java. However, existing context-sensitive pointer analyses fail to leverage the benefits of generic programming. This paper introduces generic sensitivity, a new context customization scheme targeting generics. We design our context customization scheme in such a way that generic instantiation sites, i.e., locations instantiating generic classes/methods with concrete types, are always preserved as key context elements. This is realized by augmenting contexts with a type variable lookup map, which is efficiently generated in a context-sensitive manner throughout the analysis process. We have implemented various variants of generic-sensitive analysis in WALA and conducted extensive experiments to compare it with state-of-the-art approaches, including both traditional and selective context-sensitivity methods. The evaluation results demonstrate that generic sensitivity effectively enhances existing context-sensitivity approaches, striking a new balance between efficiency and precision. For instance, it enables a 1-object-sensitive analysis to achieve overall better precision compared to a 2-object-sensitive analysis, with an average speedup of 12.6 times (up to 62 times).

关键词： Sensitivity Receivers Java Resource management Codes Software Benchmark testing Pointer analysis generic programming context sensitivity

来源：评论

学校读者我要写书评

暂无评论

A generic interface for parallel and adaptive discretization schemes: abstraction principles and the DUNE-FEM module

引用

COMPUTING 2010年第3-4期90卷 165-196页

作者： Dedner, Andreas Kloefkorn, Robert Nolte, Martin Ohlberger, Mario Univ Freiburg Freiburg Germany Univ Munster Munster Germany

Starting from an abstract mathematical notion of discrete function spaces and operators, we derive a general abstraction for a large class of grid-based discretization schemes for stationary and instationary partial differential equations. Special emphasis is put on concepts for local adaptivity and parallelization with dynamic load balancing. The concepts are based on a corresponding abstract definition of a parallel and hierarchical adaptive grid given in Bastian et al. (Computing 82(2-3):103-119, 2008). Based on the abstract framework, we describe an efficient object oriented implementation of a generic interface for grid-based discretization schemes that is realized in the DUNE- FEM library (http://***). By using interface classes we manage to separate functionality from data structures. Efficiency is obtained by using modern template based generic programming techniques, including static polymorphism, the engine concept, and template metaprogramming. We present numerical results for several benchmark problems and some advanced applications.

关键词： DUNE Partial differential equations Finite elements Finite volumes Discontinuous Galerkin Software Abstract interface generic programming C plus Parallelization Adaptive methods Dynamic load balancing

来源：评论

学校读者我要写书评

暂无评论

The Conditional Multiway Mapped Tree: Modeling and Analysis of Hierarchical Data Dependencies

引用

IEEE ACCESS 2020年 8卷 74083-74092页

作者： Piatkowski, Jacek Czestochowa Tech Univ Dept Comp Sci Czestochowa 42201 Poland

In many areas of scientific studies, the processed data show hierarchical dependencies and can be arranged in various tree structures. The shape of such structures depends mainly on the rules defining the ways to organize or systematize the data. Often there is a need to modify these rules many times. In the presented work, the model of the Conditional Multiway Mapped Tree (CMMTree) is proposed. This model was developed to obtain two fundamental functionalities. The first was the possibility to build any tree structures that reflect any relationships between the input data elements, assuming that the model should be able to operate on different types of data and that the node connection rules can be easily changed. The second was the ability to quickly identify the characteristic places that determine the shape of trees, including trees that can contain tens of millions of nodes, and also the ability to quickly reach precisely selected fragments of these trees. To generalize the proposed model the generic programming technique, in C & x002B;& x002B;language, was used.

关键词： Vegetation Data models programming C plus plus languages Shape Data structures Libraries Data processing data visualization information analysis tree data structures C$ plus plus $ templates generic programming

来源：评论

学校读者我要写书评

暂无评论

Associated types and constraint propagation for mainstream object-oriented generics

引用

ACM SIGPLAN NOTICES 2005年第10期40卷 1-19页

作者： Järvi, J Willcock, J Lumsdaine, A Texas A&M Univ College Stn TX 77843 USA Indiana Univ Open Syst Lab Bloomington IN 47405 USA

Support for object-oriented programming has become an integral part of mainstream languages, and more recently generic programming has gained widespread acceptance as well. A natural question is how these two paradigms, and their underlying language mechanisms, should interact. One particular design option, that of using subtyping to constrain the type parameters of generic functions, has been chosen in the generics of Java and those planned for a future revision of C#. Certain shortcomings have previously been identified in using subtyping for constraining paranietric polymorphism in the context of generic programming. To address these, we propose extending object-oriented interfaces and subtyping to include associated types and constraint propagation. Associated types are type members of interfaces and classes. Constraint propagation allows certain constraints on type parameters to be inferred from other constraints on those parameters and their use in base class type expressions. The paper demonstrates these extensions in the context of C# (with generics), describes a, translation of the extended features to C#, and presents a formalism proving their safety. The formalism is applicable to other mainstream object-oriented languages supporting F-bounded polymorphism, such as Java.

关键词： languages generics generic programming constraint propagation associated types C# Java

来源：评论

学校读者我要写书评

暂无评论

IGATOOLS: AN ISOGEOMETRIC ANALYSIS LIBRARY

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 2015年第4期37卷 C465-C496页

作者： Pauletti, M. Sebastian Martinelli, Massimiliano Cavallini, Nicola Antolin, Pablo Consejo Nacl Invest Cient & Tecn CONICET IMAL RA-3000 Santa Fe Argentina Univ Nacl Litoral RA-3000 Santa Fe Argentina CNR IMATI I-27100 Pavia Italy Scuola Int Super Studi Avanzati Trieste Italy Univ Pavia Dipartimento Ingn Civile & Architettura I-27100 Pavia Italy

We present the design of an object oriented general purpose library for isogeometric analysis, where the mathematical concepts of the isogeometric method and their relationships are directly mapped into classes and their interactions. The encapsulation of mathematical concepts into interacting building blocks gives flexibility to use the library in a wide range of scientific areas and applications. We provide a precise framework for a lot of loose, available information regarding the implementation of the isogeometric method, and also discuss the similarities and differences between this and the finite element method. We also describe how to implement this proposed design in a C++ 11 open source library, igatools (http://***). The library uses advanced object oriented and generic programming techniques to ensure reusability, reliability, and maintainability of the source code. It includes isogeometric elements of the h-div and h-curl type, and supports the development of dimension independent code (including manifolds and tensor-valued spaces). We finally present a number of code examples to illustrate the flexibility and power of the library, including surface domains, nonlinear elasticity, and Navier-Stokes computations on nontrivial geometries.

关键词： isogeometric analysis software library open source object oriented generic programming dimension independent B-splines NURBS h div h curl CAD integration

来源：评论

学校读者我要写书评

暂无评论

Indexed induction-recursion

引用

JOURNAL OF LOGIC AND ALGEBRAIC programming 2006年第1期66卷 1-49页

作者： Dybjer, P Setzer, A Chalmers Univ Technol Dept Comp Sci & Engn S-41296 Gothenburg Sweden Univ Wales Swansea Dept Comp Sci Swansea SA2 8PP W Glam Wales

An indexed inductive definition (IID) is a simultaneous inductive definition of an indexed family of sets. An inductive-recursive definition (IRD) is a Simultaneous inductive definition of a set and a recursive definition of a function on that set. An indexed inductive-recursive definition (IIRD) is it combination of both. We present a closed theory which allows Lis to introduce all IIRD in a natural way without Much encoding. By specialising it we also get a closed theory of IID. Our theory of IIRD includes essentially all definitions of sets which Occur in Martin-Lof type theory. We show in particular that Martin-Lof's computability predicates for dependent types and Palmgren's higher order universes are special kinds of IIRD and thereby clarify why they are constructively acceptable notions. We give two axiomatisations. The first formalises a principle for introducing meaningful IIRD by using the data-construct in the original version of the proof assistant Agda for Martin-Lof type theory. The second one admits a more general form of introduction rule, including the introduction rule for the intensional identity relation, which is not covered by the first axiomatisation. If we add an extensional identity relation to our logical framework, we show that the theories of restricted and general IIRD are equivalent by interpreting them in each other. Finally, we show the consistency of our theories by constructing a model in classical set theory extended by a Mahlo cardinal. (c) 2005 Elsevier Inc. All rights reserved.

关键词： dependent type theory Martin-Lof type theory inductive definitions inductive-recursive definitions inductive families initial algebras normalisation proofs generic programming

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：