Mathematical, Computational, Physical, Electrical and Computer Engineering

Commenced in January 1999 | Frequency: Monthly | Edition: International | Paper Count: 59 |

59

291

Hopf Bifurcation Analysis for a Delayed Predator–prey System with Stage Structure

In this paper, a delayed predator–prey system with stage
structure is investigated. Sufficient conditions for the system to have
multiple periodic solutions are obtained when the delay is sufficiently
large by applying Bendixson-s criterion. Further, some numerical
examples are given.

58

546

Multiple Power Flow Solutions Using Particle Swarm Optimization with Embedded Local Search Technique

Particle Swarm Optimization (PSO) with elite PSO
parameters has been developed for power flow analysis under
practical constrained situations. Multiple solutions of the power flow
problem are useful in voltage stability assessment of power system.
A method of determination of multiple power flow solutions is
presented using a hybrid of Particle Swarm Optimization (PSO) and
local search technique. The unique and innovative learning factors of
the PSO algorithm are formulated depending upon the node power
mismatch values to be highly adaptive with the power flow problems.
The local search is applied on the pbest solution obtained by the PSO
algorithm in each iteration. The proposed algorithm performs reliably
and provides multiple solutions when applied on standard and illconditioned
systems. The test results show that the performances of
the proposed algorithm under critical conditions are better than the
conventional methods.

57

585

Accurate Visualization of Graphs of Functions of Two Real Variables

The study of a real function of two real variables can be supported by visualization using a Computer Algebra System (CAS). One type of constraints of the system is due to the algorithms implemented, yielding continuous approximations of the given function by interpolation. This often masks discontinuities of the function and can provide strange plots, not compatible with the mathematics. In recent years, point based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of complex surfaces. In this paper we present different artifacts created by mesh surfaces near discontinuities and propose a point based method that controls and reduces these artifacts. A least squares penalty method for an automatic generation of the mesh that controls the behavior of the chosen function is presented. The special feature of this method is the ability to improve the accuracy of the surface visualization near a set of interior points where the function may be discontinuous. The present method is formulated as a minimax problem and the non uniform mesh is generated using an iterative algorithm. Results show that for large poorly conditioned matrices, the new algorithm gives more accurate results than the classical preconditioned conjugate algorithm.

56

689

Some New Subclasses of Nonsingular H-matrices

In this paper, we obtain some new subclasses of non¬singular H-matrices by using a diagonally dominant matrix

55

698

Analysis of Explosive Shock Wave and its Application in Snow Avalanche Release

Avalanche velocity (from start to track zone) has been estimated in the present model for an avalanche which is triggered artificially by an explosive devise. The initial development of the model has been from the concept of micro-continuum theories [1], underwater explosions [2] and from fracture mechanics [3] with appropriate changes to the present model. The model has been computed for different slab depth R, slope angle θ, snow density ¤ü, viscosity μ, eddy viscosity η*and couple stress parameter η. The applicability of the present model in the avalanche forecasting has been highlighted.

54

794

A New Heuristic Approach for Large Size Zero-One Multi Knapsack Problem Using Intercept Matrix

This paper presents a heuristic to solve large size 0-1 Multi constrained Knapsack problem (01MKP) which is NP-hard. Many researchers are used heuristic operator to identify the redundant constraints of Linear Programming Problem before applying the regular procedure to solve it. We use the intercept matrix to identify the zero valued variables of 01MKP which is known as redundant variables. In this heuristic, first the dominance property of the intercept matrix of constraints is exploited to reduce the search space to find the optimal or near optimal solutions of 01MKP, second, we improve the solution by using the pseudo-utility ratio based on surrogate constraint of 01MKP. This heuristic is tested for benchmark problems of sizes upto 2500, taken from literature and the results are compared with optimum solutions. Space and computational complexity of solving 01MKP using this approach are also presented. The encouraging results especially for relatively large size test problems indicate that this heuristic can successfully be used for finding good solutions for highly constrained NP-hard problems.

53

800

Existence of Solution for Four-Point Boundary Value Problems of Second-Order Impulsive Differential Equations (I)

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:

52

1116

Existence of Periodic Solutions in a Food Chain Model with Holling–type II Functional Response

In this paper, a food chain model with Holling type II functional response on time scales is investigated. By using the Mawhin-s continuation theorem in coincidence degree theory, sufficient conditions for existence of periodic solutions are obtained.

51

2067

