Delegation constraint management

The paper addresses the issue of providing access control via delegation and constraint management across multiple security domains. Specifically, this paper proposes a novel Delegation Constraint Management model to manage and enforce delegation constraints across security domains. An algorithm to trace the authority of delegation constraints is introduced as well as an algorithm to form a delegation constraint set and detect/prevent potential conflicts. The algorithms and the management model are built upon a set of formal definitions of delegation constraints. In addition, a constraint profile based on XACML is proposed as a means to express the delegation constraint. The paper also includes a protocol to exchange delegation constraints (in the form of user commitments) between the involved entities in the delegation process.

Modeling circulation of train-set with multiple routing

Planning on utilization of train-set is one of the key tasks of transport organization for passenger dedicated railway in China. It also has strong relationships with timetable scheduling and operation plans at a station. To execute such a task in a railway hub pooling multiple railway lines, the characteristics of multiple routing for train-set is discussed in term of semicircle of train-sets' turnover. In programming the described problem, the minimum dwell time is selected as the objectives with special derive constraints of the train-set's dispatch, the connecting conditions, the principle of uniqueness for train-sets, and the first plus for connection in the same direction based on time tolerance σ. A compact connection algorithm based on time tolerance is then designed. The feasibility of the model and the algorithm is proved by the case study. The result indicates that the circulation model and algorithm about multiple routing can deal with the connections between the train-sets of multiple directions, and reduce the train's pulling in or leaving impact on the station's throat.

A comparison of methods for classifying clinical samples based on proteomics data : a case study for statistical and machine learning approaches

The discovery of protein variation is an important strategy in disease diagnosis within the biological sciences. The current benchmark for elucidating information from multiple biological variables is the so called “omics” disciplines of the biological sciences. Such variability is uncovered by implementation of multivariable data mining techniques which come under two primary categories, machine learning strategies and statistical based approaches. Typically proteomic studies can produce hundreds or thousands of variables, p, per observation, n, depending on the analytical platform or method employed to generate the data. Many classification methods are limited by an n≪p constraint, and as such, require pre-treatment to reduce the dimensionality prior to classification. Recently machine learning techniques have gained popularity in the field for their ability to successfully classify unknown samples. One limitation of such methods is the lack of a functional model allowing meaningful interpretation of results in terms of the features used for classification. This is a problem that might be solved using a statistical model-based approach where not only is the importance of the individual protein explicit, they are combined into a readily interpretable classification rule without relying on a black box approach. Here we incorporate statistical dimension reduction techniques Partial Least Squares (PLS) and Principal Components Analysis (PCA) followed by both statistical and machine learning classification methods, and compared them to a popular machine learning technique, Support Vector Machines (SVM). Both PLS and SVM demonstrate strong utility for proteomic classification problems.

A penalty-based grouping genetic algorithm for multiple composite SaaS components clustering in Cloud

Software as a Service (SaaS) in Cloud is getting more and more significant among software users and providers recently. A SaaS that is delivered as composite application has many benefits including reduced delivery costs, flexible offers of the SaaS functions and decreased subscription cost for users. However, this approach has introduced a new problem in managing the resources allocated to the composite SaaS. The resource allocation that has been done at the initial stage may be overloaded or wasted due to the dynamic environment of a Cloud. A typical data center resource management usually triggers a placement reconfiguration for the SaaS in order to maintain its performance as well as to minimize the resource used. Existing approaches for this problem often ignore the underlying dependencies between SaaS components. In addition, the reconfiguration also has to comply with SaaS constraints in terms of its resource requirements, placement requirement as well as its SLA. To tackle the problem, this paper proposes a penalty-based Grouping Genetic Algorithm for multiple composite SaaS components clustering in Cloud. The main objective is to minimize the resource used by the SaaS by clustering its component without violating any constraint. Experimental results demonstrate the feasibility and the scalability of the proposed algorithm.

An accurate and reliable stereo matching algorithm incorporating the rank constraint

