1,660 research outputs found
The Effect of Gua Sha Therapy on Pain in Parkinson’s Disease: a Randomized Controlled Trial
No full textYu Chen Xu,1,* Qiu Qin Wang,1,* Meng Yuan Chen,1 Yu Jie Gao,1 Jia Yi Wang,1 Hao Tian Ge,1 Heng Weng,1 Ju Ping Chen,2 Gui Hua Xu1 1School of Nursing, Nanjing University of Chinese Medicine, Nanjing, 210023, People’s Republic of China; 2Department of Neurology, Changshu Hospital of Traditional Chinese Medicine, Suzhou, 215500, People’s Republic of China*These authors contributed equally to this workCorrespondence: Gui Hua Xu, School of Nursing, Nanjing University of Chinese Medicine, Nanjing, 210023, People’s Republic of China, Email [email protected] Ju Ping Chen, Department of Neurology, Changshu Hospital of Traditional Chinese Medicine, Suzhou, 215500, People’s Republic of China, Email [email protected]: Pain is a common yet undertreated symptom of Parkinson’s disease (PD). This study investigated the effect of Gua Sha therapy on pain in patients with PD.Patients and Methods: A total of 56 PD patients with pain were randomized into either the experimental group (n=28), receiving 12 sessions of Gua Sha therapy, or the control group (n=28) without additional treatment. Participants underwent assessment at baseline, after the twelfth invention, and at the 2-month follow-up timepoints. The primary outcome was KPPS and VAS. Secondary outcomes included UPDRS I–III, PDSS-2, HADS, PDQ-39, and blood biomarkers (5-HT, IL-8, IL-10).Results: The experimental group reported a significant improvement in pain severity, motor functions, affective disorder, and sleep quality (P < 0.05). Furthermore, increasing trends in both 5-HT and IL-10, as well as decreasing trends in IL-8 were observed. No serious adverse events occurred.Conclusion: The preliminary findings suggest that Gua Sha therapy may be effective and safe for alleviating pain and improving other disease-related symptoms in PD patients.Keywords: Parkinson’s disease, pain, Gua Sha therapy, randomized controlled tria
Correction: Guidelines, consensus statements, and standards for the use of artificial intelligence in medicine: systematic review
No full text[This corrects the article DOI: 10.2196/46089.]. [Abstract copyright: ©Ying Wang, Nian Li, Lingmin Chen, Miaomiao Wu, Sha Meng, Zelei Dai, Yonggang Zhang, Mike Clarke. Originally published in the Journal of Medical Internet Research (https://www.jmir.org), 21.12.2023.
Performance Analysis of Modified SHA-3
No full textAbstractSecurity services have become an inseparable feature of almost all digital transactions. A crucial module of these scheme isintegrity, which is performed using a cryptographic hash function. Secure Hash Algorithm can be an efficient hashing technique.SHA-3 is the most recent and efficient Secure Hash Algorithm. Keccak has been chosen as the official algorithm for SHA-3 in2012. In this paper we propose a modification on the design of Secure Hash Algorithm (SHA-3) on Xilinx Field ProgrammableGate Array (FPGA) device. In order to provide reliable architecture for this algorithm, a concurrent error tolerant scheme forSHA-3 is used. A system based on the combination of SHA-3 and error tolerant scheme is also described. Simulation resultsshows, an efficiency in area and delay of SHA-3 designs
Engineering design of reconfigurable medical resuscitation systems
No full textThe student, Shaoyu Meng, accepted the attached license on 2022-04-28 at 20:46.The student, Shaoyu Meng, submitted this Thesis for approval on 2022-04-28 at 20:48.This Thesis was approved for publication on 2022-04-29 at 11:36.DSpace SAF Submission Ingestion Package generated from Vireo submission #16190 on 2022-11-11 at 12:11:36Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-05-01Resuscitation software support systems help physicians and nurses to better organize team workflows and manage treatment history in a time and resource constrained environment. Such systems follow protocols that can significantly improve treatment quality and reduce the errors that deviate from resuscitation algorithms. However, the best practice algorithms may evolve over years and it brought some challenges to the long term use of such systems. Moreover, during practice, each hospital often have some custom software parts and the system needs to be tailored to different end users. It would be important to design such systems to be reconfigurable.
The term reconfigurability here not only means we need to cover a polymorphism of treatment algorithms and hospital specific layout and logic, but also suggests it need to be adjusted to different team roles and different modes such as training, simulation or actual usage. As a good software engineering practice, tests of such system to make it reliable should also be modularized and reconfigurable.
The focus of this thesis summarizes the principles to make the system more reconfigurable based on prior works. Our implementation formalizes different protocols pioneered by physicians, and uses digital twin concept to model the patient. The contributions in this thesis includes an architecture change that improved medical logic verifiability and extensibility by using a verifiable medical language MediK to replace YAKINDU Statechart Tools. Additional changes include shifting into browser/server structure from client/server structure for remote deployment and faster integration during COVID-19
New Records of Pre-image Search of Reduced SHA-1 Using SAT Solvers
No full textAlthough the first SHA-1 collision attack has been carried out in 2017, the cryptographic hash function seems still robust against pre-image attacks. The aim of this work is to measure how many rounds of SHA-1 can be inverted in practice using SAT solvers. To do so, we have first modeled the problem of finding a pre-image of SHA-1 as a system of Boolean formulas, explicitly describing the procedure to obtain such model. Then, we configured the model based on different combinations of number of rounds and number of free bits in our target pre-image. Finally, to find a solution of the model, we used a SAT solver on our server, testing several combinations of restart policies and polarity modes. We analyze and report the number and positions of the pre-image bits that can be fixed to influence the ability of the SAT solver to find the remaining free bits of the pre-image in a shorter time. In particular, we execute partial pre-image attacks on 64-, 80- 96-, 112- and 128-bit messages, outperforming the current state-of-the-art records
Security and usability of standard has hfunctions, in particular MD-5, SHA-1 and SHA-2
No full textTitle: Security and usability of standard hash functions, in particular MD-5, SHA-1 and SHA-2 Author: Galaczová Barbora Department: Department of Algebra Supervisor: Doc. RNDr. Tůma Jiří, DrSc., Department of Algebra Consultant: Ing. Budiš Petr, Ph.D. Abstract: In the present work we try to digestedly describe standard hash functions, in particular MD-5, SHA-1 and SHA-2. We describe resume of existing attacks on these hash functions. We closely focused on MD-5 collision attacks, because the other hash function collision attacks result from these. Next we describe posibilities of practical usage of hash function collisions, in particular into the qualified certificates area and possible threats. At the end to the present work we describe new hash functions, which could replace current hash functions. This work also contains software to calculate MD-5 hash and search it`s collisions. The software is based on method invented by Czech cryptoanalytist Vlastimil Klíma. Keywords: hash function, collision, qualified certificate, security
Cryptanalysis of Dynamic SHA(2)
No full textIn this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash functions rely heavily on data-dependent rotations, similar to certain block ciphers, e.g., RC5. Our analysis suggests that in the case of hash functions, where the attacker has more control over the rotations, this approach is less favorable than in block ciphers. We present practical, or close to practical, collision attacks on both Dynamic SHA and Dynamic SHA2. Moreover, we present a preimage attack on Dynamic SHA that is faster than exhaustive search. © 2009 Springer-Verlag Berlin Heidelberg.sponsorship: Supported by the Swiss National Science Foundation, project no. 113329. This author was supported by the France Telecom chaire. F.W.O. Research Assistant, Fund for Scientific Research Flander s (Belgium) (Swiss National Science Foundation|113329, France Telecom chaire, Scientific Research)status: Publishe
Design & Characterization of SHA 3- 256 Bit IP Core
No full textAbstractIn the era of internet and computer networking the need for security have increased rapidly. Various crypto algorithms are used for secured data transmission and reception through the network, of which hash function possess a key role in various cryptographic protocols. Keccak algorithm is the winner of SHA-3 competition conducted by NIST. SHA-3 consists of different variant such as 224, 256, 384 and 512 bit. This paper discuss the design and implementation of SHA-3 256- bit core. The core is designed using Verilog HDL and prototyped using Xilinx® Virtex®-6FPGA
sj-xlsx-1-jcb-10.1177_0271678X231209607 - Supplemental material for Inhibition of EphA4 reduces vasogenic edema after experimental stroke in mice by protecting the blood-brain barrier integrity
No full textSupplemental material, sj-xlsx-1-jcb-10.1177_0271678X231209607 for Inhibition of EphA4 reduces vasogenic edema after experimental stroke in mice by protecting the blood-brain barrier integrity by Shuai Zhang, Jing Zhao, Wei-Meng Sha, Xin-Pei Zhang, Jing-Yuan Mai, Perry F Bartlett and Sheng-Tao Hou in Journal of Cerebral Blood Flow & Metabolism</p
- …
