Scatterplot Matrices of the Geomorphic Structure of the Mariana Trench at Four Tectonic Plates (Pacific, Philippine, Mariana and Caroline): a Geostatistical Analysis by R
Author(s)
Lemenkova , PolinaContributor(s)
Ocean University of ChinaCSC Scholarship
Institute of Geology Russian Academy of Science (RAS)
Keywords
GeostatisticsGeostatistical simulation
Geostatistical modeling
Geostatistic
Statistical analysis of geophysical data
Statistical analysis methods
Statistical analysis
R programming
R language
ACM : H.: Information Systems/H.4: INFORMATION SYSTEMS APPLICATIONS
ACM : D.: Software/D.3: PROGRAMMING LANGUAGES
ACM : I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving/I.2.3.3: Logic programming
ACM : G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS
ACM : G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.6: Linear programming
ACM : I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.2: Automatic Programming
ACM : F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming
ACM : F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic
ACM : F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES
ACM : F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages
ACM : D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.3: Language Constructs and Features
ACM : D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.2: Language Classifications/D.3.2.12: Specialized application languages
ACM : D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.0: General
ACM : D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.2: Language Classifications
ACM : H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.3: Languages
[ INFO.INFOPL ] Computer Science [cs]/Programming Languages [cs.PL]
[ STAT ] Statistics [stat]
[ INFO.INFOLO ] Computer Science [cs]/Logic in Computer Science [cs.LO]
[ INFO.INFOAU ] Computer Science [cs]/Automatic Control Engineering
[ INFO.INFOMS ] Computer Science [cs]/Mathematical Software [cs.MS]
[ INFO.INFOMO ] Computer Science [cs]/Modeling and Simulation
[ STAT.AP ] Statistics [stat]/Applications [stat.AP]
[ STAT.CO ] Statistics [stat]/Computation [stat.CO]
[ STAT.ME ] Statistics [stat]/Methodology [stat.ME]
[ STAT.TH ] Statistics [stat]/Statistics Theory [stat.TH]
[ STAT.ML ] Statistics [stat]/Machine Learning [stat.ML]
[ INFO ] Computer Science [cs]
Full record
Show full item recordOnline Access
https://hal.archivesouvertes.fr/hal02004768Abstract
International audienceDate
20190129Type
info:eurepo/semantics/conferenceObjectIdentifier
oai:HAL:hal02004768v1hal02004768
https://hal.archivesouvertes.fr/hal02004768
DOI : 10.13140/RG.2.2.15819.23845
Copyright/License
http://creativecommons.org/publicdomain/zero/1.0/Collections
Related items
Showing items related by title, author, creator and subject.

Sexuated Topology and the Suspension of Meaning: A NonHermeneutical Phenomenological Approach to Textual AnalysisBailey, Steven (20140731)This study assumes the subject's pursuit of meaning is generally incapacitating and should be suspended. It aims to demonstrate how such a suspension is theoretically accomplished by utilizing Lacan's formulae of sexuation integrated with his work in discourse theory and topology. Part I places this study into context by examining scholarship from the established fields of hermeneutics, phenomenology, (post)structuralism, aesthetic theory and psychoanalysis in order to extract out their respective theory of meaning. These theories reveal that an historical struggle with meaning has been underway since the Reformation and reaches near crisis proportions in the 20th century. On the one hand this crisis is mollified by the rise of HeideggerianGadamerian hermeneutical phenomenology which questions traditional epistemological approaches to the text using a new ontological conceptualization of meaning and a conscious rejection of methodology. On the other hand this crisis is exacerbated when the ubiquitous nature of meaning is itself challenged by (post)structuralism's discovery of the signifier which inscribes a limit to meaning, and by the domains of sense and nonsense newly opened up by aesthetic theory. These historical developments culminate in the field of psychoanalysis which most consequentially delimits a cause of meaning said to be closely linked to the core of subjectivity. Part II extends these findings by rigorously constructing out of the Lacanian sexuated formulae a decidedly nonhermeneutical phenomenological approach useful in demonstrating the sexual nature of meaning. Explicated in their static state by way of an account of their original derivation from the Aristotelian logical square, it is argued that these four formulae are relevant to basic concerns of textual theory inclusive of the hermeneutical circle of meaning. These formulae are then set into motion by integrating them with Lacan's four discourses to demonstrate the breakdown of meaning. Finally, the cuts and sutures of twodimensional space that is topology as set down in L'étourdit are performed to confirm how the very field of meaning is ultimately suspended from a nonsensical singular point known in Lacanian psychoanalysis as objet a. The contention is that by occupying this point the subject frees himself from the debilitating grip of meaning.

