Different ANN architectures of MLP have been trained by BP and used to analyze Landsat TM images. Two different approaches have been applied for training: an ordinary approach (for one hidden layer M-H1-L & two hidden layers M-H1-H2-L) and one-against-all strategy (for one hidden layer (M-H1-1)xL, & two hidden layers (M-H1-H2-1)xL). Classification accuracy up to 90% has been achieved using one-against-all strategy with two hidden layers architecture. The performance of one-against-all approach is slightly better than the ordinary approach

Metal-organic frameworks (MOFs) are a relatively new class of materials of unique porous structures and exceptional properties. Currently, more than 110,000 types of MOFs have been reported among the countless possibilities. In this study, we have synthesised a novel MOF using zirconium chloride as the metal source and 4,4'-dicarboxy-2,2'-biquinoline (bicinchoninic acid disodium salt) as the linker, which reacted in N,N-Dimethylformamide (DMF) solvent. Three preparation methods were employed to prepare five types of the MOF, and they were compared to optimize the synthesis conditions. The resulting MOFs, named Zr-BADS, were characterised using scanning electron microscopy (SEM), energy dispersive spectroscopy (EDS), microscopy, and

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored. A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure. Pharmacological

In recent days, the escalating need to seamlessly transfer data traffic without discontinuities across the Internet network has exerted immense pressure on the capacity of these networks. Consequently, this surge in demand has resulted in the disruption of traffic flow continuity. Despite the emergence of intelligent networking technologies such as software-defined networking, network cloudification, and network function virtualization, they still need to improve their performance. Our proposal provides a novel solution to tackle traffic flow continuity by controlling the selected packet header bits (Differentiated Services Code Point (DSCP)) that govern the traffic flow priority. By setting the DSCP bits, we can determine the appropriate p

This paper presents a study of a syndrome coding scheme for different binary linear error correcting codes that refer to the code families such as BCH, BKLC, Golay, and Hamming. The study is implemented on Wyner’s wiretap channel model when the main channel is error-free and the eavesdropper channel is a binary symmetric channel with crossover error probability (0 < Pe ≤ 0.5) to show the security performance of error correcting codes while used in the single-staged syndrome coding scheme in terms of equivocation rate. Generally, these codes are not designed for secure information transmission, and they have low equivocation rates when they are used in the syndrome coding scheme. Therefore, to improve the transmiss

  The great scientific progress has led to widespread Information as information accumulates in large databases is important in trying to revise and compile this vast amount of data and, where its purpose to extract hidden information or classified data under their relations with each other in order to take advantage of them for technical purposes.

      And work with data mining (DM) is appropriate in this area because of the importance of research in the (K-Means) algorithm for clustering data in fact applied with effect can be observed in variables by changing the sample size (n) and the number of clusters (K)