Results 71 to 80 of about 16,940,234 (305)
Continuous and low-cost broadcast authentication is a fundamental security service for distributed sensor networks. This paper presents a novel development of a continuous and low-overhead broadcast authentication protocol named enhanced Infinite timed ...
Khouloud Eledlebi +5 more
doaj +1 more source
On the Subexponential-Time Complexity of CSP
Not all NP-complete problems share the same practical hardness with respect to exact computation. Whereas some NP-complete problems are amenable to efficient computational methods, others are yet to show any such sign. It becomes a major challenge to develop a theoretical framework that is more fine-grained than the theory of NP-completeness, and that
Ronald de Haan +2 more
openaire +2 more sources
ABSTRACT Pediatric refractory immune thrombocytopenia (rITP) is generally characterized by persistent thrombocytopenia and failure to achieve a sustained response to multiple standard therapies. We report a 4‐year‐old female with congenital tufting enteropathy, post‐intestinal transplant patient on immunosuppressants, who developed severe rITP ...
Sarah Hsieh +4 more
wiley +1 more source
ABSTRACT Febrile neutropenia (FN) is a frequent and serious complication in children receiving cancer therapy. Standardizing FN management across Asia is challenging due to variable healthcare infrastructure, diagnostic capacity, and infection patterns; however, it could improve resource use and patient outcomes.
Joliza Patricia Cañeba +29 more
wiley +1 more source
Complexity analysis of spontaneous brain activity: effects of depression and antidepressant treatment [PDF]
Magnetoencephalography (MEG) allows the real-time recording of neural activity and oscillatory activity in distributed neural networks. We applied a non-linear complexity analysis to resting-state neural activity as measured using whole-head MEG ...
Tomás Ortiz +21 more
core +1 more source
Time Complexity of Training DNNs With Parallel Computing for Wireless Communications
Deep neural networks (DNNs) have been widely used for learning various wireless communication policies. While DNNs have demonstrated the ability to reduce the time complexity of inference, their training often incurs a high computational cost.
Pengyu Cong +4 more
doaj +1 more source
On the Subexponential Time Complexity of CSP
A Constraint Satisfaction Problem (CSP) with n variables ranging over a domain of d values can be solved by brute-force in d^n steps (omitting a polynomial factor). With a more careful approach, this trivial upper bound can be improved for certain natural restrictions of the CSP.
Iyad Kanj, Stefan Szeider
openaire +4 more sources
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
In‐Memory Eigenvector Computation in Time O(1)
In‐memory computing with cross‐point resistive memory arrays has gained enormous attention to accelerate the matrix‐vector multiplication in the computation of data‐centric applications.
Zhong Sun +4 more
doaj +1 more source
ABSTRACT Background Maintenance hemodialysis (MHD) patients frequently suffer from frailty, characterized by reduced physical function and poor prognosis. Myokines, such as myonectin, secreted by muscle, are emerging regulators of systemic health. This study investigated the relationship between serum myonectin, adipokines (adiponectin, omentin), and ...
Kenichi Kono +7 more
wiley +1 more source

