Quiver Hopf algebras

In this paper we study subHopfalgebras of graded Hopf algebra structures on a path coalgebra kQ^c. We prove that a Hopf structure on some subHopfquivers can be lifted to a Hopf structure on the whole Hopf quiver. If Q is a Schurian Hopf quiver, then we classified all simple-pointed subHopfalgebras of a graded Hopf structure on kQ^c. We also prove a dual Gabriel theorem for pointed Hopf algebras.     

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms.     

Optimized Pump Power Ratio on 2nd Order Pumping Discrete Raman Amplifier

By optimizing pump power ratio between 1st order backward pump and 2nd order forward pump on discrete Raman amplifier, we demonstrated over 2dB noise figure improvement without excessive non-linearity degradation.     

New results for aggregating integer-valued equations

A variety of results have been given for aggregating integer-valued (diophantine) equations whose variables are restricted to nonnegative integers. In each, integer weights are identified for the equations so that their linear combination yields a single equation with the same solution set of the original system of equations. Because the coefficients of the aggregated equation tend to achieve unwieldy sizes as the number of original equations increases, the goal is to identify weights so these coefficients will lie in a range as limited as possible. We give theorems which separately and in combination provide new methods for aggregating general integer-valued equations. Our results include formulations that do not require linearity of the original system, or nonnegativity of component variables. We also demonstrate that our theorems yield as special cases earlier results (analytical formulae) conjectured to yield the smallest possible weights for less general domains. As another application, the presented results were used to develop a highly efficient approach for the integer knapsack problem. Empirical outcomes show that the developed solution procedure is significantly superior to advanced branch and bound methods (previously established to be the most efficient knapsack solution procedures).