Digitalni repozitorij raziskovalnih organizacij Slovenije

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po

Možnosti:
  Ponastavi


Iskalni niz: "vrsta gradiva" (1) AND "polno besedilo" .

Iskanje brez iskalnega niza vrača največ 500 zadetkov!

151 - 160 / 500
Na začetekNa prejšnjo stran12131415161718192021Na naslednjo stranNa konec
151.
Post-treatment surveillance in colorectal cancer
Vaneja Velenik, 2010, pregledni znanstveni članek

Objavljeno v DiRROS: 15.03.2024; Ogledov: 56; Prenosov: 21
.pdf Celotno besedilo (643,11 KB)

152.
Gonadal function in patients treated for Hodgkin's disease in childhood
Lorna Zadravec-Zaletel, Nevenka Bratanič, Berta Jereb, 2010, izvirni znanstveni članek

Objavljeno v DiRROS: 15.03.2024; Ogledov: 54; Prenosov: 23
.pdf Celotno besedilo (652,65 KB)

153.
Digital ischemic events related to gemcitabine : report of two cases and a systematic review
Cvetka Grašič-Kuhar, Tanja Mesti, Branko Zakotnik, 2010, izvirni znanstveni članek

Objavljeno v DiRROS: 15.03.2024; Ogledov: 66; Prenosov: 26
.pdf Celotno besedilo (621,57 KB)

154.
Radiotherapy in combination with vascular-targeted therapies
Eva Ćirić, Gregor Serša, 2010, pregledni znanstveni članek

Objavljeno v DiRROS: 15.03.2024; Ogledov: 57; Prenosov: 22
.pdf Celotno besedilo (1,06 MB)

155.
Trilinear embedding for divergence-form operators with complex coefficients
Andrea Carbonaro, Oliver Dragičević, Vjekoslav Kovač, Kristina Ana Škreb, 2023, izvirni znanstveni članek

Povzetek: We prove a dimension-free $L^p(\Omega)\times L^q(\Omega)\times L^r(\Omega)\rightarrow L^1(\Omega\times (0,\infty))$ embedding for triples of elliptic operators in divergence form with complex coefficients and subject to mixed boundary conditions on $\Omega$, and for triples of exponents $p,q,r \in (1,\infty)$ mutually related by the identity $1/p+1/q+1/r=1$. Here $\Omega$ is allowed to be an arbitrary open subset of $\mathbb{R}^d$. Our assumptions involving the exponents and coefficient matrices are expressed in terms of a condition known as $p$-ellipticity. The proof utilizes the method of Bellman functions and heat flows. As a corollary, we give applications to (i) paraproducts and (ii) square functions associated with the corresponding operator semigroups, moreover, we prove (iii) inequalities of Kato-Ponce type for elliptic operators with complex coefficients. All the above results are the first of their kind for elliptic divergence-form operators with complex coefficients on arbitrary open sets. Furthermore, the approach to (ii),(iii) through trilinear embeddings seems to be new.
Ključne besede: elliptic differential operator, p-ellipticity, operator semigroup, multilinear estimate
Objavljeno v DiRROS: 15.03.2024; Ogledov: 57; Prenosov: 35
.pdf Celotno besedilo (1,10 MB)
Gradivo ima več datotek! Več...

156.
157.
The cut method on hypergraphs for the Wiener index
Sandi Klavžar, Gašper Domen Romih, 2023, izvirni znanstveni članek

Povzetek: The cut method has been proved to be extremely useful in chemical graph theory. In this paper the cut method is extended to hypergraphs. More precisely, the method is developed for the Wiener index of $k$-uniform partial cube-hypergraphs. The method is applied to cube-hypergraphs and hypertrees. Extensions of the method to hypergraphs arising in chemistry which are not necessary $k$-uniform and/or not necessary linear are also developed.
Ključne besede: hypergraphs, Wiener index, cut method, partial cube-hypergraphs, hypertrees, phenylene, Clar structures
Objavljeno v DiRROS: 15.03.2024; Ogledov: 54; Prenosov: 30
.pdf Celotno besedilo (318,45 KB)
Gradivo ima več datotek! Več...

