Layered dynamic probabilistic networks for spatio-temporal modelling

In applications such as tracking and surveillance in large spatial environments, there is a need for representing dynamic and noisy data and at the same time dealing with them at different levels of detail. In the spatial domain, there has been work dealing with these two issues separately, however, there is no existing common framework for dealing with both of them. In this paper, we propose a new representation framework called the Layered Dynamic Probabilistic Network (LDPN), a special type of Dynamic Probabilistic Network (DPN), capable of handling uncertainty and representing spatial data at various levels of detail. The framework is thus particularly suited to applications in wide-area environments which are characterised by large region size, complex spatial layout and multiple sensors/cameras. For example, a building has three levels: entry/exit to the building, entry/exit between rooms and moving within rooms. To avoid the problem of a relatively large state space associated with a large spatial environment, the LDPN explicitly encodes the hierarchy of connected spatial locations, making it scalable to the size of the environment being modelled. There are three main advantages of the LDPN. First, the reduction in state space makes it suitable for dealing with wide area surveillance involving multiple sensors. Second, it offers a hierarchy of intervals for indexing temporal data. Lastly, the explicit representation of intermediate sub-goals allows for the extension of the framework to easily represent group interactions by allowing coupling between sub-goal layers of different individuals or objects. We describe an adaptation of the likelihood sampling inference scheme for the LDPN, and illustrate its use in a hypothetical surveillance scenario.

Managing dynamic security networks: towards the strategic managing of cooperation, coordination and collaboration

Security networks are increasing in number and in importance across the security field as a means of providing inter-agency coordination. On the basis of a detailed qualitative study of networks in the field of national security in Australia, this article aims to advance our knowledge of the internal properties of security networks and conditions shaping their performance. It places ‘cooperation’, ‘coordination’ and ‘collaboration’ on a continuum, with cooperation at one end and collaboration at the other end, and aims to illustrate how each of these ‘Cs’ shape the performance of security networks. The central argument is that the performance of security networks increases as the network moves from cooperation to collaboration. Drawing on interviews with senior members of security, law enforcement and intelligence agencies, the article aims to highlight the lessons for how to strategically manage security networks in ways that promote collaboration.

Dynamic social networks in guppies (Poecilia reticulata)

One of the main challenges in the study of social networks in vertebrates is to close the gap between group patterns and dynamics. Usually scan samples or transect data are recorded to provide information about social patterns of animals, but these techniques themselves do not shed much light on the underlying dynamics of such groups. Here we show an approach which captures the fission-fusion dynamics of a fish population in the wild and demonstrates how the gap between pattern and dynamics may be closed. Our analysis revealed that guppies have complex association patterns that are characterised by close strong connections between individuals of similar behavioural type. Intriguingly, the preference for particular social partners is not expressed in the length of associations but in their frequency. Finally, we show that the observed association preferences could have important consequences for transmission processes in animal social networks, thus moving the emphasis of network research from descriptive mechanistic studies to functional and predictive ones.

Extending robust industrial optimisation using simulation and reinforcement learning

Traditional optimisation methods are incapable of capturing the complexity of today's dynamic manufacturing systems. A new methodology, integrating simulation models and intelligent learning agents, was successfully applied to identify solutions to a fundamental scheduling problem. The robustness of this approach was then demonstrated through a series of real-world industrial applications.

Tracking and surveillance in wide-area spatial environments using the abstract hidden markov model.

In this paper, we consider the problem of tracking an object and predicting the object's future trajectory in a wide-area environment, with complex spatial layout and the use of multiple sensors/cameras. To solve this problem, there is a need for representing the dynamic and noisy data in the tracking tasks, and dealing with them at different levels of detail. We employ the Abstract Hidden Markov Models (AHMM), an extension of the well-known Hidden Markov Model (HMM) and a special type of Dynamic Probabilistic Network (DPN), as our underlying representation framework. The AHMM allows us to explicitly encode the hierarchy of connected spatial locations, making it scalable to the size of the environment being modeled. We describe an application for tracking human movement in an office-like spatial layout where the AHMM is used to track and predict the evolution of object trajectories at different levels of detail.

