30 research outputs found

    The Expressive Power of CSP-Quantifiers

    Get PDF
    A generalized quantifier QK is called a CSP-quantifier if its defining class K consists of all structures that can be homomorphically mapped to a fixed finite template structure. For all positive integers n ≥ 2 and k, we define a pebble game that characterizes equivalence of structures with respect to the logic Lk∞ω(CSP+n ), where CSP+n is the union of the class Q1 of all unary quantifiers and the class CSPn of all CSP-quantifiers with template structures that have at most n elements. Using these games we prove that for every n ≥ 2 there exists a CSP-quantifier with template of size n + 1 which is not definable in Lω∞ω(CSP+n ). The proof of this result is based on a new variation of the well-known Cai-Fürer-Immerman construction.publishedVersionPeer reviewe

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum

    Correct Optimized GPU Programs

    Get PDF

    Multiscale derivation, analysis and simulation of collective dynamics models: geometrical aspects and applications

    Get PDF
    This thesis is a contribution to the study of swarming phenomena from the point of view of mathematical kinetic theory. This multiscale approach starts from stochastic individual based (or particle) models and aims at the derivation of partial differential equation models on statistical quantities when the number of particles tends to infinity. This latter class of models is better suited for mathematical analysis in order to reveal and explain large-scale emerging phenomena observed in various biological systems such as flocks of birds or swarms of bacteria. Within this objective, a large part of this thesis is dedicated to the study of a body-attitude coordination model and, through this example, of the influence of geometry on self-organisation. The first part of the thesis deals with the rigorous derivation of partial differential equation models from particle systems with mean-field interactions. After a review of the literature, in particular on the notion of propagation of chaos, a rigorous convergence result is proved for a large class of geometrically enriched piecewise deterministic particle models towards local BGK-type equations. In addition, the method developed is applied to the design and analysis of a new particle-based algorithm for sampling. This first part also addresses the question of the efficient simulation of particle systems using recent GPU routines. The second part of the thesis is devoted to kinetic and fluid models for body-oriented particles. The kinetic model is rigorously derived as the mean-field limit of a particle system. In the spatially homogeneous case, a phase transition phenomenon is investigated which discriminates, depending on the parameters of the model, between a “disordered” dynamics and a self-organised “ordered” dynamics. The fluid (or macroscopic) model was derived as the hydrodynamic limit of the kinetic model a few years ago by Degond et al. The analytical and numerical study of this model reveal the existence of new self-organised phenomena which are confirmed and quantified using particle simulations. Finally a generalisation of this model in arbitrary dimension is presented.Open Acces

    Programming Languages and Systems

    Get PDF
    This open access book constitutes the proceedings of the 31st European Symposium on Programming, ESOP 2022, which was held during April 5-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 21 regular papers presented in this volume were carefully reviewed and selected from 64 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems

    CLADAG 2021 BOOK OF ABSTRACTS AND SHORT PAPERS

    Get PDF
    The book collects the short papers presented at the 13th Scientific Meeting of the Classification and Data Analysis Group (CLADAG) of the Italian Statistical Society (SIS). The meeting has been organized by the Department of Statistics, Computer Science and Applications of the University of Florence, under the auspices of the Italian Statistical Society and the International Federation of Classification Societies (IFCS). CLADAG is a member of the IFCS, a federation of national, regional, and linguistically-based classification societies. It is a non-profit, non-political scientific organization, whose aims are to further classification research

    Intelligent Systems

    Get PDF
    This book is dedicated to intelligent systems of broad-spectrum application, such as personal and social biosafety or use of intelligent sensory micro-nanosystems such as "e-nose", "e-tongue" and "e-eye". In addition to that, effective acquiring information, knowledge management and improved knowledge transfer in any media, as well as modeling its information content using meta-and hyper heuristics and semantic reasoning all benefit from the systems covered in this book. Intelligent systems can also be applied in education and generating the intelligent distributed eLearning architecture, as well as in a large number of technical fields, such as industrial design, manufacturing and utilization, e.g., in precision agriculture, cartography, electric power distribution systems, intelligent building management systems, drilling operations etc. Furthermore, decision making using fuzzy logic models, computational recognition of comprehension uncertainty and the joint synthesis of goals and means of intelligent behavior biosystems, as well as diagnostic and human support in the healthcare environment have also been made easier

    Abstraction Raising in General-Purpose Compilers

    Get PDF

    From constraint programming to heterogeneous parallelism

    Get PDF
    The scaling limitations of multi-core processor development have led to a diversification of the processor cores used within individual computers. Heterogeneous computing has become widespread, involving the cooperation of several structurally different processor cores. Central processor (CPU) cores are most frequently complemented with graphics processors (GPUs), which despite their name are suitable for many highly parallel computations besides computer graphics. Furthermore, deep learning accelerators are rapidly gaining relevance. Many applications could profit from heterogeneous computing but are held back by the surrounding software ecosystems. Heterogeneous systems are a challenge for compilers in particular, which usually target only the increasingly marginalised homogeneous CPU cores. Therefore, heterogeneous acceleration is primarily accessible via libraries and domain-specific languages (DSLs), requiring application rewrites and resulting in vendor lock-in. This thesis presents a compiler method for automatically targeting heterogeneous hardware from existing sequential C/C++ source code. A new constraint programming method enables the declarative specification and automatic detection of computational idioms within compiler intermediate representation code. Examples of computational idioms are stencils, reductions, and linear algebra. Computational idioms denote algorithmic structures that commonly occur in performance-critical loops. Consequently, well-designed accelerator DSLs and libraries support computational idioms with their programming models and function interfaces. The detection of computational idioms in their middle end enables compilers to incorporate DSL and library backends for code generation. These backends leverage domain knowledge for the efficient utilisation of heterogeneous hardware. The constraint programming methodology is first derived on an abstract model and then implemented as an extension to LLVM. Two constraint programming languages are designed to target this implementation: the Compiler Analysis Description Language (CAnDL), and the extended Idiom Detection Language (IDL). These languages are evaluated on a range of different compiler problems, culminating in a complete heterogeneous acceleration pipeline integrated with the Clang C/C++ compiler. This pipeline was evaluated on the established benchmark collections NPB and Parboil. The approach was applicable to 10 of the benchmark programs, resulting in significant speedups from 1.26× on “histo” to 275× on “sgemm” when starting from sequential baseline versions. In summary, this thesis shows that the automatic recognition of computational idioms during compilation enables the heterogeneous acceleration of sequential C/C++ programs. Moreover, the declarative specification of computational idioms is derived in novel declarative programming languages, and it is demonstrated that constraint programming on Single Static Assignment intermediate code is a suitable method for their automatic detection
    corecore