864 resultados para Lipschitz aggregation operators
Resumo:
We introduce the notion of Lipschitz compact (weakly compact, finite-rank, approximable) operators from a pointed metric space X into a Banach space E. We prove that every strongly Lipschitz p-nuclear operator is Lipschitz compact and every strongly Lipschitz p-integral operator is Lipschitz weakly compact. A theory of Lipschitz compact (weakly compact, finite-rank) operators which closely parallels the theory for linear operators is developed. In terms of the Lipschitz transpose map of a Lipschitz operator, we state Lipschitz versions of Schauder type theorems on the (weak) compactness of the adjoint of a (weakly) compact linear operator.
Resumo:
The web is continuously evolving into a collection of many data, which results in the interest to collect and merge these data in a meaningful way. Based on that web data, this paper describes the building of an ontology resting on fuzzy clustering techniques. Through continual harvesting folksonomies by web agents, an entire automatic fuzzy grassroots ontology is built. This self-updating ontology can then be used for several practical applications in fields such as web structuring, web searching and web knowledge visualization.A potential application for online reputation analysis, added value and possible future studies are discussed in the conclusion.
Composition operators, Aleksandrov measures and value distribution of analytic maps in the unit disc
Resumo:
A composition operator is a linear operator that precomposes any given function with another function, which is held fixed and called the symbol of the composition operator. This dissertation studies such operators and questions related to their theory in the case when the functions to be composed are analytic in the unit disc of the complex plane. Thus the subject of the dissertation lies at the intersection of analytic function theory and operator theory. The work contains three research articles. The first article is concerned with the value distribution of analytic functions. In the literature there are two different conditions which characterize when a composition operator is compact on the Hardy spaces of the unit disc. One condition is in terms of the classical Nevanlinna counting function, defined inside the disc, and the other condition involves a family of certain measures called the Aleksandrov (or Clark) measures and supported on the boundary of the disc. The article explains the connection between these two approaches from a function-theoretic point of view. It is shown that the Aleksandrov measures can be interpreted as kinds of boundary limits of the Nevanlinna counting function as one approaches the boundary from within the disc. The other two articles investigate the compactness properties of the difference of two composition operators, which is beneficial for understanding the structure of the set of all composition operators. The second article considers this question on the Hardy and related spaces of the disc, and employs Aleksandrov measures as its main tool. The results obtained generalize those existing for the case of a single composition operator. However, there are some peculiarities which do not occur in the theory of a single operator. The third article studies the compactness of the difference operator on the Bloch and Lipschitz spaces, improving and extending results given in the previous literature. Moreover, in this connection one obtains a general result which characterizes the compactness and weak compactness of the difference of two weighted composition operators on certain weighted Hardy-type spaces.
Resumo:
I.Wood: Maximal Lp-regularity for the Laplacian on Lipschitz domains, Math. Z., 255, 4 (2007), 855-875.
Resumo:
Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsistency and deal-ing with uncertainty. They often result in a possibilistic knowledge base which is a set of weighted formulas. Although possibilistic logic is inconsistency tolerant, it suffers from the well-known "drowning effect". Therefore, we may still want to obtain a consistent possibilistic knowledge base as the result of merging. In such a case, we argue that it is not always necessary to keep weighted information after merging. In this paper, we define a merging operator that maps a set of possibilistic knowledge bases and a formula representing the integrity constraints to a classical knowledge base by using lexicographic ordering. We show that it satisfies nine postulates that generalize basic postulates for propositional merging given in [11]. These postulates capture the principle of minimal change in some sense. We then provide an algorithm for generating the resulting knowledge base of our merging operator. Finally, we discuss the compatibility of our merging operator with propositional merging and establish the advantage of our merging operator over existing semantic merging operators in the propositional case.
Resumo:
Grid operators and electricity retailers in Ireland manage peak demand, power system balancing and grid congestion by offering relevant incentives to consumers to reduce or shift their load. The need for active consumers in the home using smart appliances has never been greater, due to increased variable renewable generation and grid constraints. In this paper an aggregated model of a single compressor fridge-freezer population is developed. A price control strategy is examined to quantify and value demand response savings during a representative winter and summer week for Ireland in 2020. The results show an average reduction in fridge-freezer operating cost of 8.2% during winter and significantly lower during summer in Ireland. A peak reduction of at least 68% of the average winter refrigeration load is achieved consistently during the week analysed using a staggering control mode. An analysis of the current ancillary service payments confirms that these are insufficient to ensure widespread uptake by the small consumer, and new mechanisms need to be developed to make becoming an active consumer attractive. Demand response is proposed as a new ancillary service called ramping capability, as the need for this service will increase with more renewable energy penetration on the power system.
Resumo:
The implementation of competitive electricity markets has changed the consumers’ and distributed generation position power systems operation. The use of distributed generation and the participation in demand response programs, namely in smart grids, bring several advantages for consumers, aggregators, and system operators. The present paper proposes a remuneration structure for aggregated distributed generation and demand response resources. A virtual power player aggregates all the resources. The resources are aggregated in a certain number of clusters, each one corresponding to a distinct tariff group, according to the economic impact of the resulting remuneration tariff. The determined tariffs are intended to be used for several months. The aggregator can define the periodicity of the tariffs definition. The case study in this paper includes 218 consumers, and 66 distributed generation units.
Resumo:
We study Toeplitz operators on the Besov spaces in the case of the open unit disk. We prove that a symbol satisfying a weak Lipschitz type condition induces a bounded Toeplitz operator. Such symbols do not need to be bounded functions or have continuous extensions to the boundary of the open unit disk. We discuss the problem of the existence of nontrivial compact Toeplitz operators, and also consider Fredholm properties and prove an index formula.
Resumo:
This work deals with some classes of linear second order partial differential operators with non-negative characteristic form and underlying non- Euclidean structures. These structures are determined by families of locally Lipschitz-continuous vector fields in RN, generating metric spaces of Carnot- Carath´eodory type. The Carnot-Carath´eodory metric related to a family {Xj}j=1,...,m is the control distance obtained by minimizing the time needed to go from two points along piecewise trajectories of vector fields. We are mainly interested in the causes in which a Sobolev-type inequality holds with respect to the X-gradient, and/or the X-control distance is Doubling with respect to the Lebesgue measure in RN. This study is divided into three parts (each corresponding to a chapter), and the subject of each one is a class of operators that includes the class of the subsequent one. In the first chapter, after recalling “X-ellipticity” and related concepts introduced by Kogoj and Lanconelli in [KL00], we show a Maximum Principle for linear second order differential operators for which we only assume a Sobolev-type inequality together with a lower terms summability. Adding some crucial hypotheses on measure and on vector fields (Doubling property and Poincar´e inequality), we will be able to obtain some Liouville-type results. This chapter is based on the paper [GL03] by Guti´errez and Lanconelli. In the second chapter we treat some ultraparabolic equations on Lie groups. In this case RN is the support of a Lie group, and moreover we require that vector fields satisfy left invariance. After recalling some results of Cinti [Cin07] about this class of operators and associated potential theory, we prove a scalar convexity for mean-value operators of L-subharmonic functions, where L is our differential operator. In the third chapter we prove a necessary and sufficient condition of regularity, for boundary points, for Dirichlet problem on an open subset of RN related to sub-Laplacian. On a Carnot group we give the essential background for this type of operator, and introduce the notion of “quasi-boundedness”. Then we show the strict relationship between this notion, the fundamental solution of the given operator, and the regularity of the boundary points.
Resumo:
2002 Mathematics Subject Classification: 35L15, 35L80, 35S05, 35S30
Resumo:
We extend previous papers in the literature concerning the homogenization of Robin type boundary conditions for quasilinear equations, in the case of microscopic obstacles of critical size: here we consider nonlinear boundary conditions involving some maximal monotone graphs which may correspond to discontinuous or non-Lipschitz functions arising in some catalysis problems.
Resumo:
Ticagrelor is an orally active ADP P2Y12 receptor antagonist in development by AstraZeneca plc for the reduction of recurrent ischemic events in patients with acute coronary syndromes (ACS). Prior to the development of ticagrelor, thienopyridine compounds, such as clopidogrel, were the focus of research into therapies for ACS. Although the thienopyridines are effective platelet aggregation inhibitors, they are prodrugs and, consequently, exert a slow onset of action. In addition, the variability in inter-individual metabolism of thienopyridine prodrugs has been associated with reduced efficacy in some patients. Ticagrelor is not a prodrug and exhibits a more rapid onset of action than the thienopyridine prodrugs. In clinical trials conducted to date, ticagrelor was a potent inhibitor of ADP-induced platelet aggregation and demonstrated effects that were comparable to clopidogrel. In a phase II, short-term trial, the bleeding profile of participants treated with ticagrelor was similar to that obtained with clopidogrel; however, an increased incidence of dyspnea was observed - an effect that has not been reported with the thienopyridines. Considering the occurrence of dyspnea, and the apparent non-superiority of ticagrelor to clopidogrel, it is difficult to justify a clear benefit to the continued development of ticagrelor. Outcomes from an ongoing phase III trial comparing ticagrelor with clopidogrel in 18,000 patients with ACS are likely to impact on the future development of ticagrelor.
Resumo:
The development of research data management infrastructure and services and making research data more discoverable and accessible to the research community is a key priority at the national, state and individual university level. This paper will discuss and reflect upon a collaborative project between Griffith University and the Queensland University of Technology to commission a Metadata Hub or Metadata Aggregation service based upon open source software components. It will describe the role that metadata aggregation services play in modern research infrastructure and argue that this role is a critical one.