A fundamental problem faced by stereo vision algorithms is that of determining correspondences between two images which comprise a stereo pair. This paper presents work towards the development of a new matching algorithm, based on the rank transform. This algorithm makes use of both area-based and edge-based information, and is therefore referred to as a hybrid algorithm. In addition, this algorithm uses a number of matching constraints,including the novel rank constraint. Results obtained using a number of test pairs show that the matching algorithm is capable of removing a significant proportion of invalid matches. The accuracy of matching in the vicinity of edges is also improved.

A hybrid stereo matching algorithm incorporating the rank constraint

A fundamental problem faced by stereo vision algorithms is that of determining correspondences between two images which comprise a stereo pair. This paper presents work towards the development of a new matching algorithm, based on the rank transform. This algorithm makes use of both area-based and edge-based information, and is therefore referred to as a hybrid algorithm. In addition, this algorithm uses a number of matching constraints, including the novel rank constraint. Results obtained using a number of test pairs show that the matching algorithm is capable of removing most invalid matches. The accuracy of matching in the vicinity of edges is also improved.

Effects of air pollution exposure on adult bicycle commuters : an investigation of respiratory health, motorised traffic proximity and the utility of commute re-routing

Bicycle commuting has the potential to be an effective contributing solution to address some of modern society’s biggest issues, including cardiovascular disease, anthropogenic climate change and urban traffic congestion. However, individuals shifting from a passive to an active commute mode may be increasing their potential for air pollution exposure and the associated health risk. This project, consisting of three studies, was designed to investigate the health effects of bicycle commuters in relation to air pollution exposure, in a major city in Australia (Brisbane). The aims of the three studies were to: 1) examine the relationship of in-commute air pollution exposure perception, symptoms and risk management; 2) assess the efficacy of commute re-routing as a risk management strategy by determining the exposure potential profile of ultrafine particles along commute route alternatives of low and high proximity to motorised traffic; and, 3) evaluate the feasibility of implementing commute re-routing as a risk management strategy by monitoring ultrafine particle exposure and consequential physiological response from using commute route alternatives based on real-world circumstances; 3) investigate the potential of reducing exposure to ultrafine particles (UFP; < 0.1 µm) during bicycle commuting by lowering proximity to motorised traffic with real-time air pollution and acute inflammatory measurements in healthy individuals using their typical, and an alternative to their typical, bicycle commute route. The methods of the three studies included: 1) a questionnaire-based investigation with regular bicycle commuters in Brisbane, Australia. Participants (n = 153; age = 41 ± 11 yr; 28% female) reported the characteristics of their typical bicycle commute, along with exposure perception and acute respiratory symptoms, and amenability for using a respirator or re-routing their commute as risk management strategies; 2) inhaled particle counts measured along popular pre-identified bicycle commute route alterations of low (LOW) and high (HIGH) motorised traffic to the same inner-city destination at peak commute traffic times. During commute, real-time particle number concentration (PNC; mostly in the UFP range) and particle diameter (PD), heart and respiratory rate, geographical location, and meteorological variables were measured. To determine inhaled particle counts, ventilation rate was calculated from heart-rate-ventilation associations, produced from periodic exercise testing; 3) thirty-five healthy adults (mean ± SD: age = 39 ± 11 yr; 29% female) completed two return trips of their typical route (HIGH) and a pre-determined altered route of lower proximity to motorised traffic (LOW; determined by the proportion of on-road cycle paths). Particle number concentration (PNC) and diameter (PD) were monitored in real-time in-commute. Acute inflammatory indices of respiratory symptom incidence, lung function and spontaneous sputum (for inflammatory cell analyses) were collected immediately pre-commute, and one and three hours post-commute. The main results of the three studies are that: 1) healthy individuals reported a higher incidence of specific acute respiratory symptoms in- and post- (compared to pre-) commute (p < 0.05). The incidence of specific acute respiratory symptoms was significantly higher for participants with respiratory disorder history compared to healthy participants (p < 0.05). The incidence of in-commute offensive odour detection, and the perception of in-commute air pollution exposure, was significantly lower for participants with smoking history compared to healthy participants (p < 0.05). Females reported significantly higher incidence of in-commute air pollution exposure perception and other specific acute respiratory symptoms, and were more amenable to commute re-routing, compared to males (p < 0.05). Healthy individuals have indicated a higher incidence of acute respiratory symptoms in- and post- (compared to pre-) bicycle commuting, with female gender and respiratory disorder history indicating a comparably-higher susceptibility; 2) total mean PNC of LOW (compared to HIGH) was reduced (1.56 x e4 ± 0.38 x e4 versus 3.06 x e4 ± 0.53 x e4 ppcc; p = 0.012). Total estimated ventilation rate did not vary significantly between LOW and HIGH (43 ± 5 versus 46 ± 9 L•min; p = 0.136); however, due to total mean PNC, accumulated inhaled particle counts were 48% lower in LOW, compared to HIGH (7.6 x e8 ± 1.5 x e8 versus 14.6 x e8 ± 1.8 x e8; p = 0.003); 3) LOW resulted in a significant reduction in mean PNC (1.91 x e4 ± 0.93 x e4 ppcc vs. 2.95 x e4 ± 1.50 x e4 ppcc; p ≤ 0.001). Commute distance and duration were not significantly different between LOW and HIGH (12.8 ± 7.1 vs. 12.0 ± 6.9 km and 44 ± 17 vs. 42 ± 17 mins, respectively). Besides incidence of in-commute offensive odour detection (42 vs. 56 %; p = 0.019), incidence of dust and soot observation (33 vs. 47 %; p = 0.038) and nasopharyngeal irritation (31 vs. 41 %; p = 0.007), acute inflammatory indices were not significantly associated to in-commute PNC, nor were these indices reduced with LOW compared to HIGH. The main conclusions of the three studies are that: 1) the perception of air pollution exposure levels and the amenability to adopt exposure risk management strategies where applicable will aid the general population in shifting from passive, motorised transport modes to bicycle commuting; 2) for bicycle commuting at peak morning commute times, inhaled particle counts and therefore cardiopulmonary health risk may be substantially reduced by decreasing exposure to motorised traffic, which should be considered by both bicycle commuters and urban planners; 3) exposure to PNC, and the incidence of offensive odour and nasopharyngeal irritation, can be significantly reduced when utilising a strategy of lowering proximity to motorised traffic whilst bicycle commuting, without significantly increasing commute distance or duration, which may bring important benefits for both healthy and susceptible individuals. In summary, the findings from this project suggests that bicycle commuters can significantly lower their exposure to ultrafine particle emissions by varying their commute route to reduce proximity to motorised traffic and associated combustion emissions without necessarily affecting their time of commute. While the health endpoints assessed with healthy individuals were not indicative of acute health detriment, individuals with pre-disposing physiological-susceptibility may benefit considerably from this risk management strategy – a necessary research focus with the contemporary increased popularity of both promotion and participation in bicycle commuting.

