Abstract: This paper presents a multi population Differential Evolution (DE) with adaptive mutation and local search for global optimization, named AMMADE in order to better coordinate the cooperation between the populations and the rational use of resources. In AMMADE, the population is divided based on the Euclidean distance sorting method at each generation to appropriately coordinate the cooperation between subpopulations and the usage of resources, such that the best-performed subpopulation will get more computing resources in the next generation. Further, an adaptive local search strategy is employed on the best-performed subpopulation to achieve a balanced search. The proposed algorithm has been tested by solving optimization problems taken from CEC2014 benchmark problems. Experimental results show that our algorithm can achieve a competitive or better result than related methods. The results also confirm the significance of devised strategies in the proposed algorithm.
Abstract: We address the question of identifying the configuration
space singularities of linkages, i.e., points where the configuration
space is not locally a submanifold of Euclidean space. Because the
configuration space cannot be smoothly parameterized at such points,
these singularity types have a significantly negative impact on the
kinematics of the linkage. It is known that Jacobian methods do not
provide sufficient conditions for the existence of CS-singularities.
Herein, we present several additional algebraic criteria that provide
the sufficient conditions. Further, we use those criteria to analyze
certain classes of planar linkages. These examples will also show
how the presented criteria can be checked using algorithmic methods.
Abstract: This paper compares the multipath mitigation
performance of code correlation reference waveform receivers
with variable and fixed window width, for binary offset carrier
and multiplexed binary offset carrier signals typically used in
global navigation satellite systems. In the variable window width
method, such width is iteratively reduced until the distortion on
the discriminator with multipath is eliminated. This distortion is
measured as the Euclidean distance between the actual discriminator
(obtained with the incoming signal), and the local discriminator
(generated with a local copy of the signal). The variable window
width have shown better performance compared to the fixed window
width. In particular, the former yields zero error for all delays for
the BOC and MBOC signals considered, while the latter gives
rather large nonzero errors for small delays in all cases. Due to
its computational simplicity, the variable window width method is
perfectly suitable for implementation in low-cost receivers.
Abstract: The distribution of velocities of particles in plasma is a well understood discipline of plasma physics. Boltzmann’s law and the Maxwell-Boltzmann distribution describe the distribution of velocity of a particle in plasma as a function of mass and temperature. Particles with the same mass tend to have the same velocity. By expressing the same law in terms of energy alone, the author obtains a distribution independent of mass. In summary, for particles in plasma, the energies tend to equalize, independent of the masses of the individual particles. For high-energy plasma, the original law predicts velocities greater than the speed of light. If one uses Einstein’s formula for energy (E=mc2), then a relativistic correction is not required.
Abstract: We are interested in solving Liouville-type problems to explore constancy properties for maps or differential forms on Riemannian manifolds. Geometric structures on manifolds, the existence of constancy properties for maps or differential forms, and energy growth for maps or differential forms are intertwined. In this article, we concentrate on discovery of solutions to Liouville-type problems where manifolds are Euclidean spaces (i.e. flat Riemannian manifolds) and maps become real-valued functions. Liouville-type results of vanishing properties for functions are obtained. The original work in our research findings is to extend the q-energy for a function from finite in Lq space to infinite in non-Lq space by applying p-balanced technique where q = p = 2. Calculation skills such as Hölder's Inequality and Tests for Series have been used to evaluate limits and integrations for function energy. Calculation ideas and computational techniques for solving Liouville-type problems shown in this article, which are utilized in Euclidean spaces, can be universalized as a successful algorithm, which works for both maps and differential forms on Riemannian manifolds. This innovative algorithm has a far-reaching impact on research work of solving Liouville-type problems in the general settings involved with infinite energy. The p-balanced technique in this algorithm provides a clue to success on the road of q-energy extension from finite to infinite.
Abstract: The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CNmaxn2) where C is the iterations, Nmax is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.
Abstract: This paper presents a method for determining all of the co-prime right angle triangles in the Euclidean field by looking at the intersection of the Pythagorean and Platonic right angle triangles and the corresponding lattice that this produces. The co-prime properties of each lattice point representing a unique right angle triangle are then considered. This paper proposes a conjunction between these two ancient disparaging theorists. This work has wide applications in information security where cryptography involves improved ways of finding tuples of prime numbers for secure communication systems. In particular, this paper has direct impact in enhancing the encryption and decryption algorithms in cryptography.
Abstract: The goal of this project is to investigate constant
properties (called the Liouville-type Problem) for a p-stable map
as a local or global minimum of a p-energy functional where
the domain is a Euclidean space and the target space is a
closed half-ellipsoid. The First and Second Variation Formulas
for a p-energy functional has been applied in the Calculus
Variation Method as computation techniques. Stokes’ Theorem,
Cauchy-Schwarz Inequality, Hardy-Sobolev type Inequalities, and
the Bochner Formula as estimation techniques have been used to
estimate the lower bound and the upper bound of the derived
p-Harmonic Stability Inequality. One challenging point in this project
is to construct a family of variation maps such that the images
of variation maps must be guaranteed in a closed half-ellipsoid.
The other challenging point is to find a contradiction between the
lower bound and the upper bound in an analysis of p-Harmonic
Stability Inequality when a p-energy minimizing map is not constant.
Therefore, the possibility of a non-constant p-energy minimizing
map has been ruled out and the constant property for a p-energy
minimizing map has been obtained. Our research finding is to explore
the constant property for a p-stable map from a Euclidean space into
a closed half-ellipsoid in a certain range of p. The certain range of
p is determined by the dimension values of a Euclidean space (the
domain) and an ellipsoid (the target space). The certain range of p
is also bounded by the curvature values on an ellipsoid (that is, the
ratio of the longest axis to the shortest axis). Regarding Liouville-type
results for a p-stable map, our research finding on an ellipsoid is a
generalization of mathematicians’ results on a sphere. Our result is
also an extension of mathematicians’ Liouville-type results from a
special ellipsoid with only one parameter to any ellipsoid with (n+1)
parameters in the general setting.
Abstract: The traditional k-means algorithm has been widely used as a simple and efficient clustering method. However, the algorithm often converges to local minima for the reason that it is sensitive to the initial cluster centers. In this paper, an algorithm for selecting initial cluster centers on the basis of minimum spanning tree (MST) is presented. The set of vertices in MST with same degree are regarded as a whole which is used to find the skeleton data points. Furthermore, a distance measure between the skeleton data points with consideration of degree and Euclidean distance is presented. Finally, MST-based initialization method for the k-means algorithm is presented, and the corresponding time complexity is analyzed as well. The presented algorithm is tested on five data sets from the UCI Machine Learning Repository. The experimental results illustrate the effectiveness of the presented algorithm compared to three existing initialization methods.
Abstract: Renewable energy is referred to as "clean energy" and common popular support for the use of renewable energy (RE) is to provide electricity with zero carbon dioxide emissions. This study provides useful insight into the European Union (EU) RE, especially, into electricity generation obtained from renewables, and their targets. The objective of this study is to identify groups of European countries, using multivariate statistical analysis and selected indicators. The hierarchical clustering method is used to decide the number of clusters for EU countries. The conducted statistical hierarchical cluster analysis is based on the Ward’s clustering method and squared Euclidean distances. Hierarchical cluster analysis identified eight distinct clusters of European countries. Then, non-hierarchical clustering (k-means) method was applied. Discriminant analysis was used to determine the validity of the results with data normalized by Z score transformation. To explore the relationship between the selected indicators, correlation coefficients were computed. The results of the study reveal the current situation of RE in European Union Member States.
Abstract: Tikhonov regularization and reproducing kernels are the
most popular approaches to solve ill-posed problems in computational
mathematics and applications. And the Fourier multiplier operators
are an essential tool to extend some known linear transforms
in Euclidean Fourier analysis, as: Weierstrass transform, Poisson
integral, Hilbert transform, Riesz transforms, Bochner-Riesz mean
operators, partial Fourier integral, Riesz potential, Bessel potential,
etc. Using the theory of reproducing kernels, we construct a simple
and efficient representations for some class of Fourier multiplier
operators Tm on the Paley-Wiener space Hh. In addition, we give
an error estimate formula for the approximation and obtain some
convergence results as the parameters and the independent variables
approaches zero. Furthermore, using numerical quadrature integration
rules to compute single and multiple integrals, we give numerical
examples and we write explicitly the extremal function and the
corresponding Fourier multiplier operators.
Abstract: Speaker recognition is performed in high Additive White Gaussian Noise (AWGN) environments using principals of Computational Auditory Scene Analysis (CASA). CASA methods often classify sounds from images in the time-frequency (T-F) plane using spectrograms or cochleargrams as the image. In this paper atomic decomposition implemented by matching pursuit performs a transform from time series speech signals to the T-F plane. The atomic decomposition creates a sparsely populated T-F vector in “weight space” where each populated T-F position contains an amplitude weight. The weight space vector along with the atomic dictionary represents a denoised, compressed version of the original signal. The arraignment or of the atomic indices in the T-F vector are used for classification. Unsupervised feature learning implemented by a sparse autoencoder learns a single dictionary of basis features from a collection of envelope samples from all speakers. The approach is demonstrated using pairs of speakers from the TIMIT data set. Pairs of speakers are selected randomly from a single district. Each speak has 10 sentences. Two are used for training and 8 for testing. Atomic index probabilities are created for each training sentence and also for each test sentence. Classification is performed by finding the lowest Euclidean distance between then probabilities from the training sentences and the test sentences. Training is done at a 30dB Signal-to-Noise Ratio (SNR). Testing is performed at SNR’s of 0 dB, 5 dB, 10 dB and 30dB. The algorithm has a baseline classification accuracy of ~93% averaged over 10 pairs of speakers from the TIMIT data set. The baseline accuracy is attributable to short sequences of training and test data as well as the overall simplicity of the classification algorithm. The accuracy is not affected by AWGN and produces ~93% accuracy at 0dB SNR.
Abstract: Handwritten signature is accepted widely as a biometric characteristic for personal authentication. The use of appropriate features plays an important role in determining accuracy of signature verification; therefore, this paper presents a feature based on the geometrical concept. To achieve the aim, triangle attributes are exploited to design a new feature since the triangle possesses orientation, angle and transformation that would improve accuracy. The proposed feature uses triangulation geometric set comprising of sides, angles and perimeter of a triangle which is derived from the center of gravity of a signature image. For classification purpose, Euclidean classifier along with Voting-based classifier is used to verify the tendency of forgery signature. This classification process is experimented using triangular geometric feature and selected global features. Based on an experiment that was validated using Grupo de Senales 960 (GPDS-960) signature database, the proposed triangular geometric feature achieves a lower Average Error Rates (AER) value with a percentage of 34% as compared to 43% of the selected global feature. As a conclusion, the proposed triangular geometric feature proves to be a more reliable feature for accurate signature verification.
Abstract: In this paper, we present an application of Riemannian
geometry for processing non-Euclidean image data. We consider the
image as residing in a Riemannian manifold, for developing a new
method to brain edge detection and brain extraction. Automating this
process is a challenge due to the high diversity in appearance brain
tissue, among different patients and sequences. The main contribution, in this paper, is the use of an edge-based
anisotropic diffusion tensor for the segmentation task by integrating
both image edge geometry and Riemannian manifold (geodesic,
metric tensor) to regularize the convergence contour and extract
complex anatomical structures. We check the accuracy of the
segmentation results on simulated brain MRI scans of single
T1-weighted, T2-weighted and Proton Density sequences. We
validate our approach using two different databases: BrainWeb
database, and MRI Multiple sclerosis Database (MRI MS DB). We
have compared, qualitatively and quantitatively, our approach with
the well-known brain extraction algorithms. We show that using
a Riemannian manifolds to medical image analysis improves the
efficient results to brain extraction, in real time, outperforming the
results of the standard techniques.
Abstract: Color Histogram is considered as the oldest method
used by CBIR systems for indexing images. In turn, the global
histograms do not include the spatial information; this is why the
other techniques coming later have attempted to encounter this
limitation by involving the segmentation task as a preprocessing step.
The weak segmentation is employed by the local histograms while
other methods as CCV (Color Coherent Vector) are based on strong
segmentation. The indexation based on local histograms consists of
splitting the image into N overlapping blocks or sub-regions, and
then the histogram of each block is computed. The dissimilarity
between two images is reduced, as consequence, to compute the
distance between the N local histograms of the both images resulting
then in N*N values; generally, the lowest value is taken into account
to rank images, that means that the lowest value is that which helps to
designate which sub-region utilized to index images of the collection
being asked. In this paper, we make under light the local histogram
indexation method in the hope to compare the results obtained against
those given by the global histogram. We address also another
noteworthy issue when Relying on local histograms namely which
value, among N*N values, to trust on when comparing images, in
other words, which sub-region among the N*N sub-regions on which
we base to index images. Based on the results achieved here, it seems
that relying on the local histograms, which needs to pose an extra
overhead on the system by involving another preprocessing step
naming segmentation, does not necessary mean that it produces better
results. In addition to that, we have proposed here some ideas to
select the local histogram on which we rely on to encode the image
rather than relying on the local histogram having lowest distance with
the query histograms.
Abstract: Due to the fact that there exist only a small number of complex systems in artificial immune system (AIS) that work out nonlinear problems, nonlinear AIS approaches, among the well-known solution techniques, need to be developed. Gaussian function is usually used as similarity estimation in classification problems and pattern recognition. In this study, diagnosis of breast cancer, the second type of the most widespread cancer in women, was performed with different distance calculation functions that euclidean, gaussian and gaussian-euclidean hybrid function in the clonal selection model of classical AIS on Wisconsin Breast Cancer Dataset (WBCD), which was taken from the University of California, Irvine Machine-Learning Repository. We used 3-fold cross validation method to train and test the dataset. According to the results, the maximum test classification accuracy was reported as 97.35% by using of gaussian-euclidean hybrid function for fold-3. Also, mean of test classification accuracies for all of functions were obtained as 94.78%, 94.45% and 95.31% with use of euclidean, gaussian and gaussian-euclidean, respectively. With these results, gaussian-euclidean hybrid function seems to be a potential distance calculation method, and it may be considered as an alternative distance calculation method for hard nonlinear classification problems.
Abstract: Mosaic refers to a technique that makes image by gathering lots of small materials in various colors. This paper presents an automatic algorithm that makes the photo-mosaic image using photos. The algorithm is composed of 4 steps: partition and feature extraction, block matching, redundancy removal and color adjustment. The input image is partitioned in the small block to extract feature. Each block is matched to find similar photo in database by comparing similarity with Euclidean difference between blocks. The intensity of the block is adjusted to enhance the similarity of image by replacing the value of light and darkness with that of relevant block. Further, the quality of image is improved by minimizing the redundancy of tiles in the adjacent blocks. Experimental results support that the proposed algorithm is excellent in quantitative analysis and qualitative analysis.
Abstract: WiFi has become an essential technology that is widely used nowadays. It is famous due to its convenience to be used with mobile devices. This is especially true for Internet users worldwide that use WiFi connections. There are many location based services that are available nowadays which uses Wireless Fidelity (WiFi) signal fingerprinting. A common example that is gaining popularity in this era would be Foursquare. In this work, the WiFi signal would be used to estimate the user or client’s location. Similar to GPS, fingerprinting method needs a floor plan to increase the accuracy of location estimation. Still, the factor of inconsistent WiFi signal makes the estimation defer at different time intervals. Given so, an adaptive method is needed to obtain the most accurate signal at all times. WiFi signals are heavily distorted by external factors such as physical objects, radio frequency interference, electrical interference, and environmental factors to name a few. Due to these factors, this work uses a method of reducing the signal noise and estimation using the Nearest Neighbour based on past activities of the signal to increase the signal accuracy up to more than 80%. The repository yet increases the accuracy by using Artificial Neural Network (ANN) pattern matching. The repository acts as the server cum support of the client side application decision. Numerous previous works has adapted the methods of collecting signal strengths in the repository over the years, but mostly were just static. In this work, proposed solutions on how the adaptive method is done to match the signal received to the data in the repository are highlighted. With the said approach, location estimation can be done more accurately. Adaptive update allows the latest location fingerprint to be stored in the repository. Furthermore, any redundant location fingerprints are removed and only the updated version of the fingerprint is stored in the repository. How the location estimation of the user can be predicted would be highlighted more in the proposed solution section. After some studies on previous works, it is found that the Artificial Neural Network is the most feasible method to deploy in updating the repository and making it adaptive. The Artificial Neural Network functions are to do the pattern matching of the WiFi signal to the existing data available in the repository.
Abstract: Different types of aggregation operators such as the
ordered weighted quasi-arithmetic mean (Quasi-OWA) operator and
the normalized Hamming distance are studied. We introduce the use
of the OWA operator in generalized distances such as the quasiarithmetic
distance. We will call these new distance aggregation the
ordered weighted quasi-arithmetic distance (Quasi-OWAD) operator.
We develop a general overview of this type of generalization and
study some of their main properties such as the distinction between
descending and ascending orders. We also consider different families
of Quasi-OWAD operators such as the Minkowski ordered weighted
averaging distance (MOWAD) operator, the ordered weighted
averaging distance (OWAD) operator, the Euclidean ordered
weighted averaging distance (EOWAD) operator, the normalized
quasi-arithmetic distance, etc.
Abstract: We study different types of aggregation operators such
as the ordered weighted averaging (OWA) operator and the
generalized OWA (GOWA) operator. We analyze the use of OWA
operators in the Minkowski distance. We will call these new distance
aggregation operator the Minkowski ordered weighted averaging
distance (MOWAD) operator. We give a general overview of this
type of generalization and study some of their main properties. We
also analyze a wide range of particular cases found in this
generalization such as the ordered weighted averaging distance
(OWAD) operator, the Euclidean ordered weighted averaging
distance (EOWAD) operator, the normalized Minkowski distance,
etc. Finally, we give an illustrative example of the new approach
where we can see the different results obtained by using different
aggregation operators.