High peak to average power ration (PAPR) in orthogonal frequency division multiplexing (OFDM) is an important problem, which increase the cost and complexity of high power amplifiers. One of the techniques used to reduce the PAPR in OFDM system is the tone reservation method (TR). In our work we propose a modified tone reservation method to decrease the PAPR with low complexity compared with the conventional TR method by process the high and low amplitudes at the same time. An image of size 128×128 is used as a source of data that transmitted using OFDM system. The proposed method decrease the PAPR by 2dB compared with conventional method with keeping the performance unchanged. The performance of the proposed method is tested with

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

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

t:

The most famous thing a person does is talk. He loves and hates, and continues with it confirming relationships, and with it, too, comes out of disbelief into faith. Marry a word and separate with a word. He reaches the top of the heavens with a kind word, with which he will gain the pleasure of God, and the Lord of a word that the servant speaks to which God writes with our pleasure or throws him on his face in the fire. Emotions are inflamed, the United Nations is intensified with a word, and relations between states and war continue with a word.

What comes out of a person’s mouth is a translator that expresses the repository of his conscience and reveals the place of his bed, for it is evidence of

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