International Journal of Engineering, Mathematical and Physical Sciences

Multiple Positive Periodic Solutions of a Competitor-Competitor-Mutualist Lotka-Volterra System with Harvesting Terms

Year: 2010 Volume: 4 Issue: 1 125 - 130 Pages

Abstract: In this paper, by using Mawhin-s continuation theorem of coincidence degree theory, we establish the existence of multiple positive periodic solutions of a competitor-competitor-mutualist Lotka-Volterra system with harvesting terms. Finally, an example is given to illustrate our results.

Groebner Bases Computation in Boolean Rings is P-SPACE

Year: 2009 Volume: 3 Issue: 9 727 - 732 Pages

Authors:
Quoc-Nam Tran

Abstract: The theory of Groebner Bases, which has recently been honored with the ACM Paris Kanellakis Theory and Practice Award, has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science. It is wellknown that Groebner bases computation is EXP-SPACE in a general polynomial ring setting. However, for many important applications in computer science such as satisfiability and automated verification of hardware and software, computations are performed in a Boolean ring. In this paper, we give an algorithm to show that Groebner bases computation is PSPACE in Boolean rings. We also show that with this discovery, the Groebner bases method can theoretically be as efficient as other methods for automated verification of hardware and software. Additionally, many useful and interesting properties of Groebner bases including the ability to efficiently convert the bases for different orders of variables making Groebner bases a promising method in automated verification.

Solution of First kind Fredholm Integral Equation by Sinc Function

Year: 2010 Volume: 4 Issue: 6 714 - 718 Pages

Abstract: Sinc-collocation scheme is one of the new techniques used in solving numerical problems involving integral equations. This method has been shown to be a powerful numerical tool for finding fast and accurate solutions. So, in this paper, some properties of the Sinc-collocation method required for our subsequent development are given and are utilized to reduce integral equation of the first kind to some algebraic equations. Then convergence with exponential rate is proved by a theorem to guarantee applicability of numerical technique. Finally, numerical examples are included to demonstrate the validity and applicability of the technique.

Closed Form Solution to problem of Calcium Diffusion in Cylindrical Shaped Neuron Cell

Year: 2011 Volume: 5 Issue: 8 1397 - 1400 Pages

Abstract: Calcium [Ca2+] dynamics is studied as a potential form of neuron excitability that can control many irregular processes like metabolism, secretion etc. Ca2+ ion enters presynaptic terminal and increases the synaptic strength and thus triggers the neurotransmitter release. The modeling and analysis of calcium dynamics in neuron cell becomes necessary for deeper understanding of the processes involved. A mathematical model has been developed for cylindrical shaped neuron cell by incorporating physiological parameters like buffer, diffusion coefficient, and association rate. Appropriate initial and boundary conditions have been framed. The closed form solution has been developed in terms of modified Bessel function. A computer program has been developed in MATLAB 7.11 for the whole approach.

Nonlinear Solitary Structures of Electron Plasma Waves in a Finite Temperature Quantum Plasma

Year: 2012 Volume: 6 Issue: 10 1429 - 1432 Pages

Abstract: Nonlinear solitary structures of electron plasma waves have been investigated by using nonlinear quantum fluid equations for electrons with an arbitrary temperature. It is shown that the electron degeneracy parameter has significant effects on the linear and nonlinear properties of electron plasma waves. Depending on its value both compressive and rarefactive solitons can be excited in the model plasma under consideration.

A Shape Optimization Method in Viscous Flow Using Acoustic Velocity and Four-step Explicit Scheme

Year: 2010 Volume: 4 Issue: 11 1452 - 1457 Pages

Abstract: The purpose of this study is to derive optimal shapes of a body located in viscous flows by the finite element method using the acoustic velocity and the four-step explicit scheme. The formulation is based on an optimal control theory in which a performance function of the fluid force is introduced. The performance function should be minimized satisfying the state equation. This problem can be transformed into the minimization problem without constraint conditions by using the adjoint equation with adjoint variables corresponding to the state equation. The performance function is defined by the drag and lift forces acting on the body. The weighted gradient method is applied as a minimization technique, the Galerkin finite element method is used as a spatial discretization and the four-step explicit scheme is used as a temporal discretization to solve the state equation and the adjoint equation. As the interpolation, the orthogonal basis bubble function for velocity and the linear function for pressure are employed. In case that the orthogonal basis bubble function is used, the mass matrix can be diagonalized without any artificial centralization. The shape optimization is performed by the presented method.

Certain Data Dimension Reduction Techniques for application with ANN based MCS for Study of High Energy Shower

Year: 2010 Volume: 4 Issue: 12 1488 - 1495 Pages

