Individual factors and perceived community characteristics in relation to mental health and mental well-being

Background
It has been argued that though correlated with mental health, mental well-being is a distinct entity. Despite the wealth of literature on mental health, less is known about mental well-being. Mental health is something experienced by individuals, whereas mental well-being can be assessed at the population level. Accordingly it is important to differentiate the individual and population level factors (environmental and social) that could be associated with mental health and well-being, and as people living in deprived areas have a higher prevalence of poor mental health, these relationships should be compared across different levels of neighbourhood deprivation.

Methods
A cross-sectional representative random sample of 1,209 adults from 62 Super Output Areas (SOAs) in Belfast, Northern Ireland (Feb 2010 – Jan 2011) were recruited in the PARC Study. Interview-administered questionnaires recorded data on socio-demographic characteristics, health-related behaviours, individual social capital, self-rated health, mental health (SF-8) and mental well-being (WEMWBS). Multi-variable linear regression analyses, with inclusion of clustering by SOAs, were used to explore the associations between individual and perceived community characteristics and mental health and mental well-being, and to investigate how these associations differed by the level of neighbourhood deprivation.

Results
Thirty-eight and 30 % of variability in the measures of mental well-being and mental health, respectively, could be explained by individual factors and the perceived community characteristics. In the total sample and stratified by neighbourhood deprivation, age, marital status and self-rated health were associated with both mental health and well-being, with the ‘social connections’ and local area satisfaction elements of social capital also emerging as explanatory variables. An increase of +1 in EQ-5D-3 L was associated with +1SD of the population mean in both mental health and well-being. Similarly, a change from ‘very dissatisfied’ to ‘very satisfied’ for local area satisfaction would result in +8.75 for mental well-being, but only in the more affluent of areas.

Conclusions
Self-rated health was associated with both mental health and mental well-being. Of the individual social capital explanatory variables, ‘social connections’ was more important for mental well-being. Although similarities in the explanatory variables of mental health and mental well-being exist, socio-ecological interventions designed to improve them may not have equivalent impacts in rich and poor neighbourhoods.

Largest Matching Areas for Illumination and Occlusion Robust Face Recognition

In this paper, we introduce a novel approach to face recognition which simultaneously tackles three combined challenges: 1) uneven illumination; 2) partial occlusion; and 3) limited training data. The new approach performs lighting normalization, occlusion de-emphasis and finally face recognition, based on finding the largest matching area (LMA) at each point on the face, as opposed to traditional fixed-size local area-based approaches. Robustness is achieved with novel approaches for feature extraction, LMA-based face image comparison and unseen data modeling. On the extended YaleB and AR face databases for face identification, our method using only a single training image per person, outperforms other methods using a single training image, and matches or exceeds methods which require multiple training images. On the labeled faces in the wild face verification database, our method outperforms comparable unsupervised methods. We also show that the new method performs competitively even when the training images are corrupted.

Joint Optimization of Area Spectral Efficiency and Delay over PPP Interfered Ad-Hoc Networks

To evaluate the performance of the co-channel transmission based communication, we propose a new metric for area spectral efficiency (ASE) of interference limited ad-hoc network by assuming that the nodes are randomly distributed according to a Poisson point processes (PPP). We introduce a utility function, U = ASE/delay and derive the optimal ALOHA transmission probability p and the SIR threshold τ that jointly maximize the ASE and minimize the local delay. Finally, numerical results have been conducted to confirm that the joint optimization based on the U metric achieves a significant performance gain compared to conventional systems.

Robust face recognition using posterior union model based neural networks

Face recognition with unknown, partial distortion and occlusion is a practical problem, and has a wide range of applications, including security and multimedia information retrieval. The authors present a new approach to face recognition subject to unknown, partial distortion and occlusion. The new approach is based on a probabilistic decision-based neural network, enhanced by a statistical method called the posterior union model (PUM). PUM is an approach for ignoring severely mismatched local features and focusing the recognition mainly on the reliable local features. It thereby improves the robustness while assuming no prior information about the corruption. We call the new approach the posterior union decision-based neural network (PUDBNN). The new PUDBNN model has been evaluated on three face image databases (XM2VTS, AT&T and AR) using testing images subjected to various types of simulated and realistic partial distortion and occlusion. The new system has been compared to other approaches and has demonstrated improved performance.

Local network-based measures to assess the inferability of different regulatory networks

