This work presents a symmetric cryptography coupled with Chaotic NN , the encryption algorithm process the data as a blocks and it consists of multilevel( coding of character, generates array of keys (weights),coding of text and chaotic NN ) , also the decryption process consists of multilevel (generates array of keys (weights),chaotic NN, decoding of text and decoding of character).Chaotic neural network is used as a part of the proposed system with modifying on it ,the keys that are used in chaotic sequence are formed by proposed key generation algorithm .The proposed algorithm appears efficiency during the execution time where it can encryption and decryption long messages by short time and small memory (chaotic NN offer capacity of m

Abstract

In this research we study the wavelet characteristics for the important time series known as Sunspot, on the aim of verifying the periodogram that other researchers had reached by the spectral transform, and noticing the variation in the period length on one side and the shifting on another.

A continuous wavelet analysis is done for this series and the periodogram in it is marked primarily. for more accuracy, the series is partitioned to its the approximate and the details components to five levels, filtering these components by using fixed threshold on one time and independent threshold on another, finding the noise series which represents the difference between

A new approach for baud time (or baud rate) estimation of a random binary signal is presented. This approach utilizes the spectrum of the signal after nonlinear processing in a way that the estimation error can be reduced by simply increasing the number of the processed samples instead of increasing the sampling rate. The spectrum of the new signal is shown to give an accurate estimate about the baud time when there is no apriory information or any restricting preassumptions. The performance of the estimator for random binary square waves perturbed by white Gaussian noise and ISI is evaluated and compared with that of the conventional estimator of the zero crossing detector.

In this paper, we characterize the percolation condition for a continuum secondary cognitive radio network under the SINR model. We show that the well-established condition for continuum percolation does not hold true in the SINR regime. Thus, we find the condition under which a cognitive radio network percolates. We argue that due to the SINR requirements of the secondaries along with the interference tolerance of the primaries, not all the deployed secondary nodes necessarily contribute towards the percolation process- even though they might participate in the communication process. We model the invisibility of such nodes using the concept of Poisson thinning, both in the presence and absence of primaries. Invisibility occurs due to nodes

 The aim of this paper, is to discuss several high performance training algorithms fall into two main categories. The first category uses heuristic techniques, which were developed from an analysis of the performance of the standard gradient descent algorithm. The second category of fast algorithms uses standard numerical optimization techniques such as: quasi-Newton . Other aim is to solve the drawbacks related with these training algorithms and propose an efficient training algorithm for FFNN

This research presents a model for surveying networks configuration which is designed and called a Computerized Integrated System for Triangulation Network Modeling (CISTNM). It focuses on the strength of figure as a concept then on estimating the relative error (RE) for the computed side (base line) triangulation element. The CISTNM can compute the maximum elevations of the highest
obstacles of the line of sight, the observational signal tower height, the contribution of each triangulation station with their intervisibility test and analysis. The model is characterized by the flexibility to select either a single figure or a combined figures network option. Each option includes three other implicit options such as: triangles, quadri

         Let  be any group with identity element (e) . A subgroup intersection graph of  a subset  is the Graph with V ( ) =  - e and two separate peaks c and d contiguous for c and d if and only if      , Where  is a Periodic subset of resulting from  . We find some topological indicators in this paper and Multi-border (Hosoya and Schultz) of   , where    ,  is aprime number.

Background: Removal of bacteria from the pulp system by instrumentation of an infected root canal, will be significantly reduced the number of bacteria, but it is well documented that instrumentation alone can-not clean and kill all bacteria found on the root canal walls. Antibacterial irrigants are needed to kill the remaining microorganisms. The aims of this study was to assess antibacterial effect of titanium tetrafluoride (TiF4) solution and brewing green tea against root canal bacteria and to compare with sodium hypochlorite and normal saline through microbiological and molecular studies. Materials and methods: Microbiological study was carried out to determine the concentration of titanium tetrafluoride and brewing green tea at which

Text science presented a set of criteria to make the text essentially a project to create
texts and use. Me and means of cohesion script text scientists, two standard foundries and
knitting. Find this means their equivalent in the Arab rhetorical Heritage has been found, it
means foundries find Accompanying represented (link grammar in the classroom and link),
and referrals represented by (Baldmair, Ldefinition, and the name of the signal), and
deletion, and repetition, and presentation delays. As in the standard knitting it has confirmed
Albulagjun Arabs on the semantic consistency between the text components, as reflected in
the moral link in Chapter interfaces, as well as in moral coherence between parts of the te

   For a finite group G, the intersection graph   of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph  of subgroups of the dihedral group  for distinct primes . We also find the mean distance of the graph  .