A Schur Method for Solving Projected Continuous-Time Sylvester Equations

In this paper, we propose a direct method based on the
real Schur factorization for solving the projected Sylvester equation
with relatively small size. The algebraic formula of the solution of
the projected continuous-time Sylvester equation is presented. The
computational cost of the direct method is estimated. Numerical
experiments show that this direct method has high accuracy.

50

2449

k-Fuzzy Ideals of Ternary Semirings

The notion of k-fuzzy ideals of semirings was introduced
by Kim and Park in 1996. In 2003, Dutta and Kar introduced
a notion of ternary semirings. This structure is a generalization of
ternary rings and semirings. The main purpose of this paper is to
introduce and study k-fuzzy ideals in ternary semirings analogous to
k-fuzzy ideals in semirings considered by Kim and Park.

49

2489

PTH Moment Exponential Stability of Stochastic Recurrent Neural Networks with Distributed Delays

In this paper, the issue of pth moment exponential stability of stochastic recurrent neural network with distributed time delays is investigated. By using the method of variation parameters, inequality techniques, and stochastic analysis, some sufficient conditions ensuring pth moment exponential stability are obtained. The method used in this paper does not resort to any Lyapunov function, and the results derived in this paper generalize some earlier criteria reported in the literature. One numerical example is given to illustrate the main results.

48

2496

Stability and Bifurcation Analysis in a Model of Hes1 Selfregulation with Time Delay

The dynamics of a delayed mathematical model for
Hes1 oscillatory expression are investigated. The linear stability of
positive equilibrium and existence of local Hopf bifurcation are
studied. Moreover, the global existence of large periodic solutions
has been established due to the global bifurcation theorem.

47

2526

Parallel Alternating Two-stage Methods for Solving Linear System

In this paper, we present parallel alternating two-stage methods for solving linear system Ax = b, where A is a monotone matrix or an H-matrix. And we give some convergence results of these methods for nonsingular linear system.

46

2546

Bifurcation Analysis for a Physiological Control System with Delay

In this paper, a delayed physiological control system is investigated. The sufficient conditions for stability of positive equilibrium and existence of local Hopf bifurcation are derived. Furthermore, global existence of periodic solutions is established by using the global Hopf bifurcation theory. Finally, numerical examples are given to support the theoretical analysis.

45

3205

Existence of Solution for Four-Point Boundary Value Problems of Second-Order Impulsive Differential Equations (II)

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:

44

3631

On λ− Summable of Orlicz Space of Gai Sequences of Fuzzy Numbers

In this paper the concept of strongly (λM)p - Ces'aro
summability of a sequence of fuzzy numbers and strongly λM- statistically convergent sequences of fuzzy numbers is introduced.

43

3805

The Inverse Problem of Nonsymmetric Matrices with a Submatrix Constraint and its Approximation

In this paper, we first give the representation of the general solution of the following least-squares problem (LSP): Given matrices X ∈ Rn×p, B ∈ Rp×p and A0 ∈ Rr×r, find a matrix A ∈ Rn×n such that XT AX − B = min, s. t. A([1, r]) = A0, where A([1, r]) is the r×r leading principal submatrix of the matrix A. We then consider a best approximation problem: given an n × n matrix A˜ with A˜([1, r]) = A0, find Aˆ ∈ SE such that A˜ − Aˆ = minA∈SE A˜ − A, where SE is the solution set of LSP. We show that the best approximation solution Aˆ is unique and derive an explicit formula for it. Keyw

42

4494

An Iterative Updating Method for Damped Gyroscopic Systems

The problem of updating damped gyroscopic systems using measured modal data can be mathematically formulated as following two problems. Problem I: Given Ma ∈ Rn×n, Λ = diag{λ1, ··· , λp} ∈ Cp×p, X = [x1, ··· , xp] ∈ Cn×p, where p<n and both Λ and X are closed under complex conjugation in the sense that λ2j = λ¯2j−1 ∈ C, x2j = ¯x2j−1 ∈ Cn for j = 1, ··· , l, and λk ∈ R, xk ∈ Rn for k = 2l + 1, ··· , p, find real-valued symmetric matrices D,K and a real-valued skew-symmetric matrix G (that is, GT = −G) such that MaXΛ2 + (D + G)XΛ + KX = 0. Problem II: Given real-valued symmetric matrices Da, Ka ∈ Rn×n and a real-valued skew-symmetric matrix Ga, find (D, ˆ G, ˆ Kˆ ) ∈ SE such that Dˆ −Da2+Gˆ−Ga2+Kˆ −Ka2 = min(D,G,K)∈SE (D− Da2 + G − Ga2 + K − Ka2), where SE is the solution set of Problem I and · is the Frobenius norm. This paper presents an iterative algorithm to solve Problem I and Problem II. By using the proposed iterative method, a solution of Problem I can be obtained within finite iteration steps in the absence of roundoff errors, and the minimum Frobenius norm solution of Problem I can be obtained by choosing a special kind of initial matrices. Moreover, the optimal approximation solution (D, ˆ G, ˆ Kˆ ) of Problem II can be obtained by finding the minimum Frobenius norm solution of a changed Problem I. A numerical example shows that the introduced iterative algorithm is quite efficient.

