The use of S,S-dialkyl dithiocarbonates in Li ion battery electrolytes

S,S-dialkyl dithiocarbonates such as S,S-dimethyl dithiocarbonate and S,S-diethyl dithiocarbonate were tested as solvents for rechargeable lithium ion batteries. Graphite electrodes can be successfully cycled at high reversible capacities in an S,S-dimethyl dithiocarbonate solution containing 1 M LiAsF₆, while lithium ions cannot intercalate into graphite in S,S-diethyl dithiocarbonate solutions. Fourier transform infrared spectroscopy, cyclic voltammetry and chronopotentiometric methods were used in order to monitor the reaction mechanism. Received: 23 April 1997 / Accepted: 5 June 1997     

The first omitting cardinal for Magidority

An infinite cardinal λ is Magidor if and only if . It is known that if λ is Magidor then for some , and the first such α is denoted by . In this paper we try to understand some of the properties of . We prove that can be the successor of a supercompact cardinal, when λ is a Magidor cardinal. From this result we obtain the consistency of being a successor of a singular cardinal with uncountable cofinality.     

Maneuvering Aspects and 3D Effects of Active Airfoil Flow Control

An active flow control experiment was conducted on a cropped NACA 0018 airfoil to study 3D effects and maneuverability aspects made possible by a segmented actuation system installed in the airfoil. The 14 piezo-fluidic actuators were installed at the corner of the cropped region, inclined at 30° to the local surface, facing downstream. Operating all actuators at unison significantly increased lift and generated a pitch-down moment. Operating all actuators at the same magnitude but varying the phase along the span generated larger lift-increment, with respect to the uniform phase excitation. Significant rolling moment can be generated when only half-span of the wing is actuated. The latter effect, as indicated by the 3D pressure distribution, persists to the leading edge even though the excitation was introduced close to the trailing edge. When a pair, out of the possible fourteen actuators is not operating, very little of the control authority is lost. This is an important finding when issues like fault tolerance and robustness of fluidic-piezo actuators are considered.     

Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces

We present a modification of Dykstra's algorithm which allows us to avoid projections onto general convex sets. Instead, we calculate projections onto either a half-space or onto the intersection of two half-spaces. Convergence of the algorithm is established and special choices of the half-spaces are proposed.The option to project onto half-spaces instead of general convex sets makes the algorithm more practical. The fact that the half-spaces are quite general enables us to apply the algorithm in a variety of cases and to generalize a number of known projection algorithms.The problem of projecting a point onto the intersection of closed convex sets receives considerable attention in many areas of mathematics and physics as well as in other fields of science and engineering such as image reconstruction from projections.In this work we propose a new class of algorithms which allow projection onto certain super half-spaces, i.e., half-spaces which contain the convex sets. Each one of the algorithms that we present gives the user freedom to choose the specific super half-space from a family of such half-spaces. Since projecting a point onto a half-space is an easy task to perform, the new algorithms may be more useful in practical situations in which the construction of the super half-spaces themselves is not too difficult.     

Forcing axioms and the Galvin number

Periodica Mathematica Hungarica - We study the Galvin property. We show that various square principles imply that the cofinality of the Galvin number is uncountable (or even greater than $$\aleph...     

Ramanujan Graphs with Small Girth

We construct an innite family of (q + 1)-regular Ramanujan graphs X _n of girth 1. We also give covering maps X _n+1 X _n such that the minimal common covering of all the X _n s is the universal covering tree.     

Pareto optimality in multiobjective problems

In this study, the optimization theory of Dubovitskii and Milyutin is extended to multiobjective optimization problems, producing new necessary conditions for local Pareto optima. Cones of directions of decrease, cones of feasible directions and a cone of tangent directions, as well as, a new cone of directions of nonincrease play an important role here. The dual cones to the cones of direction of decrease and to the cones of directions of nonincrease are characterized for convex functionals without differentiability, with the aid of their subdifferential, making the optimality theorems applicable. The theory is applied to vector mathematical programming, giving a generalized Fritz John theorem, and other applications are mentioned. It turns out that, under suitable convexity and regularity assumptions, the necessary conditions for local Pareto optima are also necessary and sufficient for global Pareto optimum. With the aid of the theory presented here, a result is obtained for the, so-called, scalarization problem of multiobjective optimization.The author's work in this area is now supported by NIH grants HL 18968 and HL 4664 and NCI contract NO1-CB-5386.     

Continuous symmetry measures: Finding the closest C2-symmetric object or closest reflection-symmetric object using unit quaternions

A closed-form solution is provided for the problem of finding the closest reflection-symmetric object, and its relation to the problems of finding the closest achiral object, the closest inversion-symmetric object, and the closest projection plane is discussed. The key to the solution is reducing this problem to the problem of finding the best (least squares) c₂ rotation between two sets of points, in addition to solving the problem of finding the closest C₂-symmetric object. The solution is derived using the quaternion representation of rotation. It is shown that calculation of the best c₂ rotation can be reduced to the diagonalization of the outer product matrix of the pair (between the two sets). ©1999 John Wiley & Sons, Inc. J Comput Chem 20: 772–780, 1999     

Subdivisions,parity and well-covered graphs

A graph is well-covered if every maximal independent set is maximum. This concept, introduced by Plummer in 1970 (J. Combin. Theory 8 (1970)), is the focal point of much interest and current research. We consider well-covered 2-degenerate graphs and supply a structural (and polynomial time algorithm) characterization of the class called 3-separable graphs. Also we consider parity graphs studied by Finbow and Hartnell and answer the question posed by them (Ars. Combin. 40 (1995)) by proving, among other results, that the decision problem: “given a graph G which is a parity graph, is G also well-covered graph?” is in the class CO-NPC. In addition we supply some complexity results that answer some problems due to Plummer (Quaestiones Math. 16 (1993)) and Finbow, Hartnell, and Whitehead (Discrete Math. 125 (1994)). © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 85–94, 1997