Stages of psychotherapy: Progressive reconceptualizations as a self-organizing process.

Presents psychotherapy as a process of progressive cognitive reframing leading the individual to higher levels of self-organization. The crucial successive reconceptualizations that are achieved during the process refer to the way the person in therapy perceives oneself in relation to others and to life in general and constitute distinctive steps that are referred to as stages. Successive shifts in the client's frame of mind achieved during the process are inherently connected to a series of crucial decisions that enable therapy to remain goal directed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Enumerating Minimal Subset Feedback Vertex Sets

The Subset Feedback Vertex Set problem takes as input a pair (G,S), where G=(V,E) is a graph with weights on its vertices, and S?V. The task is to find a set of vertices of total minimum weight to be removed from G, such that in the remaining graph no cycle contains a vertex of S. We show that this problem can be solved in time O(1.8638 ⁿ ), where n=|V|. This is a consequence of the main result of this paper, namely that all minimal subset feedback vertex sets of a graph can be enumerated in time O(1.8638 ⁿ ).     

MiR-205 Is Progressively Down-Regulated in Lymph Node Metastasis but Fails as a Prognostic Biomarker in High-Risk Prostate Cancer

The treatment of high-risk prostate cancer (HRPCa) is a tremendous challenge for uro-oncologists. The identification of predictive moleculobiological markers allowing risk assessment of lymph node metastasis and systemic progression is essential in establishing effective treatment. In the current study, we investigate the prognostic potential of miR-205 in HRPCa study and validation cohorts, setting defined clinical endpoints for both. We demonstrate miR-205 to be significantly down-regulated in over 70% of the HRPCa samples analysed and that reconstitution of miR-205 causes inhibition of proliferation and invasiveness in prostate cancer (PCa) cell lines. Additionally, miR-205 is increasingly down-regulated in lymph node metastases compared to the primary tumour indicating that miR-205 plays a role in migration of PCa cells from the original location into extraprostatic tissue. Nevertheless, down-regulation of miR-205 in primary PCa was not correlated to the synchronous presence of metastasis and failed to predict the outcome for HRPCa patients. Moreover, we found a tendency for miR-205 up-regulation to correlate with an adverse outcome of PCa patients suggesting a pivotal role of miR-205 in tumourigenesis. Overall, we showed that miR-205 is involved in the development and metastasis of PCa, but failed to work as a useful clinical biomarker in HRPCa. These findings might have implications for the use of miR-205 as a prognostic or therapeutic target in HRPCa.     

优越的场所:美国城市中的种族、不平衡发展和机会的分布

本文揭示了坏社区的根源及其给本社区及其所在区域居民带来的代价,并跟踪了近期不平衡的大城市发展格局、造成这些格局的社会力量以及这些格局所带来的恶果和潜在的对策.文章证明了城市蔓延、贫困集中度和种族隔离的交织过程,如何影响了美国城市和大都市地区的人口所面临的机会结构.在承认个人选择和人力资本的作用同时,文章更关注公共政策决策和相关的私营部门活动以及它们如何决定了场所和种族对大都市区机会结构的影响.最后,文章探索了各种可以用来切断美国城市社区场所、种族和权利之间联系的备选政策.     

Solid-State Joining of Dissimilar Ni-Based Superalloys via Field-Assisted Sintering Technology for Turbine Applications

Metallurgical and Materials Transactions A - Friction welding or electron/laser beam welding of nickel superalloys compromises the microstructure with localized melting and heat-affected zones...     

User-centered system design for assisted navigation of visually impaired individuals in outdoor cultural environments

Universal Access in the Information Society - The marginalization of people with disabilities, such as visually impaired individuals (VIIs), has driven scientists to take advantage of the fast...     

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions

We study graph properties that admit an increasing, or equivalently decreasing, sequence of graphs on the same vertex set such that for any two consecutive graphs in the sequence their difference is a single edge. This is useful for characterizing and computing minimal completions and deletions of arbitrary graphs into having these properties. We prove that threshold graphs and chain graphs admit such sequences. Based on this characterization and other structural properties, we present linear-time algorithms both for computing minimal completions and deletions into threshold, chain, and bipartite graphs, and for extracting a minimal completion or deletion from a given completion or deletion. Minimum completions and deletions into these classes are NP-hard to compute.