Review of refugee mental health interventions following resettlement : best practices and recommendations

There are increasing numbers of refugees worldwide, with approximately 16 million refugees in 2007 and over 2.5 million refugees resettled in the United States since the start of its humanitarian program. Psychologists and other health professionals who deliver mental health services for individuals from refugee backgrounds need to have confidence that the therapeutic interventions they employ are appropriate and effective for the clients with whom they work. The current review briefly surveys refugee research, examines empirical evaluations of therapeutic interventions in resettlement contexts, and provides recommendations for best practices and future directions in resettlement countries. The resettlement interventions found to be most effective typically target culturally homogeneous client samples and demonstrate moderate to large outcome effects on aspects of traumatic stress and anxiety reduction. Further evaluations of the array of psychotherapeutic, psychosocial, pharmacological, and other therapeutic approaches, including psychoeducational and community-based interventions that facilitate personal and community growth and change, are encouraged. There is a need for increased awareness, training and funding to implement longitudinal interventions that work collaboratively with clients from refugee backgrounds through the stages of resettlement.

Learning the kernel matrix with semidefinite programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive semidefinite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space - classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -using the labeled part of the data one can learn an embedding also for the unlabeled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.

A unifying view of multiple kernel learning

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying optimization criterion for multiple kernel learning and show how existing formulations are subsumed as special cases. We also derive the criterion’s dual representation, which is suitable for general smooth optimization algorithms. Finally, we evaluate multiple kernel learning in this framework analytically using a Rademacher complexity bound on the generalization error and empirically in a set of experiments.

A unifying view of multiple kernel learning

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying general optimization criterion for multiple kernel learning and show how existing formulations are subsumed as special cases. We also derive the criterion's dual representation, which is suitable for general smooth optimization algorithms. Finally, we evaluate multiple kernel learning in this framework analytically using a Rademacher complexity bound on the generalization error and empirically in a set of experiments.

Prediction of cis/trans isomerization in proteins using PSI-BLAST profiles and secondary structure information

Background The majority of peptide bonds in proteins are found to occur in the trans conformation. However, for proline residues, a considerable fraction of Prolyl peptide bonds adopt the cis form. Proline cis/trans isomerization is known to play a critical role in protein folding, splicing, cell signaling and transmembrane active transport. Accurate prediction of proline cis/trans isomerization in proteins would have many important applications towards the understanding of protein structure and function. Results In this paper, we propose a new approach to predict the proline cis/trans isomerization in proteins using support vector machine (SVM). The preliminary results indicated that using Radial Basis Function (RBF) kernels could lead to better prediction performance than that of polynomial and linear kernel functions. We used single sequence information of different local window sizes, amino acid compositions of different local sequences, multiple sequence alignment obtained from PSI-BLAST and the secondary structure information predicted by PSIPRED. We explored these different sequence encoding schemes in order to investigate their effects on the prediction performance. The training and testing of this approach was performed on a newly enlarged dataset of 2424 non-homologous proteins determined by X-Ray diffraction method using 5-fold cross-validation. Selecting the window size 11 provided the best performance for determining the proline cis/trans isomerization based on the single amino acid sequence. It was found that using multiple sequence alignments in the form of PSI-BLAST profiles could significantly improve the prediction performance, the prediction accuracy increased from 62.8% with single sequence to 69.8% and Matthews Correlation Coefficient (MCC) improved from 0.26 with single local sequence to 0.40. Furthermore, if coupled with the predicted secondary structure information by PSIPRED, our method yielded a prediction accuracy of 71.5% and MCC of 0.43, 9% and 0.17 higher than the accuracy achieved based on the singe sequence information, respectively. Conclusion A new method has been developed to predict the proline cis/trans isomerization in proteins based on support vector machine, which used the single amino acid sequence with different local window sizes, the amino acid compositions of local sequence flanking centered proline residues, the position-specific scoring matrices (PSSMs) extracted by PSI-BLAST and the predicted secondary structures generated by PSIPRED. The successful application of SVM approach in this study reinforced that SVM is a powerful tool in predicting proline cis/trans isomerization in proteins and biological sequence analysis.

