Advanced Computational Intelligence System for inverse aeronautical design optimisation

Abstract—Computational Intelligence Systems (CIS) is one of advanced softwares. CIS has been important position for solving single-objective / reverse / inverse and multi-objective design problems in engineering. The paper hybridise a CIS for optimisation with the concept of Nash-Equilibrium as an optimisation pre-conditioner to accelerate the optimisation process. The hybridised CIS (Hybrid Intelligence System) coupled to the Finite Element Analysis (FEA) tool and one type of Computer Aided Design(CAD) system; GiD is applied to solve an inverse engineering design problem; reconstruction of High Lift Systems (HLS). Numerical results obtained by the hybridised CIS are compared to the results obtained by the original CIS. The benefits of using the concept of Nash-Equilibrium are clearly demonstrated in terms of solution accuracy and optimisation efficiency.

Validação de uma estrutura de análise ofensiva no basquetebol baseada no sequenciamento de dinâmicas de criação de espaço

A inferência de estratégias ofensivas em esportes coletivos pode ser realizada a partir da análise dos padrões de jogo observados durante a disputa. Para que isso ocorra, há a necessidade da formalização de classes de comportamentos específicos para a modalidade de forma a discriminar perfis de jogo com base na identificação das ações mais recorrentes. No basquetebol as ações são encadeadas ao longo da posse de bola, sendo que os diferentes tipos de sequências de ações contêm características que os diferenciam e podem influenciar diretamente no desfecho do ataque. Nesse trabalho foi apresentada uma proposta contendo diferentes possibilidades de sequenciamento de dinâmicas ofensivas baseadas em um modelo teórico descrito na literatura. Os procedimentos de validação do sequenciamento de dinâmicas ofensivas e os testes de reprodutibilidade e objetividade realizados junto a técnicos de basquetebol apresentaram valores elevados demonstrando a consistência dos critérios para a elaboração de 27 tipos de concatenações dependentes (Qui-quadrado >0,78). Além disso, a estrutura desenvolvida foi concluída através da aplicação do constructo a jogos de basquetebol da liga profissional Americana (NBA) (28 partidas, dentre as quais 10 partidas do confronto entre Spurs x Thunder, 10 partidas referentes ao confronto entre Heat e Pacers e 8 partidas da disputa envolvendo Heat e Spurs, sendo analisados ambos os ataques em cada confronto, válidos pela temporada regular e na fase de playoffs). Os resultados gerados a partir da análise foram apresentados através de árvores de decisão e grafos de modo a facilitar a visualização dos comportamentos identificados. A árvore de decisão apresentou as ações na sequência exata em que ocorreram nas posses de bola, enquanto os grafos mostraram os encadeamentos mais recorrentes entre duas dinâmicas ofensivas. Assim ambas as técnicas se mostraram complementares e auxiliaram na observação e análise dos perfis de jogo de cada equipe e na realização de inferências acerca de sua estratégia ofensiva. A formalização dos tipos de sequenciamento de ações ofensivas pode auxiliar treinadores e profissionais do basquetebol no desenho de estratégias, análise dos padrões de suas equipes e adversários e estruturação de sessões de treinamento que considerem os comportamentos ofensivos de modo dinâmico e contextualizado dentro de um encadeamento lógico de ações de jogo

Aplicaciones del sistema de eslabones de PUNI a la preparación psicológica de un equipo de fútbol ante competiciones concretas

El sistema de eslabones propuesto por PUNI se basa en una serie de pasos fundamentales en la preparación psicológica de los deportistas ante una competencia concreta. En primera instancia se hace referencia a: (a) la selección de información necesaria, suficiente y confiable acerca de las condiciones de la próxima competición y sobre las particularidades del rival, (b) al análisis de los recursos y posibilidades del propio equipo, (c) a la definición de estrategias de juego y de objetivos específicos individuales, (d) a la actualización de motivos personal y socialmente importantes en concordancia con los objetivos de la participación, (e) a la modelación de condiciones de la próxima competición, (f) a la preparación especial para el encuentro, utilizando obstáculos competitivos de diversa gravedad (especialmente acontecimientos inesperados), (g) a la definición de mecanismos de autorregulación de estados internos desfavorables y (h) a la selección y utilización de procedimientos de activación psicofísica precompetitiva óptima.

Learning and practising supply chain management strategies from a business simulation game: a comprehensive supply chain simulation

An Internet based supply chain simulation game (ISCS) is introduced and demonstrated in this paper. Different from other games and extended from the Beer Game, a comprehensive set of supply chain (SC) management strategies can be tested in the game, and these strategies can be evaluated and appraised based on the built-in Management Information System (MIS). The key functionalities of ISCS are designed to increase players SC awareness, facilitate understanding on various SC strategies and challenges, foster collaboration between partners, and improve problem solving skills. It is concluded that an ISCS can be used as an efficient and effective teaching tool as well as a research tool in operations research and management science. Problems and obstacles have been observed while engaging in the SC business scenario game. The actions proposed and implemented to solve these problems have resulted in improved SC performance.

Spiteful Strategies. The ontogeny and the practice of spite in human interaction: an experimental game theory approach and empirical applications

As estratégias de malevolência implicam que um indivíduo pague um custo para infligir um custo superior a um oponente. Como um dos comportamentos fundamentais da sociobiologia, a malevolência tem recebido menos atenção que os seus pares o egoísmo e a cooperação. Contudo, foi estabelecido que a malevolência é uma estratégia viável em populações pequenas quando usada contra indivíduos negativamente geneticamente relacionados pois este comportamento pode i) ser eliminado naturalmente, ou ii) manter-se em equilíbrio com estratégias cooperativas devido à disponibilidade da parte de indivíduos malevolentes de pagar um custo para punir. Esta tese propõe compreender se a propensão para a malevolência nos humanos é inerente ou se esta se desenvolve com a idade. Para esse efeito, considerei duas experiências de teoria de jogos em crianças em ambiente escolar com idades entre os 6 e os 22 anos. A primeira, um jogo 2x2 foi testada com duas variantes: 1) um prémio foi atribuído a ambos os jogadores, proporcionalmente aos pontos acumulados; 2), um prémio foi atribuído ao jogador com mais pontos. O jogo foi desenhado com o intuito de causar o seguinte dilema a cada jogador: i) maximizar o seu ganho e arriscar ter menos pontos que o adversário; ou ii) decidir não maximizar o seu ganho, garantindo que este não era inferior ao do seu adversário. A segunda experiência consistia num jogo do ditador com duas opções: uma escolha egoísta/altruísta (A), onde o ditador recebia mais ganho, mas o seu recipiente recebia mais que ele e uma escolha malevolente (B) que oferecia menos ganhos ao ditador que a A mas mais ganhos que o recipiente. O dilema era que se as crianças se comportassem de maneira egoísta, obtinham mais ganho para si, ao mesmo tempo que aumentavam o ganho do seu colega. Se fossem malevolentes, então prefeririam ter mais ganho que o seu colega ao mesmo tempo que tinham menos para eles próprios. As experiências foram efetuadas em escolas de duas áreas distintas de Portugal (continente e Açores) para perceber se as preferências malevolentes aumentavam ou diminuíam com a idade. Os resultados na primeira experiência sugerem que (1) os alunos compreenderam a primeira variante como um jogo de coordenação e comportaram-se como maximizadores, copiando as jogadas anteriores dos seus adversários; (2) que os alunos repetentes se comportaram preferencialmente como malevolentes, mais frequentemente que como maximizadores, com especial ênfase para os alunos de 14 anos; (3) maioria dos alunos comportou-se reciprocamente desde os 12 até aos 16 anos de idade, após os quais começaram a desenvolver uma maior tolerância às escolhas dos seus parceiros. Os resultados da segunda experiência sugerem que (1) as estratégias egoístas eram prevalentes até aos 6 anos de idade, (2) as tendências altruístas emergiram até aos 8 anos de idade e (3) as estratégias de malevolência começaram a emergir a partir dos 8 anos de idade. Estes resultados complementam a literatura relativamente escassa sobre malevolência e sugerem que este comportamento está intimamente ligado a preferências de consideração sobre os outros, o paroquialismo e os estágios de desenvolvimento das crianças.************************************************************Spite is defined as an act that causes loss of payoff to an opponent at a cost to the actor. As one of the four fundamental behaviours in sociobiology, it has received far less attention than its counterparts selfishness and cooperation. It has however been established as a viable strategy in small populations when used against negatively related individuals. Because of this, spite can either i) disappear or ii) remain at equilibrium with cooperative strategies due to the willingness of spiteful individuals to pay a cost in order to punish. This thesis sets out to understand whether propensity for spiteful behaviour is inherent or if it develops with age. For that effect, two game-theoretical experiments were performed with schoolboys and schoolgirls aged 6 to 22. The first, a 2 x 2 game, was tested in two variants: 1) a prize was awarded to both players, proportional to accumulated points; 2), a prize was given to the player with most points. Each player faced the following dilemma: i) to maximise pay-off risking a lower pay-off than the opponent; or ii) not to maximise pay-off in order to cut down the opponent below their own. The second game was a dictator experiment with two choices, (A) a selfish/altruistic choice affording more payoff to the donor than B, but more to the recipient than to the donor, and (B) a spiteful choice that afforded less payoff to the donor than A, but even lower payoff to the recipient. The dilemma here was that if subjects behaved selfishly, they obtained more payoff for themselves, while at the same time increasing their opponent payoff. If they were spiteful, they would rather have more payoff than their colleague, at the cost of less for themselves. Experiments were run in schools in two different areas in Portugal (mainland and Azores) to understand whether spiteful preferences varied with age. Results in the first experiment suggested that (1) students understood the first variant as a coordination game and engaged in maximising behaviour by copying their opponent’s plays; (2) repeating students preferentially engaged in spiteful behaviour more often than maximising behaviour, with special emphasis on 14 year-olds; (3) most students engaged in reciprocal behaviour from ages 12 to 16, as they began developing higher tolerance for their opponent choices. Results for the second experiment suggested that (1) selfish strategies were prevalent until the age of 6, (2) altruistic tendencies emerged since then, and (3) spiteful strategies began being chosen more often by 8 year-olds. These results add to the relatively scarce body of literature on spite and suggest that this type of behaviour is closely tied with other-regarding preferences, parochialism and the children’s stages of development.

Lucky numbers: Choice strategies in the Pennsylvania Daily Number game

Examined the amount of money bet during a week of Pennsylvania's Daily Number game. In this game, players receive a predetermined payoff for picking the 3-digit number (000 to 999) drawn on that day. The betting distribution was distinctly nonuniform. Several betting patterns were identified, such as picking triples and avoiding double 9s. In addition, 121 adults and 215 students were asked to rate selected numbers for randomness, luckiness, and perceived history of winning; to categorize numbers; and to free associate to numbers. It is proposed that people seem to choose highly patterned, available, and/or "lucky" numbers. People apparently do not bet numbers that reflect the random process of the game (do not utilize a representativeness heuristic).

Game Theoretic Bidding Strategies for Auctions in Green Electricity Markets

Electricity markets in the United States presently employ an auction mechanism to determine the dispatch of power generation units. In this market design, generators submit bid prices to a regulation agency for review, and the regulator conducts an auction selection in such a way that satisfies electricity demand. Most regulators currently use an auction selection method that minimizes total offer costs ["bid cost minimization" (BCM)] to determine electric dispatch. However, recent literature has shown that this method may not minimize consumer payments, and it has been shown that an alternative selection method that directly minimizes total consumer payments ["payment cost minimization" (PCM)] may benefit social welfare in the long term. The objective of this project is to further investigate the long term benefit of PCM implementation and determine whether it can provide lower costs to consumers. The two auction selection methods are expressed as linear constraint programs and are implemented in an optimization software package. Methodology for game theoretic bidding simulation is developed using EMCAS, a real-time market simulator. Results of a 30-day simulation showed that PCM reduced energy costs for consumers by 12%. However, this result will be cross-checked in the future with two other methods of bid simulation as proposed in this paper.

Play the game or get played? Researchers’ strategies around R&D policies

This chapter focuses on possible effects of current R&D policies in the scientific work, exploring some of the dilemmas they cause to researchers. In a transnational scale, R&D policies embrace performance-based research funding systems, calling for a growing accountability and a more useful and published research. Often justified by the importance of knowledge in public policies or as part of the new managerialism regime, these trends emphasize performativity on research. In this scenario, how researchers receive and interpret R&D policies is influenced according to their values and interests? Do they play the game or do they get played by it? These questions rely on a conceptual framework that conceives the research as a political scene, where researchers and R&D policies meet. Moreover, researchers’ strategies are perceived as political, considering that it is in the context of the practices that policy is interpreted and reinvented. The chapter presents an empirical study conducted in Portugal, which will be taken as an example of what Waitere et al (2011) already named as “choosing whether to resist or reinforce” R&D policies. In fact, the study revealed a strategic calculation made by researchers and the coexistence of convergent and divergent strategies concerning R&D policies. I will argue that the tensions in this strategic game are both a reflex and generator of the dilemmas of scientific work today and a sign of the complexity of public policies.

