Congestion has posed a big problem in (ATM) network. Every network user encounters congestion issues. In terms of network, congestion is unpredictable; it can be caused by traffic or too many data that cluster together in the system. In telecommunication, congestion occurs when more users access the network; during the peak period when the control channel is congested as such call cannot be est...

We consider the online scheduling problem of minimizing the total weighted and unweighted completion time on identical parallel machines with preemptible jobs. We show a new general lower bound of 21/19 ≈ 1.105 on the competitive ratio of any deterministic online algorithm for the unweighted problem and 16− √ 14 11 ≈ 1.114 for the weighted problem. We then analyze the performance of the natural...

Knowledge graph (KG) completion adds new facts to a KG by making inferences from existing facts. Most existing methods ignore the time information and only learn from time-unknown fact triples. In dynamic environments that evolve over time, it is important and challenging for knowledge graph completion models to take into account the temporal aspects of facts. In this paper, we present a novel ...

This paper proposes to model movements in more than a century of daily US stock prices as the outcome of a multi-state marked point process and studies the time it takes for stock prices to complete an up or a down move of a certain size. We present a new econometric specification for a class of dynamic models that account for autoregressive conditional duration effects. We also present a metho...

Query auto-completion (QAC) is a common interactive feature for assisting users during query formulation. Following each query input keystroke, QAC suggests queries prefixed by the input characters; allowing the user to avoid further cognitive and physical effort if any are acceptable. To rank suggestions, QAC approaches typically aggregate past query popularity to determine the likelihood of a...