Mutual protection in a cloud computing environment

The term “cloud computing” has emerged as a major ICT trend and has been acknowledged by respected industry survey organizations as a key technology and market development theme for the industry and ICT users in 2010. However, one of the major challenges that faces the cloud computing concept and its global acceptance is how to secure and protect the data and processes that are the property of the user. The security of the cloud computing environment is a new research area requiring further development by both the academic and industrial research communities. Today, there are many diverse and uncoordinated efforts underway to address security issues in cloud computing and, especially, the identity management issues. This paper introduces an architecture for a new approach to necessary “mutual protection” in the cloud computing environment, based upon a concept of mutual trust and the specification of definable profiles in vector matrix form. The architecture aims to achieve better, more generic and flexible authentication, authorization and control, based on a concept of mutuality, within that cloud computing environment.

Regulation of train service by coasting control in metro railway system

To maximise the capacity of the rail lineand provide a reliable service for pas-sengers throughout the day, regulation of train service to maintain steady service headway is es-sential. In most current metro systems, train usually starts coasting at a fixed distance from the departed station to achieve service regulation. However, this approach is only effective with re-spect to a nominal operational condition of train schedule but not necessarily the current service demand. Moreover, it is not simply to identify the necessary starting point for coasting under the run time constraints of current service conditions since train movement is attributed by a large number of factors, most of which are non-linear and inter-dependent. This paper presents an ap-plication of classical measures to search for the appropriate coasting point to meet a specified inter-station run time and they can be integrated in the on-board Automatic Train Operation (ATO) system and have the potential for on-line implementation in making a set of coasting command decisions.

Coast control of train movement with genetic algorithms

Railway service is now the major transportation means in most of the countries around the world. With the increasing population and expanding commercial and industrial activities, a high quality of railway service is the most desirable. We present an application of genetic algorithms (GA) to search for the appropriate coasting point(s) and investigate the possible improvement on fitness of genes. Single and multiple coasting point control with simple GA are developed to attain the solutions and their corresponding train movement is examined. The multiple coasting point control with hierarchical genetic algorithm (HGA) is then proposed to integrate the determination of the number of coasting points.

Deflection control in composite building by using belt truss and outriggers system

The design of high-rise building is more often dictated by its serviceability rather than strength. Structural Engineers are always striving to overcome challenges of controlling lateral deflection and storey drifts as well as self weight of structure imposed on foundation. One of the most effective techniques is the use of outrigger and belt truss system in Composite structures that can astutely solve the above two issues in High-rise constructions. This paper investigates deflection control by effective utilisation of belt truss and outrigger system on a 60-storey composite building subjected to wind loads. A three dimensional Finite Element Analysis is performed with one, two and three outrigger levels. The reductions in deflection are 34 percent, 42 percent and 51 percent respectively as compared to a model without any outrigger system. There is an appreciable decline in the storey drifts with the introduction of these stiffer arrangements.

Identifying parents' perceptions about physical activity : a qualitative exploration of salient behavioural, normative and control beliefs among mothers and fathers of young children

Drawing on the belief-based framework of the Theory of Planned Behaviour, this study employs qualitative methodology involving individual and group interviews to examine the beliefs associated with regular physical activity performance among parents of young children (N = 40). The data were analysed using thematic content analysis. A range of advantages (e.g. improves parenting practices), disadvantages (e.g. interferes with commitments), barriers (e.g. time), and facilitators (e.g. social support) to performing physical activity are identified. Normative pressures are also identified as affecting parents’ activity behaviour. These identified beliefs can be used to inform interventions to challenge inactivity among this at-risk group.

A study of the generalised max–min fair rate allocation for ABR control in ATM

In the rate-based flow control for ATM Available Bit Rate service, fairness is an important requirement, i.e. each flow should be allocated a fair share of the available bandwidth in the network. Max–min fairness, which is widely adopted in ATM, is appropriate only when the minimum cell rates (MCRs) of the flows are zero or neglected. Generalised max–min (GMM) fairness extends the principle of the max–min fairness to accommodate MCR. In this paper, we will discuss the formulation of the GMM fair rate allocation, propose a centralised algorithm, analyse its bottleneck structure and develop an efficient distributed explicit rate allocation algorithm to achieve the GMM fairness in an ATM network. The study in this paper addresses certain theoretical and practical issues of the GMM fair rate allocation.