A comparative study of translation strategies applied in dealing with role languages. : A translation analysis of the video game Final Fantasy XIV

Localisation is the process of taking a product and adapting it to fit the culture in question. This usually involves making it both linguistically and culturally appropriate for the target audience. While there are many areas in video game translations where localisation holds a factor, this study will focus on localisation changes in the personalities of fictional characters between the original Japanese version and the English localised version of the video game Final Fantasy XIV: A Realm Reborn and its expansion Heavensward for PC, PS3 and PS4. With this in mind, specific examples are examined using Satoshi Kinsui's work on yakuwarigo, role language as the main framework for this study. Five non-playable characters were profiled and had each of their dialogues transcribed for a comparative analysis. This included the original Japanese text, the officially localised English text and a translation of the original Japanese text done by myself. Each character were also given a short summary and a reasoned speculation on why these localisation changes might have occurred. The result shows that there were instances where some translations had been deliberately adjusted to ensure that the content did not cause any problematic issues to players overseas. This could be reasoned out that some of the Japanese role languages displayed by characters in this game could potentially cause dispute among the western audience. In conclusion, the study shows that localisation can be a difficult process that not only requires a translator's knowledge of the source and target language, but also display some creativity in writing ability to ensure that players will have a comparable experience without causing a rift in the fanbase.

Fast reconstruction of aerodynamic shapes using evolutionary algorithms and virtual Nash strategies in a CFD design environment

This paper compares the performances of two different optimisation techniques for solving inverse problems; the first one deals with the Hierarchical Asynchronous Parallel Evolutionary Algorithms software (HAPEA) and the second is implemented with a game strategy named Nash-EA. The HAPEA software is based on a hierarchical topology and asynchronous parallel computation. The Nash-EA methodology is introduced as a distributed virtual game and consists of splitting the wing design variables - aerofoil sections - supervised by players optimising their own strategy. The HAPEA and Nash-EA software methodologies are applied to a single objective aerodynamic ONERA M6 wing reconstruction. Numerical results from the two approaches are compared in terms of the quality of model and computational expense and demonstrate the superiority of the distributed Nash-EA methodology in a parallel environment for a similar design quality.

Learning to win process-control games watching game-masters

The present paper focuses on some interesting classes of process-control games, where winning essentially means successfully controlling the process. A master for one of these games is an agent who plays a winning strategy. In this paper we investigate situations in which even a complete model (given by a program) of a particular game does not provide enough information to synthesize—even incrementally—a winning strategy. However, if in addition to getting a program, a machine may also watch masters play winning strategies, then the machine is able to incrementally learn a winning strategy for the given game. Studied are successful learning from arbitrary masters and from pedagogically useful selected masters. It is shown that selected masters are strictly more helpful for learning than are arbitrary masters. Both for learning from arbitrary masters and for learning from selected masters, though, there are cases where one can learn programs for winning strategies from masters but not if one is required to learn a program for the master's strategy itself. Both for learning from arbitrary masters and for learning from selected masters, one can learn strictly more by watching m+1 masters than one can learn by watching only m. Last, a simulation result is presented where the presence of a selected master reduces the complexity from infinitely many semantic mind changes to finitely many syntactic ones.

Optimal strategies and minimax lower bounds for online convex games

A number of learning problems can be cast as an Online Convex Game: on each round, a learner makes a prediction x from a convex set, the environment plays a loss function f, and the learner’s long-term goal is to minimize regret. Algorithms have been proposed by Zinkevich, when f is assumed to be convex, and Hazan et al., when f is assumed to be strongly convex, that have provably low regret. We consider these two settings and analyze such games from a minimax perspective, proving minimax strategies and lower bounds in each case. These results prove that the existing algorithms are essentially optimal.

Scripting versus emergence : issues for game developers and players in game environment design

This paper defines and discusses two contrasting approaches to designing game environments. The first, referred to as scripting, requires developers to anticipate, hand-craft and script specific game objects, events and player interactions. The second, known as emergence, involves defining general, global rules that interact to give rise to emergent gameplay. Each of these approaches is defined, discussed and analyzed with respect to the considerations and affects for game developers and game players. Subsequently, various techniques for implementing these design approaches are identified and discussed. It is concluded that scripting and emergence are two extremes of the same continuum, neither of which are ideal for game development. Rather, there needs to be a compromise in which the boundaries of action (such as story and game objectives) can be hardcoded and non-scripted behavior (such as interactions and strategies) are able to emerge within these boundaries.