A novel analytical method is developed for the determination of azithromycin. The method utilizes continuous flow injection analysis to enhance the chemiluminescence system of luminol, H2O2, and Cr(III). The method demonstrated a linear dynamic range of 0.001–100 mmol L-1 with a high correlation coefficient (r) of 0.9978, and 0.001–150 mmol L-1 with a correlation coefficient (r) of 0.9769 for the chemiluminescence emission versus azithromycin concentration. The limit of detection (L.O.D.) of the method was found to be 18.725 ng.50 µL−1 based on the stepwise dilution method for the lowest concentration within the linear dynamic range of the calibration graph. The relative standard deviation (R.S.D. %) for n = 6 was less than 1.2%

Abstract ABSTRACT:BACKGROUND: Anterior cruciate ligament reconstruction (ACLR) is one of the most commonly performed orthopedic procedures. Technical factors especially correct tunnel placement play major role in its success. However its failure rate is still high (10%), and impingement of the graft on the posterior cruciate ligament (PCL) and the medial wall of the lateral femoral condyle is an important cause of failure. Wallplasty is a technique used to prevent graft impingement, but there is no consensus on its routine use.OBJECTIVE:Is to compare between the postoperative knee functional outcome and stability of arthroscopic ACLR performed with wallplasty versus those performed without wallplasty.PATIENTS AND METHODS: A prospective exp

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

An Optimal Algorithm for HTML Page Building Process

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the