Revising threshold functions

A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in terms of the resource one is interested in) is polynomial in the syntactic distance between the initial and the target concept, but only polylogarithmic in the number of variables in the universe. We give an efficient revision algorithm in the model of learning with equivalence and membership queries for threshold functions, and some negative results showing, for instance, that threshold functions cannot be revised efficiently from either type of query alone. The algorithms work in a general revision model where both deletion and addition type revision operators are allowed.     

Lower bound limit analysis using non‐linear programming

This paper describes a new formulation, based on linear finite elements and non‐linear programming, for computing rigorous lower bounds in 1, 2 and 3 dimensions. The resulting optimization problem is typically very large and highly sparse and is solved using a fast quasi‐Newton method whose iteration count is largely independent of the mesh refinement. For two‐dimensional applications, the new formulation is shown to be vastly superior to an equivalent formulation that is based on a linearized yield surface and linear programming. Although it has been developed primarily for geotechnical applications, the method can be used for a wide range of plasticity problems including those with inhomogeneous materials, complex loading, and complicated geometry. Copyright © 2002 John Wiley & Sons, Ltd.     

Prediction of Undrained Sinkhole Collapse

Sinkholes are surface depressions or shafts resulting from the collapse of a submerged cavity in soil. The cavities that lead to sinkholes form as a result of underlying geology in limestone areas, or as a result of human activity such as mining or leakage from a sewer. The formation of sinkholes is often sudden and can lead to extensive damage and loss of life, especially in urban areas. Much of the literature on the subject of sinkhole formation is empirical in nature, often being associated with specific locations. This paper presents the results of a study, using numerical modeling, of the undrained stability of the submerged cavities that lead to sinkhole formation. Finite-element limit analysis techniques (using programs developed at the University of Newcastle) are used to obtain upper and lower bound values of a suitable load parameter, which bracket the exact solution. The results are compared to analytical solutions, both from literature and derived independently.     

Time stepping schemes for coupled displacement and pore pressurē analysis

 The paper investigates the performance of various time stepping schemes for coupled displacement and pore pressure analysis. A number of alternative forms of the automatic time stepping method proposed by Sloan and Abbo (1999a) are also presented. These alternative schemes use different updates for the displacements and pore pressures and also adopt different starting conditions for the iterations. The automatic schemes are compared with an implicit θ-method, as well as an explicit method, through analysis of a variety of problems involving undrained loading, drained loading, and consolidation for Mohr-Coulomb and critical state models. As expected, the numerical results confirm that the explicit scheme is neither accurate nor robust. Although the implicit θ-method is accurate and fast, it fails to give a solution in a number of cases where the time step is large. The automatic schemes are shown to be accurate, fast and generally robust. Two of the automatic schemes proposed never fail to furnish a solution for the cases considered. In addition, all the automatic schemes are able to constrain the time-stepping (temporal integration) error in the displacements and pore pressures to lie near a prescribed tolerance, provided the iteration error tolerance is properly chosen. For complex soil models, it is important that the latter is set sufficiently small in order for the schemes to be able to constrain the time-stepping error to lie within a prescribed tolerance. Dedicated to the memory of Prof. Mike Crisfield, for his cheerfulness and cooperation as a colleague and friend over many years.     

A Closer Examination of the Structured Written Disclosure Procedure.

The current study examined psychological and physical health outcomes of the written disclosure paradigm and the hypothesis that the principles of therapeutic exposure account for the beneficial effects of the paradigm. Participants were randomly assigned to either a written disclosure condition or a control condition. Reactivity to the writing sessions was examined using both subjective and physiological measures. Measures of psychological and physical health were completed before and 1 month after the sessions. Participants assigned to the disclosure condition reported fewer psychological and physical symptoms at follow-up compared with control participants, though reductions were clinically significant for only 1 outcome measure. Physiological activation to the 1st disclosure session was associated with reduced psychological symptoms at follow-up for disclosure participants. Subjective reports of emotional responding corresponded with physiological reactivity. Implications of these findings are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Integration of Tresca and Mohr–Coulomb constitutive relations in plane strain elastoplasticity

This paper considers the problem of integrating the constitutive relations for Tresca and Mohr–Coulomb materials under conditions of plane strain. In the case of a Tresca material, we show that the constitutive law may be integrated exactly by assuming the strain rates d?/dλ to be constant. We also derive a semi-analytic method for integrating both types of constitutive law which assumes that the quantities d?/dλ are constant. This approach is motivated by the fact that the exact variation of the strains during a time interval is unknown and leads to a single non-linear equation in λ which can be solved efficiently to yield the unknown stresses. Finally, we compare the results from the analytic and semi-analytic methods with those from a variety of numerical integration schemes.     

Least Squares Vertex Baking

We investigate the representation of signals defined on triangle meshes using linearly interpolated vertex attributes. Compared to texture mapping, storing data only at vertices yields significantly lower memory overhead and less expensive runtime reconstruction. However, standard approaches to determine vertex values such as point sampling or averaging triangle samples lead to suboptimal approximations. We discuss how an optimal solution can be efficiently calculated using continuous least‐squares. In addition, we propose a regularization term that allows us to minimize gradient discontinuities and mach banding artifacts while staying close to the optimum. Our method has been integrated in a game production lighting tool and we present examples of representing signals such as ambient occlusion and precomputed radiance transfer in real game scenes, where vertex baking was used to free up resources for other game components.     

Example Based Everyting

The magic of computer graphics as seen in many current movies and computer games comes at a cost. Creating the geometric forms with which to generate synthetic characters and animating the characters to bring them to life require either highly skilled artists and/or sophisticated capture devices. Both are expensive and, in the case of highly skilled artists, rare.