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...

Two equally skilled groups of students taking introductory mechanics solve related physics problem pairs in reverse order with respect to each other, using the web-based Socratic tutor, MasteringPhysics. In tutorial problems containing help in the form of requestable hints, descriptive text, and feedback, twice as many students were able to complete problems correctly in real-time compared to p...

This paper assumes a user-oriented point of view in examining the performability of a dependable omputing system. The investigated performability measure is the e e tive time that a task, with an assigned work requirement, takes to be exe uted by the system. Assuming that the system hanges its performan e hara teristi s randomly in time, the sto hasti model representing the task ompletion time ...