Abstract :In this study, amygdaline in Iraqi plant seeds was extracted and isolated from their seeds matrix using reflux procedure and subsequently identified and determined by high performance liquid chromatography (HPLC) on reversed phase column of LC-18 (150mm x 4.6mm, 5?m )with actonitrile :water ( 50 : 50 ) as mobile phase at flow rate of ( 0.5 mL/min ) and detection at wavelength of 215 nm.The experimental results indicated that the linearity of calibration is in the range of 1.0-30.0 mg L-1amygdaline with the correlation coefficient of 0.9949. The limit of detection (LOD) and limit of quantitation (LOQ) for amygdaline were of 0.88 and 2.93 mg L-1 in standard pure sample. The mean recovery percent is 97.34±0.58 at 95% confidence inte

This research aims to identify how organizational compatibility, which represents the independent variable, affects higher performance, which is considered a dependent variable, given the importance of these variables in industrial organizations and their clear impact on their stability, survival, and growth in the light of changing environmental challenges.  Where the practical research problem was represented by the weakness of awareness of the importance toward organizational compatibility and its dimensions (organizational loyalty, organizational similarity, affiliation or membership, compatibility with goals, and compatibility with values), which is meant by the individual's compatibility with the organization in which he/she w

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an