Search results for "convex"

showing 10 items of 389 documents

Opinion dynamics in coalitional games with transferable utilities

2014

This paper studies opinion dynamics in a large number of homogeneous coalitional games with transferable utilities (TU), where the characteristic function is a continuous-time stochastic process. For each game, which we can see as a “small world”, the players share opinions on how to allocate revenues based on the mean-field interactions with the other small worlds. As a result of such mean-field interactions among small worlds, in each game, a central planner allocates revenues based on the extra reward that a coalition has received up to the current time and the extra reward that the same coalition has received in the other games. The paper also studies the convergence and stability of op…

Characteristic function (convex analysis)Opinion dynamicsStochastic processComputer scienceStability (learning theory)RevenueConvergence (relationship)Mathematical economics53rd IEEE Conference on Decision and Control
researchProduct

Analysis of neuronal networks in the visual system of the cat using statistical signals

1976

If the input signals of the visual system in the cat are statistical patterns in space and time, a complete system analysis can be carried out. What counts here as a system are the neuronal networks between retina and recording site. In the case of linearity, one obtains the temporal impulse response functions at every point in the receptive field with the aid of correlation methods. The measuring time is about one minute. Some aspects of the procedure are explained in terms of examples. The method of measurement also makes it possible to determine the characteristic function of the system in time and space between different recording sites within the cortex. It is possible to specialize th…

Characteristic function (convex analysis)Systems AnalysisGeneral Computer ScienceModels NeurologicalStatistics as TopicComplex systemLinearityNonlinear systemSimple (abstract algebra)Receptive fieldCatsElectronic engineeringAnimalsVisual PathwaysPoint (geometry)AlgorithmImpulse responseBiotechnologyMathematicsBiological Cybernetics
researchProduct

State-feedback sampled-data control design for nonlinear systems via passive theory

2013

Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/230413 Open Access This paper investigates the problem of passive controller design for a class of nonlinear systems under variable sampling. The Takagi-Sugeno (T-S) fuzzy modeling method is utilized to represent the nonlinear systems. Attention is focused on the design of passive controller for the T-S fuzzy systems via sampled-data control approach. Under the concept of very-strict passivity, a novel time-dependent Lyapunov functional is constructed to develop passive analysis criteria and passive controller synthesis conditions. A new …

Class (computer programming)EngineeringArticle Subjectbusiness.industrylcsh:MathematicsGeneral MathematicsPassivityGeneral EngineeringControl engineeringFuzzy control systemlcsh:QA1-939Fuzzy logicNonlinear systemlcsh:TA1-2040Control theoryConvex optimizationState (computer science)VDP::Matematikk og Naturvitenskap: 400::Matematikk: 410::Analyse: 411lcsh:Engineering (General). Civil engineering (General)business
researchProduct

Differential properties of the Moreau envelope

2014

International audience; In a vector space endowed with a uniformly Gâteaux differentiable norm, it is proved that the Moreau envelope enjoys many remarkable differential properties and that its subdifferential can be completely described through a certain approximate proximal mapping. This description shows in particular that the Moreau envelope is essentially directionally smooth. New differential properties are derived for the distance function associated with a closed set. Moreover, the analysis, when applied to the investigation of the convexity of Tchebyshev sets, allows us to recover several known results in the literature and to provide some new ones.

Closed setNorm (mathematics)Mathematical analysisDifferentiable functionSubderivative[MATH]Mathematics [math]16. Peace & justiceAnalysisConvexityVector spaceMathematics
researchProduct

Analytic extension of non quasi-analytic Whitney jets of Roumieu type

1997

Let (Mr)r∈ℕ0 be a logarithmically convex sequence of positive numbers which verifies M0 = 1 as well as Mr≥ 1 for every r ∈ ℕ and defines a non quasi-analytic class. Let moreover F be a closed proper subset of ℝn. Then for every function ƒ on ℝn belonging to the non quasi-analytic (Mr)-class of Roumieu type, there is an element g of the same class which is analytic on ℝnF and such that Dα ƒ(x) = Dαg(x) for every σ ∈ ƒ0n SBAP and x ∈ F.

CombinatoricsClass (set theory)SequenceMathematics (miscellaneous)Logarithmically convex functionApplied MathematicsFunction (mathematics)Extension (predicate logic)Element (category theory)Type (model theory)MathematicsResults in Mathematics
researchProduct

Convex bodies and convexity on Grassmann cones

1962

CombinatoricsConvex analysisMixed volumeGeneral MathematicsConvex polytopeProper convex functionConvex setGeometrySubderivativeChoquet theoryConvexityMathematicsArchiv der Mathematik
researchProduct

Optimal Locations and Inner Products

1997

Abstract In a normed space X , we consider objective functions which depend on the distances between a variable point and the points of certain finite sets A . A point where such a function attains its minimum on X is generically called an optimal location. In this paper we obtain characterizations of inner product spaces with properties connecting optimal locations and the convex hull of A or barycenters of points of A with well chosen weights. We thus generalize several classical results about characterization of inner product spaces.

CombinatoricsConvex hullInner product spaceApplied MathematicsMathematical analysisPoint (geometry)Function (mathematics)Characterization (mathematics)Finite setAnalysisNormed vector spaceVariable (mathematics)MathematicsJournal of Mathematical Analysis and Applications
researchProduct

The Linear Ordering Polytope

2010

So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In this chapter we will add further ingredients by looking for problem- specific inequalities. To this end we will study the convex hull of feasible solutions of the LOP: the so-called linear ordering polytope.

CombinatoricsConvex hullLinear programmingBirkhoff polytopeComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONConvex polytopeCross-polytopeMathematicsofComputing_NUMERICALANALYSISUniform k 21 polytopeEhrhart polynomialVertex enumeration problemMathematics
researchProduct

The simplex dispersion ordering and its application to the evaluation of human corneal endothelia

2009

A multivariate dispersion ordering based on random simplices is proposed in this paper. Given a R^d-valued random vector, we consider two random simplices determined by the convex hulls of two independent random samples of sizes d+1 of the vector. By means of the stochastic comparison of the Hausdorff distances between such simplices, a multivariate dispersion ordering is introduced. Main properties of the new ordering are studied. Relationships with other dispersion orderings are considered, placing emphasis on the univariate version. Some statistical tests for the new order are proposed. An application of such ordering to the clinical evaluation of human corneal endothelia is provided. Di…

CombinatoricsConvex hullStatistics and ProbabilityNumerical AnalysisHausdorff distanceSimplexMultivariate random variableHausdorff spaceRegular polygonUnivariateStatistical dispersionStatistics Probability and UncertaintyMathematicsJournal of Multivariate Analysis
researchProduct

A reconstruction algorithm for L-convex polyominoes

2006

AbstractWe give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.

CombinatoricsConvexityMathematics::CombinatoricsGeneral Computer SciencePolyominoPolyominoesRegular polygonReconstruction algorithmReconstructionComputer Science(all)Theoretical Computer ScienceMathematicsTheoretical Computer Science
researchProduct