158.
Faster distance-based representative skyline and k-center along pareto front in the plane
Sergio Cabello, 2023, izvirni znanstveni članek

Povzetek: We consider the problem of computing the distance-based representative skyline in the plane, a problem introduced by Tao, Ding, Lin and Pei and independently considered by Dupin, Nielsen and Talbi in the context of multi-objective optimization. Given a set $P$ of $n$ points in the plane and a parameter $k$, the task is to select $k$ points of the skyline defined by $P$ (also known as Pareto front for $P$) to minimize the maximum distance from the points of the skyline to the selected points. We show that the problem can be solved in $O(n \log h)$ time, where $h$ is the number of points in the skyline of $P$. We also show that the decision problem can be solved in $O(n \log k)$ time and the optimization problem can be solved in $O(n \log k + n \log\log n)$ time. This improves previous algorithms and is optimal for a large range of values of $k$.
Ključne besede: geometric optimization, skyline, pareto front, clustering, k-center
Objavljeno v DiRROS: 15.03.2024; Ogledov: 49; Prenosov: 30
.pdf Celotno besedilo (2,13 MB)
Gradivo ima več datotek! Več...

159.
Proper holomorphic maps in Euclidean spaces avoiding unbounded convex sets
Barbara Drinovec-Drnovšek, Franc Forstnerič, 2023, izvirni znanstveni članek

Povzetek: We show that if $E$ is a closed convex set in $\mathbb C^n$, $n>1$ contained in a closed halfspace $H$ such that ▫$E\cap bH$▫ is nonempty and bounded, then the concave domain $\Omega=\mathbb C^n\setminus E$ contains images of proper holomorphicmaps $f : X \to \mathbb C^n$ from any Stein manifold $X$ of dimension $< n$, with approximation of a givenmap on closed compact subsets of $X$. If in addition $2 {\rm dim} X+1 \le n$ then $f$ can be chosen an embedding, and if $2 {\rm dim} X = n$, then it can be chosen an immersion. Under a stronger condition on $E$, we also obtain the interpolation property for such maps on closed complex subvarieties.
Ključne besede: Stein manifolds, holomorphic embeddings, Oka manifold, minimal surfaces, convexity
Objavljeno v DiRROS: 15.03.2024; Ogledov: 52; Prenosov: 33
.pdf Celotno besedilo (441,34 KB)
Gradivo ima več datotek! Več...

160.
Computational complexity aspects of super domination
Csilla Bujtás, Nima Ghanbari, Sandi Klavžar, 2023, izvirni znanstveni članek

Povzetek: Let ▫$G$▫ be a graph. A dominating set ▫$D\subseteq V(G)$▫ is a super dominating set if for every vertex ▫$x\in V(G) \setminus D$▫ there exists ▫$y\in D$▫ such that ▫$N_G(y)\cap (V(G)\setminus D)) = \{x\}$▫. The cardinality of a smallest super dominating set of ▫$G$▫ is the super domination number of ▫$G$▫. An exact formula for the super domination number of a tree ▫$T$▫ is obtained, and it is demonstrated that a smallest super dominating set of ▫$T$▫ can be computed in linear time. It is proved that it is NP-complete to decide whether the super domination number of a graph ▫$G$▫ is at most a given integer if ▫$G$▫ is a bipartite graph of girth at least ▫$8$▫. The super domination number is determined for all ▫$k$▫-subdivisions of graphs. Interestingly, in half of the cases the exact value can be efficiently computed from the obtained formulas, while in the other cases the computation is hard. While obtaining these formulas, II-matching numbers are introduced and proved that they are computationally hard to determine.
Ključne besede: super domination number, trees, bipartite graphs, k-subdivision of a graph, computational complexity, matching, II-matching number
Objavljeno v DiRROS: 14.03.2024; Ogledov: 55; Prenosov: 35
.pdf Celotno besedilo (453,39 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 1.07 sek.
Na vrh