151 resultados para incremental computation
Resumo:
Model transformations are an integral part of model-driven development. Incremental updates are a key execution scenario for transformations in model-based systems, and are especially important for the evolution of such systems. This paper presents a strategy for the incremental maintenance of declarative, rule-based transformation executions. The strategy involves recording dependencies of the transformation execution on information from source models and from the transformation definition. Changes to the source models or the transformation itself can then be directly mapped to their effects on transformation execution, allowing changes to target models to be computed efficiently. This particular approach has many benefits. It supports changes to both source models and transformation definitions, it can be applied to incomplete transformation executions, and a priori knowledge of volatility can be used to further increase the efficiency of change propagation.
Resumo:
Fostering young children's mental computation capacity is essential to support their numeracy development. Debate continues as to whether young children should be explicitly taught strategies for mental computation, or be afforded the freedom to develop their own. This paper reports on teaching experiments with two groups of students in their first year of schooling: those considered 'at-risk', and those deemed mathematically advanced. Both groups made considerable learning gains as a result of instruction. Importantly, the gains of the at-risk group are likely to renew both their own, and their teacher's confidence in their ability to learn. In this paper, the instructional programs are documented, highlighting the influence of instruction upon the children's development.
Resumo:
Pac-Man is a well-known, real-time computer game that provides an interesting platform for research. We describe an initial approach to developing an artificial agent that replaces the human to play a simplified version of Pac-Man. The agent is specified as a simple finite state machine and ruleset. with parameters that control the probability of movement by the agent given the constraints of the maze at some instant of time. In contrast to previous approaches, the agent represents a dynamic strategy for playing Pac-Man, rather than a pre-programmed maze-solving method. The agent adaptively "learns" through the application of population-based incremental learning (PBIL) to adjust the agents' parameters. Experimental results are presented that give insight into some of the complexities of the game, as well as highlighting the limitations and difficulties of the representation of the agent.
Resumo:
Data refinements are refinement steps in which a program’s local data structures are changed. Data refinement proof obligations require the software designer to find an abstraction relation that relates the states of the original and new program. In this paper we describe an algorithm that helps a designer find an abstraction relation for a proposed refinement. Given sufficient time and space, the algorithm can find a minimal abstraction relation, and thus show that the refinement holds. As it executes, the algorithm displays mappings that cannot be in any abstraction relation. When the algorithm is not given sufficient resources to terminate, these mappings can help the designer find a suitable abstraction relation. The same algorithm can be used to test an abstraction relation supplied by the designer.
Resumo:
40Ar/39Ar laser incremental heating analyses of individual grains of supergene jarosite, alunite, and cryptomelane from weathering profiles in the Dugald River area, Queensland, Australia, show a strong positive correlation between a sample’s age and its elevation. We analyzed 125 grains extracted from 35 hand specimens collected from weathering profiles at 11 sites located at 3 distinct elevations. The highest elevation profile hosts the oldest supergene minerals, whereas progressively younger samples occur at lower positions in the landscape. The highest elevation sampling sites (three sites), located on top of an elongated mesa (255 to 275 m elevation), yield ages in the 16 to 12 Ma range. Samples from an intermediate elevation site (225 to 230 m elevation) yield ages in the 6 to 4 Ma range. Samples collected at the lowest elevation sites (200 to 220 m elevation) yield ages in the 2.2 to 0.8 Ma interval. Grains of supergene alunite, jarosite, and cryptomelane analyzed from individual single hand specimens yield reproducible results, confirming the suitability of these minerals to 40Ar/39Ar geochronology. Multiple samples collected from the same site also yield reproducible results, indicating that the ages measured are true precipitation ages for the samples analyzed. Different sites, up to 3 km apart, sampled from weathering profiles at the same elevation again yield reproducible results. The consistency of results confirms that 40Ar/39Ar geochronology of supergene jarosite, alunite, and cryptomelane yields ages of formation of weathering profiles, providing a reliable numerical basis for differentiating and correlating these profiles. The age versus elevation relationship obtained suggest that the stepped landscapes in the Dugald River area record a progressive downward migration of a relatively flat weathering front. The steps in the landscape result from differential erosion of previously weathered bedrock displaying different susceptibility to weathering and contrasting resistance to erosion. Combined, the age versus elevation relationships measured yield a weathering rate of 3.8 m. Myr−1 (for the past 15 Ma) if a descending subhorizontal weathering front is assumed. The results also permit the calculation of the erosion rate of the more easily weathered and eroded lithologies, assuming an initially flat landscape as proposed in models of episodic landscape development. The average erosion rate for the past 15 Ma is 3.3 m. Myr−1, consistent with erosion rates obtained by cosmogenic isotope studies in the region.