Search results for " Programming"
showing 10 items of 1616 documents
An index formula on manifolds with fibered cusp ends
2002
We consider a compact manifold whose boundary is a locally trivial fiber bundle and an associated pseudodifferential algebra that models fibered cusps at infinity. Using trace-like functionals that generate the 0-dimensional Hochschild cohomology groups, we express the index of a fully elliptic fibered cusp operator as the sum of a local contribution from the interior and a term that comes from the boundary. This answers the index problem formulated by Mazzeo and Melrose. We give a more precise answer in the case where the base of the boundary fiber bundle is the circle. In particular, for Dirac operators associated to a "product fibered cusp metric", the index is given by the integral of t…
Novel pedagogical tool for simultaneous learning of plane geometry and R programming
2018
Programming a computer is an activity that can be very beneficial to undergraduate students in terms of improving their mental capabilities, collaborative attitudes and levels of engagement in learning. Despite the initial difficulties that typically arise when learning to program, there are several well-known strategies to overcome them, providing a very high benefit-cost ratio to most of the students. Moreover, the use of a programming language usually raises the interest of students to learn any specific concept, which has caused that many teachers around the world employ a programming language as a learning environment to treat almost every possible topic. Particularly, mathematics can …
The Bishop–Phelps–Bollobás point property
2016
Abstract In this article, we study a version of the Bishop–Phelps–Bollobas property. We investigate a pair of Banach spaces ( X , Y ) such that every operator from X into Y is approximated by operators which attain their norm at the same point where the original operator almost attains its norm. In this case, we say that such a pair has the Bishop–Phelps–Bollobas point property (BPBpp). We characterize uniform smoothness in terms of BPBpp and we give some examples of pairs ( X , Y ) which have and fail this property. Some stability results are obtained about l 1 and l ∞ sums of Banach spaces and we also study this property for bilinear mappings.
Algebras of frequently hypercyclic vectors
2019
We show that the multiples of the backward shift operator on the spaces $\ell_{p}$, $1\leq p<\infty$, or $c_{0}$, when endowed with coordinatewise multiplication, do not possess frequently hypercyclic algebras. More generally, we characterize the existence of algebras of $\mathcal{A}$-hypercyclic vectors for these operators. We also show that the differentiation operator on the space of entire functions, when endowed with the Hadamard product, does not possess frequently hypercyclic algebras. On the other hand, we show that for any frequently hypercyclic operator $T$ on any Banach space, $FHC(T)$ is algebrable for a suitable product, and in some cases it is even strongly algebrable.
Isometric factorization of vector measures and applications to spaces of integrable functions
2022
Let $X$ be a Banach space, $\Sigma$ be a $\sigma$-algebra, and $m:\Sigma\to X$ be a (countably additive) vector measure. It is a well known consequence of the Davis-Figiel-Johnson-Pelczýnski factorization procedure that there exist a reflexive Banach space $Y$, a vector measure $\tilde{m}:\Sigma \to Y$ and an injective operator $J:Y \to X$ such that $m$ factors as $m=J\circ \tilde{m}$. We elaborate some theory of factoring vector measures and their integration operators with the help of the isometric version of the Davis-Figiel-Johnson-Pelczýnski factorization procedure. Along this way, we sharpen a result of Okada and Ricker that if the integration operator on $L_1(m)$ is weakly compact, t…
Existence results for parametric boundary value problems involving the mean curvature operator
2014
In this note we propose a variational approach to a parametric differential problem where a prescribed mean curvature equation is considered. In particular, without asymptotic assumptions at zero and at infinity on the potential, we obtain an explicit positive interval of parameters for which the problem under examination has at least one nontrivial and nonnegative solution.
Uncertainty evaluation in the differential measurements of power losses in a power drive system
2021
Abstract In order to guarantee a correct classification in the standardized energy efficiency classes, the current standards concerning the power drive systems prescribe that their power losses must be evaluated with great accuracy. This circumstance involves the usage of expensive measurement systems, since accurate instrumentation, skilled personnel and controlled environments are required. During the design stage of a power drive system, however, the measurement of the absolute value of its power losses is not always needed. Often, in fact, it is enough to assess the power losses variations caused by a modification of either hardware or software sections of the power drive system. In the…
Classifying efficient alternatives in SMAA using cross confidence factors
2006
Abstract Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making. These methods are based on exploring the weight space in order to describe the preferences that make each alternative the most preferred one. The main results of the analysis are rank acceptability indices, central weight vectors and confidence factors for different alternatives. The rank acceptability indices describe the variety of different preferences resulting in a certain rank for an alternative; the central weight vectors represent the typical preferences favouring each alternative; and the confidence factors measure whether the criteria data are suff…
Stochastic Multicriteria Acceptability Analysis (SMAA)
2010
Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making in problems with uncertain, imprecise or partially missing information. These methods are based on exploring the weight space in order to describe the preferences that make each alternative the most preferred one, or that would give a certain rank for a specific alternative. The main results of the analysis are rank acceptability indices, central weight vectors and confidence factors for different alternatives. The rank acceptability indices describe the variety of different preferences resulting in a certain rank for an alternative, the central weight vectors represe…
New method of grain-boundary extraction by directional optimal filtering: application to estimating creep in metals
2002
It is economically important for manufacturers of high- temperature machines to be able to measure creep so they can predict residual service life more accurately. This paper describes and refines an image analysis method for evaluating creep in laboratory test pieces. It is a preliminary study of how to extract relevant information for creep mea- surement by counting cavities. Sample preparation for quantification by image analysis is an important step determining the further development of the image analysis technique. Grain-boundary extraction, which in- volves directional information, is the major problem to be solved before measurement can be automated. The search for a crest-line extr…