Volcanology and petrology of submarine volcanoes of the New Hebrides island arc

The New Hebrides Island Arc, an intra-oceanic island chain in the southwest Pacific, is formed by subduction of the Indo-Australian Plate beneath the Pacific Plate. The southern end of the New Hebrides Island Arc is an ideal location to study the magmatic and tectonic interaction of an emerging island arc as this part of the island chain is less than 3 million years old. A tectonically complex island arc, it exhibits a change in relative subduction rate from ~12cm/yr to 6 cm/yr before transitioning to a left-lateral strike slip zone at its southern end. Two submarine volcanic fields, Gemini-Oscostar and Volsmar, occur at this transition from normal arc subduction to sinistral strike slip movement. Multi-beam bathymetry and dredge samples collected during the 2004 CoTroVE cruise onboard the RV Southern Surveyor help define the relationship between magmatism and tectonics, and the source for these two submarine volcanic fields. Gemini-Oscostar volcanic field (GOVF), dominated by northwest-oriented normal faults, has mature polygenetic stratovolcanoes with evidence for explosive subaqueous eruptions and homogeneous monogenetic scoria cones. Volsmar volcanic field (VVF), located 30 km south of GOVF, exhibits a conjugate set of northwest and eastwest-oriented normal faults, with two polygenetic stratovolcanoes and numerous monogenetic scoria cones. A deep water caldera provides evidence for explosive eruptions at 1500m below sea level in the VVF. Both volcanic fields are dominated by low-K island arc tholeiites and basaltic andesites with calcalkalic andesite and dacite being found only in the GOVF. Geochemical signatures of both volcanic fields continue the along-arc trend of decreasing K2O with both volcanic fields being similar to the New Hebrides central chain lavas. Lavas from both fields display a slight depletion in high field strength elements and heavy rare earth elements, and slight enrichments in large-ion lithophile elements and light rare earth elements with respect to N-MORB mantle. Sr and Nd isotope data correlate with heavy rare earth and high field strength element data to show that both fields are derived from depleted mantle. Pb isotopes define Pacific MORB mantle sources and are consistent with isotopic variation along the New Hebrides Island Arc. Pb isotopes show no evidence for sediment contamination; the subduction component enrichment is therefore a slab-derived enrichment. There is a subtle spatial variation in source chemistry which sees a northerly trend of decreasing enrichment of slab-derived fluids.

Population genetic structure and patterns of dispersal in the Giant Long-Armed Prawn, Macrobrachium lar (Fabricius, 1798) (Decapoda : Palaemonidae)

The Giant Long-Armed Prawn, Macrobrachium lar is a freshwater species native to the Indo-Pacific. M. lar has a long-lived, passive, pelagic marine larval stage where larvae need to colonise freshwater within three months to complete their development. Dispersal is likely to be influenced by the extensive distances larvae must transit between small oceanic islands to find suitable freshwater habitat, and by prevailing east to west wind and ocean currents in the southern Pacific Ocean. Thus, both intrinsic and extrinsic factors are likely to influence wild population structure in this species. The present study sought to define the contemporary broad and fine-scale population genetic structure of Macrobrachium lar in the south-western Pacific Ocean. Three polymorphic microsatellite loci were used to assess patterns of genetic variation within and among 19 wild adult sample sites. Statistical procedures that partition variation implied that at both spatial scales, essentially all variation was present within sample sites and differentiation among sites was low. Any differentiation observed also was not correlated with geographical distance. Statistical approaches that measure genetic distance, at the broad-scale, showed that all south-western Pacific Islands were essentially homogeneous, with the exception of a well supported divergent Cook Islands group. These findings are likely the result of some combination of factors that may include the potential for allelic homoplasy, through to the effects of sampling regime. Based on the findings, there is most likely a divergent M. lar Cook Islands clade in the south-western Pacific Ocean, resulting from prevailing ocean currents. Confirmation of this pattern will require a more detailed analysis of nDNA variation using a larger number of loci and, where possible, use of larger population sizes.