Agent-based model of passenger flows in airport terminals

Passenger flow studies in airport terminals have shown consistent statistical relationships between airport spatial layout and pedestrian movement, facilitating prediction of movement from terminal designs. However, these studies are done at an aggregate level and do not incorporate how individual passengers make decisions at a microscopic level. Therefore, they do not explain the formation of complex movement flows. In addition, existing models mostly focus on standard airport processing procedures such as immigration and security, but seldom consider discretionary activities of passengers, and thus are not able to truly describe the full range of passenger flows within airport terminals. As the route-choice decision-making of passengers involves many uncertain factors within the airport terminals, the mechanisms to fulfill the capacity of managing the route-choice have proven difficult to acquire and quantify. Could the study of cognitive factors of passengers (i.e. human mental preferences of deciding which on-airport facility to use) be useful to tackle these issues? Assuming the movement in virtual simulated environments can be analogous to movement in real environments, passenger behaviour dynamics can be similar to those generated in virtual experiments. Three levels of dynamics have been devised for motion control: the localised field, tactical level, and strategic level. A localised field refers to basic motion capabilities, such as walking speed, direction and avoidance of obstacles. The other two fields represent cognitive route-choice decision-making. This research views passenger flow problems via a "bottom-up approach", regarding individual passengers as independent intelligent agents who can behave autonomously and are able to interact with others and the ambient environment. In this regard, passenger flow formation becomes an emergent phenomenon of large numbers of passengers interacting with others. In the thesis, first, the passenger flow in airport terminals was investigated. Discretionary activities of passengers were integrated with standard processing procedures in the research. The localised field for passenger motion dynamics was constructed by a devised force-based model. Next, advanced traits of passengers (such as their desire to shop, their comfort with technology and their willingness to ask for assistance) were formulated to facilitate tactical route-choice decision-making. The traits consist of quantified measures of mental preferences of passengers when they travel through airport terminals. Each category of the traits indicates a decision which passengers may take. They were inferred through a Bayesian network model by analysing the probabilities based on currently available data. Route-choice decision-making was finalised by calculating corresponding utility results based on those probabilities observed. Three sorts of simulation outcomes were generated: namely, queuing length before checkpoints, average dwell time of passengers at service facilities, and instantaneous space utilisation. Queuing length reflects the number of passengers who are in a queue. Long queues no doubt cause significant delay in processing procedures. The dwell time of each passenger agent at the service facilities were recorded. The overall dwell time of passenger agents at typical facility areas were analysed so as to demonstrate portions of utilisation in the temporal aspect. For the spatial aspect, the number of passenger agents who were dwelling within specific terminal areas can be used to estimate service rates. All outcomes demonstrated specific results by typical simulated passenger flows. They directly reflect terminal capacity. The simulation results strongly suggest that integrating discretionary activities of passengers makes the passenger flows more intuitive, observing probabilities of mental preferences by inferring advanced traits make up an approach capable of carrying out tactical route-choice decision-making. On the whole, the research studied passenger flows in airport terminals by an agent-based model, which investigated individual characteristics of passengers and their impact on psychological route-choice decisions of passengers. Finally, intuitive passenger flows in airport terminals were able to be realised in simulation.

