Results 301 to 310 of about 597,748 (343)
Some of the next articles are maybe not open access.
2020
In this chapter some basic concepts of the finite element method are illustrated by solving basic discrete systems built from springs and bars. Generation of element stiffness matrix and assembly for the global system is performed. First basic steps on finite element programs are described.
Ferreira A. J. M., Fantuzzi N.
openaire +1 more source
In this chapter some basic concepts of the finite element method are illustrated by solving basic discrete systems built from springs and bars. Generation of element stiffness matrix and assembly for the global system is performed. First basic steps on finite element programs are described.
Ferreira A. J. M., Fantuzzi N.
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
Discrete Time, Discrete Frequency
2021This chapter is dedicated to exploring a form of the Fourier transform that can be applied to digital waveforms, the discrete Fourier transform (DFT). The theory is introduced and discussed as a modification to the continuous-time transform, alongside the concept of windowing in the time domain.
openaire +1 more source
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
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
Journal of Knot Theory and Its Ramifications, 2002
A method for representing knots by means of a chain code is presented. Knots which are digitalized and represented by the orthogonal direction change chain code are called discrete knots. Discrete knots are composed of constant straight-line segments using only orthogonal directions. The chain elements represent the orthogonal direction changes of the
openaire +1 more source
A method for representing knots by means of a chain code is presented. Knots which are digitalized and represented by the orthogonal direction change chain code are called discrete knots. Discrete knots are composed of constant straight-line segments using only orthogonal directions. The chain elements represent the orthogonal direction changes of the
openaire +1 more source
Journal of Mathematical Sciences, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Danilov, V. I., Koshevoj, G. A.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Danilov, V. I., Koshevoj, G. A.
openaire +1 more source
Superconsistent Discretizations
Journal of Scientific Computing, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Neural Computation, 2017
Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions.
Exarchakis, Georgios, Lücke, Jörg
openaire +3 more sources
Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions.
Exarchakis, Georgios, Lücke, Jörg
openaire +3 more sources
2019
Discretionary judgement-defined as the freedom to decide how to act within controlled limits-is increasingly being exercised in teams and networks. We introduce the notion of collective discretionary room to emphasize this relational nature of discretionary judgement.
Rutz, S., de Bont, A.
openaire +1 more source
Discretionary judgement-defined as the freedom to decide how to act within controlled limits-is increasingly being exercised in teams and networks. We introduce the notion of collective discretionary room to emphasize this relational nature of discretionary judgement.
Rutz, S., de Bont, A.
openaire +1 more source