A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.

Minimal unsatisfiable sets: Classification and bounds

Proving the unsatisfiability of propositional Boolean formulas has applications in a wide range of fields. Minimal Unsatisfiable Sets (MUS) are signatures of the property of unsatisfiability in formulas and our understanding of these signatures can be very helpful in answering various algorithmic and structural questions relating to unsatisfiability. In this paper, we explore some combinatorial properties of MUS and use them to devise a classification scheme for MUS. We also derive bounds on the sizes of MUS in Horn, 2-SAT and 3-SAT formulas.

On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

Construction of Equivalent Circuit of a Single and Isolated Transformer Winding From FRA Data Using the ABC Algorithm

This paper reports the results of employing an artificial bee colony search algorithm for synthesizing a mutually coupled lumped-parameter ladder-network representation of a transformer winding, starting from its measured magnitude frequency response. The existing bee colony algorithm is suitably adopted by appropriately defining constraints, inequalities, and bounds to restrict the search space and thereby ensure synthesis of a nearly unique ladder network corresponding to each frequency response. Ensuring near-uniqueness while constructing the reference circuit (i.e., representation of healthy winding) is the objective. Furthermore, the synthesized circuits must exhibit physical realizability. The proposed method is easy to implement, time efficient, and problems associated with the supply of initial guess in existing methods are circumvented. Experimental results are reported on two types of actual, single, and isolated transformer windings (continuous disc and interleaved disc).

Construction of Equivalent Circuit of a Single and Isolated Transformer Winding From FRA Data Using the ABC Algorithm

This paper reports the results of employing an artificial bee colony search algorithm for synthesizing a mutually coupled lumped-parameter ladder-network representation of a transformer winding, starting from its measured magnitude frequency response. The existing bee colony algorithm is suitably adopted by appropriately defining constraints, inequalities, and bounds to restrict the search space and thereby ensure synthesis of a nearly unique ladder network corresponding to each frequency response. Ensuring near-uniqueness while constructing the reference circuit (i.e., representation of healthy winding) is the objective. Furthermore, the synthesized circuits must exhibit physical realizability. The proposed method is easy to implement, time efficient, and problems associated with the supply of initial guess in existing methods are circumvented. Experimental results are reported on two types of actual, single, and isolated transformer windings (continuous disc and interleaved disc).

Sulfate Chemistry for High-Voltage Insertion Materials: Synthetic, Structural and Electrochemical Insights

Rechargeable batteries based on Li and Na ions have been growing leaps and bounds since their inception in the 1970s. They enjoy significant attention from both the fundamental science point of view and practical applications ranging from portable electronics to hybrid vehicles and grid storage. The steady demand for building better batteries calls for discovery, optimisation and implementation of novel positive insertion (cathode) materials. In this quest, chemists have tried to unravel many future cathode materials by taking into consideration their eco-friendly synthesis, material/process economy, high energy density, safety, easy handling and sustainability. Interestingly, sulfate-based cathodes offer a good combination of sustainable syntheses and high energy density owing to their high-voltage operation, stemming from electronegative SO42- units. This review delivers a sneak peak at the recent advances in the discovery and development of sulfate-containing cathode materials by focusing on their synthesis, crystal structure and electrochemical performance. Several family of cathodes are independently discussed. They are 1) fluorosulfates AMSO(4)F], 2) bihydrated fluorosulfates AMSO(4)F2H(2)O], 3) hydroxysulfate AMSO(4)OH], 4) bisulfates A(2)M(SO4)(2)], 5) hydrated bisulfates A(2)M(SO4)(2)nH(2)O], 6) oxysulfates Fe-2(SO4)(2)O] and 7) polysulfates A(2)M(2)(SO4)(3)]. A comparative study of these sulfate-based cathodes has been provided to offer an outlook on the future development of high-voltage polyanionic cathode materials for next-generation batteries.

Depletion of nonlinearity in magnetohydrodynamic turbulence: Insights from analysis and simulations

