High-performance liquid chromatographic methods are used for the determination of water-soluble vitamins with UV-Vis. Detector. A reversed-phase high-performance liquid chromatographic has been developed for determination of water-soluble vitamins. Identification of compounds was achieved by comparing their retention times and UV spectra with those of standards solution. Separation was performed on a C18 column, using an isocratic 30% (v/v) acetonitril in dionozed water as mobile phase at pH 3.5 and flow rate 1.0m/min. The method provides low detection and quantification limits, good linearity in a large concentration interval and good precision. The detection limits ranged from 0.01 to 0.025µg/ml. The accuracy of the method was

Background: Poly (methyl methacrylate) has been widely utilized for fabrication of dentures for many years as it has good advantages but not achieved all demands of the mechanical properties such as low transverse strength, low impact strength, low surface hardness, high water solubility and high water sorption. Material and method: To provide bonding between ZrO2 nanoparticles and PMMA matrix, the ZrO2 Nano-fillers were surface-treated with a saline coupling agent. Plasma surface treatment of polyethylene (PE) fiber was done to change surface fiber by using DC- glow discharge system. For characterization of interring any functional groups, the (FTIR) spectrum were done .then the mechanical properties studied to choose the appropriate perc

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th

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

Accelerates operating managements in the facilities contemporary business environment toward redefining processes and strategies that you need to perform tasks of guaranteeing them continue in an environment performance dominated by economic globalization and the circumstances of uncertainty attempt the creation of a new structure through multiple pages seek to improve profitability and sustainable growth in performance in a climatefocuses on the development of institutional processes, reduce costs and achieve customer satisfaction to meet their demands and expectations are constantly changing. The research was presented structural matrix performance combines methodology Alsigma in order to improve customer satisfaction significantly bet

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing appli

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