Search results for "optimization"

Méthodes géométriques et analytiques pour étudier l'application exponentielle, la sphère et le front d'onde en géométrie sous-riemannienne dans le ca…

1999

Consider a sub-riemannian geometry (U,D,g) where U is a neighborhood of 0 in R 3 , D is a Martinet type distribution identified to ker ω , ω being the 1-form: , q=(x,y,z) and g is a metric on D which can be taken in the normal form : , a=1+yF(q) , c=1+G(q) , . In a previous article we analyze the flat case : a=c=1 ; we describe the conjugate and cut loci , the sphere and the wave front . The objectif of this article is to provide a geometric and computational framework to analyze the general case. This frame is obtained by analysing three one parameter deformations of the flat case which clarify the role of the three parameters in the gradated normal form of order 0 where: , . More generall…

OPKINE, a multipurpose program for kinetics

1991

The program OPKINE is presented for the study of reaction mechanisms and multicomponent analysis in dynamic conditions. This program is written in FORTRAN-77 for IBM 30/90 and VAX 8300 computers, and permits the simultaneous evaluation of both rate constants and initial reagent concentrations or, alternatively, rate constants and sensitivities. Up to 20 kinetic curves, with up to 400 points each, can be treated to evaluate up to 40 parameters. Integration of the system of differential equations is performed by means of the Runge–Kutta–Fehlberg method. OPKINE is provided with the Simplex, and modified versions of the Davidon–Fletcher–Powell and Gauss–Newton–Marquardt optimization methods. A …

Network structure and optimal technological innovation

2019

The role of networks in the emergence, diffusion and evolution of technological innovations has attracted much theoretical and empirical attention. Yet, much of the work has explored the role of undirected and homogeneous networks. In real cases, many networks are directed. The flow of information, benefits or observations is directed from one node towards another node. Real networks are also heterogeneous, for example, few nodes have a high degree while many others have a low degree. In this article, we report on the results of an evolutionary agent-based model in which a group of agents, in our case firms, collectively search a complex (rugged) technological landscape and observe each oth…

Numerical methods in the design process of a sailing yacht

2014

Learning Automata-based Misinformation Mitigation via Hawkes Processes

2021

AbstractMitigating misinformation on social media is an unresolved challenge, particularly because of the complexity of information dissemination. To this end, Multivariate Hawkes Processes (MHP) have become a fundamental tool because they model social network dynamics, which facilitates execution and evaluation of mitigation policies. In this paper, we propose a novel light-weight intervention-based misinformation mitigation framework using decentralized Learning Automata (LA) to control the MHP. Each automaton is associated with a single user and learns to what degree that user should be involved in the mitigation strategy by interacting with a corresponding MHP, and performing a joint ra…

Synthetic Genes for artificial ants. Diversity in ant colony optimization algorithms

2010

Inspired from the fact that the real world ants from within a colony are not clones (although they may look alike, they are different from one another), in this paper, the authors are presenting an adapted ant colony optimisation (ACO) algorithm that incorporates methods and ideas from genetic algorithms (GA). Following the first (introductory) section of the paper is presented the history and the state of the art, beginning with the stigmergy and genetic concepts and ending with the latest ACO algorithm variants as multiagent systems (MAS). The rationale and the approach sections are aiming at presenting the problems with current stigmergy-based algorithms and at proposing a (possible - ye…

On optimal deployment of low power nodes for high frequency next generation wireless systems

2018

Recent development of wireless communication systems and standards is characterized by constant increase of allocated spectrum resources. Since lower frequency ranges cannot provide sufficient amount of bandwidth, new bands are allocated at higher frequencies, for which operators resort to deploy more base stations to ensure the same coverage and to utilize more efficiently higher frequencies spectrum. Striving for deployment flexibility, mobile operators can consider deploying low power nodes that could be either small cells connected via the wired backhaul or relays that utilize the same spectrum and the wireless access technology. However, even though low power nodes provide a greater fl…

Game-Theoretic Learning and Allocations in Robust Dynamic Coalitional Games

2019

The problem of allocation in coalitional games with noisy observations and dynamic environments is considered. The evolution of the excess is modeled by a stochastic differential inclusion involvin...

A saturated strategy robustly ensures stability of the cooperative equilibrium for Prisoner's dilemma

2016

We study diffusion of cooperation in a two-population game in continuous time. At each instant, the game involves two random individuals, one from each population. The game has the structure of a Prisoner's dilemma where each player can choose either to cooperate (c) or to defect (d), and is reframed within the field of approachability in two-player repeated game with vector payoffs. We turn the game into a dynamical system, which is positive, and propose a saturated strategy that ensures local asymptotic stability of the equilibrium (c, c) for any possible choice of the payoff matrix. We show that there exists a rectangle, in the space of payoffs, which is positively invariant for the syst…

Online Pricing via Stackelberg and Incentive Games in a Micro-Grid

2019

This paper deals with the analysis and design of online pricing mechanisms in micro-grids. Two cases are studied in which the market layer is modeled as an open-loop and closed-loop dynamical system respectively. In the case of open-loop market dynamics, the price is generated as equilibrium price of a Stackelberg game with an incentive strategy. In such Stackelberg game, the leader is the energy supplier, the follower is the consumer, and the leader plays an incentive strategy. In the case of closed-loop market dynamics, the price is obtained as a function of the power supplied and the demand. A stability analysis is provided for both cases, which sheds light on the transient and steady-st…