Abstract: In wavelet regression, choosing threshold value is a crucial issue. A too large value cuts too many coefficients resulting in over smoothing. Conversely, a too small threshold value allows many coefficients to be included in reconstruction, giving a wiggly estimate which result in under smoothing. However, the proper choice of threshold can be considered as a careful balance of these principles. This paper gives a very brief introduction to some thresholding selection methods. These methods include: Universal, Sure, Ebays, Two fold cross validation and level dependent cross validation. A simulation study on a variety of sample sizes, test functions, signal-to-noise ratios is conducted to compare their numerical performances using three different noise structures. For Gaussian noise, EBayes outperforms in all cases for all used functions while Two fold cross validation provides the best results in the case of long tail noise. For large values of signal-to-noise ratios, level dependent cross validation works well under correlated noises case. As expected, increasing both sample size and level of signal to noise ratio, increases estimation efficiency.
Abstract: The problem of robust fuzzy control for a class of
nonlinear fuzzy impulsive singular perturbed systems with
time-varying delay is investigated by employing Lyapunov functions.
The nonlinear delay system is built based on the well-known T–S
fuzzy model. The so-called parallel distributed compensation idea is
employed to design the state feedback controller. Sufficient conditions
for global exponential stability of the closed-loop system are derived
in terms of linear matrix inequalities (LMIs), which can be easily
solved by LMI technique. Some simulations illustrate the effectiveness
of the proposed method.
Abstract: The RK5GL3 method is a numerical method for solving
initial value problems in ordinary differential equations, and is based
on a combination of a fifth-order Runge-Kutta method and 3-point
Gauss-Legendre quadrature. In this paper we describe the propagation
of local errors in this method, and show that the global order of
RK5GL3 is expected to be six, one better than the underlying Runge-
Kutta method.
Abstract: The dynamics of a predator-prey model with continuous
threshold policy harvesting functions on the prey is studied. Theoretical
and numerical methods are used to investigate boundedness
of solutions, existence of bionomic equilibria, and the stability properties
of coexistence equilibrium points and periodic orbits. Several
bifurcations as well as some heteroclinic orbits are computed.
Abstract: In this paper a genetic algorithms approach for solving the linear and quadratic fuzzy equations Ãx̃=B̃ and Ãx̃2 + B̃x̃=C̃ , where Ã, B̃, C̃ and x̃ are fuzzy numbers is proposed by genetic algorithms. Our genetic based method initially starts with a set of random fuzzy solutions. Then in each generation of genetic algorithms, the solution candidates converge more to better fuzzy solution x̃b . In this proposed method the final reached x̃b is not only restricted to fuzzy triangular and it can be fuzzy number.
Abstract: The main aim of this study is to describe and introduce a method of numerical analysis in obtaining approximate solutions for the SIR-SI differential equations (susceptible-infectiverecovered for human populations; susceptible-infective for vector populations) that represent a model for dengue disease transmission. Firstly, we describe the ordinary differential equations for the SIR-SI disease transmission models. Then, we introduce the numerical analysis of solutions of this continuous time, discrete space SIR-SI model by simplifying the continuous time scale to a densely populated, discrete time scale. This is followed by the application of this numerical analysis of solutions of the SIR-SI differential equations to the estimation of relative risk using continuous time, discrete space dengue data of Kuala Lumpur, Malaysia. Finally, we present the results of the analysis, comparing and displaying the results in graphs, table and maps. Results of the numerical analysis of solutions that we implemented offers a useful and potentially superior model for estimating relative risks based on continuous time, discrete space data for vector borne infectious diseases specifically for dengue disease.
Abstract: A new Meta heuristic approach called "Randomized gravitational emulation search algorithm (RGES)" for solving vertex covering problems has been designed. This algorithm is found upon introducing randomization concept along with the two of the four primary parameters -velocity- and -gravity- in physics. A new heuristic operator is introduced in the domain of RGES to maintain feasibility specifically for the vertex covering problem to yield best solutions. The performance of this algorithm has been evaluated on a large set of benchmark problems from OR-library. Computational results showed that the randomized gravitational emulation search algorithm - based heuristic is capable of producing high quality solutions. The performance of this heuristic when compared with other existing heuristic algorithms is found to be excellent in terms of solution quality.
Abstract: Our adaptive multimodal system aims at correctly
presenting a mathematical expression to visually impaired users.
Given an interaction context (i.e. combination of user, environment
and system resources) as well as the complexity of the expression
itself and the user-s preferences, the suitability scores of different
presentation format are calculated. Unlike the current state-of-the art
solutions, our approach takes into account the user-s situation and not
imposes a solution that is not suitable to his context and capacity. In
this wok, we present our methodology for calculating the
mathematical expression complexity and the results of our
experiment. Finally, this paper discusses the concepts and principles
applied on our system as well as their validation through cases
studies. This work is our original contribution to an ongoing research
to make informatics more accessible to handicapped users.
Abstract: This paper addresses the controller synthesis problem of discrete-time switched positive systems with bounded time-varying delays. Based on the switched copositive Lyapunov function approach, some necessary and sufficient conditions for the existence of state-feedback controller are presented as a set of linear programming and linear matrix inequality problems, hence easy to be verified. Another advantage is that the state-feedback law is independent on time-varying delays and initial conditions. A numerical example is provided to illustrate the effectiveness and feasibility of the developed controller.
Abstract: The effect of variable chemical reaction on heat and mass transfer characteristics over unsteady stretching surface embedded in a porus medium is studied. The governing time dependent boundary layer equations are transformed into ordinary differential equations containing chemical reaction parameter, unsteadiness parameter, Prandtl number and Schmidt number. These equations have been transformed into a system of first order differential equations. MATHEMATICA has been used to solve this system after obtaining the missed initial conditions. The velocity gradient, temperature, and concentration profiles are computed and discussed in details for various values of the different parameters.
Abstract: Sufficient linear matrix inequalities (LMI) conditions for regularization of discrete-time singular systems are given. Then a new class of regularizing stabilizing controllers is discussed. The proposed controllers are the sum of predictive and memoryless state feedbacks. The predictive controller aims to regularizing the singular system while the memoryless state feedback is designed to stabilize the resulting regularized system. A systematic procedure is given to calculate the controller gains through linear matrix inequalities.
Abstract: The residue number system (RNS), due to its
properties, is used in applications in which high performance
computation is needed. The carry free nature, which makes the
arithmetic, carry bounded as well as the paralleling facility is the
reason of its capability of high speed rendering. Since carry is not
propagated between the moduli in this system, the performance is
only restricted by the speed of the operations in each modulus. In this
paper a novel method of number representation by use of redundancy
is suggested in which {rn- 2,rn-1,rn} is the reference moduli set
where r=2k+1 and k =1, 2,3,.. This method achieves fast
computations and conversions and makes the circuits of them much
simpler.
Abstract: In this paper, we study the existence of solution of
the four-point boundary value problem for second-order differential
equations with impulses by using Leray-Schauder theory:
Abstract: Beginning from the creator of integro-differential
equations Volterra, many scientists have investigated these
equations. Classic method for solving integro-differential
equations is the quadratures method that is successfully applied up
today. Unlike these methods, Makroglou applied hybrid methods
that are modified and generalized in this paper and applied to the
numerical solution of Volterra integro-differential equations. The
way for defining the coefficients of the suggested method is also
given.
Abstract: In the present work, we propose a new method for
solving the matrix equation AXB=F . The new method can
be considered as a generalized form of the well-known global full
orthogonalization method (Gl-FOM) for solving multiple linear
systems. Hence, the method will be called extended Gl-FOM (EGl-
FOM). For implementing EGl-FOM, generalized forms of block
Krylov subspace and global Arnoldi process are presented. Finally,
some numerical experiments are given to illustrate the efficiency of
our new method.
Abstract: The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP - complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Support Ratio Algorithm (SRA), is designed to find the minimum weighted vertex cover of a graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the SRA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.
Abstract: In today-s modern world, the number of vehicles is
increasing on the road. This causes more people to choose walking
instead of traveling using vehicles. Thus, proper planning of
pedestrians- paths is important to ensure the safety of pedestrians in a
walking area. Crowd dynamics study the pedestrians- behavior and
modeling pedestrians- movement to ensure safety in their walking paths.
To date, many models have been designed to ease pedestrians-
movement. The Social Force Model is widely used among researchers
as it is simpler and provides better simulation results. We will discuss
the problem regarding the ritual of circumambulating the Ka-aba
(Tawaf) where the entrances to this area are usually congested which
worsens during the Hajj season. We will use the computer simulation
model SimWalk which is based on the Social Force Model to simulate
the movement of pilgrims in the Tawaf area. We will first discuss the
effect of uni and bi-directional flows at the gates. We will then restrict
certain gates to the area as the entrances only and others as exits only.
From the simulations, we will study the effect of the distance of other
entrances from the beginning line and their effects on the duration of
pilgrims circumambulate Ka-aba. We will distribute the pilgrims at the
different entrances evenly so that the congestion at the entrances can be
reduced. We would also discuss the various locations and designs of
barriers at the exits and its effect on the time taken for the pilgrims to
exit the Tawaf area.
Abstract: In this paper, by introducing twice continuously differentiable mappings, we develop an interior path following following method, which enables us to give a constructive proof of the general Brouwer fixed point theorem and thus to solve fixed point problems in a class of non-convex sets. Under suitable conditions, a smooth path can be proven to exist. This can lead to an implementable globally convergent algorithm. Several numerical examples are given to illustrate the results of this paper.
Abstract: The bag radius of the nucleon can be determined by MIT bag model based on electric and magnetic form factors of the nucleon. Also we determined the masses and magnetic moment of the nucleon with MIT bag model, using bag radius and compared with other results, suggests a suitable compatibility.