Barriers to recovery and recommendations for change: the Pennsylvania Consensus Conference on psychiatry\u27s role.

OBJECTIVE: Recovery has emerged over the past decade as a dominant theme in public mental health care. METHODS: The 2006 Pennsylvania Consensus Conference brought together 24 community psychiatrists to explore the barriers they experienced in promoting recovery and their recommendations for change. RESULTS: Twelve barriers were identified and classified into one of three categories: psychiatry knowledge, roles, and training; the need to transform public mental health systems and services; and environmental barriers to opportunity. Participants made 22 recommendations to address these barriers through changes in policies, programs, and psychiatric knowledge and practice. CONCLUSIONS: The recommendations identify areas for change that can be accomplished through individual psychiatrist action and organized group efforts

Information Agents for Pervasive Sensor Networks

In this paper, we describe an information agent, that resides on a mobile computer or personal digital assistant (PDA), that can autonomously acquire sensor readings from pervasive sensor networks (deciding when and which sensor to acquire readings from at any time). Moreover, it can perform a range of information processing tasks including modelling the accuracy of the sensor readings, predicting the value of missing sensor readings, and predicting how the monitored environmental parameters will evolve into the future. Our motivating scenario is the need to provide situational awareness support to first responders at the scene of a large scale incident, and we describe how we use an iterative formulation of a multi-output Gaussian process to build a probabilistic model of the environmental parameters being measured by local sensors, and the correlations and delays that exist between them. We validate our approach using data collected from a network of weather sensors located on the south coast of England

Towards Real-Time Information Processing of Sensor Network Data using Computationally Efficient Multi-output Gaussian Processes

In this paper, we describe a novel, computationally efficient algorithm that facilitates the autonomous acquisition of readings from sensor networks (deciding when and which sensor to acquire readings from at any time), and which can, with minimal domain knowledge, perform a range of information processing tasks including modelling the accuracy of the sensor readings, predicting the value of missing sensor readings, and predicting how the monitored environmental variables will evolve into the future. Our motivating scenario is the need to provide situational awareness support to first responders at the scene of a large scale incident, and to this end, we describe a novel iterative formulation of a multi-output Gaussian process that can build and exploit a probabilistic model of the environmental variables being measured (including the correlations and delays that exist between them). We validate our approach using data collected from a network of weather sensors located on the south coast of England

RANKL increases the level of Mcl-1 in osteoclasts and reduces bisphosphonate-induced osteoclast apoptosis in vitro

Peer reviewedPublisher PD

Summary of a Crew-Centered Flight Deck Design Philosophy for High-Speed Civil Transport (HSCT) Aircraft

Past flight deck design practices used within the U.S. commercial transport aircraft industry have been highly successful in producing safe and efficient aircraft. However, recent advances in automation have changed the way pilots operate aircraft, and these changes make it necessary to reconsider overall flight deck design. Automated systems have become more complex and numerous, and often their inner functioning is partially or fully opaque to the flight crew. Recent accidents and incidents involving autoflight system mode awareness Dornheim, 1995) are an example. This increase in complexity raises pilot concerns about the trustworthiness of automation, and makes it difficult for the crew to be aware of all the intricacies of operation that may impact safe flight. While pilots remain ultimately responsible for mission success, performance of flight deck tasks has been more widely distributed across human and automated resources. Advances in sensor and data integration technologies now make far more information available than may be prudent to present to the flight crew

Graph algorithms for machine learning: a case-control study based on prostate cancer populations and high throughput transcriptomic data

Background The continuing proliferation of high-throughput biological data promises to revolutionize personalized medicine. Confirming the presence or absence of disease is an important goal. In this study, we seek to identify genes, gene products and biological pathways that are crucial to human health, with prostate cancer chosen as the target disease. Materials and methods Using case-control transcriptomic data, we devise a graph theoretical toolkit for this task. It employs both innovative algorithms and novel two-way correlations to pinpoint putative biomarkers that classify unknown samples as cancerous or normal. Results and conclusion Observed accuracy on real data suggests that we are able to achieve sensitivity of 92% and specificity of 91%

Mechanisms of osteopontin and CD44 as metastatic principles in prostate cancer cells

