Results 201 to 210 of about 50,164 (254)
Preparation and Characterization of Carvacrol-Loaded PLA Nanofibers by the Solution Blow-Spinning Method for the Long Shelf-Life of Chicken Breast Meat. [PDF]
ACS OmegaErtuğral TG +5 more
europepmc +1 more source
High frequency and unique subtypes of meningioma in patients with BAP1 tumor predisposition syndrome. [PDF]
J NeurooncolRamsey KA +13 more
europepmc +1 more source
Spontaneous cardiac rupture as the initial presentation of acute myeloid leukaemia complicated by malignant lactic acidosis: a case report. [PDF]
Eur Heart J Case RepUmeda Y +4 more
europepmc +1 more source
Comprehensive energy audit and conservation strategy for public buildings: enhancing energy efficiency and grid sustainability. [PDF]
Sci RepHabib S +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM Transactions on Sensor Networks, 2016
In wireless sensor networks (WSNs), a space filling curve (SFC) refers to a path passing through all nodes in the network, with each node visited at least once. By enforcing a linear order of the sensor nodes through an SFC, many applications in WSNs concerning serial operations on both sensor nodes and sensor data can be performed, with examples ...
Chen Wang +4 more
openaire +2 more sources
In wireless sensor networks (WSNs), a space filling curve (SFC) refers to a path passing through all nodes in the network, with each node visited at least once. By enforcing a linear order of the sensor nodes through an SFC, many applications in WSNs concerning serial operations on both sensor nodes and sensor data can be performed, with examples ...
Chen Wang +4 more
openaire +2 more sources
Combinatorica, 1997
Some earlier proofs are strengthened and refined to give the following theorem (called the blow-up lemma). Given a graph \(R\), natural number \(\Delta\), and some \(\delta>0\), there exists some \(\varepsilon>0\) that the following holds. Blow up every vertex of \(R\) to some larger set and build two graphs, \(G\) and \(G'\), on the enlarged set as ...
Komlós, J. +2 more
openaire +1 more source
Some earlier proofs are strengthened and refined to give the following theorem (called the blow-up lemma). Given a graph \(R\), natural number \(\Delta\), and some \(\delta>0\), there exists some \(\varepsilon>0\) that the following holds. Blow up every vertex of \(R\) to some larger set and build two graphs, \(G\) and \(G'\), on the enlarged set as ...
Komlós, J. +2 more
openaire +1 more source
Blowing Up Symplectic Orbifolds
Annals of Global Analysis and Geometry, 2001The author studies different blow-up constructions on symplectic orbifolds by using different circle actions. Some of these constructions are used to describe the behavior of reduced spaces of Hamiltonian circle actions on a symplectic orbifold, when passing a critical level of its Hamiltonian function. Using these descriptions, the author generalizes,
openaire +2 more sources