Results 151 to 160 of about 2,530 (205)
Discretisations of Constrained KP HierarchiesSome of the next articles are maybe not open access.
Related searches:
Related searches:
Discretised general fractional derivative
Mathematics and Computers in Simulation, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enyu Fan, Changpin Li, Martin Stynes
openaire +2 more sources
Adaptive Discretisation of Shell Problems
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 2000AbstractA seven parameter Reißner‐Mindlin shell kinematic is employed for a elastoplastic material with hardening. The resulting nonlinear minimization problem is discretised within a finite element method on the mid surface of the shell. A posteriori error estimates are discussed and related adaptive algorithms are presented.
Hecht, Axel +2 more
openaire +2 more sources
Duration discretisation for activity recognition
Technology and Health Care, 2007Activity recognition has become a key component within smart environments that aim at providing assistive solutions for their users. Learning high level activities from low level sensor data depends on several parameters, one of which is the duration of the activities themselves.
Priyanka, Chaurasia +3 more
openaire +2 more sources
2016
This paper looks at the distribution of selected adverbials used to discretise and quantify time in units of minutes, seconds and hours in reference language corpora of Polish and English. We carry out an exploratory analysis of the distributional patterns of such expressions and report three main findings.
Piotr Pęzik, Mikołaj Deckert
openaire +1 more source
This paper looks at the distribution of selected adverbials used to discretise and quantify time in units of minutes, seconds and hours in reference language corpora of Polish and English. We carry out an exploratory analysis of the distributional patterns of such expressions and report three main findings.
Piotr Pęzik, Mikołaj Deckert
openaire +1 more source
MIL: a data discretisation approach
International Journal of Data Mining, Modelling and Management, 2011Data discretisation is an important step in the process of machine learning, since it is easier for classifiers to deal with discrete attributes rather than continuous attributes. Over the years, several methods of performing discretisation such as Boolean reasoning, equal frequency binning, entropy have been proposed, explored, and implemented.
Bikash Kanti Sarkar +2 more
openaire +1 more source
Discretisation Effects in Naive Bayesian Networks
2012Naive Bayesian networks are often used for classification problems that involve variables of a continuous nature. Upon capturing such variables, their value ranges are modelled as finite sets of discrete values. While the output probabilities and conclusions established from a Bayesian network are dependent of the actual discretisations used for its ...
Bertens, R. +2 more
openaire +2 more sources
Efficient Discretisation for Link Travel Time Models
Networks and Spatial Economics, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carey, Malachy, Ge, Y. E.
openaire +1 more source
Saddle Points Under Discretisation
2017Saddle points for Euler schemes for ODEs are discussed. Numerical stable and unstable manifolds are illustrated through a set of examples, and compared to the stable and unstable manifolds of the ODEs. The shadowing phenomenon is briefly illustrated. Finally, Beyn’s Theorem is presented.
Xiaoying Han, Peter Kloeden
openaire +1 more source
Computational Biology and Chemistry, 2003
A systematic approach to the construction of finite difference formulae for the approximation to first and second derivatives with respect to space on an arbitrarily spaced grid is presented. The finite difference formulae, combined with backward implicit (BI) and extrapolation methods, are used for electrochemical simulations and tested for efficiency.
Britz, D., Strutwolf, J.
openaire +3 more sources
A systematic approach to the construction of finite difference formulae for the approximation to first and second derivatives with respect to space on an arbitrarily spaced grid is presented. The finite difference formulae, combined with backward implicit (BI) and extrapolation methods, are used for electrochemical simulations and tested for efficiency.
Britz, D., Strutwolf, J.
openaire +3 more sources