Results 111 to 120 of about 3,203 (298)

Linear approximation of planar spatial databases using transitive-closure logic [PDF]

, 2000
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate linear approximations of spatial databases and study in which language they can ...
Kuijpers, Bart, Geerts, Floris, Bart Kuijpers, Floris Geerts   +3 more
core   +1 more source

A tutorial on Bayesian model averaging for exponential random graph models

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract The use of exponential random graph models (ERGMs) is becoming prevalent in psychology due to their ability to explain and predict the formation of edges between vertices in a network. Valid inference with ERGMs requires correctly specifying endogenous and exogenous effects as network statistics, guided by theory, to represent the network ...
Ihnwhi Heo, Jan‐Willem Simons, Haiyan Liu   +2 more
wiley   +1 more source

Hesitant fuzzy relations and their transitive closure [PDF]

, 2016
Hesitant fuzzy relations and some of their operations are defined. A first definition of T-transitive property and its closure is defined.Peer ReviewedPostprint (author's final ...
Recasens Ferrés, Jorge, Garmendia Salvador, Luis, González del Campo, Ramón   +2 more
core   +2 more sources

Algebras of Binary Formulas for Weakly Circularly Minimal Theories: Monotonic-to-left Case

Известия Иркутского государственного университета: Серия "Математика"
This article concerns the notion of weak circular minimality beinga variant of o-minimality for circularly ordered structures. Algebras of binary isolating formulas are studied for $\aleph_0$-categorical 1-transitive non-primitive weakly circularly ...
A.B. Altayeva, B.Sh. Kulpeshov
doaj   +1 more source

Accelerating transitive closure of large-scale sparse graphs [PDF]

, 2020
Finding the transitive closure of a graph is a fundamental graph problem where another graph is obtained in which an edge exists between two nodes if and only if there is a path in our graph from one node to the other.
Patel, Sanyamee Milindkumar
core   +1 more source

An extension of the basic local independence model to multiple observed classifications

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract The basic local independence model (BLIM) is appropriate in situations where populations do not differ in the probabilities of the knowledge states and the probabilities of careless errors and lucky guesses of the items. In some situations, this is not the case. This work introduces the multiple observed classification local independence model
Pasquale Anselmi, Debora de Chiusole, Egidio Robusto, Alice Bacherini, Giulia Balboni, Andrea Brancaccio, Ottavia M. Epifania, Noemi Mazzoni, Luca Stefanutti   +8 more
wiley   +1 more source

To vary or not to vary: A flexible empirical Bayes factor for testing variance components

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract Random effects are the gold standard for capturing structural heterogeneity, such as individual differences or temporal dependence. Yet testing their presence is difficult because variance components are constrained to be non‐negative, creating a boundary problem. This paper introduces a flexible empirical Bayes factor (EBF) for testing random
Fabio Vieira, Hongwei Zhao, Joris Mulder
wiley   +1 more source

Connections between the basic local independence model and true and error models in the study of preference

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract Two classes of probabilistic models are compared: the true and error (TE) type models and models in the family of the basic local independence model (BLIM). The former finds applications in the study of human preference, whereas the latter has been developed within the theory of knowledge structures with the aim of producing knowledge ...
Luca Stefanutti, Andrea Brancaccio, Debora de Chiusole   +2 more
wiley   +1 more source

TC: Optimizing compiler

SoftwareX
In scientific codes, particularly those used in simulations, the majority of execution time is consumed by the processing of program loops. However, the ordering of statement instances constituting a loop nest, which arises from its naive, typically hand-
Piotr Skotnicki
doaj   +1 more source

Volume Quantization with Flexible Singularities for Hexahedral Meshing

Computer Graphics Forum, EarlyView.
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley   +1 more source