Effects of phosphorus on the growth and nitrogen fixation rates of Lyngbya majuscula: implications for management in Moreton Bay, Queensland

Significant acetylene reduction and therefore N-2 fixation was observed for Lyngbya majuscula only during dark periods, which suggests that oxygenic photosynthesis and N-2 fixation are incompatible processes for this species. Results from a series of batch and continuous-flow-culture reactor studies showed that the specific growth rate and N-2 fixation rate of L, majuscula increased with phosphate (P-PO4) concentration up to a maximum value and thereafter remained constant. The P-PO4 concentrations corresponding to the maximum N-2 fixation and maximum growth rates were -0.27 and -0.18 muM respectively and these values are denoted as the saturation values for N-2 fixation and growth respectively. Regular monitoring studies in Moreton Bay, Queensland, show that concentrations Of P-PO4 generally exceed these saturation values over a large portion of the Bay and therefore, the growth of the bloom-forming L, majuscula is potentially maximised throughout much of the Bay by the elevated P-PO4 concentrations. Results from other studies suggest that the elevated P-PO4 concentrations in the Bay can be largely attributed to discharges from waste-water treatment plants (WWTPs), and thus it is proposed that the control of the growth of L. majuscula in Moreton Bay will require a significant reduction in the P load from the WWTP discharges. If the current strategy of N load reduction for these discharges is maintained in the absence of substantial P load reduction, it is hypothesised that the growth of L, majuscula and other diazotrophs in Moreton Bay will increase in the future.

Body-mass management of Australian lightweight rowers prior to and during competition

Purpose: Although the body-mass management strategies of athletes in high-participation weight-category sports such as wrestling have been thoroughly investigated, little is known about such practices among lightweight rowers. This study examined the body-mass management practices of lightweight rowers before competition and compared these with current guidelines of the International Federation of Rowing Association (FISA). Quantification of nutrient intake in the 1-2 h between weigh-in and racing was also sought. Methods: Lightweight rowers (N = 100) competing in a national regatta completed a questionnaire that assessed body-mass management practices during the 4 wk before and throughout a regatta plus recovery strategies after weigh-in. Biochemical data were collected immediately after weigh-in to validate questionnaire responses. Responses were categorized according to gender and age category (Senior B or younger than 23 yr old, i.e., U23, Senior A or OPEN, i.e., open age limit) for competition. Results: Most athletes (male U23 76.5%, OPEN 92.3%; female U23 84.0%, OPEN 94.1%) decreased their body mass in the weeks before the regatta at rates compliant with FISA guidelines. Gradual dieting, fluid restriction, and increased training load were the most popular methods of body-mass management. Although the importance of recovery after weigh-in was recognized by athletes, nutrient intake and especially sodium (male U23 5.3 ± 4.9, OPEN 7.7 ± 5.9; female U23 5.7 ± 6.8, OPEN 10.2 ± 5.4 mg-kg(-1)) and fluid intake (male U23 12.1 ± 7.1, OPEN 13.5 ± 8.1; female U23 9.4 ± 7.4, OPEN 14.8 ± 6.9 mL.kg(-1)) were below current sports nutrition recommendations. Conclusion: Few rowers were natural lightweights; the majority reduced their body mass in the weeks before a regatta. Nutritional recovery strategies implemented by lightweight rowers after weigh-in were not consistent with current guidelines.

A study of adaptive load balancing algorithms for distributed systems

With the advent of distributed computer systems with a largely transparent user interface, new questions have arisen regarding the management of such an environment by an operating system. One fertile area of research is that of load balancing, which attempts to improve system performance by redistributing the workload submitted to the system by the users. Early work in this field concentrated on static placement of computational objects to improve performance, given prior knowledge of process behaviour. More recently this has evolved into studying dynamic load balancing with process migration, thus allowing the system to adapt to varying loads. In this thesis, we describe a simulated system which facilitates experimentation with various load balancing algorithms. The system runs under UNIX and provides functions for user processes to communicate through software ports; processes reside on simulated homogeneous processors, connected by a user-specified topology, and a mechanism is included to allow migration of a process from one processor to another. We present the results of a study of adaptive load balancing algorithms, conducted using the aforementioned simulated system, under varying conditions; these results show the relative merits of different approaches to the load balancing problem, and we analyse the trade-offs between them. Following from this study, we present further novel modifications to suggested algorithms, and show their effects on system performance.

