Digitalni repozitorij raziskovalnih organizacij Slovenije

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

Na voljo sta dva načina iskanja: enostavno in napredno. Enostavno iskanje lahko zajema niz več besed iz naslova, povzetka, ključnih besed, celotnega besedila in avtorja, zaenkrat pa ne omogoča uporabe operatorjev iskanja. Napredno iskanje omogoča omejevanje števila rezultatov iskanja z vnosom iskalnih pojmov različnih kategorij v iskalna okna in uporabo logičnih operatorjev (IN, ALI ter IN NE). V rezultatih iskanja se izpišejo krajši zapisi podatkov o gradivu, ki vsebujejo različne povezave, ki omogočajo vpogled v podroben opis gradiva (povezava iz naslova) ali sprožijo novo iskanje (po avtorjih ali ključnih besedah).

Pomoč
Išči po:
Možnosti:
 


231 - 240 / 2000
Na začetekNa prejšnjo stran20212223242526272829Na naslednjo stranNa konec
231.
On generalization of ELA feature groups
Gašper Petelin, Gjorgjina Cenikj, 2024, objavljeni znanstveni prispevek na konferenci

Ključne besede: algorithm selection, exploratory landscape analysis, black-box optimization
Objavljeno v DiRROS: 07.10.2024; Ogledov: 126; Prenosov: 52
.pdf Celotno besedilo (541,14 KB)
Gradivo ima več datotek! Več...

232.
Impact of scaling in ELA feature calculation on algorithm selection cross-benchmark transferability
Gjorgjina Cenikj, Gašper Petelin, Tome Eftimov, 2024, objavljeni znanstveni prispevek na konferenci

Ključne besede: algorithm selection, exploratory landscape analysis, transfer learning
Objavljeno v DiRROS: 07.10.2024; Ogledov: 122; Prenosov: 275
.pdf Celotno besedilo (5,20 MB)
Gradivo ima več datotek! Več...

233.
Symmetries of the Woolly Hat graphs
Leah Berman, Sergio Hiroki Koike Quintanar, Elías Mochán, Alejandra Ramos Rivera, Primož Šparl, Steve Wilson, 2024, izvirni znanstveni članek

Povzetek: A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length. While the tetravalent edge-transitive graphs admitting a semiregular automorphism with only one orbit are easy to determine, those that admit a semiregular automorphism with two orbits took a considerable effort and were finally classified in 2012. Of the several possible different "types" of potential tetravalent edge-transitive graphs admitting a semiregular automorphism with three orbits, only one "type" has thus far received no attention. In this paper we focus on this class of graphs, which we call the Woolly Hat graphs. We prove that there are in fact no edge-transitive Woolly Hat graphs and classify the vertex-transitive ones.
Ključne besede: edge-transitive, vertex-transitive, tricirculant, Woolly Hat graphs
Objavljeno v DiRROS: 07.10.2024; Ogledov: 117; Prenosov: 49
.pdf Celotno besedilo (555,34 KB)
Gradivo ima več datotek! Več...

234.
Transfer learning in robotics : An upcoming breakthrough? A review of promises and challenges
Noemie Jaquier, Michael C. Welle, Andrej Gams, Kunpeng Yao, Bernardo Fichera, Aude Billard, Aleš Ude, Tamim Asfour, Danica Kragič, 2024, izvirni znanstveni članek

Povzetek: Transfer learning is a conceptually-enticing paradigm in pursuit of truly intelligent embodied agents. The core concept— reusing prior knowledge to learn in and from novel situations—is successfully leveraged by humans to handle novel situations. In recent years, transfer learning has received renewed interest from the community from different perspectives, including imitation learning, domain adaptation, and transfer of experience from simulation to the real world, among others. In this paper, we unify the concept of transfer learning in robotics and provide the first taxonomy of its kind considering the key concepts of robot, task, and environment. Through a review of the promises and challenges in the field, we identify the need of transferring at different abstraction levels, the need of quantifying the transfer gap and the quality of transfer, as well as the dangers of negative transfer. Via this position paper, we hope to channel the effort of the community towards the most significant roadblocks to realize the full potential of transfer learning in robotics
Objavljeno v DiRROS: 07.10.2024; Ogledov: 113; Prenosov: 530
.pdf Celotno besedilo (1,69 MB)

