نتایج جستجو برای: g monotone property
تعداد نتایج: 601093 فیلتر نتایج به سال:
We study systems that are monotone in a generalized sense with respect to cones of rank 2. The main result of the paper is the existence of a Poincaré-Bendixson property for some solutions of those systems.
For positive integers n and q and a monotone graph property A, we consider the two player, perfect information game WC(n, q,A), which is defined as follows. The game proceeds in rounds. In each round, the first player, called Waiter, offers the second player, called Client, q + 1 edges of the complete graph Kn which have not been offered previously. Client then chooses one of these edges which ...
According to Mack a space is countably paracompact if and only if its product with [0, 1] is δ-normal, i.e. any two disjoint closed sets, one of which is a regular Gδ-set, can be separated. In studying monotone versions of countable paracompactness, one is naturally led to consider various monotone versions of δ-normality. Such properties are the subject of this paper. We look at how these prop...
The objective of data mining is the extraction of knowledge from databases. In practice, one often encounters difficulties with models that are constructed purely by search, without incorporation of knowledge about the domain of application. In economic decision making such as credit loan approval or risk analysis, one often requires models that are monotone with respect to the decision variabl...
Monotone systems are dynamical systems for which the flow preserves a partial order. Some applications will be briefly reviewed in this paper. Much of the appeal of the class of monotone systems stems from the fact that roughly, most solutions converge to the set of equilibria. However, this usually requires a stronger monotonicity property which is not always satisfied or easy to check in appl...
This paper is concerned with the graph searching game. The search number s(G) of a graph G is the smallest number of searchers required to “clear” G. A search strategy is monotone (m) if no recontamination ever occurs. It is connected (c) if the set of clear edges always forms a connected subgraph. It is internal (i) if the removal of searchers is not allowed. The difficulty of the “connected” ...
A notion of “radially monotone” cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut is infinitesimally opened by the curvature at the vertices along the path. It is shown that a class of planar, triangulated convex domains always have a rad...
We study theorems giving sufficient conditions on the vertex degrees of a graph G to guarantee G is t-tough. We first give a best monotone theorem when t ≥ 1, but then show that for any integer k ≥ 1, a best monotone theorem for t = 1 k ≤ 1 requires at least f(k) · |V (G)| nonredundant conditions, where f(k) grows superpolynomially as k → ∞. When t < 1, we give an additional, simple theorem for...
treatment of diseases with natural remedies is gaining popularity because of its fewer side effects. a systemic and scientific investigation of aqueous extract of euphorbia tirucalli for its antioxidant and hepatoprotective potential against carbon-tetrachloride-induced hepatic damage in rats was carried out . antioxidant property was assessed by using reducing property, superoxide anion scav...
in this paper, we first discuss about canonical dual of g-frameλp = {λip ∈ b(h, hi) : i ∈ i}, where λ = {λi ∈ b(h, hi) :i ∈ i} is a g-frame for a hilbert space h and p is the orthogonalprojection from h onto a closed subspace m. next, we provethat, if λ = {λi ∈ b(h, hi) : i ∈ i} and θ = {θi ∈ b(k, hi) :i ∈ i} be respective g-frames for non zero hilbert spaces hand k, and λ and θ are unitarily e...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید