Abstract: A sign pattern is a matrix whose entries belong to the set
{+,−, 0}. An n-by-n sign pattern A is said to allow an eventually
positive matrix if there exist some real matrices A with the same
sign pattern as A and a positive integer k0 such that Ak > 0 for all
k ≥ k0. It is well known that identifying and classifying the n-by-n
sign patterns that allow an eventually positive matrix are posed as two
open problems. In this article, the tree sign patterns of small order
that allow an eventually positive matrix are classified completely.
Abstract: By using a fixed point theorem of a sum operator, the
existence and uniqueness of positive solution for a class of
boundary value problem of nonlinear fractional differential equation
is studied. An iterative scheme is constructed to approximate it.
Finally, an example is given to illustrate the main result.
Abstract: The aim of this paper is to introduce the notion of
intuitionistic fuzzy positive implicative ideals with thresholds (λ, μ) of
BCI-algebras and to investigate its properties and characterizations.
Abstract: The aim of this work is to study the numerical
implementation of the Hilbert Uniqueness Method for the exact
boundary controllability of Euler-Bernoulli beam equation. This study
may be difficult. This will depend on the problem under consideration
(geometry, control and dimension) and the numerical method used.
Knowledge of the asymptotic behaviour of the control governing the
system at time T may be useful for its calculation. This idea will
be developed in this study. We have characterized as a first step, the
solution by a minimization principle and proposed secondly a method
for its resolution to approximate the control steering the considered
system to rest at time T.
Abstract: In this paper, we discuss some properties of left
spectrum and give the representation of linear preserver map the left
spectrum of diagonal quaternionic matrices.
Abstract: In this paper, a linear mixed model which has two
random effects is broken up into two models. This thesis gets
the parameter estimation of the original model and an estimation’s
statistical qualities based on these two models. Then many important
properties are given by comparing this estimation with other general
estimations. At the same time, this paper proves the analysis of
variance estimate (ANOVAE) about σ2 of the original model is equal
to the least-squares estimation (LSE) about σ2 of these two models.
Finally, it also proves that this estimation is better than ANOVAE
under Stein function and special condition in some degree.
Abstract: Genetic algorithm is widely used in optimization
problems for its excellent global search capabilities and highly parallel
processing capabilities; but, it converges prematurely and has a poor
local optimization capability in actual operation. Simulated annealing
algorithm can avoid the search process falling into local optimum. A
hybrid genetic algorithm based on simulated annealing is designed by
combining the advantages of genetic algorithm and simulated
annealing algorithm. The numerical experiment represents the hybrid
genetic algorithm can be applied to solve the function optimization
problems efficiently.
Abstract: The statistical study has become indispensable for various fields of knowledge. Not any different, in Geotechnics the study of probabilistic and statistical methods has gained power considering its use in characterizing the uncertainties inherent in soil properties. One of the situations where engineers are constantly faced is the definition of a probability distribution that represents significantly the sampled data. To be able to discard bad distributions, goodness-of-fit tests are necessary. In this paper, three non-parametric goodness-of-fit tests are applied to a data set computationally generated to test the goodness-of-fit of them to a series of known distributions. It is shown that the use of normal distribution does not always provide satisfactory results regarding physical and behavioral representation of the modeled parameters.
Abstract: The crossover probability and mutation probability are the two important factors in genetic algorithm. The adaptive genetic algorithm can improve the convergence performance of genetic algorithm, in which the crossover probability and mutation probability are adaptively designed with the changes of fitness value. We apply adaptive genetic algorithm into a function optimization problem. The numerical experiment represents that adaptive genetic algorithm improves the convergence speed and avoids local convergence.
Abstract: Visibility problems are central to many computational geometry applications. One of the typical visibility problems is computing the view from a given point. In this paper, a linear time procedure is proposed to compute the visibility subsets from a corner of a rectangular prism in an orthogonal polyhedron. The proposed algorithm could be useful to solve classic 3D problems.
Abstract: Model updating is an inverse eigenvalue problem which
concerns the modification of an existing but inaccurate model with
measured modal data. In this paper, an efficient gradient based
iterative method for updating the mass, damping and stiffness
matrices simultaneously using a few of complex measured modal
data is developed. Convergence analysis indicates that the iterative
solutions always converge to the unique minimum Frobenius norm
symmetric solution of the model updating problem by choosing a
special kind of initial matrices.
Abstract: Ant algorithms are well-known metaheuristics which
have been widely used since two decades. In most of the literature,
an ant is a constructive heuristic able to build a solution from scratch.
However, other types of ant algorithms have recently emerged: the
discussion is thus not limited by the common framework of the
constructive ant algorithms. Generally, at each generation of an ant
algorithm, each ant builds a solution step by step by adding an
element to it. Each choice is based on the greedy force (also called the
visibility, the short term profit or the heuristic information) and the
trail system (central memory which collects historical information of
the search process). Usually, all the ants of the population have the
same characteristics and behaviors. In contrast in this paper, a new
type of ant metaheuristic is proposed, namely SMART (for Solution
Methods with Ants Running by Types). It relies on the use of different
population of ants, where each population has its own personality.
Abstract: In this paper, a method has been developed to
construct the membership surfaces of row and column vectors and
arithmetic operations of imprecise matrix. A matrix with imprecise
elements would be called an imprecise matrix. The membership
surface of imprecise vector has been already shown based on
Randomness-Impreciseness Consistency Principle. The Randomness-
Impreciseness Consistency Principle leads to defining a normal law
of impreciseness using two different laws of randomness. In this
paper, the author has shown row and column membership surfaces
and arithmetic operations of imprecise matrix and demonstrated with
the help of numerical example.
Abstract: The very well-known stacked sets of numbers referred
to as Pascal’s triangle present the coefficients of the binomial
expansion of the form (x+y)n. This paper presents an approach (the
Staircase Horizontal Vertical, SHV-method) to the generalization of
planar Pascal’s triangle for polynomial expansion of the form
(x+y+z+w+r+⋯)n. The presented generalization of Pascal’s triangle
is different from other generalizations of Pascal’s triangles given in
the literature. The coefficients of the generalized Pascal’s triangles,
presented in this work, are generated by inspection, using embedded
Pascal’s triangles. The coefficients of I-variables expansion are
generated by horizontally laying out the Pascal’s elements of (I-1)
variables expansion, in a staircase manner, and multiplying them with
the relevant columns of vertically laid out classical Pascal’s elements,
hence avoiding factorial calculations for generating the coefficients
of the polynomial expansion. Furthermore, the classical Pascal’s
triangle has some pattern built into it regarding its odd and even
numbers. Such pattern is known as the Sierpinski’s triangle. In this
study, a presentation of Sierpinski-like patterns of the generalized
Pascal’s triangles is given. Applications related to those coefficients
of the binomial expansion (Pascal’s triangle), or polynomial
expansion (generalized Pascal’s triangles) can be in areas of
combinatorics, and probabilities.
Abstract: This research provides a technical account of
estimating Transition Probability using Time-homogeneous Markov
Jump Process applying by South African HIV/AIDS data from the
Statistics South Africa. It employs Maximum Likelihood Estimator
(MLE) model to explore the possible influence of Transition
Probability of mortality cases in which case the data was based on
actual Statistics South Africa. This was conducted via an integrated
demographic and epidemiological model of South African HIV/AIDS
epidemic. The model was fitted to age-specific HIV prevalence data
and recorded death data using MLE model. Though the previous
model results suggest HIV in South Africa has declined and AIDS
mortality rates have declined since 2002 – 2013, in contrast, our
results differ evidently with the generally accepted HIV models
(Spectrum/EPP and ASSA2008) in South Africa. However, there is
the need for supplementary research to be conducted to enhance the
demographic parameters in the model and as well apply it to each of
the nine (9) provinces of South Africa.
Abstract: In this work, we propose an algorithm developed under Python language for the modeling of ordinary scalar Bessel beams and their discrete superpositions and subsequent calculation of optical forces exerted over dielectric spherical particles. The mathematical formalism, based on the generalized Lorenz-Mie theory, is implemented in Python for its large number of free mathematical (as SciPy and NumPy), data visualization (Matplotlib and PyJamas) and multiprocessing libraries. We also propose an approach, provided by a synchronized Software as Service (SaaS) in cloud computing, to develop a user interface embedded on a mobile application, thus providing users with the necessary means to easily introduce desired unknowns and parameters and see the graphical outcomes of the simulations right at their mobile devices. Initially proposed as a free Android-based application, such an App enables data post-processing in cloud-based architectures and visualization of results, figures and numerical tables.
Abstract: This paper presents the confidence intervals for the
effect size base on bootstrap resampling method. The meta-analytic
confidence interval for effect size is proposed that are easy to
compute. A Monte Carlo simulation study was conducted to compare
the performance of the proposed confidence intervals with the
existing confidence intervals. The best confidence interval method
will have a coverage probability close to 0.95. Simulation results
have shown that our proposed confidence intervals perform well in
terms of coverage probability and expected length.
Abstract: In this paper, the similarity invariant and the upper
semi-continuity of spherical spectrum, and the spherical spectrum
properties for infinite direct sums of quaternionic operators are
characterized, respectively. As an application of some results
established, a concrete example about the computation of the
spherical spectrum of a compact quaternionic operator with form of
infinite direct sums of quaternionic matrices is also given.
Abstract: Positive real and strictly positive real transfer functions are important concepts in the control theory. In this paper, the results of researches in these areas are summarized. Definitions together with their graphical interpretations are mentioned. The equivalent conditions in the frequency domain and state space representations are reviewed. Their equivalent electrical networks are explained. Also, a comprehensive discussion about a difference between behavior of real part of positive real and strictly positive real transfer functions in high frequencies is presented. Furthermore, several illustrative examples are given.
Abstract: Vertex Enumeration Algorithms explore the methods and procedures of generating the vertices of general polyhedra formed by system of equations or inequalities. These problems of enumerating the extreme points (vertices) of general polyhedra are shown to be NP-Hard. This lead to exploring how to count the vertices of general polyhedra without listing them. This is also shown to be #P-Complete. Some fully polynomial randomized approximation schemes (fpras) of counting the vertices of some special classes of polyhedra associated with Down-Sets, Independent Sets, 2-Knapsack problems and 2 x n transportation problems are presented together with some discovered open problems.