Accelerated leap methods for simulating discrete stochastic chemical kinetics

Biologists are increasingly conscious of the critical role that noise plays in cellular functions such as genetic regulation, often in connection with fluctuations in small numbers of key regulatory molecules. This has inspired the development of models that capture this fundamentally discrete and stochastic nature of cellular biology - most notably the Gillespie stochastic simulation algorithm (SSA). The SSA simulates a temporally homogeneous, discrete-state, continuous-time Markov process, and of course the corresponding probabilities and numbers of each molecular species must all remain positive. While accurately serving this purpose, the SSA can be computationally inefficient due to very small time stepping so faster approximations such as the Poisson and Binomial τ-leap methods have been suggested. This work places these leap methods in the context of numerical methods for the solution of stochastic differential equations (SDEs) driven by Poisson noise. This allows analogues of Euler-Maruyuma, Milstein and even higher order methods to be developed through the Itô-Taylor expansions as well as similar derivative-free Runge-Kutta approaches. Numerical results demonstrate that these novel methods compare favourably with existing techniques for simulating biochemical reactions by more accurately capturing crucial properties such as the mean and variance than existing methods.

An infinite-horizon robust filter for uncertain hidden Markov Models with conditional relative entropy constraints

We consider a robust filtering problem for uncertain discrete-time, homogeneous, first-order, finite-state hidden Markov models (HMMs). The class of uncertain HMMs considered is described by a conditional relative entropy constraint on measures perturbed from a nominal regular conditional probability distribution given the previous posterior state distribution and the latest measurement. Under this class of perturbations, a robust infinite horizon filtering problem is first formulated as a constrained optimization problem before being transformed via variational results into an unconstrained optimization problem; the latter can be elegantly solved using a risk-sensitive information-state based filtering.

Evaluating the transport impacts of transit oriented developments (TODS)

Sustainable transport has become a necessity instead of an option, to address the problems of congestion and urban sprawl, whose effects include increased trip lengths and travel time. A more sustainable form of development, known as Transit Oriented Development (TOD) is presumed to offer sustainable travel choices with reduced need to travel to access daily destinations, by providing a mixture of land uses together with good quality of public transport service, infrastructure for walking and cycling. However, performance assessment of these developments with respect to travel characteristics of their inhabitants is required. This research proposes a five step methodology for evaluating the transport impacts of TODs. The steps for TOD evaluation include pre–TOD assessment, traffic and travel data collection, determination of traffic impacts, determination of travel impacts, and drawing outcomes. Typically, TODs are comprised of various land uses; hence have various types of users. Assessment of characteristics of all user groups is essential for obtaining an accurate picture of transport impacts. A case study TOD, Kelvin Grove Urban Village (KGUV), located 2km of north west of the Brisbane central business district in Australia was selected for implementing the proposed methodology and to evaluate the transport impacts of a TOD from an Australian perspective. The outcomes of this analysis indicated that KGUV generated 27 to 48 percent less traffic compared to standard published rates specified for homogeneous uses. Further, all user groups of KGUV used more sustainable modes of transport compared to regional and similarly located suburban users, with higher trip length for shopping and education trips. Although the results from this case study development support the transport claims of reduced traffic generation and sustainable travel choices by way of TODs, further investigation is required, considering different styles, scales and locations of TODs. The proposed methodology may be further refined by using results from new TODs and a framework for TOD evaluation may be developed.

Birds of a feather get lost together : new venture team composition and performance

