Results 31 to 40 of about 1,281,596 (279)

Neutral hydrogen in galaxy halos at the peak of the cosmic star formation history [PDF]

open access: yes, 2015
We use high-resolution cosmological zoom-in simulations from the FIRE project to make predictions for the covering fractions of neutral hydrogen around galaxies at z=2-4.
Faucher-Giguere, C. -A.   +5 more
core   +2 more sources

SOME PROPERTIES OF INDUCED COVER FROM FAMILY OF COVERING ROUGH SETS

open access: yesTạp chí Khoa học Đại học Đà Lạt, 2017
Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering based rough set theory is proposed as a significant generalization of classical rough sets.
Nguyễn Đức Thuần
doaj   +1 more source

Examples of covering properties of boundary points of space-times

open access: yes, 2017
The problem of classifying boundary points of space-time, for example singularities, regular points and points at infinity, is an unexpectedly subtle one.
Irmer, Ingrid
core   +1 more source

On Weak Vitali Covering Properties [PDF]

open access: yesCanadian Mathematical Bulletin, 1978
There are now a number of Vitali covering properties which have been defined to handle problems arising in differentiation theory. Although some of these have received a unified treatment, as for example in the setting of Orlicz spaces in [1, p. 168], the underlying simplicity can be lost and the intimate connection with the original weak Vitali ...
openaire   +1 more source

Simplifying branched covering surface-knots by an addition of 1-handles with chart loops

open access: yes, 2018
A branched covering surface-knot over an oriented surface-knot $F$ is a surface-knot in the form of a branched covering over $F$. A branched covering surface-knot over $F$ is presented by a graph called a chart on a surface diagram of $F$. For a branched
Nakamura, Inasa
core   +1 more source

Graphs with the circuit cover property [PDF]

open access: yesTransactions of the American Mathematical Society, 1994
A circuit cover of an edge-weighted graph (G, p) is a multiset of circuits in G such that every edge e is contained in exactly p ( e ) p(e) circuits in the multiset. A nonnegative integer valued weight vector p is admissible if the total weight of any edge-cut is even, and no edge has more than half the ...
Alspach, Brian   +2 more
openaire   +1 more source

Covering-Based Rough Single Valued Neutrosophic Sets [PDF]

open access: yesNeutrosophic Sets and Systems, 2017
Rough sets theory is a powerful tool to deal with uncertainty and incompleteness of knowledge in information systems. Wang et al. proposed single valued neutrosophic sets as an extension of intuitionistic fuzzy sets to deal with real-world problems.
Yingcang Ma, Wanying Zhou, Qing Wan
doaj   +1 more source

Outcomes of Live Virus Vaccination in Patients With Vascular Anomalies Being Treated With Sirolimus

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Live vaccination in patients with vascular anomalies (VA) receiving sirolimus remains controversial due to immunosuppressive effects and theoretical risks. Procedure This single‐center retrospective study included patients with VA less than 4 years old at the start of sirolimus therapy who were incompletely vaccinated.
Svatava Merkle   +5 more
wiley   +1 more source

Uniformities and covering properties for partial frames (I) [PDF]

open access: yesCategories and General Algebraic Structures with Applications, 2014
Partial frames provide a rich context in which to do pointfree structured and unstructured topology. A small collection of axioms of an elementary nature allows one to do much traditional pointfree topology, both on the level of frames or locales, and ...
John Frith, Anneliese Schauerte
doaj  

Choquet-like Integrals with Multi-Neighborhood Approximation Numbers for Novel Covering Granular Reduction Methods

open access: yesMathematics, 2023
Covering granular reduction is an important issue in multi-covering information systems. The main methods to solve this problem are set operators. How to solve this problem by quantitative analysis is an interesting topic.
Jingqian Wang   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy