The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A design scheme of the finite-time tracking controller is given for a general class of nonholonomic systems including extended chained systems, extended power systems, underactuated surface systems, etc. By introducing a time-varying state transformation based on the concept of minimal dilation degree, this class of nonholonomic systems is transformed into a linear time-varying control systems. The...
The goal of the paper is to describe in a unified fashion the generating series for the cascade connection of any two analytic nonlinear input-output systems. In particular, it will be shown that a single general definition of a composition product can be formulated in terms of formal power series to describe any possible cascade connection of Fliess operators or memoryless maps provided that the...
The coexistence of multimedia services in e-communication systems, with varying bandwidth utilization characteristics, impedes the efficiency of rate control and thereby impacts on the Quality of Service (QoS), in terms of low throughput. As such, the rate control for multimedia flows remains an open problem. This paper proposes a memetic optimization approach to rate allocation of multiclass services...
This paper presents a novel variant of particle swarm optimization (PSO) called adaptive accelerated exploration particle swarm optimizer (AAEPSO). AAEPSO algorithm identifies the particles which are far away from the goal and accelerate them towards goal with an exploration power. These strategies particularly avoid the premature convergence and improve the quality of solution. The performance comparisons...
This paper presents an imitation mechanism and a study of its behavior in spatial grid-based configurations. The imitation mechanism replicates external signals without associating with objects, as in higher-level imitation; it is therefore a model of proto-imitation where agents imitate unconditionally the agents they happen to interact with. We study the mechanism in 2D space to understand how it...
This paper presents fusion of Bacterial Foraging with parameter free Particle Swarm Optimization (HBF-pfPSO). The proposed technique is used to enhance quality of global optima of multimodal functions. The authors propose two major modifications in Bacterial Foraging Optimization (BFO). Firstly, all bacteria position and direction are updated after all fitness evaluations instead of each fitness evaluation...
Biogeography-Based Optimization (BBO) is a new bio-inspired and population based optimization algorithm. The convergence of original BBO to the optimum value is slow. Intelligent Biogeography-Based Optimization (IBBO) technique is a hybrid version of BBO with Bacterial Foraging algorithm (BFA). In this paper, authors integrate the bacterial intelligence feature of BFA to decide the valid emigration...
Most optimization problems have constraints of different types (e.g., physical, time, geometric, etc.), which modify the shape of the search space. We propose an ecologically inspired invasive weed optimization (IWO) algorithm to solve the constrained real-parameter optimization problems. Central to our approach is a parameter-free penalty function that we introduce. The adaptive nature of the penalty...
Evaluation of certain properties of calcined alumina or special grade alumina is necessary and important to its manufactures. Generally it is determined in the laboratories using different instrumental and manual methods, which is cost and time intensive. In the present work, evolving neural network has been used for the estimation of a property given few others. To evolve the neural network model...
Selfishness detection is becoming a hot issue in mobile ad hoc networks and wireless sensor networks. We use Dempster-Shafer theory of evidence in a novel way to incorporate data-centric trust evaluation for detection of nodes' selfish forwarding behavior. Within the proposed D2S2T2 framework, trust is considered in regard to forwarding, as part of routing support, as well as in regard to recommendations,...
In this paper, we present a new algorithm of multi-point iterative method for simultaneous determination of all roots of polynomial. Its convergence was researched. The computation is carried out by simple steepest descent rule with adaptive variable step-size. The specific examples illustrated that the proposed method can find simultaneously the roots of polynomials at a very rapid convergence and...
PROMETHE II is a multicriteria decision aid method based on pairwise comparisons. As a consequence, it cannot reasonably be applied to problems involving a large number of alternatives (such as for instance in combinatorial or continuous multi-objective optimization). The aim of this paper is to present an approach inspired by genetic algorithms that allows to overcome these difficulties. An illustrative...
Consider a group of peers, an ideal random peer sampling service should return a peer, which is an unbiased independent random sample of the group. This paper focuses on peer sampling service based on view shuffling (aka gossip-based peer sampling), where each peer is equipped with a local view of size c. This view should correspond to a uniform random sample of size c of the whole system in order...
We present a protocol for maintaining a spanning tree that is maximal with respect to any given (bounded and monotonic) routing metric. This protocol has two interesting adaptive properties. First, the protocol is stabilizing: starting from any state, the protocol stabilizes to a state where a maximal tree is present. Second, contrary to other approaches, the protocol converges in O(L * deg) time,...
Most of the power control (PC) algorithms assumed that the link gains are fixed, and the power control command can take any value in the real field. These two assumptions are unrealistic in actual communication systems, since link gains are time varying and power control commands must be sent over capacity limited channels. In this paper, we propose a binary feedback power control algorithm (BFPC)...
Analytical target cascading is a hierarchical multilevel design methodology. In this method, top-level design targets are cascaded to lower-level design problem in a consistent manner. In this paper, an exterior penalty function formulation for analytical target cascading is developed. The proposed method has a simple formulation and the results shows that the solution from the new method converges...
The key to the implementation of dynamic forensics is how to mine in real-time and effectively criminal invasion information from voluminous data. Towards the disadvantages of Fuzzy C-means clustering (referred to as FCM) forensics analysis that it is very sensitive to initial data and impacted greatly by noise, a dynamic forensics analysis technology based on genetic-fuzzy clustering algorithm is...
Many real world problems which can be assigned to the machine learning domain are inverse problems. The available data is often noisy and may contain outliers, which requires the application of global optimization. Evolutionary Algorithms (EA's) are one class of possible global optimization methods for solving such problems. Within population based EA's, Differential Evolution (DE) is a widely used...
In this paper, a solution is proposed for n-Queen problem based on ACO (ant colony optimization). The n-Queen problem become intractable for large values of `n' and thus placed in NP (non-deterministic polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard...
The paper discusses the irregular parts packing problem based on an improved immune genetic algorithm, and a NIGA based on crowing mechanism is proposed. For improving the packing efficiency, the clustering idea and algorithm are introduced and the effective characteristics of matching packing-graphics are extracted and analyzed. GA, an improved immune genetic algorithm, and NIGA are applied to practical...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.