Abstract: Bayesian networks are now considered to be a promising tool in the field of energy with different applications. In this study, the aim was to indicate the states of a previous constructed Bayesian network related to the solar energy in Egypt and the factors affecting its market share, depending on the followed data distribution type for each factor, and using either the Z-distribution approach or the Chebyshev’s inequality theorem. Later on, the separate and the conditional probabilities of the states of each factor in the Bayesian network were derived, either from the collected and scrapped historical data or from estimations and past studies. Results showed that we could use the constructed model for scenario and decision analysis concerning forecasting the total percentage of the market share of the solar energy in Egypt by 2035 and using it as a stable renewable source for generating any type of energy needed. Also, it proved that whenever the use of the solar energy increases, the total costs decreases. Furthermore, we have identified different scenarios, such as the best, worst, 50/50, and most likely one, in terms of the expected changes in the percentage of the solar energy market share. The best scenario showed an 85% probability that the market share of the solar energy in Egypt will exceed 10% of the total energy market, while the worst scenario showed only a 24% probability that the market share of the solar energy in Egypt will exceed 10% of the total energy market. Furthermore, we applied policy analysis to check the effect of changing the controllable (decision) variable’s states acting as different scenarios, to show how it would affect the target nodes in the model. Additionally, the best environmental and economical scenarios were developed to show how other factors are expected to be, in order to affect the model positively. Additional evidence and derived probabilities were added for the weather dynamic nodes whose states depend on time, during the process of converting the Bayesian network into a dynamic Bayesian network.
Abstract: In this paper, numerical approximate Laplace transform inversion algorithm based on Chebyshev polynomial of second kind is developed using odd cosine series. The technique has been tested for three different functions to work efficiently. The illustrations show that the new developed numerical inverse Laplace transform is very much close to the classical analytic inverse Laplace transform.
Abstract: Digital images are widely used in computer
applications. To store or transmit the uncompressed images
requires considerable storage capacity and transmission bandwidth.
Image compression is a means to perform transmission or storage of
visual data in the most economical way. This paper explains about
how images can be encoded to be transmitted in a multiplexing
time-frequency domain channel. Multiplexing involves packing
signals together whose representations are compact in the working
domain. In order to optimize transmission resources each 4 × 4
pixel block of the image is transformed by a suitable polynomial
approximation, into a minimal number of coefficients. Less than
4 × 4 coefficients in one block spares a significant amount of
transmitted information, but some information is lost. Different
approximations for image transformation have been evaluated as
polynomial representation (Vandermonde matrix), least squares +
gradient descent, 1-D Chebyshev polynomials, 2-D Chebyshev
polynomials or singular value decomposition (SVD). Results have
been compared in terms of nominal compression rate (NCR),
compression ratio (CR) and peak signal-to-noise ratio (PSNR)
in order to minimize the error function defined as the difference
between the original pixel gray levels and the approximated
polynomial output. Polynomial coefficients have been later encoded
and handled for generating chirps in a target rate of about two
chirps per 4 × 4 pixel block and then submitted to a transmission
multiplexing operation in the time-frequency domain.
Abstract: In this study, one dimensional phase change problem
(a Stefan problem) is considered and a numerical solution of this
problem is discussed. First, we use similarity transformation to
convert the governing equations into ordinary differential equations
with its boundary conditions. The solutions of ordinary differential
equation with the associated boundary conditions and interface
condition (Stefan condition) are obtained by using a numerical
approach based on operational matrix of differentiation of shifted
second kind Chebyshev wavelets. The obtained results are compared
with existing exact solution which is sufficiently accurate.
Abstract: The edges of low contrast images are not clearly
distinguishable to human eye. It is difficult to find the edges and
boundaries in it. The present work encompasses a new approach for
low contrast images. The Chebyshev polynomial based fractional
order filter has been used for filtering operation on an image. The
preprocessing has been performed by this filter on the input image.
Laplacian of Gaussian method has been applied on preprocessed
image for edge detection. The algorithm has been tested on two test
images.
Abstract: In this paper, we introduce a generalized Chebyshev
collocation method (GCCM) based on the generalized Chebyshev
polynomials for solving stiff systems. For employing a technique
of the embedded Runge-Kutta method used in explicit schemes, the
property of the generalized Chebyshev polynomials is used, in which
the nodes for the higher degree polynomial are overlapped with those
for the lower degree polynomial. The constructed algorithm controls
both the error and the time step size simultaneously and further
the errors at each integration step are embedded in the algorithm
itself, which provides the efficiency of the computational cost. For
the assessment of the effectiveness, numerical results obtained by the
proposed method and the Radau IIA are presented and compared.
Abstract: The main purpose of this paper is to consider the new kind of approximation which is called as t-best coapproximation in fuzzy n-normed spaces. The set of all t-best coapproximation define the t-coproximinal, t-co-Chebyshev and F-best coapproximation and then prove several theorems pertaining to this sets.
Abstract: The main purpose of this paper is to consider the t-best co-approximation and t-best simultaneous co-approximation in fuzzy normed spaces. We develop the theory of t-best co-approximation and t-best simultaneous co-approximation in quotient spaces. This new concept is employed us to improve various characterisations of t-co-proximinal and t-co-Chebyshev sets.
Abstract: The paper deals with the minimax design of two-channel linear-phase (LP) quadrature mirror filter (QMF) banks using infinite impulse response (IIR) digital all-pass filters (DAFs). Based on the theory of two-channel QMF banks using two IIR DAFs, the design problem is appropriately formulated to result in an appropriate Chebyshev approximation for the desired group delay responses of the IIR DAFs and the magnitude response of the low-pass analysis filter. Through a frequency sampling and iterative approximation method, the design problem can be solved by utilizing a weighted least squares approach. The resulting two-channel QMF banks can possess approximately LP response without magnitude distortion. Simulation results are presented for illustration and comparison.
Abstract: The purpose of this work is to present a method for
rigid registration of medical images using 1D binary projections
when a part of one of the two images is missing. We use 1D binary
projections and we adjust the projection limits according to the
reduced image in order to perform accurate registration. We use the
variance of the weighted ratio as a registration function which we
have shown is able to register 2D and 3D images more accurately and
robustly than mutual information methods. The function is computed
explicitly for n=5 Chebyshev points in a [-9,+9] interval and it is
approximated using Chebyshev polynomials for all other points. The
images used are MR scans of the head. We find that the method is
able to register the two images with average accuracy 0.3degrees for
rotations and 0.2 pixels for translations for a y dimension of 156 with
initial dimension 256. For y dimension 128/256 the accuracy
decreases to 0.7 degrees for rotations and 0.6 pixels for translations.
Abstract: This paper presents the application of a signal intensity
independent similarity criterion for rigid and non-rigid body
registration of binary objects. The criterion is defined as the
weighted ratio image of two images. The ratio is computed on a
voxel per voxel basis and weighting is performed by setting the raios
between signal and background voxels to a standard high value. The
mean squared value of the weighted ratio is computed over the union
of the signal areas of the two images and it is minimized using the
Chebyshev polynomial approximation.
Abstract: A numerical method for solving nonlinear Fredholm integral equations of second kind is proposed. The Fredholm type equations which have many applications in mathematical physics are then considered. The method is based on hybrid function approximations. The properties of hybrid of block-pulse functions and Chebyshev polynomials are presented and are utilized to reduce the computation of nonlinear Fredholm integral equations to a system of nonlinear. Some numerical examples are selected to illustrate the effectiveness and simplicity of the method.
Abstract: The optimization and control problem for 4D trajectories
is a subject rarely addressed in literature. In the 4D navigation
problem we define waypoints, for each mission, where the arrival
time is specified in each of them. One way to design trajectories for
achieving this kind of mission is to use the trajectory optimization
concepts. To solve a trajectory optimization problem we can use
the indirect or direct methods. The indirect methods are based on
maximum principle of Pontryagin, on the other hand, in the direct
methods it is necessary to transform into a nonlinear programming
problem. We propose an approach based on direct methods with a
pseudospectral integration scheme built on Chebyshev polynomials.
Abstract: As we know, most differential equations concerning
physical phenomenon could not be solved by analytical method. Even if we use Series Method, some times we need an appropriate change of variable, and even when we can, their closed form solution may be
so complicated that using it to obtain an image or to examine the structure of the system is impossible. For example, if we consider Schrodinger equation, i.e.,
We come to a three-term recursion relations, which work with it takes, at least, a little bit time to get a series solution[6]. For this
reason we use a change of variable such as or when we consider the orbital angular momentum[1], it will be
necessary to solve. As we can observe, working with this equation is tedious. In this paper, after introducing Clenshaw method, which is a kind of Spectral method, we try to solve some of such equations.
Abstract: This manuscript presents a method for the numerical solution of the Cauchy type singular integral equations of the first kind, over a finite segment which is bounded at the end points of the finite segment. The Chebyshev polynomials of the second kind with the corresponding weight function have been used to approximate the density function. The force function is approximated by using the Chebyshev polynomials of the first kind. It is shown that the numerical solution of characteristic singular integral equation is identical with the exact solution, when the force function is a cubic function. Moreover, it also shown that this numerical method gives exact solution for other singular integral equations with degenerate kernels.
Abstract: This paper presents the application of a signal intensity independent registration criterion for non-rigid body registration of medical images. The criterion is defined as the weighted ratio image of two images. The ratio is computed on a voxel per voxel basis and weighting is performed by setting the ratios between signal and background voxels to a standard high value. The mean squared value of the weighted ratio is computed over the union of the signal areas of the two images and it is minimized using the Chebyshev polynomial approximation. The geometric transformation model adopted is a local cubic B-splines based model.
Abstract: To improve the dynamics response of the vehicle
passive suspension, a two-terminal mass is suggested to connect in
parallel with the suspension strut. Three performance criteria, tire grip,
ride comfort and suspension deflection, are taken into consideration to
optimize the suspension parameters. However, the three criteria are
conflicting and non-commensurable. For this reason, the Chebyshev
goal programming method is applied to find the best tradeoff among
the three objectives. A simulation case is presented to describe the
multi-objective optimization procedure. For comparison, the
Chebyshev method is also employed to optimize the design of a
conventional passive suspension. The effectiveness of the proposed
design method has been clearly demonstrated by the result. It is also
shown that the suspension with a two-terminal mass in parallel has
better performance in terms of the three objectives.
Abstract: In this paper we study some numerical methods to solve a model one-dimensional convection–diffusion equation. The semi-discretisation of the space variable results into a system of ordinary differential equations and the solution of the latter involves the evaluation of a matrix exponent. Since the calculation of this term is computationally expensive, we study some methods based on Krylov subspace and on Restrictive Taylor series approximation respectively. We also consider the Chebyshev Pseudospectral collocation method to do the spatial discretisation and we present the numerical solution obtained by these methods.
Abstract: This paper presents the application of a signal
intensity independent registration criterion for 2D rigid body
registration of medical images using 1D binary projections. The
criterion is defined as the weighted ratio of two projections. The ratio
is computed on a pixel per pixel basis and weighting is performed by
setting the ratios between one and zero pixels to a standard high
value. The mean squared value of the weighted ratio is computed
over the union of the one areas of the two projections and it is
minimized using the Chebyshev polynomial approximation using
n=5 points. The sum of x and y projections is used for translational
adjustment and a 45deg projection for rotational adjustment. 20 T1-
T2 registration experiments were performed and gave mean errors
1.19deg and 1.78 pixels. The method is suitable for contour/surface
matching. Further research is necessary to determine the robustness
of the method with regards to threshold, shape and missing data.
Abstract: A numerical method for Riccati equation is presented in this work. The method is based on the replacement of unknown functions through a truncated series of hybrid of block-pulse functions and Chebyshev polynomials. The operational matrices of derivative and product of hybrid functions are presented. These matrices together with the tau method are then utilized to transform the differential equation into a system of algebraic equations. Corresponding numerical examples are presented to demonstrate the accuracy of the proposed method.