DSpace Collection:
http://hdl.handle.net/2117/3918
Sun, 21 Dec 2014 03:26:11 GMT2014-12-21T03:26:11Zwebmaster.bupc@upc.eduUniversitat Politècnica de Catalunya. Servei de Biblioteques i DocumentaciónoNonlinear equations for fractional Laplacians, I: Regularity, maximum principles, and Hamiltonian estimates
http://hdl.handle.net/2117/22391
Title: Nonlinear equations for fractional Laplacians, I: Regularity, maximum principles, and Hamiltonian estimates
Authors: Cabré Vilagut, Xavier; Sire, Yannick
Abstract: This is the first of two articles dealing with the equation (-)sv = f (v) in Rn, with s ¿ (0,1), where (-)s stands for the fractional Laplacian — the in¿nitesimal generator of a Lévy process. This equation can be realized as a local linear degenerate elliptic equation in Rn+1+ together with a nonlinear Neumann boundary condition on ¿Rn+1 + =Rn.
In this ¿rst article, we establish necessary conditions on the nonlinearity f to admit certain type of solutions, with special interest in bounded increasing solutions in all of R. These necessary conditions (which will be proven in a follow-up paper to be also suficient for the existence of a bounded increasing solution) are derived from an equality and an estimate involving a Hamiltonian — in the spirit of a result of Modica for the Laplacian. Our proofs are uniform ass ¿1, establishing in the limit the corresponding known results for the Laplacian.
In addition, we study regularity issues, as well as maximum and Harnack principles associated to the equation.http://hdl.handle.net/2117/22391Cabré Vilagut, Xavier; Sire, YannicknoThis is the first of two articles dealing with the equation (-)sv = f (v) in Rn, with s ¿ (0,1), where (-)s stands for the fractional Laplacian — the in¿nitesimal generator of a Lévy process. This equation can be realized as a local linear degenerate elliptic equation in Rn+1+ together with a nonlinear Neumann boundary condition on ¿Rn+1 + =Rn.
In this ¿rst article, we establish necessary conditions on the nonlinearity f to admit certain type of solutions, with special interest in bounded increasing solutions in all of R. These necessary conditions (which will be proven in a follow-up paper to be also suficient for the existence of a bounded increasing solution) are derived from an equality and an estimate involving a Hamiltonian — in the spirit of a result of Modica for the Laplacian. Our proofs are uniform ass ¿1, establishing in the limit the corresponding known results for the Laplacian.
In addition, we study regularity issues, as well as maximum and Harnack principles associated to the equation.J2 effect and elliptic inclined periodic orbits in the collision three-body problem
http://hdl.handle.net/2117/21117
Title: J2 effect and elliptic inclined periodic orbits in the collision three-body problem
Authors: Barrabes, Esther; Cors Iglesias, Josep Maria; Pinyol, Conxita; Soler Villanueva, Jaume
Abstract: The existence of a new class of inclined periodic orbits of the collision restricted
three{body problem is shown. The symmetric periodic solutions found are perturbations of elliptic
kepler orbits and they exist only for special values of the inclination and are related to the motion
of a satellite around an oblate planet.http://hdl.handle.net/2117/21117Barrabes, Esther; Cors Iglesias, Josep Maria; Pinyol, Conxita; Soler Villanueva, Jaumenocollision restricted three-body problem, periodic orbits, symmetric orbits, critical inclination, continuation methodThe existence of a new class of inclined periodic orbits of the collision restricted
three{body problem is shown. The symmetric periodic solutions found are perturbations of elliptic
kepler orbits and they exist only for special values of the inclination and are related to the motion
of a satellite around an oblate planet.On the complexity of problems on simple games
http://hdl.handle.net/2117/25093
Title: On the complexity of problems on simple games
Authors: Freixas Bosch, Josep; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José
Abstract: Simple games cover voting systems in which a single alter-
native, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of “yea” votes yield passage of the issue at hand. Each of these collections of “yea” voters forms a winning coalition. We are interested in performing a complexity analysis on problems defined on such families of games. This analysis as usual depends on the game representation used as input. We consider four natural explicit representations: winning, losing, minimal winning, and maximal losing. We first analyze the complexity of testing whether a game is simple and testing whether a game is weighted. We show that, for the four types of representations, both problems can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. We analyze strongness, properness, weightedness, homogeneousness, decisiveness and majorityness, which are desirable properties to be fulfilled for a simple game.
Finally, we consider the possibility of representing a game in a more
succinct and natural way and show that the corresponding recognition
problem is hard.Thu, 18 Dec 2014 19:12:37 GMThttp://hdl.handle.net/2117/250932014-12-18T19:12:37ZFreixas Bosch, Josep; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María JosénoSimple, Weighted, Majority games, NP-completenessSimple games cover voting systems in which a single alter-
native, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of “yea” votes yield passage of the issue at hand. Each of these collections of “yea” voters forms a winning coalition. We are interested in performing a complexity analysis on problems defined on such families of games. This analysis as usual depends on the game representation used as input. We consider four natural explicit representations: winning, losing, minimal winning, and maximal losing. We first analyze the complexity of testing whether a game is simple and testing whether a game is weighted. We show that, for the four types of representations, both problems can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. We analyze strongness, properness, weightedness, homogeneousness, decisiveness and majorityness, which are desirable properties to be fulfilled for a simple game.
Finally, we consider the possibility of representing a game in a more
succinct and natural way and show that the corresponding recognition
problem is hard.Optimal passive-damping design using a decentralized velocity-feedback H-infinity approach
http://hdl.handle.net/2117/25091
Title: Optimal passive-damping design using a decentralized velocity-feedback H-infinity approach
Authors: Palacios Quiñonero, Francisco; Rubió Massegú, Josep; Rossell Garriga, Josep Maria; Karimi, Hamid Reza
Abstract: In this work, a new strategy to design passive energy dissipation systems for vibration control of large structures is presented. The method is based on the equivalence between passive damping systems and fully decentralized static velocity-feedback controllers. This equivalence allows to take advantage of recent developments in static output-feedback control design to formulate the passive-damping design as a single optimization problem with Linear Matrix Inequality constraints. To illustrate the application of the proposed methodology, a passive damping system is designed for the seismic protection of a five-story building with excellent results.Thu, 18 Dec 2014 18:34:20 GMThttp://hdl.handle.net/2117/250912014-12-18T18:34:20ZPalacios Quiñonero, Francisco; Rubió Massegú, Josep; Rossell Garriga, Josep Maria; Karimi, Hamid RezanoDecentralized control, Optimal passive damping, Static output-feedback, Structural vibration controlIn this work, a new strategy to design passive energy dissipation systems for vibration control of large structures is presented. The method is based on the equivalence between passive damping systems and fully decentralized static velocity-feedback controllers. This equivalence allows to take advantage of recent developments in static output-feedback control design to formulate the passive-damping design as a single optimization problem with Linear Matrix Inequality constraints. To illustrate the application of the proposed methodology, a passive damping system is designed for the seismic protection of a five-story building with excellent results.Recent advances in static output-feedback controller design with applications to vibration control of large structures
http://hdl.handle.net/2117/25090
Title: Recent advances in static output-feedback controller design with applications to vibration control of large structures
Authors: Palacios Quiñonero, Francisco; Rubió Massegú, Josep; Rossell Garriga, Josep Maria; Karimi, Hamid Reza
Abstract: In this paper, we present a novel two-step strategy for static output-feedback controller design. In the first step, an optimal state-feedback controller is obtained by means of a linear matrix inequality (LMI) formulation. In the second step, a transformation of the LMI variables is used to derive a suitable LMI formulation for the static output-feedback controller. This design strategy can be applied to a wide range of practical problems, including vibration control of large structures, control of offshore wind turbines, control of automotive suspensions, vehicle driving assistance and disturbance rejection. Moreover, it allows designing decentralized and semi-decentralized static output-feedback controllers by setting a suitable zero-nonzero structure on the LMI variables. To illustrate the application of the proposed methodology, two centralized static velocity-feedback H-Infinity controllers and two fully decentralized static velocity-feedback H-Infinity controllers are designed for the seismic protection of a five-story building.http://hdl.handle.net/2117/25090Palacios Quiñonero, Francisco; Rubió Massegú, Josep; Rossell Garriga, Josep Maria; Karimi, Hamid RezanoStatic output-feedback, Decentralized control, Structural vibration controlIn this paper, we present a novel two-step strategy for static output-feedback controller design. In the first step, an optimal state-feedback controller is obtained by means of a linear matrix inequality (LMI) formulation. In the second step, a transformation of the LMI variables is used to derive a suitable LMI formulation for the static output-feedback controller. This design strategy can be applied to a wide range of practical problems, including vibration control of large structures, control of offshore wind turbines, control of automotive suspensions, vehicle driving assistance and disturbance rejection. Moreover, it allows designing decentralized and semi-decentralized static output-feedback controllers by setting a suitable zero-nonzero structure on the LMI variables. To illustrate the application of the proposed methodology, two centralized static velocity-feedback H-Infinity controllers and two fully decentralized static velocity-feedback H-Infinity controllers are designed for the seismic protection of a five-story building.Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
http://hdl.handle.net/2117/25089
Title: Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
Authors: Freixas Bosch, Josep; Kurz, Sascha
Abstract: This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class as well. Second, we focus on the special case of bipartite complete games with minimum, and we compare and rank these games according to the behavior of some efficient power indices of players of type 1 (or of type 2). The main result of this second part establishes all allowable rankings of these games when the Shapley-Shubik power index is used on players of type 1.Thu, 18 Dec 2014 17:52:05 GMThttp://hdl.handle.net/2117/250892014-12-18T17:52:05ZFreixas Bosch, Josep; Kurz, SaschanoSimple game, Weighted and complete games, Enumerations, Shapley-Shubik power index, Banzhaf power indices, Ordinal equivalence, Europena Union, Dimension, Semivalues, Council, Indexes, SystemThis paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class as well. Second, we focus on the special case of bipartite complete games with minimum, and we compare and rank these games according to the behavior of some efficient power indices of players of type 1 (or of type 2). The main result of this second part establishes all allowable rankings of these games when the Shapley-Shubik power index is used on players of type 1.Sufficient conditions for controllability and observability of serial and parallel concatenated linear systems
http://hdl.handle.net/2117/25002
Title: Sufficient conditions for controllability and observability of serial and parallel concatenated linear systems
Authors: García Planas, María Isabel; Domínguez García, José Luis; Um, Laurence Emilie
Abstract: This paper deals with the sufficient conditions
for controllability and observability characters of finitedimensional
linear continuous-time-invariant systems of serial
and parallel concatenated systems. The obtained conditions
depend on the controllability and observability of the systems
and in some cases, the functional output-controllability of the
first one.Thu, 11 Dec 2014 12:39:29 GMThttp://hdl.handle.net/2117/250022014-12-11T12:39:29ZGarcía Planas, María Isabel; Domínguez García, José Luis; Um, Laurence EmilienoLinear systems, serial composite
systems, parallel composite systems, controllability, observability, functional-output controllabilityThis paper deals with the sufficient conditions
for controllability and observability characters of finitedimensional
linear continuous-time-invariant systems of serial
and parallel concatenated systems. The obtained conditions
depend on the controllability and observability of the systems
and in some cases, the functional output-controllability of the
first one.Addendum to “Frobenius and Cartier algebras of Stanley–Reisner rings” [J. Algebra 358 (2012) 162–177]
http://hdl.handle.net/2117/24996
Title: Addendum to “Frobenius and Cartier algebras of Stanley–Reisner rings” [J. Algebra 358 (2012) 162–177]
Authors: Álvarez Montaner, Josep; Yanagawa, Kohji
Abstract: We give a purely combinatorial characterization of complete Stanley–Reisner rings having a principally generated (equivalently, finitely generated) Cartier algebra.Thu, 11 Dec 2014 09:15:25 GMThttp://hdl.handle.net/2117/249962014-12-11T09:15:25ZÁlvarez Montaner, Josep; Yanagawa, KohjinoStanley–Reisner rings, Cartier algebrasWe give a purely combinatorial characterization of complete Stanley–Reisner rings having a principally generated (equivalently, finitely generated) Cartier algebra.A new approach to the vakonomic mechanics
http://hdl.handle.net/2117/24993
Title: A new approach to the vakonomic mechanics
Authors: Llibre Saló, Jaume; Ramírez Ros, Rafael; Sadovskaia Nurimanova, Natalia Guennadievna
Abstract: The aim of this paper was to show that the Lagrange-d'Alembert and its equivalent the Gauss and Appel principle are not the only way to deduce the equations of motion of the nonholonomic systems. Instead of them we consider the generalization of the Hamiltonian principle for nonholonomic systems with non-zero transpositional relations. We apply this variational principle, which takes into the account transpositional relations different from the classical ones, and we deduce the equations of motion for the nonholonomic systems with constraints that in general are nonlinear in the velocity. These equations of motion coincide, except perhaps in a zero Lebesgue measure set, with the classical differential equations deduced with the d'Alembert-Lagrange principle. We provide a new point of view on the transpositional relations for the constrained mechanical systems: the virtual variations can produce zero or non-zero transpositional relations. In particular, the independent virtual variations can produce non-zero transpositional relations. For the unconstrained mechanical systems, the virtual variations always produce zero transpositional relations. We conjecture that the existence of the nonlinear constraints in the velocity must be sought outside of the Newtonian mechanics. We illustrate our results with examples.Thu, 11 Dec 2014 08:01:15 GMThttp://hdl.handle.net/2117/249932014-12-11T08:01:15ZLlibre Saló, Jaume; Ramírez Ros, Rafael; Sadovskaia Nurimanova, Natalia GuennadievnanoVariational principle, Generalized Hamiltonian principle, d'Alembert-Lagrange principle, Constrained Lagrangian system, Transpositional relations, Vakonomic mechanic, Equation of motion, Vorones system, Chapligyn system, Newtonian model, NONHOLONOMIC SYSTEMS, CONSTRAINED SYSTEMS, DYNAMICS, REALIZATION, PRINCIPLE, GEOMETRYThe aim of this paper was to show that the Lagrange-d'Alembert and its equivalent the Gauss and Appel principle are not the only way to deduce the equations of motion of the nonholonomic systems. Instead of them we consider the generalization of the Hamiltonian principle for nonholonomic systems with non-zero transpositional relations. We apply this variational principle, which takes into the account transpositional relations different from the classical ones, and we deduce the equations of motion for the nonholonomic systems with constraints that in general are nonlinear in the velocity. These equations of motion coincide, except perhaps in a zero Lebesgue measure set, with the classical differential equations deduced with the d'Alembert-Lagrange principle. We provide a new point of view on the transpositional relations for the constrained mechanical systems: the virtual variations can produce zero or non-zero transpositional relations. In particular, the independent virtual variations can produce non-zero transpositional relations. For the unconstrained mechanical systems, the virtual variations always produce zero transpositional relations. We conjecture that the existence of the nonlinear constraints in the velocity must be sought outside of the Newtonian mechanics. We illustrate our results with examples.Zero, minimum and maximum relative radial acceleration for planar formation flight dynamics near triangular libration points in the Earth-Moon system
http://hdl.handle.net/2117/24992
Title: Zero, minimum and maximum relative radial acceleration for planar formation flight dynamics near triangular libration points in the Earth-Moon system
Authors: Salazar, F.J.T; Masdemont Soler, Josep; Gómez Muntané, Gerard; Macau, E.E.N.; Winter, O. C.
Abstract: Assume a constellation of satellites is flying near a given nominal trajectory around L-4 or L-5 in the Earth-Moon system in such a way that there is some freedom in the selection of the geometry of the constellation. We are interested in avoiding large variations of the mutual distances between spacecraft. In this case, the existence of regions of zero and minimum relative radial acceleration with respect to the nominal trajectory will prevent from the expansion or contraction of the constellation. In the other case, the existence of regions of maximum relative radial acceleration with respect to the nominal trajectory will produce a larger expansion and contraction of the constellation. The goal of this paper is to study these regions in the scenario of the Circular Restricted Three Body Problem by means of a linearization of the equations of motion relative to the periodic orbits around L-4 or L-5. This study corresponds to a preliminar planar formation flight dynamics about triangular libration points in the Earth-Moon system. Additionally, the cost estimate to maintain the constellation in the regions of zero and minimum relative radial acceleration or keeping a rigid configuration is computed with the use of the residual acceleration concept. At the end, the results are compared with the dynamical behavior of the deviation of the constellation from a periodic orbit. (C) 2014 COSPAR. Published by Elsevier Ltd. All rights reserved.Thu, 11 Dec 2014 07:49:26 GMThttp://hdl.handle.net/2117/249922014-12-11T07:49:26ZSalazar, F.J.T; Masdemont Soler, Josep; Gómez Muntané, Gerard; Macau, E.E.N.; Winter, O. C.noFormation flight of satellites, Zero Relative Radial Acceleration, Earth-Moon system, Circular Restricted Three Body Problem, Stable Lagrangian points, Residual acceleration, PERIODIC-ORBITS, ELLIPTIC ORBITS, QUADRATIC DRAG, MOTION, STABILITY, MISSIONAssume a constellation of satellites is flying near a given nominal trajectory around L-4 or L-5 in the Earth-Moon system in such a way that there is some freedom in the selection of the geometry of the constellation. We are interested in avoiding large variations of the mutual distances between spacecraft. In this case, the existence of regions of zero and minimum relative radial acceleration with respect to the nominal trajectory will prevent from the expansion or contraction of the constellation. In the other case, the existence of regions of maximum relative radial acceleration with respect to the nominal trajectory will produce a larger expansion and contraction of the constellation. The goal of this paper is to study these regions in the scenario of the Circular Restricted Three Body Problem by means of a linearization of the equations of motion relative to the periodic orbits around L-4 or L-5. This study corresponds to a preliminar planar formation flight dynamics about triangular libration points in the Earth-Moon system. Additionally, the cost estimate to maintain the constellation in the regions of zero and minimum relative radial acceleration or keeping a rigid configuration is computed with the use of the residual acceleration concept. At the end, the results are compared with the dynamical behavior of the deviation of the constellation from a periodic orbit. (C) 2014 COSPAR. Published by Elsevier Ltd. All rights reserved.Combined low-thrust propulsion and invariant manifold trajectories to capture NEOs in the Sun-Earth circular restricted three-body problem
http://hdl.handle.net/2117/24981
Title: Combined low-thrust propulsion and invariant manifold trajectories to capture NEOs in the Sun-Earth circular restricted three-body problem
Authors: Mingotti, Giorgio; Sánchez Cuartielles, Joan Pau; McInnes, Colin
Abstract: In this paper, a method to capture near-Earth objects (NEOs) incorporating low-thrust propulsion into the invariant manifolds technique is investigated. Assuming that a tugboat-spacecraft is in a rendez-vous condition with the candidate asteroid, the aim is to take the joint spacecraft-asteroid system to a selected periodic orbit of the Sun-Earth restricted three-body system: the orbit can be either a libration point periodic orbit (LPO) or a distant prograde periodic orbit (DPO) around the Earth. In detail, low-thrust propulsion is used to bring the joint spacecraft-asteroid system from the initial condition to a point belonging to the stable manifold associated to the final periodic orbit: from here onward, thanks to the intrinsic dynamics of the physical model adopted, the flight is purely ballistic. Dedicated guided and capture sets are introduced to exploit the combined use of low-thrust propulsion with stable manifolds trajectories, aiming at defining feasible first guess solutions. Then, an optimal control problem is formulated to refine and improve them. This approach enables a new class of missions, whose solutions are not obtainable neither through the patched-conics method nor through the classic invariant manifolds technique.Wed, 10 Dec 2014 12:43:20 GMThttp://hdl.handle.net/2117/249812014-12-10T12:43:20ZMingotti, Giorgio; Sánchez Cuartielles, Joan Pau; McInnes, ColinnoNear-Earth object capture, Invariant manifolds, Low-thrust propulsion, Special dedicated sets, Optimal control problem, Libration point periodic orbit (LPO), Distant prograde periodic orbit (DPO), Easily retrievable objects (EROs), Asteroid retrieval candidates, PERIODIC-ORBITS, EQUILIBRIUM POINTS, MOON TRAJECTORIES, TRANSIT ORBITS, MISSION DESIGN, TRANSFERS, ASTEROIDS, OPTIMIZATION, DYNAMICS, OBJECTSIn this paper, a method to capture near-Earth objects (NEOs) incorporating low-thrust propulsion into the invariant manifolds technique is investigated. Assuming that a tugboat-spacecraft is in a rendez-vous condition with the candidate asteroid, the aim is to take the joint spacecraft-asteroid system to a selected periodic orbit of the Sun-Earth restricted three-body system: the orbit can be either a libration point periodic orbit (LPO) or a distant prograde periodic orbit (DPO) around the Earth. In detail, low-thrust propulsion is used to bring the joint spacecraft-asteroid system from the initial condition to a point belonging to the stable manifold associated to the final periodic orbit: from here onward, thanks to the intrinsic dynamics of the physical model adopted, the flight is purely ballistic. Dedicated guided and capture sets are introduced to exploit the combined use of low-thrust propulsion with stable manifolds trajectories, aiming at defining feasible first guess solutions. Then, an optimal control problem is formulated to refine and improve them. This approach enables a new class of missions, whose solutions are not obtainable neither through the patched-conics method nor through the classic invariant manifolds technique.Automatic subsystem identification in statistical energy analysis
http://hdl.handle.net/2117/24965
Title: Automatic subsystem identification in statistical energy analysis
Authors: Díaz Cereceda, Cristina; Poblet-Puig, Jordi; Rodríguez Ferran, Antonio
Abstract: An automatic methodology for identifying SEA (statistical energy analysis) subsystems within a vibroacoustic system is presented. It consists in dividing the system into cells and grouping them into subsystems via a hierarchical cluster analysis based on the problem eigenmodes. The subsystem distribution corresponds to the optimal grouping of the cells, which is defined in terms of the correlation distance between them. The main advantages of this methodology are its automatic performance and its applicability both to vibratory and vibroacoustic systems. Moreover, the method allows the definition of more than one subsystem in the same geometrical region when required. This is the case of eigenmodes with a very different mechanical response (e.g. out-of-plane or in-plane vibration in shells).Tue, 09 Dec 2014 18:47:12 GMThttp://hdl.handle.net/2117/249652014-12-09T18:47:12ZDíaz Cereceda, Cristina; Poblet-Puig, Jordi; Rodríguez Ferran, AntonionoStatistical energy analysis, Vibroacoustics, Modal analysis, Cluster analysis, SubstructuringAn automatic methodology for identifying SEA (statistical energy analysis) subsystems within a vibroacoustic system is presented. It consists in dividing the system into cells and grouping them into subsystems via a hierarchical cluster analysis based on the problem eigenmodes. The subsystem distribution corresponds to the optimal grouping of the cells, which is defined in terms of the correlation distance between them. The main advantages of this methodology are its automatic performance and its applicability both to vibratory and vibroacoustic systems. Moreover, the method allows the definition of more than one subsystem in the same geometrical region when required. This is the case of eigenmodes with a very different mechanical response (e.g. out-of-plane or in-plane vibration in shells).Understanding and strain-engineering wrinkle networks in supported graphene through simulations
http://hdl.handle.net/2117/24943
Title: Understanding and strain-engineering wrinkle networks in supported graphene through simulations
Authors: Zhang, Kuan; Arroyo Balaguer, Marino
Abstract: Wrinkle networks are ubiquitous buckle-induced delaminations in supported graphene, which locally modify the electronic structure and degrade device performance. Although the strong property-deformation coupling of graphene can be potentially harnessed by strain engineering, it has not been possible to precisely control the geometry of wrinkle networks. Through numerical simulations based on an atomistically informed continuum theory, we understand how strain anisotropy, adhesion and friction govern spontaneous wrinkling. We then propose a strategy to control the location of wrinkles through patterns of weaker adhesion. This strategy is deceptively simple, and can in fact fail in several ways, particularly under biaxial compression. However, within bounds set by the physics of wrinkling, it is possible to robustly create by strain a variety of wrinkle network geometries and junction configurations. Graphene is nearly unstrained in the planar regions bounded by wrinkles, highly curved along wrinkles, and highly stretched and curved at junctions, which can either locally attenuate or amplify the applied strain depending on their configuration. These mechanically self-assembled networks are stable under the pressure produced by an enclosed fluid and form continuous channels, opening the door to nano-fluidic applications.Fri, 05 Dec 2014 13:38:53 GMThttp://hdl.handle.net/2117/249432014-12-05T13:38:53ZZhang, Kuan; Arroyo Balaguer, MarinonoGraphene, Wrinkles, Blisters, Strain engineering, Buckling, ELASTIC MEMBRANES, CARBON NANOTUBES, FILMS, ADHESION, STRESS, SHEETS, SCATTERING, SUBSTRATE, TRANSPORT, DEFECTSWrinkle networks are ubiquitous buckle-induced delaminations in supported graphene, which locally modify the electronic structure and degrade device performance. Although the strong property-deformation coupling of graphene can be potentially harnessed by strain engineering, it has not been possible to precisely control the geometry of wrinkle networks. Through numerical simulations based on an atomistically informed continuum theory, we understand how strain anisotropy, adhesion and friction govern spontaneous wrinkling. We then propose a strategy to control the location of wrinkles through patterns of weaker adhesion. This strategy is deceptively simple, and can in fact fail in several ways, particularly under biaxial compression. However, within bounds set by the physics of wrinkling, it is possible to robustly create by strain a variety of wrinkle network geometries and junction configurations. Graphene is nearly unstrained in the planar regions bounded by wrinkles, highly curved along wrinkles, and highly stretched and curved at junctions, which can either locally attenuate or amplify the applied strain depending on their configuration. These mechanically self-assembled networks are stable under the pressure produced by an enclosed fluid and form continuous channels, opening the door to nano-fluidic applications.On minimum integer representations of weighted games
http://hdl.handle.net/2117/24931
Title: On minimum integer representations of weighted games
Authors: Freixas Bosch, Josep; Kurz, Sascha
Abstract: We study minimum integer representations of weighted games, i.e. representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if they exist at all, are linked with some solution concepts in game theory. Closing existing gaps in the literature, we prove that each weighted game with two types of voters admits a (unique) minimum integer representation, and give new examples for more than two types of voters without a minimum integer representation. We characterize the possible weights in minimum integer representations and give examples for t >= 4 types of voters without a minimum integer representation preserving types, i.e. where we additionally require that the weights are equal within equivalence classes of voters. (C) 2013 Elsevier B.V. All rights reserved.Thu, 04 Dec 2014 18:58:18 GMThttp://hdl.handle.net/2117/249312014-12-04T18:58:18ZFreixas Bosch, Josep; Kurz, SaschanoWeighted games, Minimum integer representations, Representations with minimum sumWe study minimum integer representations of weighted games, i.e. representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if they exist at all, are linked with some solution concepts in game theory. Closing existing gaps in the literature, we prove that each weighted game with two types of voters admits a (unique) minimum integer representation, and give new examples for more than two types of voters without a minimum integer representation. We characterize the possible weights in minimum integer representations and give examples for t >= 4 types of voters without a minimum integer representation preserving types, i.e. where we additionally require that the weights are equal within equivalence classes of voters. (C) 2013 Elsevier B.V. All rights reserved.Achievable hierarchies in voting games with abstention
http://hdl.handle.net/2117/24930
Title: Achievable hierarchies in voting games with abstention
Authors: Freixas Bosch, Josep; Tchantcho, Bertrand; Tedjeugang, Narcisse
Abstract: It is well known that he influence relation orders the voters the same way as the classical Banzhaf and Shapley-Shubik indices do when they are extended to the voting games with abstention (VGA) in the class of complete games. Moreover, all hierarchies for the influence relation are achievable in the class of complete VGA. The aim of this paper is twofold. Firstly, we show that all hierarchies are achievable in a subclass of weighted VGA, the class of weighted games for which a single weight is assigned to voters. Secondly, we conduct a partial study of achievable hierarchies within the subclass of H-complete games, that is, complete games under stronger versions of influence relation. (C) 2013 Elsevier B.V. All rights reserved.Thu, 04 Dec 2014 18:40:45 GMThttp://hdl.handle.net/2117/249302014-12-04T18:40:45ZFreixas Bosch, Josep; Tchantcho, Bertrand; Tedjeugang, NarcissenoGame theory, (3, 2) Voting rules, Abstention, Decision support systems, Weightedness and completeness, Hierarchies, Ordinal equivalence, Power, Aapproval, Systems, Banzhaf, Output, InputIt is well known that he influence relation orders the voters the same way as the classical Banzhaf and Shapley-Shubik indices do when they are extended to the voting games with abstention (VGA) in the class of complete games. Moreover, all hierarchies for the influence relation are achievable in the class of complete VGA. The aim of this paper is twofold. Firstly, we show that all hierarchies are achievable in a subclass of weighted VGA, the class of weighted games for which a single weight is assigned to voters. Secondly, we conduct a partial study of achievable hierarchies within the subclass of H-complete games, that is, complete games under stronger versions of influence relation. (C) 2013 Elsevier B.V. All rights reserved.