Investigating decomposition methods for the maximum common subgraph and sum colouring problemsGeometry Processing and Constrained Optimization (M2DisCo) ; Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS) ; Institut National des Sciences Appliquées de Lyon (INSA Lyon)  Centre National de la Recherche Scientifique (CNRS)  Université Claude Bernard Lyon 1 (UCBL)  École Centrale de Lyon (ECL)  Université Lumière  Lyon 2 (UL2)  Institut National des Sciences Appliquées de Lyon (INSA Lyon)  Centre National de la Recherche Scientifique (CNRS)  Université Claude Bernard Lyon 1 (UCBL)  École Centrale de Lyon (ECL)  Université Lumière  Lyon 2 (UL2); INSA de Lyon; Christine Solnon; ANR13BS020002, SoLStiCe, Similarités entre données localement structurées pour la vision par ordinateur(2013); MINOT, Maël (HAL CCSD, 20171219)The objective of this thesis is, from a general standpoint, to design and evaluate decomposition methods for solving constrained optimisation problems. Two optimisation problems in particular are considered: the maximum common induced subgraph problem, in which the largest common part between two graphs is to be found, and the sum colouring problem, where a graph must be coloured in a way that minimises a sum of weights induced by the employed colours.The maximum common subgraph (MCIS) problem is notably difficult, with a strong applicability in domains such as biology, chemistry and image processing, where the need to measure the similarity between structured objects represented by graphs may arise. The outstanding difficulty of this problem makes it strongly advisable to employ a decomposition method, possibly coupled with a parallelisation of the solution process. However, existing decomposition methods are not well suited to solve the MCIS problem: some lead to a poor balance between subproblems, while others, like tree decomposition, are downright inapplicable.To enable the structural decomposition of such problems, Chmeiss et al. proposed an approach, TRdecomposition, acting at a low level: the microstructure of the problem. This approach had yet to be applied to the MCIS problem. We evaluate it in this context, aiming at reducing the size of the search space while also enabling parallelisation. Moreover, we introduce a postdecomposition step that focuses on alleviating redundancies between subproblems.The second problem that caught our interest is the sum colouring problem. It is an NPhard variant of the widely known classical graph colouring problem. As in most colouring problems, it basically consists in assigning colours to the vertices of a given graph while making sure no neighbour vertices use the same colour. In the sum colouring problem, however, each colour is associated with a weight. The objective is to minimise the sum of the weights of the colours used by every vertex. This leads to generally harder instances than the classical colouring problem, which simply requires to use as few colours as possible.Only a few exact methods have been proposed for this problem. Among them stand notably a constraint programming (CP) model, a branch and bound approach, as well as an integer linear programming (ILP) model.We led an indepth investigation of CP's capabilities to solve the sum colouring problem, while also looking into ways to make it more efficient. Additionally, we evaluated a combination of integer linear programming and constraint programming, with the intention of conciliating the strong points of these highly complementary approaches. We took inspiration from the classical backtracking bounded by tree decomposition (BTD) approach. We employ a tree decomposition with a strictly bounded height. Constraint programming is used to enumerate consistent assignment of the root cluster. For each of these assignments, one subproblem is trivially obtained for each leaf cluster. Subproblems are then independently solved to optimality using ILP.We then derive profit from the complementarity of our approaches by developing a portfolio approach. The resulting solver is able to choose one of the considered approaches automatically by relying on a number of features extracted from each instance.

Information and Communication Technologies in Education, Research, and Industrial Applications [electronic resource] : 11th International Conference, ICTERI 2015, Lviv, Ukraine, May 1416, 2015, Revised Selected Papers /Yakovyna, Vitaliy.editor.; Mayr, Heinrich C.editor.; Nikitchenko, Mykola.editor.; Zholtkevych, Grygoriy.editor.; Spivakovsky, Aleksander.editor.; Batsakis, Sotiris.editor.; SpringerLink (Online service)This book constitutes the thoroughly refereed proceedings of the 11th International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications, ICTERI 2015, held in Lviv, Ukraine, in May 2015. The 9 revised full papers presented were carefully reviewed and selected from 119 submissions. The papers are grouped into two parts: ICT in education and industrial applications, and formal frameworks. .