Background: Low-back pain is a major health and economical problem that affects populations around the world. Chronic low-back pain, in particular, is a major cause of medical expenses, work absenteeism, and disability. Objective: To explore the effect of adding cognitive-behavioral therapy to physical therapy interventions in patients with chronic non-specific back pain. Patients and methods: 20 male and female patients between 25 and 40 years old diagnosed as chronic non-specific back pain with central sensitization and fear avoidance behaviors symptoms participated in this study. Patients were randomly assigned into two groups. The first group was treated by cognitive behavioral therapy (graded exposure and graded activity) in addition to physiotherapy the second group was treated by physical therapy interventions which was given only 3 times/week for 4 consecutive weeks. Results: Descriptive statistics was used to identify each variable's mean and standard deviation. A paired t-test was used to compare characteristics of patients between both groups. Pre-treatment results showed no significant difference in both measured variables of Oswestry, and pain in both groups (P > 0.05). On the other hand, post-treatment results showed a significant decrease in the Oswestry, and pain only in group A (the study group). Conclusion:Adding graded exposure and graded activity as an operant cognitive behavioural therapy approach to physical therapy program is more beneficial than physical therapy program alone. More data and follow up needed for this study.

In this paper, we study the structure of the finite group G given that certain subgroups of prime power order are well-situated, which means that they are normally complemented modulo their normal core.

A subgroup H of a finite group G is said to be c-normal in G if there exists a normal subgroup N of G such that G = HN with H n N < H a = Core o (//). We are interested in studying the influence of the c-normality of certain subgroups of prime power order on the structure of finite groups.2000 Mathematics subject classification: primary 20D10, 20D30.

No abstract

No abstract

No abstract

Integrating an arbitrary polynomial function f of degree D over a general simplex in dimension n is well-known in the state of the art to be NP-hard when D and n are allowed to vary, but it is time-polynomial when D or n are fixed. This paper presents an efficient algorithm to compute the exact value of this integral. The proposed algorithm has a time-polynomial complexity when D or n are fixed, and it requires a reasonable time when the values of D and n are less than 10 using widely available standard calculators such as desktops.

No abstract