It is shown how suitably scaled, order-m moments, D-m(+/-), of the Elsasser vorticity fields in three-dimensional magnetohydrodynamics (MHD) can be used to identify three possible regimes for solutions of the MHD equations with magnetic Prandtl number P-M = 1. These vorticity fields are defined by omega(+/-) = curl z(+/-) = omega +/- j, where z(+/-) are Elsasser variables, and where omega and j are, respectively, the fluid vorticity and current density. This study follows recent developments in the study of three-dimensional Navier-Stokes fluid turbulence Gibbon et al., Nonlinearity 27, 2605 (2014)]. Our mathematical results are then compared with those from a variety of direct numerical simulations, which demonstrate that all solutions that have been investigated remain in only one of these regimes which has depleted nonlinearity. The exponents q(+/-) that characterize the inertial range power-law dependencies of the z(+/-) energy spectra, epsilon(+/-)(k), are then examined, and bounds are obtained. Comments are also made on (a) the generalization of our results to the case P-M not equal 1 and (b) the relation between D-m(+/-) and the order-m moments of gradients of magnetohydrodynamic fields, which are used to characterize intermittency in turbulent flows.

Bottleneck assignment problems under categorization

This paper considers two special cases of bottleneck grouped assignment problems when n jobs belong to m distinct categories (m < n). Solving these special problems through the available branch and bound algorithms will result in a heavy computational burden. Sequentially identifying nonopitmal variables, this paper provides more efficient methods for those cases. Propositions leading to the algorithms have been established. Numerical examples illustrate the respective algorithms.

A time minimising transportation problem with quality dependent time

The usual assumption made in time minimising transportation problem is that the time for transporting a positive amount in a route is independent of the actual amount transported in that route. In this paper we make a more general and natural assumption that the time depends on the actual amount transported. We assume that the time function for each route is an increasing piecewise constant function. Four algorithms - (1) a threshold algorithm, (2) an upper bounding technique, (3) a primal dual approach, and (4) a branch and bound algorithm - are presented to solve the given problem. A method is also given to compute the minimum bottle-neck shipment corresponding to the optimal time. A numerical example is solved illustrating the algorithms presented in this paper.

The alpha method for solving differential algebraic inequality (DAI) systems

This paper describes an algorithm for ``direct numerical integration'' of the initial value Differential-Algebraic Inequalities (DAI) in a time stepping fashion using a sequential quadratic programming (SQP) method solver for detecting and satisfying active path constraints at each time step. The activation of a path constraint generally increases the condition number of the active discretized differential algebraic equation's (DAE) Jacobian and this difficulty is addressed by a regularization property of the alpha method. The algorithm is locally stable when index 1 and index 2 active path constraints and bounds are active. Subject to available regularization it is seen to be stable for active index 3 active path constraints in the numerical examples. For the high index active path constraints, the algorithm uses a user-selectable parameter to perturb the smaller singular values of the Jacobian with a view to reducing the condition number so that the simulation can proceed. The algorithm can be used as a relatively cheaper estimation tool for trajectory and control planning and in the context of model predictive control solutions. It can also be used to generate initial guess values of optimization variables used as input to inequality path constrained dynamic optimization problems. The method is illustrated with examples from space vehicle trajectory and robot path planning.

The Gaussian Toeplitz matrix

An analytical expression for the LL(T) decomposition for the Gaussian Toeplitz matrix with elements T(ij) = [1/(2-pi)1/2-sigma] exp[-(i - j)2/2-sigma-2] is derived. An exact expression for the determinant and bounds on the eigenvalues follows. An analytical expression for the inverse T-1 is also derived.

