Spin dynamics in the reentrant spin glass ( Fe0.65 Ni0.35)1-x Mnx

The spin dynamics in the reentrant spin glass ( Fe_0.65 Ni_0.35)_1-x Mn_x has been studied by zero, longitudinal and transverse field μSR. In the ferromagnetic reentrant and pure spin glass regimes (x\leqslant 0.175), zero field experiments reveal a stretched exponential muon relaxation with a universal behaviour of the dynamic exponent \beta above the spin glass transition. There are no qualitative differences between the ferromagnetic and paramagnetic phases. In transversal field μSR experiments the divergence of the relaxation rate close to the spin glass transition is suppressed for manganese doping up to x=0.113 but enhanced for slightly higher doping (x\geqslant 0.12). We understand this behaviour as a crossover from an itinerant to a more localized state of the 3d electron system. This is also supported by the fact that in the highly doped regime with dominant antiferromagnetic interactions the muon relaxation rate diverges above the antiferromagnetic transition temperature. This revised version was published online in July 2006 with corrections to the Cover Date.     

Inexpensive fluorescent particles for large-scale experiments using particle image velocimetry

Custom-produced fluorescent particles are presented and their use as tracers for particle image velocimetry is evaluated. The fabrication procedure is explained and the main properties of the particles are described. The advantages of using fluorescent particles over nonfluorescent ones are discussed, in particular, for applications involving large facilities, as those used in hydraulic research. Images using the produced particles are also shown. This work was done under the Grants N00014-05-1-0083, N00014-01-1-0540 and N00014-06-1-0661 from the U.S. Office of Naval Research.     

The obstacle problem for nonlinear elliptic equations with variable growth and L1-data

The aim of this paper is twofold: to prove, for L ¹-data, the existence and uniqueness of an entropy solution to the obstacle problem for nonlinear elliptic equations with variable growth, and to show some convergence and stability properties of the corresponding coincidence set. The latter follow from extending the Lewy-Stampacchia inequalities to the general framework of L ¹.     

A uniqueness theorem for the singly periodic genus-one helicoid

The singly periodic genus-one helicoid was in the origin of the discovery of the first example of a complete minimal surface with finite topology but infinite total curvature, the celebrated Hoffman-Karcher-Wei's genus one helicoid. The objective of this paper is to give a uniqueness theorem for the singly periodic genus-one helicoid provided the existence of one symmetry.

     

Reproductivity for a nematic liquid crystal model

In this paper we prove existence of weak solution with the reproductivity in time property, for a penalized PDE’s system related to a nematic liquid crystal model. This problem is relatively explict when time-independent Dirichlet boundary conditions are imposed for the orientation of crystal molecules. Nevertheless, for the time-dependent case, the treatment of the problem is completely different. The verification of a maximum principle for weak reproductive solutions is fundamental in the argument.     

Onl p-complemented copies in Orlicz spaces

Let 1<α≦β<∞ andF be an arbitrary closed subset of the interval [α,β]. An Orlicz sequence spacel ^φ (resp. an Orlicz function spaceL ^φ(μ)) with associated indices α and β is found in such a way that the set of valuesp for which thel ^p-space is isomorphic to a complemented subspace ofl ^φ (resp.L ^φ(μ)) is precisely the given setF (resp.F ∪ {2}). Also, a recent result of Hernández and Peirats [1] is extended showing that, even for the case in which the indices satisfy α_φ ^∞<2<β_φ ^∞, there exist minimal Orlicz function spacesL ^φ(μ) with no complemented copy ofl ^p for anyp ≠ 2. Supported in part by CAICYT grant 0338-84.     

A study of the similarities between topics

This paper presents a new methodology whereby the relationships among points of interest appearing in Internet Web pages may be graphically represented. This is done by quantifying the various points and representing them graphically using an intuitive interpretation of the similarity of sets. The similarity or interrelationships existing among various lines of research may be studied based on information taken from the Web pages using function taken from Learning Theory. A visual analysis of those interrelationships has been applied to the field of machine learning during the time interval May 2003–May 2004.     

Welfare and stability in senior matching markets

We consider matching markets at a senior level, where workers are assigned to firms at an unstable matching—the status-quo—which might not be Pareto efficient. It might also be that none of the matchings Pareto superior to the status-quo are Core stable. We propose two weakenings of Core stability: status-quo stability and weakened stability, and the respective mechanisms which lead any status-quo to matchings meeting the stability requirements above mentioned. The first one is inspired by the Top trading cycle and Deferred Acceptance procedures, the other one belongs to the family of Branch and Bound algorithms. The last procedure finds a core stable matching in many-to-one markets whenever it exists, dispensing with the assumption of substitutability.     

Heuristic procedures for a stochastic lot-sizing problem in make-to-order manufacturing

We consider a single item, uncapacitated stochastic lot-sizing problem motivated by a Dutch make-to-order company producing steel pipes. Since no finished goods inventory is kept, a delivery date is fixed upon arrival of each order. The objective is to determine the optimal size of production lots so that delivery dates are met as closely as possible with a limited number of set-ups. Orders that are not satisfied on time are backordered and a penalty cost is incurred in those cases. We formulate the problem as a Markov Decision Process and determine the optimal production policy by dynamic programming. Since this approach can only be applied to very small examples, attention is given to the development of three simple lot-sizing rules. The first strategy consists of producing the orders for a fixed numberT of periods whenever the demand for the current period reaches a pre-specified limitx. A simple set of tests is proposed leading to cost improvements in situations where the best combination for the decision variablesx andT deviates from the optimal policy. The second lot-sizing rule is based on the well-known Silver-Meal heuristic for the case of deterministic time-varying demand. A fixed cycle production strategy is also derived. Numerical examples taking into account different demand patterns are provided. The analysis of the results suggests that the first heuristic is particularly suitable for the problem under consideration. Finally, the model is incorporated in the operations control level of the hierarchical production planning system of the Dutch company and assists the management in the evaluation of the quality of the aggregate decisions. A consequence of this feedback mechanism is the modification of the aggregate plans.On leave from D.E.I.O. (Universidade de Lisboa, Portugal). This research was supported by J.N.I.C.T. (Portugal) under contract BD/2264/92.IA.