Results 271 to 280 of about 971,440 (314)
Some of the next articles are maybe not open access.
IEEE Transactions on Fuzzy Systems, 2006
We define discrete copulas on a grid of the unit square and show that with each discrete copula there is associated, in a natural way, a bistochastic matrix. This is used in order to introduce the product of discrete copulas. Discrete copulas of order n are the smallest convex set containing the irreducible discrete copulas of order n introduced by ...
KOLESAROVA A +3 more
openaire +2 more sources
We define discrete copulas on a grid of the unit square and show that with each discrete copula there is associated, in a natural way, a bistochastic matrix. This is used in order to introduce the product of discrete copulas. Discrete copulas of order n are the smallest convex set containing the irreducible discrete copulas of order n introduced by ...
KOLESAROVA A +3 more
openaire +2 more sources
SIAM Journal on Mathematical Analysis, 1992
Summary: A discrete family of wavelets consisting of discrete functionals in a Sobolev space is studied. It is shown that they form a complete orthonormal system in \(H^{-s}\), \(s>{1\over 2}\), generated by a single ``mother functional''. Closed form expressions are derived in certain cases.
openaire +1 more source
Summary: A discrete family of wavelets consisting of discrete functionals in a Sobolev space is studied. It is shown that they form a complete orthonormal system in \(H^{-s}\), \(s>{1\over 2}\), generated by a single ``mother functional''. Closed form expressions are derived in certain cases.
openaire +1 more source
Discrete Sets and Discrete Maps
Canadian Mathematical Bulletin, 1982AbstractA subset of a topological space is called discrete iff every point in the space has a neighborhood which meets the set in at most one point. Discrete sets are useful for decomposing the images of certain maps and for generalizing closed maps. All discrete sets are closed iff the space is T1.
openaire +1 more source
Superconsistent Discretizations
Journal of Scientific Computing, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Minds and Machines, 2001
Summary: I argue that dynamicism does not provide a convincing alternative to currently available cognitive theories. First, I show that the attractor dynamics of dynamicist models are inadequate for accounting for high-level cognition. Second, I argue that dynamicist arguments for the rejection of computation and representation are unsound in light of
openaire +1 more source
Summary: I argue that dynamicism does not provide a convincing alternative to currently available cognitive theories. First, I show that the attractor dynamics of dynamicist models are inadequate for accounting for high-level cognition. Second, I argue that dynamicist arguments for the rejection of computation and representation are unsound in light of
openaire +1 more source
Discrete and Discretized Structures
2020This chapter begins by identifying four possible states or situations: continuous systems (state 1) modeled in discrete form (state 2), and naturally discrete systems (state 3) modeled in continuous form (state 4). We refer to state 2 as a discretized state whereas state 4 is referred to as a homogenized state.
openaire +1 more source
Discrete gradients in discrete classical mechanics
International Journal of Theoretical Physics, 1987A simple model of discrete classical mechanics is given where, starting from the continuous Hamilton equations, discrete equations of motion are established together with a proper discrete gradient definition. The conservation laws of the total discrete momentum, angular momentum, and energy are demonstrated.
openaire +3 more sources
DISCRETE AND QUASI-DISCRETE MODULES
Communications in Algebra, 2002ABSTRACT We show that discrete and quasi-discrete modules can be characterized in terms of the lifting of homomorphisms from to , for certain submodules of . We prove that is quasi-discrete iff is amply supplemented and satisfies for every positive integer and; is discrete iff is lifting and satisfies for every positive integer .
openaire +1 more source
Oberwolfach Reports, 2006
Discrete Geometry deals with the structure and complexity of discrete geometric objects ranging from finite point sets in the plane to more complex structures like arrangements of n -dimensional convex bodies.
Martin Henk, Jiří Matoušek, Emo Welzl
openaire +1 more source
Discrete Geometry deals with the structure and complexity of discrete geometric objects ranging from finite point sets in the plane to more complex structures like arrangements of n -dimensional convex bodies.
Martin Henk, Jiří Matoušek, Emo Welzl
openaire +1 more source