An evolutionary game theory based approach for query expansion

Multimedia Tools and Applications - In Information Retrieval (IR) Systems, an essential technique employed to improve accuracy and efficiency is Query Expansion (QE). QE is the technique that...     

High-speed,low-leakage integrated circuits: An evolutionary algorithm perspective

The markets today observe users having increasing demands on processing speed and energy consumption of their mobile devices. However, processing speed as well as functionality always comes at the expense of energy and thus limits, among other things, mobility and integration density. Recent technological developments allow for the simultaneous realization of slow, low-energy consuming as well as fast, high-energy consuming gates on the very same chip. In this respect, a particular design is an abstract optimization task for which this paper applies evolutionary algorithms. These algorithms are heuristic population-based search procedures that utilize certain mechanisms known from natural evolution. In comparison to currently available deterministic optimization procedures, the evolutionary algorithms achieved some energy savings of about 10–40% on standard ISCAS test problems, while still yielding the highest processing speed possible.     

An incentive game based evolutionary model for crowd sensing networks

Crowd sensing networks can be used for large scale sensing of the physical world or other information service by leveraging the available sensors on the phones. The collector hopes to collect as much as sensed data at relatively low cost. However, the sensing participants want to earn much money at low cost. This paper examines the evolutionary process among participants sensing networks and proposes an evolutionary game model to depict collaborative game phenomenon in the crowd sensing networks based on the principles of game theory in economics. A effectively incentive mechanism is established through corrected the penalty function of the game model accordance with the cooperation rates of the participant, and corrected the game times in accordance with it’s payoff. The collector controls the process of game by adjusting the price function. We find that the proposed incentive game based evolutionary model can help decision makers simulate evolutionary process under various scenarios. The crowd sensing networks structure significantly influence cooperation ratio and the total number of participant involved in the game, and the distribution of population with different game strategy. Through evolutionary game model, the manager can select an optimal price to facilitate the system reach equilibrium state quickly, and get the number of participants involved in the game. The incentive game based evolutionary model in crowd sensing networks provides valuable decision-making support to managers.     

The impact of topology on energy consumption for collection tree protocols: An experimental assessment through evolutionary computation

The analysis of worst-case behavior in wireless sensor networks is an extremely difficult task, due to the complex interactions that characterize the dynamics of these systems. In this paper, we present a new methodology for analyzing the performance of routing protocols used in such networks. The approach exploits a stochastic optimization technique, specifically an evolutionary algorithm, to generate a large, yet tractable, set of critical network topologies; such topologies are then used to infer general considerations on the behaviors under analysis. As a case study, we focused on the energy consumption of two well-known ad hoc routing protocols for sensor networks: the multi-hop link quality indicator and the collection tree protocol. The evolutionary algorithm started from a set of randomly generated topologies and iteratively enhanced them, maximizing a measure of “how interesting” such topologies are with respect to the analysis. In the second step, starting from the gathered evidence, we were able to define concrete, protocol-independent topological metrics which correlate well with protocols’ poor performances. Finally, we discovered a causal relation between the presence of cycles in a disconnected network, and abnormal network traffic. Such creative processes were made possible by the availability of a set of meaningful topology examples. Both the proposed methodology and the specific results presented here – that is, the new topological metrics and the causal explanation – can be fruitfully reused in different contexts, even beyond wireless sensor networks.     

Intelligence evolution for service robot: An ADRC perspective

The strategy of active disturbance rejection control (ADRC) and its applications in intelligence evolution for service robot are summarized. It is also shown that the philosophy of ADRC is consistent with the essential characteristics of intelligence evolution. Most importantly, we concentrate on five core issues which will be encountered when applying ADRC to deal with intelligence evolution for service robot, that is, how to eliminate the impact of unknown composite disturbances, how to handle the nonholonomic constraints in uncalibrated visual servoing, how to realize eye hand torque coordination, how to deal with the disturbance in simultaneous localization and mapping (SLAM), and how to reject the imperfections induced by network in human robot interaction. The main purpose of this paper is to clarify the challenges encountered on intelligence evolution for service robot when one applies ADRC to, hoping that more and more researchers can give some suggestions or work together to deal with these problems, and flourishing results of ADRC from both theory and applications.     

