Search results for "bound"
showing 10 items of 2948 documents
Grain Boundary Wetting Phenomena in High Entropy Alloys Containing Nitrides, Carbides, Borides, Silicides, and Hydrogen: A Review
2021
This review was written during the preparation of M-era.Net full proposal “Grain boundaries in multicomponent alloys without principal component” (A.Ko., A.Ku., G.L., and E.R., application No 9345). We also acknowledge the support of the KIT-Publication Fund of the Karlsruhe Institute of Technology. The Institute of Solid State Physics, University of Latvia, as a center of excellence, has received funding from the European Union’s Horizon 2020 Framework Programme H2020-WIDESPREAD-01-2016-2017-TeamingPhase2 under grant agreement no. 739508, project CAMART2.
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.
Unexpected vertical structure of the Saharan Air Layer and giant dust particles during AER-D
2018
The Saharan Air Layer (SAL) in the summertime eastern Atlantic is typically well mixed and 3–4 km deep, overlying the marine boundary layer (MBL). In this paper, we show experimental evidence that at times a very different structure can be observed. During the AERosol properties – Dust (AER-D) airborne campaign in August 2015, the typical structure described above was observed most of the time, and was associated with a moderate dust content yielding an aerosol optical depth (AOD) of 0.3–0.4 at 355 nm. In an intense event, however, an unprecedented vertical structure was observed close to the eastern boundary of the basin, displaying an uneven vertical distribution and a very …
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 …
Learning small programs with additional information
1997
This paper was inspired by [FBW 94]. An arbitrary upper bound on the size of some program for the target function suffices for the learning of some program for this function. In [FBW 94] it was discovered that if “learning” is understood as “identification in the limit,” then in some programming languages it is possible to learn a program of size not exceeding the bound, while in some other programming languages this is not possible.
Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
2018
In this paper we continue to investigate the complexity of the circuit representation of DFA—BC-complexity. We compare it with nondeterministic state complexity, obtain upper and lower bounds which differ only by a factor of 4 for a Binary input alphabet. Also we prove that many simple operations (determining if a state is reachable or if an automaton is minimal) are PSPACE-complete for DFA given in circuit representation.
Upper bounds on multiparty communication complexity of shifts
1996
We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e ) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].
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…