scholarly journals A maximum principle

1979 ◽  
Vol 28 (1) ◽  
pp. 23-26
Author(s):  
Kung-Fu Ng
Keyword(s):  
Maximum Principle ◽  
Extreme Point ◽  
Convex Space ◽  
Maximal Element ◽  
Locally Convex Space ◽  
Compact Set ◽  
Natural Manner ◽  
Upper Semicontinuous ◽  
Nonempty Compact ◽  
Locally Convex

AbstractLet K be a nonempty compact set in a Hausdorff locally convex space, and F a nonempty family of upper semicontinuous convex-like functions from K into [–∞, ∞). K is partially ordered by F in a natural manner. It is shown among other things that each isotone, upper semicontinuous and convex-like function g: K → [ – ∞, ∞) attains its K-maximum at some extreme point of K which is also a maximal element of K.Subject classification (Amer. Math. Soc. (MOS) 1970): primary 46 A 40.

scholarly journals Strong admissibility for abstract dialectical frameworks

2021 ◽  
pp. 1-41
Author(s):  
Atefeh Keshavarzi Zafarghandi ◽  
Rineke Verbrugge ◽  
Bart Verheij
Keyword(s):  
Maximal Element ◽  
Decision Problems ◽  
Current Work ◽  
Argument Evaluation ◽  
Abstract Argumentation ◽  
Proper Generalization

Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling argumentation allowing general logical satisfaction conditions and the relevant argument evaluation. Different criteria used to settle the acceptance of arguments are called semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. However, the notion of strongly admissible semantics studied for abstract argumentation frameworks has not yet been introduced for ADFs. In the current work we present the concept of strong admissibility of interpretations for ADFs. Further, we show that strongly admissible interpretations of ADFs form a lattice with the grounded interpretation as the maximal element. We also present algorithms to answer the following decision problems: (1) whether a given interpretation is a strongly admissible interpretation of a given ADF, and (2) whether a given argument is strongly acceptable/deniable in a given interpretation of a given ADF. In addition, we show that the strongly admissible semantics of ADFs forms a proper generalization of the strongly admissible semantics of AFs.

A Proposed Method to Group the Solutions From Dimensional Synthesis: Planar Triads for Six Precision Position

1992 ◽  
Author(s):  
Xiancheng Lu ◽  
Chuen-Sen Lin
Keyword(s):  
Infinite Number ◽  
Numerical Solutions ◽  
Angular Displacement ◽  
Dimensional Synthesis ◽  
Number Of Solutions ◽  
Jacobian Matrices ◽  
Design Task ◽  
Numerical Examples ◽  
Computer Automation ◽  
Constraint Sets

Abstract In this paper, a method has been proposed to group into six sets the infinite number of solutions from dimensional synthesis of planar triads for six precision positions. The proposed method reveals the relationships between the different configurations of the compatibility linkage and the sets of numerical solutions from dimensional synthesis. By checking the determinant signs and the contunities of values of the sub-Jacobian matrices and their derivatives with respect to the independent angular displacement for all constraint sets in the compatibility linkage, it enables the computer to identify and group the synthesized solutions. Numerical examples have been given to verify the applicability of this method. Six sets of the partial triad Burmester curves have been plotted based on grouped solutions. Suitable solutions can be easily found from the partial triad Burmester curves and utilized for the prescribed design task. This method provides a useful tool to group the dimensional synthesis solutions and enhances the computer automation in the design of linkage mechanisms.

Variational Image Denoising with Adaptive Constraint Sets

2012 ◽  
pp. 206-217 ◽  
Author(s):  
Frank Lenzen ◽  
Florian Becker ◽  
Jan Lellmann ◽  
Stefania Petra ◽  
Christoph Schnörr
Keyword(s):  
Image Denoising ◽  
Variational Image ◽  
Constraint Sets
Sign in / Sign up

Export Citation Format

Share Document