به نام خدا
Title: Function optimisation by learning automata
Authors: QH Wu , HL Liao
Abstract: This paper presents a new algorithm, Function Optimisation by Learning Automata (FOLA), to solve complex function optimisation problems. FOLA consists of multiple automata, in which each automaton undertakes dimensional search on a selected dimension of the solution domain. A search action is taken on a path which is identified in the search space by the path value, and the path value is updated using the values of the states visited in the past, via a state memory that enables better use of the information collected in the optimisation process. In this paper, FOLA is compared with two popularly used particle swarm optimisers and four newly-proposed optimisers, on nine complex multi-modal benchmark functions. The experimental results have shown that in comparison with the other optimisers, FOLA offers better performance for most of the benchmark functions, in terms of its convergence rate and accuracy, and it uses much less computation time to obtain accurate solutions, especially for high-dimensional functions. In order to explore the FOLA s potential for applications, it is also applied to solve an optimal power flow problem of power systems. FOLA is able to minimise the fuel cost and enhance the voltage stability of the power system more efficiently in comparison with the other algorithms.
Publish Year: 2013
Published in: Information Sciences - Science Direct
Number of Pages: 20
موضوع: اتوماتای یادگیر (Learning Automata)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Augmenting the World using Semantic Web Technologies
Authors: Jens Grubert, Lyndon Nixon, Gerhard Reitmayr
Abstract: Creating and maintaining augmented scenes for mobile Augmented Reality browsers can be a challenging and time consuming task. The timeliness of digital information artifacts connected to changing urban environments require authors to constantly update the structural representations of augmented scenes or to accept that the information will soon be outdated. We present an approach for retrieving multimedia content and relevant web services for mobile Augmented Reality applications at runtime. Using semantic web technologies we are able to postpone the retrieval of actual media items to the moment a user actually perceives an augmented scene. This allows content creators to augment a scene only once and avoid continuous manual updates. We also discuss the tradeoff between runtime content retrieval using Linked Data concepts and decreased control over the scene appearance at the time of authoring that comes along with this approach.
Publish Year: 2012
Published in: ISMAR - IEEE
Number of Pages: 3
موضوع: وب معنایی (Semantic Web)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: A high abstraction level approach for detecting feature interactions between telecommunication services
Authors: Zohair Chentouf, Ahmed Khoumsi
Abstract: When several telecommunication services are running at the same time, undesirable behaviors may arise, which are commonly called feature interactions. Several methods have been developed for detecting and resolving feature interactions. However, most of these methods are based on detailed models of services, which make them suffer from state space explosion. Moreover, different telecommunication operators cannot cooperate to manage feature interactions by exchanging detailed service models because this violates the confidentiality principle. Our work is a part of the few attempts to develop feature interaction detection methods targeting to avoid or reduce significantly state space explosion. In order to reach this objective, we first develop a so called Cause Restrict language to model subscribers of telecommunication services at a very high abstraction level. A Cause Restrict model of a subscriber provides information such as: what is the cause of what, and what restricts (or forbids) what, and specifies coarsely the frequency of each operation cause or restrict by always or sometimes. Then, we develop a method that detects feature interactions between telecommunication services modeled in the Cause Restrict language. We demonstrate the applicability of our approach by modeling several services and detecting several feature interactions between them. New feature interactions have been detected by our approach.
Publish Year: 2013
Published in: Information Sciences - Science Direct
Number of Pages: 17
موضوع: مخابرات (Telecommunication)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Improved Genetic Algorithms based Optimum Path Planning for Mobile Robot
Authors: Soh Chin Yun , Veleppa Ganapathy ,Lim Ooi Chong
Abstract: Improved genetic algorithms incorporate other techniques, methods or algorithms to optimize the performance of genetic algorithm. In this paper, improved genetic algorithms of optimum path planning for mobile robot navigation are proposed. An Obstacle Avoidance Algorithm (OAA) and a Distinguish Algorithm (DA) are introduced to generate the initial population in order to improve the path planning efficiency to select only the feasible paths during the evolution of genetic algorithm. Domain heuristic knowledge based crossover, mutation, refinement and deletion operators are specifically designed to fit path planning for mobile robots. Proposed genetic algorithms feature unique, simple path representations, and simple but effective evaluation methods. Simulation studies and real time implementations are carried out to verify and validate the effectiveness of the proposed algorithms.
Publish Year: 2010
Published in: ICARCV - IEEE
Number of Pages: 13
موضوع: الگوریتم ژنتیک (Genetic Algorithms)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Fractal behind coin-reducing payment
Authors: Ken Yamamoto , Yoshihiro Yamazaki
Abstract: The minimal payment a payment method which minimizes the number of coins in a purse is presented. We focus on a time series of change given back to a shopper repeating the minimal payment. By using the delay plot, the set of successive change possesses a fine structure similar to the Sierpinski gasket. We also estimate affectivity of the minimal- payment method by means of the average number of coins in a purse, and conclude that the minimal-payment strategy is the best to reduce the number of coins in a purse. More- over, we compare our results to the rule-60 cellular automaton and the Pascal Sierpinski gaskets, which are known as generators of the discrete Sierpinski gasket.
Publish Year: 2012
Published in: Chaos, Solitons & Fractals - Science Direct
Number of Pages: 9
موضوع: فرکتال (Fractal)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان