Plasticized microporous poly(vinylidene fluoride) separators for lithium-ion batteries. III. Gel properties and irreversible modifications of poly(vinylidene fluoride) membranes under swelling in liquid electrolytes

Microporous poly(vinylidene fluoride) (PVdF) separators for lithium-ion batteries, used in liquid organic electrolytes, have been characterized with respect to the swelling phenomena on dense PVdF membranes (obtained through hot pressing). In the first and second parts of this study, we have described the swelling equilibria and swelling kinetics of dense PVdF. Here the thermal properties of PVdF gels and their irreversible modifications induced by swelling are characterized. Particular attention is paid to crystallinity modifications, polymer plasticization, and membrane degradation. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2308–2317, 2004     

Statistical thermodynamics evaluation of polymer–polymer miscibility

The Simha and Somcynsky (S–S) statistical thermodynamics theory was used to compute the solubility parameters as a function of temperature and pressure [δ = δ(T, P)], for a series of polymer melts. The characteristic scaling parameters required for this task, P*, T*, and V*, were extracted from the pressure–temperature–volume (PVT) data. To determine the potential polymer–polymer miscibility, the dependence of δ versus T (at ambient pressure) was computed for 17 polymers. Close proximity of the δ versus T curves for four miscible polymer pairs: PPE/PS, PS/PVME, and PC/PMMA signaled the usefulness of this approach. It is noteworthy, that the tabulated solubility parameters (derived from the solution data under ambient conditions) propounded the immiscibility of the PVC/PVAc pair. The computed values of δ also suggested miscibility for polymer pairs of unknown miscibility, namely PPE/PVC, PPE/PVAc, and PET/PSF. In recognizing the limitations of the solubility parameter approach (the omission of several thermodynamic contributions), these preliminary results are auspicious because they indicate a new route for estimating the miscibility of any polymeric material at a given temperature and pressure. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2909–2915, 2004     

Adsorption of Kryptate Complexes of Alkali Metals in Electrolytes of Different Compositions and in the Presence of 1-Adamantanol

Data on the adsorption of kryptates of alkali metals on a mercury electrode are obtained for the first time by a method of the measurement of the differential capacitance as a function of potential and are compared to one another. Shown is that there takes place a deep mutual relationship between the structure of a complex and the regularities of its adsorption. An assumption is put forth about the possibility of adsorption of a free ligand in solutions of lithium kryptate, which possesses relatively low strength. The co-adsorption of sodium kryptate with 1-adamantanol, which forms a two-dimensional condensed layer, is investigated. Established is that the C vs. E curves, obtained in 1 M Na₂SO₄ at a constant activity of 1-adamantanol and a varying concentration of Kryptofix^R 222, exhibit two distinctly pronounced portions, each of which corresponds to predominant adsorption of one of the surface-active components. The region of predominant adsorption of Kryptofix^R 222 expands with its concentration.     

On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

Carousels,Zindler curves and the floating body problem

A carousel is a dynamical system that describes the movement of an equilateral linkage in which the midpoint of each rod travels parallel to it. They are closely related to the floating body problem. We prove, using the work of Auerbach, that any figure that floats in equilibrium in every position is drawn by a carousel. Of special interest are such figures with rational perimetral density of the floating chords, which are then drawn by carousels. In particular, we prove that for some perimetral densities the only such figure is the circle, as the problem suggests.     

Affine and projective vector fields on spray manifolds

Periodica Mathematica Hungarica -     

A branch and bound algorithm for the robust shortest path problem with interval data

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented.     

An approach to deciding the observational equivalence of Algol-like languages

We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function f_M. Given any such f_M, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable.