Abstract: An inverse problem of doubly center matrices is discussed. By translating the constrained problem into unconstrained problem, two iterative methods are proposed. A numerical example illustrate our algorithms.
Abstract: This paper developed the c-Chart based on a Zero- Inflated Poisson (ZIP) processes that approximated by a geometric distribution with parameter p. The p estimated that fit for ZIP distribution used in calculated the mean, median, and variance of geometric distribution for constructed the c-Chart by three difference methods. For cg-Chart, developed c-Chart by used the mean and variance of the geometric distribution constructed control limits. For cmg-Chart, the mean used for constructed the control limits. The cme- Chart, developed control limits of c-Chart from median and variance values of geometric distribution. The performance of charts considered from the Average Run Length and Average Coverage Probability. We found that for an in-control process, the cg-Chart is superior for low level of mean at all level of proportion zero. For an out-of-control process, the cmg-Chart and cme-Chart are the best for mean = 2, 3 and 4 at all level of parameter.
Abstract: A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and 0 if gcd(f(u), f(v)) > 1, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper we exhibit some characterization results and new constructions on prime cordial graphs.
Abstract: A multi-rate discrete-time model, whose response
agrees exactly with that of a continuous-time original at all sampling
instants for any sampling periods, is developed for a linear system,
which is assumed to have multiple real eigenvalues. The sampling
rates can be chosen arbitrarily and individually, so that their ratios
can even be irrational. The state space model is obtained as a
combination of a linear diagonal state equation and a nonlinear output
equation. Unlike the usual lifted model, the order of the proposed
model is the same as the number of sampling rates, which is less than
or equal to the order of the original continuous-time system. The
method is based on a nonlinear variable transformation, which can be
considered as a generalization of linear similarity transformation,
which cannot be applied to systems with multiple eigenvalues in
general. An example and its simulation result show that the proposed
multi-rate model gives exact responses at all sampling instants.
Abstract: Nowadays there are many methods for representing
knowledge such as semantic network, neural network, and conceptual
graphs. Nonetheless, these methods are not sufficiently efficient
when applied to perform and deduce on knowledge domains about
supporting in general education such as algebra, analysis or plane
geometry. This leads to the introduction of computational network
which is a useful tool for representation knowledge base, especially
for computational knowledge, especially knowledge domain about
general education. However, when dealing with a practical problem,
we often do not immediately find a new solution, but we search
related problems which have been solved before and then proposing
an appropriate solution for the problem. Besides that, when finding
related problems, we have to determine whether the result of them
can be used to solve the practical problem or not. In this paper, the
extension model of computational network has been presented. In this
model, Sample Problems, which are related problems, will be used
like the experience of human about practical problem, simulate the
way of human thinking, and give the good solution for the practical
problem faster and more effectively. This extension model is applied
to construct an automatic system for solving algebraic problems in
middle school.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
Abstract: In this paper, LDPC Codes based on defected fullerene
graphs have been generated. And it is found that the codes generated
are fast in encoding and better in terms of error performance on
AWGN Channel.