The purpose of this study is to compare the inferability of various synthetic as well as real biological regulatory networks. In order to assess differences we apply local network-based measures. That means, instead of applying global measures, we investigate and assess an inference algorithm locally, on the level of individual edges and subnetworks. We demonstrate the behaviour of our local network-based measures with respect to different regulatory networks by conducting large-scale simulations. As inference algorithm we use exemplarily ARACNE. The results from our exploratory analysis allow us not only to gain new insights into the strength and weakness of an inference algorithm with respect to characteristics of different regulatory networks, but also to obtain information that could be used to design novel problem-specific statistical estimators.

Structural information content of networks: Graph entropy based on local vertex functionals

In this paper we define the structural information content of graphs as their corresponding graph entropy. This definition is based on local vertex functionals obtained by calculating-spheres via the algorithm of Dijkstra. We prove that the graph entropy and, hence, the local vertex functionals can be computed with polynomial time complexity enabling the application of our measure for large graphs. In this paper we present numerical results for the graph entropy of chemical graphs and discuss resulting properties. (C) 2007 Elsevier Ltd. All rights reserved.

Free-space optoelectronic switching cores with MPLS for SANs over WDM ring networks

With increasing demands on storage devices in the modern communication environment, the storage area network (SAN) has evolved to provide a direct connection allowing these storage devices to be accessed efficiently. To optimize the performance of a SAN, a three-stage hybrid electronic/optical switching node architecture based on the concept of a MPLS label switching mechanism, aimed at serving as a multi-protocol label switching (MPLS) ingress label edge router (LER) for a SAN-enabled application, has been designed. New shutter-based free-space multi-channel optical switching cores are employed as the core switch fabric to solve the packet contention and switching path conflict problems. The system-level node architecture design constraints are evaluated through self-similar traffic sourced from real gigabit Ethernet network traces and storage systems. The extension performance of a SAN over a proposed WDM ring network, aimed at serving as an MPLS-enabled transport network, is also presented and demonstrated.

Semi-Qualitative Probabilistic Networks in Computer Vision Problems

This paper explores the application of semi-qualitative probabilistic networks (SQPNs) that combine numeric and qualitative information to computer vision problems. Our version of SQPN allows qualitative influences and imprecise probability measures using intervals. We describe an Imprecise Dirichlet model for parameter learning and an iterative algorithm for evaluating posterior probabilities, maximum a posteriori and most probable explanations. Experiments on facial expression recognition and image segmentation problems are performed using real data.

Thermodynamics of trajectories and local fluctuation theorems for harmonic quantum networks

We present a general method to undertake a thorough analysis of the thermodynamics of the quantum jump trajectories followed by an arbitrary quantum harmonic network undergoing linear and bilinear dynamics. The approach is based on the phase-space representation of the state of a harmonic network. The large deviation function associated with this system encodes the full counting statistics of exchange and also allows one to deduce for fluctuation theorems obeyed by the dynamics. We illustrate the method showing the validity of a local fluctuation theorem about the exchange of excitations between a restricted part of the environment (i.e., a local bath) and a harmonic network coupled with different schemes.

The Use of Audio Podcasts to Enhance the Delivery of a Computer Networks Course

Experience obtained in the support of mobile learning using podcast audio is reported. The paper outlines design, storage and distribution via a web site. An initial evaluation of the uptake of the approach in a final year computing module was undertaken. Audio objects were tailored to meet different pedagogical needs resulting in a repository of persistent glossary terms and disposable audio lectures distributed by podcasting. An aim of our approach is to document the interest from the students, and evaluate the potential of mobile learning for supplementing revision

Local Computation in Credal Networks

The goal of this contribution is to discuss local computation in credal networks — graphical models that can represent imprecise and indeterminate probability values. We analyze the inference problem in credal networks, discuss how inference algorithms can benefit from local computation, and suggest that local computation can be particularly important in approximate inference algorithms.

Detecting stealthy attacks: Efficient monitoring of suspicious activities on computer networks

Stealthy attackers move patiently through computer networks - taking days, weeks or months to accomplish their objectives in order to avoid detection. As networks scale up in size and speed, monitoring for such attack attempts is increasingly a challenge. This paper presents an efficient monitoring technique for stealthy attacks. It investigates the feasibility of proposed method under number of different test cases and examines how design of the network affects the detection. A methodological way for tracing anonymous stealthy activities to their approximate sources is also presented. The Bayesian fusion along with traffic sampling is employed as a data reduction method. The proposed method has the ability to monitor stealthy activities using 10-20% size sampling rates without degrading the quality of detection.