Abstract: The intention of this paper is, to help the user of evolutionary algorithms to adapt them easier to their problem at hand. For a lot of problems in the technical field it is not necessary to reach an optimum solution, but to reach a good solution in time. In many cases the solution is undetermined or there doesn-t exist a method to determine the solution. For these cases an evolutionary algorithm can be useful. This paper intents to give the user rules of thumb with which it is easier to decide if the problem is suitable for an evolutionary algorithm and how to design them.
Abstract: In this work, we consider the number of integer solutions
of Diophantine equation D : y2 - 2yx - 3 = 0 over Z and
also over finite fields Fp for primes p ≥ 5. Later we determine the
number of rational points on curves Ep : y2 = Pp(x) = yp
1 + yp
2
over Fp, where y1 and y2 are the roots of D. Also we give a formula
for the sum of x- and y-coordinates of all rational points (x, y) on
Ep over Fp.
Abstract: These In this work, a regular unit speed curve in six
dimensional Euclidean space, whose Frenet curvatures are constant,
is considered. Thereafter, a method to calculate Frenet apparatus of
this curve is presented.
Abstract: In this paper, position vector of a partially null unit speed curve with respect to standard frame of Minkowski space-time is studied. First, it is proven that position vector of every partially null unit speed curve satisfies a vector differential equation of fourth order. In terms of solution of the differential equation, position vector of a partially null unit speed curve is expressed.
Abstract: Let G be a graph of order n, and let a, b and m be positive integers with 1 ≤ a n + a + b − 2 √bn+ 1, then for any subgraph H of G with m edges, G has an [a, b]-factor F such that E(H)∩ E(F) = ∅. This result is an extension of thatof Egawa [2].
Abstract: Seemingly simple probabilities in the m-player game bingo have never been calculated. These probabilities include expected game length and the expected number of winners on a given turn. The difficulty in probabilistic analysis lies in the subtle interdependence among the m-many bingo game cards in play. In this paper, the game i got it!, a bingo variant, is considered. This variation provides enough weakening of the inter-player dependence to allow probabilistic analysis not possible for traditional bingo. The probability of winning in exactly k turns is calculated for a one-player game. Given a game of m-many players, the expected game length and tie probability are calculated. With these calculations, the game-s interesting payout scheme is considered.
Abstract: In this paper, some new nonlinear generalized
Gronwall-Bellman-Type integral inequalities with mixed time delays
are established. These inequalities can be used as handy tools
to research stability problems of delayed differential and integral
dynamic systems. As applications, based on these new established
inequalities, some p-stable results of a integro-differential equation
are also given. Two numerical examples are presented to illustrate
the validity of the main results.
Abstract: A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path or an induced cycle in G, then ψ is called an induced path decomposition of G. The minimum cardinality of an induced path decomposition of G is called the induced path decomposition number of G and is denoted by πi(G). In this paper we initiate a study of this parameter.
Abstract: In this study, we have defined slant helix according to
Bishop frame in Euclidean 3-Space. Furthermore, we have given
some necassary and sufficient conditons for the slant helix.
Abstract: The hypercube Qn is one of the most well-known
and popular interconnection networks and the k-ary n-cube Qk
n is
an enlarged family from Qn that keeps many pleasing properties
from hypercubes. In this article, we study the panpositionable
hamiltonicity of Qk
n for k ≥ 3 and n ≥ 2. Let x, y of V (Qk
n)
be two arbitrary vertices and C be a hamiltonian cycle of Qk
n.
We use dC(x, y) to denote the distance between x and y on the
hamiltonian cycle C. Define l as an integer satisfying d(x, y) ≤ l ≤ 1
2 |V (Qk
n)|. We prove the followings:
• When k = 3 and n ≥ 2, there exists a hamiltonian cycle C
of Qk
n such that dC(x, y) = l.
• When k ≥ 5 is odd and n ≥ 2, we request that l /∈ S
where S is a set of specific integers. Then there exists a
hamiltonian cycle C of Qk
n such that dC(x, y) = l.
• When k ≥ 4 is even and n ≥ 2, we request l-d(x, y) to be
even. Then there exists a hamiltonian cycle C of Qk
n such
that dC(x, y) = l.
The result is optimal since the restrictions on l is due to the
structure of Qk
n by definition.
Abstract: The precise form of tensorial transformations acting on a given collection of infinite matrices into another ; for such classical ideas connected with the summability field of double gai sequence spaces. In this paper the results are impose conditions on the tensor g so that it becomes a tensorial transformations from the metric space χ2 to the metric space C
Abstract: In the first part of this paper [6], a method to
determine Frenet apparatus of the space-like curves in Minkowski
space-time is presented. In this work, the mentioned method is
developed for the time-like curves in Minkowski space-time.
Additionally, an example of presented method is illustrated.
Abstract: Let D = 1 be a positive non-square integer and let δ = √D or 1+√D 2 be a real quadratic irrational with trace t =δ + δ and norm n = δδ. Let γ = P+δ Q be a quadratic irrational for positive integers P and Q. Given a quadratic irrational γ, there exist a quadratic ideal Iγ = [Q, δ + P] and an indefinite quadratic form Fγ(x, y) = Q(x−γy)(x−γy) of discriminant Δ = t
2−4n. In the first section, we give some preliminaries form binary quadratic forms, quadratic irrationals and quadratic ideals. In the second section, we obtain some results on γ, Iγ and Fγ for some specific values of Q and P.
Abstract: In the present paper, we use generalized B-Spline curve in trigonometric form on circular domain, to capture the transcendental nature of circle involute curve and uncertainty characteristic of design. The required involute curve get generated within the given tolerance limit and is useful in gear design.
Abstract: The exact solutions of the equations describing the steady plane motion of an incompressible fluid of variable viscosity for an arbitrary state equation are determined in the (ξ,ψ) − or (η,ψ )- coordinates where ψ(x,y) is the stream function, ξ and η are the parts of the analytic function, ϖ =ξ( x,y )+iη( x,y ). Most of the solutions involve arbitrary function/ functions indicating
that the flow equations possess an infinite set of solutions.
Abstract: In this work we study elliptic divisibility sequences over
finite fields. MorganWard in [11, 12] gave arithmetic theory of elliptic
divisibility sequences. We study elliptic divisibility sequences, equivalence
of these sequences and singular elliptic divisibility sequences
over finite fields Fp, p > 3 is a prime.
Abstract: Exclusive breastfeeding is the feeding of a baby on no other milk apart from breast milk. Exclusive breastfeeding during the first 6 months of life is of fundamental importance because it supports optimal growth and development during infancy and reduces the risk of obliterating diseases and problems. Moreover, in developed countries, exclusive breastfeeding has decreased the incidence and/or severity of diarrhea, lower respiratory infection and urinary tract infection. In this paper, we study the factors that influence exclusive breastfeeding and use the Generalized Poisson regression model to analyze the practices of exclusive breastfeeding in Mauritius. We develop two sets of quasi-likelihood equations (QLE)to estimate the parameters.
Abstract: Let p ≥ 5 be a prime number and let Fp be a finite
field. In this work, we determine the number of rational points on
singular curves Ea : y2 = x(x - a)2 over Fp for some specific
values of a.