An evolutionary game algorithm for grid resource allocation under bounded rationality

Resource allocation cannot reach equilibrium in one‐off game in grid environment because of the bounded rationality of the users. To address this issue, an evolutionary game algorithm for grid resource allocation is proposed in this paper. The evolutionary game theory is introduced to study the selection process of user strategy from the dynamic viewpoint. Firstly, the problem of multiple users competing for a common resource is formulated as a symmetric game. Secondly, replicated dynamic mechanism is used to produce the evolutionary stable point that leads to a satisfied allocation scenario. Finally, the relationships among the evolutionary stable point, valuation functions, and convergence time are discussed in detail. The results of the experiments show that the proposed evolutionary game algorithm is convergent and generates better utility results compared with the classical game algorithm. Copyright © 2009 John Wiley & Sons, Ltd.     

An evolutionary game approach to IoT task offloading in fog-cloud computing

The Journal of Supercomputing - Developing the edge and fog computing has been the result of the fast growth of cloud-based IoT applications. These new paradigms define new resource management...     

收益与进化阶段强相关的灰色进化博弈模型研究

进化博弈的链结构模型能直观地描述和研究经济活动的过程,而收益与发展阶段强相关是经济活动中经常存在的一种现象,同时考虑到人的有限理性以及现实中的贫信息因素,灰数便成为收益矩阵估计的重要手段.为此提出一类收益与进化阶段强相关的灰进化博弈链结构模型.在此基础上研究模型的求解问题,并给出了算例.最后结合产业集聚,讨论了解的经济含义和现实启发.     

A decision framework for the analysis of green supply chain contracts: An evolutionary game approach

The overwhelming growth in the struggle between economy and ecology has led managerial research to promote methodologies to reap profits ensuring sustainability of the ecosystem thus venturing into the novel domain incorporating sustainability with supply chain management and coordination. In this paper, we look for a synergetic alliance between the environmental and commercial benefits by establishing coordination between the producer and the retailer to adjudicate their strategies to trigger green practices with the focus on maximizing economic profits by leveraging upon the product’s greenness. A two player game has been developed to stand synonymous to the situation considered. Special considerations have been devised to augment the analysis with the consumer psychology towards the green products to establish a practical outlook involving the greenness and economic returns. Evolutionary dynamics has been adopted extensively to locate the optimal and the most stable point offering the best economic gains. The economically suitable solutions are then substantiated on an existing sustainability metric and hence we aim to offer a holistic view into supply chain dynamics from the perspective of environmental management. The insights drawn provide managerial implications and advantages of having environment as a key focus along with business motives.     

An evolutionary algorithm for order splitting with multiple transport alternatives

In this paper, a new methodology is suggested for determining the optimal mix of transport alternatives to minimize total logistics costs when goods are shipped from a supplier to a receiver. The total logistics costs comprise order costs, transportation costs and inventory costs.It is assumed that only a limited number of transport alternatives are capable of shipping the goods from the supplier to the receiver. Moreover, if a certain transport alternative is selected to ship the goods, then its entire capacity is used. These assumptions imply that the number of possible order quantities is finite and that the problem can be formulated as a combinatorial optimization problem. In a first step to explore the use of metaheuristics for optimization problems like these, an Evolutionary Algorithm is developed in this paper. The heuristic is tested on real-life problem instances.     

基于动态博弈描述的电子商务协议公平性*

基于通信顺序进程和动态博弈理论对电子商务系统建模,提出了结构化的电子商务协议的公平性, 并基于该模型给出了公平性的形式化定义, 可以用于电子商务协议公平性的分析。与以往工作相比,主要贡献在于：a)系统模型中的失效模型分别对进程和通信失效建模,增加了通信延迟失效模型,可以分析系统失效时满足的公平性; b)收益平衡从参与者获得利益和损失利益两个角度定义公平性,打破了以往公平性定义只能应用于零和交易系统的局限; c)结构化的公平性分别考虑系统诚实参与者中途自愿退出或者因失效中止协议的公平性和有参与者欺骗下的协议的公平性等。后两点解决了系统满足公平性定义但实际上对参与者不公平的矛盾.     

