The optical absorption data of Hydrogenated Amorphous Silicon was analyzed using a Dunstan model of optical absorption in amorphous semiconductors. This model introduces disorder into the band-band absorption through a linear exponential distribution of local energy gaps, and it accounts for both the Urbach and Tauc regions of the optical absorption edge.Compared to other models of similar bases, such as the O’Leary and Guerra models, it is simpler to understand mathematically and has a physical meaning. The optical absorption data of Jackson et al and Maurer et al were successfully interpreted using Dunstan’s model. Useful physical parameters are extracted especially the band to the band energy gap , which is the energy gap in the a

Gypseous soils are distributed in many regions in the world including Iraq, which cover more than (31%) of the surface area of the country. Existence of these soils, always with high gypsum content, caused difficult problems to the buildings and strategic projects due to dissolution and leaching of the gypsum caused by the action of water flow through soil mass. For the study, the gypseous soil was brought from Bahr Al-Najaf, Al-Najaf Governorate which is located in the middle of Iraq. The model pile was embedded in gypseous soil with 42% gypsum content. Compression axial model pile load tests have been carried out for model pile embedded in gypseous soil at initial degree of saturation of (7%) before and after soil satu

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

An Optimal Algorithm for HTML Page Building Process

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th