To demonstrate the effect of changing cavity length for FM mode locked on pulse parameters and make comparison for both dispersion regime , a plot for each pulse parameter as Lr function are presented for normal and anomalous dispersion regimes . The analysis is based on the theoretical study and the results of numerical simulation using MATLAB. The effect of both normal and anomalous dispersion regimes on output pulses is investigate Fiber length effects on pulse parameters are investigated by driving the modulator into different values. A numerical solution for model equations using fourth-fifth order, Runge-Kutta method is performed through MATLAB 7.0 program. Fiber length effect on pulse parameters is investigated by driving th

Investigation regarding queue length dynamics have been explored using various kinds of models including ordinary differential equations (ODEs). ODEs possess the advantageous property of having a continuous-time representation of queue length dynamics, thus its adoption in this article in modelling various scenarios as system of first-order ODEs. Specifically, a multi-server queue is considered and a numerical approach for solving first-order ODEs using MATLAB is adopted to obtain approximate solutions of the resultant models. The results display the dynamics of the queue length in each scenario, thus showing the usefulness of ODEs in analysing the behaviour of queues using system of ODEs.

The contemporary development applications on scientific areas of acyclic and cyclic Schiff bases and their complexes.

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove

         Certain cyclic amine derivatives of metronidazole via acetate spacer were prepared. Cyclic amines used are piperidine and piperazine to improve the physicochemical properties and reduce some of metronidazole side effects. This is believed to be done by modification of its structural features to get prodrugs with improved properties over that of metronidazole. The present work includes esterification of metronidazole with choroacetic acid, N-alkylation of the cyclic amines by the halogenated ester and characterization of their structures by spectral(UV and IR) and elemental(CHN)analysis.The melting points, degree of solubilities and partition coefficients were also determined. Both metronid

This paper presents L₁-adaptive controller for controlling uncertain parameters and time-varying unknown parameters to control the position of a DC servomotor. For the purpose of comparison, the effectiveness of L₁-adaptive controller for position control of studied servomotor has been examined and compared with another adaptive controller; Model Reference Adaptive Controller (MRAC). Robustness of both L₁-adaptive controller and model reference adaptive controller to different input reference signals and different structures of uncertainty were studied. Three different types of input signals are taken into account; ramp, step and sinusoidal. The L₁-adaptive controller ensured uniformly bounded

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