Weighted fairness with MCR guarantee and a general-purpose explicit rate allocation algorithm for ATM ABR service

In this paper, weighted fair rate allocation for ATM available bit rate (ABR) service is discussed with the concern of the minimum cell rate (MCR). Weighted fairness with MCR guarantee has been discussed recently in the literature. In those studies, each ABR virtual connection (VC) is first allocated its MCR, then the remaining available bandwidth is further shared among ABR VCs according to their weights. For the weighted fairness defined in this paper, the bandwidth is first allocated according to each VC's weight; if a VC's weighted share is less than its MCR, it should be allocated its MCR instead of the weighted share. This weighted fairness with MCR guarantee is referred to as extended weighted (EXW) fairness. Certain theoretical issues related to EXW, such as its global solution and bottleneck structure, are first discussed in the paper. A distributed explicit rate allocation algorithm is then proposed to achieve EXW fairness in ATM networks. The algorithm is a general-purpose explicit rate algorithm in the sense that it can realise almost all the fairness principles proposed for ABR so far whilst only minor modifications may be needed.

Fair flow control of ABR service by per-VC virtual queuing

In this paper, a rate-based flow control scheme based upon per-VC virtual queuing is proposed for the Available Bit Rate (ABR) service in ATM. In this scheme, each VC in a shared buffer is assigned a virtual queue, which is a counter. To achieve a specific kind of fairness, an appropriate scheduler is applied to the virtual queues. Each VC's bottleneck rate (fair share) is derived from its virtual cell departure rate. This approach of deriving a VC's fair share is simple and accurate. By controlling each VC with respect to its virtual queue and queue build-up in the shared buffer, network congestion is avoided. The principle of the control scheme is first illustrated by max–min flow control, which is realised by scheduling the virtual queues in round-robin. Further application of the control scheme is demonstrated with the achievement of weighted fairness through weighted round robin scheduling. Simulation results show that with a simple computation, the proposed scheme achieves the desired fairness exactly and controls network congestion effectively.

Aboriginal community control and decolonizing health policy : a yarn from Australia

This chapter outlines: a brief history of Australian Aboriginal health and health policy and then moves on to demonstrate how the Victorian Aboriginal Community Controlled Health Organisation (VACCHO) undertakes its work and is an example of 'decolonizing policy in action'. Moreover, it highlights how Aboriginal participation in the development of policy and in the planning, delivery, management and evaluation of health programs enables policies and programs to respond effectively to the needs of Aboriginal people and to change future health outcomes for them. It showcases how Aboriginal decision-making has gone some way to decolonizing policymaking and has addressed the power imbalance - both of which have been critical in the improvement in Aboriginal health outcomes.

An enhanced explicit rate algorithm for ABR traffic control in ATM networks

A high performance, low computational complexity rate-based flow control algorithm which can avoid congestion and achieve fairness is important to ATM available bit rate service. The explicit rate allocation algorithm proposed by Kalampoukas et al. is designed to achieve max–min fairness in ATM networks. It has several attractive features, such as a fixed computational complexity of O(1) and the guaranteed convergence to max–min fairness. In this paper, certain drawbacks of the algorithm, such as the severe overload of an outgoing link during transient period and the non-conforming use of the current cell rate field in a resource management cell, have been identified and analysed; a new algorithm which overcomes these drawbacks is proposed. The proposed algorithm simplifies the rate computation as well. Compared with Kalampoukas's algorithm, it has better performance in terms of congestion avoidance and smoothness of rate allocation.

The relationship between substrate metabolism, exercise and appetite control : does glycogen availability influence the motivation to eat, energy intake or food choice?

