Improved estimation of duality gap in binary quadratic programming using a weighted distance measure

We present in this paper an improved estimation of duality gap between binary quadratic program and its Lagrangian dual. More specifically, we obtain this improved estimation using a weighted distance measure between the binary set and certain affine subspace. We show that the optimal weights can be computed by solving a semidefinite programming problem. We further establish a necessary and sufficient condition under which the weighted distance measure gives a strictly tighter estimation of the duality gap than the existing estimations.     

A simultaneous canonical form of a pair of matrices and applications involving the weighted Moore–Penrose inverse

In this paper, a simultaneous canonical form of a pair of rectangular complex matrices is developed. Using this new tool we give a necessary and sufficient condition to assure that the reverse order law is valid for the weighted Moore–Penrose inverse. Additionally, we characterize matrices ordered by the weighted star partial order and adjacent matrices as applications.     

Equilibrium analysis for a mass-conserving model in presence of cavitation

We study the existence of equilibrium positions for the load problem in Lubrication Theory. The problem consists of two surfaces in relative motion separated by a small distance filled by a lubricant. The system is described by the modified Reynolds equation (Elrod–Adams model) which describes the behavior of the lubricant and an extra integral equation given the balance of forces. The balance of forces allows to obtain the unknown position of the surfaces, defined with one degree of freedom.     

On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues

For a graph G, the unraveled ball of radius r centered at a vertex v is the ball of radius r centered at v in the universal cover of G. We obtain a lower bound on the weighted spectral radius of unraveled balls of fixed radius in a graph with positive weights on edges, which is used to present an upper bound on the $s^{\text{th}}$ (where $s\ge 2$) smallest normalized Laplacian eigenvalue of irregular graphs under minor assumptions. Moreover, when $s=2$, the result may be regarded as an Alon–Boppana type bound for a class of irregular graphs.     

Corresponding Angle Feedback in an innovative weighted transportation system

The optimal information feedback has a significant effect on many socioeconomic systems like stock market and traffic systems aiming to make full use of resources. In this Letter, we study dynamics of traffic flow with real-time information. The influence of a feedback strategy named Corresponding Angle Feedback Strategy (CAFS) is introduced, based on a two-route scenario in which dynamic information can be generated and displayed on the board to guide road users to make a choice. Our model incorporates the effects of adaptability into the cellular automaton models of traffic flow and simulation results adopting this optimal information feedback strategy have demonstrated high efficiency in controlling spatial distribution of traffic patterns compared with the other three information feedback strategies, i.e., vehicle number and flux.