The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
Sensor networks have attracted intensive interests due to its extendable capability. In this paper, we attempt to answer a fundamental but practical question:” how should we dep...
—The OFDM signals have a problem of high peak-to-average power ratio (PAPR). Hence, a large transmit-power backoff or amplitude clipping is required. The amplitude clipping cause...