NBC News Scripts
WBAP-TV (Television station : Fort Worth, Tex.)
1954-12-31
Search results
You search for automatic and 75,118 records were found.
VI Workshop Ingeniería de Software (WIS)
A fully automated procedure, involving computer-controlled stimulus presentation and computerrecorded
response measurement, was used for the first time to study imitation in non-human animals.
After preliminary training to peck and step on a manipulandum, budgerigars were given a discrimination
task in which they were rewarded with food for pecking during observation of pecking and for stepping
during observation of stepping (Compatible group), or for pecking while observing stepping and for
stepping while observing pecking (Incompatible group). The Incompatible group, which had to counterimitate
for food reward, showed weaker discrimination performance than the Compatible group. This
suggests that, like humans, budgerigars are subject to ‘automatic imitation’; they cannot inhibit online the
tendency to imitate pecking and/or s...
Correcting methods intend to improve the accuracy of results computed in finite precision. The CENA method processes an automatic correction of the first-order effect of the rounding errors the computation generates. The method provides a corrected result and a bound of the residual error for a class of algorithms we identify. We present the main features of the CENA method and illustrate its interests and limitations with examples.
Recent advances in decision procedures for Boolean satisfiability (SAT) and Satisfiability Modulo Theories (SMT) have increased the performance and capacity of formal verification techniques. Even with these advances, formal methods often do not scale to industrial-size designs, due to the gap between the level of abstraction at which designs are described and the level at which SMT solvers can be applied. In order to fully exploit the power of state-of-the-art SMT solvers, abstraction is necessary. However, applying abstraction to industrial-size designs is currently a daunting task, typically requiring major manual efforts. This thesis aims to bridge the gap between the level at which designs are described and the level at which SMT solvers can reason efficiently, referred to as the term level.This thesis presents automatic ...
—Morphological attribute profiles are multilevel decomposition of images obtained with a sequence of transformations performed by connected operators. They have been extensively employed in performing multi-scale and region-based analysis in a large number of applications. One main, still unresolved, issue is the selection of filter parameters able to provide representative and non-redundant threshold decomposition of the image. This paper presents a framework for the automatic selection of filter thresholds based on Granulometric Characteristic Functions (GCFs). GCFs describe the way that non-linear morphological filters simplify a scene according to a given measure. Since attribute filters rely on a hierarchical representation of an image (e.g., the Tree of Shapes) for their implementation, GCFs can be efficiently computed by taking ...
We present Automatic Differentiation (AD),a technique to obtain derivatives of functions provided as programs.We present the principles that justify why AD is possible and explain its performance.The adjoint mode of AD is the choice approach to obtain gradients,like the gradients needed for data assimilation.We show the specific difficulties of the adjoint mode,and list a few AD tools that handle these problems well.We show why AD needs an enlightened user to achieve optimal efficiency.
Multi-cores and multi-processors became ubiquitous during the last few years, and the trend is to increase the number of simple, power-efficient, and slower cores per chip. One of the results is that the performance of single-threaded applications did not significantly improve, or even declined, on new processors, which heightened the interest in compiler automatic parallelization techniques. Our objective is to develop a framework in GCC to transform loops into pipelines of concurrent tasks using streams to communicate and synchronize. This transformation can either rely on user hints (pragmas) or on static analysis of control and data dependences. Our focus is to fully automate this transformation, which requires an integration with the Graphite polyhedral loop optimization framework and will lead to the development of runtime optimi...
Using automatic differentiation (AD) to estimate the propagation of rounding errors in numerical algorithms is classic. We propose a new application of AD to roundoff analysis providing an automatic correction of the first order effect of the elementary rounding errors. We present the main characteri- stics of this method and significant examples of its application to improve the accuracy of computed results and/or the stability of the algorithm.
Refereed conference paper
