Recyclable and reusable Pd(OAc)2/PPh3/PEG‐2000 system for homocoupling reaction of arylboronic acids under air without base

A stable and efficient Pd(OAc)₂/PPh₃/PEG‐2000 catalytic system for homocoupling of arylboronic acids has been developed. In the presence of Pd(OAc)₂ and PPh₃, the homocoupling reaction of arylboronic acids was carried out smoothly in PEG‐2000 at 70 °C under air without base to afford a variety of symmetric biaryls in good to excellent yields. The isolation of the products was readily performed by extraction with diethyl ether, and the Pd(OAc)₂/PPh₃/PEG‐2000 system could be easily recycled and reused six times without significant loss of catalytic activity. Copyright © 2014 John Wiley & Sons, Ltd.     

On Dual Configurational Forces

The dual conservation laws of elasticity are systematically re-examined by using both Noether's variational approach and Coleman–Noll–Gurtin's thermodynamics approach. These dual conservation laws can be interpreted as the dual configurational force, and therefore they provide the dual energy–momentum tensor. Some previously unknown and yet interesting results in elasticity theory have been discovered. As an example, we note the following duality condition between the configuration force (energy–momentum tensor) and the dual configuration force (dual energy–momentum tensor) ,

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

Steady States of Anisotropic Generalized Newtonian Fluids

We consider the stationary flow of a generalized Newtonian fluid which is modelled by an anisotropic dissipative potential f. More precisely, we are looking for a solution of the following system of nonlinear partial differential equations

Nearly-Hamiltonian Structure for Water Waves with Constant Vorticity

We show that the governing equations for two-dimensional gravity water waves with constant non-zero vorticity have a nearly-Hamiltonian structure, which becomes Hamiltonian for steady waves.      

Existence of Solutions with the Prescribed Flux of the Navier–Stokes System in an Infinite Cylinder

The existence and uniqueness of a solution to the nonstationary Navier–Stokes system having a prescribed flux in an infinite cylinder is proved. We assume that the initial data and the external forces do not depend on x₃ and find the solution (u, p) having the following form

Stability of a Steady Viscous Incompressible Flow Past an Obstacle

We derive a sufficient condition for stability of a steady solution of the Navier–Stokes equation in a 3D exterior domain Ω. The condition is formulated as a requirement on integrability on the time interval (0, +∞) of a semigroup generated by the linearized problem for perturbations, applied to a finite family of certain functions. The norm of the semigroup is measured in a bounded sub-domain of Ω. We do not use any condition on “smallness” of the basic steady solution.      

Convexifactors,generalized convexity and vector optimization

In this article we study a recently introduced notion of non-smooth analysis, namely convexifactors. We study some properties of the convexifactors and introduce two new chain rules. A new notion of non-smooth pseudoconvex function is introduced and its properties are studied in terms of convexifactors. We also present some optimality conditions for vector minimization in terms of convexifactors.     

Ratio-conjugation tool and its application in linear optimization models†

The ratio-conjugation-tool (RC) is constructed systematically, and its applicability for analysis of economic models is demonstrated. One of the main results establishes a general formula for RC of aggregative function. This tool is applied to the analysis of linear economic dynamics models of Neumann–Gale type which can be solved by a dynamic programming method: for each direct problem we construct the corresponding dual RC-problem. Moreover, we consider three examples of the most important economic dynamics models and look at these now from a unified general position.     

An Alternative Way to Generalize the Pentagon

We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties of ordinary polygons. In short, a pentagonal geometry is a regular partial linear space in which for all points x, the points not collinear with the point x, form a line. We compute bounds on their parameters, give some constructions, obtain some nonexistence results for seemingly feasible parameters and suggest a cryptographic application related to identifying codes of partial linear spaces.