Reply to Comment on 'Two-finger selection theory in the Saffman-Taylor problem

We clarify the meaning of the results of Phys. Rev. E 60, R5013 (1999). We discuss the use and implications of periodic boundary conditions, as opposed to rigid-wall ones. We briefly argue that the solutions of the paper above are physically relevant as part of a more general issue, namely the possible generalization to dynamics, of the microscopic solvability scenario of selection.

Equivalence Between the Lagrangian and Hamiltonian Formalisms for Constrained Systems

The equivalence between the Lagrangian and Hamiltonian formalism is studied for constraint systems. A procedure to construct the Lagrangian constraints from the Hamiltonian constraints is given. Those Hamiltonian constraints that are first class with respect to the Hamiltonian constraints produce Lagrangian constraints that are FL-projectable.

New experimental apparatus for the study of the Bénard-Rayleigh problem

A new experimental system to measure the equivalent thermal conductivity of a liquid with regard to the Bénard-Rayleigh problem was constructed. The liquid is enclosed within walls of polymethylmethacrylate between two copper plates in which there are thermocouples to measure the difference in temperature between the lower and upper surfaces of the layer of liquid. Heat flux is measured by means of a linear heat fluxmeter consisting of 204 thermocouples in series. The fluxmeter was calibrated and the linear relationship that exists between the heat flux and the emf generated was verified. The thermal conductivity of the polymethylmethacrylate employed was measured and measurements of the equivalent conductivity in cylindrical boundaries of two silicone oils were made. The critical value of the temperature difference and the contribution of the convective process to the transmission of heat were determined.

John Addington Symonds. A Problem in Greek Ethics. Plutarch's Eroticus quoted only in some footnotes? Why?

It is certainly astonishing that an innovating study about the Greek pederasty in England like the one by John Addington Symonds does not quote Plutarch's Eroticus -in fact, it is only cited in some footnotes-, if one bears in mind that this dialogue is an accurate philosophical reflection on Greek eros, in which very often significant ethical themes are approached. The aim of this article is just to reveal the different reasons for such an omission.

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ó.

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.

Non-constant discounting in finite horizon: The free terminal time case

This paper derives the HJB (Hamilton-Jacobi-Bellman) equation for sophisticated agents in a finite horizon dynamic optimization problem with non-constant discounting in a continuous setting, by using a dynamic programming approach. A simple example is used in order to illustrate the applicability of this HJB equation, by suggesting a method for constructing the subgame perfect equilibrium solution to the problem.Conditions for the observational equivalence with an associated problem with constantdiscounting are analyzed. Special attention is paid to the case of free terminal time. Strotz¿s model (an eating cake problem of a nonrenewable resource with non-constant discounting) is revisited.

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.