235.
Antiviral respiratory masks with plasma-functionalized polypropylene textiles for optimal adsorption of antiviral substance
Mark Zver, David Dobnik, Rok Zaplotnik, Miran Mozetič, Alenka Vesel, Arijana Filipić, Polona Kogovšek, Katja Fric, Alja Štern, Gregor Primc, 2024, izvirni znanstveni članek

Povzetek: During the COVID-19 pandemic, face masks were the first line of defense against the spread of infection. However, infectious viruses may remain on medical textiles, potentially serving as an additional source of infection. Due to their chemical inertness, many textiles cannot be enhanced with antiviral functionalities. Through treatment with low-pressure gaseous plasma, we have activated the surface of a medical-grade melt-blown, non-woven polypropylene textile so that it can absorb sodium dodecyl sulfate, an antimicrobial surfactant. Within two hours of contact time, the functionalized textile has been able to inactivate over 7 log10 PFU mL−1 of bacteriophage phi6, a surrogate of enveloped viruses such as SARS-CoV-2, and it has retained its antiviral properties for over 100 days. The functionalized material has not disrupted facial mask filtration efficiency or breathability. In addition, the in vitro biocompatibility testing in accordance with ISO 10993-5 for testing of medical devices has demonstrated that the selected formulation causes no adverse effects on the mouse fibroblast cell line L-929. With the treatment processes that have been completed within seconds, the method seems to have great potential to produce antiviral textiles against future outbreaks.
Ključne besede: surgical face masks, plasma functionalization, antiviral materials, virus filtration, breathability
Objavljeno v DiRROS: 07.10.2024; Ogledov: 111; Prenosov: 343
.pdf Celotno besedilo (4,16 MB)
Gradivo ima več datotek! Več...

236.
Water-templated growth of interfacial superglue polymers for tunable thin films and in situ fluid encapsulation
Venkata Subba R. Jampani, Miha Škarabot, Urban Mur, Damien Baigl, Ulrich Jonas, Jan P. F. Lagerwall, Miha Ravnik, Manos Anyfantakis, 2024, izvirni znanstveni članek

Povzetek: Thin polymer films (TPFs) are indispensable elements in numerous technologies ranging from liquid encapsulation to biotechnology to electronics. However, their production typically relies on wet chemistry involving organic solvents or chemical vapor deposition, necessitating elaborate equipment and often harsh conditions. Here, an eco-friendly, fast, and facile synthesis of water-templated interfacial polymers based on cyanoacrylates (superglues, CAs) that yield thin films with tailored properties is demonstrated. Specifically, by exposing a cationic surfactant-laden water surface to cyanoacrylate vapors, surfactant-modulated anionic polymerization produces a manipulable thin polymer film with a thickness growth rate of 8 nm min−1. Furthermore, the shape and color of the film are precisely controlled by the polymerization kinetics, wetting conditions, and/or exposure to patterned light. Using various interfaces as templates for film growth, including the free surface of drops and soap bubbles, the developed method advantageously enables in situ packaging of chemical and biological cargos in liquid phase as well as the encapsulation of gases within solidified bubbles. Simple, versatile, and biocompatible, this technology constitutes a potent platform for programmable coating and soft/smart encapsulation of fluids.
Ključne besede: thin polymer films, fluid encapsulation
Objavljeno v DiRROS: 07.10.2024; Ogledov: 107; Prenosov: 281
.pdf Celotno besedilo (16,18 MB)
Gradivo ima več datotek! Več...

237.
Diet of three cryptobenthic clingfish species and the factors influencing it
Domen Trkov, Danijel Ivajnšič, Marcelo Kovačić, Lovrenc Lipej, 2024, izvirni znanstveni članek

