Search

This chapter aims to define a research agenda regarding the software graphics architecture for interactive digital television (iDTV). It is important to note that by iDTV we do not refer to the provision of a return path, but rather to the potential impact the user has over the television (both video stream and applications) content. We can differentiate three major topics to be included in the agenda: (1) to define a suitable declarative environment for television receivers, (2) to research television input (as multiple input devices) and output (multiple display devices) capabilities, and (3) to rethink the models of television distribution and post-distribution (e.g., peer-to-peer [P2P] networks and optical storage technologies). This chapter elaborates on these topics.

This chapter aims to define a research agenda regarding the software graphics architecture for interactive digital television (iDTV). It is important to note that by iDTV we do not refer to the provision of a return path, but rather to the potential impact the user has over the television (both video stream and applications) content. We can differentiate three major topics to be included in the agenda: (1) to define a suitable declarative environment for television receivers, (2) to research television input (as multiple input devices) and output (multiple display devices) capabilities, and (3) to rethink the models of television distribution and post-distribution (e.g., peer-to-peer [P2P] networks and optical storage technologies). This chapter elaborates on these topics.

Windblown material from the ore storage pads and tailings piles had, over 38 years of exposure, contaminated 500 ha of land around the site in New Mexico. The cleanup approach coupled gamma radiation detectors to global positioning systems to obtain high density gamma- count- rate data. This was correlated with Ra-226 in soil and a gamma-count-rate action level established, at the 95% confidence level, that corresponded to the Ra-226 concentration limit. A verification plan was approved by the US Nuclear Regulatory Commission that incorporated the use of high density gamma-ray data as a primary verification method with limited soil sampling as confirmation. About 1 500 000 m3 of contaminated soil was removed and consolidated with mill tailings. Significant cost savings were possible using this method, compared with conventional radiological survey methods., Windblown material from the ore storage pads and tailings piles had, over 38 years of exposure, contaminated 500 ha of land around the site in New Mexico. The cleanup approach coupled gamma radiation detectors to global positioning systems to obtain high density gamma- count- rate data. This was correlated with Ra-226 in soil and a gamma-count-rate action level established, at the 95% confidence level, that corresponded to the Ra-226 concentration limit. A verification plan was approved by the US Nuclear Regulatory Commission that incorporated the use of high density gamma-ray data as a primary verification method with limited soil sampling as confirmation. About 1 500 000 m3 of contaminated soil was removed and consolidated with mill tailings. Significant cost savings were possible using this method, compared with conventional radiological survey methods.

In sequencing and scheduling models it is usually assumed that due dates represent exogeneous information. In many practical settings, however, due dates can be discretionary, or at least negotiable. Relatively few studies have incorporated discretionary due dates, and even then the rules proposed for due-date selection have seldom been developed from normative, analytic results. In this research we return to very basic scheduling models in search of fundamental insights and relationships that suggest guidelines for due-date selection in more complicated situations. We exploit some fundamental results from scheduling theory involving the single-machine model in order to compare three basic strategies for due-date selection.

no abstract

In sequencing and scheduling models it is usually assumed that due dates represent exogeneous information. In many practical settings, however, due dates can be discretionary, or at least negotiable. Relatively few studies have incorporated discretionary due dates, and even then the rules proposed for due-date selection have seldom been developed from normative, analytic results. In this research we return to very basic scheduling models in search of fundamental insights and relationships that suggest guidelines for due-date selection in more complicated situations. We exploit some fundamental results from scheduling theory involving the single-machine model in order to compare three basic strategies for due-date selection.

no abstract