In this paper we propose distributed dual gradient algorithms for linearly constrained separable convex problems and analyze their rate of convergence under different assumptions. Under the strong convexity assumption on the primal objective function we propose two distributed dual fast gradient schemes for which we prove sublinear rate of convergence for dual suboptimality but also primal subo...

The repulsive a Su 1 state potential of the Na2 molecule is determined by applying the IPA ~inverse perturbation approach! of V. S. Ivanov and V. B. Sovkov @Chem. Phys. 213, 295 ~1996!# to the analysis of the Na2 2 Sg 1 (v515, N527, and v55, N539)→a Su1 continua observed in the work of T. J. Whang et al. @J. Mol. Spectrosc. 160, 411 ~1993!#. The resulting a Su 1 state potential is close to the ...

This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, ...

In this paper, network error control coding is studied for robust and efficient multicast in a directed acyclic network with imperfect links. The block network error control coding framework, BNEC, is presented and the capability of the scheme to correct a mixture of symbol errors and packet erasures and to detect symbol errors is studied. The idea of syndrome-based decoding and error detection...

cellular manufacturing system (cms) is highly important in modern manufacturing methods. given the ever increasing market competition in terms of time and cost of manufacturing, we need models to decrease the cost and time of manufacturing. in this study, cms is considered in condition of dynamic demand in each period. the model is developed for facing dynamic demand that increases the cost of ...

Algorithms for geometric matching and feature extraction that work by recursively subdividing transformation space and bounding the quality of match have been proposed in a number of different contexts and become increasingly popular over the last few years. This paper describes matchlist-based branch-and-bound techniques and presents a number of new applications of branch-and-bound methods, am...

We demonstrate the potential of branch and bound methods for handling the combinatorial problems arising in control structure design. The method efficiently solves large-scale benchmark problems for selection of controlled variables using minimum singular value rule and variable selection for stabilization. We also provide an overview of some other interesting problems that can be solved in the...

We compare two methods for proving lower bounds on standard two-party model of communication complexity, the Rank method and Fooling set method. We present bounds on the number of functions f(x, y), x, y ∈ {0, 1}n, with rank of size k and fooling set of size at least k, k ∈ [1, 2n]. Using these bounds we give a novel proof that almost all Boolean functions f are hard, i.e., the communication co...

In this paper, we consider construction of upper bound graphs. An upper bound graph can be transformed into a nova by contractions and a nova can be transformed into an upper bound graph by splits. By these results, we get a characterization on upper bound graphs.