Thickness dependence of the magnetic anisotropy of Fe layers separated by Al

Magnetic multilayers of ⁵⁷Fe with nominal thickness, T _nom, between 0.4 and 1.0 nm separated by 3.0 nm Al spacer layers were prepared by alternate deposition of the constituents in high vacuum. The samples were investigated at 4.2 K in external magnetic field. A fraction of Fe atoms corresponding to about 0.3 nm equivalent Fe-thickness was found to mix into the Al spacer. The extremely strong magnetic anisotropy observed for T _nom < 0.8 nm is attributed to Fe layers of approximately two atomic planes thick. The anisotropy decreases considerably after the building up of the third Fe atomic layer starts at T _nom = 0.8 nm, but full saturation was not achieved even for T _nom = 1 nm and 3 T magnetic field applied perpendicularly to the sample plane.     

Calibration of imaging laser-induced fluorescence measurements in highly absorbing flames

It has been described earlier that imaging measurements of laser-induced fluorescence (LIF) in flames can be calibrated to number densities with an integrated absorption measurement provided the integrated absorption is small. In this paper a method is presented that extends the technique to flames with substantial absorption, improves the number density determination and allows the experimental parameters to be chosen more freely. The method is based on an iterative computer procedure that reconstructs the 1-D spatially resolved absorption profile from laser measurements of the 1-D spatially resolved LIF and the integrated absorption of the laser beam. The technique is experimentally demonstrated by measurements of OH number densities in atmospheric flames. It is potentially a single-pulse method. Other applications of the iterative procedure are mentioned.     

On local optima in multiobjective combinatorial optimization problems

In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness of these algorithms are given.     

A note on the acyclicity of the Koszul complex of a module

We prove the vanishing of the Koszul homology group H _μ(Kos(M)_μ), where μ is the minimal number of generators of M. We give a counterexample that the Koszul complex of a module is not always acyclic and show its relationship with the homology of commutative rings.     

Corrigendum to the paper ``Adjoining an Order Unit to a Matrix Ordered Space'

An error has been detected (and also corrected) in Theorem 2.8 of the paper entitled “Adjoining an Order Unit to a Matrix Ordered Space” (Positivity, (2005)9: 207–223; DOI ). Accordingly, some of the results of the paper have been modified. Also, a notion of C*-matricially, Riesz normed spaces has been introduced.     

Decontamination treatment of uranium in tricarbonated solutions

It has been established that the coexistence of chemical species structurally different from cerium, is a direct consequence of the time taken for its preparation. Its practical applications, within the scope of purifying uranium, may constitute the most important technological aspect in the process of ionic exchange, to separate¹⁴¹Ce from uranium.     

A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets

Let F denote a family of pairwise disjoint convex sets in the plane. F is said to be in convex position if none of its members is contained in the convex hull of the union of the others. For any fixed k≥ 3 , we estimate P _k (n) , the maximum size of a family F with the property that any k members of F are in convex position, but no n are. In particular, for k=3 , we improve the triply exponential upper bound of T. Bisztriczky and G. Fejes Tóth by showing that P ₃ (n) < 16 ⁿ . <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p437.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received March 27, 1997, and in revised form July 10, 1997.     

Generating well-behaved utility functions for compromise programming

The purpose of this paper is to seek utility functions satisfying a weak condition which guarantees that the utility optimum always belongs to the compromise set. This set is a special subset of the attainable or feasible set, which is generated through the application of the well-known operational research approach called compromise programming. It is shown that there are large families of utility functions satisfying this condition, thus reinforcing the value of compromise programming as a good surrogate of the traditional utility optimum.Thanks are due to the reviewers for their helpful suggestions. The English editing by Ms. Christine Méndez is appreciated. The authors have been supported by the Comisión Interministerial de Ciencia y Tecnología (CICYT), Madrid, Spain.