Stress at work : a new theoretical framework for psychologists

This paper examines the way psychologists and others in teh helping professions can deal with stressors in their lives and still work effectively. Three questions will be asked. First "What are the essential ingredients of an environment that supports psychologists going through personal stressors? Second, "What are the personal characteristics and strategies that give resilience to a professional during this period?" and third,"How does the stressor or grieving process influence a psychologist's therapy?" The whole will be fitted into a visual framework and the interaction of the three main variables (client, therapist and stressor) will be explored.

Lifestyle risk factor modification in midlife women with type 2 diabetes : theoretical modelling of perceived barriers

Objective: The aim of this paper is to propose a ‘Perceived barriers and lifestyle risk factor modification model’ that could be incorporated into existing frameworks for diabetes education to enhance lifestyle risk factor education in women. Setting: Diabetes education, community health. Primary argument: ‘Perceived barriers’ is a health promotion concept that has been found to be a significant predictor of health promotion behaviour. There is evidence that women face a range of perceived barriers that prevent them from engaging in healthy lifestyle activities. Despite this, current evidence based models of diabetes education do not explicitly incorporate the concept of perceived barriers. A model of risk factor reduction that incorporates ‘perceived barriers’ is proposed. Conclusion: Although further research is required, current approaches to risk factor reduction in type 2 diabetes could be enhanced by identification and goal setting to reduce an individual’s perceived barriers.

Ecological dynamics as a theoretical framework for development of sustainable behaviours towards the environment

This paper proposes how the theoretical framework of ecological dynamics can provide an influential model of the learner and the learning process to pre-empt effective behaviour changes. Here we argue that ecological dynamics supports a well established model of the learner ideally suited to the environmental education context because of its emphasis on the learner-environment relationship. The model stems from perspectives on behaviour change in ecological psychology and dynamical systems theory. The salient points of the model are highlighted for educators interested in manipulating environmental constraints in the learning process, with the aim of designing effective learning programs in environmental education. We conclude by providing generic principles of application which might define the learning process in environmental education programs.

Graph-based concept weighting for medical information retrieval

This paper presents a graph-based method to weight medical concepts in documents for the purposes of information retrieval. Medical concepts are extracted from free-text documents using a state-of-the-art technique that maps n-grams to concepts from the SNOMED CT medical ontology. In our graph-based concept representation, concepts are vertices in a graph built from a document, edges represent associations between concepts. This representation naturally captures dependencies between concepts, an important requirement for interpreting medical text, and a feature lacking in bag-of-words representations. We apply existing graph-based term weighting methods to weight medical concepts. Using concepts rather than terms addresses vocabulary mismatch as well as encapsulates terms belonging to a single medical entity into a single concept. In addition, we further extend previous graph-based approaches by injecting domain knowledge that estimates the importance of a concept within the global medical domain. Retrieval experiments on the TREC Medical Records collection show our method outperforms both term and concept baselines. More generally, this work provides a means of integrating background knowledge contained in medical ontologies into data-driven information retrieval approaches.

Towards persistent indoor appearance-based localization, mapping and navigation using CAT-Graph

The challenge of persistent appearance-based navigation and mapping is to develop an autonomous robotic vision system that can simultaneously localize, map and navigate over the lifetime of the robot. However, the computation time and memory requirements of current appearance-based methods typically scale not only with the size of the environment but also with the operation time of the platform; also, repeated revisits to locations will develop multiple competing representations which reduce recall performance. In this paper we present a solution to the persistent localization, mapping and global path planning problem in the context of a delivery robot in an office environment over a one-week period. Using a graphical appearance-based SLAM algorithm, CAT-Graph, we demonstrate constant time and memory loop closure detection with minimal degradation during repeated revisits to locations, along with topological path planning that improves over time without using a global metric representation. We compare the localization performance of CAT-Graph to openFABMAP, an appearance-only SLAM algorithm, and the path planning performance to occupancy-grid based metric SLAM. We discuss the limitations of the algorithm with regard to environment change over time and illustrate how the topological graph representation can be coupled with local movement behaviors for persistent autonomous robot navigation.

Expander graph based key distribution mechanisms in wireless sensor networks

Secure communications between large number of sensor nodes that are randomly scattered over a hostile territory, necessitate efficient key distribution schemes. However, due to limited resources at sensor nodes such schemes cannot be based on post deployment computations. Instead, pairwise (symmetric) keys are required to be pre-distributed by assigning a list of keys, (a.k.a. key-chain), to each sensor node. If a pair of nodes does not have a common key after deployment then they must find a key-path with secured links. The objective is to minimize the keychain size while (i) maximizing pairwise key sharing probability and resilience, and (ii) minimizing average key-path length. This paper presents a deterministic key distribution scheme based on Expander Graphs. It shows how to map the parameters (e.g., degree, expansion, and diameter) of a Ramanujan Expander Graph to the desired properties of a key distribution scheme for a physical network topology.

CAT-GRAPH+ : towards odometry-driven place consolidation in changing environments