Spectral Efficiency of Channel-Aware Schedulers in Non-identical Composite Links with Interference

Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly numerical simulations or make simplifying assumptions that limit the applicability of the results. In this paper, we derive analytical expressions for the spectral efficiency of cellular systems that use either the channel-unaware but fair round robin scheduler or the greedy, channel-aware but unfair maximum signal to interference ratio scheduler. As is the case in real deployments, non-identical co-channel interference at each user, both Rayleigh fading and lognormal shadowing, and limited modulation constellation sizes are accounted for in the analysis. We show that using a simple moment generating function-based lognormal approximation technique and an accurate Gaussian-Q function approximation leads to results that match simulations well. These results are more accurate than erstwhile results that instead used the moment-matching Fenton-Wilkinson approximation method and bounds on the Q function. The spectral efficiency of cellular systems is strongly influenced by the channel scheduler and the small constellation size that is typically used in third generation cellular systems.

Thermodynamics of higher spin black holes in 3D

We examine the thermodynamic properties of recently constructed black hole solutions in SL(3, R) x SL(3, R) Chern-Simons theory in the presence of a chemical potential for spin-3 charge, which acts as an irrelevant deformation of the dual CFT with W-3 X W-3 symmetry. The smoothness or holonomy conditions admit four branches of solutions describing a flow between two AdS(3) backgrounds corresponding to two different CFTs. The dominant branch at low temperatures, connected to the BTZ black hole, merges smoothly with a thermodynamically unstable branch and disappears at higher temperatures. We confirm that the UV region of the flow satisfies the Ward identities of a CFT with W-3((2)) x W-3((2)) symmetry deformed by a spin-3/2 current. This allows to identify the precise map between UV and HI thermodynamic variables. We find that the high temperature regime is dominated by a black hole branch whose thermodynamics can only be consistently inferred with reference to this W-3((2)) x W-3((2)) CFT.

Robust Reentry Guidance of a Reusable Launch Vehicle Using Model Predictive Static Programming

A robust suboptimal reentry guidance scheme is presented for a reusable launch vehicle using the recently developed, computationally efficient model predictive static programming. The formulation uses the nonlinear vehicle dynamics with a spherical and rotating Earth, hard constraints for desired terminal conditions, and an innovative cost function having several components with associated weighting factors that can account for path and control constraints in a soft constraint manner, thereby leading to smooth solutions of the guidance parameters. The proposed guidance essentially shapes the trajectory of the vehicle by computing the necessary angle of attack and bank angle that the vehicle should execute. The path constraints are the structural load constraint, thermal load constraint, bounds on the angle of attack, and bounds on the bank angle. In addition, the terminal constraints include the three-dimensional position and velocity vector components at the end of the reentry. Whereas the angle-of-attack command is generated directly, the bank angle command is generated by first generating the required heading angle history and then using it in a dynamic inversion loop considering the heading angle dynamics. Such a two-loop synthesis of bank angle leads to better management of the vehicle trajectory and avoids mathematical complexity as well. Moreover, all bank angle maneuvers have been confined to the middle of the trajectory and the vehicle ends the reentry segment with near-zero bank angle, which is quite desirable. It has also been demonstrated that the proposed guidance has sufficient robustness for state perturbations as well as parametric uncertainties in the model.

Improved bounds on the radius and curvature of the K pi scalar form factor and implications to low-energy theorems

We obtain stringent bounds in the < r(2)>(K pi)(S)-c plane where these are the scalar radius and the curvature parameters of the scalar K pi form factor, respectively, using analyticity and dispersion relation constraints, the knowledge of the form factor from the well-known Callan-Treiman point m(K)(2)-m(pi)(2), as well as at m(pi)(2)-m(K)(2), which we call the second Callan-Treiman point. The central values of these parameters from a recent determination are accomodated in the allowed region provided the higher loop corrections to the value of th form factor at the second Callan-Treiman point reduce the one-loop result by about 3% with F-K/F-pi = 1.21. Such a variation in magnitude at the second Callan-Treiman point yields 0.12 fm(2) less than or similar to < r(2)>(K pi)(S) less than or similar to 0.21 fm(2) and 0.56 GeV-4 less than or similar to c less than or similar to 1.47 GeV-4 and a strong correlation between them. A smaller value of F-K/F-pi shifts both bounds to lower values.