Hypergraph-based modeling of ad-hoc business processes

Process models are usually depicted as directed graphs, with nodes representing activities and directed edges control flow. While structured processes with pre-defined control flow have been studied in detail, flexible processes including ad-hoc activities need further investigation. This paper presents flexible process graph, a novel approach to model processes in the context of dynamic environment and adaptive process participants’ behavior. The approach allows defining execution constraints, which are more restrictive than traditional ad-hoc processes and less restrictive than traditional control flow, thereby balancing structured control flow with unstructured ad-hoc activities. Flexible process graph focuses on what can be done to perform a process. Process participants’ routing decisions are based on the current process state. As a formal grounding, the approach uses hypergraphs, where each edge can associate any number of nodes. Hypergraphs are used to define execution semantics of processes formally. We provide a process scenario to motivate and illustrate the approach.

Analysis of distributed beamforming in cooperative communications network with phase shifter based smart antenna nodes

This research study investigates the application of phase shifter-based smart antenna system in distributed beamforming. It examines the way to optimise the transmit power by jointly maximising the directivity of the array antennas and the weight vector for distributed beamforming. This research study concludes that maximising directivity can lead to better transmit power minimisation compared to maximising field intensity. This study also concludes that signal to noise power ratio maximisation subject to a power constraint and power minimisation subject to a signal to noise power ratio constraint yield the same results.

Delay tolerant routing protocols for energy-neutral animal tracking