This study explores the relationship between new venture team composition and new venture persistence and performance over time. We examine the team characteristics of a 5-year panel study of 202 new venture teams and new venture performance. Our study makes two contributions. First, we extend earlier research concerning homophily theories of the prevalence of homogeneous teams. Using structural event analysis we demonstrate that team members’ start-up experience is important in this context. Second, we attempt to reconcile conflicting evidence concerning the influence of team homogeneity on performance by considering the element of time. We hypothesize that higher team homogeneity is positively related to short term outcomes, but is less effective in the longer term. Our results confirm a difference over time. We find that more homogeneous teams are less likely to be higher performing in the long term. However, we find no relationship between team homogeneity and short-term performance outcomes.

The Metapopulation Dynamics of an Infectious Disease: Tuberculosis in Possums

An SEI metapopulation model is developed for the spread of an infectious agent by migration. The model portrays two age classes on a number of patches connected by migration routes which are used as host animals mature. A feature of this model is that the basic reproduction ratio may be computed directly, using a scheme that separates topography, demography, and epidemiology. We also provide formulas for individual patch basic reproduction numbers and discuss their connection with the basic reproduction ratio for the system. The model is applied to the problem of spatial spread of bovine tuberculosis in a possum population. The temporal dynamics of infection are investigated for some generic networks of migration links, and the basic reproduction ratio is computed—its value is not greatly different from that for a homogeneous model. Three scenarios are considered for the control of bovine tuberculosis in possums where the spatial aspect is shown to be crucial for the design of disease management operations

Multifractal characterisation and analysis of complex networks

Complex networks have been studied extensively due to their relevance to many real-world systems such as the world-wide web, the internet, biological and social systems. During the past two decades, studies of such networks in different fields have produced many significant results concerning their structures, topological properties, and dynamics. Three well-known properties of complex networks are scale-free degree distribution, small-world effect and self-similarity. The search for additional meaningful properties and the relationships among these properties is an active area of current research. This thesis investigates a newer aspect of complex networks, namely their multifractality, which is an extension of the concept of selfsimilarity. The first part of the thesis aims to confirm that the study of properties of complex networks can be expanded to a wider field including more complex weighted networks. Those real networks that have been shown to possess the self-similarity property in the existing literature are all unweighted networks. We use the proteinprotein interaction (PPI) networks as a key example to show that their weighted networks inherit the self-similarity from the original unweighted networks. Firstly, we confirm that the random sequential box-covering algorithm is an effective tool to compute the fractal dimension of complex networks. This is demonstrated on the Homo sapiens and E. coli PPI networks as well as their skeletons. Our results verify that the fractal dimension of the skeleton is smaller than that of the original network due to the shortest distance between nodes is larger in the skeleton, hence for a fixed box-size more boxes will be needed to cover the skeleton. Then we adopt the iterative scoring method to generate weighted PPI networks of five species, namely Homo sapiens, E. coli, yeast, C. elegans and Arabidopsis Thaliana. By using the random sequential box-covering algorithm, we calculate the fractal dimensions for both the original unweighted PPI networks and the generated weighted networks. The results show that self-similarity is still present in generated weighted PPI networks. This implication will be useful for our treatment of the networks in the third part of the thesis. The second part of the thesis aims to explore the multifractal behavior of different complex networks. Fractals such as the Cantor set, the Koch curve and the Sierspinski gasket are homogeneous since these fractals consist of a geometrical figure which repeats on an ever-reduced scale. Fractal analysis is a useful method for their study. However, real-world fractals are not homogeneous; there is rarely an identical motif repeated on all scales. Their singularity may vary on different subsets; implying that these objects are multifractal. Multifractal analysis is a useful way to systematically characterize the spatial heterogeneity of both theoretical and experimental fractal patterns. However, the tools for multifractal analysis of objects in Euclidean space are not suitable for complex networks. In this thesis, we propose a new box covering algorithm for multifractal analysis of complex networks. This algorithm is demonstrated in the computation of the generalized fractal dimensions of some theoretical networks, namely scale-free networks, small-world networks, random networks, and a kind of real networks, namely PPI networks of different species. Our main finding is the existence of multifractality in scale-free networks and PPI networks, while the multifractal behaviour is not confirmed for small-world networks and random networks. As another application, we generate gene interactions networks for patients and healthy people using the correlation coefficients between microarrays of different genes. Our results confirm the existence of multifractality in gene interactions networks. This multifractal analysis then provides a potentially useful tool for gene clustering and identification. The third part of the thesis aims to investigate the topological properties of networks constructed from time series. Characterizing complicated dynamics from time series is a fundamental problem of continuing interest in a wide variety of fields. Recent works indicate that complex network theory can be a powerful tool to analyse time series. Many existing methods for transforming time series into complex networks share a common feature: they define the connectivity of a complex network by the mutual proximity of different parts (e.g., individual states, state vectors, or cycles) of a single trajectory. In this thesis, we propose a new method to construct networks of time series: we define nodes by vectors of a certain length in the time series, and weight of edges between any two nodes by the Euclidean distance between the corresponding two vectors. We apply this method to build networks for fractional Brownian motions, whose long-range dependence is characterised by their Hurst exponent. We verify the validity of this method by showing that time series with stronger correlation, hence larger Hurst exponent, tend to have smaller fractal dimension, hence smoother sample paths. We then construct networks via the technique of horizontal visibility graph (HVG), which has been widely used recently. We confirm a known linear relationship between the Hurst exponent of fractional Brownian motion and the fractal dimension of the corresponding HVG network. In the first application, we apply our newly developed box-covering algorithm to calculate the generalized fractal dimensions of the HVG networks of fractional Brownian motions as well as those for binomial cascades and five bacterial genomes. The results confirm the monoscaling of fractional Brownian motion and the multifractality of the rest. As an additional application, we discuss the resilience of networks constructed from time series via two different approaches: visibility graph and horizontal visibility graph. Our finding is that the degree distribution of VG networks of fractional Brownian motions is scale-free (i.e., having a power law) meaning that one needs to destroy a large percentage of nodes before the network collapses into isolated parts; while for HVG networks of fractional Brownian motions, the degree distribution has exponential tails, implying that HVG networks would not survive the same kind of attack.

