Results 21 to 30 of about 121,034 (244)

Graph Compression by BFS [PDF]

open access: yesAlgorithms, 2009
The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs,
Apostolico, Alberto, Drovandi, Guido
openaire   +4 more sources

Telomere length comparison between oral cells and blood cells among neonates

open access: yesThe Turkish Journal of Pediatrics, 2019
Telomere length, measured from blood cells, is commonly used as the standard telomere length of the whole body. The relationship between blood telomere length and oral telomere length is still unclear, especially among neonates.
Mandar Bhattacharya   +2 more
doaj   +1 more source

Prispevek k poznavanju favne dnevnih metuljev (Lepidoptera: Rhopalocera) Vipavske doline s širšo okolico (jugozahodna Slovenija)

open access: yesNatura Sloveniae, 2000
Prispevek podaja rezultate lepidopterološke skupine na Raziskovalnem taboru študentov biologije Šempas 98'. Na 34 lokalitetah je bilo med 23. in 31. julijem 1998 opaženih 92 vrst metuljev dnevnikov (Rhopalocera) od katerih je 9 vrst vključenih v Atlas ...
Rudi Verovnik
doaj   +1 more source

The Structure of Pseudo-BF /BF*-algebra

open access: yesEuropean Journal of Pure and Applied Mathematics, 2020
In this paper, we study the structure of pseudo-BF/BF*-algebra as a generalization of BF-algebra. We show how pseudo-BF/BF*-algebra and pseudo-BCK-algebra are related. Westudy some elementary properties related to pseudo-BF-algebra and pseudo-BF*-algebra.
Hessah M. Al-Malki, Deena S. Al-Kadi
openaire   +2 more sources

On BF-orderable graphs

open access: yesDiscrete Applied Mathematics, 1986
A directed graph G is BF-orderable w.r.t. a vertex s if there exists an ordering of the edges such that on any simple path starting from s the edges occur increasingly. This generalization of acyclic graphs enables a linear time algorithm for the single source shortest path problem. An entry point (w.r.t. s) of a subgraph S of G is a vertex w of S s.t.
Mehlhorn, K., Schmidt, B.
openaire   +2 more sources

Power consumption model of sector breathing based congestion control in mobile network

open access: yesDigital Communications and Networks, 2018
According to Cooper's law, the number of conversations per location doubles every two and a half years. Therefore, congestion control has become a promising research area. Nowadays small cell deployment has become a solution to deal with congestion.
Anwesha Mukherjee   +2 more
doaj   +1 more source

Growth and root respiration of C4 plants under CO2 enrichment

open access: yesActa Biologica Slovenica, 2003
Respiratory measurements of apical root parts of several C4 plant species (Echinochloa crus-galli var. crus-galli, Setaria pumila and Zea mays DK 312 (Dekalb, USA) subjected to an elevated CO2 regime during growth in climatic chambers or at natural CO2 ...
Irena Maček   +2 more
doaj   +1 more source

Anti-Aging Effects of Monomethylsilanetriol and Maltodextrin-Stabilized Orthosilicic Acid on Nails, Skin and Hair

open access: yesCosmetics, 2018
Chemical form of silicon determines its absorption and bioavailability: particulate and polymerized forms exhibit minimal oral bioavailability, while monomers (maltodextrin-stabilized orthosilicic acid, M-OSA) and organic compounds (monomethylsilanetriol,
Anderson Oliveira Ferreira   +5 more
doaj   +1 more source

Physicochemical characterization of dual action liposomal formulations: anticancer and antimicrobial

open access: yesHeliyon, 2019
Background: Cancer till date remains one of the world's most life threatening disease accompanied by risk of secondary infections. Therefore formulations carrying anticancer drugs which can also decrease the risk of secondary infection are inevitable ...
Asmita Das   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy