Halomethanes in tri-n-octylamine and squalane mixtures at infinite dilution

The retention behavior of eight halomethanes and four saturated hydrocarbons was measured in gas chromatographic stationary phases consisting in tri-n-octylamine (TOA), squalane (SQ) and six TOA+SQ mixtures, at 55.0, 58.5, 62.5 and 65.0°C. Equlibrium constants for complex formation were extracted from experimental data by using a lattice model developed by Martire. The results may be interpreted in terms of the formation of weak hydrogen-bonded complexes, with sociation constants of about 0.13 L-mol^–1 for haloforms and 0.07 L-mol^–1 for dihalomethanes at 60°C.     

On the spectral norm of algebraic numbers

In this paper we continue to study the spectral norms and their completions ([4]) in the case of the algebraic closure $ \overline {\mathbb Q} $ of ? in ?. Let $ \widetilde{\overline{\mathbb{Q}}} $ be the completion of $ \overline {\mathbb Q} $ relative to the spectral norm. We prove that $ \widetilde{\overline{\mathbb{Q}}} $ can be identified with the R‐subalgebra of all symmetric functions of C(G), where C(G) denotes the ?‐Banach algebra of all continuous functions defined on the absolute Galois group G = Gal$ {\overline {\mathbb Q}} / {\mathbb Q} $. We prove that any compact, closed to conjugation subset of ? is the pseudo‐orbit of a suitable element of $ \widetilde{\overline{\mathbb{Q}}} $. We also prove that the topological closure of any algebraic number field in $ \widetilde{\overline{\mathbb{Q}}} $ is of the form $\widetilde{\mathbb{Q}[x]}$ with x in $ \widetilde{\overline{\mathbb{Q}}} $.     

Embedded eigenvalues of Sturm Liouville operators

In this work we study the behavior of embedded eigenvalues of Sturm-Liouville problems in the half axis under local perturbations. When the derivative of the spectral function is strictly positive, we prove that the embedded eigenvalues either disappear or remain fixed. In this case we show that local perturbations cannot add eigenvalues in the continuous spectrum. If the condition on the spectral function is removed then a local perturbation can add infinitely many eigenvalues.     

Nash Equilibria in Noncooperative Predator-Prey Games

A noncooperative game governed by a distributed-parameter predator-prey system is considered, assuming that two players control initial conditions for predator and prey, respectively. Existence of a Nash equilibrium is shown under the condition that the desired population profiles and the environmental carrying capacity for the prey are sufficiently small. A conceptual approximation algorithm is proposed and analyzed. Finally, numerical simulations are performed, too.     

A note on scheduling to meet two min-sum objectives

We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1+(1/γ),1+γ)-approximation algorithm, and show that for γ>1, there is no (x,y)-approximation with 1<x<1+(1/γ) and 1<y<1+(γ-1)/(2+γ).     

Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem

In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.