Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup

Mathematical Programming - We seek tight bounds on the viable parallelism in asynchronous implementations of coordinate descent that achieves linear speedup. We focus on asynchronous coordinate...     

Solid Lipid Nanoparticles (SLNs): Preparation and Properties of Calix[4]resorcinarene Derived Systems.

Solid Lipid Nanoparticles (SLNs) have been prepared fromc-2,c-8,c-14,c-20-tetraundecyl-4,6,10,12,16,18,22,24-octahydroxyresorc[4]areneas colloidal suspensions. Photon Correlation Spectroscopy studies revealed aparticle hydrodynamic diameter of 150 nm. Non-contact mode Atomic ForceMicroscopy allows observation of the particles as slightly flattened sphericalobjects of 236 (±40) nm diameter and 145 (±40) nm height. Thestudy of the preparation parameters showed that shear force does not affectthe hydrodynamic size of the SLNs. In contrast, the viscosity and the pH ofthe aqueous phase, the amphiphile concentration in the organic phase and thevolume of organic phase used, all lead to variation in the size of the particles.In term of post preparation parameters only the ionic strength has been shownto affect significantly the particle size; while the pH of the storing solution,microwave, ultrasonic and thermal treatments do not. Short and long-termstability studies have been performed to measure the effect of the ionic strengthon the stability of the particles. The use of carbohydrate cryoprotectants does notallow re-dispersion of the colloidal suspension after freeze-drying.     

制作高密度衍射光栅的光电式刻划控制的研究

高精度的光电式刻划控制系统是制作高密度母光栅的关键技术,以光栅干涉仪为控制核心,设计了光电式的光栅刻划控制系统,并对可能产生的加工误差进行了初步的分析;采用该控制系统的光栅刻划实践表明,所设计的光电式刻划控制系统已完全达到了高密度衍射光栅的亚微米栅距分度要求。     

A Continuation Method of Parameter Inversion for Non-Equilibrium Convection-Dispersion Equation

Based on the homotopy mapping, a globally convergent method of parameter inversion for non-equilibrium convection-dispersion equations （CDEs） is developed. Moreover, in order to further improve the computational efficiency of the algorithm, a properly smooth function, which is derived from the sigmoid function, is employed to update the homotopy parameter during iteration. Numerical results show the feature of global convergence and high performance of this method. In addition, even the measurement quantities are heavily contaminated by noises, and a good solution can be found.     

Enumeration of three-dimensional convex polygons

A self-avoiding polygon (SAP) on a graph is an elementary cycle. Counting SAPs on the hypercubic lattice ℤ ^d withd≥2, is a well-known unsolved problem, which is studied both for its combinatorial and probabilistic interest and its connections with statistical mechanics. Of course, polygons on ℤ ^d are defined up to a translation, and the relevant statistic is their perimeter. A SAP on ℤ ^d is said to beconvex if its perimeter is “minimal”, that is, is exactly twice the sum of the side lengths of the smallest hyper-rectangle containing it. In 1984, Delest and Viennot enumerated convex SAPs on the square lattice [6], but no result was available in a higher dimension. We present an elementar approach to enumerate convex SAPs in any dimension. We first obtain a new proof of Delest and Viennot's result, which explains combinatorially the form of the generating function. We then compute the generating function for convex SAPs on the cubic lattice. In a dimension larger than 3, the details of the calculations become very cumbersome. However, our method suggests that the generating function for convex SAPs on ℤ ^d is always a quotient ofdifferentiably finite power series.     

Latin Squares without Orthogonal Mates

In 1779 Euler proved that for every even n there exists a latin square of order n that has no orthogonal mate, and in 1944 Mann proved that for every n of the form 4k + 1, k ≥ 1, there exists a latin square of order n that has no orthogonal mate. Except for the two smallest cases, n = 3 and n = 7, it is not known whether a latin square of order n = 4k + 3 with no orthogonal mate exists or not. We complete the determination of all n for which there exists a mate-less latin square of order n by proving that, with the exception of n = 3, for all n = 4k + 3 there exists a latin square of order n with no orthogonal mate. We will also show how the methods used in this paper can be applied more generally by deriving several earlier non-orthogonality results.     

A Tin(IV) Porphyrin with Two Axial Organometallic NCN‐Pincer Platinum Units

A tin(IV) porphyrin was combined with two axial NCN‐pincer platinum(II) fragments by utilizing the oxophilicity of the apical positions on the tin atom and the acidic nature of the NCN‐pincer platinum derived benzoic acid. The solid‐state structure determined by X‐ray crystallography revealed some close contacts between the pincer complexes and the meso‐p‐tolyl subsitutents of the porphyrin. It was shown by ¹H NMR spectroscopy that these close contacts were not present in solution and that this compound can potentially act as a novel building block for supramolecular architectures.