Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

There are two search modes available: simple and advanced. Simple search can include one or more words from the title, summary, keywords or full text, but does not allow the use of search operators. Advanced search allows to limit the number of search results by entering the search terms of different categories in the search window, as well as the use of Boolean search operators (AND, OR and AND NOT). In search results short formats of records are displayed and some data are displayed as links, which open a detailed description of the material (title link) or perform a new search (author or keyword link).

Help
Search in:
Options:
 


901 - 910 / 2000
First pagePrevious page87888990919293949596Next pageLast page
901.
Rheological behaviors of waste polyethylene modified asphalt binder : Statistical analysis of interlaboratory testing results
Di Wang, Andrea Baliello, Gustavo Pinheiro, Lily D. Poulikakos, Marjan Tušar, Kamilla Vasconcelos, Muhammad Rafiq Kakar, Laurent Porot, Emiliano Pasquini, Gaspare Giancontieri, Chiara Riccardi, Marco Pasetto, Davide Lo Presti, Augusto Cannone Falchetto, 2023, original scientific article

Abstract: This article investigated the effect of waste polyethylene (PE) on the modified asphalt binders’ rheological behavior from a statistical point of view. The interlaboratory testing results from the RILEM Technical Committee 279 Valorization of Waste and Secondary Materials for Roads Task Group 1 were used for this purpose. First, an unaged 70/100 penetration graded neat binder was selected as the reference material. Next, a single 5 % content of waste PE additives (PE-pellets and PE-shreds) was mixed with a 95 % neat binder to prepare two PE modified binders. Then, dynamic shear rheometer–based temperature-frequency sweep tests were performed over a wide range of temperatures and frequencies to evaluate the rheological properties of these three binders. Different rheological behaviors were observed in the isochronal plots at high temperatures. Based on a reproducibility precision requirement proposed for phase angle, 28°C was set as the transition temperature across the rheological behaviors. Next, according to the three rheological behaviors defined in a previous study by the authors, statistical analysis was introduced to identify sensitive rheological parameters and determine the thresholds. Results indicate that the phase angle measured above 28°C and 1.59 Hz can be used as a sensitive parameter to discriminate the three rheological behaviors of PE modified binders. The thresholds among different behaviors were also calculated as an example for phase angle measured at the highest common testing temperature of 70°C. Additional experimental evaluations on more types of PE modified binders, especially at intermediate and high temperatures, are recommended to better understand their influence on the rheological behavior of PE modified binders.
Keywords: bitumen, polietilen, reologija, medlaboratorijska primerjava
Published in DiRROS: 20.02.2024; Views: 213; Downloads: 96
.pdf Full text (1,19 MB)
This document has many files! More...

902.
Kidney cancer
Mirjana Rajer, 2007, professional article

Published in DiRROS: 20.02.2024; Views: 184; Downloads: 44
.pdf Full text (213,38 KB)

903.
Basal cell carcinoma on the left cheek
Boris Jančar, 2007, professional article

Published in DiRROS: 20.02.2024; Views: 171; Downloads: 56
.pdf Full text (1,83 MB)

904.
Basic Clinical Radiobiology Course Ljubljana (Slovenia), 21.-25. May 2006 : view from local participant
Mirjana Rajer, 2007, other component parts

Published in DiRROS: 20.02.2024; Views: 171; Downloads: 43
.pdf Full text (66,97 KB)

905.
Editoral [!]
Gregor Serša, 2007, preface, editorial, afterword

Published in DiRROS: 20.02.2024; Views: 177; Downloads: 51
.pdf Full text (29,27 KB)

906.
Packings in bipartite prisms and hypercubes
Boštjan Brešar, Sandi Klavžar, Douglas F. Rall, 2024, original scientific article

Abstract: The $2$-packing number $\rho_2(G)$ of a graph $G$ is the cardinality of a largest $2$-packing of $G$ and the open packing number $\rho^{\rm o}(G)$ is the cardinality of a largest open packing of $G$, where an open packing (resp. $2$-packing) is a set of vertices in $G$ no two (closed) neighborhoods of which intersect. It is proved that if $G$ is bipartite, then $\rho^{\rm o}(G\Box K_2) = 2\rho_2(G)$. For hypercubes, the lower bounds $\rho_2(Q_n) \ge 2^{n - \lfloor \log n\rfloor -1}$ and $\rho^{\rm o}(Q_n) \ge 2^{n - \lfloor \log (n-1)\rfloor -1}$ are established. These findings are applied to injective colorings of hypercubes. In particular, it is demonstrated that $Q_9$ is the smallest hypercube which is not perfect injectively colorable. It is also proved that $\gamma_t(Q_{2^k}\times H) = 2^{2^k-k}\gamma_t(H)$, where $H$ is an arbitrary graph with no isolated vertices.
Keywords: 2-packing number, open packing number, bipartite prism, hypercube, injective coloring, total domination number
Published in DiRROS: 19.02.2024; Views: 344; Downloads: 121
.pdf Full text (231,57 KB)
This document has many files! More...

907.
Oka domains in Euclidean spaces
Franc Forstnerič, Erlend Fornæss Wold, 2024, original scientific article