BACKGROUND: The expression level of osteopontin correlates with the metastatic potential of several tumors. Osteopontin is a well-characterized ligand for the αvβ3 integrin. The present study was undertaken to elucidate the possible role of osteopontin/αvβ3 signaling in prostate cancer cell migration. RESULTS: We generated stable prostate cancer cell (PC3) lines that over-express osteopontin (PC3/OPN), mutant OPN in the integrin binding-site (PC3/RGDΔRGA), and null for OPN (PC3/SiRNA). The following observations were made in PC3/OPN cells as compared with PC3 cells: 1) an increase in multinucleated giant cells and RANKL expression; 2) an increase in CD44 surface expression, interaction of CD44/MMP-9 on the cell surface, MMP-9 activity in the conditioned medium, and cell migration; 3) western blot analysis of concentrated conditioned medium exhibited equal levels of MMP-9 protein in all PC3 cells. However, zymography analysis demonstrated that the levels of MMP-9 activity in the conditioned media reflect the CD44 surface expression pattern of the PC3 cell lines; 4) although MMP-9 and MMP-2 are secreted by PC3 cells, only the secretion of MMP-9 is regulated by OPN expression. A strong down regulation of the above-mentioned processes was observed in PC3/OPN (RGA) and PC3/SiRNA cells. PC3/OPN cells treated with bisphosphonate (BP) reproduce the down-regulation observed in PC3/OPN (RGA) and PC3/SiRNA cells. CONCLUSION: Rho signaling plays a crucial role in CD44 surface expression. BPs inhibits the mevalonate pathway, which in turn, prevents the prenylation of a number of small GTPases. Attenuation of Rho GTPase activation by BPs may have contributed to the down regulation of cell surface CD44/MMP-9 interaction, MMP-9 activation/secretion, and cell migration. Taken together, these observations suggest that CD44 surface expression is an important event in the activation of MMP-9 and migration of prostate cancer cells. The various steps involved in the above mentioned signaling pathway and/or the molecules regulating the activation of MMP-9 are potential therapeutic target

Characteristics of Duplicate Records in OCLC's Online Union Catalog

Duplicate records in the Online Union Catalog of the OCLC Online Computer Library Center, Inc., were analyzed. Bibliographic elements comprise information found in one or more fields of a bibliographic record; e.g., the author element comprises the main and added author entry fields. Bibliographic element mismatches in duplicate record pairs were considered relative to the number of records in which each element was present. When a single element differed in a duplicate record pair, that element was most often publication date. This finding shows that a difference in the date of publication is not a reliable indicator of bibliographic uniqueness. General cataloging and data entry patterns such as variations in title transcription and form of name, typographical errors, mistagged fields, misplaced subfield codes, omissions, and inconsistencies between fixed and variable fields often caused records that were duplicates to appear different. These factors can make it extremely difficult for catalogers to retrieve existing bibliographic records and thus avoid creating duplicate records. They also prevent duplicate detection algorithms used for tape-loading records from achieving desired results. An awareness of particularly problematic bibliographic elements and general factors contributing to the creation of duplicate records should help catalogers identify and accept existing records more often. This awareness should also help to direct system designers in their development of more sensitive algorithms to be used for tape loading. The resulting general reduction in the number of duplicate records in union catalogs will be a major step toward increased cataloger productivity, user satisfaction, and overall online database quality

Flexible list colorings: Maximizing the number of requests satisfied

Flexible list coloring was introduced by Dvo\v{r}\'{a}k, Norin, and Postle in 2019. Suppose $0 \leq \epsilon \leq 1$, $G$ is a graph, $L$ is a list assignment for $G$, and $r$ is a function with non-empty domain $D\subseteq V(G)$ such that $r(v) \in L(v)$ for each $v \in D$ ($r$ is called a request of $L$). The triple $(G,L,r)$ is $\epsilon$-satisfiable if there exists a proper $L$-coloring $f$ of $G$ such that $f(v) = r(v)$ for at least $\epsilon|D|$ vertices in $D$. We say $G$ is $(k, \epsilon)$-flexible if $(G,L',r')$ is $\epsilon$-satisfiable whenever $L'$ is a $k$-assignment for $G$ and $r'$ is a request of $L'$. It was shown by Dvo\v{r}\'{a}k et al. that if $d+1$ is prime, $G$ is a $d$-degenerate graph, and $r$ is a request for $G$ with domain of size $1$, then $(G,L,r)$ is $1$-satisfiable whenever $L$ is a $(d+1)$-assignment. In this paper, we extend this result to all $d$ for bipartite $d$-degenerate graphs. The literature on flexible list coloring tends to focus on showing that for a fixed graph $G$ and $k \in \mathbb{N}$ there exists an $\epsilon > 0$ such that $G$ is $(k, \epsilon)$-flexible, but it is natural to try to find the largest possible $\epsilon$ for which $G$ is $(k,\epsilon)$-flexible. In this vein, we improve a result of Dvo\v{r}\'{a}k et al., by showing $d$-degenerate graphs are $(d+2, 1/2^{d+1})$-flexible. In pursuit of the largest $\epsilon$ for which a graph is $(k,\epsilon)$-flexible, we observe that a graph $G$ is not $(k, \epsilon)$-flexible for any $k$ if and only if $\epsilon > 1/ \rho(G)$, where $\rho(G)$ is the Hall ratio of $G$, and we initiate the study of the list flexibility number of a graph $G$, which is the smallest $k$ such that $G$ is $(k,1/ \rho(G))$-flexible. We study relationships and connections between the list flexibility number, list chromatic number, list packing number, and degeneracy of a graph.Comment: 19 page