Results 181 to 190 of about 13,149,896 (206)

Analog Neuromorphic Systems for Implantable Neural Interfaces

Basu A, Sun PV, Ke Y, Fu Z, Arnold E, Bartolozzi C, Chang Y, De Luca C, Donati E, Gallou O, Gautam A, Halbach Q, Huang C, Kuo C, Lakshmiramanan K, Maiti S, Müller E, Peng S, Rastogi S, Thakur C, Tripathi A, Uppal A, Zhou B, Hasler J, Indiveri G, Schemmel J, Ghosh S.   +26 more
europepmc   +1 more source

Digital health in palliative care: use is largely limited to conventional technologies - a cross-sectional survey of healthcare professionals. [PDF]

BMC Health Serv Res
Muehlensiepen F, Darkow R, Fink L, Ignatyev Y, Gehlhaar A, Lauke A, Kamp MA, Heinze M, Allsop M, May S.   +9 more
europepmc   +1 more source

A global, proxy-based assessment of building climatization vulnerability. [PDF]

Sci Rep
Florio P, Uhl JH, Politis P, Melchiorri M, Maduta C, Krasnodębska K, Martinez AM.   +6 more
europepmc   +1 more source

Hydrogeophysical characterization and recharge potential of three Wadi basins along the Red Sea Margin, Northeastern Desert, Egypt. [PDF]

Sci Rep
Hussein M, Araffa SAS, Abbas MA, Sharkawy MS.   +3 more
europepmc   +1 more source

Deriving proxy life cycle assessment datasets for manufacturing machines through data clustering. [PDF]

Int J Adv Manuf Technol
Dodd N, Koh L, Rothman R.
europepmc   +1 more source

Inflammation Unchecked: Concurrent Kawasaki Disease and Stevens‐Johnson Syndrome in an 18‐Month‐Old Child

Arthritis Care &Research, EarlyView.
Catherine Deffendall, Jodi Backalar, Elizabeth Acevedo Zapata, Adriana Della Porta, Lorin Bibb, Tyler Reese, Charlotte M. Brown   +6 more
wiley   +1 more source

The Identifying Code, the Locating-Dominating, the Open Locating-Dominating and the Locating Total-Dominating Problems Under Some Graph Operations [PDF]

Electronic Notes in Theoretical Computer Science, 2019
International audienceThe problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all known to ...
Annegret K Wagler
exaly   +2 more sources

Open-Independent, Open-Locating-Dominating Sets [PDF]

Electronic Journal of Graph Theory and Applications, 2017
A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex $v \in D$ being the location of some form of a locating device, from which one can detect and precisely identify any given "intruder" vertex in V(G).
Peter J Slater
exaly   +2 more sources

Locating and Paired-Dominating Sets in Graphs

Discrete Applied Mathematics, 2009
In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199–206].
Michael A. Henning
exaly   +2 more sources