Results 211 to 220 of about 319,625 (266)

Smart Closed‐Loop Systems in Personalized Healthcare: Advances and Outlook

Advanced Materials Technologies, EarlyView.
A smart closed‐loop e‐textile integrates multimodal sensing, onboard processing, wireless communication, and wearable power to enable real‐time physiological/biochemical monitoring and feedback‐controlled therapy. ABSTRACT Smart textiles represent a revolutionary frontier in healthcare, seamlessly blending fabric and advanced technologies to create ...
Safoora Khosravi, Sang Won Lee, Mohammad Abrar Uddin, Sina Hassanpoor, Neha Suvindran, Katherine Le, Harun Arkaz, Harishkumar Narayana, Saeid Soltanian, Danial Khorsandi, Negar Hosseinzadeh Kouchehbaghi, Taeil Kim, Yangzhi Zhu   +12 more
wiley   +1 more source

Computing Rate-Distortion Functions of Continuous Memoryless Sources via Discrete Algorithms: An Integrated Scheme with Convergence Guarantee and Algorithmic Acceleration. [PDF]

Entropy (Basel)
Chen L, Tang H, Wu H, Wu H, Wu S, Zhang W.   +5 more
europepmc   +1 more source

Privacy and security enhancement in smart cities using advanced cryptographic techniques. [PDF]

Sci Rep
More KD, Pramod D.
europepmc   +1 more source

Efficient Inference in First Passage Time Models. [PDF]

Stat Comput
Liu S, Fengler A, Frank MJ, Harrison MT.
europepmc   +1 more source

Optimized deep learning ensemble using Fast Osprey algorithm for accurate lymphoblastic leukemia detection. [PDF]

Front Med (Lausanne)
Kaur N, Khan S, Kaur B, Alomran A, Ahmad S, Alshammari T, Alomary FO.   +6 more
europepmc   +1 more source

Unfolded RPCA Network for Mitigating Inter-Transmitter Code Interference in MIMO PMCW Systems. [PDF]

Sensors (Basel)
Lee Y, Lee JH, Lee S.
europepmc   +1 more source

Novel Time-Series Forecasting Method to Enhance Accuracy of Real-Time EEG Detection for BCI-Based Neurofeedback Motor Training in Individuals with Cerebral Palsy and Other Neurological Disorders. [PDF]

Bioengineering (Basel)
Gravunder A, Studnicki A, Kline J, Behboodi A, Bulea TC, Damiano DL.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Fast Merging Algorithm

Journal of the ACM, 1979
We give an algorithm which merges sorted lists represented as balanced binary trees. If the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem.
Mark R. Brown, Robert Endre Tarjan
openaire   +1 more source

Fast Clustering Algorithms

ORSA Journal on Computing, 1994
This paper considers the problem of partitioning the vertices of a weighted complete graph into cliques of unbounded size and number, such that the sum of the edge weights of all cliques is maximized. The problem is known as the clique-partitioning problem and arises as a clustering problem in qualitative data analysis.
Ulrich Dorndorf, Erwin Pesch
openaire   +1 more source