41

4511

Multimode Dynamics of the Beijing Road Traffic System

The Beijing road traffic system, as a typical huge
urban traffic system, provides a platform for analyzing the complex
characteristics and the evolving mechanisms of urban traffic systems.
Based on dynamic network theory, we construct the dynamic model
of the Beijing road traffic system in which the dynamical properties
are described completely. Furthermore, we come into the conclusion
that urban traffic systems can be viewed as static networks, stochastic
networks and complex networks at different system phases by
analyzing the structural randomness. As well as, we demonstrate the
evolving process of the Beijing road traffic network based on real
traffic data, validate the stochastic characteristics and the scale-free
property of the network at different phases

40

4590

Haar wavelet Method for Solving Initial and Boundary Value Problems of Bratu-type

In this paper, we present a framework to determine Haar solutions of Bratu-type equations that are widely applicable in fuel ignition of the combustion theory and heat transfer. The method is proposed by applying Haar series for the highest derivatives and integrate the series. Several examples are given to confirm the efficiency and the accuracy of the proposed algorithm. The results show that the proposed way is quite reasonable when compared to exact solution.

39

4592

Splitting Modified Donor-Cell Schemes for Spectral Action Balance Equation

The spectral action balance equation is an equation that
used to simulate short-crested wind-generated waves in shallow water
areas such as coastal regions and inland waters. This equation consists
of two spatial dimensions, wave direction, and wave frequency which
can be solved by finite difference method. When this equation with
dominating propagation velocity terms are discretized using central
differences, stability problems occur when the grid spacing is chosen
too coarse. In this paper, we introduce the splitting modified donorcell
scheme for avoiding stability problems and prove that it is
consistent to the modified donor-cell scheme with same accuracy. The
splitting modified donor-cell scheme was adopted to split the wave
spectral action balance equation into four one-dimensional problems,
which for each small problem obtains the independently tridiagonal
linear systems. For each smaller system can be solved by direct or
iterative methods at the same time which is very fast when performed
by a multi-cores computer.

38

4886

Losses Analysis in TEP Considering Uncertainity in Demand by DPSO

This paper presents a mathematical model and a
methodology to analyze the losses in transmission expansion
planning (TEP) under uncertainty in demand. The methodology is
based on discrete particle swarm optimization (DPSO). DPSO is a
useful and powerful stochastic evolutionary algorithm to solve the
large-scale, discrete and nonlinear optimization problems like TEP.
The effectiveness of the proposed idea is tested on an actual
transmission network of the Azerbaijan regional electric company,
Iran. The simulation results show that considering the losses even for
transmission expansion planning of a network with low load growth
is caused that operational costs decreases considerably and the
network satisfies the requirement of delivering electric power more
reliable to load centers.

37

5275

On Detour Spectra of Some Graphs

The Detour matrix (DD) of a graph has for its ( i , j)
entry the length of the longest path between vertices i and j. The
DD-eigenvalues of a connected graph G are the eigenvalues for its
detour matrix, and they form the DD-spectrum of G. The DD-energy
EDD of the graph G is the sum of the absolute values of its DDeigenvalues.
Two connected graphs are said to be DD- equienergetic
if they have equal DD-energies. In this paper, the DD- spectra of a
variety of graphs and their DD-energies are calculated.

36

5394

Parallel Multisplitting Methods for Singular Linear Systems

In this paper, we discuss convergence of the extrapolated iterative methods for linear systems with the coefficient matrices are singular H-matrices. And we present the sufficient and necessary conditions for convergence of the extrapolated iterative methods. Moreover, we apply the results to the GMAOR methods. Finally, we give one numerical example.

