http://nova.newcastle.edu.au/vital/access/services/Feed ${session.getAttribute("locale")} 5 http://nova.newcastle.edu.au/vital/access/manager/Repository/uon:12807 We consider the optimization problem defined on a connected undirected graph with given root vertex and a parameter s̅, in which we seek a spanning tree with the smallest number of special (amplifying) vertices such that each vertex in the tree is preceded on its unique path from the root vertex by an amplifying vertex no more than s̅ edges distant. This problem, which we called the amplified spanning tree (AST) problem, is motivated by a practical problem in local access television cable networks. We show that even restricted to planar graphs with no vertex degree exceeding four, AST is NP-complete for every fixed s̅ ≥ 1. Making use of a connection with distance domination problems, we show that two related problems, including total distance domination, are also NP-complete and we derive an approximately upper bound for AST. 2013-04-26T01:01:33.029Z ]]> http://nova.newcastle.edu.au/vital/access/manager/Repository/uon:8957 This paper aims to describe a finite element model which will be used to investigate the stress distribution and reaction loads in fabric reinforced conveyor belt using the finite element analysis technique. These stress distributions will then be compared with a similarly proportioned finite element model of a cable reinforced conveyor belt. The finite element analysis results indicate that the stress levels in the bottom cover of a fabric reinforced conveyor belt increase with an increasing number of fabric plies and that the peak stresses in cable reinforced conveyor belt are greater than those found in fabric reinforced conveyor belt. 2011-09-15T05:30:23.246Z ]]>