The politics of gendered emotions : disrupting men's emotional investment in privilege

This paper explores the implications of the neglect of emotions in critical masculinity studies and profeminist masculinity politics. This neglect in part results from feminist and profeminist critiques of the literature on emotional inexpressiveness as a tragedy for men that ignores male privilege and men's social power. To focus on men's emotions is seen by some profeminist commentators as psychologising men at the expense of sociological understandings of men's social power. However, in neglecting the place of emotions in men's lives, critical masculinity studies has overlooked the ways in which men's emotional attachment to privilege can perpetuate oppressive gender relations and male violence against women. By exploring men's emotional investment in unequal gender relations, the article outlines ways in which emotions can also be used as a catalyst to disrupt men's attachment to male privilege.

Color image reduction by minimizing penalty functions

In image processing, particularly in image reduction, averaging aggregation functions play an important role. In this work we study the aggregation of color values (RGB) and we present an image reduction algorithm for RGB color images. For this purpose, we define and study aggregation functions and penalty functions in product lattices. We show how the arithmetic mean and the median can be obtained by minimizing specific penalty functions. Moreover, we study other penalty functions and we show that, in general, aggregation functions on product lattices do not coincide with the cartesian product of the corresponding aggregation functions. Finally, we make an experimental study where we test our reduction algorithm and we analyze the stability of the penalty functions in images affected by noise.

On the use of restricted dissimilarity and dissimilarity-like functions for defining penalty functions

In this work we study the relation between restricted dissimilarity functions-and, more generally, dissimilarity-like functions- and penalty functions and the possibility of building the latter using the former. Several results on convexity and quasiconvexity are also considered.

A penalty-based aggregation operator for non-convex intervals

In the case of real-valued inputs, averaging aggregation functions have been studied extensively with results arising in fields including probability and statistics, fuzzy decision-making, and various sciences. Although much of the behavior of aggregation functions when combining standard fuzzy membership values is well established, extensions to interval-valued fuzzy sets, hesitant fuzzy sets, and other new domains pose a number of difficulties. The aggregation of non-convex or discontinuous intervals is usually approached in line with the extension principle, i.e. by aggregating all real-valued input vectors lying within the interval boundaries and taking the union as the final output. Although this is consistent with the aggregation of convex interval inputs, in the non-convex case such operators are not idempotent and may result in outputs which do not faithfully summarize or represent the set of inputs. After giving an overview of the treatment of non-convex intervals and their associated interpretations, we propose a novel extension of the arithmetic mean based on penalty functions that provides a representative output and satisfies idempotency.

On the determination of the number of factors using information criteria with data-driven penalty

As is well known, when using an information criterion to select the number of common factors in factor models the appropriate penalty is generally indetermine in the sense that it can be scaled by an arbitrary constant, c say, without affecting consistency. In an influential paper, Hallin and Liška (J Am Stat Assoc102:603–617, 2007) proposes a data-driven procedure for selecting the appropriate value of c. However, by removing one source of indeterminacy, the new procedure simultaneously creates several new ones, which make for rather complicated implementation, a problem that has been largely overlooked in the literature. By providing an extensive analysis using both simulated and real data, the current paper fills this gap.

Three-dimensional finite element analysis of MHD duct flow by the penalty function formulation

A numerical scheme based on the Finite Element Method (FEM) is presented to calculate the full solution of a three-dimensional steady magnetohydrodynamic (MHD) flow with moderately high Hartmann numbers and interaction parameters. An incompressible, viscous and electrically conducting liquid-metal is considered. Assuming a low magnetic Reynolds number, the solution method solves the coupled Navier-Stokes and Maxwell's equations through the use of a penalty function method. Results are presented for Hartmann numbers in the range 10(2)-10(3).

Penalty-based nonlinear solver for optimal reactive power dispatch with discrete controls

The optimal reactive dispatch problem is a nonlinear programming problem containing continuous and discrete control variables. Owing to the difficulty caused by discrete variables, this problem is usually solved assuming all variables as continuous variables, therefore the original discrete variables are rounded off to the closest discrete value. This approach may provide solutions far from optimal or even unfeasible solutions. This paper presents an efficient handling of discrete variables by penalty function so that the problem becomes continuous and differentiable. Simulations with the IEEE test systems were performed showing the efficiency of the proposed approach. © 1969-2012 IEEE.

The Effects of High Pressure on the Point of No Return in Simulated Penalty Kicks

We investigated the effects of high pressure on the point of no return or the minimum time required for a kicker to respond to the goalkeeper's dive in a simulated penalty kick task. The goalkeeper moved to one side with different times available for the participants to direct the ball to the opposite side in low-pressure (acoustically isolated laboratory) and high-pressure situations (with a participative audience). One group of participants showed a significant lengthening of the point of no return under high pressure. With less time available, performance was at chance level. Unexpectedly, in a second group of participants, high pressure caused a qualitative change in which for short times available participants were inclined to aim in the direction of the goalkeeper's move. The distinct effects of high pressure are discussed within attentional control theory to reflect a decreasing efficiency of the goal-driven attentional system, slowing down performance, and a decreasing effectiveness in inhibiting stimulus-driven behavior.

Arbitrage-Free Conditions and Hedging Strategies for Markets with Penalty Costs on Short Positions

We consider a discrete-time financial model in a general sample space with penalty costs on short positions. We consider a friction market closely related to the standard one except that withdrawals from the portfolio value proportional to short positions are made. We provide necessary and sufficient conditions for the nonexistence of arbitrages in this situation and for a self-financing strategy to replicate a contingent claim. For the finite-sample space case, this result leads to an explicit and constructive procedure for obtaining perfect hedging strategies.

Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization

At each outer iteration of standard Augmented Lagrangian methods one tries to solve a box-constrained optimization problem with some prescribed tolerance. In the continuous world, using exact arithmetic, this subproblem is always solvable. Therefore, the possibility of finishing the subproblem resolution without satisfying the theoretical stopping conditions is not contemplated in usual convergence theories. However, in practice, one might not be able to solve the subproblem up to the required precision. This may be due to different reasons. One of them is that the presence of an excessively large penalty parameter could impair the performance of the box-constraint optimization solver. In this paper a practical strategy for decreasing the penalty parameter in situations like the one mentioned above is proposed. More generally, the different decisions that may be taken when, in practice, one is not able to solve the Augmented Lagrangian subproblem will be discussed. As a result, an improved Augmented Lagrangian method is presented, which takes into account numerical difficulties in a satisfactory way, preserving suitable convergence theory. Numerical experiments are presented involving all the CUTEr collection test problems.