Features is the description of the image contents which could be corner, blob or edge. Corners are one of the most important feature to describe image, therefore there are many algorithms to detect corners such as Harris, FAST, SUSAN, etc. Harris is a method for corner detection and it is an efficient and accurate feature detection method. Harris corner detection is rotation invariant but it isn’t scale invariant. This paper presents an efficient harris corner detector invariant to scale, this improvement done by using gaussian function with different scales. The experimental results illustrate that it is very useful to use Gaussian linear equation to deal with harris weakness.
Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing
... Show MoreThe Gaussian orthogonal ensemble (GOE) version of the random matrix theory (RMT) has been used to study the level density following up the proton interaction with 44Ca, 48Ti and 56Fe.
A promising analysis method has been implemented based on the available data of the resonance spacing, where widths are associated with Porter Thomas distribution. The calculated level density for the compound nuclei 45Sc,49Vand 57Co shows a parity and spin dependence, where for Sc a discrepancy in level density distinguished from this analysis probably due to the spin misassignment .The present results show an acceptable agreement with the combinatorial method of level density.
... Show MoreThis paper presents a cognition path planning with control algorithm design for a nonholonomic wheeled mobile robot based on Particle Swarm Optimization (PSO) algorithm. The aim of this work is to propose the circular roadmap (CRM) method to plan and generate optimal path with free navigation as well as to propose a nonlinear MIMO-PID-MENN controller in order to track the wheeled mobile robot on the reference path. The PSO is used to find an online tune the control parameters of the proposed controller to get the best torques actions for the wheeled mobile robot. The numerical simulation results based on the Matlab package show that the proposed structure has a precise and highly accurate distance of the generated refere
... Show MoreThe rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. E
... Show MoreA three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an
... Show MoreThe presentwork is a theoretical study in the field of charged particle optics. It concentrates on the design of electrostatic enzil lens for focusing charge particles beams, using inverse method in designingthe electrostatic lens. The paraxial ray equation was solved to obtain the trajectory of the particles, the optical properties such as the focal length and spherical and chromatic aberration coefficients were determined. The shape of the electrode of the electrostatic lens were determined by solving poison equation and the results showed low values of spherical and chromatic aberrations, which are considered as good criteria for good design.
The primary purpose of this paper is to introduce the, N-coprobabilistic normed space, coprobabilistic dual space of N-coprobabilistic normed space and give some facts that are related of them.
In this paper, a theoretical study of the energy spectra and the heat capacity of one electron quantum dot with Gaussian Confinement in an external magnetic field are presented. Using the exact diagonalization technique, the Hamiltonian of the Gaussian Quantum Dot (GQD) including the electron spin is solved. All the elements in the energy matrix are found in closed form. The eigenenergies of the electron were displayed as a function of magnetic field, Gaussian confinement potential depth and quantum dot size. Explanations to the behavior of the quantum dot heat capacity curve, as a function of external applied magnetic field and temperature, are presented.
This paper contains an equivalent statements of a pre- space, where are considered subsets of with the product topology. An equivalence relation between the preclosed set and a pre- space, and a relation between a pre- space and the preclosed set with some conditions on a function are found. In addition, we have proved that the graph of is preclosed in if is a pre- space, where the equivalence relation on is open.
On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that
... Show More