The relative performance of scalable load balancing algorithms in loosely-coupled distributed systems. Available in 2 volumes.

The computer systems of today are characterised by data and program control that are distributed functionally and geographically across a network. A major issue of concern in this environment is the operating system activity of resource management for different processors in the network. To ensure equity in load distribution and improved system performance, load balancing is often undertaken. The research conducted in this field so far, has been primarily concerned with a small set of algorithms operating on tightly-coupled distributed systems. More recent studies have investigated the performance of such algorithms in loosely-coupled architectures but using a small set of processors. This thesis describes a simulation model developed to study the behaviour and general performance characteristics of a range of dynamic load balancing algorithms. Further, the scalability of these algorithms are discussed and a range of regionalised load balancing algorithms developed. In particular, we examine the impact of network diameter and delay on the performance of such algorithms across a range of system workloads. The results produced seem to suggest that the performance of simple dynamic policies are scalable but lack the load stability of more complex global average algorithms.

Management of services differentiation and guarantee in IEEE 802.11e wireless LANs

In this paper, we study the management and control of service differentiation and guarantee based on enhanced distributed function coordination (EDCF) in IEEE 802.11e wireless LANs. Backoff-based priority schemes are the major mechanism for Quality of Service (QoS) provisioning in EDCF. However, control and management of the backoff-based priority scheme are still challenging problems. We have analysed the impacts of backoff and Inter-frame Space (IFS) parameters of EDCF on saturation throughput and service differentiation. A centralised QoS management and control scheme is proposed. The configuration of backoff parameters and admission control are studied in the management scheme. The special role of access point (AP) and the impact of traffic load are also considered in the scheme. The backoff parameters are adaptively re-configured to increase the levels of bandwidth guarantee and fairness on sharing bandwidth. The proposed management scheme is evaluated by OPNET. Simulation results show the effectiveness of the analytical model based admission control scheme. ©2005 IEEE.

Performance management of event processing systems

This thesis is a study of performance management of Complex Event Processing (CEP) systems. Since CEP systems have distinct characteristics from other well-studied computer systems such as batch and online transaction processing systems and database-centric applications, these characteristics introduce new challenges and opportunities to the performance management for CEP systems. Methodologies used in benchmarking CEP systems in many performance studies focus on scaling the load injection, but not considering the impact of the functional capabilities of CEP systems. This thesis proposes the approach of evaluating the performance of CEP engines’ functional behaviours on events and develops a benchmark platform for CEP systems: CEPBen. The CEPBen benchmark platform is developed to explore the fundamental functional performance of event processing systems: filtering, transformation and event pattern detection. It is also designed to provide a flexible environment for exploring new metrics and influential factors for CEP systems and evaluating the performance of CEP systems. Studies on factors and new metrics are carried out using the CEPBen benchmark platform on Esper. Different measurement points of response time in performance management of CEP systems are discussed and response time of targeted event is proposed to be used as a metric for quality of service evaluation combining with the traditional response time in CEP systems. Maximum query load as a capacity indicator regarding to the complexity of queries and number of live objects in memory as a performance indicator regarding to the memory management are proposed in performance management of CEP systems. Query depth is studied as a performance factor that influences CEP system performance.

Using cognitive load theory to interpret student difficulties with a problem-based learning approach to engineering education:a case study

This article reports on an investigationwith first year undergraduate ProductDesign and Management students within a School of Engineering and Applied Science. The students at the time of this investigation had studied fundamental engineering science and mathematics for one semester. The students were given an open ended, ill-formed problem which involved designing a simple bridge to cross a river.They were given a talk on problemsolving and given a rubric to follow, if they chose to do so.They were not given any formulae or procedures needed in order to resolve the problem. In theory, they possessed the knowledge to ask the right questions in order tomake assumptions but, in practice, it turned out they were unable to link their a priori knowledge to resolve this problem. They were able to solve simple beam problems when given closed questions. The results show they were unable to visualize a simple bridge as an augmented beam problem and ask pertinent questions and hence formulate appropriate assumptions in order to offer resolutions.

An improved memory management scheme for large scale graph computing engine GraphChi