The way in which metabolic fuels are utilised can alter the expression of behaviour in the interests of regulating energy balance and fuel availability. This is consistent with the notion that the regulation of appetite is a psychobiological process, in which physiological mediators act as drivers of behaviour. The glycogenostatic theory suggests that glycogen availability is central in eliciting negative feedback signals to restore energy homeostasis. Due to its limited storage capacity, carbohydrate availability is tightly regulated and its restoration is a high metabolic priority following depletion. It has been proposed that such depletion may act as a biological cue to stimulate compensatory energy intake in an effort to restore availability. Due to the increased energy demand, aerobic exercise may act as a biological cue to trigger compensatory eating as a result of perturbations to muscle and liver glycogen stores. However, studies manipulating glycogen availability over short-term periods (1-3 days) using exercise, diet or both have often produced equivocal findings. There is limited but growing evidence to suggest that carbohydrate balance is involved in the short-term regulation of food intake, with a negative carbohydrate balance having been shown to predict greater ad libitum feeding. Furthermore, a negative carbohydrate balance has been shown to be predictive of weight gain. However, further research is needed to support these findings as the current research in this area is limited. In addition, the specific neural or hormonal signal through which carbohydrate availability could regulate energy intake is at present unknown. Identification of this signal or pathway is imperative if a casual relationship is to be established. Without this, the possibility remains that the associations found between carbohydrate balance and food intake are incidental.

Coasting control of train operation by genetic algorithm

Balancing between the provision of high quality of service and running within a tight budget is one of the biggest challenges for most metro railway operators around the world. Conventionally, one possible approach for the operator to adjust the time schedule is to alter the stop time at stations, if other system constraints, such as traction equipment characteristic, are not taken into account. Yet it is not an effective, flexible and economical method because the run-time of a train simply cannot be extended without limitation, and a balance between run-time and energy consumption has to be maintained. Modification or installation of a new signalling system not only increases the capital cost, but also affects the normal train service. Therefore, in order to procure a more effective, flexible and economical means to improve the quality of service, optimisation of train performance by coasting point identification has become more attractive and popular. However, identifying the necessary starting points for coasting under the constraints of current service conditions is no simple task because train movement is attributed by a large number of factors, most of which are non-linear and inter-dependent. This paper presents an application of genetic algorithms (GA) to search for the appropriate coasting points and investigates the possible improvement on computation time and fitness of genes.

Developing spatial infrastructures for the Q.U.T. Samford Ecological Research Facility.

Staff and students of the Surveying and Spatial Sciences discipline at QUT have worked collaboratively with the Institute of Sustainable Resources in the creation and development of spatial information layers and infrastructure to support multi-disciplinary research efforts at the Samford Ecological Research Facility (SERF). The SERF property is unique in that it provides staff and students with a semi-rural controlled research base for multiple users. This paper aims to describe the development of a number of spatial information layers and network of survey monuments that assist and support research infrastructure at SERF. A brief historical background about the facility is presented along with descriptions of the surveying and mapping activities undertaken. These broad ranging activities include introducing monument infrastructure and a geodetic control network; surveying activities for aerial photography ground-control targets including precise levelling with barcode instruments; development of an ortho-rectified image spatial information layer; Real-Time-Kinematic Global Positioning Systems (RTK-GPS) surveying for constructing 100metre confluence points/monuments to support science-based disciplines to undertake environmental research transects and long-term ecological sampling; and real-world learning initiative to assist with water engineering projects and student experiential learning. The spatial information layers and physical infrastructure have been adopted by two specific yet diverse user groups with an interest in the long-term research focus of SERF.

Output feedback control of discrete-time systems in networked environments

This correspondence paper addresses the problem of output feedback stabilization of control systems in networked environments with quality-of-service (QoS) constraints. The problem is investigated in discrete-time state space using Lyapunov’s stability theory and the linear inequality matrix technique. A new discrete-time modeling approach is developed to describe a networked control system (NCS) with parameter uncertainties and nonideal network QoS. It integrates a network-induced delay, packet dropout, and other network behaviors into a unified framework. With this modeling, an improved stability condition, which is dependent on the lower and upper bounds of the equivalent network-induced delay, is established for the NCS with norm-bounded parameter uncertainties. It is further extended for the output feedback stabilization of the NCS with nonideal QoS. Numerical examples are given to demonstrate the main results of the theoretical development.

Generation evolution in GA application on railway traffic control

This paper presents a Genetic Algorithms (GA) approach to resolve traffic conflicts at a railway junction. The formulation of the problem for the suitable application of GA will be discussed and three neighborhoods have been proposed for generation evolution. The performance of the GA is evaluated by computer simulation. This study paves the way for more applications of artificial intelligence techniques on a rather conservative industry.