Search results for "Complete"
showing 10 items of 490 documents
Modeling Spatial Data Pooled over Time: Schematic Representation and Monte Carlo Evidences
2015
The spatial autocorrelation issue is now well established, and it is almost impossible to deal with spatial data without considering this reality. In addition, recent developments have been devoted to developing methods that deal with spatial autocorrelation in panel data. However, little effort has been devoted to dealing with spatial data (cross-section) pooled over time. This paper endeavours to bridge the gap between the theoretical modeling development and the application based on spatial data pooled over time. The paper presents a schematic representation of how spatial links can be expressed, depending on the nature of the variable, when combining the spatial multidirectional relatio…
The spatial pattern of a forest ecosystem
1998
Abstract Statistical analysis of stands of trees as a whole need suitable methods of spatial statistics. Obviously, trees within a stand affect development and survival of their neighbours. They interact and therefore have to be considered as a system of dependent random variates from an unknown stochastic process. One such statistical model which considers the spatial dependence among trees in a forest and their characteristics is a marked point process. The `points', called events in spatial statistics, are the tree positions and the `marks' are tree characteristics such as crown lengths or tree species. A minimal prerequisite for any serious attempt to model an observed pattern is to tes…
K4-free Graphs as a Free Algebra
2017
International audience; Graphs of treewidth at most two are the ones excluding the clique with four vertices (K4) as a minor, or equivalently, the graphs whose biconnected components are series-parallel. We turn those graphs into a finitely presented free algebra, answering positively a question by Courcelle and Engelfriet, in the case of treewidth two. First we propose a syntax for denoting these graphs: in addition to parallel composition and series composition, it suffices to consider the neutral elements of those operations and a unary transpose operation. Then we give a finite equational presentation and we prove it complete: two terms from the syntax are congruent if and only if they …
Learning with belief levels
2008
AbstractWe study learning of predicate logics formulas from “elementary facts,” i.e. from the values of the predicates in the given model. Several models of learning are considered, but most of our attention is paid to learning with belief levels. We propose an axiom system which describes what we consider to be a human scientist's natural behavior when trying to explore these elementary facts. It is proved that no such system can be complete. However we believe that our axiom system is “practically” complete. Theorems presented in the paper in some sense confirm our hypothesis.
Completeness and timeliness: Cancer registries could/should improve their performance.
2015
Abstract Cancer registries must provide complete and reliable incidence information with the shortest possible delay for use in studies such as comparability, clustering, cancer in the elderly and adequacy of cancer surveillance. Methods of varying complexity are available to registries for monitoring completeness and timeliness. We wished to know which methods are currently in use among cancer registries, and to compare the results of our findings to those of a survey carried out in 2006. Methods In the framework of the EUROCOURSE project, and to prepare cancer registries for participation in the ERA-net scheme, we launched a survey on the methods used to assess completeness, and also on t…
Multistate active spaces from local CAS-SCF molecular orbitals: the photodissociation of HFCO as an example.
2005
A recently developed algorithm to generate localized molecular orbitals (LMO) is applied to the study of excited states along a photodissociation process. The LMOs allow for the selection of a consistent complete active space (CAS) for the simultaneous description of all the electronic states involved in a multistate process on the basis of simple chemical criteria. The local nature of the orbitals is used to label them in a unique way that does not depend on the molecular geometry. The selection of the electronic configurations of interest for the set of target states on only the basis of the dominant excitations required by the simplest configuration interaction (CI) descriptions for both…
Vertical spectrum of the C2H 2+ system. An open shell (SC)2-CAS-SDCI study
2003
The open shell (SC)(2)-CAS-SDCI method along with a basis set of atomic natural orbitals (ANO) has been applied for calculating the main ionization potentials of acetylene, as well as the manifold of excited states of the different symmetries up to 32 eV. In this method, the single and double excitations of a CAS space are generated and the corresponding CI matrix is corrected by means of the (SC)(2) procedure that cancels the size-extensivity error and adds some high order contributions. The mean absolute error for the outer-valence X (2)Pi(u)(1pi(u) (-1)), A (2)Sigma(g) (+)(3sigma(g) (-1)), and B (2)Sigma(u) (+)(2sigma(u) (-1)) states, and the inner-valence C (2)Sigma(g) (+)(2sigma(g) (-1…
State-specific multireference coupled-cluster theory
2012
The multireference problem is considered one of the great challenges in coupled-cluster (CC) theory. Most recent developments are based on state-specific approaches, which focus on a single state and avoid some of the numerical problems of more general approaches. We review various state-of-the-art methods, including Mukherjee's state-specific multireference coupled-cluster (Mk-MRCC) theory, multireference Brillouin–Wigner coupled-cluster (MR-BWCC) theory, the MRexpT method, and internally contracted multireference coupled-cluster (ic-MRCC) theory. Related methods such as extended single-reference schemes [e.g., the complete active space coupled-cluster (CASCC) theory] and canonical transfo…
Automatic construction of test sets: Theoretical approach
2005
We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…
Two Parallel Algorithms for the Analysis of Random Images
1988
Aim of the paper is to show a computational paradigm, that reduces some algorithms on undirected graphs into image analysis algorithms. In particular two parallel algorithms on undirected weighted graphs, often used in the analysis of sparse images, are described.