GraphChi is the first reported disk-based graph engine that can handle billion-scale graphs on a single PC efficiently. GraphChi is able to execute several advanced data mining, graph mining and machine learning algorithms on very large graphs. With the novel technique of parallel sliding windows (PSW) to load subgraph from disk to memory for vertices and edges updating, it can achieve data processing performance close to and even better than those of mainstream distributed graph engines. GraphChi mentioned that its memory is not effectively utilized with large dataset, which leads to suboptimal computation performances. In this paper we are motivated by the concepts of 'pin ' from TurboGraph and 'ghost' from GraphLab to propose a new memory utilization mode for GraphChi, which is called Part-in-memory mode, to improve the GraphChi algorithm performance. The main idea is to pin a fixed part of data inside the memory during the whole computing process. Part-in-memory mode is successfully implemented with only about 40 additional lines of code to the original GraphChi engine. Extensive experiments are performed with large real datasets (including Twitter graph with 1.4 billion edges). The preliminary results show that Part-in-memory mode memory management approach effectively reduces the GraphChi running time by up to 60% in PageRank algorithm. Interestingly it is found that a larger portion of data pinned in memory does not always lead to better performance in the case that the whole dataset cannot be fitted in memory. There exists an optimal portion of data which should be kept in the memory to achieve the best computational performance.

Semantic distributed database management with applications to the Internet dissemination of environmental data

The research presented in this dissertation is comprised of several parts which jointly attain the goal of Semantic Distributed Database Management with Applications to Internet Dissemination of Environmental Data. ^ Part of the research into more effective and efficient data management has been pursued through enhancements to the Semantic Binary Object-Oriented database (Sem-ODB) such as more effective load balancing techniques for the database engine, and the use of Sem-ODB as a tool for integrating structured and unstructured heterogeneous data sources. Another part of the research in data management has pursued methods for optimizing queries in distributed databases through the intelligent use of network bandwidth; this has applications in networks that provide varying levels of Quality of Service or throughput. ^ The application of the Semantic Binary database model as a tool for relational database modeling has also been pursued. This has resulted in database applications that are used by researchers at the Everglades National Park to store environmental data and to remotely-sensed imagery. ^ The areas of research described above have contributed to the creation TerraFly, which provides for the dissemination of geospatial data via the Internet. TerraFly research presented herein ranges from the development of TerraFly's back-end database and interfaces, through the features that are presented to the public (such as the ability to provide autopilot scripts and on-demand data about a point), to applications of TerraFly in the areas of hazard mitigation, recreation, and aviation. ^

System design and resource management in the next-generation integrated WLAN and 3G cellular networks

Next-generation integrated wireless local area network (WLAN) and 3G cellular networks aim to take advantage of the roaming ability in a cellular network and the high data rate services of a WLAN. To ensure successful implementation of an integrated network, many issues must be carefully addressed, including network architecture design, resource management, quality-of-service (QoS), call admission control (CAC) and mobility management. ^ This dissertation focuses on QoS provisioning, CAC, and the network architecture design in the integration of WLANs and cellular networks. First, a new scheduling algorithm and a call admission control mechanism in IEEE 802.11 WLAN are presented to support multimedia services with QoS provisioning. The proposed scheduling algorithms make use of the idle system time to reduce the average packet loss of realtime (RT) services. The admission control mechanism provides long-term transmission quality for both RT and NRT services by ensuring the packet loss ratio for RT services and the throughput for non-real-time (NRT) services. ^ A joint CAC scheme is proposed to efficiently balance traffic load in the integrated environment. A channel searching and replacement algorithm (CSR) is developed to relieve traffic congestion in the cellular network by using idle channels in the WLAN. The CSR is optimized to minimize the system cost in terms of the blocking probability in the interworking environment. Specifically, it is proved that there exists an optimal admission probability for passive handoffs that minimizes the total system cost. Also, a method of searching the probability is designed based on linear-programming techniques. ^ Finally, a new integration architecture, Hybrid Coupling with Radio Access System (HCRAS), is proposed for lowering the average cost of intersystem communication (IC) and the vertical handoff latency. An analytical model is presented to evaluate the system performance of the HCRAS in terms of the intersystem communication cost function and the handoff cost function. Based on this model, an algorithm is designed to determine the optimal route for each intersystem communication. Additionally, a fast handoff algorithm is developed to reduce the vertical handoff latency.^

Resource management and optimization in wireless mesh networks

