Mentalizing Imagery Therapy: Theory and Case Series of Imagery and Mindfulness Techniques to Understand Self and Others

Facilitating mentalization, or the ability to understand mental states and their link to behavior, is increasingly viewed as a common mechanism of action across effective psychotherapies. Here we present an overview of a new set of contemplative psychotherapeutic techniques, Mentalizing Imagery Therapy (MIT), that uses guided imagery and mindfulness practices to facilitate mentalization. MIT aims to reduce negative psychological symptoms by stimulating an understanding of mental states and their links to behavior in self and others, including in challenging interpersonal situations. Case discussions of MIT in personality disordered and depressed patients are used to illustrate theoretical points and the specific practical benefits of MIT. We conclude that there are promising indications that the imagery and mindfulness practices of MIT, that are specifically targeted to facilitate insight in the context of attachment relationship challenges, may help to improve mentalization and reduce symptoms of depression and anxiety. Both in practice and with respect to its articulated goals, MIT promotes a distinct set of capacities from other mindfulness or compassion based therapies. Further research is required to determine the clinical efficacy of MIT in controlled trials

Transient fluctuation of the prosperity of firms in a network economy

The transient fluctuation of the prosperity of firms in a network economy is investigated with an abstract stochastic model. The model describes the profit which firms make when they sell materials to a firm which produces a product and the fixed cost expense to the firms to produce those materials and product. The formulae for this model are parallel to those for population dynamics. The swinging changes in the fluctuation in the transient state from the initial growth to the final steady state are the consequence of a topology-dependent time trial competition between the profitable interactions and expense. The firm in a sparse random network economy is more likely to go bankrupt than expected from the value of the limit of the fluctuation in the steady state, and there is a risk of failing to reach by far the less fluctuating steady state

Approximating Node-Weighted k-MST on Planar Graphs