Abstract: In this paper, we find surprisingly small Oka domains in Euclidean spaces $\mathbb C^n$ of dimension $n>1$ at the very limit of what is possible. Under a mild geometric assumption on a closed unbounded convex set $E$ in $\mathbb C^n$, we show that $\mathbb C^n\setminus E$ is an Oka domain. In particular, there are Oka domains only slightly bigger than a halfspace, the latter being neither Oka nor hyperbolic. This gives smooth families of real hypersurfaces $\Sigma_t \subset \mathbb C^n$ for $t \in \mathbb R$ dividing $\mathbb C^n$ in an unbounded hyperbolic domain and an Oka domain such that at $t=0$, $\Sigma_0$ is a hyperplane and the character of the two sides gets reversed. More generally, we show that if $E$ is a closed set in $\mathbb C^n$ for $n>1$ whose projective closure $\overline E \subset \mathbb{CP}^n$ avoids a hyperplane $\Lambda \subset \mathbb{CP}^n$ and is polynomially convex in $\mathbb{CP}^n\setminus \Lambda\cong\mathbb C^n$, then $\mathbb C^n\setminus E$ is an Oka domain.
Keywords: Oka manifold, hyperbolic manifolds, density property, projectively convex sets
Published in DiRROS: 19.02.2024; Views: 361; Downloads: 109
.pdf Full text (278,96 KB)
This document has many files! More...

908.
On orders of automorphisms of vertex-transitive graphs
Primož Potočnik, Micael Toledo, Gabriel Verret, 2024, original scientific article

Abstract: In this paper we investigate orders, longest cycles and the number of cycles of automorphisms of finite vertex-transitive graphs. In particular, we show that the order of every automorphism of a connected vertex-transitive graph with $n$ vertices and of valence $d$, $d\le 4$, is at most $c_d n$ where $c_3=1$ and $c_4 = 9$. Whether such a constant $c_d$ exists for valencies larger than $4$ remains an unanswered question. Further, we prove that every automorphism $g$ of a finite connected $3$-valent vertex-transitive graph $\Gamma$, $\Gamma \not\cong K_{3,3}$, has a regular orbit, that is, an orbit of $\langle g \rangle$ of length equal to the order of $g$. Moreover, we prove that in this case either $\Gamma$ belongs to a well understood family of exceptional graphs or at least $5/12$ of the vertices of $\Gamma$ belong to a regular orbit of $g$. Finally, we give an upper bound on the number of orbits of a cyclic group of automorphisms $C$ of a connected $3$-valent vertex-transitive graph $\Gamma$ in terms of the number of vertices of $\Gamma$ and the length of a longest orbit of $C$.
Keywords: graphs, automorphism groups, vertex-transitive, regular orbit, cubic, tetravalent
Published in DiRROS: 19.02.2024; Views: 292; Downloads: 111
.pdf Full text (573,20 KB)
This document has many files! More...

909.
Strong edge geodetic problem on complete multipartite graphs and some extremal graphs for the problem
Sandi Klavžar, Eva Zmazek, 2024, original scientific article

Abstract: A set of vertices $X$ of a graph $G$ is a strong edge geodetic set if to any pair of vertices from $X$ we can assign one (or zero) shortest path between them such that every edge of $G$ is contained in at least one on these paths. The cardinality of a smallest strong edge geodetic set of $G$ is the strong edge geodetic number ${\rm sg_e}(G)$ of $G$. In this paper, the strong edge geodetic number of complete multipartite graphs is determined. Graphs $G$ with ${\rm sg_e}(G) = n(G)$ are characterized and ${\rm sg_e}$ is determined for Cartesian products $P_n\,\square\, K_m$. The latter result in particular corrects an error from the literature.
Keywords: strong edge geodetic problem, complete multipartite graph, edge-coloring, Cartesian product of graphs
Published in DiRROS: 19.02.2024; Views: 233; Downloads: 100
.pdf Full text (430,75 KB)
This document has many files! More...

910.
Complete nonsingular holomorphic foliations on Stein manifolds
Antonio Alarcón, Franc Forstnerič, 2024, original scientific article

Abstract: Let $X$ be a Stein manifold of complex dimension $n \ge 1$ endowed with a Riemannian metric ${\mathfrak g}$. We show that for every integer $k$ with $\left[\frac{n}{2}\right] \le k \le n-1$ there is a nonsingular holomorphic foliation of dimension $k$ on $X$ all of whose leaves are topologically closed and ${\mathfrak g}$-complete. The same is true if $1\le k \left[\frac{n}{2}\right]$ provided that there is a complex vector bundle epimorphism $TX\to X \times \mathbb{C}^{n-k}$. We also show that if $\mathcal{F}$ is a proper holomorphic foliation on $\mathbb{C}^n$ $(n > 1)$ then for any Riemannian metric ${\mathfrak g}$ on $\mathbb{C}^n$ there is a holomorphic automorphism $\Phi$ of $\mathbb{C}^n$ such that the image foliation $\Phi_*\mathcal{F}$ is ${\mathfrak g}$-complete. The analogous result is obtained on every Stein manifold with Varolin's density property.
Keywords: Stein manifolds, complete holomorphic foliations, density property
Published in DiRROS: 19.02.2024; Views: 254; Downloads: 102
.pdf Full text (433,06 KB)
This document has many files! More...

Search done in 0.45 sec.
Back to top