In this research report I address the question: Is it ever morally justified to cull elephants? And, if it is, what criteria need to be fulfilled for a cull to be morally justifiable? In answering the first part of the question, ‘Is it ever morally correct to cull elephants?’ I defend the claim that the killing of elephants is a pro tanto wrong. The second part of the question, ‘What criteria need to be fulfilled for a cull to be morally justifiable?’, directs my attention to identifying conditions under which the pro tanto wrong of killing elephants could be outweighed by other moral considerations. I identify and critically discuss these criteria, developing what I call a ‘Theory of a Just Cull’. Finally, I apply my Theory to the current situation in South Africa, and argue that it is not possible to ethically justify elephant culling in South Africa in the current circumstances.

No description available.

Many graphics applications today have need for high-speed 3-D visualization of height fields. Most of these applications deal with the display of digital terrain models characterized by a simple, but vast, non-overlapping mesh of triangles. A great deal of research has been done to find methods of optimizing such systems. The goal of this work is to establish an algorithm to efficiently preprocess a hierarchical height field model that enables the real-time culling of occluded geometry while still allowing for classic terrain-rendering frameworks. By exploiting the planar-monotone characteristics of height fields, it is possible to create a unique and efficient occlusion culling method that is optimized for terrain rendering and similar applications. Previous work has shown that culling is possible with certain regularly-gridded height field models, but not until now has a system been shown to work with all height fields, regardless of how their meshes are constructed. By freeing the system of meshing restrictions, it is possible to incorporate a number of broader height field algorithms with widely-used applications such as flight simulators, GIS systems, and computer games.

Many graphics applications today have need for high-speed 3-D visualization of height fields. Most of these applications deal with the display of digital terrain models characterized by a simple, but vast, non-overlapping mesh of triangles. A great deal of research has been done to find methods of optimizing such systems. The goal of this work is to establish an algorithm to efficiently preprocess a hierarchical height field model that enables the real-time culling of occluded geometry while still allowing for classic terrain-rendering frameworks. By exploiting the planar-monotone characteristics of height fields, it is possible to create a unique and efficient occlusion culling method that is optimized for terrain rendering and similar applications. Previous work has shown that culling is possible with certain regularly-gridded height field models, but not until now has a system been shown to work with all height fields, regardless of how their meshes are constructed. By freeing the system of meshing restrictions, it is possible to incorporate a number of broader height field algorithms with widely-used applications such as flight simulators, GIS systems, and computer games.

No description available.

An expert system for identifying cows to be culled, MAXCULL, was programmed to run on an IBM or compatible personal computer . It was designed to be used with Dairy Herd Improvement (DHI) records as an aid in decision making. MAXCULL used fifty-two health, seventeen reproduction, and thirty-nine production rules in the analysis. MAXCULL was initially developed using two expert system tools. VP-Expert and Super Expert both had inductive abilities and were reasonably priced . VP - Expert was selected to continue the development of the MAXCULL system . The program u sed a rule-based method of storing knowledge, which was obtained from literature reviewed in the health, reproduction and management areas. Three blocks of rules were developed. MAXCULL used a backward- chaining control strategy. The information on each cow was obtained from a special report obtained from DHI Provo . The diagnosis from MAXCULL produced an explanation paragraph identifying possible reasons for removing the cow. Twenty herds with DHI records were identified, ten assigned as controls and ten to be evaluated with the MAXCULL system . General linear model procedures were used to compare thirteen variables after using MAXCULL for one year. No significant differences were noted for any of the variables. The chi- square analysis showed that the decisions of MAXCULL were significantly different from the decisions of the manager. The final survey supports the idea that dairy management expertise can be provided to the dairy manager through an expert system.

Detailed and exact collision detection for large amounts of objects has for a long time been a non real-time affair because of the immense amount of computations necessary. This was however not only because of the complexity of the algorithms but also because discussed of the computations would not have had to be done in the first place. This paper has through literature research and empirical testing examined two different broad phase approaches to object culling in a three dimensional environment. The aim of such a broad phase algorithm is to decrease the amount of computation heavy narrow phase collision detection checks and thus enhancing application performance. Potential weaknesses of these approaches were addressed and possible solutions discussed. Performance comparisons were made to give a better overview of what kind of performance enhancements can be expected and to give a theoretical base for further research.

Diss. (sammanfattning) Uppsala : Sveriges lantbruksuniversitet, 2008. / Härtill 4 uppsatser.

The thesis deals with analysis the influence to effectiveness of Holstein cows bred on the School farm in Haklovy Dvory. I studied the most frequent reasons of culling cows on the farm and the influence on the cost accounts.

Context. In this thesis, a GPU-based light culling technique performed with conservative rasterization is presented. Accurate lighting calculations are expensive in real-time applications and the number of lights used in a typical virtual scene increases as real-time applications become more advanced. Performing light culling prior to shading a scene has in recent years become a vital part of any high-end rendering pipeline. Existing light culling techniques suffer from a variety of problems which clustered shading tries to address. Objectives. The main goal of this thesis is to explore the use of the rasterizer to efficiently assign convex light shapes to clusters. Being able to accurately represent and assign light volumes to clusters is a key objective in this thesis. Methods. This method is designed for real-time applications that use large amounts of dynamic and arbitrarily shaped convex lights. By using using conservative rasterization to assign convex light volumes to a 3D cluster structure, a more suitable light volume approximation can be used. This thesis implements a novel light culling technique in DirectX 12 by taking advantage of the hardware conservative rasterization provided by the latest consumer grade Nvidia GPUs. Experiments are conducted to prove the efficiency of the implementation and comparisons with AMD´s Forward+ tiled light culling are provided to relate the implementation to existing techniques. Results. The results from analyzing the algorithm shows that most problems with existing light culling techniques are addressed and the light assignment is of high quality and allows for easy integration of new convex light types. Assigning the lights and shading the CryTek Sponza scene with 2000 point lights and 2000 spot lights takes 2.92ms on a GTX970. Conclusions. The conclusion shows that the main goal of the thesis has been reached to the extent that all existing problems with current light culling techniques have been solved, at the cost of using more memory. The technique is novel and a lot of future work is outlined and would benefit the validity of the implementation if further researched.