On the recognition of abstract Markov policies

Abstraction plays an essential role in the way the agents plan their behaviours, especially to reduce the computational complexity of planning in large domains. However, the effects of abstraction in the inverse process – plan recognition – are unclear. In this paper, we present a method for recognising the agent’s behaviour in noisy and uncertain domains, and across multiple levels of abstraction. We use the concept of abstract Markov policies in abstract probabilistic planning as the model of the agent’s behaviours and employ probabilistic inference in Dynamic Bayesian Networks (DBN) to infer the correct policy from a sequence of observations. When the states are fully observable, we show that for a broad and often-used class of abstract policies, the complexity of policy recognition scales well with the number of abstraction levels in the policy hierarchy. For the partially observable case, we derive an efficient hybrid inference scheme on the corresponding DBN to overcome the exponential complexity.

Development of a dynamic surface roughness monitoring system based on artificial neural networks (ANN) in milling operation

Dynamic surface roughness prediction during metal cutting operations plays an important role to enhance the productivity in manufacturing industries. Various machining parameters such as unwanted noises affect the surface roughness, whatever their effects have not been adequately quantified. In this study, a general dynamic surface roughness monitoring system in milling operations was developed. Based on the experimentally acquired data, the milling process of Al 7075 and St 52 parts was simulated. Cutting parameters (i.e., cutting speed, feed rate, and depth of cut), material type, coolant fluid, X and Z components of milling machine vibrations, and white noise were used as inputs. The original objective in the development of a dynamic monitoring system is to simulate wide ranges of machining conditions such as rough and finishing of several materials with and without cutting fluid. To achieve high accuracy of the resultant data, the full factorial design of experiment was used. To verify the accuracy of the proposed model, testing and recall/verification procedures have been carried out and results showed that the accuracy of 99.8 and 99.7 % were obtained for testing and recall processes.

Toward an integrative role for intranets : an interpretive case study of intranet-based dynamic knowledge integration in socio-technical networks

An increasing challenge for contemporary businesses is to be able to respond to perceived opportunities and threats by dynamically integrating knowledge dispersed across and beyond the organisation. This paper provides findings from two interpretive case studies that illustrate how corporate intranets can be dynamically interwoven with other knowledge technologies in socio-technical networks (STNs) to integrate distributed formal and infonnal knowledge. A key finding suggests that businesses should carefully examine employee use of intranets for dynamic knowledge integration, and any implications stemming from this new integrative role for intranets. The paper also provides a theoretical framework for dynamic knowledge integration in STNs, which can underpin future research in this area.

Dynamic knowledge integration in socio-technical networks: an interpretive study of intranet use for knowledge integration

A major challenge facing firms competing in electronic business markets is the dynamic integration of knowledge within and beyond the firm, enabled by internet-based infrastructure and emergent fluid socio-technical networks. This paper explores how social actors dynamically employ intranets to integrate formal and informal knowledge within evolving socio-technical networks that emerge, permeate and extend beyond the organisational boundary. The paper presents two case studies that illustrate how static intranets can be useful for dynamically integrating knowledge when they are interwoven with other knowledge channels such as e-mail through which flows the informal knowledge needed to make sense of and situate formal organisational knowledge. The findings suggest that businesses should carefully examine how employees integrate intranets with other channels in their work, and the shaping of knowledge outcomes that flows from such use. There are practical implications for the proper skilling of thepeople who share and integrate knowledge in this way. The paper also provides a framework for dynamic knowledge integration in socio-technical networks, which can help underpin future research in this area.

Dynamic route construction for mobile collectors in wireless sensor networks

