We propose a novel conservative visibility culling technique based on the Prioritized-Layered Projection (PLP) algorithm. PLP is a time-critical rendering technique that computes, for a given viewpoint, a partially correct image by rendering only a subset of the geometric primitives, those that PLP determines to be mostly likely visible. Our new algorithm builds on PLP and provides an efficient...

I this article we present our concept of time-critical decision making, sometimes even in life-threatening situations, and compare it to the process of non-time-critical decision making. Decision-making methodologies have been extensively researched, and some of the published research deals with decision making within the context of everyday life. However, in many organizations it is customary ...

There has been an intensive amount of research conducted in scheduling real-time systems. Different scheduling policies use different attributes of the tasks within the system in deriving their scheduling decision(s). Since tasks in any time-critical system are associated with various levels of importance, many researchers tend to agree that the task’s level of importance should be a major attr...

In this paper, we introduce a benchmark suite on RTP/RTCP processing. The suite consists of three benchmarks, namely RTP Sender, RTP Receiver and RTCP Processing. For each benchmark, three aspects are specified: functions, measurements and environments. After implementing the benchmarks, we perform profiling in order to determine the time-critical functions and investigate the architectural cha...

Up-to-date, accurate, and reliable information is fundamental for time-critical decision support and sustainable emergency management. In this paper, we show how standardised geo-sensor webs, in combination with web-based geo-processing, can enhance efficiency in emergency response and management, demonstrated in the field of radiation safety. We focus on end user and information requirements a...

In automatic speech recognition complex state spaces are searched during the recognition process. By limiting these search spaces the computation time can be reduced, but unfortunately the recognition rate mostly decreases, too. However, especially for time-critical recognition tasks a search-space pruning is necessary. Therefore, we developed a dynamic mechanism to optimize the pruning paramet...

In this paper, we present a novel method to meet the time-critical requirement in rendering time-varying volume data. In time-critical rendering, the rendering is demanded to be completed in a given time budget. Our approach is modified from the differential volume rendering, which updates only the changed pixels instead of all pixels on the image plane. The level of modification (LOM) is used ...

This paper reports on a field-based study of online help systems at the University of Maryland. After collecting data by means of interview, observation and focus group, analysis is grounded on the contextual data, thus shedding light on particular organizational and human behavioral issues on online help systems. The objectives of this research are to offer insights, enhance understandings, an...

Current applications are distributed in nature and manipulate time-critical databases with firm-deadline transactions. To guarantee performance and availability of such applications fault-tolerant mechanisms need to be developed. In the context of time critical applications, this also leads to providing means to ensure that as many as possible real-time transactions satisfy their deadline in th...

Previous works for multi-target tracking employ two strategies: global optimization and online state estimation. In time-critical applications, the former methods have long temporal latency, and the latter can’t recover from erroneous association or drifting. In this paper, we combine these two strategies, and propose a new low-latency online tracking approach. Unlike previous multi-hypotheses ...