35

5940

On the Solution of Fully Fuzzy Linear Systems

A linear system is called a fully fuzzy linear system (FFLS) if quantities in this system are all fuzzy numbers. For the FFLS, we investigate its solution and develop a new approximate method for solving the FFLS. Observing the numerical results, we find that our method is accurate than the iterative Jacobi and Gauss- Seidel methods on approximating the solution of FFLS.

34

6326

Periodic Solutions for a Delayed Population Model on Time Scales

This paper deals with a delayed single population model on time scales. With the assistance of coincidence degree theory, sufficient conditions for existence of periodic solutions are obtained. Furthermore, the better estimations for bounds of periodic solutions are established.

33

6488

A Hybrid Approach Using Particle Swarm Optimization and Simulated Annealing for N-queen Problem

This paper presents a hybrid approach for solving nqueen problem by combination of PSO and SA. PSO is a population based heuristic method that sometimes traps in local maximum. To solve this problem we can use SA. Although SA suffer from many iterations and long time convergence for solving some problems, By good adjusting initial parameters such as temperature and the length of temperature stages SA guarantees convergence. In this article we use discrete PSO (due to nature of n-queen problem) to achieve a good local maximum. Then we use SA to escape from local maximum. The experimental results show that our hybrid method in comparison of SA method converges to result faster, especially for high dimensions n-queen problems.

32

6682

Dynamic-Stochastic Influence Diagrams: Integrating Time-Slices IDs and Discrete Event Systems Modeling

The Influence Diagrams (IDs) is a kind of Probabilistic Belief Networks for graphic modeling. The usage of IDs can improve the communication among field experts, modelers, and decision makers, by showing the issue frame discussed from a high-level point of view. This paper enhances the Time-Sliced Influence Diagrams (TSIDs, or called Dynamic IDs) based formalism from a Discrete Event Systems Modeling and Simulation (DES M&S) perspective, for Exploring Analysis (EA) modeling. The enhancements enable a modeler to specify times occurred of endogenous events dynamically with stochastic sampling as model running and to describe the inter- influences among them with variable nodes in a dynamic situation that the existing TSIDs fails to capture. The new class of model is named Dynamic-Stochastic Influence Diagrams (DSIDs). The paper includes a description of the modeling formalism and the hiberarchy simulators implementing its simulation algorithm, and shows a case study to illustrate its enhancements.

31

6781

Generalized Inverse Eigenvalue Problems for Symmetric Arrow-head Matrices

In this paper, we first give the representation of the general solution of the following inverse eigenvalue problem (IEP): Given X ∈ Rn×p and a diagonal matrix Λ ∈ Rp×p, find nontrivial real-valued symmetric arrow-head matrices A and B such that AXΛ = BX. We then consider an optimal approximation problem: Given real-valued symmetric arrow-head matrices A, ˜ B˜ ∈ Rn×n, find (A, ˆ Bˆ) ∈ SE such that Aˆ − A˜2 + Bˆ − B˜2 = min(A,B)∈SE (A−A˜2 +B −B˜2), where SE is the solution set of IEP. We show that the optimal approximation solution (A, ˆ Bˆ) is unique and derive an explicit formula for it.

30

6940

A New Preconditioned AOR Method for Z-matrices

In this paper, we present a preconditioned AOR-type iterative method for solving the linear systems Ax = b, where A is a Z-matrix. And give some comparison theorems to show that the rate of convergence of the preconditioned AOR-type iterative method is faster than the rate of convergence of the AOR-type iterative method.

29

7184

Improved Robust Stability and Stabilization Conditions of Discrete-time Delayed System

The problem of robust stability and robust stabilization for a class of discrete-time uncertain systems with time delay is investigated. Based on Tchebychev inequality, by constructing a new augmented Lyapunov function, some improved sufficient conditions ensuring exponential stability and stabilization are established. These conditions are expressed in the forms of linear matrix inequalities (LMIs), whose feasibility can be easily checked by using Matlab LMI Toolbox. Compared with some previous results derived in the literature, the new obtained criteria have less conservatism. Two numerical examples are provided to demonstrate the improvement and effectiveness of the proposed method.

28

7396

An Advanced Stereo Vision Based Obstacle Detection with a Robust Shadow Removal Technique

