Results 211 to 220 of about 650,634 (265)
Anthropologist, heal thyself: Toward an anthropology of healing through relational interbeing
Abstract I call for an anthropology that confronts its own woundedness. Anthropologists often bear witness to suffering but rarely examine how our own grief, trauma, and institutional distress shape the affective tone of our work. Drawing on fieldwork with Runa (Quechua) women affected by forced sterilization in Peru and guided by my collaborator and ...
Lucía Isabel Stavig
wiley +1 more source
Reconstructing hammerstone size flake by flake: an experimental approach. [PDF]
Li L, McPherron SP.
europepmc +1 more source
Population genetic structure of Chrysomya megacephala (Fabricius) of the Egyptian fauna. [PDF]
Salem AM, Adham FK, Picard CJ.
europepmc +1 more source
The phylogeny and evolution of blow flies (Diptera: Calliphoridae) from the perspective of mitogenomics. [PDF]
Huang X, Sang J, Yan L, Zhang D.
europepmc +1 more source
Whistleblowing in financial practice: a review of processes and impacts. [PDF]
Al-Thani N, Wright S.
europepmc +1 more source
A stone in the orbit: Dramatic pediatric ocular trauma.
Belabbes MB +3 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