Changing environments present a number of challenges to mobile robots, one of the most significant being mapping and localisation. This problem is particularly significant in vision-based systems where illumination and weather changes can cause feature-based techniques to fail. In many applications only sections of an environment undergo extreme perceptual change. Some range-based sensor mapping approaches exploit this property by combining occasional place recognition with the assumption that odometry is accurate over short periods of time. In this paper, we develop this idea in the visual domain, by using occasional vision-driven loop closures to infer loop closures in nearby locations where visual recognition is difficult due to extreme change. We demonstrate successful map creation in an environment in which change is significant but constrained to one area, where both the vanilla CAT-Graph and a Sum of Absolute Differences matcher fails, use the described techniques to link dissimilar images from matching locations, and test the robustness of the system against false inferences.

Analyzing the effectiveness of graph metrics for anomaly detection in online social networks

Online social networks can be modelled as graphs; in this paper, we analyze the use of graph metrics for identifying users with anomalous relationships to other users. A framework is proposed for analyzing the effectiveness of various graph theoretic properties such as the number of neighbouring nodes and edges, betweenness centrality, and community cohesiveness in detecting anomalous users. Experimental results on real-world data collected from online social networks show that the majority of users typically have friends who are friends themselves, whereas anomalous users’ graphs typically do not follow this common rule. Empirical analysis also shows that the relationship between average betweenness centrality and edges identifies anomalies more accurately than other approaches.

A theoretical basis for using virtual worlds as a personalised process visualisation approach

Communication processes are vital in the lifecycle of BPM projects. With this in mind, much research has been performed into facilitating this key component between stakeholders. Amongst the methods used to support this process are personalized process visualisations. In this paper, we review the development of this visualization trend, then, we propose a theoretical analysis framework based upon communication theory. We use this framework to provide theoretical support to the conjecture that 3D virtual worlds are powerful tools for communicating personalised visualisations of processes within a workplace. Meta requirements are then derived and applied, via 3D virtual world functionalities, to generate example visualisations containing personalized aspects, which we believe enhance the process of communcation between analysts and stakeholders in BPM process (re)design activities.

Data requirements and graph data structures for a multi-modal, multi-objective trip planner

Traffic congestion has a significant impact on the economy and environment. Encouraging the use of multimodal transport (public transport, bicycle, park’n’ride, etc.) has been identified by traffic operators as a good strategy to tackle congestion issues and its detrimental environmental impacts. A multi-modal and multi-objective trip planner provides users with various multi-modal options optimised on objectives that they prefer (cheapest, fastest, safest, etc) and has a potential to reduce congestion on both a temporal and spatial scale. The computation of multi-modal and multi-objective trips is a complicated mathematical problem, as it must integrate and utilize a diverse range of large data sets, including both road network information and public transport schedules, as well as optimising for a number of competing objectives, where fully optimising for one objective, such as travel time, can adversely affect other objectives, such as cost. The relationship between these objectives can also be quite subjective, as their priorities will vary from user to user. This paper will first outline the various data requirements and formats that are needed for the multi-modal multi-objective trip planner to operate, including static information about the physical infrastructure within Brisbane as well as real-time and historical data to predict traffic flow on the road network and the status of public transport. It will then present information on the graph data structures representing the road and public transport networks within Brisbane that are used in the trip planner to calculate optimal routes. This will allow for an investigation into the various shortest path algorithms that have been researched over the last few decades, and provide a foundation for the construction of the Multi-modal Multi-objective Trip Planner by the development of innovative new algorithms that can operate the large diverse data sets and competing objectives.

Theoretical framework for a management decision evaluation system

A theoretical framework for a construction management decision evaluation system for project selection by means of a literature review. The theory is developed by the examination of the major factors concerning the project selection decision from a deterministic viewpoint, where the decision-maker is assumed to possess 'perfect knowledge' of all the aspects involved. Four fundamental project characteristics are identified together with three meaningful outcome variables. The relationship within and between these variables are considered together with some possible solution techniques. The theory is next extended to time-related dynamic aspects of the problem leading to the implications of imperfect knowledge and a non­deterministic model. A solution technique is proposed in which Gottinger's sequential machines are utilised to model the decision process,

Theoretical study of two states reactivity of methane activation on iron atom and iron dimer

Density functional theory (DFT) calculations have been carried out to explore the catalytic activation of C–H bonds in methane by the iron atom, Fe, and the iron dimer, Fe2. For methane activation on an Fe atom, the calculations suggest that the activation of the first C–H bond is mediated via the triplet excited-state potential energy surface (PES), with initial excitation of Fe to the triplet state being necessary for the reaction to be energetically feasible. Compared with the breaking of the first C–H bond, the cleavage of the second C–H bond is predicted to involve a significantly higher barrier, which could explain experimental observations of the HFeCH3 complex rather than CH2FeH2 in the activation of methane by an Fe atom. For methane activation on an iron dimer, the cleavage of the first C–H bond is quite facile with a barrier only 11.2, 15.8 and 8.4 kcal/mol on the septet state energy surface at the B3LYP/6-311+G(2df,2dp), BPW91/6-311+G(2df,2dp) and M06/B3LYP level, respectively. Cleavage of the second C–H bond from HFe2CH3 involves a barrier calculated respectively as 18.0, 10.7 and 12.4 kcal/mol at the three levels. The results suggest that the elimination of hydrogen from the dihydrogen complex is a rate-determining step. Overall, our results indicate that the iron dimer Fe2 has a stronger catalytic effect on the activation of methane than the iron atom.