Synthesis, thermal treatment and characterization of cobalt ferrite-based nanocomposites

We have used time-differential perturbed angular correlation (PAC) spectroscopy with ¹⁸¹Ta-probes to study the electric field gradient at Zr-sites in synthetic zircon and hafnon between room temperature and 1,200°C. PAC spectra are similar to those obtained from naturally occurring zircons. In particular, a change in slope of the quadrupole coupling vs. temperature is observed in the synthetic zircon at the same temperature as seen in natural zircons from the Mud Tank carbonatite (Australia). The synthetic hafnon data also shows this feature but at somewhat higher temperature. Low-temperature PAC spectra of both synthetic zircon and hafnon have a clearly reduced anisotropy. We believe that the cause for this is a electronic defect, possibly created during the β-decay of the probe parent nucleus.     

Maximum diameter of regular digraphs

We prove that every r-biregular digraph with n vertices has its directed diamter bounded by (3n - r - 3)/(r +1). We show that this bound is tight for directed as well as for undirected graphs. The upper bound remains valid for Eulerian digraphs with minimum outdegree r. © 1929 John Wiley & Sons, Inc.     

Mathematical modeling of crystallization analysis fractionation (Crystaf) of polyethylene

Four polyethylene samples (PE) with different molecular weight distributions (MWD) were analyzed by crystallization analysis fractionation (Crystaf) at several cooling rates to investigate the effect of MWD and cooling rate on their Crystaf profiles. Using these results, we developed a mathematical model for Crystaf that considers crystallization kinetic effects, which are ignored in all previous Crystaf models. The Crystaf model we proposed can fit the experimental Crystaf profiles of the 4 polyethylene resins very well. © 2006 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 2749–2759, 2006     

A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires

In this paper, we introduce a new proximal algorithm for equilibrium problems on a genuine Hadamard manifold, using a new regularization term. We first extend recent existence results by considering pseudomonotone bifunctions and a weaker sufficient condition than the coercivity assumption. Then, we consider the convergence of this proximal-like algorithm which can be applied to genuinely Hadamard manifolds and not only to specific ones, as in the recent literature. A striking point is that our new regularization term have a clear interpretation in a recent “variational rationality” approach of human behavior. It represents the resistance to change aspects of such human dynamics driven by motivation to change aspects. This allows us to give an application to the theories of desires, showing how an agent must escape to a succession of temporary traps to be able to reach, at the end, his desires.

     

A dominance-based rough set approach applied to evaluate the credit risk of sovereign bonds

4OR - Even though sovereign bonds represent low-risk alternatives that give investors a healthy income, the risk assessment process for these bonds is still considered subjective because of the...     

On sparse spanners of weighted graphs

Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.The work of G. Das and D. Joseph was supported by NSF PYI Grant DCR-8402375. The work of D. Dobkin was supported by NSF Grant CCR-8700917. The work of J. Soares was supported by CNPq proc 203039/87.4 (Brazil) and NSF Grant CCR-9014562. This research was accomplished while G. Das was a student at the University of Wisconsin-Madison. A preliminary version was presented at the Second Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 1990, under the title Generating Sparse Spanners for Weighted Graphs, and proceedings appear in the series Lecture Notes in Computer Science, Springer-Verlag. The preliminary version also appears as Princeton University Technical Report CS-TR-261-90, and as University of Wisconsin-Madison Computer Sciences Technical Report 882.