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.
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...
This paper presents new optimization approach involving a modified Bacteria Foraging Algorithm (BFA) applied to economic load dispatch involving wind energy conversion systems (WECS). The approach utilizes the natural selection of global optimum bacterium having successful foraging strategies in the cost function including the factors of overestimation and underestimation of available wind energy...
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access rights as an attribute of a graph node, and the use of a resource as a predicate on an edge of the graph. We also propose to model cloud computation semantically as a set of paths in a subgraph of the cloud such that every edge...
Nowadays, how to efficiently compose Web services has become a hotspot. In this paper, we introduce a method of recommending an optimal service sequence based on the original service sequence for a composite service. This method uses a Bayesian-based approach and selects the service sequence that has the largest probability as the best choice. Compared with existing methods, this method has two advantages:...
Web services hold a great promise of implementing the B2B e-commerce by dynamically integrating business processes over the Internet. It is necessary to automatically and accurately select appropriate Web services satisfying client requirements before and after integrating business processes. However, current Web services standards do not well support it. We propose a formal method to select appropriate...
In this paper we propose an approach for test data generation using genetic algorithm. Our objective is to design a multi-population genetic algorithm using uniform crossover. In this paper we analyze the performance of proposed uniform crossover multi population genetic algorithm method with different combinations of factors that influence the test data generation strategy. For implementing multi-population...
Reduction of Single Input Single Output (SISO) discrete systems into Reduced Order Model (ROM), using a conventional and a bio-inspired evolutionary technique is presented in this paper. In the conventional technique, mixed advantages of Modified Cauer Form (MCF) and differentiation are used. In this method, the original discrete system is first converted into equivalent continuous system by applying...
In this paper, an error analysis of amplitude histogram method used for optical performance monitoring is demonstrated. Then, an improved algorithm is proposed.
In this paper, we present the design and the implementation of a test-bed for the Policy and Charging Control (PCC) system proposed in 3GPP TS23.203. Specifically, we use an IP multimedia call service example to demonstrate how to implement an advanced mobile service with policy and charging control in our test-bed. We show that the PCC system can handle the application-level session information and...
Consistency and responsiveness are two important factors in providing the sense of reality in Distributed Virtual Environment (DVE). However, it is not easy to optimize both aspects because of the trade-off between these two factors. As a result, most existing consistency maintenance methods ignored the responsiveness requirements, or just assumed a simple responsiveness requirement model which cannot...
A model of the bee hive that clearly separates the self-organizing decision-making behaviour of the bees in the hive and the problem-specific behaviour of the bees outside the hive is presented. This separation allows for the applications of the model for different problem domains. Results of the application to three problem domains are presented - web search, function optimization and hierarchical...
We present a Chu spaces semantics of typical control flow of BPEL including fault handling and link semantics. BPELcf is proposed as a simplification of this subset of BPEL. For the compositional modeling of BPEL, we present a Chu spaces process algebra consisting of seven operators. These operators allow faults to be thrown at any point of execution and take link-based synchronization into consideration...
Evolutionary algorithms have been widely used to solve difficult constrained optimization problems. However, evolutionary algorithms are intrinsically unconstrained optimization techniques. Constraint handling is mostly incorporated additionally and its choice has great bearing on the quality of the solution. Stochastic ranking was introduced as an improvement over feasibility rules for handling constraints...
In this paper we have used a real coded genetic algorithm for finding the global minimum energy conformation of two small molecules viz. Pseudoethane and 1,2,3-trichloro-l-fluoro-propane based on a potential function. Finding the global minimum of this function is very difficult because it has a large number of local minima, which grows exponentially with molecule size. Computational results are obtained...
Invasive weed optimization (IWO) has been found to be a simple but powerful algorithm for function optimization over continuous spaces. It has reportedly outperformed many types of evolutionary algorithms and other search heuristics when tested over both benchmark and real-world problems. However the performance of most search heuristics deteriorates severely when applied to the task of optimization...
This paper proposes the prediction method for stock exchange of Thailand index (SET index). The proposed method was adapted from adding more important factors to the prediction function. This research takes into account both external and internal factors to forecast the SET index. The external factors are the historical movement of the world's major stock exchange market indices such as Dow Jones,...
This paper presents the design of a decentralized storage scheme to support multi-dimensional range queries over sensor networks. We build a distributed k-d tree based index structure over sensor network, so as to efficiently map high dimensional event data to a two-dimensional space of sensors while preserving the proximity of events. We propose a dynamic programming based methodology to control...
This paper presents an empirical analysis of the performance of differential evolution (DE) variants on different classes of unconstrained global optimization benchmark problems. This analysis has been undertaken to identify competitive DE variants which perform reasonably well on a range of problems with different features. Towards this, fourteen DE variants were implemented and tested on 14 high...
In this paper we present an empirical, comparative performance, analysis of fourteen variants of Differential Evolution (DE) and Dynamic Differential Evolution (DDE) algorithms to solve unconstrained global optimization problems. The aim is to compare DDE, which employs a dynamic evolution mechanism, against DE and to identify the competitive variants which perform reasonably well on problems with...
Differential evolution (DE) is a simple and efficient scheme for global optimization over continuous spaces. DE is generally considered as a reliable, accurate, robust and fast optimization techniques. It outperforms many other optimization algorithms in terms of convergence speed and robustness over common benchmark problems and real world applications. However, the user is required to set the values...
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.