Abstract: Cosmic showers, from their places of origin in space, after entering earth generate secondary particles called Extensive Air Shower (EAS). Detection and analysis of EAS and similar High Energy Particle Showers involve a plethora of experimental setups with certain constraints for which soft-computational tools like Artificial Neural Network (ANN)s can be adopted. The optimality of ANN classifiers can be enhanced further by the use of Multiple Classifier System (MCS) and certain data - dimension reduction techniques. This work describes the performance of certain data dimension reduction techniques like Principal Component Analysis (PCA), Independent Component Analysis (ICA) and Self Organizing Map (SOM) approximators for application with an MCS formed using Multi Layer Perceptron (MLP), Recurrent Neural Network (RNN) and Probabilistic Neural Network (PNN). The data inputs are obtained from an array of detectors placed in a circular arrangement resembling a practical detector grid which have a higher dimension and greater correlation among themselves. The PCA, ICA and SOM blocks reduce the correlation and generate a form suitable for real time practical applications for prediction of primary energy and location of EAS from density values captured using detectors in a circular grid.

Keywords:
EAS
Shower
Core
ANN
Location.

Traveling Wave Solutions for the (3+1)-Dimensional Breaking Soliton Equation by (G'/G)- Expansion Method and Modified F-Expansion Method

Year: 2011 Volume: 5 Issue: 7 1039 - 1044 Pages

Abstract: In this paper, using (G/G )-expansion method and modified F-expansion method, we give some explicit formulas of exact traveling wave solutions for the (3+1)-dimensional breaking soliton equation. A modified F-expansion method is proposed by taking full advantages of F-expansion method and Riccati equation in seeking exact solutions of the equation.

New Scheme in Determining nth Order Diagrams for Cross Multiplication Method via Combinatorial Approach

Year: 2011 Volume: 5 Issue: 6 879 - 882 Pages

Abstract: In this paper, a new recursive strategy is proposed for determining $\frac{(n-1)!}{2}$ of $n$th order diagrams. The generalization of $n$th diagram for cross multiplication method were proposed by Pavlovic and Bankier but the specific rule of determining $\frac{(n-1)!}{2}$ of the $n$th order diagrams for square matrix is yet to be discovered. Thus using combinatorial approach, $\frac{(n-1)!}{2}$ of the $n$th order diagrams will be presented as $\frac{(n-1)!}{2}$ starter sets. These starter sets will be generated based on exchanging one element. The advantages of this new strategy are the discarding process was eliminated and the sign of starter set is alternated to each others.

Approximating Maximum Weighted Independent Set Using Vertex Support

Year: 2009 Volume: 3 Issue: 11 1052 - 1057 Pages

Abstract: The Maximum Weighted Independent Set (MWIS) problem is a classic graph optimization NP-hard problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the MWIS problem is to find a vertex set S V whose total weight is maximum subject to no two vertices in S are adjacent. This paper presents a novel approach to approximate the MWIS of a graph using minimum weighted vertex cover of the graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the proposed algorithm can yield better solutions than other existing algorithms found in the literature for solving the MWIS.

Delay-range-Dependent Exponential Synchronization of Lur-e Systems with Markovian Switching

Year: 2010 Volume: 4 Issue: 3 411 - 416 Pages

Abstract: The problem of delay-range-dependent exponential synchronization is investigated for Lur-e master-slave systems with delay feedback control and Markovian switching. Using Lyapunov- Krasovskii functional and nonsingular M-matrix method, novel delayrange- dependent exponential synchronization in mean square criterions are established. The systems discussed in this paper is advanced system, and takes all the features of interval systems, It╦åo equations, Markovian switching, time-varying delay, as well as the environmental noise, into account. Finally, an example is given to show the validity of the main result.

The Effect of Correlated Service and Inter-arrival Times on System Performance

Year: 2007 Volume: 1 Issue: 8 384 - 389 Pages

Authors:
Gang Uk Hwang

Abstract: In communication networks where communication nodes are connected with finite capacity transmission links, the packet inter-arrival times are strongly correlated with the packet length and the link capacity (or the packet service time). Such correlation affects the system performance significantly, but little attention has been paid to this issue. In this paper, we propose a mathematical framework to study the impact of the correlation between the packet service times and the packet inter-arrival times on system performance. With our mathematical model, we analyze the system performance, e.g., the unfinished work of the system, and show that the correlation affects the system performance significantly. Some numerical examples are also provided.

Iteration Acceleration for Nonlinear Coupled Parabolic-Hyperbolic System

Year: 2011 Volume: 5 Issue: 9 1515 - 1520 Pages

Abstract: A Picard-Newton iteration method is studied to accelerate the numerical solution procedure of a class of two-dimensional nonlinear coupled parabolic-hyperbolic system. The Picard-Newton iteration is designed by adding higher-order terms of small quantity to an existing Picard iteration. The discrete functional analysis and inductive hypothesis reasoning techniques are used to overcome difficulties coming from nonlinearity and coupling, and theoretical analysis is made for the convergence and approximation properties of the iteration scheme. The Picard-Newton iteration has a quadratic convergent ratio, and its solution has second order spatial approximation and first order temporal approximation to the exact solution of the original problem. Numerical tests verify the results of the theoretical analysis, and show the Picard-Newton iteration is more efficient than the Picard iteration.

Effective Class of Discreet Programing Problems

Year: 2013 Volume: 7 Issue: 6 1020 - 1023 Pages

Abstract: We consider herein a concise view of discreet programming models and methods. There has been conducted the models and methods analysis. On the basis of discreet programming models there has been elaborated and offered a new class of problems, i.e. block-symmetry models and methods of applied tasks statements and solutions.

Group Velocity Dispersion Management of Microstructure Optical Fibers

Year: 2010 Volume: 4 Issue: 8 1210 - 1214 Pages

Abstract: A simple microstructure optical fiber design based on an octagonal cladding structure is presented for simultaneously controlling dispersion and leakage properties. The finite difference method with anisotropic perfectly matched boundary layer is used to investigate the guiding properties. It is demonstrated that octagonal photonic crystal fibers with four rings can assume negative ultra-flattened dispersion of -19 + 0.23 ps/nm/km in the wavelength range of 1.275 μm to 1.68 μm, nearly zero ultra-flattened dispersion of 0 ± 0.40 ps/nm/km in a 1.38 to 1.64 μm, and low confinement losses less than 10-3 dB/km in the entire band of interest.

Optimization of Fuzzy Cluster Nodes in Cellular Multimedia Networks

Year: 2013 Volume: 7 Issue: 6 1014 - 1019 Pages

Abstract: The cellular network is one of the emerging areas of communication, in which the mobile nodes act as member for one base station. The cluster based communication is now an emerging area of wireless cellular multimedia networks. The cluster renders fast communication and also a convenient way to work with connectivity. In our scheme we have proposed an optimization technique for the fuzzy cluster nodes, by categorizing the group members into three categories like long refreshable member, medium refreshable member and short refreshable member. By considering long refreshable nodes as static nodes, we compute the new membership values for the other nodes in the cluster. We compare their previous and present membership value with the threshold value to categorize them into three different members. By which, we optimize the nodes in the fuzzy clusters. The simulation results show that there is reduction in the cluster computational time and iterational time after optimization.

Preconditioned Mixed-Type Splitting Iterative Method For Z-Matrices

Year: 2011 Volume: 5 Issue: 2 169 - 172 Pages

Abstract: In this paper, we present the preconditioned mixed-type splitting iterative method for solving the linear systems, Ax = b, where A is a Z-matrix. And we give some comparison theorems to show that the convergence rate of the preconditioned mixed-type splitting iterative method is faster than that of the mixed-type splitting iterative method. Finally, we give a numerical example to illustrate our results.

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

Year: 2010 Volume: 4 Issue: 7 991 - 994 Pages

Abstract: 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.

Effect of Time Delay on the Transmission of Dengue Fever

Year: 2007 Volume: 1 Issue: 10 493 - 501 Pages

Abstract: The effect of a time delay on the transmission on dengue fever is studied. The time delay is due to the presence of an incubation period for the dengue virus to develop in the mosquito before the mosquito becomes infectious. The conditions for the existence of a Hopf bifurcation to limit cycle behavior are established. The conditions are different from the usual one and they are based on whether a particular third degree polynomial has positive real roots. A theorem for determining whether for a given set of parameter values, a critical delay time exist is given. It is found that for a set of realistic values of the parameters in the model, a Hopf bifurcation can not occur. For a set of unrealistic values of some of the parameters, it is shown that a Hopf bifurcation can occur. Numerical solutions using this last set show the trajectory of two of the variables making a transition from a spiraling orbit to a limit cycle orbit.

Optimizing Allocation of Two Dimensional Irregular Shapes using an Agent Based Approach

Year: 2007 Volume: 1 Issue: 11 552 - 555 Pages

Abstract: Packing problems arise in a wide variety of application areas. The basic problem is that of determining an efficient arrangement of different objects in a region without any overlap and with minimal wasted gap between shapes. This paper presents a novel population based approach for optimizing arrangement of irregular shapes. In this approach, each shape is coded as an agent and the agents' reproductions and grouping policies results in arrangements of the objects in positions with least wasted area between them. The approach is implemented in an application for cutting sheets and test results on several problems from literature are presented.