The purpose of this research work is to synthesize conjugates of some NSAIDs with sulfamethoxazole as possible mutual prodrugs to overcome the local gastric irritation of NSAID with free carboxyl group by formation of ester linkage that supposed to remain intact in stomach and may hydrolyze in intestine chemically or enzymatically; in addition to that attempting to target the synthesized derivative to the colon by formation of azo group that undergo reduction only by colonic bacterial azo reductaze enzyme to liberate the parent compound to act locally (treatment of  inflammation and infections in colon).

Key words: Mutual prodrug, Ester linkage, Azo bond, Colon targeting

The purpose of this research work is to synthesize conjugates of some NSAIDs with sulfamethoxazole as possible mutual prodrugs to overcome the local gastric irritation of NSAID with free carboxyl group by formation of ester linkage that supposed to remain intact in stomach and may hydrolyze in intestine chemically or enzymatically; in addition to that attempting to target the synthesized derivative to the colon by formation of azo group that undergo reduction only by colonic bacterial azo reductaze enzyme to liberate the parent compound to act locally (treatment of inflammation and infections in colon)

  Secnidazole was linked with ciprofloxacin as mutual prodrugs to get antibiotics with broader spectrum of activity, improved physicochemical properties and given by single dose to improve patient’s compliance. Furthermore, they provide structural modifications to overcome bacterial adaptation. The structures of the synthesized compounds were confirmed using FT-IR, mass spectrometry, elemental microanalysis (CHNO) and some physiochemical properties. This modification was led to an increase in Log P values for Mutual I (Log P 1.114) and Mutual II (Log P 1.97) compared with its values for Secnidazole (Log P -0.373) and ciprofloxacin (Log P -0.832). The solubility of prodrugs had been determined in different media, Mutual II showed 1

Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the  Random Waypoint model (RWP), Random Direction model (RD), Nomadic Co

Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the  Random Waypoint model (RWP), Random Direction model (RD), Nomadic Co

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

Using the Internet, nothing is secure and as we are in need of means of protecting our data, the use of passwords has become important in the electronic world. To ensure that there is no hacking and to protect the database that contains important information such as the ID card and banking information, the proposed system stores the username after hashing it using the 256 hash algorithm and strong passwords are saved to repel attackers using one of two methods: -The first method is to add a random salt to the password using the CSPRNG algorithm, then hash it using hash 256 and store it on the website. -The second method is to use the PBKDF2 algorithm, which salts the passwords and extends them (deriving the password) before being ha

Cloud storage provides scalable and low cost resources featuring economies of scale based on cross-user architecture. As the amount of data outsourced grows explosively, data deduplication, a technique that eliminates data redundancy, becomes essential. The most important cloud service is data storage. In order to protect the privacy of data owner, data are stored in cloud in an encrypted form. However, encrypted data introduce new challenges for cloud data deduplication, which becomes crucial for data storage. Traditional deduplication schemes cannot work on encrypted data. Existing solutions of encrypted data deduplication suffer from security weakness. This paper proposes a combined compressive sensing and video deduplication to maximize