Robust Solutions to a General Class of Approximation Problems

2004 ◽  
Vol 25 (4) ◽  
pp. 1448-1460 ◽  
Author(s):  
G. A. Watson
Author(s):  
Barbara Gray ◽  
Jill Purdy

Multistakeholder partnerships (MSPs) are formed to tackle knotty societal problems, promote innovation, provide public services, expand governance capabilities, set standards for a field, or resolve conflicts that impede progress on critical issues. Partnerships are viewed as collaboration among four types of stakeholders: businesses, governments, nongovernmental organizations (NGOs), and civic society. The objective of collaboration is to create a richer, more comprehensive appreciation of the iss/problem than any of the partners could construct alone by viewing it from the perspectives of all the stakeholders and designing robust solutions. Such partnerships are necessary because few organizations contain sufficient knowledge and resources to fully analyze issues and take action on them unilaterally. Five essential components of a rigorous definition of collaboration are presented: interdependence among partners, emergence of shared norms, wrestling with differences, respect for different competencies, and assuming joint responsibility for outcomes. Several examples of MSPs are provided.


1982 ◽  
Vol 10 (3) ◽  
pp. 90-98 ◽  
Author(s):  
Laxmi N. Bhuyan ◽  
Dharma P. Agrawal
Keyword(s):  

2021 ◽  
Vol 180 (1-2) ◽  
pp. 151-177
Author(s):  
Qichao Wang

Weighted restarting automata have been introduced to study quantitative aspects of computations of restarting automata. In earlier works we studied the classes of functions and relations that are computed by weighted restarting automata. Here we use them to define classes of formal languages by restricting the weight associated to a given input word through an additional requirement. In this way, weighted restarting automata can be used as language acceptors. First, we show that by using the notion of acceptance relative to the tropical semiring, we can avoid the use of auxiliary symbols. Furthermore, a certain type of word-weighted restarting automata turns out to be equivalent to non-forgetting restarting automata, and another class of languages accepted by word-weighted restarting automata is shown to be closed under the operation of intersection. This is the first result that shows that a class of languages defined in terms of a quite general class of restarting automata is closed under intersection. Finally, we prove that the restarting automata that are allowed to use auxiliary symbols in a rewrite step, and to keep on reading after performing a rewrite step can be simulated by regular-weighted restarting automata that cannot do this.


Author(s):  
Jennifer Duncan

AbstractThe Brascamp–Lieb inequalities are a very general class of classical multilinear inequalities, well-known examples of which being Hölder’s inequality, Young’s convolution inequality, and the Loomis–Whitney inequality. Conventionally, a Brascamp–Lieb inequality is defined as a multilinear Lebesgue bound on the product of the pullbacks of a collection of functions $$f_j\in L^{q_j}(\mathbb {R}^{n_j})$$ f j ∈ L q j ( R n j ) , for $$j=1,\ldots ,m$$ j = 1 , … , m , under some corresponding linear maps $$B_j$$ B j . This regime is now fairly well understood (Bennett et al. in Geom Funct Anal 17(5):1343–1415, 2008), and moving forward there has been interest in nonlinear generalisations, where $$B_j$$ B j is now taken to belong to some suitable class of nonlinear maps. While there has been great recent progress on the question of local nonlinear Brascamp–Lieb inequalities (Bennett et al. in Duke Math J 169(17):3291–3338, 2020), there has been relatively little regarding global results; this paper represents some progress along this line of enquiry. We prove a global nonlinear Brascamp–Lieb inequality for ‘quasialgebraic’ maps, a class that encompasses polynomial and rational maps, as a consequence of the multilinear Kakeya-type inequalities of Zhang and Zorin-Kranich. We incorporate a natural affine-invariant weight that both compensates for local degeneracies and yields a constant with minimal dependence on the underlying maps. We then show that this inequality generalises Young’s convolution inequality on algebraic groups with suboptimal constant.


Sign in / Sign up

Export Citation Format

Share Document