网格资源非对称进化博弈分配策略

针对经济模型的网格系统中资源分配的竞争问题,应用进化博弈论中多种群复制动态博弈模型对有限理性网格用户有差别的出价策略进行了研究,提出了一种非对称进化资源分配博弈模型,该模型将网格用户分为出价偏低的保守种群和出价偏高的激进种群,分析了两种网格种群采取合作与竞争策略的自发进化过程,求解了各自的复制动态方程,并通过实例化的非对称支付矩阵求解了复制动态系统的进化稳定策略。研究表明,只有博弈双方选择对等的行为策略才能促进网格资源的公平分配。     

The role of social network sites on the relationship between game users and developers: an evolutionary game analysis of virtual goods

Information Technology and Management - Social network sites (SNS) have gradually permeated into people’s daily life recently, providing a new perspective for promoting the virtual market in...     

The evolution of perspective view in WalkMap

A wearable computer is a potential platform for map applications: it is mobile in nature, and is often equipped with a head-worn display capable of displaying maps of the surrounding area in graphical form. In this paper, we present a map application, called WalkMap, developed for wearable computers. We concentrate on the visual presentation of the map, and propose a visualisation method that is based on the perspective distortion of a regular two-dimensional bird's-eye view map. We also describe the results of a field study, and compare the distorted view to a regular two-dimensional view. The results show that while a perspective visualisation is good for some navigational tasks, for some other tasks a regular map is preferred. We then continue by developing the visualisation further, and present a fully adjustable three-dimensional version of the map application, called WalkMap3D. WalkMap3D can display the map area in three dimensions, but is also capable of displaying both traditional two-dimensional and perspective map views.Abbreviations GLU OpenGL Graphics System Utility Library - HWD Head Worn Display - LOD Level of Detail - VRML Virtual Reality Modelling Language - YAH You Are Here     

Design of evolutionary algorithms-A statistical perspective

This paper describes a statistical method that helps to find good parameter settings for evolutionary algorithms. The method builds a functional relationship between the algorithm's performance and its parameter values. This relationship-a statistical model-can be identified thanks to simulation data. Estimation and test procedures are used to evaluate the effect of parameter variation. In addition, good parameter settings can be investigated with a reduced number of experiments. Problem labeling can also be considered as a model variable and the method enables identifying classes of problems for which the algorithm behaves similarly. Defining such classes increases the quality of estimations without increasing the computational cost     

MAC protocols over wireless mesh networks: problems and perspective

The wireless mesh network (WMN) has been an emerging technology in recent years. Because the transmission medium used in networking backhaul access points (APs) is radio, the wireless mesh network is not only easy and cost effective in deployment, but also has good scalability in coverage area and capacity. This paper provides an overview of distributed medium access control (MAC) protocols, discusses their features and suitability for WMNs and identifies potential challenges and open research issues. Specifically, we overview the technical medium access control of the new standard for WMNs, the mesh deployments of the IEEE 802.16 MAC and we focus on the coordinated distributed scheduling (CDS) scheme of this. Moreover, we assess the fitness of the IEEE 802.11 over wireless mesh networks. Through the study of existing solutions, we analyze the previous work and sketch the contours of the directions to achieve the throughput and the latency that must be guaranteed in WMNs. In this context we suggest future enhancements to the standard that could increase throughput, while also increase the robustness, without complexity increases and propose and evaluate a new distributed scheduling scheme (DSS). We compared the CDS and the DSS and simulations studies document and confirm the positive characteristics of the proposed scheme. Furthermore, we proposed an analytical model to assess a lower bound in terms of delay.     

The computer spectrum: a perspective on the evolution of computing

A report from the IEEE Scientific Supercomputer Subcommittee traces and analyzes the evolution of computer classes and offers near-term projections. It examines business and scientific computers, the emergence of new classes, the supercomputer and the minicomputer, the evolution of the supercomputer, the emergence of the minisupercomputer, and the personal computer and the applications workstation. It provides a historical analysis of these trends and discusses the lack of comparable software developments