A wireless mesh network is a mesh network implemented over a wireless network system such as wireless LANs. Wireless Mesh Networks(WMNs) are promising for numerous applications such as broadband home networking, enterprise networking, transportation systems, health and medical systems, security surveillance systems, etc. Therefore, it has received considerable attention from both industrial and academic researchers. This dissertation explores schemes for resource management and optimization in WMNs by means of network routing and network coding.^ In this dissertation, we propose three optimization schemes. (1) First, a triple-tier optimization scheme is proposed for load balancing objective. The first tier mechanism achieves long-term routing optimization, and the second tier mechanism, using the optimization results obtained from the first tier mechanism, performs the short-term adaptation to deal with the impact of dynamic channel conditions. A greedy sub-channel allocation algorithm is developed as the third tier optimization scheme to further reduce the congestion level in the network. We conduct thorough theoretical analysis to show the correctness of our design and give the properties of our scheme. (2) Then, a Relay-Aided Network Coding scheme called RANC is proposed to improve the performance gain of network coding by exploiting the physical layer multi-rate capability in WMNs. We conduct rigorous analysis to find the design principles and study the tradeoff in the performance gain of RANC. Based on the analytical results, we provide a practical solution by decomposing the original design problem into two sub-problems, flow partition problem and scheduling problem. (3) Lastly, a joint optimization scheme of the routing in the network layer and network coding-aware scheduling in the MAC layer is introduced. We formulate the network optimization problem and exploit the structure of the problem via dual decomposition. We find that the original problem is composed of two problems, routing problem in the network layer and scheduling problem in the MAC layer. These two sub-problems are coupled through the link capacities. We solve the routing problem by two different adaptive routing algorithms. We then provide a distributed coding-aware scheduling algorithm. According to corresponding experiment results, the proposed schemes can significantly improve network performance.^

How does problem based learning fit with cognitive load theory?

This paper reports on an investigation with first year undergraduate Product Design and Management students within a School of Engineering. The students at the time of this investigation had studied fundamental engineering science and mathematics for one semester. The students were given an open ended, ill formed problem which involved designing a simple bridge to cross a river. They were given a talk on problem solving and given a rubric to follow, if they chose to do so. They were not given any formulae or procedures needed in order to resolve the problem. In theory, they possessed the knowledge to ask the right questions in order to make assumptions but, in practice, it turned out they were unable to link their a priori knowledge to resolve this problem. They were able to solve simple beam problems when given closed questions. The results show they were unable to visualise a simple bridge as an augmented beam problem and ask pertinent questions and hence formulate appropriate assumptions in order to offer resolutions.

Functional management of ankle sprains: what volume and intensity of walking is undertaken in the first week

BACKGROUND:
Acute ankle sprains are usually managed functionally, with advice to undertake progressive weight-bearing and walking. Mechanical loading is an important modular of tissue repair; therefore, the clinical effectiveness of walking after ankle sprain may be dose dependent. The intensity, magnitude and duration of load associated with current functional treatments for ankle sprain are unclear.
AIM:
To describe physical activity (PA) in the first week after ankle sprain and to compare results with a healthy control group.
METHODS:
Participants (16-65 years) with an acute ankle sprain were randomised into two groups (standard or exercise). Both groups were advised to apply ice and compression, and walk within the limits of pain. The exercise group undertook additional therapeutic exercises. PA was measured using an activPAL accelerometer, worn for 7 days after injury. Comparisons were made with a non-injured control group.
RESULTS:
The standard group were significantly less active (1.2 ± 0.4 h activity/day; 5621 ± 2294 steps/day) than the exercise (1.7 ± 0 .7 h/day, p=0.04; 7886 ± 3075 steps/day, p=0.03) and non-injured control groups (1.7 ± 0.4 h/day, p=0.02; 8844 ± 2185 steps/day, p=0.002). Also, compared with the non-injured control group, the standard and exercise groups spent less time in moderate (38.3 ± 12.7 min/day vs 14.5 ± 11.4 min/day, p=0.001 and 22.5 ± 15.9 min/day, p=0.003) and high-intensity activity (4.1 ± 6.9 min/day vs 0.1 ± 0.1 min/day, p=0.001 and 0.62 ± 1.0 min/day p=0.005).
CONCLUSION:
PA patterns are reduced in the first week after ankle sprain, which is partly ameliorated with addition of therapeutic exercises. This study represents the first step towards developing evidence-based walking prescription after acute ankle sprain.

Low- vs. high-glycemic load diets: effects on postprandial plasma free fatty acids

Thesis (Master's)--University of Washington, 2016-06