In the paper we establish some new results depending on the comparative growth properties of composition of entire functions using relative $L^{ast }$-order (relative $L^{ast }$-lower order) as compared to their corresponding left and right factors where $Lequiv Lleft( rright) $ is a slowly changing function.

The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...

This paper addresses the estimation of Relative Transfer Function (RTF) between microphones from noisy recordings. We utilize an incomplete initial measurement of the RTF, which is known for only several frequency bins. The measurement is completed by finding its sparsest representation in the time domain. We propose to perform this reconstruction by solving a Second-Order Cone Program (SOCP). ...