Results 31 to 40 of about 99,998 (314)

About Directed d-Convex Simple Graphs [PDF]

open access: yesComputer Science Journal of Moldova, 2008
In this article we introduce a pseudo-metric on directed graphs, which forms there a family of convex sets. The graphs without d-convex sets, except empty set, sets of one vertex and set of all vertexes, are called d-convex simple.
Nadejda Sur, Sergiu Cataranciuc
doaj  

Convex approximations for complete integer recourse models [PDF]

open access: yes, 2002
We consider convex approximations of the expected value function of a two-stage integer recourse problem. The convex approximations are obtained by perturbing the distribution of the random right-hand side vector.
Vlerk, Maarten H. van der   +2 more
core   +1 more source

Contractions of Convex Sets [PDF]

open access: yesProceedings of the American Mathematical Society, 1977
In this paper it is shown that, in a vector space over any ordered field, a noninfinitesimal contraction of a convex set K can be written as an intersection of translates of K .
openaire   +2 more sources

An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points

open access: yesCeylon Journal of Science, 2021
The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n).
K. R. Wijeweera, S. R. Kodituwakku
doaj   +1 more source

Separation of convex sets

open access: yesDiscrete Applied Mathematics, 1994
A hyperplane \(H\) separates a set \(A\) from a collection \({\mathcal K}\) of sets in \(\mathbb{R}^ d\) if \(A\) is contained in one of closed halfspaces determined by \(H\) and every member \(K \in {\mathcal K}\) is contained in the complementary closed halfspace.
Jurek Czyzowicz   +2 more
openaire   +1 more source

Known Results and Open Problems in Hypercomplex Convexity

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014
A subject, which is treated in this review, combines in one bundle some questions of convex, hypercomplex analysis, probability theory and geometry.
Zelinskii Yuri
doaj   +1 more source

The External Estimate of the Compact Set by Lebesgue Set of the Convex Function [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2020
The finite-dimensional problem of embedding a given compact D ⊂ R p into the lower Lebesgue set G(α) = {y ∈ R p : f(y) 6 α} of the convex function f(·) with the smallest value of α due to the offset of D is considered.
Abramova, Veronika V.   +2 more
doaj   +1 more source

Core equivalence theorems for infinite convex games [PDF]

open access: yes, 1996
We show that the core of a continuous convex game on a measurable space of players is a von Neumann-Morgenstern stable set. We also extend the definition of the Mas-Colell bargaining set to games with a measurable space of players, and show that for ...
Shitovitz, Benyamin   +3 more
core  

Orientation of Convex Sets

open access: yesThe Electronic Journal of Combinatorics
We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other systems of orientations on triples that satisfy a so-called interiority condition: $\circlearrowleft(ABD)=\circlearrowleft(BCD)=\circlearrowleft(CAD)=1$ imply ...
Ágoston, Péter   +3 more
openaire   +3 more sources

Clinical Validation of Plasma p‐217tau in Neurological Diseases

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Plasma p‐217tau is a minimally invasive but specific biomarker for diagnosing Alzheimer's disease (AD). However, its disease specificity remains to be clinically evaluated. We validated the reliability of the p‐217tau biomarker in 12 other neurological diseases.
Takeshi Kawarabayashi   +13 more
wiley   +1 more source

Home - About - Disclaimer - Privacy