Logoi demagogou, erga tyrannou : El testimonio del lexema demagogos de Pseudo Andócides

"Para describir la vida política de las democracias antiguas nos vemos forzados a servirnos de términos que utilizamos para las democracias modernas. Pero hay que tener cuidado de no engañarse. Pues las mismas palabras contemplan a menudo las realidades más diversas" (Reverdin, 1945: 201). Esta afirmación nos autoriza a preguntarnos si hay o no una conexión entre los demagogou atenienses y lo que nosotros entendemos por "demagogos". El lexema ingresó a los idiomas modernos por una traducción al francés de una traducción latina de la Política de Aristóteles en el siglo XIV d.C. (Robert, 1954: s.v.), donde ya era patente el carácter peyorativo del lexema. Durante los últimos cincuenta años, los especialistas han analizado las ocurrencias del campo léxico de la demagogia desde una perspectiva histórico- sociológica y en ese sentido coinciden en que estos vocablos en su origen eran "neutros" (Connor, 1992; Lane, 2012). Ostwald, por su parte, opina que la connotación peyorativa del término probablemente se deba a Aristóteles, específicamente a un pasaje de la Política (4.4.1292a4-38) (1986: 201). Sin embargo, contamos con testimonios del lexema de fines del siglo V a.C. y principios del IV a.C. donde es posible entender cierta connotación negativa. Dentro del conjunto de testimonios se encuentra el Contra Alcibíades del Pseudo Andócides. El presente trabajo, complementario de análisis anteriores en el corpus del siglo V a.C., tiene como objetivo analizar el mencionado lexema en su cotexto a la luz de una perspectiva que concibe las palabras como piezas lingüísticas susceptibles de variación semántica incluso en un mismo estadio sincrónico, aplicando conceptos de las teorías de la Nueva Retórica y del Análisis del Discurso

Logoi demagogou, erga tyrannou : El testimonio del lexema demagogos de Pseudo Andócides

"Para describir la vida política de las democracias antiguas nos vemos forzados a servirnos de términos que utilizamos para las democracias modernas. Pero hay que tener cuidado de no engañarse. Pues las mismas palabras contemplan a menudo las realidades más diversas" (Reverdin, 1945: 201). Esta afirmación nos autoriza a preguntarnos si hay o no una conexión entre los demagogou atenienses y lo que nosotros entendemos por "demagogos". El lexema ingresó a los idiomas modernos por una traducción al francés de una traducción latina de la Política de Aristóteles en el siglo XIV d.C. (Robert, 1954: s.v.), donde ya era patente el carácter peyorativo del lexema. Durante los últimos cincuenta años, los especialistas han analizado las ocurrencias del campo léxico de la demagogia desde una perspectiva histórico- sociológica y en ese sentido coinciden en que estos vocablos en su origen eran "neutros" (Connor, 1992; Lane, 2012). Ostwald, por su parte, opina que la connotación peyorativa del término probablemente se deba a Aristóteles, específicamente a un pasaje de la Política (4.4.1292a4-38) (1986: 201). Sin embargo, contamos con testimonios del lexema de fines del siglo V a.C. y principios del IV a.C. donde es posible entender cierta connotación negativa. Dentro del conjunto de testimonios se encuentra el Contra Alcibíades del Pseudo Andócides. El presente trabajo, complementario de análisis anteriores en el corpus del siglo V a.C., tiene como objetivo analizar el mencionado lexema en su cotexto a la luz de una perspectiva que concibe las palabras como piezas lingüísticas susceptibles de variación semántica incluso en un mismo estadio sincrónico, aplicando conceptos de las teorías de la Nueva Retórica y del Análisis del Discurso

Logoi demagogou, erga tyrannou : El testimonio del lexema demagogos de Pseudo Andócides

"Para describir la vida política de las democracias antiguas nos vemos forzados a servirnos de términos que utilizamos para las democracias modernas. Pero hay que tener cuidado de no engañarse. Pues las mismas palabras contemplan a menudo las realidades más diversas" (Reverdin, 1945: 201). Esta afirmación nos autoriza a preguntarnos si hay o no una conexión entre los demagogou atenienses y lo que nosotros entendemos por "demagogos". El lexema ingresó a los idiomas modernos por una traducción al francés de una traducción latina de la Política de Aristóteles en el siglo XIV d.C. (Robert, 1954: s.v.), donde ya era patente el carácter peyorativo del lexema. Durante los últimos cincuenta años, los especialistas han analizado las ocurrencias del campo léxico de la demagogia desde una perspectiva histórico- sociológica y en ese sentido coinciden en que estos vocablos en su origen eran "neutros" (Connor, 1992; Lane, 2012). Ostwald, por su parte, opina que la connotación peyorativa del término probablemente se deba a Aristóteles, específicamente a un pasaje de la Política (4.4.1292a4-38) (1986: 201). Sin embargo, contamos con testimonios del lexema de fines del siglo V a.C. y principios del IV a.C. donde es posible entender cierta connotación negativa. Dentro del conjunto de testimonios se encuentra el Contra Alcibíades del Pseudo Andócides. El presente trabajo, complementario de análisis anteriores en el corpus del siglo V a.C., tiene como objetivo analizar el mencionado lexema en su cotexto a la luz de una perspectiva que concibe las palabras como piezas lingüísticas susceptibles de variación semántica incluso en un mismo estadio sincrónico, aplicando conceptos de las teorías de la Nueva Retórica y del Análisis del Discurso

The role of non-factorizability in determining "pseudo-classical" non-separability

This article introduces a “pseudo classical” notion of modelling non-separability. This form of non-separability can be viewed as lying between separability and quantum-like non-separability. Non-separability is formalized in terms of the non-factorizabilty of the underlying joint probability distribution. A decision criterium for determining the non-factorizability of the joint distribution is related to determining the rank of a matrix as well as another approach based on the chi-square-goodness-of-fit test. This pseudo-classical notion of non-separability is discussed in terms of quantum games and concept combinations in human cognition.

Pseudo-merohedral twinning in the structure of the hydrated 1:1 proton-transfer compound of 5-sulfosalicylic acid with 4-aminopyridine

The structure of the pseudo-merohedrally twinned crystal of the 1:1 proton-transfer compound of 5-sulfosalicylic acid (3-carboxy-4-hydroxybenzenesulfonic acid) with 4-aminopyridine: 4-aminopyridinium 3-carboxy-4-hydroxybenzenesulfonate sesquihydrate has been determined at 180 K and the hydrogen-bonding pattern is described. Crystals of the compound are monoclinic with space group P21/c, with unit cell dimensions a = 35.2589(8), b = 7.1948(1), c = 24.5851(5) Å, β = 110.373(2)o, and Z = 16. The monoclinic asymmetric unit comprises four cation-anion pairs and six water molecules of solvation with only the pyridinium cations having pseudo-symmetry as a result of inter-cation aromatic ring π-π stacking effects. Extensive hydrogen bonding gives a three-dimensional framework structure.

Pseudo-marginal algorithms with multiple CPUs

The emergence of pseudo-marginal algorithms has led to improved computational efficiency for dealing with complex Bayesian models with latent variables. Here an unbiased estimator of the likelihood replaces the true likelihood in order to produce a Bayesian algorithm that remains on the marginal space of the model parameter (with latent variables integrated out), with a target distribution that is still the correct posterior distribution. Very efficient proposal distributions can be developed on the marginal space relative to the joint space of model parameter and latent variables. Thus psuedo-marginal algorithms tend to have substantially better mixing properties. However, for pseudo-marginal approaches to perform well, the likelihood has to be estimated rather precisely. This can be difficult to achieve in complex applications. In this paper we propose to take advantage of multiple central processing units (CPUs), that are readily available on most standard desktop computers. Here the likelihood is estimated independently on the multiple CPUs, with the ultimate estimate of the likelihood being the average of the estimates obtained from the multiple CPUs. The estimate remains unbiased, but the variability is reduced. We compare and contrast two different technologies that allow the implementation of this idea, both of which require a negligible amount of extra programming effort. The superior performance of this idea over the standard approach is demonstrated on simulated data from a stochastic volatility model.

Pseudo plastic zone analysis of steel frame structures comprising non-compact sections

Application of `advanced analysis' methods suitable for non-linear analysis and design of steel frame structures permits direct and accurate determination of ultimate system strengths, without resort to simplified elastic methods of analysis and semi-empirical specification equations. However, the application of advanced analysis methods has previously been restricted to steel frames comprising only compact sections that are not influenced by the effects of local buckling. A concentrated plasticity method suitable for practical advanced analysis of steel frame structures comprising non-compact sections is presented in this paper. The pseudo plastic zone method implicitly accounts for the effects of gradual cross-sectional yielding, longitudinal spread of plasticity, initial geometric imperfections, residual stresses, and local buckling. The accuracy and precision of the method for the analysis of steel frames comprising non-compact sections is established by comparison with a comprehensive range of analytical benchmark frame solutions. The pseudo plastic zone method is shown to be more accurate and precise than the conventional individual member design methods based on elastic analysis and specification equations.

Sampling designs on stream networks using the pseudo-Bayesian approach

Monitoring stream networks through time provides important ecological information. The sampling design problem is to choose locations where measurements are taken so as to maximise information gathered about physicochemical and biological variables on the stream network. This paper uses a pseudo-Bayesian approach, averaging a utility function over a prior distribution, in finding a design which maximizes the average utility. We use models for correlations of observations on the stream network that are based on stream network distances and described by moving average error models. Utility functions used reflect the needs of the experimenter, such as prediction of location values or estimation of parameters. We propose an algorithmic approach to design with the mean utility of a design estimated using Monte Carlo techniques and an exchange algorithm to search for optimal sampling designs. In particular we focus on the problem of finding an optimal design from a set of fixed designs and finding an optimal subset of a given set of sampling locations. As there are many different variables to measure, such as chemical, physical and biological measurements at each location, designs are derived from models based on different types of response variables: continuous, counts and proportions. We apply the methodology to a synthetic example and the Lake Eacham stream network on the Atherton Tablelands in Queensland, Australia. We show that the optimal designs depend very much on the choice of utility function, varying from space filling to clustered designs and mixtures of these, but given the utility function, designs are relatively robust to the type of response variable.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽tpseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

A pseudo-marginal sequential Monte Carlo algorithm for random effects models in Bayesian sequential design

A computationally efficient sequential Monte Carlo algorithm is proposed for the sequential design of experiments for the collection of block data described by mixed effects models. The difficulty in applying a sequential Monte Carlo algorithm in such settings is the need to evaluate the observed data likelihood, which is typically intractable for all but linear Gaussian models. To overcome this difficulty, we propose to unbiasedly estimate the likelihood, and perform inference and make decisions based on an exact-approximate algorithm. Two estimates are proposed: using Quasi Monte Carlo methods and using the Laplace approximation with importance sampling. Both of these approaches can be computationally expensive, so we propose exploiting parallel computational architectures to ensure designs can be derived in a timely manner. We also extend our approach to allow for model uncertainty. This research is motivated by important pharmacological studies related to the treatment of critically ill patients.