Persons with spinal cord injury are at high risk of developing pressure injuries, and their caregivers are in a critical position to help prevent them. The objective of this study was to evaluate the effectiveness of an educational program for caregivers of persons with spinal cord injuries to prevent pressure injuries in Iraq. A pre- and post-test design was used and involved 25 caregivers of persons with spinal cord injury during the acute care phase in an SCI-specific unit of a hospital. A scale and questionnaire were used to gather the participants’ demographic information, pre- and post-educational program knowledge, and observations of their pre- and post-program performance of pressure injury preventive tasks. Descriptive s

Pressure ulcers are one of the most common hospital-acquired major conditions that occur in patients with mobility limitations and result in endangering patient safety, prolonging hospital stay, disability, and death. This study aims to examine the level of nurses’ practices and perceived barriers for preventing pressure ulcers among critically ill patients.

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

Accurate and correct price prediction of gold is significant to maintain the stability and fair operation of gold markets as well as the efficiency and proper functioning of financial markets related to gold trading. Gold prices have a long history of non-linear and non-stationary behavior that generates highly complex datasets which are very difficult to forecast with high accuracy and reliability. At the same time Support Vector Regression (SVR) has been utilized as a robust information for prediction not only gold prices but also overall metal price movements. First, the predictive capability of SVR is highly sensitive to hyperparameter selection which needs to be thoroughly tuned and optimized for potentially optimal performance. Theref