988 resultados para Weighted Composition Operators


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Let vv be a weight sequence on ZZ and let ψ,φψ,φ be complex-valued functions on ZZ such that φ(Z)⊂Zφ(Z)⊂Z. In this paper we study the boundedness, compactness and weak compactness of weighted composition operators Cψ,φCψ,φ on predual Banach spaces c0(Z,1/v)c0(Z,1/v) and dual Banach spaces ℓ∞(Z,1/v)ℓ∞(Z,1/v) of Beurling algebras ℓ1(Z,v)ℓ1(Z,v).

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2010 Mathematics Subject Classification: 47B33, 47B38.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We completely determine the spectra of composition operators induced by linear fractional self-maps of the unit disc acting on weighted Dirichlet spaces; extending earlier results by Higdon [8] and answering the open questions in this context.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Distortion risk measures summarize the risk of a loss distribution by means of a single value. In fuzzy systems, the Ordered Weighted Averaging (OWA) and Weighted Ordered Weighted Averaging (WOWA) operators are used to aggregate a large number of fuzzy rules into a single value. We show that these concepts can be derived from the Choquet integral, and then the mathematical relationship between distortion risk measures and the OWA and WOWA operators for discrete and finite random variables is presented. This connection offers a new interpretation of distortion risk measures and, in particular, Value-at-Risk and Tail Value-at-Risk can be understood from an aggregation operator perspective. The theoretical results are illustrated in an example and the degree of orness concept is discussed.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This PhD thesis analyses networks of knowledge flows, focusing on the role of indirect ties in the knowledge transfer, knowledge accumulation and knowledge creation process. It extends and improves existing methods for mapping networks of knowledge flows in two different applications and contributes to two stream of research. To support the underlying idea of this thesis, which is finding an alternative method to rank indirect network ties to shed a new light on the dynamics of knowledge transfer, we apply Ordered Weighted Averaging (OWA) to two different network contexts. Knowledge flows in patent citation networks and a company supply chain network are analysed using Social Network Analysis (SNA) and the OWA operator. The OWA is used here for the first time (i) to rank indirect citations in patent networks, providing new insight into their role in transferring knowledge among network nodes; and to analyse a long chain of patent generations along 13 years; (ii) to rank indirect relations in a company supply chain network, to shed light on the role of indirectly connected individuals involved in the knowledge transfer and creation processes and to contribute to the literature on knowledge management in a supply chain. In doing so, indirect ties are measured and their role as means of knowledge transfer is shown. Thus, this thesis represents a first attempt to bridge the OWA and SNA fields and to show that the two methods can be used together to enrich the understanding of the role of indirectly connected nodes in a network. More specifically, the OWA scores enrich our understanding of knowledge evolution over time within complex networks. Future research can show the usefulness of OWA operator in different complex networks, such as the on-line social networks that consists of thousand of nodes.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This study surveys the ordered weighted averaging (OWA) operator literature using a citation network analysis. The main goals are the historical reconstruction of scientific development of the OWA field, the identification of the dominant direction of knowledge accumulation that emerged since the publication of the first OWA paper, and to discover the most active lines of research. The results suggest, as expected, that Yager's paper (IEEE Trans. Systems Man Cybernet, 18(1), 183-190, 1988) is the most influential paper and the starting point of all other research using OWA. Starting from his contribution, other lines of research developed and we describe them.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

We focus on kernels incorporating different kinds of prior knowledge on functions to be approximated by Kriging. A recent result on random fields with paths invariant under a group action is generalised to combinations of composition operators, and a characterisation of kernels leading to random fields with additive paths is obtained as a corollary. A discussion follows on some implications on design of experiments, and it is shown in the case of additive kernels that the so-called class of “axis designs” outperforms Latin hypercubes in terms of the IMSE criterion.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Secrecy is fundamental to computer security, but real systems often cannot avoid leaking some secret information. For this reason, the past decade has seen growing interest in quantitative theories of information flow that allow us to quantify the information being leaked. Within these theories, the system is modeled as an information-theoretic channel that specifies the probability of each output, given each input. Given a prior distribution on those inputs, entropy-like measures quantify the amount of information leakage caused by the channel. ^ This thesis presents new results in the theory of min-entropy leakage. First, we study the perspective of secrecy as a resource that is gradually consumed by a system. We explore this intuition through various models of min-entropy consumption. Next, we consider several composition operators that allow smaller systems to be combined into larger systems, and explore the extent to which the leakage of a combined system is constrained by the leakage of its constituents. Most significantly, we prove upper bounds on the leakage of a cascade of two channels, where the output of the first channel is used as input to the second. In addition, we show how to decompose a channel into a cascade of channels. ^ We also establish fundamental new results about the recently-proposed g-leakage family of measures. These results further highlight the significance of channel cascading. We prove that whenever channel A is composition refined by channel B, that is, whenever A is the cascade of B and R for some channel R, the leakage of A never exceeds that of B, regardless of the prior distribution or leakage measure (Shannon leakage, guessing entropy leakage, min-entropy leakage, or g-leakage). Moreover, we show that composition refinement is a partial order if we quotient away channel structure that is redundant with respect to leakage alone. These results are strengthened by the proof that composition refinement is the only way for one channel to never leak more than another with respect to g-leakage. Therefore, composition refinement robustly answers the question of when a channel is always at least as secure as another from a leakage point of view.^

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Wydział Matematyki i Informatyki: Zakład Teorii Interpolacji i Aproksymacji

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The relationship between the operator norms of fractional integral operators acting on weighted Lebesgue spaces and the constant of the weights is investigated. Sharp bounds are obtained for both the fractional integral operators and the associated fractional maximal functions. As an application improved Sobolev inequalities are obtained. Some of the techniques used include a sharp off-diagonal version of the extrapolation theorem of Rubio de Francia and characterizations of two-weight norm inequalities.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We characterize the essential spectra of Toeplitz operators Ta on weighted Bergman spaces with matrix-valued symbols; in particular we deal with two classes of symbols, the Douglas algebra C+H∞ and the Zhu class Q := L∞ ∩VMO∂ . In addition, for symbols in C+H∞ , we derive a formula for the index of Ta in terms of its symbol a in the scalar-valued case, while in the matrix-valued case we indicate that the standard reduction to the scalar-valued case fails to work analogously to the Hardy space case. Mathematics subject classification (2010): 47B35,