Recursos de colección
Archive EduTice a CCSD electronic archive server based on P.A.O.L (751.230 recursos)
Fulltext articles on information technology and communication strategies.
OpenAIRE set
Fulltext articles on information technology and communication strategies.
OpenAIRE set
Burlot, Franck; Labeau, Matthieu; Knyazeva, Elena; Lavergne, Thomas; Allauzen, Alexandre; Yvon, François
International audience
Schnupf, Pamela; Gaboriau-Routhiau, Valerie,; Sansonetti, Philippe; Cerf-Bensussan, Nadine
International audience
Erhel, Jocelyne; Imberti, David
International audience
Michot, Véronique; Vila, Daniel; Arvor, Damien; Funatsu, Beatriz M.; Dubreuil, Vincent; ronchail, josyane
International audience
Wang, Feihu; Nong, Hanond; Fobbe, Tobias; Pistore, Valentino; Houver, Sarah; Markmann, Sergej; Jukam, Nathan; Amanti, Maria; Sirtori, Carlo; Moumdji, Souad; Colombelli, Raffaele; Li, Lianhe; Linfield, Edmund; Davies, Giles; Mangeney, Juliette; Tignon, Jérôme; Dhillon, Sukhdeep
International audience
Bressloff, Paul,; Faugeras, Olivier,
International audience
Dreyfus, Thomas; Raschel, Kilian
27 pages, 7 figures
Caron, Stéphane; Mallein, Bastien
Developments for 3D control of the center of mass (CoM) are currently located in two local minima: on the one hand, methods that allow CoM height variations but only work in the 2D sagittal plane; on the other hand, nonconvex centroidal models that are delicate to handle. This paper presents an alternative that controls the CoM in 3D by predictive control over a convex optimization problem. The key to this development is the notion of boundedness condition, which quantifies convexly the viability of CoM trajectories.
Aydin, Cem,; Ozkaynak, Begum; Rodríguez-Labajos, Beatriz; Yenilmez, Taylan
International audience
Josz, Cédric; Molzahn, Daniel
We propose general notions to deal with large scale polynomial optimization problems and demonstrate their efficiency on a key industrial problem of the twenty first century, namely the optimal power flow problem. These notions enable us to find global minimizers on instances with up to 4,500 variables and 14,500 constraints. First, we generalize the Lasserre hierarchy from real to complex to numbers in order to enhance its tractability when dealing with complex polynomial optimization. Complex numbers are typically used to represent oscillatory phenomena, which are omnipresent in physical systems. Using the notion of hyponormality in operator theory, we provide a...
Bureau, Jean-Christophe; Jean, Sébastien
Trade is a key element in food security but international cooperation is necessary for trade to help coping with supply shocks, to spread variations in crop yield and to dampen price volatility. While multilateral trade agreements have provided the foundations for a rule-based system, multilateralism has stalled. New economic and political conditions, in particular the new weight of emerging countries, have complicated the negotiations of a Doha agreement under the WTO. Agriculture plays a special role in the global negotiating game. Developed countries have given up many of their bargaining chips in the previous rounds of negotiation and concessions in...
Josz, Cédric
We consider the problem of solving a linear system of equations which involves complex variables and their conjugates. We characterize when it reduces to a complex linear system, that is, a system involving only complex variables (and not their conjugates). In that case, we show how to construct the complex linear system. Interestingly, this provides a new insight on the relationship between real and complex linear systems. In particular, any real symmetric linear system of equations can be solved via a complex linear system of equations. Numerical illustrations are provided. The mathematics in this manuscript constitute an exciting interplay between...
Josz, Cédric
On one hand, consider the problem of finding global solutions to a polynomial optimization problem and, on the other hand, consider the problem of interpolating a set of points with a complex exponential function. This paper proposes a single algorithm to address both problems. It draws on the notion of hyponormality in operator theory. Concerning optimization, it seems to be the first algorithm that is capable of extracting global solutions from a polynomial optimization problem where the variables and data are complex numbers. It also applies to real polynomial optimization, a special case of complex polynomial optimization, and thus extends...
Voyant, Cyril; Notton, Gilles; Kalogirou, Soteris,; Nivet, Marie-Laure; Paoli, Christophe; Motte, Fabrice; Alexis, Fouilloy
International audience
Voyant, Cyril; Notton, Gilles; Kalogirou, Soteris,; Nivet, Marie-Laure; Paoli, Christophe; Motte, Fabrice; Alexis, Fouilloy
International audience
Voyant, Cyril; Notton, Gilles; Paoli, Christophe; Alexis, Fouilloy; Motte, Fabrice
International audience
Voyant, Cyril; Notton, Gilles; Paoli, Christophe; Alexis, Fouilloy; Motte, Fabrice
International audience
Rebillout, Elio; Notton, Gilles; Voyant, Cyril; Damian, Andrei; Frunzulica, Rodica; Lazarov, Vladimir; Stoyanov, Ludmil
International audience
Rebillout, Elio; Notton, Gilles; Voyant, Cyril; Damian, Andrei; Frunzulica, Rodica; Lazarov, Vladimir; Stoyanov, Ludmil
International audience
Voyant, Cyril; Motte, Fabrice; Alexis, Fouilloy; Paoli, Christophe; Nivet, Marie Laure
International audience