Melbourne and Brisbane: The Claims of Suburbs

This chapter critiques the imagined geography of creative cities and the creative industries, which presumes that inner cities are densely clustered hubs of urban culture and creativity while suburbs are dull, homogeneous dormitories from which creative people must escape in order to realize their potential. Drawing upon a study on creative industries workers in Melbourne and Brisbane, the authors argue that these workers are as likely to be located in the suburbs as in the inner city, and that they clearly identify advantages to being in outer suburban locations. Their findings provide a corrective to dominant urban cultural policy narratives that stress cultural amenity in the inner cities.

Robotics toolbox for MATLAB, release 9 [Software]

The ninth release of the Toolbox, represents over fifteen years of development and a substantial level of maturity. This version captures a large number of changes and extensions generated over the last two years which support my new book “Robotics, Vision & Control”. The Toolbox has always provided many functions that are useful for the study and simulation of classical arm-type robotics, for example such things as kinematics, dynamics, and trajectory generation. The Toolbox is based on a very general method of representing the kinematics and dynamics of serial-link manipulators. These parameters are encapsulated in MATLAB ® objects - robot objects can be created by the user for any serial-link manipulator and a number of examples are provided for well know robots such as the Puma 560 and the Stanford arm amongst others. The Toolbox also provides functions for manipulating and converting between datatypes such as vectors, homogeneous transformations and unit-quaternions which are necessary to represent 3-dimensional position and orientation. This ninth release of the Toolbox has been significantly extended to support mobile robots. For ground robots the Toolbox includes standard path planning algorithms (bug, distance transform, D*, PRM), kinodynamic planning (RRT), localization (EKF, particle filter), map building (EKF) and simultaneous localization and mapping (EKF), and a Simulink model a of non-holonomic vehicle. The Toolbox also including a detailed Simulink model for a quadcopter flying robot.