John Addington Symonds. A Problem in Greek Ethics. ¿El Erótico de Plutarco reducido a algunas notas a pie de página? ¿Por qué?

Resulta sorprendente que un estudio pionero en Inglaterra sobre la pederastia griega como el de John Addington Symonds no cite el Erótico de Plutarco, excepción hecha de en algunas notas a pie de página, siendo como es este dialogo una seria reflexión filosófica sobre el eros griego, en que a menudo se abordan cuestiones éticas. El objetivo de este artículo es revelar justamente las razones de índole diversa para una tal omisión.

John Addington Symonds. A Problem in Greek Ethics. ¿L'Eròtic de Plutarc reduït a algunes notes a peu de pàgina? Per què?

Resulta sorprenent que un estudi pioner a Anglaterra sobre la pederàstia grega como el de John Addington Symonds no citi l'Eròtic de Plutarc, llevat de en algunes notes a peu de pàgina, essent com és aquest diàleg una seriosa reflexió filosòfica sobre l'eros grec, en què sovint s'aborden qüestions ètiques. L'objectiu d'aquest article és revelar justament les raons d'índole diversa per a una tal omissió.

The database search problem: a question of rational decision making

This paper applies probability and decision theory in the graphical interface of an influence diagram to study the formal requirements of rationality which justify the individualization of a person found through a database search. The decision-theoretic part of the analysis studies the parameters that a rational decision maker would use to individualize the selected person. The modeling part (in the form of an influence diagram) clarifies the relationships between this decision and the ingredients that make up the database search problem, i.e., the results of the database search and the different pairs of propositions describing whether an individual is at the source of the crime stain. These analyses evaluate the desirability associated with the decision of 'individualizing' (and 'not individualizing'). They point out that this decision is a function of (i) the probability that the individual in question is, in fact, at the source of the crime stain (i.e., the state of nature), and (ii) the decision maker's preferences among the possible consequences of the decision (i.e., the decision maker's loss function). We discuss the relevance and argumentative implications of these insights with respect to recent comments in specialized literature, which suggest points of view that are opposed to the results of our study.

Exact solution to the mean exit time problem for free inertial processes driven by Gaussian white noise

We obtain the exact analytical expression, up to a quadrature, for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise from a region (0,L) in space. We obtain a completely explicit expression for T(x,0) and discuss the dependence of T(x,v) as a function of the size L of the region. We develop a new method that may be used to solve other exit time problems.

Exact solution to the exit-time problem for an undamped free particle driven by Gaussian white noise

In a recent paper [Phys. Rev. Lett. 75, 189 (1995)] we have presented the exact analytical expression for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise out of a region (0,L) in space. In this paper we give a detailed account of the method employed and present results on asymptotic properties and averages of T(x,v).

The problem of physical coordinates in predictive Hamiltonian systems

In the Hamiltonian formulation of predictive relativistic systems, the canonical coordinates cannot be the physical positions. The relation between them is given by the individuality differential equations. However, due to the arbitrariness in the choice of Cauchy data, there is a wide family of solutions for these equations. In general, those solutions do not satisfy the condition of constancy of velocities moduli, and therefore we have to reparametrize the world lines into the proper time. We derive here a condition on the Cauchy data for the individuality equations which ensures the constancy of the velocities moduli and makes the reparametrization unnecessary.

Subclass problem-dependent design for error-correcting output codes

A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word for each class, where each position of the code identifies the membership of the class for a given binary problem. A classification decision is obtained by assigning the label of the class with the closest code. One of the main requirements of the ECOC design is that the base classifier is capable of splitting each subgroup of classes from each binary problem. However, we cannot guarantee that a linear classifier model convex regions. Furthermore, nonlinear classifiers also fail to manage some type of surfaces. In this paper, we present a novel strategy to model multiclass classification problems using subclass information in the ECOC framework. Complex problems are solved by splitting the original set of classes into subclasses and embedding the binary problems in a problem-dependent ECOC design. Experimental results show that the proposed splitting procedure yields a better performance when the class overlap or the distribution of the training objects conceal the decision boundaries for the base classifier. The results are even more significant when one has a sufficiently large training size.

Pionic branches in neutron matter and the problem of pion condensation

The pion spectrum for charged and neutral pions is investigated in pure neutron matter, by letting the pions interact with a neutron Fermi sea in a self-consistent scheme that renormalizes simultaneously the mesons, considered the source of the interaction, and the nucleons. The possibility of obtaining different kinds of pion condensates is investigated with the result that they cannot be reached even for values of the spin-spin correlation parameter, g', far below the range commonly accepted.

Dispersal routes reconstruction and the minimum cost arborescence problem.

We show that the dispersal routes reconstruction problem can be stated as an instance of a graph theoretical problem known as the minimum cost arborescence problem, for which there exist efficient algorithms. Furthermore, we derive some theoretical results, in a simplified setting, on the possible optimal values that can be obtained for this problem. With this, we place the dispersal routes reconstruction problem on solid theoretical grounds, establishing it as a tractable problem that also lends itself to formal mathematical and computational analysis. Finally, we present an insightful example of how this framework can be applied to real data. We propose that our computational method can be used to define the most parsimonious dispersal (or invasion) scenarios, which can then be tested using complementary methods such as genetic analysis.

Recent misconceptions about the "database search problem": a probabilistic analysis using Bayesian networks

This paper analyses and discusses arguments that emerge from a recent discussion about the proper assessment of the evidential value of correspondences observed between the characteristics of a crime stain and those of a sample from a suspect when (i) this latter individual is found as a result of a database search and (ii) remaining database members are excluded as potential sources (because of different analytical characteristics). Using a graphical probability approach (i.e., Bayesian networks), the paper here intends to clarify that there is no need to (i) introduce a correction factor equal to the size of the searched database (i.e., to reduce a likelihood ratio), nor to (ii) adopt a propositional level not directly related to the suspect matching the crime stain (i.e., a proposition of the kind 'some person in (outside) the database is the source of the crime stain' rather than 'the suspect (some other person) is the source of the crime stain'). The present research thus confirms existing literature on the topic that has repeatedly demonstrated that the latter two requirements (i) and (ii) should not be a cause of concern.

New microfluidic-based sampling procedure for overcoming the hematocrit problem associated with dried blood spot analysis.

Hematocrit (Hct) is one of the most critical issues associated with the bioanalytical methods used for dried blood spot (DBS) sample analysis. Because Hct determines the viscosity of blood, it may affect the spreading of blood onto the filter paper. Hence, accurate quantitative data can only be obtained if the size of the paper filter extracted contains a fixed blood volume. We describe for the first time a microfluidic-based sampling procedure to enable accurate blood volume collection on commercially available DBS cards. The system allows the collection of a controlled volume of blood (e.g., 5 or 10 μL) within several seconds. Reproducibility of the sampling volume was examined in vivo on capillary blood by quantifying caffeine and paraxanthine on 5 different extracted DBS spots at two different time points and in vitro with a test compound, Mavoglurant, on 10 different spots at two Hct levels. Entire spots were extracted. In addition, the accuracy and precision (n = 3) data for the Mavoglurant quantitation in blood with Hct levels between 26% and 62% were evaluated. The interspot precision data were below 9.0%, which was equivalent to that of a manually spotted volume with a pipet. No Hct effect was observed in the quantitative results obtained for Hct levels from 26% to 62%. These data indicate that our microfluidic-based sampling procedure is accurate and precise and that the analysis of Mavoglurant is not affected by the Hct values. This provides a simple procedure for DBS sampling with a fixed volume of capillary blood, which could eliminate the recurrent Hct issue linked to DBS sample analysis.

Reducing the Problem of Transverse Cracking, HR-232, 1985

The Iowa Department of Transportation (DOT) is continually improving the pavement management program and striving to reduce maintenance needs. Through a 1979 pavement management study, the Iowa DOT became a participant in a five state Federal Highway Administration (FHWA) study of "Transverse Cracking of Asphalt Pavements". There were numerous conclusions and recommendations but no agreement as to the major factors contributing to transverse cracking or methods of preventing or reducing the occurrence of transverse cracking. The project did focus attention on the problem and generated ideas for research. This project is one of two state funded research projects that were a direct result of the FHWA project. Iowa DOT personnel had been monitoring temperature susceptibility of asphalt cements by the Norman McLeod Modified Penetration Index. Even though there are many variables from one asphalt mix to another, the trend seemed to indicate that the frequency of transverse cracking was highly dependent on the temperature susceptibility. Research project HR-217 "Reducing the Adverse Effects of Transverse Cracking" was initiated to verify the concept. A final report has been published after a four-year evaluation. The crack frequency with the high temperature susceptible asphalt cement was substantially greater than for the low temperature susceptible asphalt cement. An increased asphalt cement content in the asphalt treated base also reduced the crack frequency. This research on prevention of transverse cracking with fabric supports the following conclusions: 1. Engineering fabric does not prevent transverse cracking of asphalt cement concrete. 2. Engineering fabric may retard the occurrence of transverse cracking. 3. Engineering fabric does not contribute significantly to the structural capability of an asphalt concrete pavement.