8 resultados para Video lecture capture
em Duke University
Resumo:
A set of 13 US based experts in post-combustion and oxy-fuel combustion CO2 capture systems responded to an extensive questionnaire asking their views on the present status and future expected performance and costs for amine-based, chilled ammonia, and oxy-combustion retrofits of coal-fired power plants. This paper presents the experts' responses for technology maturity, ideal plant characteristics for early adopters, and the extent to which R&D and deployment incentives will impact costs. It also presents the best estimates and 95% confidence limits of the energy penalties associated with amine-based systems. The results show a general consensus that amine-based systems are closer to commercial application, but potential for improving performance and lowering costs is limited; chilled ammonia and oxy-combustion offer greater potential for cost reductions, but not without greater uncertainty regarding scale and technical feasibility. © 2011 Elsevier Ltd.
Resumo:
We explore the possibilities of obtaining compression in video through modified sampling strategies using multichannel imaging systems. The redundancies in video streams are exploited through compressive sampling schemes to achieve low power and low complexity video sensors. The sampling strategies as well as the associated reconstruction algorithms are discussed. These compressive sampling schemes could be implemented in the focal plane readout hardware resulting in drastic reduction in data bandwidth and computational complexity.
Resumo:
BACKGROUND: Historically, only partial assessments of data quality have been performed in clinical trials, for which the most common method of measuring database error rates has been to compare the case report form (CRF) to database entries and count discrepancies. Importantly, errors arising from medical record abstraction and transcription are rarely evaluated as part of such quality assessments. Electronic Data Capture (EDC) technology has had a further impact, as paper CRFs typically leveraged for quality measurement are not used in EDC processes. METHODS AND PRINCIPAL FINDINGS: The National Institute on Drug Abuse Treatment Clinical Trials Network has developed, implemented, and evaluated methodology for holistically assessing data quality on EDC trials. We characterize the average source-to-database error rate (14.3 errors per 10,000 fields) for the first year of use of the new evaluation method. This error rate was significantly lower than the average of published error rates for source-to-database audits, and was similar to CRF-to-database error rates reported in the published literature. We attribute this largely to an absence of medical record abstraction on the trials we examined, and to an outpatient setting characterized by less acute patient conditions. CONCLUSIONS: Historically, medical record abstraction is the most significant source of error by an order of magnitude, and should be measured and managed during the course of clinical trials. Source-to-database error rates are highly dependent on the amount of structured data collection in the clinical setting and on the complexity of the medical record, dependencies that should be considered when developing data quality benchmarks.
Resumo:
A total of 54 free-ranging monkeys were captured and marked in Santa Rosa National Park, Costa Rica, during May 1985, and an additional 17 were captured during March 1986. The animals were darted using a blowpipe or a CO2 gun. The drugs used were Ketaset, Sernylan and Telazol. Ketaset was effective for Cebus capucinus but unsuccessful for Alouatta palliata and Ateles geoffroyi. Sernylan was successful for A. geoffroyi and A. palliata but is no longer commercially available. Telazol proved to be an excellent alternative capture drug for both A. palliata and A. geoffroyi.
Resumo:
This paper introduces the concept of adaptive temporal compressive sensing (CS) for video. We propose a CS algorithm to adapt the compression ratio based on the scene's temporal complexity, computed from the compressed data, without compromising the quality of the reconstructed video. The temporal adaptivity is manifested by manipulating the integration time of the camera, opening the possibility to realtime implementation. The proposed algorithm is a generalized temporal CS approach that can be incorporated with a diverse set of existing hardware systems. © 2013 IEEE.
Resumo:
The early detection of developmental disorders is key to child outcome, allowing interventions to be initiated which promote development and improve prognosis. Research on autism spectrum disorder (ASD) suggests that behavioral signs can be observed late in the first year of life. Many of these studies involve extensive frame-by-frame video observation and analysis of a child's natural behavior. Although nonintrusive, these methods are extremely time-intensive and require a high level of observer training; thus, they are burdensome for clinical and large population research purposes. This work is a first milestone in a long-term project on non-invasive early observation of children in order to aid in risk detection and research of neurodevelopmental disorders. We focus on providing low-cost computer vision tools to measure and identify ASD behavioral signs based on components of the Autism Observation Scale for Infants (AOSI). In particular, we develop algorithms to measure responses to general ASD risk assessment tasks and activities outlined by the AOSI which assess visual attention by tracking facial features. We show results, including comparisons with expert and nonexpert clinicians, which demonstrate that the proposed computer vision tools can capture critical behavioral observations and potentially augment the clinician's behavioral observations obtained from real in-clinic assessments.
Resumo:
Scheduling a set of jobs over a collection of machines to optimize a certain quality-of-service measure is one of the most important research topics in both computer science theory and practice. In this thesis, we design algorithms that optimize {\em flow-time} (or delay) of jobs for scheduling problems that arise in a wide range of applications. We consider the classical model of unrelated machine scheduling and resolve several long standing open problems; we introduce new models that capture the novel algorithmic challenges in scheduling jobs in data centers or large clusters; we study the effect of selfish behavior in distributed and decentralized environments; we design algorithms that strive to balance the energy consumption and performance.
The technically interesting aspect of our work is the surprising connections we establish between approximation and online algorithms, economics, game theory, and queuing theory. It is the interplay of ideas from these different areas that lies at the heart of most of the algorithms presented in this thesis.
The main contributions of the thesis can be placed in one of the following categories.
1. Classical Unrelated Machine Scheduling: We give the first polygorithmic approximation algorithms for minimizing the average flow-time and minimizing the maximum flow-time in the offline setting. In the online and non-clairvoyant setting, we design the first non-clairvoyant algorithm for minimizing the weighted flow-time in the resource augmentation model. Our work introduces iterated rounding technique for the offline flow-time optimization, and gives the first framework to analyze non-clairvoyant algorithms for unrelated machines.
2. Polytope Scheduling Problem: To capture the multidimensional nature of the scheduling problems that arise in practice, we introduce Polytope Scheduling Problem (\psp). The \psp problem generalizes almost all classical scheduling models, and also captures hitherto unstudied scheduling problems such as routing multi-commodity flows, routing multicast (video-on-demand) trees, and multi-dimensional resource allocation. We design several competitive algorithms for the \psp problem and its variants for the objectives of minimizing the flow-time and completion time. Our work establishes many interesting connections between scheduling and market equilibrium concepts, fairness and non-clairvoyant scheduling, and queuing theoretic notion of stability and resource augmentation analysis.
3. Energy Efficient Scheduling: We give the first non-clairvoyant algorithm for minimizing the total flow-time + energy in the online and resource augmentation model for the most general setting of unrelated machines.
4. Selfish Scheduling: We study the effect of selfish behavior in scheduling and routing problems. We define a fairness index for scheduling policies called {\em bounded stretch}, and show that for the objective of minimizing the average (weighted) completion time, policies with small stretch lead to equilibrium outcomes with small price of anarchy. Our work gives the first linear/ convex programming duality based framework to bound the price of anarchy for general equilibrium concepts such as coarse correlated equilibrium.
Resumo:
Inhibitory motor control is a core function of cognitive control. Evidence from diverse experimental approaches has linked this function to a mostly right-lateralized network of cortical and subcortical areas, wherein a signal from the frontal cortex to the basal ganglia is believed to trigger motor-response cancellation. Recently, however, it has been recognized that in the context of typical motor-control paradigms those processes related to actual response inhibition and those related to the attentional processing of the relevant stimuli are highly interrelated and thus difficult to distinguish. Here, we used fMRI and a modified Stop-signal task to specifically examine the role of perceptual and attentional processes triggered by the different stimuli in such tasks, thus seeking to further distinguish other cognitive processes that may precede or otherwise accompany the implementation of response inhibition. In order to establish which brain areas respond to sensory stimulation differences by rare Stop-stimuli, as well as to the associated attentional capture that these may trigger irrespective of their task-relevance, we compared brain activity evoked by Stop-trials to that evoked by Go-trials in task blocks where Stop-stimuli were to be ignored. In addition, region-of-interest analyses comparing the responses to these task-irrelevant Stop-trials, with those to typical relevant Stop-trials, identified separable activity profiles as a function of the task-relevance of the Stop-signal. While occipital areas were mostly blind to the task-relevance of Stop-stimuli, activity in temporo-parietal areas dissociated between task-irrelevant and task-relevant ones. Activity profiles in frontal areas, in turn, were activated mainly by task-relevant Stop-trials, presumably reflecting a combination of triggered top-down attentional influences and inhibitory motor-control processes.