Background: Whey protein is the green-yellow colored, liquid portion of the milk, and it is also called the cheese serum, it is obtained after the separation of curd, during the coagulation of the milk. It contains a considerable amount of α-helix pattern with an evenly distributed hydrophobic and hydrophilic as well as basic and acidic amino acids along with their polypeptide chain. The major whey protein constituents include β-lactoglobulin (β-LG),α-lactalbumin (α-LA), immunoglobulins (IG), bovine serum albumin (BSA), bovine lactoperoxidase (LP), bovine lactoferrin (BLF) and minor amounts of a glycol macro peptide (GMP). Osseointegration can be defined as a process that is immune driven which leads to the formatio

A Forensic Accounting is represent science that deals with the application of knowledge in the areas of accounting, finance, tax and audit for the analysis, investigation, inquiry, inspection and testing issues in the civil law and criminal law in an attempt to reach the truth through which enable the Forensic Accountant to provide his Expert opinion , forensic accounting plays a major role by providing a range of important services in the field of investigation for fraud and litigation support, As one of the most important legal and accounting functions is to investigate allegations of alleged by the related parties, especially those allegations related to the existence of fraud, since the goal of judicial accountant will depend

2929-2933

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

Most dinoflagellate had a resting cyst in their life cycle.  This cyst was developed in unfavorable environmental condition. The conventional method for identifying dinoflagellate cyst in natural sediment requires morphological observation, isolating, germinating and cultivating the cysts.  PCR is a highly sensitive method for detecting dinoflagellate cyst in the sediment.  The aim of this study is to examine whether CO1 primer could detect DNA of multispecies dinoflagellate cysts in the sediment from our sampling sites. Dinoflagellate cyst DNA was extracted from 16 sediment samples. PCR method using COI primer was running. The sequencing of dinoflagellate cyst DNA was using BLAST. Results showed that there were two clades of dinoflag

In this paper, an enhanced artificial potential field (EAPF) planner is introduced. This planner is proposed to rapidly find online solutions for the mobile robot path planning problems, when the underlying environment contains obstacles with unknown locations and sizes. The classical artificial potential field represents both the repulsive force due to the detected obstacle and the attractive force due to the target. These forces can be considered as the primary directional indicator for the mobile robot. However, the classical artificial potential field has many drawbacks. So, we suggest two secondary forces which are called the midpoint

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res