This paper present the fast and robust approach of English text encryption and decryption based on Pascal matrix. The technique of encryption the Arabic or English text or both and show the result when apply this method on plain text (original message) and how will form the intelligible plain text to be unintelligible plain text in order to secure information from unauthorized access and from steel information, an encryption scheme usually uses a pseudo-random enecryption key generated by an algorithm. All this done by using Pascal matrix. Encryption and decryption are done by using MATLAB as programming language and notepad ++to write the input text.This paper present the fast and robust approach of English text encryption and decryption b

Abstract:

Robust statistics Known as, resistance to errors caused by deviation from the stability hypotheses of the statistical operations (Reasonable, Approximately Met, Asymptotically Unbiased, Reasonably Small Bias, Efficient ) in the data selected in a wide range of probability distributions whether they follow a normal distribution or a mixture of other distributions deviations different standard .

power spectrum function lead to, President role in the analysis of Stationary random processes, form stable random variables organized according to time, may be discrete random variables or continuous. It can be described by measuring its total capacity as function in frequency.

<

Flexible paving is the most popular type of paving used in road building and one of the biggest problems facing the world's paving business is the rising demand for scarce natural resources. Uncontrolled. Numerous studies have shown that secondary materials reduce the need for traditional materials, offer efficient waste disposal technology and lower the overall cost of paving. The current study aimed to evaluate the efficiency of both fibers and dust on the sustainability and cost of flexible pavement by studying each of polyester fibers as a waste of the textile industry and fibers or rubber particles as one of the rubber waste products, in addition to studying the efficiency of using cement dust and marble dust on the paving proc

Objective: To evaluate the functional outcomes after extended curettage and reconstruction using a combination of bone graft and bone cement (sandwich). Methodology: In this prospective case series 16 skeletally mature patients with primary giant cell tumor around the knee were included. Patients with previous surgically treated, malignant transformation, degenerative knee changes and those presenting with pathological fracture were excluded. The tumor was excised with bone graft filling space beneath the articular cartilage and a block of gel foam was placed over the cortical surface of picked bone graft. Remaining cavity was filled with polymethylmethacrylate cement (sandwich) with or without internal fixation. The func tional evaluation

Abstract

In this work, diabetic glucose concentration level control under disturbing meal has been controlled using two set of advanced controllers. The first set is sliding mode controllers (classical and integral) and the second set is represented by optimal LQR controllers (classical and Min-, ax). Due to their characteristic features of disturbance rejection, both integral sliding mode controller and LQR Minmax controller are dedicated here for comparison. The Bergman minimal mathematical model was used to represent the dynamic behavior of a diabetic patient’s blood glucose concentration to the insulin injection. Simulations based on Matlab/Simulink, were performed to verify the performance of each controll

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord