Results 31 to 40 of about 1,155,888 (288)
Network coding for non-uniform demands [PDF]
, 2005 Non-uniform demand networks are defined as a useful connection model, in between multicasts and general connections. In these networks, each sink demands a certain number of messages, without specifying their identities.
Bruck, Jehoshua, Cassuto, Yuval
core +3 more sources
Properties of Water Bound in Hydrogels
Gels, 2017 In this review, the importance of water in hydrogel (HG) properties and structure is analyzed. A variety of methods such as 1H NMR (nuclear magnetic resonance), DSC (differential scanning calorimetry), XRD (X-ray powder diffraction), dielectric ...
Vladimir M. Gun’ko +2 more
doaj +1 more source
Non-uniformity issues and workarounds in bounded-size sampling
The VLDB Journal, 2013 A variety of schemes have been proposed in the literature to speed up query processing and analytics by incrementally maintaining a bounded-size uniform sample from a dataset in the presence of a sequence of insertion, deletion, and update transactions.
Gemulla, Rainer +2 more
openaire +3 more sources
Forum of Mathematics, Sigma, 2017 Let $Y$ be a principal homogeneous space of an abelian surface, or a K3 surface, over a finitely generated extension of
ANTHONY VÁRILLY-ALVARADO, BIANCA VIRAY
doaj +1 more source
Bounded cohomology and non-uniform perfection of mapping class groups [PDF]
Inventiones mathematicae, 2001 Using the existence of certain symplectic submanifolds in symplectic 4-manifolds, we prove an estimate from above for the number of singular fibers with separating vanishing cycles in minimal Lefschetz fibrations over surfaces of positive genus. This estimate is then used to deduce that mapping class groups are not uniformly perfect, and that the map ...
Hisaaki Endo, Dieter Kotschick
openaire +3 more sources
On an improved computational solution for the 3D HCIR PDE in finance
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 The aim of this work is to tackle the three–dimensional (3D) Heston– Cox–Ingersoll–Ross (HCIR) time–dependent partial differential equation (PDE) computationally by employing a non–uniform discretization and gathering the finite difference (FD) weighting
Soleymani Fazlollah +2 more
doaj +1 more source
DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces
, 2022 We develop a connection between DP-colorings of $k$-uniform hypergraphs of order $n$ and coverings of $n$-dimensional Boolean hypercube by pairs of antipodal $(n-k)$-dimensional faces. Bernshteyn and Kostochka established that the lower bound on edges in
Potapov, Vladimir N.
core
An analytical solution to the multicommodity network flow problem with weighted random routing
Applied Network Science, 2021 We derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the non-uniform multicommodity flow problem under weighted random routing. We show the mean load at each node, net of its demand and normalized by its (
Onuttom Narayan, Iraj Saniee
doaj +1 more source
Non-Uniform and Non-Random Binding of Nucleoprotein to Influenza A and B Viral RNA
Viruses, 2018 The genomes of influenza A and B viruses have eight, single-stranded RNA segments that exist in the form of a viral ribonucleoprotein complex in association with nucleoprotein (NP) and an RNA-dependent RNA polymerase complex.
Valerie Le Sage +6 more
doaj +1 more source
IET Signal Processing, 2023 This article proposes a direct position determination (DPD) algorithm for non‐circular sources observed by a moving array using the self‐calibration technique in the presence of mutual coupling.
Jie Deng +3 more
doaj +1 more source