This paper presents a robust method to detect obstacles in stereo images using shadow removal technique and color information. Stereo vision based obstacle detection is an algorithm that aims to detect and compute obstacle depth using stereo matching and disparity map. The proposed advanced method is divided into three phases, the first phase is detecting obstacles and removing shadows, the second one is matching and the last phase is depth computing. We propose a robust method for detecting obstacles in stereo images using a shadow removal technique based on color information in HIS space, at the first phase. In this paper we use Normalized Cross Correlation (NCC) function matching with a 5 × 5 window and prepare an empty matching table τ and start growing disparity components by drawing a seed s from S which is computed using canny edge detector, and adding it to τ. In this way we achieve higher performance than the previous works [2,17]. A fast stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small set of correspondence seeds. The obstacle identified in phase one which appears in the disparity map of phase two enters to the third phase of depth computing. Finally, experimental results are presented to show the effectiveness of the proposed method.

27

7689

Haar Wavelet Method for Solving Fitz Hugh-Nagumo Equation

In this paper, we develop an accurate and efficient Haar wavelet method for well-known FitzHugh-Nagumo equation. The proposed scheme can be used to a wide class of nonlinear reaction-diffusion equations. The power of this manageable method is confirmed. Moreover the use of Haar wavelets is found to be accurate, simple, fast, flexible, convenient, small computation costs and computationally attractive.

26

7822

The Pell Equation x2 − Py2 = Q

Let p be a prime number such that p ≡ 1(mod 4), say
p = 1+4k for a positive integer k. Let P = 2k + 1 and Q = k2.
In this paper, we consider the integer solutions of the Pell equation
x2-Py2 = Q over Z and also over finite fields Fp. Also we deduce
some relations on the integer solutions (xn, yn) of it.

25

8032

Certain Conditions for Strongly Starlike and Strongly Convex Functions

In the present paper, we investigate a differential subordination
involving multiplier transformation related to a sector in the
open unit disk E = {z : |z| < 1}. As special cases to our main
result, certain sufficient conditions for strongly starlike and strongly
convex functions are obtained.

24

9158

Periodicity for a Semi–Ratio–Dependent Predator–Prey System with Delays on Time Scales

In this paper, the semi–ratio–dependent predator-prey system with nonmonotonic functional response on time scales is investigated. By using the coincidence degree theory, sufficient conditions for existence of periodic solutions are obtained.

23

9336

Positive Definite Quadratic Forms, Elliptic Curves and Cubic Congruences

Let F(x, y) = ax2 + bxy + cy2 be a positive definite
binary quadratic form with discriminant Δ whose base points lie on
the line x = -1/m for an integer m ≥ 2, let p be a prime number
and let Fp be a finite field. Let EF : y2 = ax3 + bx2 + cx be an
elliptic curve over Fp and let CF : ax3 + bx2 + cx ≡ 0(mod p) be
the cubic congruence corresponding to F. In this work we consider
some properties of positive definite quadratic forms, elliptic curves
and cubic congruences.

22

9542

Periodic Solutions for a Third-order p-Laplacian Functional Differential Equation

By means of Mawhin’s continuation theorem, we study a kind of third-order p-Laplacian functional differential equation with distributed delay in the form: ϕp(x (t)) = g t, 0 −τ x(t + s) dα(s) + e(t), some criteria to guarantee the existence of periodic solutions are obtained.

21

9935

Restarted Generalized Second-Order Krylov Subspace Methods for Solving Quadratic Eigenvalue Problems

This article is devoted to the numerical solution of
large-scale quadratic eigenvalue problems. Such problems arise in
a wide variety of applications, such as the dynamic analysis of
structural mechanical systems, acoustic systems, fluid mechanics,
and signal processing. We first introduce a generalized second-order
Krylov subspace based on a pair of square matrices and two initial
vectors and present a generalized second-order Arnoldi process for
constructing an orthonormal basis of the generalized second-order
Krylov subspace. Then, by using the projection technique and the
refined projection technique, we propose a restarted generalized
second-order Arnoldi method and a restarted refined generalized
second-order Arnoldi method for computing some eigenpairs of largescale
quadratic eigenvalue problems. Some theoretical results are also
presented. Some numerical examples are presented to illustrate the
effectiveness of the proposed methods.

20

10097

A Numerical Algorithm for Positive Solutions of Concave and Convex Elliptic Equation on R2

In this paper we investigate numerically positive solutions of the equation -Δu = λuq+up with Dirichlet boundary condition in a boundary domain ╬® for λ > 0 and 0 < q < 1 < p < 2*, we will compute and visualize the range of λ, this problem achieves a numerical solution.

19

10179

Two New Collineations of some Moufang-Klingenberg Planes

In this paper we are interested in Moufang-Klingenberg
planesM(A) defined over a local alternative ring A of dual numbers.
We introduce two new collineations of M(A).

18

10845

New Delay-dependent Stability Conditions for Neutral Systems with Nonlinear Perturbations

In this paper, the problem of asymptotical stability of neutral systems with nonlinear perturbations is investigated. Based on a class of novel augment Lyapunov functionals which contain freeweighting matrices, some new delay-dependent asymptotical stability criteria are formulated in terms of linear matrix inequalities (LMIs) by using new inequality analysis technique. Numerical examples are given to demonstrate the derived condition are much less conservative than those given in the literature.

17

10881

Group of p-th Roots of Unity Modulo n

Let n ≥ 3 be an integer and p be a prime odd number. Let us consider Gp(n) the subgroup of (Z/nZ)* defined by : Gp(n) = {x ∈ (Z/nZ)* / xp = 1}. In this paper, we give an algorithm that computes a generating set of this subgroup.

16

10903

Centre Of Mass Selection Operator Based Meta-Heuristic For Unbounded Knapsack Problem

In this paper a new Genetic Algorithm based on a heuristic operator and Centre of Mass selection operator (CMGA) is designed for the unbounded knapsack problem(UKP), which is NP-Hard combinatorial optimization problem. The proposed genetic algorithm is based on a heuristic operator, which utilizes problem specific knowledge. This center of mass operator when combined with other Genetic Operators forms a competitive algorithm to the existing ones. Computational results show that the proposed algorithm is capable of obtaining high quality solutions for problems of standard randomly generated knapsack instances. Comparative study of CMGA with simple GA in terms of results for unbounded knapsack instances of size up to 200 show the superiority of CMGA. Thus CMGA is an efficient tool of solving UKP and this algorithm is competitive with other Genetic Algorithms also.

15

11138

On Strong(Weak) Domination in Fuzzy Graphs

Let G be a fuzzy graph. Then D Ôèå V is said to be a strong (weak) fuzzy dominating set of G if every vertex v ∈ V -D is strongly (weakly) dominated by some vertex u in D. We denote a strong (weak) fuzzy dominating set by sfd-set (wfd-set). The minimum scalar cardinality of a sfd-set (wfd-set) is called the strong (weak) fuzzy domination number of G and it is denoted by γsf (G)γwf (G). In this paper we introduce the concept of strong (weak) domination in fuzzy graphs and obtain some interesting results for this new parameter in fuzzy graphs.

14

11182

An Effective Algorithm for Minimum Weighted Vertex Cover Problem

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.

13

12039

A Contractor Iteration Method Using Eigenpairs for Positive Solutions of Nonlinear Elliptic Equation

By means of Contractor Iteration Method, we solve and visualize the Lane-Emden(-Fowler) equation Δu + up = 0, in Ω, u = 0, on ∂Ω. It is shown that the present method converges quadratically as Newton’s method and the computation of Contractor Iteration Method is cheaper than the Newton’s method.

12

12551

Some Solitary Wave Solutions of Generalized Pochhammer-Chree Equation via Exp-function Method

In this paper, Exp-function method is used for some exact solitary solutions of the generalized Pochhammer-Chree equation. It has been shown that the Exp-function method, with the help of symbolic computation, provides a very effective and powerful mathematical tool for solving nonlinear partial differential equations. As a result, some exact solitary solutions are obtained. It is shown that the Exp-function method is direct, effective, succinct and can be used for many other nonlinear partial differential equations.

11

12686

Optimization of Unweighted Minimum Vertex Cover

The Minimum Vertex Cover (MVC) problem is a classic
graph optimization NP - complete problem. In this paper a competent
algorithm, called Vertex Support Algorithm (VSA), is designed to
find the smallest vertex cover of a graph. The VSA is tested on a
large number of random graphs and DIMACS benchmark graphs.
Comparative study of this algorithm with the other existing methods
has been carried out. Extensive simulation results show that the VSA
can yield better solutions than other existing algorithms found in the
literature for solving the minimum vertex cover problem.

10

12962

Improved Robust Stability Criteria for Discrete-time Neural Networks

