Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Articles 2311 - 2320 of 2320

Full-Text Articles in Entire DC Network

A Reliable Algorithm For Solving Tenth-Order Boundary Value Problems, Muhammad Aslam Noor, Eisa Al-Said, Syed T. Mohyud-Din Jan 2012

A Reliable Algorithm For Solving Tenth-Order Boundary Value Problems, Muhammad Aslam Noor, Eisa Al-Said, Syed T. Mohyud-Din

Applied Mathematics & Information Sciences

In this paper, we use the variational iterative method for solving the tenth-order boundary value problems. The analytical solutions of the equations have been obtained in terms of convergent series with easily computable components. Several examples are given to check the efficiency of the proposed algorithm. The fact that variational iteration method solves nonlinear problems without using the Adomian’s polynomials is a clear advantage of this technique over the decomposition method.


Generalized Incomplete 2d Hermite Polynomials And Their Generating Relations, M. J. S. Shahwan Jan 2012

Generalized Incomplete 2d Hermite Polynomials And Their Generating Relations, M. J. S. Shahwan

Applied Mathematics & Information Sciences

The object of this paper is to derive generating relations for the generalized Incomplete 2D Hermite polynomials ( , ; ) , f x y t m n by giving suitable interpretations to the indices (m) and (n) through Weisners method


Numerical Calculation Of Rate-Distortion Function Of Information Source, Qianzhao Lei Jan 2012

Numerical Calculation Of Rate-Distortion Function Of Information Source, Qianzhao Lei

Applied Mathematics & Information Sciences

In order to maximize transmission efficiency, fully use available channels, we need to solve rate-distortion function of information source R(D) . For a given source, presented the distortion matrix, and set the accuracy ε, an iterative method can be used to get R(D) . Firstly, given the initial value of parameter S, which meaning the slope of the sought graph, matrix of the channel transition probabilities and the average distortion D with parameter S were calculated; then 0 D £ D as fidelity criteria, whether n 1 n D D e + − £ being true as iteration sentencing guidelines, …


Constructions Of Cryptographically Significant Boolean Permutations, Fengrong Zhang, Yupu Hu, Min Xie, Juntao Gao, Qichun Wang Jan 2012

Constructions Of Cryptographically Significant Boolean Permutations, Fengrong Zhang, Yupu Hu, Min Xie, Juntao Gao, Qichun Wang

Applied Mathematics & Information Sciences

In this paper, we focus on a class of Boolean permutations of an optimal algebraic degree. Firstly, we construct a class of Boolean permutations. We put forward a method to propose the inverse of a given Boolean permutation. It is shown that a Boolean permutation has an optimal algebraic degree if and only if its inverse has an optimal algebraic degree. Secondly, we present the inverse of the constructed Boolean permutation, and show the inverse permutation has the largest algebraic degree. Finally, we show that the constructed Boolean permutations can achieve optimum algebraic degree by selecting an appropriate initial vector …


A Software Reliability Modeling Method Based On Gene Expression Programming, Yongqiang Zhang And Jing Xiao Jan 2012

A Software Reliability Modeling Method Based On Gene Expression Programming, Yongqiang Zhang And Jing Xiao

Applied Mathematics & Information Sciences

In this paper, an improved GEP(Gene Expression Programming based on Block Strategy, BS-GEP) is proposed in consideration of the characteristics of software reliability growth models, on which a new software reliability modeling method is formed. Block strategy is the key point of BS-GEP, in which the population is divided into several blocks according to the individual fitness of each generation and the genetic operators are reset differently in each block to guarantee the genetic diversity. The new reliability model is constructed on software failure time series using BS-GEP algorithm, and compared with the traditional models. The simulation results show that …


Annotation: An Approach For Building Semantic Web Library, Hadeel S. Al-Obaidy, Amani Al Heela Jan 2012

Annotation: An Approach For Building Semantic Web Library, Hadeel S. Al-Obaidy, Amani Al Heela

Applied Mathematics & Information Sciences

In this paper, we describe the semantic annotation process for developing a semantic web application to a universitys library. Semantic annotation is the step that adds the effectiveness and reality to the semantic web application. It is annotating the documents published and distributed throughout the Web. The semantic annotation in this paper concerns about the research papers of the universitys faculty. Semantic annotation is nothing but tagging the instances data of ontology already created with classes then map in to the related ontology classes. Here we are going to use two tools for building annotation library, these tools are: OntoMat …


Analytical Solutions To The Dirac Equation In 1+1 Space-Time Dimension, H. Eleuch, A. D. Alhaidari, H. Bahlouli Jan 2012

Analytical Solutions To The Dirac Equation In 1+1 Space-Time Dimension, H. Eleuch, A. D. Alhaidari, H. Bahlouli

Applied Mathematics & Information Sciences

We consider the general Dirac equation in 1+1 space-time dimension with vector, scalar and pseudo-scalar interactions. We give general procedure on how to obtain its exact solution which can be put in closed form only for special types of potential. In addition we have given an analytical approximate solution for general potentials.


Analytical Solution To The Dirac Equation In 3+1 Space-Time Dimensions, H. Eleuch, H. Bahlouli Jan 2012

Analytical Solution To The Dirac Equation In 3+1 Space-Time Dimensions, H. Eleuch, H. Bahlouli

Applied Mathematics & Information Sciences

We consider the general Dirac equation in 3+1 space-time dimensions. We derive an analytical expression for the general solution of the Dirac equation. This solution has been generated by transforming the Dirac equation for one spinor component to a generalized 3D-Ricatti type of equation


An Algorithm For Minimization Of Quantum Cost, Anindita Banerjee, Anirban Pathak Jan 2012

An Algorithm For Minimization Of Quantum Cost, Anindita Banerjee, Anirban Pathak

Applied Mathematics & Information Sciences

A new algorithm for minimization of quantum cost of classical reversible and quantum circuits have been designed. The quantum cost obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm produces minimum quantum cost in all cases.


Self-Tuning Weighted Measurement Fusion Kalman Filter For Arma Signals With Colored Noise, Jinfang Liu, Zili Deng Jan 2012

Self-Tuning Weighted Measurement Fusion Kalman Filter For Arma Signals With Colored Noise, Jinfang Liu, Zili Deng

Applied Mathematics & Information Sciences

Based on the modern time series analysis method, for single channel autoregressive moving average (ARMA) signals with colored noise, a self-tuning weighted measurement fusion Kalman filter is presented when the model parameters and noise statistics are unknown. By applying the recursive instrumental variable (RIV) algorithm and the Gevers-Wouters (G-W) iterative algorithm with dead band, the local and fused estimates for the unknown model parameters and noise variances can be obtained. Then a self-tuning weighted measurement fusion Kalman filter is obtained by substituting the fused estimates into the corresponding optimal fusion Kalman filter. Further, applying the dynamic error system analysis (DESA) …