Search results for "Method"
showing 10 items of 13253 documents
Teaching and learning in consumer behavior: a class activity supporting real decision-making in cultural management
2010
Abstract Problem-based learning has been suggested as a useful tool to foster student-centered learning and increase student motivation. Students of Business Administration are not familiar with Research on Consumer Behavior, its contents and techniques, since this subject is traditionally linked to Psychology. In order to facilitate the teaching-learning process in this subject, this paper presents an application of problem-based learning in the context of Consumer Behavior. Results of this pilot experience are assessed under a qualitative and a quantitative basis. The evidence obtained allow us to conclude that this collaboration project enable students to obtain and to process informatio…
Upper Bound for the Approximation Error for the Kirchhoff-Love Arch Problem
2013
In this paper, a guaranteed and computable upper bound of approximation errors for the Kirchhoff-Love arch problem is derived. In general, it belongs to the class of functional a posteriori error estimates. The derivation method uses purely functional arguments and, therefore, the estimates are valid for any conforming approximation within the energy space. The computational implementation of the upper bound is discussed and demonstrated by a numerical example.
Importance sampling for Lambda-coalescents in the infinitely many sites model
2011
We present and discuss new importance sampling schemes for the approximate computation of the sample probability of observed genetic types in the infinitely many sites model from population genetics. More specifically, we extend the 'classical framework', where genealogies are assumed to be governed by Kingman's coalescent, to the more general class of Lambda-coalescents and develop further Hobolth et. al.'s (2008) idea of deriving importance sampling schemes based on 'compressed genetrees'. The resulting schemes extend earlier work by Griffiths and Tavar\'e (1994), Stephens and Donnelly (2000), Birkner and Blath (2008) and Hobolth et. al. (2008). We conclude with a performance comparison o…
Bounding Techniques and Their Application to Simplified Plastic Analysis of Structures
1990
In the framework of the simplified analysis methods for elastoplastic analysis problems, the bounding techniques possess an important role. A class of these techniques, based on the so-called perturbation method, are here presented with reference to finite element discretized structures. A general bounding principle is presented and its applications are illustrated by means of numerical examples.
THE TOPOLOGY OF BASIN BOUNDARIES IN A CLASS OF THREE-DIMENSIONAL DYNAMICAL SYSTEMS
1996
We will develop new methods to determine the topology of the basin boundary in a class of three-dimensional dynamical systems. One approach is to approximate the basin boundary by backward integration. Unfortunately, there are dynamical systems where it is hard to approximate the basin boundary by a numerical backward integration algorithm. We will introduce topological methods which will provide new information about the structure of the basin boundary. The topological invariants which we will use can be numerically computed.
Filtering design for two-dimensional Markovian jump systems with state-delays and deficient mode information
2014
This paper is concerned with the problem of H"~ filtering for a class of two-dimensional Markovian jump linear systems described by the Fornasini-Marchesini local state-space model. The systems under consideration are subject to state-delays and deficient mode information in the Markov chain. The description of deficient mode information is comprehensive that simultaneously includes the exactly known, partially unknown and uncertain transition probabilities. By invoking the properties of the transition probability matrix, together with the convexification of uncertain domains, a new H"~ performance analysis criterion for the filtering error system is firstly derived. Then, via some matrix i…
Approximating hidden chaotic attractors via parameter switching.
2018
In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The parameter switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration. In Refs. 1–3, it is proved that the attractors of a chaotic system, considered as the unique numerical …
A Multiplicity result for a class of strongly indefinite asymptotically linear second order systems
2010
We prove a multiplicity result for a class of strongly indefinite nonlinear second order asymptotically linear systems with Dirichlet boundary conditions. The key idea for the proof is to bring together the classical shooting method and the Maslov index of the linear Hamiltonian systems associated to the asymptotic limits of the given nonlinearity.
The linearized Calderón problem on complex manifolds
2019
International audience; In this note we show that on any compact subdomain of a Kähler manifold that admits sufficiently many global holomorphic functions , the products of harmonic functions form a complete set. This gives a positive answer to the linearized anisotropic Calderón problem on a class of complex manifolds that includes compact subdomains of Stein manifolds and sufficiently small subdomains of Kähler manifolds. Some of these manifolds do not admit limiting Carleman weights, and thus cannot by treated by standard methods for the Calderón problem in higher dimensions. The argument is based on constructing Morse holo-morphic functions with approximately prescribed critical points.…
Morphisms of certain banach C*-modules
2000
Morphisms and representations of a class of Banach C*-modules, called CQ*algebras, are considered. Together with a general method for constructing CQ*-algebras, two different ways of extending the GNS-representation are presented.