In this paper, the robust exponential stability problem of uncertain discrete-time recurrent neural networks with timevarying delay is investigated. By constructing a new augmented Lyapunov-Krasovskii function, some new improved stability criteria are obtained in forms of linear matrix inequality (LMI). Compared with some recent results in literature, the conservatism of the new criteria is reduced notably. Two numerical examples are provided to demonstrate the less conservatism and effectiveness of the proposed results.

9

13265

Stability Analysis of Impulsive BAM Fuzzy Cellular Neural Networks with Distributed Delays and Reaction-diffusion Terms

In this paper, a class of impulsive BAM fuzzy cellular neural networks with distributed delays and reaction-diffusion terms is formulated and investigated. By employing the delay differential inequality and inequality technique developed by Xu et al., some sufficient conditions ensuring the existence, uniqueness and global exponential stability of equilibrium point for impulsive BAM fuzzy cellular neural networks with distributed delays and reaction-diffusion terms are obtained. In particular, the estimate of the exponential convergence rate is also provided, which depends on system parameters, diffusion effect and impulsive disturbed intention. It is believed that these results are significant and useful for the design and applications of BAM fuzzy cellular neural networks. An example is given to show the effectiveness of the results obtained here.

8

13289

Some Separations in Covering Approximation Spaces

Adopting Zakowski-s upper approximation operator
C and lower approximation operator C, this paper investigates
granularity-wise separations in covering approximation spaces. Some
characterizations of granularity-wise separations are obtained by
means of Pawlak rough sets and some relations among granularitywise
separations are established, which makes it possible to research
covering approximation spaces by logical methods and mathematical
methods in computer science. Results of this paper give further
applications of Pawlak rough set theory in pattern recognition and
artificial intelligence.

7

13933

Elliptic Divisibility Sequences over Finite Fields

In this work, we study elliptic divisibility sequences
over finite fields. Morgan Ward in [14], [15] gave arithmetic theory
of elliptic divisibility sequences and formulas for elliptic divisibility
sequences with rank two over finite field Fp. We study elliptic
divisibility sequences with rank three, four and five over a finite field
Fp, where p > 3 is a prime and give general terms of these sequences
and then we determine elliptic and singular curves associated with
these sequences.

6

14775

On Finite Hjelmslev Planes of Parameters (pk−1, p)

In this paper, we study on finite projective Hjelmslev planes M(Zq) coordinatized by Hjelmslev ring Zq (where prime power q = pk). We obtain finite hyperbolic Klingenberg planes from these planes under certain conditions. Also, we give a combinatorical result on M(Zq), related by deleting a line from lines in same neighbour.

5

14846

4-Transitivity and 6-Figures in Finite Klingenberg Planes of Parameters (p2k−1, p)

In this paper, we carry over some of the results which
are valid on a certain class of Moufang-Klingenberg planes M(A)
coordinatized by an local alternative ring A := A(ε) = A+Aε of
dual numbers to finite projective Klingenberg plane M(A) obtained
by taking local ring Zq (where prime power q = pk) instead of A.
So, we show that the collineation group of M(A) acts transitively
on 4-gons, and that any 6-figure corresponds to only one inversible
m ∈ A.

4

15704

Notes on Fractional k-Covered Graphs

A graph G is fractional k-covered if for each edge e of
G, there exists a fractional k-factor h, such that h(e) = 1. If k = 2,
then a fractional k-covered graph is called a fractional 2-covered
graph. The binding number bind(G) is defined as follows,
bind(G) = min{|NG(X)|
|X|
: ├ÿ = X Ôèå V (G),NG(X) = V (G)}.
In this paper, it is proved that G is fractional 2-covered if δ(G) ≥ 4
and bind(G) > 5
3 .

3

15739

Some New Upper Bounds for the Spectral Radius of Iterative Matrices

In this paper, we present some new upper bounds for
the spectral radius of iterative matrices based on the concept of
doubly α diagonally dominant matrix. And subsequently, we give
two examples to show that our results are better than the earlier ones.

2

15883

Large Deviations for Lacunary Systems

Let Xi be a Lacunary System, we established large
deviations inequality for Lacunary System. Furthermore, we gained
Marcinkiewicz Larger Number Law with dependent random variables
sequences.

1

16009

A Meta-Heuristic Algorithm for Set Covering Problem Based on Gravity

A new Meta heuristic approach called "Randomized gravitational emulation search algorithm (RGES)" for solving large size set 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 set 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.