This paper investigates communication protocols for relaying sensor data from animal tracking applications back to base stations. While Delay Tolerant Networks (DTNs) are well suited to such challenging environments, most existing protocols do not consider the available energy that is particularly important when tracking devices can harvest energy. This limits both the network lifetime and delivery probability in energy-constrained applications to the point when routing performance becomes worse than using no routing at all. Our work shows that substantial improvement in data yields can be achieved through simple yet efficient energy-aware strategies. Conceptually, there is need for balancing the energy spent on sensing, data mulling, and delivery of direct packets to destination. We use empirical traces collected in a flying fox (fruit bat) tracking project and show that simple threshold-based energy-aware strategies yield up to 20% higher delivery rates. Furthermore, these results generalize well for a wide range of operating conditions.

A framework for freeway incident modeling and traffic re-routing

This paper proposes an analytical Incident Traffic Management framework for freeway incident modeling and traffic re-routing. The proposed framework incorporates an econometric incident duration model and a traffic re-routing optimization module. The incident duration model is used to estimate the expected duration of the incident and thus determine the planning horizon for the re-routing module. The re-routing module is a CTM-based Single Destination System Optimal Dynamic Traffic Assignment model that generates optimal real-time strategies of re-routing freeway traffic to its adjacent arterial network during incidents. The proposed framework has been applied to a case study network including a freeway and its adjacent arterial network in South East Queensland, Australia. The results from different scenarios of freeway demand and incident blockage extent have been analyzed and advantages of the proposed framework are demonstrated.

Energy-based guidance of an underactuated unmanned underwater vehicle on a helical trajectory

This paper presents a motion control system for guidance of an underactuated Unmanned Underwater Vehicle (UUV) on a helical trajectory. The control strategy is developed using Port-Hamiltonian theory and interconnection and damping assignment passivity-based control. Using energy routing, the trajectory of a virtual fully actuated plant is guided onto a vector field. A tracking controller is then used that commands the underactuated plant to follow the velocity of the virtual plant. An integral control is inserted between the two control layers, which adds robustness and disturbance rejection to the design.

Constraint effects on multiple void interaction in pressure sensitive plastic solids

In this work, effects of pressure sensitive yielding and plastic dilatancy on void growth and void interaction mechanisms in fracture specimens displaying high and low constraint levels are investigated. To this end, large deformation finite element simulations are carried out with discrete voids ahead of the notch. It is observed that multiple void interaction mechanism which is favored by high initial porosity is further accelerated by pressure sensitive yielding, but is retarded by loss of constraint. The resistance curves predicted based on a simple void coalescence criterion show enhancement in fracture resistance when constraint level is low and when pressure sensitivity is suppressed.

A fuzzy dynamic flood routing model for natural channels

A fuzzy dynamic flood routing model (FDFRM) for natural channels is presented, wherein the flood wave can be approximated to a monoclinal wave. This study is based on modification of an earlier published work by the same authors, where the nature of the wave was of gravity type. Momentum equation of the dynamic wave model is replaced by a fuzzy rule based model, while retaining the continuity equation in its complete form. Hence, the FDFRM gets rid of the assumptions associated with the momentum equation. Also, it overcomes the necessity of calculating friction slope (S-f) in flood routing and hence the associated uncertainties are eliminated. The fuzzy rule based model is developed on an equation for wave velocity, which is obtained in terms of discontinuities in the gradient of flow parameters. The channel reach is divided into a number of approximately uniform sub-reaches. Training set required for development of the fuzzy rule based model for each sub-reach is obtained from discharge-area relationship at its mean section. For highly heterogeneous sub-reaches, optimized fuzzy rule based models are obtained by means of a neuro-fuzzy algorithm. For demonstration, the FDFRM is applied to flood routing problems in a fictitious channel with single uniform reach, in a fictitious channel with two uniform sub-reaches and also in a natural channel with a number of approximately uniform sub-reaches. It is observed that in cases of the fictitious channels, the FDFRM outputs match well with those of an implicit numerical model (INM), which solves the dynamic wave equations using an implicit numerical scheme. For the natural channel, the FDFRM Outputs are comparable to those of the HEC-RAS model.