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: 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: This paper presents the performance of Integrated
Bacterial Foraging Optimization and Particle Swarm Optimization
(IBFO_PSO) technique in MANET routing. The BFO is a bio-inspired
algorithm, which simulates the foraging behavior of bacteria.
It is effectively applied in improving the routing performance in
MANET. In results, it is proved that the PSO integrated with BFO
reduces routing delay, energy consumption and communication
overhead.
Abstract: We proposed a Hyperbolic Gompertz Growth Model
(HGGM), which was developed by introducing a shape parameter
(allometric). This was achieved by convoluting hyperbolic sine
function on the intrinsic rate of growth in the classical gompertz
growth equation. The resulting integral solution obtained
deterministically was reprogrammed into a statistical model and used
in modeling the height and diameter of Pines (Pinus caribaea). Its
ability in model prediction was compared with the classical gompertz
growth model, an approach which mimicked the natural variability of
height/diameter increment with respect to age and therefore provides
a more realistic height/diameter predictions using goodness of fit
tests and model selection criteria. The Kolmogorov Smirnov test and
Shapiro-Wilk test was also used to test the compliance of the error
term to normality assumptions while the independence of the error
term was confirmed using the runs test. The mean function of top
height/Dbh over age using the two models under study predicted
closely the observed values of top height/Dbh in the hyperbolic
gompertz growth models better than the source model (classical
gompertz growth model) while the results of R2, Adj. R2, MSE and
AIC confirmed the predictive power of the Hyperbolic Gompertz
growth models over its source model.
Abstract: Nature is the immense gifted source for solving
complex problems. It always helps to find the optimal solution to
solve the problem. Mobile Ad Hoc NETwork (MANET) is a wide
research area of networks which has set of independent nodes. The
characteristics involved in MANET’s are Dynamic, does not depend
on any fixed infrastructure or centralized networks, High mobility.
The Bio-Inspired algorithms are mimics the nature for solving
optimization problems opening a new era in MANET. The typical
Swarm Intelligence (SI) algorithms are Ant Colony Optimization
(ACO), Artificial Bee Colony (ABC), Particle Swarm Optimization
(PSO), Modified Termite Algorithm, Bat Algorithm (BA), Wolf
Search Algorithm (WSA) and so on. This work mainly concentrated
on nature of MANET and behavior of nodes. Also it analyses various
performance metrics such as throughput, QoS and End-to-End delay
etc.
Abstract: In this paper, we consider the vehicle routing problem
with mixed fleet of conventional and heterogenous electric vehicles
and time dependent charging costs, denoted VRP-HFCC, in which
a set of geographically scattered customers have to be served by a
mixed fleet of vehicles composed of a heterogenous fleet of Electric
Vehicles (EVs), having different battery capacities and operating
costs, and Conventional Vehicles (CVs). We include the possibility
of charging EVs in the available charging stations during the routes
in order to serve all customers. Each charging station offers charging
service with a known technology of chargers and time dependent
charging costs. Charging stations are also subject to operating time
windows constraints. EVs are not necessarily compatible with all
available charging technologies and a partial charging is allowed.
Intermittent charging at the depot is also allowed provided that
constraints related to the electricity grid are satisfied.
The objective is to minimize the number of employed vehicles and
then minimize the total travel and charging costs.
In this study, we present a Mixed Integer Programming Model and
develop a Charging Routing Heuristic and a Local Search Heuristic
based on the Inject-Eject routine with different insertion methods. All
heuristics are tested on real data instances.
Abstract: Nature is a great source of inspiration for solving
complex problems in networks. It helps to find the optimal solution.
Metaheuristic algorithm is one of the nature-inspired algorithm which
helps in solving routing problem in networks. The dynamic features,
changing of topology frequently and limited bandwidth make the
routing, challenging in MANET. Implementation of appropriate
routing algorithms leads to the efficient transmission of data in
mobile ad hoc networks. The algorithms that are inspired by the
principles of naturally-distributed/collective behavior of social
colonies have shown excellence in dealing with complex
optimization problems. Thus some of the bio-inspired metaheuristic
algorithms help to increase the efficiency of routing in ad hoc
networks. This survey work presents the overview of bio-inspired
metaheuristic algorithms which support the efficiency of routing in
mobile ad hoc networks.
Abstract: This paper introduces an original method of
parametric optimization of the structure for multimodal decisionlevel
fusion scheme which combines the results of the partial solution
of the classification task obtained from assembly of the mono-modal
classifiers. As a result, a multimodal fusion classifier which has the
minimum value of the total error rate has been obtained.
Abstract: In this paper, an analysis of some model order
reduction techniques is presented. A new hybrid algorithm for model
order reduction of linear time invariant systems is compared with the
conventional techniques namely Balanced Truncation, Hankel Norm
reduction and Dominant Pole Algorithm (DPA). The proposed hybrid
algorithm is known as Clustering Dominant Pole Algorithm (CDPA),
is able to compute the full set of dominant poles and its cluster center
efficiently. The dominant poles of a transfer function are specific
eigenvalues of the state space matrix of the corresponding dynamical
system. The effectiveness of this novel technique is shown through
the simulation results.