Povzetek: Cryptobenthic fish are small benthic fish species that normally live in various hiding places. Due to their large numbers, they are very important for energy transfer to higher trophic levels. However, due to their small size and hidden lifestyle, knowledge about them and their ecology, including their diet, is still limited. Using a non-destructive method based on faecal pellets, we investigated the diet of three clingfish species, Lepadogaster lepadogaster, L. candolii, and Apletodon incognitus, in the shallow northern Adriatic Sea. To better understand the results, we studied the fauna of potential prey in the habitats of the fish studied and also took fish specimens to observe their behaviour in the laboratory. The three species feed predominantly on crustaceans, particularly amphipods, copepods, and decapods. The proportion of the different taxa in the diet depends on the species of clingfish, the size of the specimens, and the size of the prey. In addition, the behaviour of the fish, the home range of the specimens, and the availability of food played an important role. The presence of certain crustacean groups in the environment also determines the occurrence of clingfish of different species and sizes.
Ključne besede: cryptobenthic fish, clingfish species, diet, diet habits, non-destructive method, faecal pellets, crustaceans, northern Adriatic Sea
Objavljeno v DiRROS: 03.10.2024; Ogledov: 184; Prenosov: 61
.pdf Celotno besedilo (738,93 KB)
Gradivo ima več datotek! Več...

238.
On the 2-rainbow independent domination numbers of some graphs
Boštjan Gabrovšek, Aljoša Peperko, Janez Žerovnik, 2023, izvirni znanstveni članek

Povzetek: By suitably adjusting the tropical algebra technique we compute the rainbow independent domination numbers of several infinite families of graphs including Cartesian products $C_n \Box P_m$ and $C_n \Box C_m$ for all $n$ and $m\le 5$, and generalized Petersen graphs $P(n,2)$ for $n \ge 3$.
Ključne besede: graph theory, rainbow independent domination number, path algebra, tropical algebra
Objavljeno v DiRROS: 03.10.2024; Ogledov: 140; Prenosov: 54
.pdf Celotno besedilo (459,61 KB)
Gradivo ima več datotek! Več...

239.
Inequalities and equalities on the joint and generalized spectral and essential spectral radius of the Hadamard geometric mean of bounded sets of positive kernel operators
Katarina Bogdanović, Aljoša Peperko, 2023, izvirni znanstveni članek

Povzetek: We prove new inequalities and equalities for the generalized and the joint spectral radius (and their essential versions) of Hadamard (Schur) geometric means of bounded sets of positive kernel operators on Banach function spaces. In the case of nonnegative matrices that define operators on Banach sequences we obtain additional results. Our results extend results of several authors that appeared relatively recently.
Ključne besede: Hadamard-Schur geometric mean, Hadamard-Schur product, joint and generalized spectral radius, essential spectral radius, measure of noncompactness, positive kernel operators, non-negative matrices, bounded sets of operators
Objavljeno v DiRROS: 03.10.2024; Ogledov: 140; Prenosov: 84
.pdf Celotno besedilo (1,72 MB)
Gradivo ima več datotek! Več...

240.
Covering the edges of a graph with triangles
Csilla Bujtás, Akbar Davoodi, Laihao Ding, Ervin Győri, Zsolt Tuza, Donglei Yang, 2025, izvirni znanstveni članek

Povzetek: In a graph $G$, let $\rho_\triangle(G)$ denote the minimum size of a set of edges and triangles that cover all edges of $G$, and let $\alpha_1(G)$ be the maximum size of an edge set that contains at most one edge from each triangle. Motivated by a question of Erdős, Gallai, and Tuza, we study the relationship between $\rho_\triangle(G)$ and $\alpha_1(G)$ and establish a sharp upper bound on $\rho_\triangle(G)$. We also prove Nordhaus-Gaddum-type inequalities for the considered invariants.
Ključne besede: edge-disjoint triangles, edge clique covering, Nordhaus-Gaddum inequality
Objavljeno v DiRROS: 03.10.2024; Ogledov: 123; Prenosov: 68
.pdf Celotno besedilo (283,48 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.84 sek.
Na vrh