We study the problem of finding a minimum weight connected subgraph spanning at least $k$ vertices on planar, node-weighted graphs. We give a (4+\eps)-approximation algorithm for this problem. We achieve this by utilizing the recent LMP primal-dual $3$-approximation for the node-weighted prize-collecting Steiner tree problem by Byrka et al (SWAT'16) and adopting an approach by Chudak et al. (Math.\ Prog.\ '04) regarding Lagrangian relaxation for the edge-weighted variant. In particular, we improve the procedure of picking additional vertices (tree merging procedure) given by Sadeghian (2013) by taking a constant number of recursive steps and utilizing the limited guessing procedure of Arora and Karakostas (Math.\ Prog.\ '06). More generally, our approach readily gives a (\nicefrac{4}{3}\cdot r+\eps)-approximation on any graph class where the algorithm of Byrka et al.\ for the prize-collecting version gives an $r$-approximation. We argue that this can be interpreted as a generalization of an analogous result by K\"onemann et al. (Algorithmica~'11) for partial cover problems. Together with a lower bound construction by Mestre (STACS'08) for partial cover this implies that our bound is essentially best possible among algorithms that utilize an LMP algorithm for the Lagrangian relaxation as a black box. In addition to that, we argue by a more involved lower bound construction that even using the LMP algorithm by Byrka et al.\ in a \emph{non-black-box} fashion could not beat the factor \nicefrac{4}{3}\cdot r when the tree merging step relies only on the solutions output by the LMP algorithm

SMART: Unique splitting-while-merging framework for gene clustering

Copyright @ 2014 Fa et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.Successful clustering algorithms are highly dependent on parameter settings. The clustering performance degrades significantly unless parameters are properly set, and yet, it is difficult to set these parameters a priori. To address this issue, in this paper, we propose a unique splitting-while-merging clustering framework, named “splitting merging awareness tactics” (SMART), which does not require any a priori knowledge of either the number of clusters or even the possible range of this number. Unlike existing self-splitting algorithms, which over-cluster the dataset to a large number of clusters and then merge some similar clusters, our framework has the ability to split and merge clusters automatically during the process and produces the the most reliable clustering results, by intrinsically integrating many clustering techniques and tasks. The SMART framework is implemented with two distinct clustering paradigms in two algorithms: competitive learning and finite mixture model. Nevertheless, within the proposed SMART framework, many other algorithms can be derived for different clustering paradigms. The minimum message length algorithm is integrated into the framework as the clustering selection criterion. The usefulness of the SMART framework and its algorithms is tested in demonstration datasets and simulated gene expression datasets. Moreover, two real microarray gene expression datasets are studied using this approach. Based on the performance of many metrics, all numerical results show that SMART is superior to compared existing self-splitting algorithms and traditional algorithms. Three main properties of the proposed SMART framework are summarized as: (1) needing no parameters dependent on the respective dataset or a priori knowledge about the datasets, (2) extendible to many different applications, (3) offering superior performance compared with counterpart algorithms.National Institute for Health Researc

Molecular Modeling Studies of 4,5-Dihydro-1H-pyrazolo[4,3-h] quinazoline Derivatives as Potent CDK2/Cyclin A Inhibitors Using 3D-QSAR and Docking

CDK2/cyclin A has appeared as an attractive drug targets over the years with diverse therapeutic potentials. A computational strategy based on comparative molecular fields analysis (CoMFA) and comparative molecular similarity indices analysis (CoMSIA) followed by molecular docking studies were performed on a series of 4,5-dihydro-1H-pyrazolo[4,3-h]quinazoline derivatives as potent CDK2/cyclin A inhibitors. The CoMFA and CoMSIA models, using 38 molecules in the training set, gave r2cv values of 0.747 and 0.518 and r2 values of 0.970 and 0.934, respectively. 3D contour maps generated by the CoMFA and CoMSIA models were used to identify the key structural requirements responsible for the biological activity. Molecular docking was applied to explore the binding mode between the ligands and the receptor. The information obtained from molecular modeling studies may be helpful to design novel inhibitors of CDK2/cyclin A with desired activity

Excitonic Photoluminescence properties of nanocrystalline GaSb and Ga0.62In0.38Sb embedded in silica films

The GaSb and Ga0.62In0.38Sb nanocrystals were embedded in the SiO2 films by radio-frequency magnetron co-sputtering and were grown on GaSb and Si substrates at different temperatures. We present results on the 10K excitonic photoluminescence (PL) properties of nanocrystalline GaSb and Ga0.62In0.38Sb as a function of their size. The measurements show that the PL of the GaSb and Ga0.62In0.38Sb nanocrystallites follows the quantum confinement model very closely. By using deconvolution of PL spectra, origins of structures in photoluminescence were identified.Comment: 20 pages, 7 figures Submitted to Journal of Luminescenc

SaS-BCI: A New Strategy to Predict Image Memorability and use Mental Imagery as a Brain-Based Biometric Authentication

Security authentication is one of the most important levels of information security. Nowadays, human biometric techniques are the most secure methods for authentication purposes that cover the problems of older types of authentication like passwords and pins. There are many advantages of recent biometrics in terms of security; however, they still have some disadvantages. Progresses in technology made some specific devices, which make it possible to copy and make a fake human biometric because they are all visible and touchable. According to this matter, there is a need for a new biometric to cover the issues of other types. Brainwave is human data, which uses them as a new type of security authentication that has engaged many researchers. There are some research and experiments, which are investigating and testing EEG signals to find the uniqueness of human brainwave. Some researchers achieved high accuracy rates in this area by applying different signal acquisition techniques, feature extraction and classifications using Brain–Computer Interface (BCI). One of the important parts of any BCI processes is the way that brainwaves could be acquired and recorded. A new Signal Acquisition Strategy is presented in this paper for the process of authorization and authentication of brain signals specifically. This is to predict image memorability from the user’s brain to use mental imagery as a visualization pattern for security authentication. Therefore, users can authenticate themselves with visualizing a specific picture in their minds. In conclusion, we can see that brainwaves can be different according to the mental tasks, which it would make it harder using them for authentication process. There are many signal acquisition strategies and signal processing for brain-based authentication that by using the right methods, a higher level of accuracy rate could be achieved which is suitable for using brain signal as another biometric security authentication

Automatic Network Fingerprinting through Single-Node Motifs

Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs---a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.Comment: 16 pages (4 figures) plus supporting information 8 pages (5 figures

The use of phylogeny to interpret cross-cultural patterns in plant use and guide medicinal plant discovery: an example from Pterocarpus (Leguminosae)

The study of traditional knowledge of medicinal plants has led to discoveries that have helped combat diseases and improve healthcare. However, the development of quantitative measures that can assist our quest for new medicinal plants has not greatly advanced in recent years. Phylogenetic tools have entered many scientific fields in the last two decades to provide explanatory power, but have been overlooked in ethnomedicinal studies. Several studies show that medicinal properties are not randomly distributed in plant phylogenies, suggesting that phylogeny shapes ethnobotanical use. Nevertheless, empirical studies that explicitly combine ethnobotanical and phylogenetic information are scarce.In this study, we borrowed tools from community ecology phylogenetics to quantify significance of phylogenetic signal in medicinal properties in plants and identify nodes on phylogenies with high bioscreening potential. To do this, we produced an ethnomedicinal review from extensive literature research and a multi-locus phylogenetic hypothesis for the pantropical genus Pterocarpus (Leguminosae: Papilionoideae). We demonstrate that species used to treat a certain conditions, such as malaria, are significantly phylogenetically clumped and we highlight nodes in the phylogeny that are significantly overabundant in species used to treat certain conditions. These cross-cultural patterns in ethnomedicinal usage in Pterocarpus are interpreted in the light of phylogenetic relationships.This study provides techniques that enable the application of phylogenies in bioscreening, but also sheds light on the processes that shape cross-cultural ethnomedicinal patterns. This community phylogenetic approach demonstrates that similar ethnobotanical uses can arise in parallel in different areas where related plants are available. With a vast amount of ethnomedicinal and phylogenetic information available, we predict that this field, after further refinement of the techniques, will expand into similar research areas, such as pest management or the search for bioactive plant-based compounds

Risk factors for revision after shoulder arthroplasty: 1,825 shoulder arthroplasties from the Norwegian Arthroplasty Register

Background and purpose Previous studies on shoulder arthroplasty have usually described small patient populations, and few articles have addressed the survival of shoulder implants. We describe the results of shoulder replacement in the Norwegian population (of 4.7 million) during a 12-year period. Trends in the use of shoulder arthroplasty during the study period were also investigated