Palladium-complex-catalyzed regioselective Markovnikov addition reaction and dehydrogenative double phosphinylation to terminal alkynes with diphenylphosphine oxide

Palladium-1,2-bis(diphenylphosphino)ethane complex catalyzes regioselective Markovnikov addition of diphenylphosphine oxide to terminal alkynes in propionitrile, while the use of triarylphopshines, di(o-tolyl)phenylphosphine in particular, as the ligand leads to dehydrogenative double addition forming 1,2-diphenylphosphinyl-1-alkenes as major products.     

From Chaos to Ordering: New Studies in the Shannon Entropy of 2D Patterns

Properties of the Voronoi tessellations arising from random 2D distribution points are reported. We applied an iterative procedure to the Voronoi diagrams generated by a set of points randomly placed on the plane. The procedure implied dividing the edges of Voronoi cells into equal or random parts. The dividing points were then used to construct the following Voronoi diagram. Repeating this procedure led to a surprising effect of the positional ordering of Voronoi cells, reminiscent of the formation of lamellae and spherulites in linear semi-crystalline polymers and metallic glasses. Thus, we can conclude that by applying even a simple set of rules to a random set of seeds, we can introduce order into an initially disordered system. At the same time, the Shannon (Voronoi) entropy showed a tendency to attain values that are typical for completely random patterns; thus, the Shannon (Voronoi) entropy does not distinguish the short-range ordering. The Shannon entropy and the continuous measure of symmetry of the patterns demonstrated the distinct asymptotic behavior, while approaching the close saturation values with the increase in the number of iteration steps. The Shannon entropy grew with the number of iterations, whereas the continuous measure of symmetry of the same patterns demonstrated the opposite asymptotic behavior. The Shannon (Voronoi) entropy is not an unambiguous measure of order in the 2D patterns. The more symmetrical patterns may demonstrate the higher values of the Shannon entropy.     

Three-Way Decision Models Based on Ideal Relations in Multi-Attribute Decision-Making

In recent years, research on applications of three-way decision (e.g., TWD) has attracted the attention of many scholars. In this paper, we combine TWD with multi-attribute decision-making (MADM). First, we utilize the essential idea of TOPSIS in MADM theory to propose a pair of new ideal relation models based on TWD, namely, the three-way ideal superiority model and the three-way ideal inferiority model. Second, in order to reduce errors caused by the subjectivity of decision-makers, we develop two new methods to calculate the state sets for the two proposed ideal relation models. Third, we employ aggregate relative loss functions to calculate the thresholds of each object, divide all objects into three different territories and sort all objects. Then, we use a concrete example of building appearance selection to verify the rationality and feasibility of our proposed models. Furthermore, we apply comparative analysis, Spearman’s rank correlation analysis and experiment analysis to illustrate the consistency and superiority of our methods.     

A least‐square weighted residual method for level set formulation

In this paper, a least‐square weighted residual method (LSWRM) for level set (LS) formulation is introduced to achieve interface capturing in two‐dimensional (2D) and three‐dimensional (3D) problems. An LSWRM was adopted for two semi‐discretized advection and reinitialization equations of the LS formulation. The present LSWRM provided good mathematical properties such as natural numerical diffusion and the symmetry of the resulting algebraic systems for the advection and reinitialization equations. The proposed method was validated by solving some 2D and 3D benchmark problems such as those involving a rotating slotted disk, the rotation of a slotted sphere, and a time‐reversed single‐vortex flow and a deformation problem of a spherical fluid. The numerical results were compared with those obtained from essentially non‐oscillatory type formulations and particle LS methods. Further, the proposed LSWRM for the LS formulation was coupled with a splitting finite element method code to solve the incompressible Navier–Stokes equations, and then, the collapse of a 3D broken dam flow was well simulated; in the simulation, the entrapping of air and the splashing of the surge front of water were reproduced. The mass conservation of the present method was found to be satisfactory during the entire simulation. Copyright © 2011 John Wiley & Sons, Ltd.     

Continuity properties of the normal cone to the level sets of a quasiconvex function

Two main properties of the subgradient mapping of convex functions are transposed for quasiconvex ones. The continuity of the functionxf(x)^–1f(x) on the domain where it is defined is deduced from some continuity properties of the normal coneN to the level sets of the quasiconvex functionf. We also prove that, under a pseudoconvexity-type condition, the normal coneN(x) to the set {x:f(x)f(x)} can be expressed as the convex hull of the limits of type {N(x _n)}, where {x _n} is a sequence converging tox and contained in a dense subsetD. In particular, whenf is pseudoconvex,D can be taken equal to the set of points wheref is differentiable.This research was completed while the second author was on a sabbatical leave at the University of Montreal and was supported by a NSERC grant. It has its origin in the doctoral thesis of the first author (Ref. 1), prepared under the direction of the second author.The authors are grateful to an anonymous referee and C. Zalinescu for their helpful remarks on a previous version of this paper.     

The smallest point of a polytope

This note suggests new ways for calculating the point of smallest Euclidean norm in the convex hull of a given set of points inR ⁿ . It is shown that the problem can be formulated as a linear least-square problem with nonnegative variables or as a least-distance problem. Numerical experiments illustrate that the least-square problem is solved efficiently by the active set method. The advantage of the new approach lies in the solution of large sparse problems. In this case, the new formulation permits the use of row relaxation methods. In particular, the least-distance problem can be solved by Hildreth's method.     

DIMENSIONS FORRANDOM SELF——CONFORMAL SETS

A set is called regular if its Hausdorff dimension and upper box-counting dimension coincide. In this paper, we prove that the random self-con formal set is regular almost surely. Also we determine the dimen-sions for a class of random self-con formal sets.     

On the Pesin set of expansive geodesic flows in manifolds with no conjugate points

In this paper, we show that the Pesin set of an expansive geodesic flow in compact manifold with no conjugate points and bounded asymptote coincides a.e with an open and dense set of the unit tangent bundle. We also show that the set of hyperbolic periodic orbits is dense in the unit tangent bundle.     

Uniform Continuity of a Family of Weakly Regular Set Functions on Topological Spaces

Conditions for the uniform continuity of a family of weakly regular set functions defined on an algebra of subsets of a -topological space (T,) and taking values in an arbitrary topological space are found.     

Some Properties for the Euclidean Distance Matrix and Positive Semidefinite Matrix Completion Problems

The Euclidean distance matrix (EDM) completion problem and the positive semidefinite (PSD) matrix completion problem are considered in this paper. Approaches to determine the location of a point in a linear manifold are studied, which are based on a referential coordinate set and a distance vector whose components indicate the distances from the point to other points in the set. For a given referential coordinate set and a corresponding distance vector, sufficient and necessary conditions are presented for the existence of such a point that the distance vector can be realized. The location of the point (if it exists) given by the approaches in a linear manifold is independent of the coordinate system, and is only related to the referential coordinate set and the corresponding distance vector. An interesting phenomenon about the complexity of the EDM completion problem is described. Some properties about the uniqueness and the rigidity of the conformation for solutions to the EDM and PSD completion problems are presented.