Wireless sensor networks with mobile data collectors have been recently proposed for extending the sensor network lifetime. Powerful mobile collectors are deployed to patrol the network and approach the static sensors for collecting their data buffers using single hop communication. The route followed by the mobile collector is very crucial for the data collection operation performed in the network and highly impacts the data collection time. This paper presents a practically efficient algorithm for constructing the mobile collector route. The route is constructed dynamically during the network operational time regardless of the sensors data generation rates. The algorithm acts on minimizing the sleeping time and the number of sensors waiting for the arrival of the mobile collector. Simulation results demonstrate that the presented algorithm can effectively reduce the overall data collection time.

Fuzzy neural networks for control of dynamic systems

This thesis provides a unified and comprehensive treatment of the fuzzy neural networks as the intelligent controllers. This work has been motivated by a need to develop the solid control methodologies capable of coping with the complexity, the nonlinearity, the interactions, and the time variance of the processes under control. In addition, the dynamic behavior of such processes is strongly influenced by the disturbances and the noise, and such processes are characterized by a large degree of uncertainty. Therefore, it is important to integrate an intelligent component to increase the control system ability to extract the functional relationships from the process and to change such relationships to improve the control precision, that is, to display the learning and the reasoning abilities. The objective of this thesis was to develop a self-organizing learning controller for above processes by using a combination of the fuzzy logic and the neural networks. An on-line, direct fuzzy neural controller using the process input-output measurement data and the reference model with both structural and parameter tuning has been developed to fulfill the above objective. A number of practical issues were considered. This includes the dynamic construction of the controller in order to alleviate the bias/variance dilemma, the universal approximation property, and the requirements of the locality and the linearity in the parameters. Several important issues in the intelligent control were also considered such as the overall control scheme, the requirement of the persistency of excitation and the bounded learning rates of the controller for the overall closed loop stability. Other important issues considered in this thesis include the dependence of the generalization ability and the optimization methods on the data distribution, and the requirements for the on-line learning and the feedback structure of the controller. Fuzzy inference specific issues such as the influence of the choice of the defuzzification method, T-norm operator and the membership function on the overall performance of the controller were also discussed. In addition, the e-completeness requirement and the use of the fuzzy similarity measure were also investigated. Main emphasis of the thesis has been on the applications to the real-world problems such as the industrial process control. The applicability of the proposed method has been demonstrated through the empirical studies on several real-world control problems of industrial complexity. This includes the temperature and the number-average molecular weight control in the continuous stirred tank polymerization reactor, and the torsional vibration, the eccentricity, the hardness and the thickness control in the cold rolling mills. Compared to the traditional linear controllers and the dynamically constructed neural network, the proposed fuzzy neural controller shows the highest promise as an effective approach to such nonlinear multi-variable control problems with the strong influence of the disturbances and the noise on the dynamic process behavior. In addition, the applicability of the proposed method beyond the strictly control area has also been investigated, in particular to the data mining and the knowledge elicitation. When compared to the decision tree method and the pruned neural network method for the data mining, the proposed fuzzy neural network is able to achieve a comparable accuracy with a more compact set of rules. In addition, the performance of the proposed fuzzy neural network is much better for the classes with the low occurrences in the data set compared to the decision tree method. Thus, the proposed fuzzy neural network may be very useful in situations where the important information is contained in a small fraction of the available data.

Dynamic request-driven scheme for data collectors in sensor networks

Wireless sensor networks lifetime is prolonged through a dynamic scheme for collecting sensory information using intelligent mobile elements. The data collection routes are optimised for fast and reliable delivery. The scheme minimises high levels of energy consumption to extend the network operational time.

Dynamic addressing in wireless sensor networks without location awareness

Sensor Networks have applications in diverse fields. They can be deployed for habitat modeling, temperature monitoring and industrial sensing. They also find applications in battlefield awareness and emergency (first) response situations. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks, it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose a novel dynamic addressing mechanism for wireless sensor networks that are not location-aware. The scheme enables successful reuse of addresses in event-driven wireless sensor networks introducing minimal latencies and efficiently addressing packet loss. It also eliminates the need for network-wide Duplicate Address Detection (DAD) to ensure uniqueness of network level addresses.