Peripheral Neuropathy among Patients with Diabetes Mellitus: Use of Douleur Neuropathic Questionnaire

Objective: To find out the prevalence of diabetic peripheral neuropathy in patients with diabetes mellitus. Methodology: It was an observational study conducted on a sample of 150 subjects who were enrolled by a convenient random sampling technique. Patients with a history of diabetes for more than 5 years and of 30-85 years of age from both genders were included. Patients with a history of surgery, frozen shoulder psychological issues, and kidney problems were excluded. Data were collected from Allama Iqbal Memorial Hospital & Islam Central hospital, Sialkot using Douleur neuropathic DN 4 questionnaire, and questions about age, lifestyle, glucose level, hypoesthesia, and gender were added. Data were analyzed by SPSS 20. Results: Out of 150 patients with DM, 49 were males and 101 were females. Active lifestyle was found in 53.33% and 46.67% were physically inactive. Higher glucose levels were found in 53.33% of males and 46.67% of females. In 38 (25.3%) individual's upper limb was involved and in 112 (74.7%) lower limb was involved. Out of 150 subjects, 138 (92%) had a score above 4.0 and thus had peripheral neuropathy. A positive correlation between lifestyle and peripheral neuropathy was found by applying Pearson chi-square and the p-value was 0.000

Lock-Free Concurrent Data Structures

\ua9 2017 by John Wiley & Sons, Inc. All rights reserved. Concurrent data structures are the data sharing side of parallel programming. An implementation of a data structure is called lock-free, if it allows multiple processes/hreads to access the data structure concurrently and also guarantees that at least one operation among those finishes in a finite number of its own steps regardless of the state of the other operations. This chapter provides a sufficient background and intuition to help the interested reader to navigate in the complex research area of lock-free data structures. It offers the programmer familiarity to the subject that allows using truly concurrent methods. The chapter discusses the fundamental synchronization primitives on which efficient lock-free data structures rely. It discusses the problem of managing dynamically allocated memory in lock-free concurrent data structures and general concurrent environments. The idiosyncratic architectural features of graphics processors that is important to consider when designing efficient lock-free concurrent data structures for this emerging area