Intersubjectivity and a practical intersubjective ethics of translation

This essay suggests that the intersubjectivity in translation should be given priority because different stages of the translation activity have different subjects, and presents a practical intersubjective ethics of translation based on an interpretation of the intersubjective relations connected with translation activities in a perspective of game theory in the hope that it can equip us with better explanations of the translator’s calculations or considerations in the professional practice.

Diane Arbus: the wonderful wizard of odds or the poetics of the i (eye)

Diane Arbus‘ photographs are mainly about difference. Most of the time she is trying ‗[…] to suppress, or at least reduce, moral and sensory queasiness‘ (Sontag 1977: 40) in order to represent a world where the subject of the photograph is not merely the ‗other‘ but also the I. Her technique does not coax her subjects into natural poses. Instead she encourages them to be strange and awkward. By posing for her, the revelation of the self is identified with what is odd. This paper aims at understanding the geography of difference that, at the same time, is also of resistance, since Diane Arbus reveals what was forcefully hidden by bringing it into light in such a way that it is impossible to ignore. Her photographs display a poetic beauty that is not only of the ‗I‘ but also of the ‗eye‘. The world that is depicted is one in which we are all the same. She ―atomizes‖ reality by separating each element and ‗Instead of showing identity between things which are different […] everybody is shown to look the same.‘ (Sontag 1977: 47). Furthermore, this paper analyses some of Arbus‘ photographs so as to explain this point of view, by trying to argue that between rejecting and reacting against what is standardized she does not forget the geography of the body which is also a geography of the self. While creating a new imagetic topos, where what is trivial becomes divine, she also presents the frailty of others as our own.

Application-specific modified particle swarm optimization for energy resource scheduling considering vehicle-to-grid

This paper presents a modified Particle Swarm Optimization (PSO) methodology to solve the problem of energy resources management with high penetration of distributed generation and Electric Vehicles (EVs) with gridable capability (V2G). The objective of the day-ahead scheduling problem in this work is to minimize operation costs, namely energy costs, regarding he management of these resources in the smart grid context. The modifications applied to the PSO aimed to improve its adequacy to solve the mentioned problem. The proposed Application Specific Modified Particle Swarm Optimization (ASMPSO) includes an intelligent mechanism to adjust velocity limits during the search process, as well as self-parameterization of PSO parameters making it more user-independent. It presents better robustness and convergence characteristics compared with the tested PSO variants as well as better constraint handling. This enables its use for addressing real world large-scale problems in much shorter times than the deterministic methods, providing system operators with adequate decision support and achieving efficient resource scheduling, even when a significant number of alternative scenarios should be considered. The paper includes two realistic case studies with different penetration of gridable vehicles (1000 and 2000). The proposed methodology is about 2600 times faster than Mixed-Integer Non-Linear Programming (MINLP) reference technique, reducing the time required from 25 h to 36 s for the scenario with 2000 vehicles, with about one percent of difference in the objective function cost value.

Application-Specific Modified Particle Swarm Optimization for energy resource scheduling considering vehicle-to-grid

This paper presents a modified Particle Swarm Optimization (PSO) methodology to solve the problem of energy resources management with high penetration of distributed generation and Electric Vehicles (EVs) with gridable capability (V2G). The objective of the day-ahead scheduling problem in this work is to minimize operation costs, namely energy costs, regarding the management of these resources in the smart grid context. The modifications applied to the PSO aimed to improve its adequacy to solve the mentioned problem. The proposed Application Specific Modified Particle Swarm Optimization (ASMPSO) includes an intelligent mechanism to adjust velocity limits during the search process, as well as self-parameterization of PSO parameters making it more user-independent. It presents better robustness and convergence characteristics compared with the tested PSO variants as well as better constraint handling. This enables its use for addressing real world large-scale problems in much shorter times than the deterministic methods, providing system operators with adequate decision support and achieving efficient resource scheduling, even when a significant number of alternative scenarios should be considered. The paper includes two realistic case studies with different penetration of gridable vehicles (1000 and 2000). The proposed methodology is about 2600 times faster than Mixed-Integer Non-Linear Programming (MINLP) reference technique, reducing the time required from 25 h to 36 s for the scenario with 2000 vehicles, with about one percent of difference in the objective function cost value.

Arc exchange systems and renormalization

We exhibit the construction of stable arc exchange systems from the stable laminations of hyperbolic diffeomorphisms. We prove a one-to-one correspondence between (i) Lipshitz conjugacy classes of C(1+H) stable arc exchange systems that are C(1+H) fixed points of renormalization and (ii) Lipshitz conjugacy classes of C(1+H) diffeomorphisms f with hyperbolic basic sets Lambda that admit an invariant measure absolutely continuous with respect to the Hausdorff measure on Lambda. Let HD(s)(Lambda) and HD(u)(Lambda) be, respectively, the Hausdorff dimension of the stable and unstable leaves intersected with the hyperbolic basic set L. If HD(u)(Lambda) = 1, then the Lipschitz conjugacy is, in fact, a C(1+H) conjugacy in (i) and (ii). We prove that if the stable arc exchange system is a C(1+HDs+alpha) fixed point of renormalization with bounded geometry, then the stable arc exchange system is smooth conjugate to an affine stable arc exchange system.

Two new power indices based on winning coalitions

Deegan and Packel (1979) and Holler (1982) proposed two power indices for simple games: the Deegan–Packel index and the Public Good Index. In the definition of these indices, only minimal winning coalitions are taken into account. Using similar arguments, we define two new power indices. These new indices are defined taking into account only those winning coalitions that do not contain null players. The results obtained with the different power indices are compared by means of two real-world examples taken from the political field.