Search results for "Bounded"
showing 10 items of 658 documents
Memetic Engineering for Permanent Education in Line with Sustainable Growth
2012
Given the recent point of view of the European Commission regarding the implementation of a new strategy for sustainable growth and jobs, this paper emphasises the opportunity and urgency of supporting the EU 2020 strategy, providing an appropriate educational tool for the knowledge society. The main objectives are: a. adapting memetic engineering expressed in terms of General System Theory to the teaching component of permanent education based on bounded rationality and "Just in Time"as key tools for fighting cognitive chaoplexity in the post-industrial era; b. facilitating the use of memetic engineering based on its double-faceted nature: as both positive and negative feedback; c. extendi…
Sustainable Development: E-teaching (now) for Lifelong E-Learning
2011
Abstract To attain knowledge, add things every day. To attain wisdom, remove things every day. LAO TZU , “Tao Te Ching” The paper aims at convincing psychologist to cooperate in permanent education, by giving them a general idea about the first objectives of the PhD thesis titled “Nondeterministic e-Teaching for Sustainable Development in Rapidly Changing Environments”: a) Validating the role of e-teaching for sustainable development in Eastern Europe in line with the Europe 2020 strategy. (Europe 2020 is a 10-year strategy proposed by the European Commission on 3 March 2010 for reviving the economy of the European Union. It aims at “smart, sustainable, inclusive growth” with greater coordi…
Global properties of generalized Ornstein–Uhlenbeck operators on Lp(RN,RN) with more than linearly growing coefficients
2009
AbstractWe show that the realization Ap of the elliptic operator Au=div(Q∇u)+F⋅∇u+Vu in Lp(RN,RN), p∈[1,+∞[, generates a strongly continuous semigroup, and we determine its domain D(Ap)={u∈W2,p(RN,RN):F⋅∇u+Vu∈Lp(RN,RN)} if 1<p<+∞. The diffusion coefficients Q=(qij) are uniformly elliptic and bounded together with their first-order derivatives, the drift coefficients F can grow as |x|log|x|, and V can grow logarithmically. Our approach relies on the Monniaux–Prüss theorem on the sum of noncommuting operators. We also prove Lp–Lq estimates and, under somewhat stronger assumptions, we establish pointwise gradient estimates and smoothing of the semigroup in the spaces Wα,p(RN,RN), α∈[0,1], wher…
Weyl Type Theorems for Left and Right Polaroid Operators
2010
A bounded operator defined on a Banach space is said to be polaroid if every isolated point of the spectrum is a pole of the resolvent. In this paper we consider the two related notions of left and right polaroid, and explore them together with the condition of being a-polaroid. Moreover, the equivalences of Weyl type theorems and generalized Weyl type theorems are investigated for left and a-polaroid operators. As a consequence, we obtain a general framework which allows us to derive in a unified way many recent results, concerning Weyl type theorems (generalized or not) for important classes of operators.
Challenging aspects in Consensus protocols for networks
2008
Results on consensus protocols for networks are presented. The basic tools and the main contribution available in the literature are considered, together with some of the related challenging aspects: estimation in networks and how to deal with disturbances is considered. Motivated by applications to sensor, peer-to- peer, and ad hoc networks, many papers have considered the problem of estimation in a consensus fashion. Here, the unknown but bounded (UBB) noise affecting the network is addressed in details. Because of the presence of UBB disturbances convergence to equilibria with all equal components is, in general, not possible. The solution of the epsiv-consensus problem, where the states…
Artificial Intelligence + Distributed Systems = Agents
2009
The connection with Wirth’s book goes beyond the title, albeit confining the area to modern Artificial Intelligence (AI). Whereas thirty years ago, to devise effective programs, it became necessary to enhance the classical algorithmic framework with approaches applied to limited and focused subdomains, in the context of broad-band technology and semantic web, applications - running in open, heterogeneous, dynamic and uncertain environments-current paradigms are not enough, because of the shift from programs to processes. Beside the structure as position paper, to give more weight to some basic assertions, results of recent research are abridged and commented upon in line with new paradigms.…
Optimal Resource Discovery Paths of Gnutella2
2008
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query …
Bounded Computational Capacity Equilibrium
2010
We study repeated games played by players with bounded computational power, where, in contrast to Abreu and Rubisntein (1988), the memory is costly. We prove a folk theorem: the limit set of equilibrium payoffs in mixed strategies, as the cost of memory goes to 0, includes the set of feasible and individually rational payoffs. This result stands in sharp contrast to Abreu and Rubisntein (1988), who proved that when memory is free, the set of equilibrium payoffs in repeated games played by players with bounded computational power is a strict subset of the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded c…
Local maximal operators on fractional Sobolev spaces
2016
In this note we establish the boundedness properties of local maximal operators MG on the fractional Sobolev spaces Ws;p(G) whenever G is an open set in Rn, 0 < s < 1 and 1 < p < 1. As an application, we characterize the fractional (s;p)-Hardy inequality on a bounded open set by a Maz'ya-type testing condition localized to Whitney cubes. pq(G) whenever G is an open set in R n , 0 < s < 1 and 1 < p;q <1. Our main focus lies in the mapping properties of MG on a fractional Sobolev space W s;p (G) with 0 < s < 1 and 1 < p < 1, see Section 2 for the denition or (3) for a survey of this space. The intrinsically dened function space W s;p (G) on a given domain G coincides with the trace space F s …
Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm
2020
In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algorithm of Bodlaender and Kloks that computes an optimal tree decomposition given a non-optimal tree decomposition of bounded width. Both algorithms, in particular the second, are hardly accessible. We present the second algorithm in a much simpler way in this paper and refer to an extended version for the first. In our description of the second algorithm, we start by explaining how all tree decompositions of subtrees defined by the nodes of the given tree decomposition can be enumerated. We group tree decompositions …